model_brush.c

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