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