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