model_brush.c

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