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