model_brush.c

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