model_brush.c

   1 /*
   2 Copyright (C) 1996-1997 Id Software, Inc.
   3
   4 This program is free software; you can redistribute it and/or
   5 modify it under the terms of the GNU General Public License
   6 as published by the Free Software Foundation; either version 2
   7 of the License, or (at your option) any later version.
   8
   9 This program is distributed in the hope that it will be useful,
  10 but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  12
  13 See the GNU General Public License for more details.
  14
  15 You should have received a copy of the GNU General Public License
  16 along with this program; if not, write to the Free Software
  17 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
  18
  19 */
  20
  21 #include "quakedef.h"
  22 #include "image.h"
  23 #include "r_shadow.h"
  24 #include "polygon.h"
  25 #include "curves.h"
  26 #include "wad.h"
  27
  28
  29 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128"};
  30 cvar_t halflifebsp = {0, "halflifebsp", "0"};
  31 cvar_t mcbsp = {0, "mcbsp", "0"};
  32 cvar_t r_novis = {0, "r_novis", "0"};
  33 cvar_t r_miplightmaps = {CVAR_SAVE, "r_miplightmaps", "0"};
  34 cvar_t r_lightmaprgba = {0, "r_lightmaprgba", "1"};
  35 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0"};
  36 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4"};
  37 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "1"};
  38 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024"};
  39 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536"};
  40 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15"};
  41 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "1"};
  42 cvar_t r_subdivisions_collision_maxtess = {0, "r_subdivisions_collision_maxtess", "1024"};
  43 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225"};
  44 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1"};
  45 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1"};
  46 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0"};
  47
  48 void Mod_BrushInit(void)
  49 {
  50 //      Cvar_RegisterVariable(&r_subdivide_size);
  51         Cvar_RegisterVariable(&halflifebsp);
  52         Cvar_RegisterVariable(&mcbsp);
  53         Cvar_RegisterVariable(&r_novis);
  54         Cvar_RegisterVariable(&r_miplightmaps);
  55         Cvar_RegisterVariable(&r_lightmaprgba);
  56         Cvar_RegisterVariable(&r_nosurftextures);
  57         Cvar_RegisterVariable(&r_subdivisions_tolerance);
  58         Cvar_RegisterVariable(&r_subdivisions_mintess);
  59         Cvar_RegisterVariable(&r_subdivisions_maxtess);
  60         Cvar_RegisterVariable(&r_subdivisions_maxvertices);
  61         Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
  62         Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
  63         Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
  64         Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
  65         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
  66         Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
  67         Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
  68 }
  69
  70 static mleaf_t *Mod_Q1BSP_PointInLeaf(model_t *model, const vec3_t p)
  71 {
  72         mnode_t *node;
  73
  74         if (model == NULL)
  75                 return NULL;
  76
  77         Mod_CheckLoaded(model);
  78
  79         // LordHavoc: modified to start at first clip node,
  80         // in other words: first node of the (sub)model
  81         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
  82         while (node->plane)
  83                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
  84
  85         return (mleaf_t *)node;
  86 }
  87
  88 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(model_t *model, const vec3_t p, qbyte *out, int outsize)
  89 {
  90         int i;
  91         mleaf_t *leaf;
  92         leaf = Mod_Q1BSP_PointInLeaf(model, p);
  93         if (leaf)
  94         {
  95                 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
  96                 if (i)
  97                 {
  98                         memcpy(out, leaf->ambient_sound_level, i);
  99                         out += i;
 100                         outsize -= i;
 101                 }
 102         }
 103         if (outsize)
 104                 memset(out, 0, outsize);
 105 }
 106
 107 static int Mod_Q1BSP_BoxTouchingPVS(model_t *model, const qbyte *pvs, const vec3_t mins, const vec3_t maxs)
 108 {
 109         int clusterindex, side, nodestackindex = 0;
 110         mnode_t *node, *nodestack[1024];
 111         if (!model->brush.num_pvsclusters)
 112                 return true;
 113         node = model->brush.data_nodes;
 114         for (;;)
 115         {
 116                 if (node->plane)
 117                 {
 118                         // node - recurse down the BSP tree
 119                         side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
 120                         if (side < 2)
 121                         {
 122                                 // box is on one side of plane, take that path
 123                                 node = node->children[side];
 124                         }
 125                         else
 126                         {
 127                                 // box crosses plane, take one path and remember the other
 128                                 if (nodestackindex < 1024)
 129                                         nodestack[nodestackindex++] = node->children[0];
 130                                 node = node->children[1];
 131                         }
 132                 }
 133                 else
 134                 {
 135                         // leaf - check cluster bit
 136                         clusterindex = ((mleaf_t *)node)->clusterindex;
 137                         if (CHECKPVSBIT(pvs, clusterindex))
 138                         {
 139                                 // it is visible, return immediately with the news
 140                                 return true;
 141                         }
 142                         else
 143                         {
 144                                 // nothing to see here, try another path we didn't take earlier
 145                                 if (nodestackindex == 0)
 146                                         break;
 147                                 node = nodestack[--nodestackindex];
 148                         }
 149                 }
 150         }
 151         // it is not visible
 152         return false;
 153 }
 154
 155 static int Mod_Q1BSP_BoxTouchingLeafPVS(model_t *model, const qbyte *pvs, const vec3_t mins, const vec3_t maxs)
 156 {
 157         int clusterindex, side, nodestackindex = 0;
 158         mnode_t *node, *nodestack[1024];
 159         if (!model->brush.num_leafs)
 160                 return true;
 161         node = model->brush.data_nodes;
 162         for (;;)
 163         {
 164                 if (node->plane)
 165                 {
 166                         // node - recurse down the BSP tree
 167                         side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
 168                         if (side < 2)
 169                         {
 170                                 // box is on one side of plane, take that path
 171                                 node = node->children[side];
 172                         }
 173                         else
 174                         {
 175                                 // box crosses plane, take one path and remember the other
 176                                 if (nodestackindex < 1024)
 177                                         nodestack[nodestackindex++] = node->children[0];
 178                                 node = node->children[1];
 179                         }
 180                 }
 181                 else
 182                 {
 183                         // leaf - check cluster bit
 184                         clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
 185                         if (CHECKPVSBIT(pvs, clusterindex))
 186                         {
 187                                 // it is visible, return immediately with the news
 188                                 return true;
 189                         }
 190                         else
 191                         {
 192                                 // nothing to see here, try another path we didn't take earlier
 193                                 if (nodestackindex == 0)
 194                                         break;
 195                                 node = nodestack[--nodestackindex];
 196                         }
 197                 }
 198         }
 199         // it is not visible
 200         return false;
 201 }
 202
 203 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(model_t *model, const qbyte *visibleleafs, const vec3_t mins, const vec3_t maxs)
 204 {
 205         int side, nodestackindex = 0;
 206         mnode_t *node, *nodestack[1024];
 207         node = model->brush.data_nodes;
 208         for (;;)
 209         {
 210                 if (node->plane)
 211                 {
 212                         // node - recurse down the BSP tree
 213                         side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
 214                         if (side < 2)
 215                         {
 216                                 // box is on one side of plane, take that path
 217                                 node = node->children[side];
 218                         }
 219                         else
 220                         {
 221                                 // box crosses plane, take one path and remember the other
 222                                 if (nodestackindex < 1024)
 223                                         nodestack[nodestackindex++] = node->children[0];
 224                                 node = node->children[1];
 225                         }
 226                 }
 227                 else
 228                 {
 229                         // leaf - check if it is visible
 230                         if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
 231                         {
 232                                 // it is visible, return immediately with the news
 233                                 return true;
 234                         }
 235                         else
 236                         {
 237                                 // nothing to see here, try another path we didn't take earlier
 238                                 if (nodestackindex == 0)
 239                                         break;
 240                                 node = nodestack[--nodestackindex];
 241                         }
 242                 }
 243         }
 244         // it is not visible
 245         return false;
 246 }
 247
 248 typedef struct findnonsolidlocationinfo_s
 249 {
 250         vec3_t center;
 251         vec_t radius;
 252         vec3_t nudge;
 253         vec_t bestdist;
 254         model_t *model;
 255 }
 256 findnonsolidlocationinfo_t;
 257
 258 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
 259 {
 260         int i, surfacenum, k, *tri, *mark;
 261         float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
 262         msurface_t *surface;
 263         for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
 264         {
 265                 surface = info->model->data_surfaces + *mark;
 266                 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
 267                 {
 268                         for (k = 0;k < surface->num_triangles;k++)
 269                         {
 270                                 tri = (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle) + k * 3;
 271                                 VectorCopy((surface->groupmesh->data_vertex3f + tri[0] * 3), vert[0]);
 272                                 VectorCopy((surface->groupmesh->data_vertex3f + tri[1] * 3), vert[1]);
 273                                 VectorCopy((surface->groupmesh->data_vertex3f + tri[2] * 3), vert[2]);
 274                                 VectorSubtract(vert[1], vert[0], edge[0]);
 275                                 VectorSubtract(vert[2], vert[1], edge[1]);
 276                                 CrossProduct(edge[1], edge[0], facenormal);
 277                                 if (facenormal[0] || facenormal[1] || facenormal[2])
 278                                 {
 279                                         VectorNormalize(facenormal);
 280                                         f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 281                                         if (f <= info->bestdist && f >= -info->bestdist)
 282                                         {
 283                                                 VectorSubtract(vert[0], vert[2], edge[2]);
 284                                                 VectorNormalize(edge[0]);
 285                                                 VectorNormalize(edge[1]);
 286                                                 VectorNormalize(edge[2]);
 287                                                 CrossProduct(facenormal, edge[0], edgenormal[0]);
 288                                                 CrossProduct(facenormal, edge[1], edgenormal[1]);
 289                                                 CrossProduct(facenormal, edge[2], edgenormal[2]);
 290                                                 // face distance
 291                                                 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
 292                                                  && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
 293                                                  && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
 294                                                 {
 295                                                         // we got lucky, the center is within the face
 296                                                         dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 297                                                         if (dist < 0)
 298                                                         {
 299                                                                 dist = -dist;
 300                                                                 if (info->bestdist > dist)
 301                                                                 {
 302                                                                         info->bestdist = dist;
 303                                                                         VectorScale(facenormal, (info->radius - -dist), info->nudge);
 304                                                                 }
 305                                                         }
 306                                                         else
 307                                                         {
 308                                                                 if (info->bestdist > dist)
 309                                                                 {
 310                                                                         info->bestdist = dist;
 311                                                                         VectorScale(facenormal, (info->radius - dist), info->nudge);
 312                                                                 }
 313                                                         }
 314                                                 }
 315                                                 else
 316                                                 {
 317                                                         // check which edge or vertex the center is nearest
 318                                                         for (i = 0;i < 3;i++)
 319                                                         {
 320                                                                 f = DotProduct(info->center, edge[i]);
 321                                                                 if (f >= DotProduct(vert[0], edge[i])
 322                                                                  && f <= DotProduct(vert[1], edge[i]))
 323                                                                 {
 324                                                                         // on edge
 325                                                                         VectorMA(info->center, -f, edge[i], point);
 326                                                                         dist = sqrt(DotProduct(point, point));
 327                                                                         if (info->bestdist > dist)
 328                                                                         {
 329                                                                                 info->bestdist = dist;
 330                                                                                 VectorScale(point, (info->radius / dist), info->nudge);
 331                                                                         }
 332                                                                         // skip both vertex checks
 333                                                                         // (both are further away than this edge)
 334                                                                         i++;
 335                                                                 }
 336                                                                 else
 337                                                                 {
 338                                                                         // not on edge, check first vertex of edge
 339                                                                         VectorSubtract(info->center, vert[i], point);
 340                                                                         dist = sqrt(DotProduct(point, point));
 341                                                                         if (info->bestdist > dist)
 342                                                                         {
 343                                                                                 info->bestdist = dist;
 344                                                                                 VectorScale(point, (info->radius / dist), info->nudge);
 345                                                                         }
 346                                                                 }
 347                                                         }
 348                                                 }
 349                                         }
 350                                 }
 351                         }
 352                 }
 353         }
 354 }
 355
 356 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
 357 {
 358         if (node->plane)
 359         {
 360                 float f = PlaneDiff(info->center, node->plane);
 361                 if (f >= -info->bestdist)
 362                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
 363                 if (f <= info->bestdist)
 364                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
 365         }
 366         else
 367         {
 368                 if (((mleaf_t *)node)->numleafsurfaces)
 369                         Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
 370         }
 371 }
 372
 373 static void Mod_Q1BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, float radius)
 374 {
 375         int i;
 376         findnonsolidlocationinfo_t info;
 377         if (model == NULL)
 378         {
 379                 VectorCopy(in, out);
 380                 return;
 381         }
 382         VectorCopy(in, info.center);
 383         info.radius = radius;
 384         info.model = model;
 385         i = 0;
 386         do
 387         {
 388                 VectorClear(info.nudge);
 389                 info.bestdist = radius;
 390                 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
 391                 VectorAdd(info.center, info.nudge, info.center);
 392         }
 393         while (info.bestdist < radius && ++i < 10);
 394         VectorCopy(info.center, out);
 395 }
 396
 397 int Mod_Q1BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
 398 {
 399         switch(nativecontents)
 400         {
 401                 case CONTENTS_EMPTY:
 402                         return 0;
 403                 case CONTENTS_SOLID:
 404                         return SUPERCONTENTS_SOLID;
 405                 case CONTENTS_WATER:
 406                         return SUPERCONTENTS_WATER;
 407                 case CONTENTS_SLIME:
 408                         return SUPERCONTENTS_SLIME;
 409                 case CONTENTS_LAVA:
 410                         return SUPERCONTENTS_LAVA;
 411                 case CONTENTS_SKY:
 412                         return SUPERCONTENTS_SKY;
 413         }
 414         return 0;
 415 }
 416
 417 int Mod_Q1BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
 418 {
 419         if (supercontents & SUPERCONTENTS_SOLID)
 420                 return CONTENTS_SOLID;
 421         if (supercontents & SUPERCONTENTS_SKY)
 422                 return CONTENTS_SKY;
 423         if (supercontents & SUPERCONTENTS_LAVA)
 424                 return CONTENTS_LAVA;
 425         if (supercontents & SUPERCONTENTS_SLIME)
 426                 return CONTENTS_SLIME;
 427         if (supercontents & SUPERCONTENTS_WATER)
 428                 return CONTENTS_WATER;
 429         return CONTENTS_EMPTY;
 430 }
 431
 432 typedef struct
 433 {
 434         // the hull we're tracing through
 435         const hull_t *hull;
 436
 437         // the trace structure to fill in
 438         trace_t *trace;
 439
 440         // start, end, and end - start (in model space)
 441         double start[3];
 442         double end[3];
 443         double dist[3];
 444 }
 445 RecursiveHullCheckTraceInfo_t;
 446
 447 // 1/32 epsilon to keep floating point happy
 448 #define DIST_EPSILON (0.03125)
 449
 450 #define HULLCHECKSTATE_EMPTY 0
 451 #define HULLCHECKSTATE_SOLID 1
 452 #define HULLCHECKSTATE_DONE 2
 453
 454 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
 455 {
 456         // status variables, these don't need to be saved on the stack when
 457         // recursing...  but are because this should be thread-safe
 458         // (note: tracing against a bbox is not thread-safe, yet)
 459         int ret;
 460         mplane_t *plane;
 461         double t1, t2;
 462
 463         // variables that need to be stored on the stack when recursing
 464         dclipnode_t *node;
 465         int side;
 466         double midf, mid[3];
 467
 468         // LordHavoc: a goto!  everyone flee in terror... :)
 469 loc0:
 470         // check for empty
 471         if (num < 0)
 472         {
 473                 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
 474                 if (!t->trace->startfound)
 475                 {
 476                         t->trace->startfound = true;
 477                         t->trace->startsupercontents |= num;
 478                 }
 479                 if (num & SUPERCONTENTS_LIQUIDSMASK)
 480                         t->trace->inwater = true;
 481                 if (num == 0)
 482                         t->trace->inopen = true;
 483                 if (num & t->trace->hitsupercontentsmask)
 484                 {
 485                         // if the first leaf is solid, set startsolid
 486                         if (t->trace->allsolid)
 487                                 t->trace->startsolid = true;
 488 #if COLLISIONPARANOID >= 3
 489                         Con_Print("S");
 490 #endif
 491                         return HULLCHECKSTATE_SOLID;
 492                 }
 493                 else
 494                 {
 495                         t->trace->allsolid = false;
 496 #if COLLISIONPARANOID >= 3
 497                         Con_Print("E");
 498 #endif
 499                         return HULLCHECKSTATE_EMPTY;
 500                 }
 501         }
 502
 503         // find the point distances
 504         node = t->hull->clipnodes + num;
 505
 506         plane = t->hull->planes + node->planenum;
 507         if (plane->type < 3)
 508         {
 509                 t1 = p1[plane->type] - plane->dist;
 510                 t2 = p2[plane->type] - plane->dist;
 511         }
 512         else
 513         {
 514                 t1 = DotProduct (plane->normal, p1) - plane->dist;
 515                 t2 = DotProduct (plane->normal, p2) - plane->dist;
 516         }
 517
 518         if (t1 < 0)
 519         {
 520                 if (t2 < 0)
 521                 {
 522 #if COLLISIONPARANOID >= 3
 523                         Con_Print("<");
 524 #endif
 525                         num = node->children[1];
 526                         goto loc0;
 527                 }
 528                 side = 1;
 529         }
 530         else
 531         {
 532                 if (t2 >= 0)
 533                 {
 534 #if COLLISIONPARANOID >= 3
 535                         Con_Print(">");
 536 #endif
 537                         num = node->children[0];
 538                         goto loc0;
 539                 }
 540                 side = 0;
 541         }
 542
 543         // the line intersects, find intersection point
 544         // LordHavoc: this uses the original trace for maximum accuracy
 545 #if COLLISIONPARANOID >= 3
 546         Con_Print("M");
 547 #endif
 548         if (plane->type < 3)
 549         {
 550                 t1 = t->start[plane->type] - plane->dist;
 551                 t2 = t->end[plane->type] - plane->dist;
 552         }
 553         else
 554         {
 555                 t1 = DotProduct (plane->normal, t->start) - plane->dist;
 556                 t2 = DotProduct (plane->normal, t->end) - plane->dist;
 557         }
 558
 559         midf = t1 / (t1 - t2);
 560         midf = bound(p1f, midf, p2f);
 561         VectorMA(t->start, midf, t->dist, mid);
 562
 563         // recurse both sides, front side first
 564         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
 565         // if this side is not empty, return what it is (solid or done)
 566         if (ret != HULLCHECKSTATE_EMPTY)
 567                 return ret;
 568
 569         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
 570         // if other side is not solid, return what it is (empty or done)
 571         if (ret != HULLCHECKSTATE_SOLID)
 572                 return ret;
 573
 574         // front is air and back is solid, this is the impact point...
 575         if (side)
 576         {
 577                 t->trace->plane.dist = -plane->dist;
 578                 VectorNegate (plane->normal, t->trace->plane.normal);
 579         }
 580         else
 581         {
 582                 t->trace->plane.dist = plane->dist;
 583                 VectorCopy (plane->normal, t->trace->plane.normal);
 584         }
 585
 586         // calculate the true fraction
 587         t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
 588         t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
 589         midf = t1 / (t1 - t2);
 590         t->trace->realfraction = bound(0, midf, 1);
 591
 592         // calculate the return fraction which is nudged off the surface a bit
 593         midf = (t1 - DIST_EPSILON) / (t1 - t2);
 594         t->trace->fraction = bound(0, midf, 1);
 595
 596 #if COLLISIONPARANOID >= 3
 597         Con_Print("D");
 598 #endif
 599         return HULLCHECKSTATE_DONE;
 600 }
 601
 602 #if COLLISIONPARANOID < 2
 603 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
 604 {
 605         while (num >= 0)
 606                 num = t->hull->clipnodes[num].children[(t->hull->planes[t->hull->clipnodes[num].planenum].type < 3 ? t->start[t->hull->planes[t->hull->clipnodes[num].planenum].type] : DotProduct(t->hull->planes[t->hull->clipnodes[num].planenum].normal, t->start)) < t->hull->planes[t->hull->clipnodes[num].planenum].dist];
 607         num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
 608         t->trace->startsupercontents |= num;
 609         if (num & SUPERCONTENTS_LIQUIDSMASK)
 610                 t->trace->inwater = true;
 611         if (num == 0)
 612                 t->trace->inopen = true;
 613         if (num & t->trace->hitsupercontentsmask)
 614         {
 615                 t->trace->allsolid = t->trace->startsolid = true;
 616                 return HULLCHECKSTATE_SOLID;
 617         }
 618         else
 619         {
 620                 t->trace->allsolid = t->trace->startsolid = false;
 621                 return HULLCHECKSTATE_EMPTY;
 622         }
 623 }
 624 #endif
 625
 626 static void Mod_Q1BSP_TraceBox(struct model_s *model, int frame, trace_t *trace, const vec3_t boxstartmins, const vec3_t boxstartmaxs, const vec3_t boxendmins, const vec3_t boxendmaxs, int hitsupercontentsmask)
 627 {
 628         // this function currently only supports same size start and end
 629         double boxsize[3];
 630         RecursiveHullCheckTraceInfo_t rhc;
 631
 632         memset(&rhc, 0, sizeof(rhc));
 633         memset(trace, 0, sizeof(trace_t));
 634         rhc.trace = trace;
 635         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 636         rhc.trace->fraction = 1;
 637         rhc.trace->realfraction = 1;
 638         rhc.trace->allsolid = true;
 639         VectorSubtract(boxstartmaxs, boxstartmins, boxsize);
 640         if (boxsize[0] < 3)
 641                 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
 642         else if (model->brush.ismcbsp)
 643         {
 644                 if (boxsize[2] < 48) // pick the nearest of 40 or 56
 645                         rhc.hull = &model->brushq1.hulls[2]; // 16x16x40
 646                 else
 647                         rhc.hull = &model->brushq1.hulls[1]; // 16x16x56
 648         }
 649         else if (model->brush.ishlbsp)
 650         {
 651                 // LordHavoc: this has to have a minor tolerance (the .1) because of
 652                 // minor float precision errors from the box being transformed around
 653                 if (boxsize[0] < 32.1)
 654                 {
 655                         if (boxsize[2] < 54) // pick the nearest of 36 or 72
 656                                 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
 657                         else
 658                                 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
 659                 }
 660                 else
 661                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
 662         }
 663         else
 664         {
 665                 // LordHavoc: this has to have a minor tolerance (the .1) because of
 666                 // minor float precision errors from the box being transformed around
 667                 if (boxsize[0] < 32.1)
 668                         rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
 669                 else
 670                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
 671         }
 672         VectorSubtract(boxstartmins, rhc.hull->clip_mins, rhc.start);
 673         VectorSubtract(boxendmins, rhc.hull->clip_mins, rhc.end);
 674         VectorSubtract(rhc.end, rhc.start, rhc.dist);
 675 #if COLLISIONPARANOID >= 2
 676         Con_Printf("t(%f %f %f,%f %f %f,%i %f %f %f)", rhc.start[0], rhc.start[1], rhc.start[2], rhc.end[0], rhc.end[1], rhc.end[2], rhc.hull - model->brushq1.hulls, rhc.hull->clip_mins[0], rhc.hull->clip_mins[1], rhc.hull->clip_mins[2]);
 677         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 678         Con_Print("\n");
 679 #else
 680         if (DotProduct(rhc.dist, rhc.dist))
 681                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 682         else
 683                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 684 #endif
 685 }
 686
 687 void Collision_ClipTrace_Box(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, const vec3_t mins, const vec3_t maxs, const vec3_t end, int hitsupercontentsmask, int boxsupercontents)
 688 {
 689 #if 1
 690         colbrushf_t cbox;
 691         colplanef_t cbox_planes[6];
 692         cbox.supercontents = boxsupercontents;
 693         cbox.numplanes = 6;
 694         cbox.numpoints = 0;
 695         cbox.numtriangles = 0;
 696         cbox.planes = cbox_planes;
 697         cbox.points = NULL;
 698         cbox.elements = NULL;
 699         cbox.markframe = 0;
 700         cbox.mins[0] = 0;
 701         cbox.mins[1] = 0;
 702         cbox.mins[2] = 0;
 703         cbox.maxs[0] = 0;
 704         cbox.maxs[1] = 0;
 705         cbox.maxs[2] = 0;
 706         cbox_planes[0].normal[0] =  1;cbox_planes[0].normal[1] =  0;cbox_planes[0].normal[2] =  0;cbox_planes[0].dist = cmaxs[0] - mins[0];
 707         cbox_planes[1].normal[0] = -1;cbox_planes[1].normal[1] =  0;cbox_planes[1].normal[2] =  0;cbox_planes[1].dist = maxs[0] - cmins[0];
 708         cbox_planes[2].normal[0] =  0;cbox_planes[2].normal[1] =  1;cbox_planes[2].normal[2] =  0;cbox_planes[2].dist = cmaxs[1] - mins[1];
 709         cbox_planes[3].normal[0] =  0;cbox_planes[3].normal[1] = -1;cbox_planes[3].normal[2] =  0;cbox_planes[3].dist = maxs[1] - cmins[1];
 710         cbox_planes[4].normal[0] =  0;cbox_planes[4].normal[1] =  0;cbox_planes[4].normal[2] =  1;cbox_planes[4].dist = cmaxs[2] - mins[2];
 711         cbox_planes[5].normal[0] =  0;cbox_planes[5].normal[1] =  0;cbox_planes[5].normal[2] = -1;cbox_planes[5].dist = maxs[2] - cmins[2];
 712         memset(trace, 0, sizeof(trace_t));
 713         trace->hitsupercontentsmask = hitsupercontentsmask;
 714         trace->fraction = 1;
 715         trace->realfraction = 1;
 716         Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
 717 #else
 718         RecursiveHullCheckTraceInfo_t rhc;
 719         static hull_t box_hull;
 720         static dclipnode_t box_clipnodes[6];
 721         static mplane_t box_planes[6];
 722         // fill in a default trace
 723         memset(&rhc, 0, sizeof(rhc));
 724         memset(trace, 0, sizeof(trace_t));
 725         //To keep everything totally uniform, bounding boxes are turned into small
 726         //BSP trees instead of being compared directly.
 727         // create a temp hull from bounding box sizes
 728         box_planes[0].dist = cmaxs[0] - mins[0];
 729         box_planes[1].dist = cmins[0] - maxs[0];
 730         box_planes[2].dist = cmaxs[1] - mins[1];
 731         box_planes[3].dist = cmins[1] - maxs[1];
 732         box_planes[4].dist = cmaxs[2] - mins[2];
 733         box_planes[5].dist = cmins[2] - maxs[2];
 734 #if COLLISIONPARANOID >= 3
 735         Con_Printf("box_planes %f:%f %f:%f %f:%f\ncbox %f %f %f:%f %f %f\nbox %f %f %f:%f %f %f\n", box_planes[0].dist, box_planes[1].dist, box_planes[2].dist, box_planes[3].dist, box_planes[4].dist, box_planes[5].dist, cmins[0], cmins[1], cmins[2], cmaxs[0], cmaxs[1], cmaxs[2], mins[0], mins[1], mins[2], maxs[0], maxs[1], maxs[2]);
 736 #endif
 737
 738         if (box_hull.clipnodes == NULL)
 739         {
 740                 int i, side;
 741
 742                 //Set up the planes and clipnodes so that the six floats of a bounding box
 743                 //can just be stored out and get a proper hull_t structure.
 744
 745                 box_hull.clipnodes = box_clipnodes;
 746                 box_hull.planes = box_planes;
 747                 box_hull.firstclipnode = 0;
 748                 box_hull.lastclipnode = 5;
 749
 750                 for (i = 0;i < 6;i++)
 751                 {
 752                         box_clipnodes[i].planenum = i;
 753
 754                         side = i&1;
 755
 756                         box_clipnodes[i].children[side] = CONTENTS_EMPTY;
 757                         if (i != 5)
 758                                 box_clipnodes[i].children[side^1] = i + 1;
 759                         else
 760                                 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
 761
 762                         box_planes[i].type = i>>1;
 763                         box_planes[i].normal[i>>1] = 1;
 764                 }
 765         }
 766
 767         // trace a line through the generated clipping hull
 768         //rhc.boxsupercontents = boxsupercontents;
 769         rhc.hull = &box_hull;
 770         rhc.trace = trace;
 771         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 772         rhc.trace->fraction = 1;
 773         rhc.trace->realfraction = 1;
 774         rhc.trace->allsolid = true;
 775         VectorCopy(start, rhc.start);
 776         VectorCopy(end, rhc.end);
 777         VectorSubtract(rhc.end, rhc.start, rhc.dist);
 778         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 779         //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
 780         if (rhc.trace->startsupercontents)
 781                 rhc.trace->startsupercontents = boxsupercontents;
 782 #endif
 783 }
 784
 785 static int Mod_Q1BSP_LightPoint_RecursiveBSPNode(model_t *model, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal, const mnode_t *node, float x, float y, float startz, float endz)
 786 {
 787         int side, distz = endz - startz;
 788         float front, back;
 789         float mid;
 790
 791 loc0:
 792         if (!node->plane)
 793                 return false;           // didn't hit anything
 794
 795         switch (node->plane->type)
 796         {
 797         case PLANE_X:
 798                 node = node->children[x < node->plane->dist];
 799                 goto loc0;
 800         case PLANE_Y:
 801                 node = node->children[y < node->plane->dist];
 802                 goto loc0;
 803         case PLANE_Z:
 804                 side = startz < node->plane->dist;
 805                 if ((endz < node->plane->dist) == side)
 806                 {
 807                         node = node->children[side];
 808                         goto loc0;
 809                 }
 810                 // found an intersection
 811                 mid = node->plane->dist;
 812                 break;
 813         default:
 814                 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
 815                 front += startz * node->plane->normal[2];
 816                 back += endz * node->plane->normal[2];
 817                 side = front < node->plane->dist;
 818                 if ((back < node->plane->dist) == side)
 819                 {
 820                         node = node->children[side];
 821                         goto loc0;
 822                 }
 823                 // found an intersection
 824                 mid = startz + distz * (front - node->plane->dist) / (front - back);
 825                 break;
 826         }
 827
 828         // go down front side
 829         if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
 830                 return true;    // hit something
 831         else
 832         {
 833                 // check for impact on this node
 834                 if (node->numsurfaces)
 835                 {
 836                         int i, ds, dt;
 837                         msurface_t *surface;
 838
 839                         surface = model->data_surfaces + node->firstsurface;
 840                         for (i = 0;i < node->numsurfaces;i++, surface++)
 841                         {
 842                                 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
 843                                         continue;       // no lightmaps
 844
 845                                 ds = (int) (x * surface->lightmapinfo->texinfo->vecs[0][0] + y * surface->lightmapinfo->texinfo->vecs[0][1] + mid * surface->lightmapinfo->texinfo->vecs[0][2] + surface->lightmapinfo->texinfo->vecs[0][3]) - surface->lightmapinfo->texturemins[0];
 846                                 dt = (int) (x * surface->lightmapinfo->texinfo->vecs[1][0] + y * surface->lightmapinfo->texinfo->vecs[1][1] + mid * surface->lightmapinfo->texinfo->vecs[1][2] + surface->lightmapinfo->texinfo->vecs[1][3]) - surface->lightmapinfo->texturemins[1];
 847
 848                                 if (ds >= 0 && ds < surface->lightmapinfo->extents[0] && dt >= 0 && dt < surface->lightmapinfo->extents[1])
 849                                 {
 850                                         qbyte *lightmap;
 851                                         int lmwidth, lmheight, maps, line3, size3, dsfrac = ds & 15, dtfrac = dt & 15, scale = 0, r00 = 0, g00 = 0, b00 = 0, r01 = 0, g01 = 0, b01 = 0, r10 = 0, g10 = 0, b10 = 0, r11 = 0, g11 = 0, b11 = 0;
 852                                         lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
 853                                         lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
 854                                         line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
 855                                         size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
 856
 857                                         lightmap = surface->lightmapinfo->samples + ((dt>>4) * lmwidth + (ds>>4))*3; // LordHavoc: *3 for colored lighting
 858
 859                                         for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
 860                                         {
 861                                                 scale = d_lightstylevalue[surface->lightmapinfo->styles[maps]];
 862                                                 r00 += lightmap[      0] * scale;g00 += lightmap[      1] * scale;b00 += lightmap[      2] * scale;
 863                                                 r01 += lightmap[      3] * scale;g01 += lightmap[      4] * scale;b01 += lightmap[      5] * scale;
 864                                                 r10 += lightmap[line3+0] * scale;g10 += lightmap[line3+1] * scale;b10 += lightmap[line3+2] * scale;
 865                                                 r11 += lightmap[line3+3] * scale;g11 += lightmap[line3+4] * scale;b11 += lightmap[line3+5] * scale;
 866                                                 lightmap += size3;
 867                                         }
 868
 869 /*
 870 LordHavoc: here's the readable version of the interpolation
 871 code, not quite as easy for the compiler to optimize...
 872
 873 dsfrac is the X position in the lightmap pixel, * 16
 874 dtfrac is the Y position in the lightmap pixel, * 16
 875 r00 is top left corner, r01 is top right corner
 876 r10 is bottom left corner, r11 is bottom right corner
 877 g and b are the same layout.
 878 r0 and r1 are the top and bottom intermediate results
 879
 880 first we interpolate the top two points, to get the top
 881 edge sample
 882
 883         r0 = (((r01-r00) * dsfrac) >> 4) + r00;
 884         g0 = (((g01-g00) * dsfrac) >> 4) + g00;
 885         b0 = (((b01-b00) * dsfrac) >> 4) + b00;
 886
 887 then we interpolate the bottom two points, to get the
 888 bottom edge sample
 889
 890         r1 = (((r11-r10) * dsfrac) >> 4) + r10;
 891         g1 = (((g11-g10) * dsfrac) >> 4) + g10;
 892         b1 = (((b11-b10) * dsfrac) >> 4) + b10;
 893
 894 then we interpolate the top and bottom samples to get the
 895 middle sample (the one which was requested)
 896
 897         r = (((r1-r0) * dtfrac) >> 4) + r0;
 898         g = (((g1-g0) * dtfrac) >> 4) + g0;
 899         b = (((b1-b0) * dtfrac) >> 4) + b0;
 900 */
 901
 902                                         ambientcolor[0] += (float) ((((((((r11-r10) * dsfrac) >> 4) + r10)-((((r01-r00) * dsfrac) >> 4) + r00)) * dtfrac) >> 4) + ((((r01-r00) * dsfrac) >> 4) + r00)) * (1.0f / 32768.0f);
 903                                         ambientcolor[1] += (float) ((((((((g11-g10) * dsfrac) >> 4) + g10)-((((g01-g00) * dsfrac) >> 4) + g00)) * dtfrac) >> 4) + ((((g01-g00) * dsfrac) >> 4) + g00)) * (1.0f / 32768.0f);
 904                                         ambientcolor[2] += (float) ((((((((b11-b10) * dsfrac) >> 4) + b10)-((((b01-b00) * dsfrac) >> 4) + b00)) * dtfrac) >> 4) + ((((b01-b00) * dsfrac) >> 4) + b00)) * (1.0f / 32768.0f);
 905                                         return true; // success
 906                                 }
 907                         }
 908                 }
 909
 910                 // go down back side
 911                 node = node->children[side ^ 1];
 912                 startz = mid;
 913                 distz = endz - startz;
 914                 goto loc0;
 915         }
 916 }
 917
 918 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
 919 {
 920         Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode, p[0], p[1], p[2], p[2] - 65536);
 921 }
 922
 923 static void Mod_Q1BSP_DecompressVis(const qbyte *in, const qbyte *inend, qbyte *out, qbyte *outend)
 924 {
 925         int c;
 926         qbyte *outstart = out;
 927         while (out < outend)
 928         {
 929                 if (in == inend)
 930                 {
 931                         Con_Printf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
 932                         return;
 933                 }
 934                 c = *in++;
 935                 if (c)
 936                         *out++ = c;
 937                 else
 938                 {
 939                         if (in == inend)
 940                         {
 941                                 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun (during zero-run) on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
 942                                 return;
 943                         }
 944                         for (c = *in++;c > 0;c--)
 945                         {
 946                                 if (out == outend)
 947                                 {
 948                                         Con_Printf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
 949                                         return;
 950                                 }
 951                                 *out++ = 0;
 952                         }
 953                 }
 954         }
 955 }
 956
 957 /*
 958 =============
 959 R_Q1BSP_LoadSplitSky
 960
 961 A sky texture is 256*128, with the right side being a masked overlay
 962 ==============
 963 */
 964 void R_Q1BSP_LoadSplitSky (qbyte *src, int width, int height, int bytesperpixel)
 965 {
 966         int i, j;
 967         unsigned solidpixels[128*128], alphapixels[128*128];
 968
 969         // if sky isn't the right size, just use it as a solid layer
 970         if (width != 256 || height != 128)
 971         {
 972                 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", width, height, src, bytesperpixel == 4 ? TEXTYPE_RGBA : TEXTYPE_PALETTE, TEXF_PRECACHE, bytesperpixel == 1 ? palette_complete : NULL);
 973                 loadmodel->brush.alphaskytexture = NULL;;
 974                 return;
 975         }
 976
 977         if (bytesperpixel == 4)
 978         {
 979                 for (i = 0;i < 128;i++)
 980                 {
 981                         for (j = 0;j < 128;j++)
 982                         {
 983                                 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
 984                                 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
 985                         }
 986                 }
 987         }
 988         else
 989         {
 990                 // make an average value for the back to avoid
 991                 // a fringe on the top level
 992                 int p, r, g, b;
 993                 union
 994                 {
 995                         unsigned int i;
 996                         unsigned char b[4];
 997                 }
 998                 rgba;
 999                 r = g = b = 0;
1000                 for (i = 0;i < 128;i++)
1001                 {
1002                         for (j = 0;j < 128;j++)
1003                         {
1004                                 rgba.i = palette_complete[src[i*256 + j + 128]];
1005                                 r += rgba.b[0];
1006                                 g += rgba.b[1];
1007                                 b += rgba.b[2];
1008                         }
1009                 }
1010                 rgba.b[0] = r/(128*128);
1011                 rgba.b[1] = g/(128*128);
1012                 rgba.b[2] = b/(128*128);
1013                 rgba.b[3] = 0;
1014                 for (i = 0;i < 128;i++)
1015                 {
1016                         for (j = 0;j < 128;j++)
1017                         {
1018                                 solidpixels[(i*128) + j] = palette_complete[src[i*256 + j + 128]];
1019                                 alphapixels[(i*128) + j] = (p = src[i*256 + j]) ? palette_complete[p] : rgba.i;
1020                         }
1021                 }
1022         }
1023
1024         loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (qbyte *) solidpixels, TEXTYPE_RGBA, TEXF_PRECACHE, NULL);
1025         loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (qbyte *) alphapixels, TEXTYPE_RGBA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1026 }
1027
1028 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1029 {
1030         int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1031         miptex_t *dmiptex;
1032         texture_t *tx, *tx2, *anims[10], *altanims[10];
1033         dmiptexlump_t *m;
1034         qbyte *data, *mtdata;
1035         char name[256];
1036
1037         loadmodel->data_textures = NULL;
1038
1039         // add two slots for notexture walls and notexture liquids
1040         if (l->filelen)
1041         {
1042                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1043                 m->nummiptex = LittleLong (m->nummiptex);
1044                 loadmodel->num_textures = m->nummiptex + 2;
1045         }
1046         else
1047         {
1048                 m = NULL;
1049                 loadmodel->num_textures = 2;
1050         }
1051
1052         loadmodel->data_textures = Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1053
1054         // fill out all slots with notexture
1055         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1056         {
1057                 strcpy(tx->name, "NO TEXTURE FOUND");
1058                 tx->width = 16;
1059                 tx->height = 16;
1060                 tx->skin.base = r_texture_notexture;
1061                 tx->basematerialflags = 0;
1062                 if (i == loadmodel->num_textures - 1)
1063                 {
1064                         tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES;
1065                         tx->supercontents = SUPERCONTENTS_WATER;
1066                 }
1067                 else
1068                 {
1069                         tx->basematerialflags |= MATERIALFLAG_WALL;
1070                         tx->supercontents = SUPERCONTENTS_SOLID;
1071                 }
1072                 tx->currentframe = tx;
1073         }
1074
1075         if (!m)
1076                 return;
1077
1078         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1079         dofs = m->dataofs;
1080         // LordHavoc: mostly rewritten map texture loader
1081         for (i = 0;i < m->nummiptex;i++)
1082         {
1083                 dofs[i] = LittleLong(dofs[i]);
1084                 if (dofs[i] == -1 || r_nosurftextures.integer)
1085                         continue;
1086                 dmiptex = (miptex_t *)((qbyte *)m + dofs[i]);
1087
1088                 // make sure name is no more than 15 characters
1089                 for (j = 0;dmiptex->name[j] && j < 15;j++)
1090                         name[j] = dmiptex->name[j];
1091                 name[j] = 0;
1092
1093                 mtwidth = LittleLong(dmiptex->width);
1094                 mtheight = LittleLong(dmiptex->height);
1095                 mtdata = NULL;
1096                 j = LittleLong(dmiptex->offsets[0]);
1097                 if (j)
1098                 {
1099                         // texture included
1100                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1101                         {
1102                                 Con_Printf("Texture \"%s\" in \"%s\"is corrupt or incomplete\n", dmiptex->name, loadmodel->name);
1103                                 continue;
1104                         }
1105                         mtdata = (qbyte *)dmiptex + j;
1106                 }
1107
1108                 if ((mtwidth & 15) || (mtheight & 15))
1109                         Con_Printf("warning: texture \"%s\" in \"%s\" is not 16 aligned\n", dmiptex->name, loadmodel->name);
1110
1111                 // LordHavoc: force all names to lowercase
1112                 for (j = 0;name[j];j++)
1113                         if (name[j] >= 'A' && name[j] <= 'Z')
1114                                 name[j] += 'a' - 'A';
1115
1116                 tx = loadmodel->data_textures + i;
1117                 strcpy(tx->name, name);
1118                 tx->width = mtwidth;
1119                 tx->height = mtheight;
1120
1121                 if (!tx->name[0])
1122                 {
1123                         sprintf(tx->name, "unnamed%i", i);
1124                         Con_Printf("warning: unnamed texture in %s, renaming to %s\n", loadmodel->name, tx->name);
1125                 }
1126
1127                 // LordHavoc: HL sky textures are entirely different than quake
1128                 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1129                 {
1130                         if (loadmodel->isworldmodel)
1131                         {
1132                                 data = loadimagepixels(tx->name, false, 0, 0);
1133                                 if (data)
1134                                 {
1135                                         R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1136                                         Mem_Free(data);
1137                                 }
1138                                 else if (mtdata != NULL)
1139                                         R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1140                         }
1141                 }
1142                 else
1143                 {
1144                         if (!Mod_LoadSkinFrame(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, true))
1145                         {
1146                                 // did not find external texture, load it from the bsp or wad3
1147                                 if (loadmodel->brush.ishlbsp)
1148                                 {
1149                                         // internal texture overrides wad
1150                                         qbyte *pixels, *freepixels, *fogpixels;
1151                                         pixels = freepixels = NULL;
1152                                         if (mtdata)
1153                                                 pixels = W_ConvertWAD3Texture(dmiptex);
1154                                         if (pixels == NULL)
1155                                                 pixels = freepixels = W_GetTexture(tx->name);
1156                                         if (pixels != NULL)
1157                                         {
1158                                                 tx->width = image_width;
1159                                                 tx->height = image_height;
1160                                                 tx->skin.base = tx->skin.merged = R_LoadTexture2D(loadmodel->texturepool, tx->name, image_width, image_height, pixels, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, NULL);
1161                                                 if (Image_CheckAlpha(pixels, image_width * image_height, true))
1162                                                 {
1163                                                         fogpixels = Mem_Alloc(tempmempool, image_width * image_height * 4);
1164                                                         for (j = 0;j < image_width * image_height * 4;j += 4)
1165                                                         {
1166                                                                 fogpixels[j + 0] = 255;
1167                                                                 fogpixels[j + 1] = 255;
1168                                                                 fogpixels[j + 2] = 255;
1169                                                                 fogpixels[j + 3] = pixels[j + 3];
1170                                                         }
1171                                                         tx->skin.fog = R_LoadTexture2D(loadmodel->texturepool, tx->name, image_width, image_height, pixels, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, NULL);
1172                                                         Mem_Free(fogpixels);
1173                                                 }
1174                                         }
1175                                         if (freepixels)
1176                                                 Mem_Free(freepixels);
1177                                 }
1178                                 else if (mtdata) // texture included
1179                                         Mod_LoadSkinFrame_Internal(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_PICMIP, false, tx->name[0] != '*' && r_fullbrights.integer, mtdata, tx->width, tx->height);
1180                         }
1181                 }
1182                 if (tx->skin.base == NULL)
1183                 {
1184                         // no texture found
1185                         tx->width = 16;
1186                         tx->height = 16;
1187                         tx->skin.base = r_texture_notexture;
1188                 }
1189
1190                 tx->basematerialflags = 0;
1191                 if (tx->name[0] == '*')
1192                 {
1193                         // turb does not block movement
1194                         tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES;
1195                         // LordHavoc: some turbulent textures should be fullbright and solid
1196                         if (!strncmp(tx->name,"*lava",5)
1197                          || !strncmp(tx->name,"*teleport",9)
1198                          || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1199                                 tx->basematerialflags |= MATERIALFLAG_FULLBRIGHT;
1200                         else
1201                                 tx->basematerialflags |= MATERIALFLAG_WATERALPHA;
1202                         if (!strncmp(tx->name, "*lava", 5))
1203                                 tx->supercontents = SUPERCONTENTS_LAVA;
1204                         else if (!strncmp(tx->name, "*slime", 6))
1205                                 tx->supercontents = SUPERCONTENTS_SLIME;
1206                         else
1207                                 tx->supercontents = SUPERCONTENTS_WATER;
1208                 }
1209                 else if (tx->name[0] == 's' && tx->name[1] == 'k' && tx->name[2] == 'y')
1210                 {
1211                         tx->supercontents = SUPERCONTENTS_SKY;
1212                         tx->basematerialflags |= MATERIALFLAG_SKY;
1213                 }
1214                 else
1215                 {
1216                         tx->supercontents = SUPERCONTENTS_SOLID;
1217                         tx->basematerialflags |= MATERIALFLAG_WALL;
1218                 }
1219                 if (tx->skin.fog)
1220                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
1221
1222                 // start out with no animation
1223                 tx->currentframe = tx;
1224         }
1225
1226         // sequence the animations
1227         for (i = 0;i < m->nummiptex;i++)
1228         {
1229                 tx = loadmodel->data_textures + i;
1230                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1231                         continue;
1232                 if (tx->anim_total[0] || tx->anim_total[1])
1233                         continue;       // already sequenced
1234
1235                 // find the number of frames in the animation
1236                 memset(anims, 0, sizeof(anims));
1237                 memset(altanims, 0, sizeof(altanims));
1238
1239                 for (j = i;j < m->nummiptex;j++)
1240                 {
1241                         tx2 = loadmodel->data_textures + j;
1242                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1243                                 continue;
1244
1245                         num = tx2->name[1];
1246                         if (num >= '0' && num <= '9')
1247                                 anims[num - '0'] = tx2;
1248                         else if (num >= 'a' && num <= 'j')
1249                                 altanims[num - 'a'] = tx2;
1250                         else
1251                                 Con_Printf("Bad animating texture %s\n", tx->name);
1252                 }
1253
1254                 max = altmax = 0;
1255                 for (j = 0;j < 10;j++)
1256                 {
1257                         if (anims[j])
1258                                 max = j + 1;
1259                         if (altanims[j])
1260                                 altmax = j + 1;
1261                 }
1262                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1263
1264                 incomplete = false;
1265                 for (j = 0;j < max;j++)
1266                 {
1267                         if (!anims[j])
1268                         {
1269                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1270                                 incomplete = true;
1271                         }
1272                 }
1273                 for (j = 0;j < altmax;j++)
1274                 {
1275                         if (!altanims[j])
1276                         {
1277                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1278                                 incomplete = true;
1279                         }
1280                 }
1281                 if (incomplete)
1282                         continue;
1283
1284                 if (altmax < 1)
1285                 {
1286                         // if there is no alternate animation, duplicate the primary
1287                         // animation into the alternate
1288                         altmax = max;
1289                         for (k = 0;k < 10;k++)
1290                                 altanims[k] = anims[k];
1291                 }
1292
1293                 // link together the primary animation
1294                 for (j = 0;j < max;j++)
1295                 {
1296                         tx2 = anims[j];
1297                         tx2->animated = true;
1298                         tx2->anim_total[0] = max;
1299                         tx2->anim_total[1] = altmax;
1300                         for (k = 0;k < 10;k++)
1301                         {
1302                                 tx2->anim_frames[0][k] = anims[k];
1303                                 tx2->anim_frames[1][k] = altanims[k];
1304                         }
1305                 }
1306
1307                 // if there really is an alternate anim...
1308                 if (anims[0] != altanims[0])
1309                 {
1310                         // link together the alternate animation
1311                         for (j = 0;j < altmax;j++)
1312                         {
1313                                 tx2 = altanims[j];
1314                                 tx2->animated = true;
1315                                 // the primary/alternate are reversed here
1316                                 tx2->anim_total[0] = altmax;
1317                                 tx2->anim_total[1] = max;
1318                                 for (k = 0;k < 10;k++)
1319                                 {
1320                                         tx2->anim_frames[0][k] = altanims[k];
1321                                         tx2->anim_frames[1][k] = anims[k];
1322                                 }
1323                         }
1324                 }
1325         }
1326 }
1327
1328 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1329 {
1330         int i;
1331         qbyte *in, *out, *data, d;
1332         char litfilename[1024];
1333         loadmodel->brushq1.lightdata = NULL;
1334         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1335         {
1336                 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen);
1337                 for (i=0; i<l->filelen; i++)
1338                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1339         }
1340         else if (loadmodel->brush.ismcbsp)
1341         {
1342                 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen);
1343                 memcpy(loadmodel->brushq1.lightdata, mod_base + l->fileofs, l->filelen);
1344         }
1345         else // LordHavoc: bsp version 29 (normal white lighting)
1346         {
1347                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1348                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1349                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1350                 strlcat (litfilename, ".lit", sizeof (litfilename));
1351                 data = (qbyte*) FS_LoadFile(litfilename, tempmempool, false);
1352                 if (data)
1353                 {
1354                         if (fs_filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1355                         {
1356                                 i = LittleLong(((int *)data)[1]);
1357                                 if (i == 1)
1358                                 {
1359                                         Con_DPrintf("loaded %s\n", litfilename);
1360                                         loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, fs_filesize - 8);
1361                                         memcpy(loadmodel->brushq1.lightdata, data + 8, fs_filesize - 8);
1362                                         Mem_Free(data);
1363                                         return;
1364                                 }
1365                                 else
1366                                 {
1367                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1368                                         Mem_Free(data);
1369                                 }
1370                         }
1371                         else
1372                         {
1373                                 if (fs_filesize == 8)
1374                                         Con_Print("Empty .lit file, ignoring\n");
1375                                 else
1376                                         Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", fs_filesize, 8 + l->filelen * 3);
1377                                 Mem_Free(data);
1378                         }
1379                 }
1380                 // LordHavoc: oh well, expand the white lighting data
1381                 if (!l->filelen)
1382                         return;
1383                 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen*3);
1384                 in = loadmodel->brushq1.lightdata + l->filelen*2; // place the file at the end, so it will not be overwritten until the very last write
1385                 out = loadmodel->brushq1.lightdata;
1386                 memcpy(in, mod_base + l->fileofs, l->filelen);
1387                 for (i = 0;i < l->filelen;i++)
1388                 {
1389                         d = *in++;
1390                         *out++ = d;
1391                         *out++ = d;
1392                         *out++ = d;
1393                 }
1394         }
1395 }
1396
1397 static void Mod_Q1BSP_LoadLightList(void)
1398 {
1399         int a, n, numlights;
1400         char tempchar, *s, *t, *lightsstring, lightsfilename[1024];
1401         mlight_t *e;
1402
1403         strlcpy (lightsfilename, loadmodel->name, sizeof (lightsfilename));
1404         FS_StripExtension (lightsfilename, lightsfilename, sizeof(lightsfilename));
1405         strlcat (lightsfilename, ".lights", sizeof (lightsfilename));
1406         s = lightsstring = (char *) FS_LoadFile(lightsfilename, tempmempool, false);
1407         if (s)
1408         {
1409                 numlights = 0;
1410                 while (*s)
1411                 {
1412                         while (*s && *s != '\n' && *s != '\r')
1413                                 s++;
1414                         if (!*s)
1415                         {
1416                                 Mem_Free(lightsstring);
1417                                 Con_Printf("lights file must end with a newline\n");
1418                                 return;
1419                         }
1420                         s++;
1421                         numlights++;
1422                 }
1423                 loadmodel->brushq1.lights = Mem_Alloc(loadmodel->mempool, numlights * sizeof(mlight_t));
1424                 s = lightsstring;
1425                 n = 0;
1426                 while (*s && n < numlights)
1427                 {
1428                         t = s;
1429                         while (*s && *s != '\n' && *s != '\r')
1430                                 s++;
1431                         if (!*s)
1432                         {
1433                                 Con_Printf("misparsed lights file!\n");
1434                                 break;
1435                         }
1436                         e = loadmodel->brushq1.lights + n;
1437                         tempchar = *s;
1438                         *s = 0;
1439                         a = sscanf(t, "%f %f %f %f %f %f %f %f %f %f %f %f %f %d", &e->origin[0], &e->origin[1], &e->origin[2], &e->falloff, &e->light[0], &e->light[1], &e->light[2], &e->subtract, &e->spotdir[0], &e->spotdir[1], &e->spotdir[2], &e->spotcone, &e->distbias, &e->style);
1440                         *s = tempchar;
1441                         if (a != 14)
1442                         {
1443                                 Con_Printf("invalid lights file, found %d parameters on line %i, should be 14 parameters (origin[0] origin[1] origin[2] falloff light[0] light[1] light[2] subtract spotdir[0] spotdir[1] spotdir[2] spotcone distancebias style)\n", a, n + 1);
1444                                 break;
1445                         }
1446                         if (*s == '\r')
1447                                 s++;
1448                         if (*s == '\n')
1449                                 s++;
1450                         n++;
1451                 }
1452                 if (*s)
1453                         Con_Printf("misparsed lights file!\n");
1454                 loadmodel->brushq1.numlights = numlights;
1455                 Mem_Free(lightsstring);
1456         }
1457 }
1458
1459 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1460 {
1461         loadmodel->brushq1.num_compressedpvs = 0;
1462         loadmodel->brushq1.data_compressedpvs = NULL;
1463         if (!l->filelen)
1464                 return;
1465         loadmodel->brushq1.num_compressedpvs = l->filelen;
1466         loadmodel->brushq1.data_compressedpvs = Mem_Alloc(loadmodel->mempool, l->filelen);
1467         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1468 }
1469
1470 // used only for HalfLife maps
1471 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1472 {
1473         char key[128], value[4096];
1474         char wadname[128];
1475         int i, j, k;
1476         if (!data)
1477                 return;
1478         if (!COM_ParseToken(&data, false))
1479                 return; // error
1480         if (com_token[0] != '{')
1481                 return; // error
1482         while (1)
1483         {
1484                 if (!COM_ParseToken(&data, false))
1485                         return; // error
1486                 if (com_token[0] == '}')
1487                         break; // end of worldspawn
1488                 if (com_token[0] == '_')
1489                         strcpy(key, com_token + 1);
1490                 else
1491                         strcpy(key, com_token);
1492                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1493                         key[strlen(key)-1] = 0;
1494                 if (!COM_ParseToken(&data, false))
1495                         return; // error
1496                 strcpy(value, com_token);
1497                 if (!strcmp("wad", key)) // for HalfLife maps
1498                 {
1499                         if (loadmodel->brush.ishlbsp)
1500                         {
1501                                 j = 0;
1502                                 for (i = 0;i < 4096;i++)
1503                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1504                                                 break;
1505                                 if (value[i])
1506                                 {
1507                                         for (;i < 4096;i++)
1508                                         {
1509                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1510                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1511                                                         j = i+1;
1512                                                 else if (value[i] == ';' || value[i] == 0)
1513                                                 {
1514                                                         k = value[i];
1515                                                         value[i] = 0;
1516                                                         strcpy(wadname, "textures/");
1517                                                         strcat(wadname, &value[j]);
1518                                                         W_LoadTextureWadFile(wadname, false);
1519                                                         j = i+1;
1520                                                         if (!k)
1521                                                                 break;
1522                                                 }
1523                                         }
1524                                 }
1525                         }
1526                 }
1527         }
1528 }
1529
1530 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1531 {
1532         loadmodel->brush.entities = NULL;
1533         if (!l->filelen)
1534                 return;
1535         loadmodel->brush.entities = Mem_Alloc(loadmodel->mempool, l->filelen);
1536         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1537         if (loadmodel->brush.ishlbsp)
1538                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1539 }
1540
1541
1542 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1543 {
1544         dvertex_t       *in;
1545         mvertex_t       *out;
1546         int                     i, count;
1547
1548         in = (void *)(mod_base + l->fileofs);
1549         if (l->filelen % sizeof(*in))
1550                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1551         count = l->filelen / sizeof(*in);
1552         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1553
1554         loadmodel->brushq1.vertexes = out;
1555         loadmodel->brushq1.numvertexes = count;
1556
1557         for ( i=0 ; i<count ; i++, in++, out++)
1558         {
1559                 out->position[0] = LittleFloat(in->point[0]);
1560                 out->position[1] = LittleFloat(in->point[1]);
1561                 out->position[2] = LittleFloat(in->point[2]);
1562         }
1563 }
1564
1565 static void Mod_Q1BSP_LoadSubmodels(lump_t *l)
1566 {
1567         dmodel_t        *in;
1568         dmodel_t        *out;
1569         int                     i, j, count;
1570
1571         in = (void *)(mod_base + l->fileofs);
1572         if (l->filelen % sizeof(*in))
1573                 Host_Error("Mod_Q1BSP_LoadSubmodels: funny lump size in %s",loadmodel->name);
1574         count = l->filelen / sizeof(*in);
1575         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1576
1577         loadmodel->brushq1.submodels = out;
1578         loadmodel->brush.numsubmodels = count;
1579
1580         for ( i=0 ; i<count ; i++, in++, out++)
1581         {
1582                 for (j=0 ; j<3 ; j++)
1583                 {
1584                         // spread the mins / maxs by a pixel
1585                         out->mins[j] = LittleFloat(in->mins[j]) - 1;
1586                         out->maxs[j] = LittleFloat(in->maxs[j]) + 1;
1587                         out->origin[j] = LittleFloat(in->origin[j]);
1588                 }
1589                 for (j=0 ; j<MAX_MAP_HULLS ; j++)
1590                         out->headnode[j] = LittleLong(in->headnode[j]);
1591                 out->visleafs = LittleLong(in->visleafs);
1592                 out->firstface = LittleLong(in->firstface);
1593                 out->numfaces = LittleLong(in->numfaces);
1594         }
1595 }
1596
1597 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1598 {
1599         dedge_t *in;
1600         medge_t *out;
1601         int     i, count;
1602
1603         in = (void *)(mod_base + l->fileofs);
1604         if (l->filelen % sizeof(*in))
1605                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1606         count = l->filelen / sizeof(*in);
1607         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1608
1609         loadmodel->brushq1.edges = out;
1610         loadmodel->brushq1.numedges = count;
1611
1612         for ( i=0 ; i<count ; i++, in++, out++)
1613         {
1614                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1615                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1616         }
1617 }
1618
1619 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1620 {
1621         texinfo_t *in;
1622         mtexinfo_t *out;
1623         int i, j, k, count, miptex;
1624
1625         in = (void *)(mod_base + l->fileofs);
1626         if (l->filelen % sizeof(*in))
1627                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1628         count = l->filelen / sizeof(*in);
1629         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1630
1631         loadmodel->brushq1.texinfo = out;
1632         loadmodel->brushq1.numtexinfo = count;
1633
1634         for (i = 0;i < count;i++, in++, out++)
1635         {
1636                 for (k = 0;k < 2;k++)
1637                         for (j = 0;j < 4;j++)
1638                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1639
1640                 miptex = LittleLong(in->miptex);
1641                 out->flags = LittleLong(in->flags);
1642
1643                 out->texture = NULL;
1644                 if (loadmodel->data_textures)
1645                 {
1646                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1647                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1648                         else
1649                                 out->texture = loadmodel->data_textures + miptex;
1650                 }
1651                 if (out->flags & TEX_SPECIAL)
1652                 {
1653                         // if texture chosen is NULL or the shader needs a lightmap,
1654                         // force to notexture water shader
1655                         if (out->texture == NULL || out->texture->basematerialflags & MATERIALFLAG_WALL)
1656                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1657                 }
1658                 else
1659                 {
1660                         // if texture chosen is NULL, force to notexture
1661                         if (out->texture == NULL)
1662                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1663                 }
1664         }
1665 }
1666
1667 #if 0
1668 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1669 {
1670         int             i, j;
1671         float   *v;
1672
1673         mins[0] = mins[1] = mins[2] = 9999;
1674         maxs[0] = maxs[1] = maxs[2] = -9999;
1675         v = verts;
1676         for (i = 0;i < numverts;i++)
1677         {
1678                 for (j = 0;j < 3;j++, v++)
1679                 {
1680                         if (*v < mins[j])
1681                                 mins[j] = *v;
1682                         if (*v > maxs[j])
1683                                 maxs[j] = *v;
1684                 }
1685         }
1686 }
1687
1688 #define MAX_SUBDIVPOLYTRIANGLES 4096
1689 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
1690
1691 static int subdivpolyverts, subdivpolytriangles;
1692 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
1693 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
1694
1695 static int subdivpolylookupvert(vec3_t v)
1696 {
1697         int i;
1698         for (i = 0;i < subdivpolyverts;i++)
1699                 if (subdivpolyvert[i][0] == v[0]
1700                  && subdivpolyvert[i][1] == v[1]
1701                  && subdivpolyvert[i][2] == v[2])
1702                         return i;
1703         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
1704                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
1705         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
1706         return subdivpolyverts++;
1707 }
1708
1709 static void SubdividePolygon(int numverts, float *verts)
1710 {
1711         int             i, i1, i2, i3, f, b, c, p;
1712         vec3_t  mins, maxs, front[256], back[256];
1713         float   m, *pv, *cv, dist[256], frac;
1714
1715         if (numverts > 250)
1716                 Host_Error("SubdividePolygon: ran out of verts in buffer");
1717
1718         BoundPoly(numverts, verts, mins, maxs);
1719
1720         for (i = 0;i < 3;i++)
1721         {
1722                 m = (mins[i] + maxs[i]) * 0.5;
1723                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
1724                 if (maxs[i] - m < 8)
1725                         continue;
1726                 if (m - mins[i] < 8)
1727                         continue;
1728
1729                 // cut it
1730                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
1731                         dist[c] = cv[i] - m;
1732
1733                 f = b = 0;
1734                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
1735                 {
1736                         if (dist[p] >= 0)
1737                         {
1738                                 VectorCopy(pv, front[f]);
1739                                 f++;
1740                         }
1741                         if (dist[p] <= 0)
1742                         {
1743                                 VectorCopy(pv, back[b]);
1744                                 b++;
1745                         }
1746                         if (dist[p] == 0 || dist[c] == 0)
1747                                 continue;
1748                         if ((dist[p] > 0) != (dist[c] > 0) )
1749                         {
1750                                 // clip point
1751                                 frac = dist[p] / (dist[p] - dist[c]);
1752                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
1753                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
1754                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
1755                                 f++;
1756                                 b++;
1757                         }
1758                 }
1759
1760                 SubdividePolygon(f, front[0]);
1761                 SubdividePolygon(b, back[0]);
1762                 return;
1763         }
1764
1765         i1 = subdivpolylookupvert(verts);
1766         i2 = subdivpolylookupvert(verts + 3);
1767         for (i = 2;i < numverts;i++)
1768         {
1769                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
1770                 {
1771                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
1772                         return;
1773                 }
1774
1775                 i3 = subdivpolylookupvert(verts + i * 3);
1776                 subdivpolyindex[subdivpolytriangles][0] = i1;
1777                 subdivpolyindex[subdivpolytriangles][1] = i2;
1778                 subdivpolyindex[subdivpolytriangles][2] = i3;
1779                 i2 = i3;
1780                 subdivpolytriangles++;
1781         }
1782 }
1783
1784 //Breaks a polygon up along axial 64 unit
1785 //boundaries so that turbulent and sky warps
1786 //can be done reasonably.
1787 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
1788 {
1789         int i, j;
1790         surfvertex_t *v;
1791         surfmesh_t *mesh;
1792
1793         subdivpolytriangles = 0;
1794         subdivpolyverts = 0;
1795         SubdividePolygon(surface->num_vertices, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex));
1796         if (subdivpolytriangles < 1)
1797                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?\n");
1798
1799         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
1800         mesh->num_vertices = subdivpolyverts;
1801         mesh->num_triangles = subdivpolytriangles;
1802         mesh->vertex = (surfvertex_t *)(mesh + 1);
1803         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
1804         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
1805
1806         for (i = 0;i < mesh->num_triangles;i++)
1807                 for (j = 0;j < 3;j++)
1808                         mesh->index[i*3+j] = subdivpolyindex[i][j];
1809
1810         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
1811         {
1812                 VectorCopy(subdivpolyvert[i], v->v);
1813                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
1814                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
1815         }
1816 }
1817 #endif
1818
1819 static void Mod_Q1BSP_LoadFaces(lump_t *l)
1820 {
1821         dface_t *in;
1822         msurface_t *surface;
1823         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris;
1824         float texmins[2], texmaxs[2], val;
1825
1826         in = (void *)(mod_base + l->fileofs);
1827         if (l->filelen % sizeof(*in))
1828                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
1829         count = l->filelen / sizeof(*in);
1830         loadmodel->data_surfaces = Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
1831         loadmodel->data_surfaces_lightmapinfo = Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
1832
1833         loadmodel->num_surfaces = count;
1834
1835         totalverts = 0;
1836         totaltris = 0;
1837         for (surfacenum = 0, in = (void *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
1838         {
1839                 numedges = LittleShort(in->numedges);
1840                 totalverts += numedges;
1841                 totaltris += numedges - 2;
1842         }
1843
1844         // TODO: split up into multiple meshes as needed to avoid exceeding 65536
1845         // vertex limit
1846         loadmodel->nummeshes = 1;
1847         loadmodel->meshlist = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *));
1848         loadmodel->meshlist[0] = Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
1849
1850         totalverts = 0;
1851         totaltris = 0;
1852         for (surfacenum = 0, in = (void *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
1853         {
1854                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
1855
1856                 // FIXME: validate edges, texinfo, etc?
1857                 firstedge = LittleLong(in->firstedge);
1858                 numedges = LittleShort(in->numedges);
1859                 if ((unsigned int) firstedge > (unsigned int) loadmodel->brushq1.numsurfedges || (unsigned int) numedges > (unsigned int) loadmodel->brushq1.numsurfedges || (unsigned int) firstedge + (unsigned int) numedges > (unsigned int) loadmodel->brushq1.numsurfedges)
1860                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)\n", firstedge, numedges, loadmodel->brushq1.numsurfedges);
1861                 i = LittleShort(in->texinfo);
1862                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
1863                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)\n", i, loadmodel->brushq1.numtexinfo);
1864                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
1865                 surface->texture = surface->lightmapinfo->texinfo->texture;
1866
1867                 planenum = LittleShort(in->planenum);
1868                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
1869                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)\n", planenum, loadmodel->brush.num_planes);
1870
1871                 //surface->flags = surface->texture->flags;
1872                 //if (LittleShort(in->side))
1873                 //      surface->flags |= SURF_PLANEBACK;
1874                 //surface->plane = loadmodel->brush.data_planes + planenum;
1875
1876                 surface->groupmesh = loadmodel->meshlist[0];
1877                 surface->num_firstvertex = totalverts;
1878                 surface->num_vertices = numedges;
1879                 surface->num_firsttriangle = totaltris;
1880                 surface->num_triangles = numedges - 2;
1881                 totalverts += numedges;
1882                 totaltris += numedges - 2;
1883
1884                 // convert edges back to a normal polygon
1885                 for (i = 0;i < surface->num_vertices;i++)
1886                 {
1887                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
1888                         float s, t;
1889                         if (lindex > 0)
1890                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
1891                         else
1892                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
1893                         s = DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
1894                         t = DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
1895                         (surface->groupmesh->data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
1896                         (surface->groupmesh->data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
1897                         (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
1898                         (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
1899                         (surface->groupmesh->data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
1900                 }
1901
1902                 for (i = 0;i < surface->num_triangles;i++)
1903                 {
1904                         (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
1905                         (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
1906                         (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
1907                 }
1908
1909                 // compile additional data about the surface geometry
1910                 Mod_BuildTextureVectorsAndNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, surface->groupmesh->data_vertex3f, surface->groupmesh->data_texcoordtexture2f, (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle), surface->groupmesh->data_svector3f, surface->groupmesh->data_tvector3f, surface->groupmesh->data_normal3f, true);
1911                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex));
1912
1913                 // generate surface extents information
1914                 texmins[0] = texmaxs[0] = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
1915                 texmins[1] = texmaxs[1] = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
1916                 for (i = 1;i < surface->num_vertices;i++)
1917                 {
1918                         for (j = 0;j < 2;j++)
1919                         {
1920                                 val = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
1921                                 texmins[j] = min(texmins[j], val);
1922                                 texmaxs[j] = max(texmaxs[j], val);
1923                         }
1924                 }
1925                 for (i = 0;i < 2;i++)
1926                 {
1927                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
1928                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
1929                 }
1930
1931                 smax = surface->lightmapinfo->extents[0] >> 4;
1932                 tmax = surface->lightmapinfo->extents[1] >> 4;
1933                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
1934                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
1935
1936                 // lighting info
1937                 for (i = 0;i < MAXLIGHTMAPS;i++)
1938                         surface->lightmapinfo->styles[i] = in->styles[i];
1939                 // force lightmap upload on first time seeing the surface
1940                 surface->cached_dlight = true;
1941                 surface->lightmapinfo->lightmaptexturestride = 0;
1942                 surface->lightmaptexture = NULL;
1943                 i = LittleLong(in->lightofs);
1944                 if (i == -1)
1945                 {
1946                         surface->lightmapinfo->samples = NULL;
1947                         // give non-lightmapped water a 1x white lightmap
1948                         if ((surface->texture->basematerialflags & MATERIALFLAG_WATER) && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
1949                         {
1950                                 surface->lightmapinfo->samples = Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
1951                                 surface->lightmapinfo->styles[0] = 0;
1952                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
1953                         }
1954                 }
1955                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
1956                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
1957                 else // LordHavoc: white lighting (bsp version 29)
1958                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
1959
1960                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
1961                 {
1962                         int i, iu, iv;
1963                         float u, v, ubase, vbase, uscale, vscale;
1964
1965                         if (ssize > 256 || tsize > 256)
1966                                 Host_Error("Bad surface extents");
1967                         // stainmap for permanent marks on walls
1968                         surface->lightmapinfo->stainsamples = Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
1969                         // clear to white
1970                         memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
1971
1972                         if (r_miplightmaps.integer)
1973                         {
1974                                 surface->lightmapinfo->lightmaptexturestride = ssize;
1975                                 surface->lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, NULL, surface->lightmapinfo->lightmaptexturestride, tsize, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_MIPMAP | TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
1976                         }
1977                         else
1978                         {
1979                                 surface->lightmapinfo->lightmaptexturestride = R_CompatibleFragmentWidth(ssize, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, 0);
1980                                 surface->lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, NULL, surface->lightmapinfo->lightmaptexturestride, tsize, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FRAGMENT | TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
1981                         }
1982                         R_FragmentLocation(surface->lightmaptexture, NULL, NULL, &ubase, &vbase, &uscale, &vscale);
1983                         uscale = (uscale - ubase) / ssize;
1984                         vscale = (vscale - vbase) / tsize;
1985
1986                         for (i = 0;i < surface->num_vertices;i++)
1987                         {
1988                                 u = ((DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3]) + 8 - surface->lightmapinfo->texturemins[0]) * (1.0 / 16.0);
1989                                 v = ((DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3]) + 8 - surface->lightmapinfo->texturemins[1]) * (1.0 / 16.0);
1990                                 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
1991                                 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
1992                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
1993                                 iu = (int) u;
1994                                 iv = (int) v;
1995                                 (surface->groupmesh->data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
1996                         }
1997                 }
1998         }
1999 }
2000
2001 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2002 {
2003         //if (node->parent)
2004         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion\n");
2005         node->parent = parent;
2006         if (node->plane)
2007         {
2008                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2009                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2010         }
2011 }
2012
2013 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2014 {
2015         int                     i, j, count, p;
2016         dnode_t         *in;
2017         mnode_t         *out;
2018
2019         in = (void *)(mod_base + l->fileofs);
2020         if (l->filelen % sizeof(*in))
2021                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2022         count = l->filelen / sizeof(*in);
2023         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2024
2025         loadmodel->brush.data_nodes = out;
2026         loadmodel->brush.num_nodes = count;
2027
2028         for ( i=0 ; i<count ; i++, in++, out++)
2029         {
2030                 for (j=0 ; j<3 ; j++)
2031                 {
2032                         out->mins[j] = LittleShort(in->mins[j]);
2033                         out->maxs[j] = LittleShort(in->maxs[j]);
2034                 }
2035
2036                 p = LittleLong(in->planenum);
2037                 out->plane = loadmodel->brush.data_planes + p;
2038
2039                 out->firstsurface = LittleShort(in->firstface);
2040                 out->numsurfaces = LittleShort(in->numfaces);
2041
2042                 for (j=0 ; j<2 ; j++)
2043                 {
2044                         p = LittleShort(in->children[j]);
2045                         if (p >= 0)
2046                                 out->children[j] = loadmodel->brush.data_nodes + p;
2047                         else
2048                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + (-1 - p));
2049                 }
2050         }
2051
2052         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2053 }
2054
2055 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2056 {
2057         dleaf_t *in;
2058         mleaf_t *out;
2059         int i, j, count, p;
2060
2061         in = (void *)(mod_base + l->fileofs);
2062         if (l->filelen % sizeof(*in))
2063                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2064         count = l->filelen / sizeof(*in);
2065         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2066
2067         loadmodel->brush.data_leafs = out;
2068         loadmodel->brush.num_leafs = count;
2069         // get visleafs from the submodel data
2070         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2071         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2072         loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2073         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2074
2075         for ( i=0 ; i<count ; i++, in++, out++)
2076         {
2077                 for (j=0 ; j<3 ; j++)
2078                 {
2079                         out->mins[j] = LittleShort(in->mins[j]);
2080                         out->maxs[j] = LittleShort(in->maxs[j]);
2081                 }
2082
2083                 // FIXME: this function could really benefit from some error checking
2084
2085                 out->contents = LittleLong(in->contents);
2086
2087                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + LittleShort(in->firstmarksurface);
2088                 out->numleafsurfaces = LittleShort(in->nummarksurfaces);
2089                 if (out->firstleafsurface < 0 || LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2090                 {
2091                         Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", out->firstleafsurface, out->firstleafsurface + out->numleafsurfaces, 0, loadmodel->brush.num_leafsurfaces);
2092                         out->firstleafsurface = NULL;
2093                         out->numleafsurfaces = 0;
2094                 }
2095
2096                 out->clusterindex = i - 1;
2097                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2098                         out->clusterindex = -1;
2099
2100                 p = LittleLong(in->visofs);
2101                 // ignore visofs errors on leaf 0 (solid)
2102                 if (p >= 0 && out->clusterindex >= 0)
2103                 {
2104                         if (p >= loadmodel->brushq1.num_compressedpvs)
2105                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2106                         else
2107                                 Mod_Q1BSP_DecompressVis(loadmodel->brushq1.data_compressedpvs + p, loadmodel->brushq1.data_compressedpvs + loadmodel->brushq1.num_compressedpvs, loadmodel->brush.data_pvsclusters + out->clusterindex * loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.data_pvsclusters + (out->clusterindex + 1) * loadmodel->brush.num_pvsclusterbytes);
2108                 }
2109
2110                 for (j = 0;j < 4;j++)
2111                         out->ambient_sound_level[j] = in->ambient_level[j];
2112
2113                 // FIXME: Insert caustics here
2114         }
2115 }
2116
2117 static void Mod_Q1BSP_LoadClipnodes(lump_t *l)
2118 {
2119         dclipnode_t *in, *out;
2120         int                     i, count;
2121         hull_t          *hull;
2122
2123         in = (void *)(mod_base + l->fileofs);
2124         if (l->filelen % sizeof(*in))
2125                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2126         count = l->filelen / sizeof(*in);
2127         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2128
2129         loadmodel->brushq1.clipnodes = out;
2130         loadmodel->brushq1.numclipnodes = count;
2131
2132         if (loadmodel->brush.ismcbsp)
2133         {
2134                 hull = &loadmodel->brushq1.hulls[1];
2135                 hull->clipnodes = out;
2136                 hull->firstclipnode = 0;
2137                 hull->lastclipnode = count-1;
2138                 hull->planes = loadmodel->brush.data_planes;
2139                 hull->clip_mins[0] = -12;
2140                 hull->clip_mins[1] = -12;
2141                 hull->clip_mins[2] = -24;
2142                 hull->clip_maxs[0] = 12;
2143                 hull->clip_maxs[1] = 12;
2144                 hull->clip_maxs[2] = 32;
2145                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2146
2147                 hull = &loadmodel->brushq1.hulls[2];
2148                 hull->clipnodes = out;
2149                 hull->firstclipnode = 0;
2150                 hull->lastclipnode = count-1;
2151                 hull->planes = loadmodel->brush.data_planes;
2152                 hull->clip_mins[0] = -12;
2153                 hull->clip_mins[1] = -12;
2154                 hull->clip_mins[2] = -24;
2155                 hull->clip_maxs[0] = 12;
2156                 hull->clip_maxs[1] = 12;
2157                 hull->clip_maxs[2] = 16;
2158                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2159         }
2160         else if (loadmodel->brush.ishlbsp)
2161         {
2162                 hull = &loadmodel->brushq1.hulls[1];
2163                 hull->clipnodes = out;
2164                 hull->firstclipnode = 0;
2165                 hull->lastclipnode = count-1;
2166                 hull->planes = loadmodel->brush.data_planes;
2167                 hull->clip_mins[0] = -16;
2168                 hull->clip_mins[1] = -16;
2169                 hull->clip_mins[2] = -36;
2170                 hull->clip_maxs[0] = 16;
2171                 hull->clip_maxs[1] = 16;
2172                 hull->clip_maxs[2] = 36;
2173                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2174
2175                 hull = &loadmodel->brushq1.hulls[2];
2176                 hull->clipnodes = out;
2177                 hull->firstclipnode = 0;
2178                 hull->lastclipnode = count-1;
2179                 hull->planes = loadmodel->brush.data_planes;
2180                 hull->clip_mins[0] = -32;
2181                 hull->clip_mins[1] = -32;
2182                 hull->clip_mins[2] = -32;
2183                 hull->clip_maxs[0] = 32;
2184                 hull->clip_maxs[1] = 32;
2185                 hull->clip_maxs[2] = 32;
2186                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2187
2188                 hull = &loadmodel->brushq1.hulls[3];
2189                 hull->clipnodes = out;
2190                 hull->firstclipnode = 0;
2191                 hull->lastclipnode = count-1;
2192                 hull->planes = loadmodel->brush.data_planes;
2193                 hull->clip_mins[0] = -16;
2194                 hull->clip_mins[1] = -16;
2195                 hull->clip_mins[2] = -18;
2196                 hull->clip_maxs[0] = 16;
2197                 hull->clip_maxs[1] = 16;
2198                 hull->clip_maxs[2] = 18;
2199                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2200         }
2201         else
2202         {
2203                 hull = &loadmodel->brushq1.hulls[1];
2204                 hull->clipnodes = out;
2205                 hull->firstclipnode = 0;
2206                 hull->lastclipnode = count-1;
2207                 hull->planes = loadmodel->brush.data_planes;
2208                 hull->clip_mins[0] = -16;
2209                 hull->clip_mins[1] = -16;
2210                 hull->clip_mins[2] = -24;
2211                 hull->clip_maxs[0] = 16;
2212                 hull->clip_maxs[1] = 16;
2213                 hull->clip_maxs[2] = 32;
2214                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2215
2216                 hull = &loadmodel->brushq1.hulls[2];
2217                 hull->clipnodes = out;
2218                 hull->firstclipnode = 0;
2219                 hull->lastclipnode = count-1;
2220                 hull->planes = loadmodel->brush.data_planes;
2221                 hull->clip_mins[0] = -32;
2222                 hull->clip_mins[1] = -32;
2223                 hull->clip_mins[2] = -24;
2224                 hull->clip_maxs[0] = 32;
2225                 hull->clip_maxs[1] = 32;
2226                 hull->clip_maxs[2] = 64;
2227                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2228         }
2229
2230         for (i=0 ; i<count ; i++, out++, in++)
2231         {
2232                 out->planenum = LittleLong(in->planenum);
2233                 out->children[0] = LittleShort(in->children[0]);
2234                 out->children[1] = LittleShort(in->children[1]);
2235                 if (out->children[0] >= count || out->children[1] >= count)
2236                         Host_Error("Corrupt clipping hull(out of range child)\n");
2237         }
2238 }
2239
2240 //Duplicate the drawing hull structure as a clipping hull
2241 static void Mod_Q1BSP_MakeHull0(void)
2242 {
2243         mnode_t         *in;
2244         dclipnode_t *out;
2245         int                     i;
2246         hull_t          *hull;
2247
2248         hull = &loadmodel->brushq1.hulls[0];
2249
2250         in = loadmodel->brush.data_nodes;
2251         out = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(dclipnode_t));
2252
2253         hull->clipnodes = out;
2254         hull->firstclipnode = 0;
2255         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2256         hull->planes = loadmodel->brush.data_planes;
2257
2258         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2259         {
2260                 out->planenum = in->plane - loadmodel->brush.data_planes;
2261                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2262                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2263         }
2264 }
2265
2266 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2267 {
2268         int i, j;
2269         short *in;
2270
2271         in = (void *)(mod_base + l->fileofs);
2272         if (l->filelen % sizeof(*in))
2273                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2274         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2275         loadmodel->brush.data_leafsurfaces = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2276
2277         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2278         {
2279                 j = (unsigned) LittleShort(in[i]);
2280                 if (j >= loadmodel->num_surfaces)
2281                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2282                 loadmodel->brush.data_leafsurfaces[i] = j;
2283         }
2284 }
2285
2286 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2287 {
2288         int             i;
2289         int             *in;
2290
2291         in = (void *)(mod_base + l->fileofs);
2292         if (l->filelen % sizeof(*in))
2293                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2294         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2295         loadmodel->brushq1.surfedges = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2296
2297         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2298                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2299 }
2300
2301
2302 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2303 {
2304         int                     i;
2305         mplane_t        *out;
2306         dplane_t        *in;
2307
2308         in = (void *)(mod_base + l->fileofs);
2309         if (l->filelen % sizeof(*in))
2310                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2311
2312         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2313         loadmodel->brush.data_planes = out = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2314
2315         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2316         {
2317                 out->normal[0] = LittleFloat(in->normal[0]);
2318                 out->normal[1] = LittleFloat(in->normal[1]);
2319                 out->normal[2] = LittleFloat(in->normal[2]);
2320                 out->dist = LittleFloat(in->dist);
2321
2322                 PlaneClassify(out);
2323         }
2324 }
2325
2326 static void Mod_Q1BSP_LoadMapBrushes(void)
2327 {
2328 #if 0
2329 // unfinished
2330         int submodel, numbrushes;
2331         qboolean firstbrush;
2332         char *text, *maptext;
2333         char mapfilename[MAX_QPATH];
2334         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2335         strlcat (mapfilename, ".map", sizeof (mapfilename));
2336         maptext = (qbyte*) FS_LoadFile(mapfilename, tempmempool, false);
2337         if (!maptext)
2338                 return;
2339         text = maptext;
2340         if (!COM_ParseToken(&data, false))
2341                 return; // error
2342         submodel = 0;
2343         for (;;)
2344         {
2345                 if (!COM_ParseToken(&data, false))
2346                         break;
2347                 if (com_token[0] != '{')
2348                         return; // error
2349                 // entity
2350                 firstbrush = true;
2351                 numbrushes = 0;
2352                 maxbrushes = 256;
2353                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2354                 for (;;)
2355                 {
2356                         if (!COM_ParseToken(&data, false))
2357                                 return; // error
2358                         if (com_token[0] == '}')
2359                                 break; // end of entity
2360                         if (com_token[0] == '{')
2361                         {
2362                                 // brush
2363                                 if (firstbrush)
2364                                 {
2365                                         if (submodel)
2366                                         {
2367                                                 if (submodel > loadmodel->brush.numsubmodels)
2368                                                 {
2369                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2370                                                         model = NULL;
2371                                                 }
2372                                                 else
2373                                                         model = loadmodel->brush.submodels[submodel];
2374                                         }
2375                                         else
2376                                                 model = loadmodel;
2377                                 }
2378                                 for (;;)
2379                                 {
2380                                         if (!COM_ParseToken(&data, false))
2381                                                 return; // error
2382                                         if (com_token[0] == '}')
2383                                                 break; // end of brush
2384                                         // each brush face should be this format:
2385                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2386                                         // FIXME: support hl .map format
2387                                         for (pointnum = 0;pointnum < 3;pointnum++)
2388                                         {
2389                                                 COM_ParseToken(&data, false);
2390                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2391                                                 {
2392                                                         COM_ParseToken(&data, false);
2393                                                         point[pointnum][componentnum] = atof(com_token);
2394                                                 }
2395                                                 COM_ParseToken(&data, false);
2396                                         }
2397                                         COM_ParseToken(&data, false);
2398                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2399                                         COM_ParseToken(&data, false);
2400                                         //scroll_s = atof(com_token);
2401                                         COM_ParseToken(&data, false);
2402                                         //scroll_t = atof(com_token);
2403                                         COM_ParseToken(&data, false);
2404                                         //rotate = atof(com_token);
2405                                         COM_ParseToken(&data, false);
2406                                         //scale_s = atof(com_token);
2407                                         COM_ParseToken(&data, false);
2408                                         //scale_t = atof(com_token);
2409                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2410                                         VectorNormalizeDouble(planenormal);
2411                                         planedist = DotProduct(point[0], planenormal);
2412                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2413                                 }
2414                                 continue;
2415                         }
2416                 }
2417         }
2418 #endif
2419 }
2420
2421
2422 #define MAX_PORTALPOINTS 64
2423
2424 typedef struct portal_s
2425 {
2426         mplane_t plane;
2427         mnode_t *nodes[2];              // [0] = front side of plane
2428         struct portal_s *next[2];
2429         int numpoints;
2430         double points[3*MAX_PORTALPOINTS];
2431         struct portal_s *chain; // all portals are linked into a list
2432 }
2433 portal_t;
2434
2435 static portal_t *portalchain;
2436
2437 /*
2438 ===========
2439 AllocPortal
2440 ===========
2441 */
2442 static portal_t *AllocPortal(void)
2443 {
2444         portal_t *p;
2445         p = Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2446         p->chain = portalchain;
2447         portalchain = p;
2448         return p;
2449 }
2450
2451 static void FreePortal(portal_t *p)
2452 {
2453         Mem_Free(p);
2454 }
2455
2456 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2457 {
2458         // process only nodes (leafs already had their box calculated)
2459         if (!node->plane)
2460                 return;
2461
2462         // calculate children first
2463         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2464         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2465
2466         // make combined bounding box from children
2467         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2468         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2469         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2470         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2471         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2472         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2473 }
2474
2475 static void Mod_Q1BSP_FinalizePortals(void)
2476 {
2477         int i, j, numportals, numpoints;
2478         portal_t *p, *pnext;
2479         mportal_t *portal;
2480         mvertex_t *point;
2481         mleaf_t *leaf, *endleaf;
2482
2483         // recalculate bounding boxes for all leafs(because qbsp is very sloppy)
2484         leaf = loadmodel->brush.data_leafs;
2485         endleaf = leaf + loadmodel->brush.num_leafs;
2486         for (;leaf < endleaf;leaf++)
2487         {
2488                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
2489                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2490         }
2491         p = portalchain;
2492         while (p)
2493         {
2494                 if (p->numpoints >= 3)
2495                 {
2496                         for (i = 0;i < 2;i++)
2497                         {
2498                                 leaf = (mleaf_t *)p->nodes[i];
2499                                 for (j = 0;j < p->numpoints;j++)
2500                                 {
2501                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
2502                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
2503                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
2504                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
2505                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
2506                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
2507                                 }
2508                         }
2509                 }
2510                 p = p->chain;
2511         }
2512
2513         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
2514
2515         // tally up portal and point counts
2516         p = portalchain;
2517         numportals = 0;
2518         numpoints = 0;
2519         while (p)
2520         {
2521                 // note: this check must match the one below or it will usually corrupt memory
2522                 // the nodes[0] != nodes[1] check is because leaf 0 is the shared solid leaf, it can have many portals inside with leaf 0 on both sides
2523                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2524                 {
2525                         numportals += 2;
2526                         numpoints += p->numpoints * 2;
2527                 }
2528                 p = p->chain;
2529         }
2530         loadmodel->brush.data_portals = Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2531         loadmodel->brush.num_portals = numportals;
2532         loadmodel->brush.data_portalpoints = (void *)((qbyte *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2533         loadmodel->brush.num_portalpoints = numpoints;
2534         // clear all leaf portal chains
2535         for (i = 0;i < loadmodel->brush.num_leafs;i++)
2536                 loadmodel->brush.data_leafs[i].portals = NULL;
2537         // process all portals in the global portal chain, while freeing them
2538         portal = loadmodel->brush.data_portals;
2539         point = loadmodel->brush.data_portalpoints;
2540         p = portalchain;
2541         portalchain = NULL;
2542         while (p)
2543         {
2544                 pnext = p->chain;
2545
2546                 // note: this check must match the one above or it will usually corrupt memory
2547                 // the nodes[0] != nodes[1] check is because leaf 0 is the shared solid leaf, it can have many portals inside with leaf 0 on both sides
2548                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2549                 {
2550                         // first make the back to front portal(forward portal)
2551                         portal->points = point;
2552                         portal->numpoints = p->numpoints;
2553                         portal->plane.dist = p->plane.dist;
2554                         VectorCopy(p->plane.normal, portal->plane.normal);
2555                         portal->here = (mleaf_t *)p->nodes[1];
2556                         portal->past = (mleaf_t *)p->nodes[0];
2557                         // copy points
2558                         for (j = 0;j < portal->numpoints;j++)
2559                         {
2560                                 VectorCopy(p->points + j*3, point->position);
2561                                 point++;
2562                         }
2563                         BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2564                         PlaneClassify(&portal->plane);
2565
2566                         // link into leaf's portal chain
2567                         portal->next = portal->here->portals;
2568                         portal->here->portals = portal;
2569
2570                         // advance to next portal
2571                         portal++;
2572
2573                         // then make the front to back portal(backward portal)
2574                         portal->points = point;
2575                         portal->numpoints = p->numpoints;
2576                         portal->plane.dist = -p->plane.dist;
2577                         VectorNegate(p->plane.normal, portal->plane.normal);
2578                         portal->here = (mleaf_t *)p->nodes[0];
2579                         portal->past = (mleaf_t *)p->nodes[1];
2580                         // copy points
2581                         for (j = portal->numpoints - 1;j >= 0;j--)
2582                         {
2583                                 VectorCopy(p->points + j*3, point->position);
2584                                 point++;
2585                         }
2586                         BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2587                         PlaneClassify(&portal->plane);
2588
2589                         // link into leaf's portal chain
2590                         portal->next = portal->here->portals;
2591                         portal->here->portals = portal;
2592
2593                         // advance to next portal
2594                         portal++;
2595                 }
2596                 FreePortal(p);
2597                 p = pnext;
2598         }
2599 }
2600
2601 /*
2602 =============
2603 AddPortalToNodes
2604 =============
2605 */
2606 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2607 {
2608         if (!front)
2609                 Host_Error("AddPortalToNodes: NULL front node");
2610         if (!back)
2611                 Host_Error("AddPortalToNodes: NULL back node");
2612         if (p->nodes[0] || p->nodes[1])
2613                 Host_Error("AddPortalToNodes: already included");
2614         // note: front == back is handled gracefully, because leaf 0 is the shared solid leaf, it can often have portals with the same leaf on both sides
2615
2616         p->nodes[0] = front;
2617         p->next[0] = (portal_t *)front->portals;
2618         front->portals = (mportal_t *)p;
2619
2620         p->nodes[1] = back;
2621         p->next[1] = (portal_t *)back->portals;
2622         back->portals = (mportal_t *)p;
2623 }
2624
2625 /*
2626 =============
2627 RemovePortalFromNode
2628 =============
2629 */
2630 static void RemovePortalFromNodes(portal_t *portal)
2631 {
2632         int i;
2633         mnode_t *node;
2634         void **portalpointer;
2635         portal_t *t;
2636         for (i = 0;i < 2;i++)
2637         {
2638                 node = portal->nodes[i];
2639
2640                 portalpointer = (void **) &node->portals;
2641                 while (1)
2642                 {
2643                         t = *portalpointer;
2644                         if (!t)
2645                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
2646
2647                         if (t == portal)
2648                         {
2649                                 if (portal->nodes[0] == node)
2650                                 {
2651                                         *portalpointer = portal->next[0];
2652                                         portal->nodes[0] = NULL;
2653                                 }
2654                                 else if (portal->nodes[1] == node)
2655                                 {
2656                                         *portalpointer = portal->next[1];
2657                                         portal->nodes[1] = NULL;
2658                                 }
2659                                 else
2660                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2661                                 break;
2662                         }
2663
2664                         if (t->nodes[0] == node)
2665                                 portalpointer = (void **) &t->next[0];
2666                         else if (t->nodes[1] == node)
2667                                 portalpointer = (void **) &t->next[1];
2668                         else
2669                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2670                 }
2671         }
2672 }
2673
2674 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
2675 {
2676         int i, side;
2677         mnode_t *front, *back, *other_node;
2678         mplane_t clipplane, *plane;
2679         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
2680         int numfrontpoints, numbackpoints;
2681         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
2682
2683         // if a leaf, we're done
2684         if (!node->plane)
2685                 return;
2686
2687         plane = node->plane;
2688
2689         front = node->children[0];
2690         back = node->children[1];
2691         if (front == back)
2692                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
2693
2694         // create the new portal by generating a polygon for the node plane,
2695         // and clipping it by all of the other portals(which came from nodes above this one)
2696         nodeportal = AllocPortal();
2697         nodeportal->plane = *plane;
2698
2699         PolygonD_QuadForPlane(nodeportal->points, nodeportal->plane.normal[0], nodeportal->plane.normal[1], nodeportal->plane.normal[2], nodeportal->plane.dist, 1024.0*1024.0*1024.0);
2700         nodeportal->numpoints = 4;
2701         side = 0;       // shut up compiler warning
2702         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
2703         {
2704                 clipplane = portal->plane;
2705                 if (portal->nodes[0] == portal->nodes[1])
2706                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
2707                 if (portal->nodes[0] == node)
2708                         side = 0;
2709                 else if (portal->nodes[1] == node)
2710                 {
2711                         clipplane.dist = -clipplane.dist;
2712                         VectorNegate(clipplane.normal, clipplane.normal);
2713                         side = 1;
2714                 }
2715                 else
2716                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2717
2718                 for (i = 0;i < nodeportal->numpoints*3;i++)
2719                         frontpoints[i] = nodeportal->points[i];
2720                 PolygonD_Divide(nodeportal->numpoints, frontpoints, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, 1.0/32.0, MAX_PORTALPOINTS, nodeportal->points, &nodeportal->numpoints, 0, NULL, NULL);
2721                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
2722                         break;
2723         }
2724
2725         if (nodeportal->numpoints < 3)
2726         {
2727                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
2728                 nodeportal->numpoints = 0;
2729         }
2730         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
2731         {
2732                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
2733                 nodeportal->numpoints = 0;
2734         }
2735
2736         AddPortalToNodes(nodeportal, front, back);
2737
2738         // split the portals of this node along this node's plane and assign them to the children of this node
2739         // (migrating the portals downward through the tree)
2740         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
2741         {
2742                 if (portal->nodes[0] == portal->nodes[1])
2743                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
2744                 if (portal->nodes[0] == node)
2745                         side = 0;
2746                 else if (portal->nodes[1] == node)
2747                         side = 1;
2748                 else
2749                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2750                 nextportal = portal->next[side];
2751                 if (!portal->numpoints)
2752                         continue;
2753
2754                 other_node = portal->nodes[!side];
2755                 RemovePortalFromNodes(portal);
2756
2757                 // cut the portal into two portals, one on each side of the node plane
2758                 PolygonD_Divide(portal->numpoints, portal->points, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, 1.0/32.0, MAX_PORTALPOINTS, frontpoints, &numfrontpoints, MAX_PORTALPOINTS, backpoints, &numbackpoints);
2759
2760                 if (!numfrontpoints)
2761                 {
2762                         if (side == 0)
2763                                 AddPortalToNodes(portal, back, other_node);
2764                         else
2765                                 AddPortalToNodes(portal, other_node, back);
2766                         continue;
2767                 }
2768                 if (!numbackpoints)
2769                 {
2770                         if (side == 0)
2771                                 AddPortalToNodes(portal, front, other_node);
2772                         else
2773                                 AddPortalToNodes(portal, other_node, front);
2774                         continue;
2775                 }
2776
2777                 // the portal is split
2778                 splitportal = AllocPortal();
2779                 temp = splitportal->chain;
2780                 *splitportal = *portal;
2781                 splitportal->chain = temp;
2782                 for (i = 0;i < numbackpoints*3;i++)
2783                         splitportal->points[i] = backpoints[i];
2784                 splitportal->numpoints = numbackpoints;
2785                 for (i = 0;i < numfrontpoints*3;i++)
2786                         portal->points[i] = frontpoints[i];
2787                 portal->numpoints = numfrontpoints;
2788
2789                 if (side == 0)
2790                 {
2791                         AddPortalToNodes(portal, front, other_node);
2792                         AddPortalToNodes(splitportal, back, other_node);
2793                 }
2794                 else
2795                 {
2796                         AddPortalToNodes(portal, other_node, front);
2797                         AddPortalToNodes(splitportal, other_node, back);
2798                 }
2799         }
2800
2801         Mod_Q1BSP_RecursiveNodePortals(front);
2802         Mod_Q1BSP_RecursiveNodePortals(back);
2803 }
2804
2805 static void Mod_Q1BSP_MakePortals(void)
2806 {
2807         portalchain = NULL;
2808         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
2809         Mod_Q1BSP_FinalizePortals();
2810 }
2811
2812 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
2813 {
2814         int i, j, stylecounts[256], totalcount, remapstyles[256];
2815         msurface_t *surface;
2816         memset(stylecounts, 0, sizeof(stylecounts));
2817         for (i = 0;i < model->nummodelsurfaces;i++)
2818         {
2819                 surface = model->data_surfaces + model->firstmodelsurface + i;
2820                 for (j = 0;j < MAXLIGHTMAPS;j++)
2821                         stylecounts[surface->lightmapinfo->styles[j]]++;
2822         }
2823         totalcount = 0;
2824         model->brushq1.light_styles = 0;
2825         for (i = 0;i < 255;i++)
2826         {
2827                 if (stylecounts[i])
2828                 {
2829                         remapstyles[i] = model->brushq1.light_styles++;
2830                         totalcount += stylecounts[i] + 1;
2831                 }
2832         }
2833         if (!totalcount)
2834                 return;
2835         model->brushq1.light_style = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(qbyte));
2836         model->brushq1.light_stylevalue = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
2837         model->brushq1.light_styleupdatechains = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
2838         model->brushq1.light_styleupdatechainsbuffer = Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
2839         model->brushq1.light_styles = 0;
2840         for (i = 0;i < 255;i++)
2841                 if (stylecounts[i])
2842                         model->brushq1.light_style[model->brushq1.light_styles++] = i;
2843         j = 0;
2844         for (i = 0;i < model->brushq1.light_styles;i++)
2845         {
2846                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2847                 j += stylecounts[model->brushq1.light_style[i]] + 1;
2848         }
2849         for (i = 0;i < model->nummodelsurfaces;i++)
2850         {
2851                 surface = model->data_surfaces + model->firstmodelsurface + i;
2852                 for (j = 0;j < MAXLIGHTMAPS;j++)
2853                         if (surface->lightmapinfo->styles[j] != 255)
2854                                 *model->brushq1.light_styleupdatechains[remapstyles[surface->lightmapinfo->styles[j]]]++ = surface;
2855         }
2856         j = 0;
2857         for (i = 0;i < model->brushq1.light_styles;i++)
2858         {
2859                 *model->brushq1.light_styleupdatechains[i] = NULL;
2860                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2861                 j += stylecounts[model->brushq1.light_style[i]] + 1;
2862         }
2863 }
2864
2865 //Returns PVS data for a given point
2866 //(note: can return NULL)
2867 static qbyte *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
2868 {
2869         mnode_t *node;
2870         Mod_CheckLoaded(model);
2871         node = model->brush.data_nodes;
2872         while (node->plane)
2873                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
2874         if (((mleaf_t *)node)->clusterindex >= 0)
2875                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2876         else
2877                 return NULL;
2878 }
2879
2880 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbytes, mnode_t *node)
2881 {
2882         while (node->plane)
2883         {
2884                 float d = PlaneDiff(org, node->plane);
2885                 if (d > radius)
2886                         node = node->children[0];
2887                 else if (d < -radius)
2888                         node = node->children[1];
2889                 else
2890                 {
2891                         // go down both sides
2892                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
2893                         node = node->children[1];
2894                 }
2895         }
2896         // if this leaf is in a cluster, accumulate the pvs bits
2897         if (((mleaf_t *)node)->clusterindex >= 0)
2898         {
2899                 int i;
2900                 qbyte *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2901                 for (i = 0;i < pvsbytes;i++)
2902                         pvsbuffer[i] |= pvs[i];
2903         }
2904 }
2905
2906 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
2907 //of the given point.
2908 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbufferlength)
2909 {
2910         int bytes = model->brush.num_pvsclusterbytes;
2911         bytes = min(bytes, pvsbufferlength);
2912         if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
2913         {
2914                 memset(pvsbuffer, 0xFF, bytes);
2915                 return bytes;
2916         }
2917         memset(pvsbuffer, 0, bytes);
2918         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
2919         return bytes;
2920 }
2921
2922 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
2923 {
2924         vec3_t size;
2925         const hull_t *hull;
2926
2927         VectorSubtract(inmaxs, inmins, size);
2928         if (cmodel->brush.ismcbsp)
2929         {
2930                 if (size[0] < 3)
2931                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2932                 else if (size[2] < 48) // pick the nearest of 40 or 56
2933                         hull = &cmodel->brushq1.hulls[2]; // 16x16x40
2934                 else
2935                         hull = &cmodel->brushq1.hulls[1]; // 16x16x56
2936         }
2937         else if (cmodel->brush.ishlbsp)
2938         {
2939                 if (size[0] < 3)
2940                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2941                 else if (size[0] <= 32)
2942                 {
2943                         if (size[2] < 54) // pick the nearest of 36 or 72
2944                                 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
2945                         else
2946                                 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
2947                 }
2948                 else
2949                         hull = &cmodel->brushq1.hulls[2]; // 64x64x64
2950         }
2951         else
2952         {
2953                 if (size[0] < 3)
2954                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2955                 else if (size[0] <= 32)
2956                         hull = &cmodel->brushq1.hulls[1]; // 32x32x56
2957                 else
2958                         hull = &cmodel->brushq1.hulls[2]; // 64x64x88
2959         }
2960         VectorCopy(inmins, outmins);
2961         VectorAdd(inmins, hull->clip_size, outmaxs);
2962 }
2963
2964 void Mod_Q1BSP_Load(model_t *mod, void *buffer, void *bufferend)
2965 {
2966         int i, j, k;
2967         dheader_t *header;
2968         dmodel_t *bm;
2969         mempool_t *mainmempool;
2970         float dist, modelyawradius, modelradius, *vec;
2971         msurface_t *surface;
2972         int numshadowmeshtriangles;
2973
2974         mod->type = mod_brushq1;
2975
2976         if (!memcmp(buffer, "MCBSP", 5))
2977         {
2978                 header = (dheader_t *)((unsigned char*)buffer + 5);
2979
2980                 i = LittleLong(header->version);
2981                 if (i != MCBSPVERSION)
2982                         Host_Error("Mod_Q1BSP_Load: %s has wrong version number(MCBSP %i should be %i", mod->name, i, MCBSPVERSION);
2983                 mod->brush.ismcbsp = true;
2984                 mod->brush.ishlbsp = false;
2985         }
2986         else
2987         {
2988                 header = (dheader_t *)buffer;
2989
2990                 i = LittleLong(header->version);
2991                 if (i != BSPVERSION && i != 30)
2992                         Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
2993                 mod->brush.ishlbsp = i == 30;
2994         }
2995
2996         mod->soundfromcenter = true;
2997         mod->TraceBox = Mod_Q1BSP_TraceBox;
2998         mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
2999         mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3000         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3001         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3002         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3003         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3004         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3005         mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3006         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3007         mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3008         mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3009         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3010
3011         if (loadmodel->isworldmodel)
3012         {
3013                 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3014                 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3015         }
3016
3017 // swap all the lumps
3018         mod_base = (qbyte *)header;
3019
3020         header->version = LittleLong(header->version);
3021         for (i = 0;i < HEADER_LUMPS;i++)
3022         {
3023                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3024                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3025         }
3026
3027 // load into heap
3028
3029         // store which lightmap format to use
3030         mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3031
3032         Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3033         Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3034         Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3035         Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3036         Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3037         Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3038         Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3039         Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3040         Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3041         Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3042         Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3043         // load submodels before leafs because they contain the number of vis leafs
3044         Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS]);
3045         Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3046         Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3047         Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES]);
3048
3049         if (!mod->brushq1.lightdata)
3050                 mod->brush.LightPoint = NULL;
3051
3052         if (mod->brushq1.data_compressedpvs)
3053                 Mem_Free(mod->brushq1.data_compressedpvs);
3054         mod->brushq1.data_compressedpvs = NULL;
3055         mod->brushq1.num_compressedpvs = 0;
3056
3057         Mod_Q1BSP_MakeHull0();
3058         Mod_Q1BSP_MakePortals();
3059
3060         mod->numframes = 2;             // regular and alternate animation
3061         mod->numskins = 1;
3062
3063         mainmempool = mod->mempool;
3064
3065         Mod_Q1BSP_LoadLightList();
3066
3067         // make a single combined shadow mesh to allow optimized shadow volume creation
3068         numshadowmeshtriangles = 0;
3069         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3070         {
3071                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3072                 numshadowmeshtriangles += surface->num_triangles;
3073         }
3074         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3075         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3076                 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, surface->groupmesh->data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle));
3077         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
3078         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3079
3080         if (loadmodel->brush.numsubmodels)
3081                 loadmodel->brush.submodels = Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(model_t *));
3082
3083         if (loadmodel->isworldmodel)
3084         {
3085                 // clear out any stale submodels or worldmodels lying around
3086                 // if we did this clear before now, an error might abort loading and
3087                 // leave things in a bad state
3088                 Mod_RemoveStaleWorldModels(loadmodel);
3089         }
3090
3091         // LordHavoc: to clear the fog around the original quake submodel code, I
3092         // will explain:
3093         // first of all, some background info on the submodels:
3094         // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3095         // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3096         // now the weird for loop itself:
3097         // the loop functions in an odd way, on each iteration it sets up the
3098         // current 'mod' model (which despite the confusing code IS the model of
3099         // the number i), at the end of the loop it duplicates the model to become
3100         // the next submodel, and loops back to set up the new submodel.
3101
3102         // LordHavoc: now the explanation of my sane way (which works identically):
3103         // set up the world model, then on each submodel copy from the world model
3104         // and set up the submodel with the respective model info.
3105         for (i = 0;i < mod->brush.numsubmodels;i++)
3106         {
3107                 // LordHavoc: this code was originally at the end of this loop, but
3108                 // has been transformed to something more readable at the start here.
3109
3110                 if (i > 0)
3111                 {
3112                         char name[10];
3113                         // LordHavoc: only register submodels if it is the world
3114                         // (prevents external bsp models from replacing world submodels with
3115                         //  their own)
3116                         if (!loadmodel->isworldmodel)
3117                                 continue;
3118                         // duplicate the basic information
3119                         sprintf(name, "*%i", i);
3120                         mod = Mod_FindName(name);
3121                         // copy the base model to this one
3122                         *mod = *loadmodel;
3123                         // rename the clone back to its proper name
3124                         strcpy(mod->name, name);
3125                         // textures and memory belong to the main model
3126                         mod->texturepool = NULL;
3127                         mod->mempool = NULL;
3128                 }
3129
3130                 mod->brush.submodel = i;
3131
3132                 if (loadmodel->brush.submodels)
3133                         loadmodel->brush.submodels[i] = mod;
3134
3135                 bm = &mod->brushq1.submodels[i];
3136
3137                 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3138                 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3139                 {
3140                         mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3141                         mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3142                 }
3143
3144                 mod->firstmodelsurface = bm->firstface;
3145                 mod->nummodelsurfaces = bm->numfaces;
3146
3147                 // make the model surface list (used by shadowing/lighting)
3148                 mod->surfacelist = Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
3149                 for (j = 0;j < mod->nummodelsurfaces;j++)
3150                         mod->surfacelist[j] = mod->firstmodelsurface + j;
3151
3152                 // this gets altered below if sky is used
3153                 mod->DrawSky = NULL;
3154                 mod->Draw = R_Q1BSP_Draw;
3155                 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3156                 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3157                 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3158                 mod->DrawLight = R_Q1BSP_DrawLight;
3159                 if (i != 0)
3160                 {
3161                         mod->brush.GetPVS = NULL;
3162                         mod->brush.FatPVS = NULL;
3163                         mod->brush.BoxTouchingPVS = NULL;
3164                         mod->brush.BoxTouchingLeafPVS = NULL;
3165                         mod->brush.BoxTouchingVisibleLeafs = NULL;
3166                         mod->brush.LightPoint = NULL;
3167                         mod->brush.AmbientSoundLevelsForPoint = NULL;
3168                 }
3169                 Mod_Q1BSP_BuildLightmapUpdateChains(loadmodel->mempool, mod);
3170                 if (mod->nummodelsurfaces)
3171                 {
3172                         // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3173                         mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3174                         mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3175                         modelyawradius = 0;
3176                         modelradius = 0;
3177                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3178                         {
3179                                 // we only need to have a drawsky function if it is used(usually only on world model)
3180                                 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3181                                         mod->DrawSky = R_Q1BSP_DrawSky;
3182                                 // calculate bounding shapes
3183                                 for (k = 0, vec = (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex);k < surface->num_vertices;k++, vec += 3)
3184                                 {
3185                                         if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3186                                         if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3187                                         if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3188                                         if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3189                                         if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3190                                         if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3191                                         dist = vec[0]*vec[0]+vec[1]*vec[1];
3192                                         if (modelyawradius < dist)
3193                                                 modelyawradius = dist;
3194                                         dist += vec[2]*vec[2];
3195                                         if (modelradius < dist)
3196                                                 modelradius = dist;
3197                                 }
3198                         }
3199                         modelyawradius = sqrt(modelyawradius);
3200                         modelradius = sqrt(modelradius);
3201                         mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3202                         mod->yawmins[2] = mod->normalmins[2];
3203                         mod->yawmaxs[2] = mod->normalmaxs[2];
3204                         mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3205                         mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3206                         mod->radius = modelradius;
3207                         mod->radius2 = modelradius * modelradius;
3208                 }
3209                 else
3210                 {
3211                         // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3212                         Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3213                 }
3214                 //mod->brushq1.num_visleafs = bm->visleafs;
3215         }
3216
3217         Mod_Q1BSP_LoadMapBrushes();
3218
3219         //Mod_Q1BSP_ProcessLightList();
3220
3221         if (developer.integer)
3222                 Con_Printf("Some stats for q1bsp model \"%s\": %i faces, %i nodes, %i leafs, %i visleafs, %i visleafportals\n", loadmodel->name, loadmodel->num_surfaces, loadmodel->brush.num_nodes, loadmodel->brush.num_leafs, mod->brush.num_pvsclusters, loadmodel->brush.num_portals);
3223 }
3224
3225 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3226 {
3227 }
3228
3229 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3230 {
3231 /*
3232         d_t *in;
3233         m_t *out;
3234         int i, count;
3235
3236         in = (void *)(mod_base + l->fileofs);
3237         if (l->filelen % sizeof(*in))
3238                 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3239         count = l->filelen / sizeof(*in);
3240         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3241
3242         loadmodel-> = out;
3243         loadmodel->num = count;
3244
3245         for (i = 0;i < count;i++, in++, out++)
3246         {
3247         }
3248 */
3249 }
3250
3251 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3252 {
3253 /*
3254         d_t *in;
3255         m_t *out;
3256         int i, count;
3257
3258         in = (void *)(mod_base + l->fileofs);
3259         if (l->filelen % sizeof(*in))
3260                 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3261         count = l->filelen / sizeof(*in);
3262         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3263
3264         loadmodel-> = out;
3265         loadmodel->num = count;
3266
3267         for (i = 0;i < count;i++, in++, out++)
3268         {
3269         }
3270 */
3271 }
3272
3273 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3274 {
3275 /*
3276         d_t *in;
3277         m_t *out;
3278         int i, count;
3279
3280         in = (void *)(mod_base + l->fileofs);
3281         if (l->filelen % sizeof(*in))
3282                 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3283         count = l->filelen / sizeof(*in);
3284         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3285
3286         loadmodel-> = out;
3287         loadmodel->num = count;
3288
3289         for (i = 0;i < count;i++, in++, out++)
3290         {
3291         }
3292 */
3293 }
3294
3295 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3296 {
3297 /*
3298         d_t *in;
3299         m_t *out;
3300         int i, count;
3301
3302         in = (void *)(mod_base + l->fileofs);
3303         if (l->filelen % sizeof(*in))
3304                 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3305         count = l->filelen / sizeof(*in);
3306         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3307
3308         loadmodel-> = out;
3309         loadmodel->num = count;
3310
3311         for (i = 0;i < count;i++, in++, out++)
3312         {
3313         }
3314 */
3315 }
3316
3317 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3318 {
3319 /*
3320         d_t *in;
3321         m_t *out;
3322         int i, count;
3323
3324         in = (void *)(mod_base + l->fileofs);
3325         if (l->filelen % sizeof(*in))
3326                 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3327         count = l->filelen / sizeof(*in);
3328         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3329
3330         loadmodel-> = out;
3331         loadmodel->num = count;
3332
3333         for (i = 0;i < count;i++, in++, out++)
3334         {
3335         }
3336 */
3337 }
3338
3339 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3340 {
3341 /*
3342         d_t *in;
3343         m_t *out;
3344         int i, count;
3345
3346         in = (void *)(mod_base + l->fileofs);
3347         if (l->filelen % sizeof(*in))
3348                 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3349         count = l->filelen / sizeof(*in);
3350         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3351
3352         loadmodel-> = out;
3353         loadmodel->num = count;
3354
3355         for (i = 0;i < count;i++, in++, out++)
3356         {
3357         }
3358 */
3359 }
3360
3361 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3362 {
3363 /*
3364         d_t *in;
3365         m_t *out;
3366         int i, count;
3367
3368         in = (void *)(mod_base + l->fileofs);
3369         if (l->filelen % sizeof(*in))
3370                 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3371         count = l->filelen / sizeof(*in);
3372         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3373
3374         loadmodel-> = out;
3375         loadmodel->num = count;
3376
3377         for (i = 0;i < count;i++, in++, out++)
3378         {
3379         }
3380 */
3381 }
3382
3383 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3384 {
3385 /*
3386         d_t *in;
3387         m_t *out;
3388         int i, count;
3389
3390         in = (void *)(mod_base + l->fileofs);
3391         if (l->filelen % sizeof(*in))
3392                 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3393         count = l->filelen / sizeof(*in);
3394         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3395
3396         loadmodel-> = out;
3397         loadmodel->num = count;
3398
3399         for (i = 0;i < count;i++, in++, out++)
3400         {
3401         }
3402 */
3403 }
3404
3405 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3406 {
3407 /*
3408         d_t *in;
3409         m_t *out;
3410         int i, count;
3411
3412         in = (void *)(mod_base + l->fileofs);
3413         if (l->filelen % sizeof(*in))
3414                 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3415         count = l->filelen / sizeof(*in);
3416         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3417
3418         loadmodel-> = out;
3419         loadmodel->num = count;
3420
3421         for (i = 0;i < count;i++, in++, out++)
3422         {
3423         }
3424 */
3425 }
3426
3427 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3428 {
3429 /*
3430         d_t *in;
3431         m_t *out;
3432         int i, count;
3433
3434         in = (void *)(mod_base + l->fileofs);
3435         if (l->filelen % sizeof(*in))
3436                 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3437         count = l->filelen / sizeof(*in);
3438         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3439
3440         loadmodel-> = out;
3441         loadmodel->num = count;
3442
3443         for (i = 0;i < count;i++, in++, out++)
3444         {
3445         }
3446 */
3447 }
3448
3449 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3450 {
3451 /*
3452         d_t *in;
3453         m_t *out;
3454         int i, count;
3455
3456         in = (void *)(mod_base + l->fileofs);
3457         if (l->filelen % sizeof(*in))
3458                 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3459         count = l->filelen / sizeof(*in);
3460         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3461
3462         loadmodel-> = out;
3463         loadmodel->num = count;
3464
3465         for (i = 0;i < count;i++, in++, out++)
3466         {
3467         }
3468 */
3469 }
3470
3471 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3472 {
3473 /*
3474         d_t *in;
3475         m_t *out;
3476         int i, count;
3477
3478         in = (void *)(mod_base + l->fileofs);
3479         if (l->filelen % sizeof(*in))
3480                 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3481         count = l->filelen / sizeof(*in);
3482         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3483
3484         loadmodel-> = out;
3485         loadmodel->num = count;
3486
3487         for (i = 0;i < count;i++, in++, out++)
3488         {
3489         }
3490 */
3491 }
3492
3493 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3494 {
3495 /*
3496         d_t *in;
3497         m_t *out;
3498         int i, count;
3499
3500         in = (void *)(mod_base + l->fileofs);
3501         if (l->filelen % sizeof(*in))
3502                 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3503         count = l->filelen / sizeof(*in);
3504         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3505
3506         loadmodel-> = out;
3507         loadmodel->num = count;
3508
3509         for (i = 0;i < count;i++, in++, out++)
3510         {
3511         }
3512 */
3513 }
3514
3515 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
3516 {
3517 /*
3518         d_t *in;
3519         m_t *out;
3520         int i, count;
3521
3522         in = (void *)(mod_base + l->fileofs);
3523         if (l->filelen % sizeof(*in))
3524                 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3525         count = l->filelen / sizeof(*in);
3526         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3527
3528         loadmodel-> = out;
3529         loadmodel->num = count;
3530
3531         for (i = 0;i < count;i++, in++, out++)
3532         {
3533         }
3534 */
3535 }
3536
3537 static void Mod_Q2BSP_LoadAreas(lump_t *l)
3538 {
3539 /*
3540         d_t *in;
3541         m_t *out;
3542         int i, count;
3543
3544         in = (void *)(mod_base + l->fileofs);
3545         if (l->filelen % sizeof(*in))
3546                 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
3547         count = l->filelen / sizeof(*in);
3548         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3549
3550         loadmodel-> = out;
3551         loadmodel->num = count;
3552
3553         for (i = 0;i < count;i++, in++, out++)
3554         {
3555         }
3556 */
3557 }
3558
3559 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
3560 {
3561 /*
3562         d_t *in;
3563         m_t *out;
3564         int i, count;
3565
3566         in = (void *)(mod_base + l->fileofs);
3567         if (l->filelen % sizeof(*in))
3568                 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
3569         count = l->filelen / sizeof(*in);
3570         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3571
3572         loadmodel-> = out;
3573         loadmodel->num = count;
3574
3575         for (i = 0;i < count;i++, in++, out++)
3576         {
3577         }
3578 */
3579 }
3580
3581 static void Mod_Q2BSP_LoadModels(lump_t *l)
3582 {
3583 /*
3584         d_t *in;
3585         m_t *out;
3586         int i, count;
3587
3588         in = (void *)(mod_base + l->fileofs);
3589         if (l->filelen % sizeof(*in))
3590                 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
3591         count = l->filelen / sizeof(*in);
3592         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3593
3594         loadmodel-> = out;
3595         loadmodel->num = count;
3596
3597         for (i = 0;i < count;i++, in++, out++)
3598         {
3599         }
3600 */
3601 }
3602
3603 void static Mod_Q2BSP_Load(model_t *mod, void *buffer, void *bufferend)
3604 {
3605         int i;
3606         q2dheader_t *header;
3607
3608         Host_Error("Mod_Q2BSP_Load: not yet implemented\n");
3609
3610         mod->type = mod_brushq2;
3611
3612         header = (q2dheader_t *)buffer;
3613
3614         i = LittleLong(header->version);
3615         if (i != Q2BSPVERSION)
3616                 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
3617         mod->brush.ishlbsp = false;
3618         mod->brush.ismcbsp = false;
3619         if (loadmodel->isworldmodel)
3620         {
3621                 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3622                 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3623         }
3624
3625         mod_base = (qbyte *)header;
3626
3627         // swap all the lumps
3628         for (i = 0;i < (int) sizeof(*header) / 4;i++)
3629                 ((int *)header)[i] = LittleLong(((int *)header)[i]);
3630
3631         // store which lightmap format to use
3632         mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3633
3634         Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
3635         Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
3636         Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
3637         Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
3638         Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
3639         Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
3640         Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
3641         Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
3642         Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
3643         Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
3644         Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
3645         Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
3646         Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
3647         Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
3648         Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
3649         Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
3650         Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
3651         // LordHavoc: must go last because this makes the submodels
3652         Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
3653 }
3654
3655 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents);
3656 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents);
3657
3658 static void Mod_Q3BSP_LoadEntities(lump_t *l)
3659 {
3660         const char *data;
3661         char key[128], value[4096];
3662         float v[3];
3663         loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
3664         loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
3665         loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
3666         if (!l->filelen)
3667                 return;
3668         loadmodel->brush.entities = Mem_Alloc(loadmodel->mempool, l->filelen);
3669         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
3670         data = loadmodel->brush.entities;
3671         // some Q3 maps override the lightgrid_cellsize with a worldspawn key
3672         if (data && COM_ParseToken(&data, false) && com_token[0] == '{')
3673         {
3674                 while (1)
3675                 {
3676                         if (!COM_ParseToken(&data, false))
3677                                 break; // error
3678                         if (com_token[0] == '}')
3679                                 break; // end of worldspawn
3680                         if (com_token[0] == '_')
3681                                 strcpy(key, com_token + 1);
3682                         else
3683                                 strcpy(key, com_token);
3684                         while (key[strlen(key)-1] == ' ') // remove trailing spaces
3685                                 key[strlen(key)-1] = 0;
3686                         if (!COM_ParseToken(&data, false))
3687                                 break; // error
3688                         strcpy(value, com_token);
3689                         if (!strcmp("gridsize", key))
3690                         {
3691                                 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
3692                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
3693                         }
3694                 }
3695         }
3696 }
3697
3698 static void Mod_Q3BSP_LoadTextures(lump_t *l)
3699 {
3700         q3dtexture_t *in;
3701         texture_t *out;
3702         int i, count;
3703         int j, c;
3704         fssearch_t *search;
3705         char *f;
3706         const char *text;
3707         int flags, flags2, numparameters, passnumber;
3708         char shadername[Q3PATHLENGTH];
3709         char sky[Q3PATHLENGTH];
3710         char firstpasstexturename[Q3PATHLENGTH];
3711         char parameter[4][Q3PATHLENGTH];
3712
3713         in = (void *)(mod_base + l->fileofs);
3714         if (l->filelen % sizeof(*in))
3715                 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
3716         count = l->filelen / sizeof(*in);
3717         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3718
3719         loadmodel->data_textures = out;
3720         loadmodel->num_textures = count;
3721
3722         for (i = 0;i < count;i++, in++, out++)
3723         {
3724                 strlcpy (out->name, in->name, sizeof (out->name));
3725                 out->surfaceflags = LittleLong(in->surfaceflags);
3726                 out->supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in->contents));
3727                 out->surfaceparms = -1;
3728         }
3729
3730         // do a quick parse of shader files to get surfaceparms
3731         if ((search = FS_Search("scripts/*.shader", true, false)))
3732         {
3733                 for (i = 0;i < search->numfilenames;i++)
3734                 {
3735                         if ((f = FS_LoadFile(search->filenames[i], tempmempool, false)))
3736                         {
3737                                 text = f;
3738                                 while (COM_ParseToken(&text, false))
3739                                 {
3740                                         strlcpy (shadername, com_token, sizeof (shadername));
3741                                         flags = 0;
3742                                         flags2 = 0;
3743                                         sky[0] = 0;
3744                                         passnumber = 0;
3745                                         firstpasstexturename[0] = 0;
3746                                         if (COM_ParseToken(&text, false) && !strcasecmp(com_token, "{"))
3747                                         {
3748                                                 while (COM_ParseToken(&text, false))
3749                                                 {
3750                                                         if (!strcasecmp(com_token, "}"))
3751                                                                 break;
3752                                                         else if (!strcasecmp(com_token, "{"))
3753                                                         {
3754                                                                 while (COM_ParseToken(&text, false))
3755                                                                 {
3756                                                                         if (!strcasecmp(com_token, "}"))
3757                                                                                 break;
3758                                                                         if (!strcasecmp(com_token, "\n"))
3759                                                                                 continue;
3760                                                                         numparameters = 0;
3761                                                                         for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
3762                                                                         {
3763                                                                                 if (j < 4)
3764                                                                                 {
3765                                                                                         strlcpy(parameter[j], com_token, sizeof(parameter[j]));
3766                                                                                         numparameters = j + 1;
3767                                                                                 }
3768                                                                                 if (!COM_ParseToken(&text, true))
3769                                                                                         break;
3770                                                                         }
3771                                                                         if (developer.integer >= 2)
3772                                                                         {
3773                                                                                 Con_Printf("%s %i: ", shadername, passnumber);
3774                                                                                 for (j = 0;j < numparameters;j++)
3775                                                                                         Con_Printf(" %s", parameter[j]);
3776                                                                                 Con_Print("\n");
3777                                                                         }
3778                                                                         if (passnumber == 0 && numparameters >= 1)
3779                                                                         {
3780                                                                                 if (!strcasecmp(parameter[0], "blendfunc") && (flags & Q3SURFACEPARM_TRANS))
3781                                                                                 {
3782                                                                                         if (numparameters == 2 && !strcasecmp(parameter[1], "add"))
3783                                                                                                 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3784                                                                                         else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_one") && !strcasecmp(parameter[2], "gl_one"))
3785                                                                                                 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3786                                                                                         else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_src_alpha") && !strcasecmp(parameter[2], "gl_one"))
3787                                                                                                 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3788                                                                                 }
3789                                                                                 else if (numparameters >= 2 && (!strcasecmp(parameter[0], "map") || !strcasecmp(parameter[0], "clampmap")))
3790                                                                                         strlcpy(firstpasstexturename, parameter[1], sizeof(firstpasstexturename));
3791                                                                                 else if (numparameters >= 3 && !strcasecmp(parameter[0], "animmap"))
3792                                                                                         strlcpy(firstpasstexturename, parameter[2], sizeof(firstpasstexturename));
3793                                                                                 else if (numparameters >= 2 && !strcasecmp(parameter[0], "alphafunc"))
3794                                                                                         flags2 |= Q3TEXTUREFLAG_ALPHATEST;
3795                                                                         }
3796                                                                         // break out a level if it was }
3797                                                                         if (!strcasecmp(com_token, "}"))
3798                                                                                 break;
3799                                                                 }
3800                                                                 passnumber++;
3801                                                                 continue;
3802                                                         }
3803                                                         numparameters = 0;
3804                                                         for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
3805                                                         {
3806                                                                 if (j < 4)
3807                                                                 {
3808                                                                         strlcpy(parameter[j], com_token, sizeof(parameter[j]));
3809                                                                         numparameters = j + 1;
3810                                                                 }
3811                                                                 if (!COM_ParseToken(&text, true))
3812                                                                         break;
3813                                                         }
3814                                                         if (i == 0 && !strcasecmp(com_token, "}"))
3815                                                                 break;
3816                                                         if (developer.integer >= 2)
3817                                                         {
3818                                                                 Con_Printf("%s: ", shadername);
3819                                                                 for (j = 0;j < numparameters;j++)
3820                                                                         Con_Printf(" %s", parameter[j]);
3821                                                                 Con_Print("\n");
3822                                                         }
3823                                                         if (numparameters < 1)
3824                                                                 continue;
3825                                                         if (!strcasecmp(parameter[0], "surfaceparm") && numparameters >= 2)
3826                                                         {
3827                                                                 if (!strcasecmp(parameter[1], "alphashadow"))
3828                                                                         flags |= Q3SURFACEPARM_ALPHASHADOW;
3829                                                                 else if (!strcasecmp(parameter[1], "areaportal"))
3830                                                                         flags |= Q3SURFACEPARM_AREAPORTAL;
3831                                                                 else if (!strcasecmp(parameter[1], "clusterportal"))
3832                                                                         flags |= Q3SURFACEPARM_CLUSTERPORTAL;
3833                                                                 else if (!strcasecmp(parameter[1], "detail"))
3834                                                                         flags |= Q3SURFACEPARM_DETAIL;
3835                                                                 else if (!strcasecmp(parameter[1], "donotenter"))
3836                                                                         flags |= Q3SURFACEPARM_DONOTENTER;
3837                                                                 else if (!strcasecmp(parameter[1], "fog"))
3838                                                                         flags |= Q3SURFACEPARM_FOG;
3839                                                                 else if (!strcasecmp(parameter[1], "lava"))
3840                                                                         flags |= Q3SURFACEPARM_LAVA;
3841                                                                 else if (!strcasecmp(parameter[1], "lightfilter"))
3842                                                                         flags |= Q3SURFACEPARM_LIGHTFILTER;
3843                                                                 else if (!strcasecmp(parameter[1], "metalsteps"))
3844                                                                         flags |= Q3SURFACEPARM_METALSTEPS;
3845                                                                 else if (!strcasecmp(parameter[1], "nodamage"))
3846                                                                         flags |= Q3SURFACEPARM_NODAMAGE;
3847                                                                 else if (!strcasecmp(parameter[1], "nodlight"))
3848                                                                         flags |= Q3SURFACEPARM_NODLIGHT;
3849                                                                 else if (!strcasecmp(parameter[1], "nodraw"))
3850                                                                         flags |= Q3SURFACEPARM_NODRAW;
3851                                                                 else if (!strcasecmp(parameter[1], "nodrop"))
3852                                                                         flags |= Q3SURFACEPARM_NODROP;
3853                                                                 else if (!strcasecmp(parameter[1], "noimpact"))
3854                                                                         flags |= Q3SURFACEPARM_NOIMPACT;
3855                                                                 else if (!strcasecmp(parameter[1], "nolightmap"))
3856                                                                         flags |= Q3SURFACEPARM_NOLIGHTMAP;
3857                                                                 else if (!strcasecmp(parameter[1], "nomarks"))
3858                                                                         flags |= Q3SURFACEPARM_NOMARKS;
3859                                                                 else if (!strcasecmp(parameter[1], "nomipmaps"))
3860                                                                         flags |= Q3SURFACEPARM_NOMIPMAPS;
3861                                                                 else if (!strcasecmp(parameter[1], "nonsolid"))
3862                                                                         flags |= Q3SURFACEPARM_NONSOLID;
3863                                                                 else if (!strcasecmp(parameter[1], "origin"))
3864                                                                         flags |= Q3SURFACEPARM_ORIGIN;
3865                                                                 else if (!strcasecmp(parameter[1], "playerclip"))
3866                                                                         flags |= Q3SURFACEPARM_PLAYERCLIP;
3867                                                                 else if (!strcasecmp(parameter[1], "sky"))
3868                                                                         flags |= Q3SURFACEPARM_SKY;
3869                                                                 else if (!strcasecmp(parameter[1], "slick"))
3870                                                                         flags |= Q3SURFACEPARM_SLICK;
3871                                                                 else if (!strcasecmp(parameter[1], "slime"))
3872                                                                         flags |= Q3SURFACEPARM_SLIME;
3873                                                                 else if (!strcasecmp(parameter[1], "structural"))
3874                                                                         flags |= Q3SURFACEPARM_STRUCTURAL;
3875                                                                 else if (!strcasecmp(parameter[1], "trans"))
3876                                                                         flags |= Q3SURFACEPARM_TRANS;
3877                                                                 else if (!strcasecmp(parameter[1], "water"))
3878                                                                         flags |= Q3SURFACEPARM_WATER;
3879                                                                 else if (!strcasecmp(parameter[1], "pointlight"))
3880                                                                         flags |= Q3SURFACEPARM_POINTLIGHT;
3881                                                                 else
3882                                                                         Con_Printf("%s parsing warning: unknown surfaceparm \"%s\"\n", search->filenames[i], parameter[1]);
3883                                                         }
3884                                                         else if (!strcasecmp(parameter[0], "sky") && numparameters >= 2)
3885                                                                 strlcpy(sky, parameter[1], sizeof(sky));
3886                                                         else if (!strcasecmp(parameter[0], "skyparms") && numparameters >= 2)
3887                                                         {
3888                                                                 if (!atoi(parameter[1]) && strcasecmp(parameter[1], "-"))
3889                                                                         strlcpy(sky, parameter[1], sizeof(sky));
3890                                                         }
3891                                                         else if (!strcasecmp(parameter[0], "cull") && numparameters >= 2)
3892                                                         {
3893                                                                 if (!strcasecmp(parameter[1], "disable") || !strcasecmp(parameter[1], "none") || !strcasecmp(parameter[1], "twosided"))
3894                                                                         flags2 |= Q3TEXTUREFLAG_TWOSIDED;
3895                                                         }
3896                                                         else if (!strcasecmp(parameter[0], "nomipmaps"))
3897                                                                 flags2 |= Q3TEXTUREFLAG_NOMIPMAPS;
3898                                                         else if (!strcasecmp(parameter[0], "nopicmip"))
3899                                                                 flags2 |= Q3TEXTUREFLAG_NOPICMIP;
3900                                                         else if (!strcasecmp(parameter[0], "deformvertexes") && numparameters >= 2)
3901                                                         {
3902                                                                 if (!strcasecmp(parameter[1], "autosprite") && numparameters == 2)
3903                                                                         flags2 |= Q3TEXTUREFLAG_AUTOSPRITE;
3904                                                                 if (!strcasecmp(parameter[1], "autosprite2") && numparameters == 2)
3905                                                                         flags2 |= Q3TEXTUREFLAG_AUTOSPRITE2;
3906                                                         }
3907                                                 }
3908                                                 // add shader to list (shadername and flags)
3909                                                 // actually here we just poke into the texture settings
3910                                                 for (j = 0, out = loadmodel->data_textures;j < loadmodel->num_textures;j++, out++)
3911                                                 {
3912                                                         if (!strcasecmp(out->name, shadername))
3913                                                         {
3914                                                                 out->surfaceparms = flags;
3915                                                                 out->textureflags = flags2;
3916                                                                 out->basematerialflags = 0;
3917                                                                 if (out->surfaceparms & Q3SURFACEPARM_NODRAW)
3918                                                                         out->basematerialflags |= MATERIALFLAG_NODRAW;
3919                                                                 else if (out->surfaceparms & Q3SURFACEPARM_SKY)
3920                                                                         out->basematerialflags |= MATERIALFLAG_SKY;
3921                                                                 else if (out->surfaceparms & Q3SURFACEPARM_LAVA)
3922                                                                         out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_FULLBRIGHT;
3923                                                                 else if (out->surfaceparms & Q3SURFACEPARM_SLIME)
3924                                                                         out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_WATERALPHA;
3925                                                                 else if (out->surfaceparms & Q3SURFACEPARM_WATER)
3926                                                                         out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_WATERALPHA;
3927                                                                 else
3928                                                                         out->basematerialflags |= MATERIALFLAG_WALL;
3929                                                                 if (out->textureflags & Q3TEXTUREFLAG_ALPHATEST)
3930                                                                 {
3931                                                                         // FIXME: support alpha test?
3932                                                                         out->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
3933                                                                 }
3934                                                                 else if (out->surfaceparms & Q3SURFACEPARM_TRANS)
3935                                                                 {
3936                                                                         if (out->textureflags & Q3TEXTUREFLAG_ADDITIVE)
3937                                                                                 out->basematerialflags |= MATERIALFLAG_ADD | MATERIALFLAG_TRANSPARENT;
3938                                                                         else
3939                                                                                 out->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
3940                                                                 }
3941                                                                 strlcpy(out->firstpasstexturename, firstpasstexturename, sizeof(out->firstpasstexturename));
3942                                                                 if ((flags & Q3SURFACEPARM_SKY) && sky[0])
3943                                                                 {
3944                                                                         // quake3 seems to append a _ to the skybox name, so this must do so as well
3945                                                                         dpsnprintf(loadmodel->brush.skybox, sizeof(loadmodel->brush.skybox), "%s_", sky);
3946                                                                 }
3947                                                         }
3948                                                 }
3949                                         }
3950                                         else
3951                                         {
3952                                                 Con_Printf("%s parsing error - expected \"{\", found \"%s\"\n", search->filenames[i], com_token);
3953                                                 goto parseerror;
3954                                         }
3955                                 }
3956 parseerror:
3957                                 Mem_Free(f);
3958                         }
3959                 }
3960         }
3961
3962         c = 0;
3963         for (j = 0, out = loadmodel->data_textures;j < loadmodel->num_textures;j++, out++)
3964         {
3965                 if (out->surfaceparms == -1)
3966                 {
3967                         c++;
3968                         Con_DPrintf("%s: No shader found for texture \"%s\"\n", loadmodel->name, out->name);
3969                         out->surfaceparms = 0;
3970                         if (out->surfaceflags & Q3SURFACEFLAG_NODRAW)
3971                                 out->basematerialflags |= MATERIALFLAG_NODRAW;
3972                         else if (out->surfaceflags & Q3SURFACEFLAG_SKY)
3973                                 out->basematerialflags |= MATERIALFLAG_SKY;
3974                         else
3975                                 out->basematerialflags |= MATERIALFLAG_WALL;
3976                         // these are defaults
3977                         //if (!strncmp(out->name, "textures/skies/", 15))
3978                         //      out->surfaceparms |= Q3SURFACEPARM_SKY;
3979                         //if (!strcmp(out->name, "caulk") || !strcmp(out->name, "common/caulk") || !strcmp(out->name, "textures/common/caulk")
3980                         // || !strcmp(out->name, "nodraw") || !strcmp(out->name, "common/nodraw") || !strcmp(out->name, "textures/common/nodraw"))
3981                         //      out->surfaceparms |= Q3SURFACEPARM_NODRAW;
3982                         //if (R_TextureHasAlpha(out->skin.base))
3983                         //      out->surfaceparms |= Q3SURFACEPARM_TRANS;
3984                 }
3985                 if (!Mod_LoadSkinFrame(&out->skin, out->name, (((out->textureflags & Q3TEXTUREFLAG_NOMIPMAPS) || (out->surfaceparms & Q3SURFACEPARM_NOMIPMAPS)) ? 0 : TEXF_MIPMAP) | TEXF_ALPHA | TEXF_PRECACHE | (out->textureflags & Q3TEXTUREFLAG_NOPICMIP ? 0 : TEXF_PICMIP), false, true))
3986                         if (!Mod_LoadSkinFrame(&out->skin, out->firstpasstexturename, (((out->textureflags & Q3TEXTUREFLAG_NOMIPMAPS) || (out->surfaceparms & Q3SURFACEPARM_NOMIPMAPS)) ? 0 : TEXF_MIPMAP) | TEXF_ALPHA | TEXF_PRECACHE | (out->textureflags & Q3TEXTUREFLAG_NOPICMIP ? 0 : TEXF_PICMIP), false, true))
3987                                 if (cls.state != ca_dedicated)
3988                                         Con_Printf("%s: texture loading for shader \"%s\" failed (first layer \"%s\" not found either)\n", loadmodel->name, out->name, out->firstpasstexturename);
3989                 // no animation
3990                 out->currentframe = out;
3991         }
3992         if (c)
3993                 Con_DPrintf("%s: %i textures missing shaders\n", loadmodel->name, c);
3994 }
3995
3996 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
3997 {
3998         q3dplane_t *in;
3999         mplane_t *out;
4000         int i, count;
4001
4002         in = (void *)(mod_base + l->fileofs);
4003         if (l->filelen % sizeof(*in))
4004                 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4005         count = l->filelen / sizeof(*in);
4006         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4007
4008         loadmodel->brush.data_planes = out;
4009         loadmodel->brush.num_planes = count;
4010
4011         for (i = 0;i < count;i++, in++, out++)
4012         {
4013                 out->normal[0] = LittleFloat(in->normal[0]);
4014                 out->normal[1] = LittleFloat(in->normal[1]);
4015                 out->normal[2] = LittleFloat(in->normal[2]);
4016                 out->dist = LittleFloat(in->dist);
4017                 PlaneClassify(out);
4018         }
4019 }
4020
4021 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4022 {
4023         q3dbrushside_t *in;
4024         q3mbrushside_t *out;
4025         int i, n, count;
4026
4027         in = (void *)(mod_base + l->fileofs);
4028         if (l->filelen % sizeof(*in))
4029                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4030         count = l->filelen / sizeof(*in);
4031         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4032
4033         loadmodel->brush.data_brushsides = out;
4034         loadmodel->brush.num_brushsides = count;
4035
4036         for (i = 0;i < count;i++, in++, out++)
4037         {
4038                 n = LittleLong(in->planeindex);
4039                 if (n < 0 || n >= loadmodel->brush.num_planes)
4040                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)\n", n, loadmodel->brush.num_planes);
4041                 out->plane = loadmodel->brush.data_planes + n;
4042                 n = LittleLong(in->textureindex);
4043                 if (n < 0 || n >= loadmodel->num_textures)
4044                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)\n", n, loadmodel->num_textures);
4045                 out->texture = loadmodel->data_textures + n;
4046         }
4047 }
4048
4049 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4050 {
4051         q3dbrush_t *in;
4052         q3mbrush_t *out;
4053         int i, j, n, c, count, maxplanes;
4054         mplane_t *planes;
4055
4056         in = (void *)(mod_base + l->fileofs);
4057         if (l->filelen % sizeof(*in))
4058                 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4059         count = l->filelen / sizeof(*in);
4060         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4061
4062         loadmodel->brush.data_brushes = out;
4063         loadmodel->brush.num_brushes = count;
4064
4065         maxplanes = 0;
4066         planes = NULL;
4067
4068         for (i = 0;i < count;i++, in++, out++)
4069         {
4070                 n = LittleLong(in->firstbrushside);
4071                 c = LittleLong(in->numbrushsides);
4072                 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4073                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)\n", n, n + c, loadmodel->brush.num_brushsides);
4074                 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4075                 out->numbrushsides = c;
4076                 n = LittleLong(in->textureindex);
4077                 if (n < 0 || n >= loadmodel->num_textures)
4078                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)\n", n, loadmodel->num_textures);
4079                 out->texture = loadmodel->data_textures + n;
4080
4081                 // make a list of mplane_t structs to construct a colbrush from
4082                 if (maxplanes < out->numbrushsides)
4083                 {
4084                         maxplanes = out->numbrushsides;
4085                         if (planes)
4086                                 Mem_Free(planes);
4087                         planes = Mem_Alloc(tempmempool, sizeof(mplane_t) * maxplanes);
4088                 }
4089                 for (j = 0;j < out->numbrushsides;j++)
4090                 {
4091                         VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4092                         planes[j].dist = out->firstbrushside[j].plane->dist;
4093                 }
4094                 // make the colbrush from the planes
4095                 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4096         }
4097         if (planes)
4098                 Mem_Free(planes);
4099 }
4100
4101 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4102 {
4103         q3deffect_t *in;
4104         q3deffect_t *out;
4105         int i, n, count;
4106
4107         in = (void *)(mod_base + l->fileofs);
4108         if (l->filelen % sizeof(*in))
4109                 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4110         count = l->filelen / sizeof(*in);
4111         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4112
4113         loadmodel->brushq3.data_effects = out;
4114         loadmodel->brushq3.num_effects = count;
4115
4116         for (i = 0;i < count;i++, in++, out++)
4117         {
4118                 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4119                 n = LittleLong(in->brushindex);
4120                 if (n >= loadmodel->brush.num_brushes)
4121                 {
4122                         Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4123                         n = -1;
4124                 }
4125                 out->brushindex = n;
4126                 out->unknown = LittleLong(in->unknown);
4127         }
4128 }
4129
4130 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4131 {
4132         q3dvertex_t *in;
4133         int i, count;
4134
4135         in = (void *)(mod_base + l->fileofs);
4136         if (l->filelen % sizeof(*in))
4137                 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4138         loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4139         loadmodel->brushq3.data_vertex3f = Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 2 + 2 + 4)));
4140         loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_vertex3f + count * 3;
4141         loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4142         loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4143
4144         for (i = 0;i < count;i++, in++)
4145         {
4146                 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4147                 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4148                 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4149                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4150                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4151                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4152                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4153                 // svector/tvector are calculated later in face loading
4154                 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4155                 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4156                 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4157                 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4158         }
4159 }
4160
4161 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4162 {
4163         int *in;
4164         int *out;
4165         int i, count;
4166
4167         in = (void *)(mod_base + l->fileofs);
4168         if (l->filelen % sizeof(int[3]))
4169                 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4170         count = l->filelen / sizeof(*in);
4171         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4172
4173         loadmodel->brushq3.num_triangles = count / 3;
4174         loadmodel->brushq3.data_element3i = out;
4175
4176         for (i = 0;i < count;i++, in++, out++)
4177         {
4178                 *out = LittleLong(*in);
4179                 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4180                 {
4181                         Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4182                         *out = 0;
4183                 }
4184         }
4185 }
4186
4187 static void Mod_Q3BSP_LoadLightmaps(lump_t *l)
4188 {
4189         q3dlightmap_t *in;
4190         rtexture_t **out;
4191         int i, count;
4192
4193         if (!l->filelen)
4194                 return;
4195         in = (void *)(mod_base + l->fileofs);
4196         if (l->filelen % sizeof(*in))
4197                 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4198         count = l->filelen / sizeof(*in);
4199         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4200
4201         loadmodel->brushq3.data_lightmaps = out;
4202         loadmodel->brushq3.num_lightmaps = count;
4203
4204         for (i = 0;i < count;i++, in++, out++)
4205                 *out = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", i), 128, 128, in->rgb, TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
4206 }
4207
4208 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4209 {
4210         q3dface_t *in, *oldin;
4211         msurface_t *out, *oldout;
4212         int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshnum, meshvertices, meshtriangles, numvertices, numtriangles;
4213         //int *originalelement3i;
4214         //int *originalneighbor3i;
4215         float *originalvertex3f;
4216         //float *originalsvector3f;
4217         //float *originaltvector3f;
4218         //float *originalnormal3f;
4219         float *originalcolor4f;
4220         float *originaltexcoordtexture2f;
4221         float *originaltexcoordlightmap2f;
4222         float *v;
4223         surfmesh_t *mesh, *tempmeshlist[1024];
4224
4225         in = (void *)(mod_base + l->fileofs);
4226         if (l->filelen % sizeof(*in))
4227                 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4228         count = l->filelen / sizeof(*in);
4229         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4230
4231         loadmodel->data_surfaces = out;
4232         loadmodel->num_surfaces = count;
4233
4234         i = 0;
4235         for (meshnum = 0;i < count;meshnum++)
4236         {
4237                 oldi = i;
4238                 oldin = in;
4239                 oldout = out;
4240                 meshvertices = 0;
4241                 meshtriangles = 0;
4242                 for (;i < count;i++, in++, out++)
4243                 {
4244                         // check face type first
4245                         type = LittleLong(in->type);
4246                         if (type != Q3FACETYPE_POLYGON
4247                          && type != Q3FACETYPE_PATCH
4248                          && type != Q3FACETYPE_MESH
4249                          && type != Q3FACETYPE_FLARE)
4250                         {
4251                                 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4252                                 continue;
4253                         }
4254
4255                         n = LittleLong(in->textureindex);
4256                         if (n < 0 || n >= loadmodel->num_textures)
4257                         {
4258                                 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4259                                 continue;
4260                         }
4261                         out->texture = loadmodel->data_textures + n;
4262                         n = LittleLong(in->effectindex);
4263                         if (n < -1 || n >= loadmodel->brushq3.num_effects)
4264                         {
4265                                 if (developer.integer >= 2)
4266                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4267                                 n = -1;
4268                         }
4269                         if (n == -1)
4270                                 out->effect = NULL;
4271                         else
4272                                 out->effect = loadmodel->brushq3.data_effects + n;
4273                         n = LittleLong(in->lightmapindex);
4274                         if (n >= loadmodel->brushq3.num_lightmaps)
4275                         {
4276                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_lightmaps);
4277                                 n = -1;
4278                         }
4279                         else if (n < 0)
4280                                 n = -1;
4281                         if (n == -1)
4282                                 out->lightmaptexture = NULL;
4283                         else
4284                                 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n];
4285
4286                         firstvertex = LittleLong(in->firstvertex);
4287                         numvertices = LittleLong(in->numvertices);
4288                         firstelement = LittleLong(in->firstelement);
4289                         numtriangles = LittleLong(in->numelements) / 3;
4290                         if (numtriangles * 3 != LittleLong(in->numelements))
4291                         {
4292                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): numelements %i is not a multiple of 3\n", i, out->texture->name, LittleLong(in->numelements));
4293                                 continue;
4294                         }
4295                         if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4296                         {
4297                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid vertex range %i : %i (%i vertices)\n", i, out->texture->name, firstvertex, firstvertex + numvertices, loadmodel->brushq3.num_vertices);
4298                                 continue;
4299                         }
4300                         if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4301                         {
4302                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid element range %i : %i (%i elements)\n", i, out->texture->name, firstelement, firstelement + numtriangles * 3, loadmodel->brushq3.num_triangles * 3);
4303                                 continue;
4304                         }
4305                         switch(type)
4306                         {
4307                         case Q3FACETYPE_POLYGON:
4308                         case Q3FACETYPE_MESH:
4309                                 // no processing necessary
4310                                 break;
4311                         case Q3FACETYPE_PATCH:
4312                                 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4313                                 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4314                                 if (numvertices != (patchsize[0] * patchsize[1]) || patchsize[0] < 3 || patchsize[1] < 3 || !(patchsize[0] & 1) || !(patchsize[1] & 1) || patchsize[0] * patchsize[1] >= min(r_subdivisions_maxvertices.integer, r_subdivisions_collision_maxvertices.integer))
4315                                 {
4316                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4317                                         continue;
4318                                 }
4319                                 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4320                                 // convert patch to Q3FACETYPE_MESH
4321                                 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4322                                 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4323                                 // bound to user settings
4324                                 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4325                                 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4326                                 // bound to sanity settings
4327                                 xtess = bound(1, xtess, 1024);
4328                                 ytess = bound(1, ytess, 1024);
4329                                 // bound to user limit on vertices
4330                                 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4331                                 {
4332                                         if (xtess > ytess)
4333                                                 xtess--;
4334                                         else
4335                                                 ytess--;
4336                                 }
4337                                 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4338                                 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4339                                 numvertices = finalwidth * finalheight;
4340                                 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4341                                 break;
4342                         case Q3FACETYPE_FLARE:
4343                                 if (developer.integer >= 2)
4344                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4345                                 // don't render it
4346                                 continue;
4347                         }
4348                         out->num_vertices = numvertices;
4349                         out->num_triangles = numtriangles;
4350                         if (meshvertices + out->num_vertices > 65536)
4351                                 break;
4352                         meshvertices += out->num_vertices;
4353                         meshtriangles += out->num_triangles;
4354                 }
4355
4356                 i = oldi;
4357                 in = oldin;
4358                 out = oldout;
4359                 mesh = tempmeshlist[meshnum] = Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4360                 meshvertices = 0;
4361                 meshtriangles = 0;
4362                 for (;i < count && meshvertices + out->num_vertices <= mesh->num_vertices;i++, in++, out++)
4363                 {
4364                         if (out->num_vertices < 3 || out->num_triangles < 1)
4365                                 continue;
4366
4367                         type = LittleLong(in->type);
4368                         firstvertex = LittleLong(in->firstvertex);
4369                         firstelement = LittleLong(in->firstelement);
4370                         out->groupmesh = mesh;
4371                         out->num_firstvertex = meshvertices;
4372                         out->num_firsttriangle = meshtriangles;
4373                         switch(type)
4374                         {
4375                         case Q3FACETYPE_POLYGON:
4376                         case Q3FACETYPE_MESH:
4377                                 // no processing necessary
4378                                 for (j = 0;j < out->num_vertices;j++)
4379                                 {
4380                                         (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4381                                         (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4382                                         (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4383                                         (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4384                                         (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4385                                         (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4386                                         (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4387                                         (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4388                                         (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4389                                         (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4390                                         (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4391                                 }
4392                                 for (j = 0;j < out->num_triangles*3;j++)
4393                                         (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
4394                                 break;
4395                         case Q3FACETYPE_PATCH:
4396                                 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4397                                 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4398                                 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4399                                 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4400                                 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4401                                 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4402                                 // convert patch to Q3FACETYPE_MESH
4403                                 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4404                                 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4405                                 // bound to user settings
4406                                 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4407                                 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4408                                 // bound to sanity settings
4409                                 xtess = bound(1, xtess, 1024);
4410                                 ytess = bound(1, ytess, 1024);
4411                                 // bound to user limit on vertices
4412                                 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4413                                 {
4414                                         if (xtess > ytess)
4415                                                 xtess--;
4416                                         else
4417                                                 ytess--;
4418                                 }
4419                                 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4420                                 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4421                                 finalvertices = finalwidth * finalheight;
4422                                 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4423                                 type = Q3FACETYPE_MESH;
4424                                 // generate geometry
4425                                 // (note: normals are skipped because they get recalculated)
4426                                 Q3PatchTesselateFloat(3, sizeof(float[3]), (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4427                                 Q3PatchTesselateFloat(2, sizeof(float[2]), (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
4428                                 Q3PatchTesselateFloat(2, sizeof(float[2]), (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
4429                                 Q3PatchTesselateFloat(4, sizeof(float[4]), (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
4430                                 Q3PatchTriangleElements((out->groupmesh->data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
4431                                 out->num_triangles = Mod_RemoveDegenerateTriangles(out->num_triangles, (out->groupmesh->data_element3i + 3 * out->num_firsttriangle), (out->groupmesh->data_element3i + 3 * out->num_firsttriangle), out->groupmesh->data_vertex3f);
4432                                 if (developer.integer >= 2)
4433                                 {
4434                                         if (out->num_triangles < finaltriangles)
4435                                                 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles, %i degenerate triangles removed (leaving %i)\n", patchsize[0], patchsize[1], out->num_vertices, finaltriangles, finaltriangles - out->num_triangles, out->num_triangles);
4436                                         else
4437                                                 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles\n", patchsize[0], patchsize[1], out->num_vertices, out->num_triangles);
4438                                 }
4439                                 // q3map does not put in collision brushes for curves... ugh
4440                                 // build the lower quality collision geometry
4441                                 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4442                                 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4443                                 // bound to user settings
4444                                 xtess = bound(r_subdivisions_collision_mintess.integer, xtess, r_subdivisions_collision_maxtess.integer);
4445                                 ytess = bound(r_subdivisions_collision_mintess.integer, ytess, r_subdivisions_collision_maxtess.integer);
4446                                 // bound to sanity settings
4447                                 xtess = bound(1, xtess, 1024);
4448                                 ytess = bound(1, ytess, 1024);
4449                                 // bound to user limit on vertices
4450                                 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4451                                 {
4452                                         if (xtess > ytess)
4453                                                 xtess--;
4454                                         else
4455                                                 ytess--;
4456                                 }
4457                                 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4458                                 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4459                                 finalvertices = finalwidth * finalheight;
4460                                 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4461
4462                                 out->data_collisionvertex3f = Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4463                                 out->data_collisionelement3i = Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4464                                 out->num_collisionvertices = finalvertices;
4465                                 out->num_collisiontriangles = finaltriangles;
4466                                 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4467                                 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
4468
4469                                 //Mod_SnapVertices(3, out->num_vertices, (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), 0.25);
4470                                 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
4471
4472                                 oldnumtriangles = out->num_triangles;
4473                                 oldnumtriangles2 = out->num_collisiontriangles;
4474                                 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
4475                                 if (developer.integer)
4476                                         Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve became %i:%i vertices / %i:%i triangles (%i:%i degenerate)\n", patchsize[0], patchsize[1], out->num_vertices, out->num_collisionvertices, oldnumtriangles, oldnumtriangles2, oldnumtriangles - out->num_triangles, oldnumtriangles2 - out->num_collisiontriangles);
4477                                 break;
4478                         default:
4479                                 break;
4480                         }
4481                         meshvertices += out->num_vertices;
4482                         meshtriangles += out->num_triangles;
4483                         for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
4484                                 if ((out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
4485                                         invalidelements++;
4486                         if (invalidelements)
4487                         {
4488                                 Con_Printf("Mod_Q3BSP_LoadFaces: Warning: face #%i has %i invalid elements, type = %i, texture->name = \"%s\", texture->surfaceflags = %i, firstvertex = %i, numvertices = %i, firstelement = %i, numelements = %i, elements list:\n", i, invalidelements, type, out->texture->name, out->texture->surfaceflags, firstvertex, out->num_vertices, firstelement, out->num_triangles * 3);
4489                                 for (j = 0;j < out->num_triangles * 3;j++)
4490                                 {
4491                                         Con_Printf(" %i", (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
4492                                         if ((out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
4493                                                 (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
4494                                 }
4495                                 Con_Print("\n");
4496                         }
4497                         // for per pixel lighting
4498                         Mod_BuildTextureVectorsAndNormals(out->num_firstvertex, out->num_vertices, out->num_triangles, out->groupmesh->data_vertex3f, out->groupmesh->data_texcoordtexture2f, (out->groupmesh->data_element3i + 3 * out->num_firsttriangle), out->groupmesh->data_svector3f, out->groupmesh->data_tvector3f, out->groupmesh->data_normal3f, true);
4499                         // calculate a bounding box
4500                         VectorClear(out->mins);
4501                         VectorClear(out->maxs);
4502                         if (out->num_vertices)
4503                         {
4504                                 VectorCopy((out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), out->mins);
4505                                 VectorCopy((out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), out->maxs);
4506                                 for (j = 1, v = (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
4507                                 {
4508                                         out->mins[0] = min(out->mins[0], v[0]);
4509                                         out->maxs[0] = max(out->maxs[0], v[0]);
4510                                         out->mins[1] = min(out->mins[1], v[1]);
4511                                         out->maxs[1] = max(out->maxs[1], v[1]);
4512                                         out->mins[2] = min(out->mins[2], v[2]);
4513                                         out->maxs[2] = max(out->maxs[2], v[2]);
4514                                 }
4515                                 out->mins[0] -= 1.0f;
4516                                 out->mins[1] -= 1.0f;
4517                                 out->mins[2] -= 1.0f;
4518                                 out->maxs[0] += 1.0f;
4519                                 out->maxs[1] += 1.0f;
4520                                 out->maxs[2] += 1.0f;
4521                         }
4522                         // set lightmap styles for consistency with q1bsp
4523                         //out->lightmapinfo->styles[0] = 0;
4524                         //out->lightmapinfo->styles[1] = 255;
4525                         //out->lightmapinfo->styles[2] = 255;
4526                         //out->lightmapinfo->styles[3] = 255;
4527                 }
4528         }
4529
4530         // now store the completed list of meshes
4531         loadmodel->nummeshes = meshnum;
4532         if (loadmodel->nummeshes)
4533         {
4534                 loadmodel->meshlist = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4535                 memcpy(loadmodel->meshlist, tempmeshlist, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4536         }
4537
4538         // free the no longer needed vertex data
4539         loadmodel->brushq3.num_vertices = 0;
4540         Mem_Free(loadmodel->brushq3.data_vertex3f);
4541         loadmodel->brushq3.data_vertex3f = NULL;
4542         loadmodel->brushq3.data_texcoordtexture2f = NULL;
4543         loadmodel->brushq3.data_texcoordlightmap2f = NULL;
4544         loadmodel->brushq3.data_color4f = NULL;
4545         // free the no longer needed triangle data
4546         loadmodel->brushq3.num_triangles = 0;
4547         Mem_Free(loadmodel->brushq3.data_element3i);
4548         loadmodel->brushq3.data_element3i = NULL;
4549 }
4550
4551 static void Mod_Q3BSP_LoadModels(lump_t *l)
4552 {
4553         q3dmodel_t *in;
4554         q3dmodel_t *out;
4555         int i, j, n, c, count;
4556
4557         in = (void *)(mod_base + l->fileofs);
4558         if (l->filelen % sizeof(*in))
4559                 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4560         count = l->filelen / sizeof(*in);
4561         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4562
4563         loadmodel->brushq3.data_models = out;
4564         loadmodel->brushq3.num_models = count;
4565
4566         for (i = 0;i < count;i++, in++, out++)
4567         {
4568                 for (j = 0;j < 3;j++)
4569                 {
4570                         out->mins[j] = LittleFloat(in->mins[j]);
4571                         out->maxs[j] = LittleFloat(in->maxs[j]);
4572                 }
4573                 n = LittleLong(in->firstface);
4574                 c = LittleLong(in->numfaces);
4575                 if (n < 0 || n + c > loadmodel->num_surfaces)
4576                         Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)\n", n, n + c, loadmodel->num_surfaces);
4577                 out->firstface = n;
4578                 out->numfaces = c;
4579                 n = LittleLong(in->firstbrush);
4580                 c = LittleLong(in->numbrushes);
4581                 if (n < 0 || n + c > loadmodel->brush.num_brushes)
4582                         Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)\n", n, n + c, loadmodel->brush.num_brushes);
4583                 out->firstbrush = n;
4584                 out->numbrushes = c;
4585         }
4586 }
4587
4588 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
4589 {
4590         int *in;
4591         int *out;
4592         int i, n, count;
4593
4594         in = (void *)(mod_base + l->fileofs);
4595         if (l->filelen % sizeof(*in))
4596                 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4597         count = l->filelen / sizeof(*in);
4598         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4599
4600         loadmodel->brush.data_leafbrushes = out;
4601         loadmodel->brush.num_leafbrushes = count;
4602
4603         for (i = 0;i < count;i++, in++, out++)
4604         {
4605                 n = LittleLong(*in);
4606                 if (n < 0 || n >= loadmodel->brush.num_brushes)
4607                         Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)\n", n, loadmodel->brush.num_brushes);
4608                 *out = n;
4609         }
4610 }
4611
4612 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
4613 {
4614         int *in;
4615         int *out;
4616         int i, n, count;
4617
4618         in = (void *)(mod_base + l->fileofs);
4619         if (l->filelen % sizeof(*in))
4620                 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4621         count = l->filelen / sizeof(*in);
4622         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4623
4624         loadmodel->brush.data_leafsurfaces = out;
4625         loadmodel->brush.num_leafsurfaces = count;
4626
4627         for (i = 0;i < count;i++, in++, out++)
4628         {
4629                 n = LittleLong(*in);
4630                 if (n < 0 || n >= loadmodel->num_surfaces)
4631                         Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)\n", n, loadmodel->num_surfaces);
4632                 *out = n;
4633         }
4634 }
4635
4636 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
4637 {
4638         q3dleaf_t *in;
4639         mleaf_t *out;
4640         int i, j, n, c, count;
4641
4642         in = (void *)(mod_base + l->fileofs);
4643         if (l->filelen % sizeof(*in))
4644                 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4645         count = l->filelen / sizeof(*in);
4646         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4647
4648         loadmodel->brush.data_leafs = out;
4649         loadmodel->brush.num_leafs = count;
4650
4651         for (i = 0;i < count;i++, in++, out++)
4652         {
4653                 out->parent = NULL;
4654                 out->plane = NULL;
4655                 out->clusterindex = LittleLong(in->clusterindex);
4656                 out->areaindex = LittleLong(in->areaindex);
4657                 for (j = 0;j < 3;j++)
4658                 {
4659                         // yes the mins/maxs are ints
4660                         out->mins[j] = LittleLong(in->mins[j]) - 1;
4661                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4662                 }
4663                 n = LittleLong(in->firstleafface);
4664                 c = LittleLong(in->numleaffaces);
4665                 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
4666                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)\n", n, n + c, loadmodel->brush.num_leafsurfaces);
4667                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
4668                 out->numleafsurfaces = c;
4669                 n = LittleLong(in->firstleafbrush);
4670                 c = LittleLong(in->numleafbrushes);
4671                 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
4672                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)\n", n, n + c, loadmodel->brush.num_leafbrushes);
4673                 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
4674                 out->numleafbrushes = c;
4675         }
4676 }
4677
4678 static void Mod_Q3BSP_LoadNodes(lump_t *l)
4679 {
4680         q3dnode_t *in;
4681         mnode_t *out;
4682         int i, j, n, count;
4683
4684         in = (void *)(mod_base + l->fileofs);
4685         if (l->filelen % sizeof(*in))
4686                 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4687         count = l->filelen / sizeof(*in);
4688         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4689
4690         loadmodel->brush.data_nodes = out;
4691         loadmodel->brush.num_nodes = count;
4692
4693         for (i = 0;i < count;i++, in++, out++)
4694         {
4695                 out->parent = NULL;
4696                 n = LittleLong(in->planeindex);
4697                 if (n < 0 || n >= loadmodel->brush.num_planes)
4698                         Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)\n", n, loadmodel->brush.num_planes);
4699                 out->plane = loadmodel->brush.data_planes + n;
4700                 for (j = 0;j < 2;j++)
4701                 {
4702                         n = LittleLong(in->childrenindex[j]);
4703                         if (n >= 0)
4704                         {
4705                                 if (n >= loadmodel->brush.num_nodes)
4706                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)\n", n, loadmodel->brush.num_nodes);
4707                                 out->children[j] = loadmodel->brush.data_nodes + n;
4708                         }
4709                         else
4710                         {
4711                                 n = -1 - n;
4712                                 if (n >= loadmodel->brush.num_leafs)
4713                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)\n", n, loadmodel->brush.num_leafs);
4714                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
4715                         }
4716                 }
4717                 for (j = 0;j < 3;j++)
4718                 {
4719                         // yes the mins/maxs are ints
4720                         out->mins[j] = LittleLong(in->mins[j]) - 1;
4721                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4722                 }
4723         }
4724
4725         // set the parent pointers
4726         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
4727 }
4728
4729 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
4730 {
4731         q3dlightgrid_t *in;
4732         q3dlightgrid_t *out;
4733         int count;
4734
4735         in = (void *)(mod_base + l->fileofs);
4736         if (l->filelen % sizeof(*in))
4737                 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
4738         loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
4739         loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
4740         loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
4741         loadmodel->brushq3.num_lightgrid_imins[0] = ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4742         loadmodel->brushq3.num_lightgrid_imins[1] = ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4743         loadmodel->brushq3.num_lightgrid_imins[2] = ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4744         loadmodel->brushq3.num_lightgrid_imaxs[0] = floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4745         loadmodel->brushq3.num_lightgrid_imaxs[1] = floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4746         loadmodel->brushq3.num_lightgrid_imaxs[2] = floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4747         loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
4748         loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
4749         loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
4750         count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
4751         Matrix4x4_CreateScale3(&loadmodel->brushq3.num_lightgrid_indexfromworld, loadmodel->brushq3.num_lightgrid_scale[0], loadmodel->brushq3.num_lightgrid_scale[1], loadmodel->brushq3.num_lightgrid_scale[2]);
4752         Matrix4x4_ConcatTranslate(&loadmodel->brushq3.num_lightgrid_indexfromworld, -loadmodel->brushq3.num_lightgrid_imins[0] * loadmodel->brushq3.num_lightgrid_cellsize[0], -loadmodel->brushq3.num_lightgrid_imins[1] * loadmodel->brushq3.num_lightgrid_cellsize[1], -loadmodel->brushq3.num_lightgrid_imins[2] * loadmodel->brushq3.num_lightgrid_cellsize[2]);
4753
4754         // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
4755         if (l->filelen)
4756         {
4757                 if (l->filelen < count * (int)sizeof(*in))
4758                         Host_Error("Mod_Q3BSP_LoadLightGrid: invalid lightgrid lump size %i bytes, should be %i bytes (%ix%ix%i)\n", l->filelen, count * sizeof(*in), loadmodel->brushq3.num_lightgrid_dimensions[0], loadmodel->brushq3.num_lightgrid_dimensions[1], loadmodel->brushq3.num_lightgrid_dimensions[2]);
4759                 if (l->filelen != count * (int)sizeof(*in))
4760                         Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", count * sizeof(*in), l->filelen);
4761                 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4762                 loadmodel->brushq3.data_lightgrid = out;
4763                 loadmodel->brushq3.num_lightgrid = count;
4764                 // no swapping or validation necessary
4765                 memcpy(out, in, count * (int)sizeof(*out));
4766         }
4767 }
4768
4769 static void Mod_Q3BSP_LoadPVS(lump_t *l)
4770 {
4771         q3dpvs_t *in;
4772         int totalchains;
4773
4774         if (l->filelen == 0)
4775         {
4776                 int i;
4777                 // unvised maps often have cluster indices even without pvs, so check
4778                 // leafs to find real number of clusters
4779                 loadmodel->brush.num_pvsclusters = 1;
4780                 for (i = 0;i < loadmodel->brush.num_leafs;i++)
4781                         loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
4782
4783                 // create clusters
4784                 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
4785                 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4786                 loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, totalchains);
4787                 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
4788                 return;
4789         }
4790
4791         in = (void *)(mod_base + l->fileofs);
4792         if (l->filelen < 9)
4793                 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
4794
4795         loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
4796         loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
4797         if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
4798                 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8\n", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
4799         totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4800         if (l->filelen < totalchains + (int)sizeof(*in))
4801                 Host_Error("Mod_Q3BSP_LoadPVS: lump too small ((numclusters = %i) * (chainlength = %i) + sizeof(q3dpvs_t) == %i bytes, lump is %i bytes)\n", loadmodel->brush.num_pvsclusters, loadmodel->brush.num_pvsclusterbytes, totalchains + sizeof(*in), l->filelen);
4802
4803         loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, totalchains);
4804         memcpy(loadmodel->brush.data_pvsclusters, (qbyte *)(in + 1), totalchains);
4805 }
4806
4807 static void Mod_Q3BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
4808 {
4809         int i, j, k, index[3];
4810         float transformed[3], blend1, blend2, blend, yaw, pitch, sinpitch;
4811         q3dlightgrid_t *a, *s;
4812         if (!model->brushq3.num_lightgrid)
4813         {
4814                 ambientcolor[0] = 1;
4815                 ambientcolor[1] = 1;
4816                 ambientcolor[2] = 1;
4817                 return;
4818         }
4819         Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
4820         //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
4821         //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
4822         transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
4823         transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
4824         transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
4825         index[0] = (int)floor(transformed[0]);
4826         index[1] = (int)floor(transformed[1]);
4827         index[2] = (int)floor(transformed[2]);
4828         //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
4829         // now lerp the values
4830         VectorClear(diffusenormal);
4831         a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
4832         for (k = 0;k < 2;k++)
4833         {
4834                 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
4835                 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
4836                         continue;
4837                 for (j = 0;j < 2;j++)
4838                 {
4839                         blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
4840                         if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
4841                                 continue;
4842                         for (i = 0;i < 2;i++)
4843                         {
4844                                 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0])));
4845                                 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
4846                                         continue;
4847                                 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
4848                                 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
4849                                 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
4850                                 pitch = s->diffusepitch * M_PI / 128;
4851                                 yaw = s->diffuseyaw * M_PI / 128;
4852                                 sinpitch = sin(pitch);
4853                                 diffusenormal[0] += blend * (cos(yaw) * sinpitch);
4854                                 diffusenormal[1] += blend * (sin(yaw) * sinpitch);
4855                                 diffusenormal[2] += blend * (cos(pitch));
4856                                 //Con_Printf("blend %f: ambient %i %i %i, diffuse %i %i %i, diffusepitch %i diffuseyaw %i (%f %f, normal %f %f %f)\n", blend, s->ambientrgb[0], s->ambientrgb[1], s->ambientrgb[2], s->diffusergb[0], s->diffusergb[1], s->diffusergb[2], s->diffusepitch, s->diffuseyaw, pitch, yaw, (cos(yaw) * cospitch), (sin(yaw) * cospitch), (-sin(pitch)));
4857                         }
4858                 }
4859         }
4860         VectorNormalize(diffusenormal);
4861         //Con_Printf("result: ambient %f %f %f diffuse %f %f %f diffusenormal %f %f %f\n", ambientcolor[0], ambientcolor[1], ambientcolor[2], diffusecolor[0], diffusecolor[1], diffusecolor[2], diffusenormal[0], diffusenormal[1], diffusenormal[2]);
4862 }
4863
4864 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const vec3_t point, int markframe)
4865 {
4866         int i;
4867         mleaf_t *leaf;
4868         colbrushf_t *brush;
4869         // find which leaf the point is in
4870         while (node->plane)
4871                 node = node->children[DotProduct(point, node->plane->normal) < node->plane->dist];
4872         // point trace the brushes
4873         leaf = (mleaf_t *)node;
4874         for (i = 0;i < leaf->numleafbrushes;i++)
4875         {
4876                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
4877                 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
4878                 {
4879                         brush->markframe = markframe;
4880                         Collision_TracePointBrushFloat(trace, point, brush);
4881                 }
4882         }
4883         // can't do point traces on curves (they have no thickness)
4884 }
4885
4886 static void Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const vec3_t start, const vec3_t end, vec_t startfrac, vec_t endfrac, const vec3_t linestart, const vec3_t lineend, int markframe, const vec3_t segmentmins, const vec3_t segmentmaxs)
4887 {
4888         int i, startside, endside;
4889         float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
4890         mleaf_t *leaf;
4891         msurface_t *surface;
4892         colbrushf_t *brush;
4893         if (startfrac > trace->realfraction)
4894                 return;
4895         // note: all line fragments past first impact fraction are ignored
4896         if (VectorCompare(start, end))
4897         {
4898                 // find which leaf the point is in
4899                 while (node->plane)
4900                         node = node->children[DotProduct(start, node->plane->normal) < node->plane->dist];
4901         }
4902         else
4903         {
4904                 // find which nodes the line is in and recurse for them
4905                 while (node->plane)
4906                 {
4907                         // recurse down node sides
4908                         dist1 = PlaneDiff(start, node->plane);
4909                         dist2 = PlaneDiff(end, node->plane);
4910                         startside = dist1 < 0;
4911                         endside = dist2 < 0;
4912                         if (startside == endside)
4913                         {
4914                                 // most of the time the line fragment is on one side of the plane
4915                                 node = node->children[startside];
4916                         }
4917                         else
4918                         {
4919                                 // line crosses node plane, split the line
4920                                 midfrac = dist1 / (dist1 - dist2);
4921                                 VectorLerp(start, midfrac, end, mid);
4922                                 // take the near side first
4923                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
4924                                 if (midfrac <= trace->realfraction)
4925                                         Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
4926                                 return;
4927                         }
4928                 }
4929         }
4930         // hit a leaf
4931         nodesegmentmins[0] = min(start[0], end[0]);
4932         nodesegmentmins[1] = min(start[1], end[1]);
4933         nodesegmentmins[2] = min(start[2], end[2]);
4934         nodesegmentmaxs[0] = max(start[0], end[0]);
4935         nodesegmentmaxs[1] = max(start[1], end[1]);
4936         nodesegmentmaxs[2] = max(start[2], end[2]);
4937         // line trace the brushes
4938         leaf = (mleaf_t *)node;
4939         for (i = 0;i < leaf->numleafbrushes;i++)
4940         {
4941                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
4942                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
4943                 {
4944                         brush->markframe = markframe;
4945                         Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
4946                         if (startfrac > trace->realfraction)
4947                                 return;
4948                 }
4949         }
4950         // can't do point traces on curves (they have no thickness)
4951         if (mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
4952         {
4953                 // line trace the curves
4954                 for (i = 0;i < leaf->numleafsurfaces;i++)
4955                 {
4956                         surface = model->data_surfaces + leaf->firstleafsurface[i];
4957                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
4958                         {
4959                                 surface->collisionmarkframe = markframe;
4960                                 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, segmentmins, segmentmaxs);
4961                                 if (startfrac > trace->realfraction)
4962                                         return;
4963                         }
4964                 }
4965         }
4966 }
4967
4968 static void Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const colbrushf_t *thisbrush_start, const colbrushf_t *thisbrush_end, int markframe, const vec3_t segmentmins, const vec3_t segmentmaxs)
4969 {
4970         int i;
4971         //int sides;
4972         float nodesegmentmins[3], nodesegmentmaxs[3];
4973         mleaf_t *leaf;
4974         colbrushf_t *brush;
4975         msurface_t *surface;
4976         /*
4977                 // find which nodes the line is in and recurse for them
4978                 while (node->plane)
4979                 {
4980                         // recurse down node sides
4981                         int startside, endside;
4982                         float dist1near, dist1far, dist2near, dist2far;
4983                         BoxPlaneCornerDistances(thisbrush_start->mins, thisbrush_start->maxs, node->plane, &dist1near, &dist1far);
4984                         BoxPlaneCornerDistances(thisbrush_end->mins, thisbrush_end->maxs, node->plane, &dist2near, &dist2far);
4985                         startside = dist1near < 0;
4986                         startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
4987                         endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
4988                         if (startside == 2 || endside == 2)
4989                         {
4990                                 // brushes cross plane
4991                                 // do not clip anything, just take both sides
4992                                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
4993                                 node = node->children[1];
4994                                 continue;
4995                         }
4996                         if (startside == 0)
4997                         {
4998                                 if (endside == 0)
4999                                 {
5000                                         node = node->children[0];
5001                                         continue;
5002                                 }
5003                                 else
5004                                 {
5005                                         //midf0 = dist1near / (dist1near - dist2near);
5006                                         //midf1 = dist1far / (dist1far - dist2far);
5007                                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5008                                         node = node->children[1];
5009                                         continue;
5010                                 }
5011                         }
5012                         else
5013                         {
5014                                 if (endside == 0)
5015                                 {
5016                                         //midf0 = dist1near / (dist1near - dist2near);
5017                                         //midf1 = dist1far / (dist1far - dist2far);
5018                                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5019                                         node = node->children[1];
5020                                         continue;
5021                                 }
5022                                 else
5023                                 {
5024                                         node = node->children[1];
5025                                         continue;
5026                                 }
5027                         }
5028
5029                         if (dist1near <  0 && dist2near <  0 && dist1far <  0 && dist2far <  0){node = node->children[1];continue;}
5030                         if (dist1near <  0 && dist2near <  0 && dist1far <  0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5031                         if (dist1near <  0 && dist2near <  0 && dist1far >= 0 && dist2far <  0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5032                         if (dist1near <  0 && dist2near <  0 && dist1far >= 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5033                         if (dist1near <  0 && dist2near >= 0 && dist1far <  0 && dist2far <  0){node = node->children[1];continue;}
5034                         if (dist1near <  0 && dist2near >= 0 && dist1far <  0 && dist2far >= 0){}
5035                         if (dist1near <  0 && dist2near >= 0 && dist1far >= 0 && dist2far <  0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5036                         if (dist1near <  0 && dist2near >= 0 && dist1far >= 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5037                         if (dist1near >= 0 && dist2near <  0 && dist1far <  0 && dist2far <  0){node = node->children[1];continue;}
5038                         if (dist1near >= 0 && dist2near <  0 && dist1far <  0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5039                         if (dist1near >= 0 && dist2near <  0 && dist1far >= 0 && dist2far <  0){}
5040                         if (dist1near >= 0 && dist2near <  0 && dist1far >= 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5041                         if (dist1near >= 0 && dist2near >= 0 && dist1far <  0 && dist2far <  0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5042                         if (dist1near >= 0 && dist2near >= 0 && dist1far <  0 && dist2far >= 0){node = node->children[0];continue;}
5043                         if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far <  0){node = node->children[0];continue;}
5044                         if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far >= 0){node = node->children[0];continue;}
5045                         {
5046                                 if (dist2near < 0) // d1n<0 && d2n<0
5047                                 {
5048                                         if (dist2near < 0) // d1n<0 && d2n<0
5049                                         {
5050                                                 if (dist2near < 0) // d1n<0 && d2n<0
5051                                                 {
5052                                                 }
5053                                                 else // d1n<0 && d2n>0
5054                                                 {
5055                                                 }
5056                                         }
5057                                         else // d1n<0 && d2n>0
5058                                         {
5059                                                 if (dist2near < 0) // d1n<0 && d2n<0
5060                                                 {
5061                                                 }
5062                                                 else // d1n<0 && d2n>0
5063                                                 {
5064                                                 }
5065                                         }
5066                                 }
5067                                 else // d1n<0 && d2n>0
5068                                 {
5069                                 }
5070                         }
5071                         else // d1n>0
5072                         {
5073                                 if (dist2near < 0) // d1n>0 && d2n<0
5074                                 {
5075                                 }
5076                                 else // d1n>0 && d2n>0
5077                                 {
5078                                 }
5079                         }
5080                         if (dist1near < 0 == dist1far < 0 == dist2near < 0 == dist2far < 0)
5081                         {
5082                                 node = node->children[startside];
5083                                 continue;
5084                         }
5085                         if (dist1near < dist2near)
5086                         {
5087                                 // out
5088                                 if (dist1near >= 0)
5089                                 {
5090                                         node = node->children[0];
5091                                         continue;
5092                                 }
5093                                 if (dist2far < 0)
5094                                 {
5095                                         node = node->children[1];
5096                                         continue;
5097                                 }
5098                                 // dist1near < 0 && dist2far >= 0
5099                         }
5100                         else
5101                         {
5102                                 // in
5103                         }
5104                         startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
5105                         endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
5106                         if (startside == 2 || endside == 2)
5107                         {
5108                                 // brushes cross plane
5109                                 // do not clip anything, just take both sides
5110                                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5111                                 node = node->children[1];
5112                         }
5113                         else if (startside == endside)
5114                                 node = node->children[startside];
5115                         else if (startside == 0) // endside = 1 (start infront, end behind)
5116                         {
5117                         }
5118                         else // startside == 1 endside = 0 (start behind, end infront)
5119                         {
5120                         }
5121                         == endside)
5122                         {
5123                                 if (startside < 2)
5124                                         node = node->children[startside];
5125                                 else
5126                                 {
5127                                         // start and end brush cross plane
5128                                 }
5129                         }
5130                         else
5131                         {
5132                         }
5133                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5134                                 node = node->children[1];
5135                         else if (dist1near < 0 && dist1far < 0 && dist2near >= 0 && dist2far >= 0)
5136                         else if (dist1near >= 0 && dist1far >= 0 && dist2near < 0 && dist2far < 0)
5137                         else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5138                                 node = node->children[0];
5139                         else
5140                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5141                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5142                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5143                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5144                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5145                         {
5146                         }
5147                         else if (dist1near >= 0 && dist1far >= 0)
5148                         {
5149                         }
5150                         else // mixed (lying on plane)
5151                         {
5152                         }
5153                         {
5154                                 if (dist2near < 0 && dist2far < 0)
5155                                 {
5156                                 }
5157                                 else
5158                                         node = node->children[1];
5159                         }
5160                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5161                                 node = node->children[0];
5162                         else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5163                                 node = node->children[1];
5164                         else
5165                         {
5166                                 // both sides
5167                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5168                                 node = node->children[1];
5169                         }
5170                         sides = dist1near || dist1near < 0 | dist1far < 0 | dist2near < 0 | dist
5171                         startside = dist1 < 0;
5172                         endside = dist2 < 0;
5173                         if (startside == endside)
5174                         {
5175                                 // most of the time the line fragment is on one side of the plane
5176                                 node = node->children[startside];
5177                         }
5178                         else
5179                         {
5180                                 // line crosses node plane, split the line
5181                                 midfrac = dist1 / (dist1 - dist2);
5182                                 VectorLerp(start, midfrac, end, mid);
5183                                 // take the near side first
5184                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5185                                 if (midfrac <= trace->fraction)
5186                                         Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5187                                 return;
5188                         }
5189                 }
5190         */
5191 #if 1
5192         for (;;)
5193         {
5194                 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5195                 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5196                 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5197                 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5198                 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5199                 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5200                 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5201                         return;
5202                 if (!node->plane)
5203                         break;
5204                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5205                 node = node->children[1];
5206         }
5207 #elif 0
5208         // FIXME: could be made faster by copying TraceLine code and making it use
5209         // box plane distances...  (variant on the BoxOnPlaneSide code)
5210         for (;;)
5211         {
5212                 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5213                 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5214                 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5215                 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5216                 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5217                 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5218                 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5219                         return;
5220                 if (!node->plane)
5221                         break;
5222                 if (mod_q3bsp_debugtracebrush.integer == 2)
5223                 {
5224                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5225                         node = node->children[1];
5226                         continue;
5227                 }
5228                 else if (mod_q3bsp_debugtracebrush.integer == 1)
5229                 {
5230                         // recurse down node sides
5231                         sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5232                         if (sides == 3)
5233                         {
5234                                 // segment box crosses plane
5235                                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5236                                 node = node->children[1];
5237                                 continue;
5238                         }
5239                         // take whichever side the segment box is on
5240                         node = node->children[sides - 1];
5241                         continue;
5242                 }
5243                 else
5244                 {
5245                         // recurse down node sides
5246                         sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5247                         if (sides == 3)
5248                         {
5249                                 // segment box crosses plane
5250                                 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5251                                 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5252                                 if (sides == 3)
5253                                 {
5254                                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5255                                         node = node->children[1];
5256                                         continue;
5257                                 }
5258                         }
5259                         // take whichever side the segment box is on
5260                         node = node->children[sides - 1];
5261                         continue;
5262                 }
5263                 return;
5264         }
5265 #else
5266         // FIXME: could be made faster by copying TraceLine code and making it use
5267         // box plane distances...  (variant on the BoxOnPlaneSide code)
5268         for (;;)
5269         {
5270                 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5271                 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5272                 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5273                 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5274                 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5275                 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5276                 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5277                         return;
5278                 if (!node->plane)
5279                         break;
5280                 if (mod_q3bsp_debugtracebrush.integer == 2)
5281                 {
5282                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5283                         node = node->children[1];
5284                 }
5285                 else if (mod_q3bsp_debugtracebrush.integer == 1)
5286                 {
5287                         // recurse down node sides
5288                         sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5289                         if (sides == 3)
5290                         {
5291                                 // segment box crosses plane
5292                                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5293                                 node = node->children[1];
5294                         }
5295                         else
5296                         {
5297                                 // take whichever side the segment box is on
5298                                 node = node->children[sides - 1];
5299                         }
5300                 }
5301                 else
5302                 {
5303                         // recurse down node sides
5304                         sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5305                         if (sides == 3)
5306                         {
5307                                 // segment box crosses plane
5308                                 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5309                                 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5310                                 if (sides == 3)
5311                                 {
5312                                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5313                                         sides = 2;
5314                                 }
5315                         }
5316                         // take whichever side the segment box is on
5317                         node = node->children[sides - 1];
5318                 }
5319         }
5320 #endif
5321         // hit a leaf
5322         leaf = (mleaf_t *)node;
5323         for (i = 0;i < leaf->numleafbrushes;i++)
5324         {
5325                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5326                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5327                 {
5328                         brush->markframe = markframe;
5329                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5330                 }
5331         }
5332         if (mod_q3bsp_curves_collisions.integer)
5333         {
5334                 for (i = 0;i < leaf->numleafsurfaces;i++)
5335                 {
5336                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5337                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5338                         {
5339                                 surface->collisionmarkframe = markframe;
5340                                 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, segmentmins, segmentmaxs);
5341                         }
5342                 }
5343         }
5344 }
5345
5346 static void Mod_Q3BSP_TraceBox(model_t *model, int frame, trace_t *trace, const vec3_t boxstartmins, const vec3_t boxstartmaxs, const vec3_t boxendmins, const vec3_t boxendmaxs, int hitsupercontentsmask)
5347 {
5348         int i;
5349         float segmentmins[3], segmentmaxs[3];
5350         colbrushf_t *thisbrush_start, *thisbrush_end;
5351         matrix4x4_t startmatrix, endmatrix;
5352         static int markframe = 0;
5353         msurface_t *surface;
5354         q3mbrush_t *brush;
5355         memset(trace, 0, sizeof(*trace));
5356         trace->fraction = 1;
5357         trace->realfraction = 1;
5358         trace->hitsupercontentsmask = hitsupercontentsmask;
5359         Matrix4x4_CreateIdentity(&startmatrix);
5360         Matrix4x4_CreateIdentity(&endmatrix);
5361         segmentmins[0] = min(boxstartmins[0], boxendmins[0]);
5362         segmentmins[1] = min(boxstartmins[1], boxendmins[1]);
5363         segmentmins[2] = min(boxstartmins[2], boxendmins[2]);
5364         segmentmaxs[0] = max(boxstartmaxs[0], boxendmaxs[0]);
5365         segmentmaxs[1] = max(boxstartmaxs[1], boxendmaxs[1]);
5366         segmentmaxs[2] = max(boxstartmaxs[2], boxendmaxs[2]);
5367         if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxstartmins, boxstartmaxs) && VectorCompare(boxendmins, boxendmaxs))
5368         {
5369                 if (VectorCompare(boxstartmins, boxendmins))
5370                 {
5371                         // point trace
5372                         if (model->brush.submodel)
5373                         {
5374                                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5375                                         if (brush->colbrushf)
5376                                                 Collision_TracePointBrushFloat(trace, boxstartmins, brush->colbrushf);
5377                         }
5378                         else
5379                                 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, boxstartmins, ++markframe);
5380                 }
5381                 else
5382                 {
5383                         // line trace
5384                         if (model->brush.submodel)
5385                         {
5386                                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5387                                         if (brush->colbrushf)
5388                                                 Collision_TraceLineBrushFloat(trace, boxstartmins, boxendmins, brush->colbrushf, brush->colbrushf);
5389                                 if (mod_q3bsp_curves_collisions.integer)
5390                                         for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5391                                                 if (surface->num_collisiontriangles)
5392                                                         Collision_TraceLineTriangleMeshFloat(trace, boxstartmins, boxendmins, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, segmentmins, segmentmaxs);
5393                         }
5394                         else
5395                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, boxstartmins, boxendmins, 0, 1, boxstartmins, boxendmins, ++markframe, segmentmins, segmentmaxs);
5396                 }
5397         }
5398         else
5399         {
5400                 // box trace, performed as brush trace
5401                 thisbrush_start = Collision_BrushForBox(&startmatrix, boxstartmins, boxstartmaxs);
5402                 thisbrush_end = Collision_BrushForBox(&endmatrix, boxendmins, boxendmaxs);
5403                 if (model->brush.submodel)
5404                 {
5405                         for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5406                                 if (brush->colbrushf)
5407                                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5408                         if (mod_q3bsp_curves_collisions.integer)
5409                                 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5410                                         if (surface->num_collisiontriangles)
5411                                                 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, segmentmins, segmentmaxs);
5412                 }
5413                 else
5414                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5415         }
5416 }
5417
5418 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
5419 {
5420         int supercontents = 0;
5421         if (nativecontents & CONTENTSQ3_SOLID)
5422                 supercontents |= SUPERCONTENTS_SOLID;
5423         if (nativecontents & CONTENTSQ3_WATER)
5424                 supercontents |= SUPERCONTENTS_WATER;
5425         if (nativecontents & CONTENTSQ3_SLIME)
5426                 supercontents |= SUPERCONTENTS_SLIME;
5427         if (nativecontents & CONTENTSQ3_LAVA)
5428                 supercontents |= SUPERCONTENTS_LAVA;
5429         if (nativecontents & CONTENTSQ3_BODY)
5430                 supercontents |= SUPERCONTENTS_BODY;
5431         if (nativecontents & CONTENTSQ3_CORPSE)
5432                 supercontents |= SUPERCONTENTS_CORPSE;
5433         if (nativecontents & CONTENTSQ3_NODROP)
5434                 supercontents |= SUPERCONTENTS_NODROP;
5435         if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5436                 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5437         if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5438                 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5439         if (nativecontents & CONTENTSQ3_DONOTENTER)
5440                 supercontents |= SUPERCONTENTS_DONOTENTER;
5441         return supercontents;
5442 }
5443
5444 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
5445 {
5446         int nativecontents = 0;
5447         if (supercontents & SUPERCONTENTS_SOLID)
5448                 nativecontents |= CONTENTSQ3_SOLID;
5449         if (supercontents & SUPERCONTENTS_WATER)
5450                 nativecontents |= CONTENTSQ3_WATER;
5451         if (supercontents & SUPERCONTENTS_SLIME)
5452                 nativecontents |= CONTENTSQ3_SLIME;
5453         if (supercontents & SUPERCONTENTS_LAVA)
5454                 nativecontents |= CONTENTSQ3_LAVA;
5455         if (supercontents & SUPERCONTENTS_BODY)
5456                 nativecontents |= CONTENTSQ3_BODY;
5457         if (supercontents & SUPERCONTENTS_CORPSE)
5458                 nativecontents |= CONTENTSQ3_CORPSE;
5459         if (supercontents & SUPERCONTENTS_NODROP)
5460                 nativecontents |= CONTENTSQ3_NODROP;
5461         if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5462                 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5463         if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5464                 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5465         if (supercontents & SUPERCONTENTS_DONOTENTER)
5466                 nativecontents |= CONTENTSQ3_DONOTENTER;
5467         return nativecontents;
5468 }
5469
5470 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5471 {
5472         int numleafs;
5473         while (node->plane)
5474         {
5475                 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5476                 node = node->children[1];
5477         }
5478         numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5479         if (loadmodel->brush.num_leafs < numleafs)
5480                 loadmodel->brush.num_leafs = numleafs;
5481 }
5482
5483 void Mod_Q3BSP_Load(model_t *mod, void *buffer, void *bufferend)
5484 {
5485         int i, j, numshadowmeshtriangles;
5486         q3dheader_t *header;
5487         float corner[3], yawradius, modelradius;
5488         msurface_t *surface;
5489
5490         mod->type = mod_brushq3;
5491         mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5492         mod->numskins = 1;
5493
5494         header = (q3dheader_t *)buffer;
5495
5496         i = LittleLong(header->version);
5497         if (i != Q3BSPVERSION)
5498                 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5499         mod->brush.ishlbsp = false;
5500         mod->brush.ismcbsp = false;
5501         if (loadmodel->isworldmodel)
5502         {
5503                 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
5504                 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
5505         }
5506
5507         mod->soundfromcenter = true;
5508         mod->TraceBox = Mod_Q3BSP_TraceBox;
5509         mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5510         mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5511         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5512         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5513         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5514         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5515         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5516         mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5517         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5518         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5519         mod->Draw = R_Q1BSP_Draw;
5520         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5521         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5522         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5523         mod->DrawLight = R_Q1BSP_DrawLight;
5524
5525         mod_base = (qbyte *)header;
5526
5527         // swap all the lumps
5528         header->ident = LittleLong(header->ident);
5529         header->version = LittleLong(header->version);
5530         for (i = 0;i < Q3HEADER_LUMPS;i++)
5531         {
5532                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
5533                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
5534         }
5535
5536         Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5537         Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5538         Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5539         Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5540         Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5541         Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5542         Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5543         Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5544         Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS]);
5545         Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5546         Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5547         Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5548         Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5549         Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5550         Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5551         Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5552         Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5553         loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5554
5555         // the MakePortals code works fine on the q3bsp data as well
5556         Mod_Q1BSP_MakePortals();
5557
5558         // make a single combined shadow mesh to allow optimized shadow volume creation
5559         numshadowmeshtriangles = 0;
5560         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5561         {
5562                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5563                 numshadowmeshtriangles += surface->num_triangles;
5564         }
5565         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5566         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5567                 if (surface->groupmesh)
5568                         Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, surface->groupmesh->data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle));
5569         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
5570         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5571
5572         loadmodel->brush.num_leafs = 0;
5573         Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
5574
5575         if (loadmodel->isworldmodel)
5576         {
5577                 // clear out any stale submodels or worldmodels lying around
5578                 // if we did this clear before now, an error might abort loading and
5579                 // leave things in a bad state
5580                 Mod_RemoveStaleWorldModels(loadmodel);
5581         }
5582
5583         mod = loadmodel;
5584         for (i = 0;i < loadmodel->brush.numsubmodels;i++)
5585         {
5586                 if (i > 0)
5587                 {
5588                         char name[10];
5589                         // LordHavoc: only register submodels if it is the world
5590                         // (prevents external bsp models from replacing world submodels with
5591                         //  their own)
5592                         if (!loadmodel->isworldmodel)
5593                                 continue;
5594                         // duplicate the basic information
5595                         sprintf(name, "*%i", i);
5596                         mod = Mod_FindName(name);
5597                         *mod = *loadmodel;
5598                         strcpy(mod->name, name);
5599                         // textures and memory belong to the main model
5600                         mod->texturepool = NULL;
5601                         mod->mempool = NULL;
5602                         mod->brush.GetPVS = NULL;
5603                         mod->brush.FatPVS = NULL;
5604                         mod->brush.BoxTouchingPVS = NULL;
5605                         mod->brush.BoxTouchingLeafPVS = NULL;
5606                         mod->brush.BoxTouchingVisibleLeafs = NULL;
5607                         mod->brush.LightPoint = NULL;
5608                         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5609                 }
5610                 mod->brush.submodel = i;
5611
5612                 // make the model surface list (used by shadowing/lighting)
5613                 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
5614                 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
5615                 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
5616                 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
5617                 mod->surfacelist = Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
5618                 for (j = 0;j < mod->nummodelsurfaces;j++)
5619                         mod->surfacelist[j] = mod->firstmodelsurface + j;
5620
5621                 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
5622                 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
5623                 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5624                 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5625                 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5626                 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5627                 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5628                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5629                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5630                 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5631                 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5632                 mod->yawmins[2] = mod->normalmins[2];
5633                 mod->yawmaxs[2] = mod->normalmaxs[2];
5634                 mod->radius = modelradius;
5635                 mod->radius2 = modelradius * modelradius;
5636
5637                 for (j = 0;j < mod->nummodelsurfaces;j++)
5638                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->surfaceflags & Q3SURFACEFLAG_SKY)
5639                                 break;
5640                 if (j < mod->nummodelsurfaces)
5641                         mod->DrawSky = R_Q1BSP_DrawSky;
5642         }
5643 }
5644
5645 void Mod_IBSP_Load(model_t *mod, void *buffer, void *bufferend)
5646 {
5647         int i = LittleLong(((int *)buffer)[1]);
5648         if (i == Q3BSPVERSION)
5649                 Mod_Q3BSP_Load(mod,buffer, bufferend);
5650         else if (i == Q2BSPVERSION)
5651                 Mod_Q2BSP_Load(mod,buffer, bufferend);
5652         else
5653                 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i\n", i);
5654 }
5655
5656 void Mod_MAP_Load(model_t *mod, void *buffer, void *bufferend)
5657 {
5658         Host_Error("Mod_MAP_Load: not yet implemented\n");
5659 }
5660