model_brush.c

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