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