model_brush.c

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