model_brush.c

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