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                         if (lindex > 0)
2332                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2333                         else
2334                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2335                         s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2336                         t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2337                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2338                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2339                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2340                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2341                         (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2342                 }
2343
2344                 for (i = 0;i < surface->num_triangles;i++)
2345                 {
2346                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2347                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2348                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2349                 }
2350
2351                 // compile additional data about the surface geometry
2352                 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);
2353                 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);
2354                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2355
2356                 // generate surface extents information
2357                 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2358                 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2359                 for (i = 1;i < surface->num_vertices;i++)
2360                 {
2361                         for (j = 0;j < 2;j++)
2362                         {
2363                                 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2364                                 texmins[j] = min(texmins[j], val);
2365                                 texmaxs[j] = max(texmaxs[j], val);
2366                         }
2367                 }
2368                 for (i = 0;i < 2;i++)
2369                 {
2370                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2371                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2372                 }
2373
2374                 smax = surface->lightmapinfo->extents[0] >> 4;
2375                 tmax = surface->lightmapinfo->extents[1] >> 4;
2376                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2377                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2378
2379                 // lighting info
2380                 for (i = 0;i < MAXLIGHTMAPS;i++)
2381                         surface->lightmapinfo->styles[i] = in->styles[i];
2382                 surface->lightmaptexture = NULL;
2383                 surface->deluxemaptexture = r_texture_blanknormalmap;
2384                 i = LittleLong(in->lightofs);
2385                 if (i == -1)
2386                 {
2387                         surface->lightmapinfo->samples = NULL;
2388 #if 0
2389                         // give non-lightmapped water a 1x white lightmap
2390                         if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2391                         {
2392                                 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2393                                 surface->lightmapinfo->styles[0] = 0;
2394                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2395                         }
2396 #endif
2397                 }
2398                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2399                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2400                 else // LordHavoc: white lighting (bsp version 29)
2401                 {
2402                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2403                         if (loadmodel->brushq1.nmaplightdata)
2404                                 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2405                 }
2406
2407                 // check if we should apply a lightmap to this
2408                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2409                 {
2410                         if (ssize > 256 || tsize > 256)
2411                                 Host_Error("Bad surface extents");
2412
2413                         if (lightmapsize < ssize)
2414                                 lightmapsize = ssize;
2415                         if (lightmapsize < tsize)
2416                                 lightmapsize = tsize;
2417
2418                         totallightmapsamples += ssize*tsize;
2419
2420                         // force lightmap upload on first time seeing the surface
2421                         //
2422                         // additionally this is used by the later code to see if a
2423                         // lightmap is needed on this surface (rather than duplicating the
2424                         // logic above)
2425                         loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2426                 }
2427         }
2428
2429         // small maps (such as ammo boxes especially) don't need big lightmap
2430         // textures, so this code tries to guess a good size based on
2431         // totallightmapsamples (size of the lightmaps lump basically), as well as
2432         // trying to max out the gl_max_size if there is a lot of lightmap data to
2433         // store
2434         // additionally, never choose a lightmapsize that is smaller than the
2435         // largest surface encountered (as it would fail)
2436         i = lightmapsize;
2437         for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2438                 ;
2439
2440         // now that we've decided the lightmap texture size, we can do the rest
2441         if (cls.state != ca_dedicated)
2442         {
2443                 int stainmapsize = 0;
2444                 struct alloc_lm_state allocState;
2445
2446                 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2447                 {
2448                         int i, iu, iv, lightmapx = 0, lightmapy = 0;
2449                         float u, v, ubase, vbase, uscale, vscale;
2450
2451                         if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2452                                 continue;
2453
2454                         smax = surface->lightmapinfo->extents[0] >> 4;
2455                         tmax = surface->lightmapinfo->extents[1] >> 4;
2456                         ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2457                         tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2458                         stainmapsize += ssize * tsize * 3;
2459
2460                         if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2461                         {
2462                                 // allocate a texture pool if we need it
2463                                 if (loadmodel->texturepool == NULL)
2464                                         loadmodel->texturepool = R_AllocTexturePool();
2465                                 // could not find room, make a new lightmap
2466                                 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2467                                 if (loadmodel->brushq1.nmaplightdata)
2468                                         deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2469                                 lightmapnumber++;
2470                                 init_alloc_lm_state (&allocState);
2471                                 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2472                         }
2473                         surface->lightmaptexture = lightmaptexture;
2474                         surface->deluxemaptexture = deluxemaptexture;
2475                         surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2476                         surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2477
2478                         uscale = 1.0f / (float)lightmapsize;
2479                         vscale = 1.0f / (float)lightmapsize;
2480                         ubase = lightmapx * uscale;
2481                         vbase = lightmapy * vscale;
2482
2483                         for (i = 0;i < surface->num_vertices;i++)
2484                         {
2485                                 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);
2486                                 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);
2487                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2488                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2489                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2490                                 iu = (int) u;
2491                                 iv = (int) v;
2492                                 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2493                         }
2494                 }
2495
2496                 if (cl_stainmaps.integer)
2497                 {
2498                         // allocate stainmaps for permanent marks on walls and clear white
2499                         unsigned char *stainsamples = NULL;
2500                         stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2501                         memset(stainsamples, 255, stainmapsize);
2502                         // assign pointers
2503                         for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2504                         {
2505                                 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2506                                         continue;
2507                                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2508                                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2509                                 surface->lightmapinfo->stainsamples = stainsamples;
2510                                 stainsamples += ssize * tsize * 3;
2511                         }
2512                 }
2513         }
2514
2515         // generate ushort elements array if possible
2516         if (loadmodel->surfmesh.data_element3s)
2517                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2518                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2519 }
2520
2521 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2522 {
2523         //if (node->parent)
2524         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2525         node->parent = parent;
2526         if (node->plane)
2527         {
2528                 // this is a node, recurse to children
2529                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2530                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2531                 // combine supercontents of children
2532                 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2533         }
2534         else
2535         {
2536                 int j;
2537                 mleaf_t *leaf = (mleaf_t *)node;
2538                 // if this is a leaf, calculate supercontents mask from all collidable
2539                 // primitives in the leaf (brushes and collision surfaces)
2540                 // also flag if the leaf contains any collision surfaces
2541                 leaf->combinedsupercontents = 0;
2542                 // combine the supercontents values of all brushes in this leaf
2543                 for (j = 0;j < leaf->numleafbrushes;j++)
2544                         leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2545                 // check if this leaf contains any collision surfaces (q3 patches)
2546                 for (j = 0;j < leaf->numleafsurfaces;j++)
2547                 {
2548                         msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2549                         if (surface->num_collisiontriangles)
2550                         {
2551                                 leaf->containscollisionsurfaces = true;
2552                                 leaf->combinedsupercontents |= surface->texture->supercontents;
2553                         }
2554                 }
2555         }
2556 }
2557
2558 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2559 {
2560         int                     i, j, count, p;
2561         dnode_t         *in;
2562         mnode_t         *out;
2563
2564         in = (dnode_t *)(mod_base + l->fileofs);
2565         if (l->filelen % sizeof(*in))
2566                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2567         count = l->filelen / sizeof(*in);
2568         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2569
2570         loadmodel->brush.data_nodes = out;
2571         loadmodel->brush.num_nodes = count;
2572
2573         for ( i=0 ; i<count ; i++, in++, out++)
2574         {
2575                 for (j=0 ; j<3 ; j++)
2576                 {
2577                         out->mins[j] = LittleShort(in->mins[j]);
2578                         out->maxs[j] = LittleShort(in->maxs[j]);
2579                 }
2580
2581                 p = LittleLong(in->planenum);
2582                 out->plane = loadmodel->brush.data_planes + p;
2583
2584                 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2585                 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2586
2587                 for (j=0 ; j<2 ; j++)
2588                 {
2589                         // LordHavoc: this code supports broken bsp files produced by
2590                         // arguire qbsp which can produce more than 32768 nodes, any value
2591                         // below count is assumed to be a node number, any other value is
2592                         // assumed to be a leaf number
2593                         p = (unsigned short)LittleShort(in->children[j]);
2594                         if (p < count)
2595                         {
2596                                 if (p < loadmodel->brush.num_nodes)
2597                                         out->children[j] = loadmodel->brush.data_nodes + p;
2598                                 else
2599                                 {
2600                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2601                                         // map it to the solid leaf
2602                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2603                                 }
2604                         }
2605                         else
2606                         {
2607                                 // note this uses 65535 intentionally, -1 is leaf 0
2608                                 p = 65535 - p;
2609                                 if (p < loadmodel->brush.num_leafs)
2610                                         out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2611                                 else
2612                                 {
2613                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2614                                         // map it to the solid leaf
2615                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2616                                 }
2617                         }
2618                 }
2619         }
2620
2621         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2622 }
2623
2624 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2625 {
2626         dleaf_t *in;
2627         mleaf_t *out;
2628         int i, j, count, p;
2629
2630         in = (dleaf_t *)(mod_base + l->fileofs);
2631         if (l->filelen % sizeof(*in))
2632                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2633         count = l->filelen / sizeof(*in);
2634         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2635
2636         loadmodel->brush.data_leafs = out;
2637         loadmodel->brush.num_leafs = count;
2638         // get visleafs from the submodel data
2639         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2640         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2641         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2642         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2643
2644         for ( i=0 ; i<count ; i++, in++, out++)
2645         {
2646                 for (j=0 ; j<3 ; j++)
2647                 {
2648                         out->mins[j] = LittleShort(in->mins[j]);
2649                         out->maxs[j] = LittleShort(in->maxs[j]);
2650                 }
2651
2652                 // FIXME: this function could really benefit from some error checking
2653
2654                 out->contents = LittleLong(in->contents);
2655
2656                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2657                 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2658                 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2659                 {
2660                         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);
2661                         out->firstleafsurface = NULL;
2662                         out->numleafsurfaces = 0;
2663                 }
2664
2665                 out->clusterindex = i - 1;
2666                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2667                         out->clusterindex = -1;
2668
2669                 p = LittleLong(in->visofs);
2670                 // ignore visofs errors on leaf 0 (solid)
2671                 if (p >= 0 && out->clusterindex >= 0)
2672                 {
2673                         if (p >= loadmodel->brushq1.num_compressedpvs)
2674                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2675                         else
2676                                 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);
2677                 }
2678
2679                 for (j = 0;j < 4;j++)
2680                         out->ambient_sound_level[j] = in->ambient_level[j];
2681
2682                 // FIXME: Insert caustics here
2683         }
2684 }
2685
2686 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2687 {
2688         int i, j;
2689         mleaf_t *leaf;
2690         const unsigned char *pvs;
2691         // if there's no vis data, assume supported (because everything is visible all the time)
2692         if (!loadmodel->brush.data_pvsclusters)
2693                 return true;
2694         // check all liquid leafs to see if they can see into empty leafs, if any
2695         // can we can assume this map supports r_wateralpha
2696         for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2697         {
2698                 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2699                 {
2700                         pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2701                         for (j = 0;j < loadmodel->brush.num_leafs;j++)
2702                                 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2703                                         return true;
2704                 }
2705         }
2706         return false;
2707 }
2708
2709 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2710 {
2711         dclipnode_t *in;
2712         mclipnode_t *out;
2713         int                     i, count;
2714         hull_t          *hull;
2715
2716         in = (dclipnode_t *)(mod_base + l->fileofs);
2717         if (l->filelen % sizeof(*in))
2718                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2719         count = l->filelen / sizeof(*in);
2720         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2721
2722         loadmodel->brushq1.clipnodes = out;
2723         loadmodel->brushq1.numclipnodes = count;
2724
2725         for (i = 1; i < MAX_MAP_HULLS; i++)
2726         {
2727                 hull = &loadmodel->brushq1.hulls[i];
2728                 hull->clipnodes = out;
2729                 hull->firstclipnode = 0;
2730                 hull->lastclipnode = count-1;
2731                 hull->planes = loadmodel->brush.data_planes;
2732                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2733                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2734                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2735                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2736                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2737                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2738                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2739         }
2740
2741         for (i=0 ; i<count ; i++, out++, in++)
2742         {
2743                 out->planenum = LittleLong(in->planenum);
2744                 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2745                 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2746                 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2747                 if (out->children[0] >= count)
2748                         out->children[0] -= 65536;
2749                 if (out->children[1] >= count)
2750                         out->children[1] -= 65536;
2751                 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2752                         Host_Error("Corrupt clipping hull(out of range planenum)");
2753         }
2754 }
2755
2756 //Duplicate the drawing hull structure as a clipping hull
2757 static void Mod_Q1BSP_MakeHull0(void)
2758 {
2759         mnode_t         *in;
2760         mclipnode_t *out;
2761         int                     i;
2762         hull_t          *hull;
2763
2764         hull = &loadmodel->brushq1.hulls[0];
2765
2766         in = loadmodel->brush.data_nodes;
2767         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2768
2769         hull->clipnodes = out;
2770         hull->firstclipnode = 0;
2771         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2772         hull->planes = loadmodel->brush.data_planes;
2773
2774         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2775         {
2776                 out->planenum = in->plane - loadmodel->brush.data_planes;
2777                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2778                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2779         }
2780 }
2781
2782 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2783 {
2784         int i, j;
2785         short *in;
2786
2787         in = (short *)(mod_base + l->fileofs);
2788         if (l->filelen % sizeof(*in))
2789                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2790         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2791         loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2792
2793         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2794         {
2795                 j = (unsigned short) LittleShort(in[i]);
2796                 if (j >= loadmodel->num_surfaces)
2797                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2798                 loadmodel->brush.data_leafsurfaces[i] = j;
2799         }
2800 }
2801
2802 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2803 {
2804         int             i;
2805         int             *in;
2806
2807         in = (int *)(mod_base + l->fileofs);
2808         if (l->filelen % sizeof(*in))
2809                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2810         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2811         loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2812
2813         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2814                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2815 }
2816
2817
2818 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2819 {
2820         int                     i;
2821         mplane_t        *out;
2822         dplane_t        *in;
2823
2824         in = (dplane_t *)(mod_base + l->fileofs);
2825         if (l->filelen % sizeof(*in))
2826                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2827
2828         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2829         loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2830
2831         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2832         {
2833                 out->normal[0] = LittleFloat(in->normal[0]);
2834                 out->normal[1] = LittleFloat(in->normal[1]);
2835                 out->normal[2] = LittleFloat(in->normal[2]);
2836                 out->dist = LittleFloat(in->dist);
2837
2838                 PlaneClassify(out);
2839         }
2840 }
2841
2842 static void Mod_Q1BSP_LoadMapBrushes(void)
2843 {
2844 #if 0
2845 // unfinished
2846         int submodel, numbrushes;
2847         qboolean firstbrush;
2848         char *text, *maptext;
2849         char mapfilename[MAX_QPATH];
2850         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2851         strlcat (mapfilename, ".map", sizeof (mapfilename));
2852         maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2853         if (!maptext)
2854                 return;
2855         text = maptext;
2856         if (!COM_ParseToken_Simple(&data, false, false))
2857                 return; // error
2858         submodel = 0;
2859         for (;;)
2860         {
2861                 if (!COM_ParseToken_Simple(&data, false, false))
2862                         break;
2863                 if (com_token[0] != '{')
2864                         return; // error
2865                 // entity
2866                 firstbrush = true;
2867                 numbrushes = 0;
2868                 maxbrushes = 256;
2869                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2870                 for (;;)
2871                 {
2872                         if (!COM_ParseToken_Simple(&data, false, false))
2873                                 return; // error
2874                         if (com_token[0] == '}')
2875                                 break; // end of entity
2876                         if (com_token[0] == '{')
2877                         {
2878                                 // brush
2879                                 if (firstbrush)
2880                                 {
2881                                         if (submodel)
2882                                         {
2883                                                 if (submodel > loadmodel->brush.numsubmodels)
2884                                                 {
2885                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2886                                                         model = NULL;
2887                                                 }
2888                                                 else
2889                                                         model = loadmodel->brush.submodels[submodel];
2890                                         }
2891                                         else
2892                                                 model = loadmodel;
2893                                 }
2894                                 for (;;)
2895                                 {
2896                                         if (!COM_ParseToken_Simple(&data, false, false))
2897                                                 return; // error
2898                                         if (com_token[0] == '}')
2899                                                 break; // end of brush
2900                                         // each brush face should be this format:
2901                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2902                                         // FIXME: support hl .map format
2903                                         for (pointnum = 0;pointnum < 3;pointnum++)
2904                                         {
2905                                                 COM_ParseToken_Simple(&data, false, false);
2906                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2907                                                 {
2908                                                         COM_ParseToken_Simple(&data, false, false);
2909                                                         point[pointnum][componentnum] = atof(com_token);
2910                                                 }
2911                                                 COM_ParseToken_Simple(&data, false, false);
2912                                         }
2913                                         COM_ParseToken_Simple(&data, false, false);
2914                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2915                                         COM_ParseToken_Simple(&data, false, false);
2916                                         //scroll_s = atof(com_token);
2917                                         COM_ParseToken_Simple(&data, false, false);
2918                                         //scroll_t = atof(com_token);
2919                                         COM_ParseToken_Simple(&data, false, false);
2920                                         //rotate = atof(com_token);
2921                                         COM_ParseToken_Simple(&data, false, false);
2922                                         //scale_s = atof(com_token);
2923                                         COM_ParseToken_Simple(&data, false, false);
2924                                         //scale_t = atof(com_token);
2925                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2926                                         VectorNormalizeDouble(planenormal);
2927                                         planedist = DotProduct(point[0], planenormal);
2928                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2929                                 }
2930                                 continue;
2931                         }
2932                 }
2933         }
2934 #endif
2935 }
2936
2937
2938 #define MAX_PORTALPOINTS 64
2939
2940 typedef struct portal_s
2941 {
2942         mplane_t plane;
2943         mnode_t *nodes[2];              // [0] = front side of plane
2944         struct portal_s *next[2];
2945         int numpoints;
2946         double points[3*MAX_PORTALPOINTS];
2947         struct portal_s *chain; // all portals are linked into a list
2948 }
2949 portal_t;
2950
2951 static portal_t *portalchain;
2952
2953 /*
2954 ===========
2955 AllocPortal
2956 ===========
2957 */
2958 static portal_t *AllocPortal(void)
2959 {
2960         portal_t *p;
2961         p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2962         p->chain = portalchain;
2963         portalchain = p;
2964         return p;
2965 }
2966
2967 static void FreePortal(portal_t *p)
2968 {
2969         Mem_Free(p);
2970 }
2971
2972 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2973 {
2974         // process only nodes (leafs already had their box calculated)
2975         if (!node->plane)
2976                 return;
2977
2978         // calculate children first
2979         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2980         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2981
2982         // make combined bounding box from children
2983         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2984         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2985         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2986         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2987         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2988         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2989 }
2990
2991 static void Mod_Q1BSP_FinalizePortals(void)
2992 {
2993         int i, j, numportals, numpoints;
2994         portal_t *p, *pnext;
2995         mportal_t *portal;
2996         mvertex_t *point;
2997         mleaf_t *leaf, *endleaf;
2998
2999         // tally up portal and point counts and recalculate bounding boxes for all
3000         // leafs (because qbsp is very sloppy)
3001         leaf = loadmodel->brush.data_leafs;
3002         endleaf = leaf + loadmodel->brush.num_leafs;
3003         for (;leaf < endleaf;leaf++)
3004         {
3005                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
3006                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3007         }
3008         p = portalchain;
3009         numportals = 0;
3010         numpoints = 0;
3011         while (p)
3012         {
3013                 // note: this check must match the one below or it will usually corrupt memory
3014                 // 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
3015                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3016                 {
3017                         numportals += 2;
3018                         numpoints += p->numpoints * 2;
3019                 }
3020                 p = p->chain;
3021         }
3022         loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3023         loadmodel->brush.num_portals = numportals;
3024         loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3025         loadmodel->brush.num_portalpoints = numpoints;
3026         // clear all leaf portal chains
3027         for (i = 0;i < loadmodel->brush.num_leafs;i++)
3028                 loadmodel->brush.data_leafs[i].portals = NULL;
3029         // process all portals in the global portal chain, while freeing them
3030         portal = loadmodel->brush.data_portals;
3031         point = loadmodel->brush.data_portalpoints;
3032         p = portalchain;
3033         portalchain = NULL;
3034         while (p)
3035         {
3036                 pnext = p->chain;
3037
3038                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3039                 {
3040                         // note: this check must match the one above or it will usually corrupt memory
3041                         // 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
3042                         if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3043                         {
3044                                 // first make the back to front portal(forward portal)
3045                                 portal->points = point;
3046                                 portal->numpoints = p->numpoints;
3047                                 portal->plane.dist = p->plane.dist;
3048                                 VectorCopy(p->plane.normal, portal->plane.normal);
3049                                 portal->here = (mleaf_t *)p->nodes[1];
3050                                 portal->past = (mleaf_t *)p->nodes[0];
3051                                 // copy points
3052                                 for (j = 0;j < portal->numpoints;j++)
3053                                 {
3054                                         VectorCopy(p->points + j*3, point->position);
3055                                         point++;
3056                                 }
3057                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3058                                 PlaneClassify(&portal->plane);
3059
3060                                 // link into leaf's portal chain
3061                                 portal->next = portal->here->portals;
3062                                 portal->here->portals = portal;
3063
3064                                 // advance to next portal
3065                                 portal++;
3066
3067                                 // then make the front to back portal(backward portal)
3068                                 portal->points = point;
3069                                 portal->numpoints = p->numpoints;
3070                                 portal->plane.dist = -p->plane.dist;
3071                                 VectorNegate(p->plane.normal, portal->plane.normal);
3072                                 portal->here = (mleaf_t *)p->nodes[0];
3073                                 portal->past = (mleaf_t *)p->nodes[1];
3074                                 // copy points
3075                                 for (j = portal->numpoints - 1;j >= 0;j--)
3076                                 {
3077                                         VectorCopy(p->points + j*3, point->position);
3078                                         point++;
3079                                 }
3080                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3081                                 PlaneClassify(&portal->plane);
3082
3083                                 // link into leaf's portal chain
3084                                 portal->next = portal->here->portals;
3085                                 portal->here->portals = portal;
3086
3087                                 // advance to next portal
3088                                 portal++;
3089                         }
3090                         // add the portal's polygon points to the leaf bounding boxes
3091                         for (i = 0;i < 2;i++)
3092                         {
3093                                 leaf = (mleaf_t *)p->nodes[i];
3094                                 for (j = 0;j < p->numpoints;j++)
3095                                 {
3096                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3097                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3098                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3099                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3100                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3101                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3102                                 }
3103                         }
3104                 }
3105                 FreePortal(p);
3106                 p = pnext;
3107         }
3108         // now recalculate the node bounding boxes from the leafs
3109         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
3110 }
3111
3112 /*
3113 =============
3114 AddPortalToNodes
3115 =============
3116 */
3117 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3118 {
3119         if (!front)
3120                 Host_Error("AddPortalToNodes: NULL front node");
3121         if (!back)
3122                 Host_Error("AddPortalToNodes: NULL back node");
3123         if (p->nodes[0] || p->nodes[1])
3124                 Host_Error("AddPortalToNodes: already included");
3125         // 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
3126
3127         p->nodes[0] = front;
3128         p->next[0] = (portal_t *)front->portals;
3129         front->portals = (mportal_t *)p;
3130
3131         p->nodes[1] = back;
3132         p->next[1] = (portal_t *)back->portals;
3133         back->portals = (mportal_t *)p;
3134 }
3135
3136 /*
3137 =============
3138 RemovePortalFromNode
3139 =============
3140 */
3141 static void RemovePortalFromNodes(portal_t *portal)
3142 {
3143         int i;
3144         mnode_t *node;
3145         void **portalpointer;
3146         portal_t *t;
3147         for (i = 0;i < 2;i++)
3148         {
3149                 node = portal->nodes[i];
3150
3151                 portalpointer = (void **) &node->portals;
3152                 while (1)
3153                 {
3154                         t = (portal_t *)*portalpointer;
3155                         if (!t)
3156                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
3157
3158                         if (t == portal)
3159                         {
3160                                 if (portal->nodes[0] == node)
3161                                 {
3162                                         *portalpointer = portal->next[0];
3163                                         portal->nodes[0] = NULL;
3164                                 }
3165                                 else if (portal->nodes[1] == node)
3166                                 {
3167                                         *portalpointer = portal->next[1];
3168                                         portal->nodes[1] = NULL;
3169                                 }
3170                                 else
3171                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3172                                 break;
3173                         }
3174
3175                         if (t->nodes[0] == node)
3176                                 portalpointer = (void **) &t->next[0];
3177                         else if (t->nodes[1] == node)
3178                                 portalpointer = (void **) &t->next[1];
3179                         else
3180                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3181                 }
3182         }
3183 }
3184
3185 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3186 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3187 {
3188         int i, side;
3189         mnode_t *front, *back, *other_node;
3190         mplane_t clipplane, *plane;
3191         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3192         int numfrontpoints, numbackpoints;
3193         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3194
3195         // if a leaf, we're done
3196         if (!node->plane)
3197                 return;
3198
3199         plane = node->plane;
3200
3201         front = node->children[0];
3202         back = node->children[1];
3203         if (front == back)
3204                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3205
3206         // create the new portal by generating a polygon for the node plane,
3207         // and clipping it by all of the other portals(which came from nodes above this one)
3208         nodeportal = AllocPortal();
3209         nodeportal->plane = *plane;
3210
3211         // 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)
3212         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);
3213         nodeportal->numpoints = 4;
3214         side = 0;       // shut up compiler warning
3215         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3216         {
3217                 clipplane = portal->plane;
3218                 if (portal->nodes[0] == portal->nodes[1])
3219                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3220                 if (portal->nodes[0] == node)
3221                         side = 0;
3222                 else if (portal->nodes[1] == node)
3223                 {
3224                         clipplane.dist = -clipplane.dist;
3225                         VectorNegate(clipplane.normal, clipplane.normal);
3226                         side = 1;
3227                 }
3228                 else
3229                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3230
3231                 for (i = 0;i < nodeportal->numpoints*3;i++)
3232                         frontpoints[i] = nodeportal->points[i];
3233                 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);
3234                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3235                         break;
3236         }
3237
3238         if (nodeportal->numpoints < 3)
3239         {
3240                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3241                 nodeportal->numpoints = 0;
3242         }
3243         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3244         {
3245                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3246                 nodeportal->numpoints = 0;
3247         }
3248
3249         AddPortalToNodes(nodeportal, front, back);
3250
3251         // split the portals of this node along this node's plane and assign them to the children of this node
3252         // (migrating the portals downward through the tree)
3253         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3254         {
3255                 if (portal->nodes[0] == portal->nodes[1])
3256                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3257                 if (portal->nodes[0] == node)
3258                         side = 0;
3259                 else if (portal->nodes[1] == node)
3260                         side = 1;
3261                 else
3262                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3263                 nextportal = portal->next[side];
3264                 if (!portal->numpoints)
3265                         continue;
3266
3267                 other_node = portal->nodes[!side];
3268                 RemovePortalFromNodes(portal);
3269
3270                 // cut the portal into two portals, one on each side of the node plane
3271                 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);
3272
3273                 if (!numfrontpoints)
3274                 {
3275                         if (side == 0)
3276                                 AddPortalToNodes(portal, back, other_node);
3277                         else
3278                                 AddPortalToNodes(portal, other_node, back);
3279                         continue;
3280                 }
3281                 if (!numbackpoints)
3282                 {
3283                         if (side == 0)
3284                                 AddPortalToNodes(portal, front, other_node);
3285                         else
3286                                 AddPortalToNodes(portal, other_node, front);
3287                         continue;
3288                 }
3289
3290                 // the portal is split
3291                 splitportal = AllocPortal();
3292                 temp = splitportal->chain;
3293                 *splitportal = *portal;
3294                 splitportal->chain = temp;
3295                 for (i = 0;i < numbackpoints*3;i++)
3296                         splitportal->points[i] = backpoints[i];
3297                 splitportal->numpoints = numbackpoints;
3298                 for (i = 0;i < numfrontpoints*3;i++)
3299                         portal->points[i] = frontpoints[i];
3300                 portal->numpoints = numfrontpoints;
3301
3302                 if (side == 0)
3303                 {
3304                         AddPortalToNodes(portal, front, other_node);
3305                         AddPortalToNodes(splitportal, back, other_node);
3306                 }
3307                 else
3308                 {
3309                         AddPortalToNodes(portal, other_node, front);
3310                         AddPortalToNodes(splitportal, other_node, back);
3311                 }
3312         }
3313
3314         Mod_Q1BSP_RecursiveNodePortals(front);
3315         Mod_Q1BSP_RecursiveNodePortals(back);
3316 }
3317
3318 static void Mod_Q1BSP_MakePortals(void)
3319 {
3320         portalchain = NULL;
3321         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3322         Mod_Q1BSP_FinalizePortals();
3323 }
3324
3325 //Returns PVS data for a given point
3326 //(note: can return NULL)
3327 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3328 {
3329         mnode_t *node;
3330         node = model->brush.data_nodes;
3331         while (node->plane)
3332                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3333         if (((mleaf_t *)node)->clusterindex >= 0)
3334                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3335         else
3336                 return NULL;
3337 }
3338
3339 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)
3340 {
3341         while (node->plane)
3342         {
3343                 float d = PlaneDiff(org, node->plane);
3344                 if (d > radius)
3345                         node = node->children[0];
3346                 else if (d < -radius)
3347                         node = node->children[1];
3348                 else
3349                 {
3350                         // go down both sides
3351                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3352                         node = node->children[1];
3353                 }
3354         }
3355         // if this leaf is in a cluster, accumulate the pvs bits
3356         if (((mleaf_t *)node)->clusterindex >= 0)
3357         {
3358                 int i;
3359                 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3360                 for (i = 0;i < pvsbytes;i++)
3361                         pvsbuffer[i] |= pvs[i];
3362         }
3363 }
3364
3365 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3366 //of the given point.
3367 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3368 {
3369         int bytes = model->brush.num_pvsclusterbytes;
3370         bytes = min(bytes, pvsbufferlength);
3371         if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3372         {
3373                 memset(pvsbuffer, 0xFF, bytes);
3374                 return bytes;
3375         }
3376         if (!merge)
3377                 memset(pvsbuffer, 0, bytes);
3378         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3379         return bytes;
3380 }
3381
3382 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3383 {
3384         vec3_t size;
3385         const hull_t *hull;
3386
3387         VectorSubtract(inmaxs, inmins, size);
3388         if (cmodel->brush.ishlbsp)
3389         {
3390                 if (size[0] < 3)
3391                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3392                 else if (size[0] <= 32)
3393                 {
3394                         if (size[2] < 54) // pick the nearest of 36 or 72
3395                                 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3396                         else
3397                                 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3398                 }
3399                 else
3400                         hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3401         }
3402         else
3403         {
3404                 if (size[0] < 3)
3405                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3406                 else if (size[0] <= 32)
3407                         hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3408                 else
3409                         hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3410         }
3411         VectorCopy(inmins, outmins);
3412         VectorAdd(inmins, hull->clip_size, outmaxs);
3413 }
3414
3415 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3416 {
3417         int i, j, k;
3418         dheader_t *header;
3419         dmodel_t *bm;
3420         mempool_t *mainmempool;
3421         float dist, modelyawradius, modelradius;
3422         msurface_t *surface;
3423         int numshadowmeshtriangles;
3424         hullinfo_t hullinfo;
3425         int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3426         model_brush_lightstyleinfo_t styleinfo[256];
3427         unsigned char *datapointer;
3428
3429         mod->modeldatatypestring = "Q1BSP";
3430
3431         mod->type = mod_brushq1;
3432
3433         header = (dheader_t *)buffer;
3434
3435         i = LittleLong(header->version);
3436         if (i != BSPVERSION && i != 30)
3437                 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3438         mod->brush.ishlbsp = i == 30;
3439
3440 // fill in hull info
3441         VectorClear (hullinfo.hullsizes[0][0]);
3442         VectorClear (hullinfo.hullsizes[0][1]);
3443         if (mod->brush.ishlbsp)
3444         {
3445                 mod->modeldatatypestring = "HLBSP";
3446
3447                 hullinfo.filehulls = 4;
3448                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3449                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3450                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3451                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3452                 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3453                 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3454         }
3455         else
3456         {
3457                 hullinfo.filehulls = 4;
3458                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3459                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3460                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3461                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3462         }
3463
3464 // read lumps
3465         mod_base = (unsigned char*)buffer;
3466         for (i = 0; i < HEADER_LUMPS; i++)
3467         {
3468                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3469                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3470         }
3471
3472         mod->soundfromcenter = true;
3473         mod->TraceBox = Mod_Q1BSP_TraceBox;
3474         mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3475         mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3476         mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3477         mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3478         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3479         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3480         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3481         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3482         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3483         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3484         mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3485         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3486         mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3487         mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3488         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3489         mod->Draw = R_Q1BSP_Draw;
3490         mod->DrawDepth = R_Q1BSP_DrawDepth;
3491         mod->DrawDebug = R_Q1BSP_DrawDebug;
3492         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3493         mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3494         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3495         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3496         mod->DrawLight = R_Q1BSP_DrawLight;
3497
3498 // load into heap
3499
3500         mod->brush.qw_md4sum = 0;
3501         mod->brush.qw_md4sum2 = 0;
3502         for (i = 0;i < HEADER_LUMPS;i++)
3503         {
3504                 if (i == LUMP_ENTITIES)
3505                         continue;
3506                 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3507                 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3508                         continue;
3509                 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3510         }
3511
3512         Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3513         Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3514         Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3515         Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3516         Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3517         Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3518         Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3519         Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3520         Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3521         Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3522         Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3523         // load submodels before leafs because they contain the number of vis leafs
3524         Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3525         Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3526         Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3527         Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3528
3529         // check if the map supports transparent water rendering
3530         loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3531
3532         if (mod->brushq1.data_compressedpvs)
3533                 Mem_Free(mod->brushq1.data_compressedpvs);
3534         mod->brushq1.data_compressedpvs = NULL;
3535         mod->brushq1.num_compressedpvs = 0;
3536
3537         Mod_Q1BSP_MakeHull0();
3538         Mod_Q1BSP_MakePortals();
3539
3540         mod->numframes = 2;             // regular and alternate animation
3541         mod->numskins = 1;
3542
3543         mainmempool = mod->mempool;
3544
3545         // make a single combined shadow mesh to allow optimized shadow volume creation
3546         numshadowmeshtriangles = 0;
3547         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3548         {
3549                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3550                 numshadowmeshtriangles += surface->num_triangles;
3551         }
3552         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3553         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3554                 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));
3555         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3556         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3557
3558         if (loadmodel->brush.numsubmodels)
3559                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3560
3561         // LordHavoc: to clear the fog around the original quake submodel code, I
3562         // will explain:
3563         // first of all, some background info on the submodels:
3564         // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3565         // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3566         // now the weird for loop itself:
3567         // the loop functions in an odd way, on each iteration it sets up the
3568         // current 'mod' model (which despite the confusing code IS the model of
3569         // the number i), at the end of the loop it duplicates the model to become
3570         // the next submodel, and loops back to set up the new submodel.
3571
3572         // LordHavoc: now the explanation of my sane way (which works identically):
3573         // set up the world model, then on each submodel copy from the world model
3574         // and set up the submodel with the respective model info.
3575         totalstylesurfaces = 0;
3576         totalstyles = 0;
3577         for (i = 0;i < mod->brush.numsubmodels;i++)
3578         {
3579                 memset(stylecounts, 0, sizeof(stylecounts));
3580                 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3581                 {
3582                         surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3583                         for (j = 0;j < MAXLIGHTMAPS;j++)
3584                                 stylecounts[surface->lightmapinfo->styles[j]]++;
3585                 }
3586                 for (k = 0;k < 255;k++)
3587                 {
3588                         totalstyles++;
3589                         if (stylecounts[k])
3590                                 totalstylesurfaces += stylecounts[k];
3591                 }
3592         }
3593         datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3594         for (i = 0;i < mod->brush.numsubmodels;i++)
3595         {
3596                 // LordHavoc: this code was originally at the end of this loop, but
3597                 // has been transformed to something more readable at the start here.
3598
3599                 if (i > 0)
3600                 {
3601                         char name[10];
3602                         // duplicate the basic information
3603                         dpsnprintf(name, sizeof(name), "*%i", i);
3604                         mod = Mod_FindName(name, loadmodel->name);
3605                         // copy the base model to this one
3606                         *mod = *loadmodel;
3607                         // rename the clone back to its proper name
3608                         strlcpy(mod->name, name, sizeof(mod->name));
3609                         mod->brush.parentmodel = loadmodel;
3610                         // textures and memory belong to the main model
3611                         mod->texturepool = NULL;
3612                         mod->mempool = NULL;
3613                         mod->brush.TraceLineOfSight = NULL;
3614                         mod->brush.GetPVS = NULL;
3615                         mod->brush.FatPVS = NULL;
3616                         mod->brush.BoxTouchingPVS = NULL;
3617                         mod->brush.BoxTouchingLeafPVS = NULL;
3618                         mod->brush.BoxTouchingVisibleLeafs = NULL;
3619                         mod->brush.FindBoxClusters = NULL;
3620                         mod->brush.LightPoint = NULL;
3621                         mod->brush.AmbientSoundLevelsForPoint = NULL;
3622                 }
3623
3624                 mod->brush.submodel = i;
3625
3626                 if (loadmodel->brush.submodels)
3627                         loadmodel->brush.submodels[i] = mod;
3628
3629                 bm = &mod->brushq1.submodels[i];
3630
3631                 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3632                 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3633                 {
3634                         mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3635                         mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3636                 }
3637
3638                 mod->firstmodelsurface = bm->firstface;
3639                 mod->nummodelsurfaces = bm->numfaces;
3640
3641                 // make the model surface list (used by shadowing/lighting)
3642                 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3643                 Mod_MakeSortedSurfaces(mod);
3644
3645                 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3646                 // (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)
3647                 VectorCopy(bm->mins, mod->normalmins);
3648                 VectorCopy(bm->maxs, mod->normalmaxs);
3649                 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3650                 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3651                 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3652                 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3653                 modelradius = modelyawradius + modelradius * modelradius;
3654                 modelyawradius = sqrt(modelyawradius);
3655                 modelradius = sqrt(modelradius);
3656                 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3657                 mod->yawmins[2] = mod->normalmins[2];
3658                 mod->yawmaxs[0] = mod->yawmaxs[1] =  modelyawradius;
3659                 mod->yawmaxs[2] = mod->normalmaxs[2];
3660                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3661                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] =  modelradius;
3662                 mod->radius = modelradius;
3663                 mod->radius2 = modelradius * modelradius;
3664
3665                 // this gets altered below if sky or water is used
3666                 mod->DrawSky = NULL;
3667                 mod->DrawAddWaterPlanes = NULL;
3668
3669                 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3670                 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3671                 if (mod->nummodelsurfaces)
3672                 {
3673                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3674                                 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3675                                         break;
3676                         if (j < mod->nummodelsurfaces)
3677                                 mod->DrawSky = R_Q1BSP_DrawSky;
3678
3679                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3680                                 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3681                                         break;
3682                         if (j < mod->nummodelsurfaces)
3683                                 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3684
3685                         // build lightstyle update chains
3686                         // (used to rapidly mark lightmapupdateflags on many surfaces
3687                         // when d_lightstylevalue changes)
3688                         memset(stylecounts, 0, sizeof(stylecounts));
3689                         for (k = 0;k < mod->nummodelsurfaces;k++)
3690                         {
3691                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3692                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3693                                         stylecounts[surface->lightmapinfo->styles[j]]++;
3694                         }
3695                         mod->brushq1.num_lightstyles = 0;
3696                         for (k = 0;k < 255;k++)
3697                         {
3698                                 if (stylecounts[k])
3699                                 {
3700                                         styleinfo[mod->brushq1.num_lightstyles].style = k;
3701                                         styleinfo[mod->brushq1.num_lightstyles].value = 0;
3702                                         styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3703                                         styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3704                                         remapstyles[k] = mod->brushq1.num_lightstyles;
3705                                         mod->brushq1.num_lightstyles++;
3706                                 }
3707                         }
3708                         for (k = 0;k < mod->nummodelsurfaces;k++)
3709                         {
3710                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3711                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3712                                 {
3713                                         if (surface->lightmapinfo->styles[j] != 255)
3714                                         {
3715                                                 int r = remapstyles[surface->lightmapinfo->styles[j]];
3716                                                 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3717                                         }
3718                                 }
3719                         }
3720                         mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3721                         memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3722                 }
3723                 else
3724                 {
3725                         // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3726                         Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3727                 }
3728                 //mod->brushq1.num_visleafs = bm->visleafs;
3729         }
3730
3731         Mod_Q1BSP_LoadMapBrushes();
3732
3733         //Mod_Q1BSP_ProcessLightList();
3734
3735         if (developer.integer >= 10)
3736                 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);
3737 }
3738
3739 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3740 {
3741 }
3742
3743 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3744 {
3745 /*
3746         d_t *in;
3747         m_t *out;
3748         int i, count;
3749
3750         in = (void *)(mod_base + l->fileofs);
3751         if (l->filelen % sizeof(*in))
3752                 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3753         count = l->filelen / sizeof(*in);
3754         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3755
3756         loadmodel-> = out;
3757         loadmodel->num = count;
3758
3759         for (i = 0;i < count;i++, in++, out++)
3760         {
3761         }
3762 */
3763 }
3764
3765 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3766 {
3767 /*
3768         d_t *in;
3769         m_t *out;
3770         int i, count;
3771
3772         in = (void *)(mod_base + l->fileofs);
3773         if (l->filelen % sizeof(*in))
3774                 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3775         count = l->filelen / sizeof(*in);
3776         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3777
3778         loadmodel-> = out;
3779         loadmodel->num = count;
3780
3781         for (i = 0;i < count;i++, in++, out++)
3782         {
3783         }
3784 */
3785 }
3786
3787 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3788 {
3789 /*
3790         d_t *in;
3791         m_t *out;
3792         int i, count;
3793
3794         in = (void *)(mod_base + l->fileofs);
3795         if (l->filelen % sizeof(*in))
3796                 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3797         count = l->filelen / sizeof(*in);
3798         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3799
3800         loadmodel-> = out;
3801         loadmodel->num = count;
3802
3803         for (i = 0;i < count;i++, in++, out++)
3804         {
3805         }
3806 */
3807 }
3808
3809 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3810 {
3811 /*
3812         d_t *in;
3813         m_t *out;
3814         int i, count;
3815
3816         in = (void *)(mod_base + l->fileofs);
3817         if (l->filelen % sizeof(*in))
3818                 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3819         count = l->filelen / sizeof(*in);
3820         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3821
3822         loadmodel-> = out;
3823         loadmodel->num = count;
3824
3825         for (i = 0;i < count;i++, in++, out++)
3826         {
3827         }
3828 */
3829 }
3830
3831 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3832 {
3833 /*
3834         d_t *in;
3835         m_t *out;
3836         int i, count;
3837
3838         in = (void *)(mod_base + l->fileofs);
3839         if (l->filelen % sizeof(*in))
3840                 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3841         count = l->filelen / sizeof(*in);
3842         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3843
3844         loadmodel-> = out;
3845         loadmodel->num = count;
3846
3847         for (i = 0;i < count;i++, in++, out++)
3848         {
3849         }
3850 */
3851 }
3852
3853 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3854 {
3855 /*
3856         d_t *in;
3857         m_t *out;
3858         int i, count;
3859
3860         in = (void *)(mod_base + l->fileofs);
3861         if (l->filelen % sizeof(*in))
3862                 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3863         count = l->filelen / sizeof(*in);
3864         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3865
3866         loadmodel-> = out;
3867         loadmodel->num = count;
3868
3869         for (i = 0;i < count;i++, in++, out++)
3870         {
3871         }
3872 */
3873 }
3874
3875 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3876 {
3877 /*
3878         d_t *in;
3879         m_t *out;
3880         int i, count;
3881
3882         in = (void *)(mod_base + l->fileofs);
3883         if (l->filelen % sizeof(*in))
3884                 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3885         count = l->filelen / sizeof(*in);
3886         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3887
3888         loadmodel-> = out;
3889         loadmodel->num = count;
3890
3891         for (i = 0;i < count;i++, in++, out++)
3892         {
3893         }
3894 */
3895 }
3896
3897 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3898 {
3899 /*
3900         d_t *in;
3901         m_t *out;
3902         int i, count;
3903
3904         in = (void *)(mod_base + l->fileofs);
3905         if (l->filelen % sizeof(*in))
3906                 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3907         count = l->filelen / sizeof(*in);
3908         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3909
3910         loadmodel-> = out;
3911         loadmodel->num = count;
3912
3913         for (i = 0;i < count;i++, in++, out++)
3914         {
3915         }
3916 */
3917 }
3918
3919 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3920 {
3921 /*
3922         d_t *in;
3923         m_t *out;
3924         int i, count;
3925
3926         in = (void *)(mod_base + l->fileofs);
3927         if (l->filelen % sizeof(*in))
3928                 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3929         count = l->filelen / sizeof(*in);
3930         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3931
3932         loadmodel-> = out;
3933         loadmodel->num = count;
3934
3935         for (i = 0;i < count;i++, in++, out++)
3936         {
3937         }
3938 */
3939 }
3940
3941 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3942 {
3943 /*
3944         d_t *in;
3945         m_t *out;
3946         int i, count;
3947
3948         in = (void *)(mod_base + l->fileofs);
3949         if (l->filelen % sizeof(*in))
3950                 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3951         count = l->filelen / sizeof(*in);
3952         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3953
3954         loadmodel-> = out;
3955         loadmodel->num = count;
3956
3957         for (i = 0;i < count;i++, in++, out++)
3958         {
3959         }
3960 */
3961 }
3962
3963 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3964 {
3965 /*
3966         d_t *in;
3967         m_t *out;
3968         int i, count;
3969
3970         in = (void *)(mod_base + l->fileofs);
3971         if (l->filelen % sizeof(*in))
3972                 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3973         count = l->filelen / sizeof(*in);
3974         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3975
3976         loadmodel-> = out;
3977         loadmodel->num = count;
3978
3979         for (i = 0;i < count;i++, in++, out++)
3980         {
3981         }
3982 */
3983 }
3984
3985 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3986 {
3987 /*
3988         d_t *in;
3989         m_t *out;
3990         int i, count;
3991
3992         in = (void *)(mod_base + l->fileofs);
3993         if (l->filelen % sizeof(*in))
3994                 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3995         count = l->filelen / sizeof(*in);
3996         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3997
3998         loadmodel-> = out;
3999         loadmodel->num = count;
4000
4001         for (i = 0;i < count;i++, in++, out++)
4002         {
4003         }
4004 */
4005 }
4006
4007 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4008 {
4009 /*
4010         d_t *in;
4011         m_t *out;
4012         int i, count;
4013
4014         in = (void *)(mod_base + l->fileofs);
4015         if (l->filelen % sizeof(*in))
4016                 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4017         count = l->filelen / sizeof(*in);
4018         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4019
4020         loadmodel-> = out;
4021         loadmodel->num = count;
4022
4023         for (i = 0;i < count;i++, in++, out++)
4024         {
4025         }
4026 */
4027 }
4028
4029 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4030 {
4031 /*
4032         d_t *in;
4033         m_t *out;
4034         int i, count;
4035
4036         in = (void *)(mod_base + l->fileofs);
4037         if (l->filelen % sizeof(*in))
4038                 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4039         count = l->filelen / sizeof(*in);
4040         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4041
4042         loadmodel-> = out;
4043         loadmodel->num = count;
4044
4045         for (i = 0;i < count;i++, in++, out++)
4046         {
4047         }
4048 */
4049 }
4050
4051 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4052 {
4053 /*
4054         d_t *in;
4055         m_t *out;
4056         int i, count;
4057
4058         in = (void *)(mod_base + l->fileofs);
4059         if (l->filelen % sizeof(*in))
4060                 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4061         count = l->filelen / sizeof(*in);
4062         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4063
4064         loadmodel-> = out;
4065         loadmodel->num = count;
4066
4067         for (i = 0;i < count;i++, in++, out++)
4068         {
4069         }
4070 */
4071 }
4072
4073 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4074 {
4075 /*
4076         d_t *in;
4077         m_t *out;
4078         int i, count;
4079
4080         in = (void *)(mod_base + l->fileofs);
4081         if (l->filelen % sizeof(*in))
4082                 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4083         count = l->filelen / sizeof(*in);
4084         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4085
4086         loadmodel-> = out;
4087         loadmodel->num = count;
4088
4089         for (i = 0;i < count;i++, in++, out++)
4090         {
4091         }
4092 */
4093 }
4094
4095 static void Mod_Q2BSP_LoadModels(lump_t *l)
4096 {
4097 /*
4098         d_t *in;
4099         m_t *out;
4100         int i, count;
4101
4102         in = (void *)(mod_base + l->fileofs);
4103         if (l->filelen % sizeof(*in))
4104                 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4105         count = l->filelen / sizeof(*in);
4106         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4107
4108         loadmodel-> = out;
4109         loadmodel->num = count;
4110
4111         for (i = 0;i < count;i++, in++, out++)
4112         {
4113         }
4114 */
4115 }
4116
4117 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4118 {
4119         int i;
4120         q2dheader_t *header;
4121
4122         Host_Error("Mod_Q2BSP_Load: not yet implemented");
4123
4124         mod->modeldatatypestring = "Q2BSP";
4125
4126         mod->type = mod_brushq2;
4127
4128         header = (q2dheader_t *)buffer;
4129
4130         i = LittleLong(header->version);
4131         if (i != Q2BSPVERSION)
4132                 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4133
4134         mod_base = (unsigned char *)header;
4135
4136         // swap all the lumps
4137         for (i = 0;i < (int) sizeof(*header) / 4;i++)
4138                 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4139
4140         mod->brush.qw_md4sum = 0;
4141         mod->brush.qw_md4sum2 = 0;
4142         for (i = 0;i < Q2HEADER_LUMPS;i++)
4143         {
4144                 if (i == Q2LUMP_ENTITIES)
4145                         continue;
4146                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4147                 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4148                         continue;
4149                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4150         }
4151
4152         Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4153         Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4154         Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4155         Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4156         Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4157         Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4158         Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4159         Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4160         Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4161         Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4162         Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4163         Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4164         Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4165         Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4166         Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4167         Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4168         Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4169         // LordHavoc: must go last because this makes the submodels
4170         Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4171 }
4172
4173 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4174 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4175
4176 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4177 {
4178         const char *data;
4179         char key[128], value[MAX_INPUTLINE];
4180         float v[3];
4181         loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4182         loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4183         loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4184         if (!l->filelen)
4185                 return;
4186         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4187         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4188         loadmodel->brush.entities[l->filelen] = 0;
4189         data = loadmodel->brush.entities;
4190         // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4191         if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4192         {
4193                 while (1)
4194                 {
4195                         if (!COM_ParseToken_Simple(&data, false, false))
4196                                 break; // error
4197                         if (com_token[0] == '}')
4198                                 break; // end of worldspawn
4199                         if (com_token[0] == '_')
4200                                 strlcpy(key, com_token + 1, sizeof(key));
4201                         else
4202                                 strlcpy(key, com_token, sizeof(key));
4203                         while (key[strlen(key)-1] == ' ') // remove trailing spaces
4204                                 key[strlen(key)-1] = 0;
4205                         if (!COM_ParseToken_Simple(&data, false, false))
4206                                 break; // error
4207                         strlcpy(value, com_token, sizeof(value));
4208                         if (!strcmp("gridsize", key))
4209                         {
4210 #if _MSC_VER >= 1400
4211 #define sscanf sscanf_s
4212 #endif
4213                                 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4214                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4215                         }
4216                 }
4217         }
4218 }
4219
4220 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4221 {
4222         q3dtexture_t *in;
4223         texture_t *out;
4224         int i, count;
4225
4226         in = (q3dtexture_t *)(mod_base + l->fileofs);
4227         if (l->filelen % sizeof(*in))
4228                 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4229         count = l->filelen / sizeof(*in);
4230         out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4231
4232         loadmodel->data_textures = out;
4233         loadmodel->num_textures = count;
4234         loadmodel->num_texturesperskin = loadmodel->num_textures;
4235
4236         for (i = 0;i < count;i++)
4237         {
4238                 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4239                 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4240                 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4241         }
4242
4243         if (cls.state == ca_dedicated)
4244                 return;
4245
4246         for (i = 0;i < count;i++, in++, out++)
4247                 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4248 }
4249
4250 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4251 {
4252         q3dplane_t *in;
4253         mplane_t *out;
4254         int i, count;
4255
4256         in = (q3dplane_t *)(mod_base + l->fileofs);
4257         if (l->filelen % sizeof(*in))
4258                 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4259         count = l->filelen / sizeof(*in);
4260         out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4261
4262         loadmodel->brush.data_planes = out;
4263         loadmodel->brush.num_planes = count;
4264
4265         for (i = 0;i < count;i++, in++, out++)
4266         {
4267                 out->normal[0] = LittleFloat(in->normal[0]);
4268                 out->normal[1] = LittleFloat(in->normal[1]);
4269                 out->normal[2] = LittleFloat(in->normal[2]);
4270                 out->dist = LittleFloat(in->dist);
4271                 PlaneClassify(out);
4272         }
4273 }
4274
4275 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4276 {
4277         q3dbrushside_t *in;
4278         q3mbrushside_t *out;
4279         int i, n, count;
4280
4281         in = (q3dbrushside_t *)(mod_base + l->fileofs);
4282         if (l->filelen % sizeof(*in))
4283                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4284         count = l->filelen / sizeof(*in);
4285         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4286
4287         loadmodel->brush.data_brushsides = out;
4288         loadmodel->brush.num_brushsides = count;
4289
4290         for (i = 0;i < count;i++, in++, out++)
4291         {
4292                 n = LittleLong(in->planeindex);
4293                 if (n < 0 || n >= loadmodel->brush.num_planes)
4294                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4295                 out->plane = loadmodel->brush.data_planes + n;
4296                 n = LittleLong(in->textureindex);
4297                 if (n < 0 || n >= loadmodel->num_textures)
4298                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4299                 out->texture = loadmodel->data_textures + n;
4300         }
4301 }
4302
4303 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4304 {
4305         q3dbrushside_ig_t *in;
4306         q3mbrushside_t *out;
4307         int i, n, count;
4308
4309         in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4310         if (l->filelen % sizeof(*in))
4311                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4312         count = l->filelen / sizeof(*in);
4313         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4314
4315         loadmodel->brush.data_brushsides = out;
4316         loadmodel->brush.num_brushsides = count;
4317
4318         for (i = 0;i < count;i++, in++, out++)
4319         {
4320                 n = LittleLong(in->planeindex);
4321                 if (n < 0 || n >= loadmodel->brush.num_planes)
4322                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4323                 out->plane = loadmodel->brush.data_planes + n;
4324                 n = LittleLong(in->textureindex);
4325                 if (n < 0 || n >= loadmodel->num_textures)
4326                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4327                 out->texture = loadmodel->data_textures + n;
4328         }
4329 }
4330
4331 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4332 {
4333         q3dbrush_t *in;
4334         q3mbrush_t *out;
4335         int i, j, n, c, count, maxplanes;
4336         colplanef_t *planes;
4337
4338         in = (q3dbrush_t *)(mod_base + l->fileofs);
4339         if (l->filelen % sizeof(*in))
4340                 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4341         count = l->filelen / sizeof(*in);
4342         out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4343
4344         loadmodel->brush.data_brushes = out;
4345         loadmodel->brush.num_brushes = count;
4346
4347         maxplanes = 0;
4348         planes = NULL;
4349
4350         for (i = 0;i < count;i++, in++, out++)
4351         {
4352                 n = LittleLong(in->firstbrushside);
4353                 c = LittleLong(in->numbrushsides);
4354                 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4355                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4356                 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4357                 out->numbrushsides = c;
4358                 n = LittleLong(in->textureindex);
4359                 if (n < 0 || n >= loadmodel->num_textures)
4360                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4361                 out->texture = loadmodel->data_textures + n;
4362
4363                 // make a list of mplane_t structs to construct a colbrush from
4364                 if (maxplanes < out->numbrushsides)
4365                 {
4366                         maxplanes = out->numbrushsides;
4367                         if (planes)
4368                                 Mem_Free(planes);
4369                         planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4370                 }
4371                 for (j = 0;j < out->numbrushsides;j++)
4372                 {
4373                         VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4374                         planes[j].dist = out->firstbrushside[j].plane->dist;
4375                         planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4376                         planes[j].texture = out->firstbrushside[j].texture;
4377                 }
4378                 // make the colbrush from the planes
4379                 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4380
4381                 // this whole loop can take a while (e.g. on redstarrepublic4)
4382                 CL_KeepaliveMessage(false);
4383         }
4384         if (planes)
4385                 Mem_Free(planes);
4386 }
4387
4388 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4389 {
4390         q3deffect_t *in;
4391         q3deffect_t *out;
4392         int i, n, count;
4393
4394         in = (q3deffect_t *)(mod_base + l->fileofs);
4395         if (l->filelen % sizeof(*in))
4396                 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4397         count = l->filelen / sizeof(*in);
4398         out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4399
4400         loadmodel->brushq3.data_effects = out;
4401         loadmodel->brushq3.num_effects = count;
4402
4403         for (i = 0;i < count;i++, in++, out++)
4404         {
4405                 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4406                 n = LittleLong(in->brushindex);
4407                 if (n >= loadmodel->brush.num_brushes)
4408                 {
4409                         Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4410                         n = -1;
4411                 }
4412                 out->brushindex = n;
4413                 out->unknown = LittleLong(in->unknown);
4414         }
4415 }
4416
4417 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4418 {
4419         q3dvertex_t *in;
4420         int i, count;
4421
4422         in = (q3dvertex_t *)(mod_base + l->fileofs);
4423         if (l->filelen % sizeof(*in))
4424                 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4425         loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4426         loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4427         loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4428         loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4429         loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4430         loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4431
4432         for (i = 0;i < count;i++, in++)
4433         {
4434                 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4435                 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4436                 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4437                 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4438                 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4439                 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4440                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4441                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4442                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4443                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4444                 // svector/tvector are calculated later in face loading
4445                 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4446                 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4447                 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4448                 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4449         }
4450 }
4451
4452 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4453 {
4454         int *in;
4455         int *out;
4456         int i, count;
4457
4458         in = (int *)(mod_base + l->fileofs);
4459         if (l->filelen % sizeof(int[3]))
4460                 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4461         count = l->filelen / sizeof(*in);
4462         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4463
4464         loadmodel->brushq3.num_triangles = count / 3;
4465         loadmodel->brushq3.data_element3i = out;
4466
4467         for (i = 0;i < count;i++, in++, out++)
4468         {
4469                 *out = LittleLong(*in);
4470                 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4471                 {
4472                         Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4473                         if(!loadmodel->brushq3.num_vertices)
4474                                 Host_Error("Mod_Q1BSP_LoadTrianglles: %s has triangles but no vertexes, cannot fix\n", loadmodel->name);
4475                         *out = 0;
4476                 }
4477         }
4478 }
4479
4480 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4481 {
4482         q3dlightmap_t *input_pointer;
4483         int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4484         unsigned char *c;
4485
4486         unsigned char *convertedpixels;
4487         char mapname[MAX_QPATH];
4488         int size, bytesperpixel, rgbmap[3];
4489         qboolean external;
4490         unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4491
4492         // defaults for q3bsp
4493         size = 128;
4494         bytesperpixel = 3;
4495         rgbmap[0] = 2;
4496         rgbmap[1] = 1;
4497         rgbmap[2] = 0;
4498         external = false;
4499         loadmodel->brushq3.lightmapsize = 128;
4500
4501         if (cls.state == ca_dedicated)
4502                 return;
4503
4504         if(mod_q3bsp_nolightmaps.integer)
4505         {
4506                 return;
4507         }
4508         else if(l->filelen)
4509         {
4510                 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4511                 if (developer_loading.integer)
4512                         Con_Printf("Using internal lightmaps\n");
4513                 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4514                 if (l->filelen % sizeof(*input_pointer))
4515                         Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4516                 count = l->filelen / sizeof(*input_pointer);
4517                 for(i = 0; i < count; ++i)
4518                         inpixels[i] = input_pointer[i].rgb;
4519         }
4520         else
4521         {
4522                 // no internal lightmaps
4523                 // try external lightmaps
4524                 if (developer_loading.integer)
4525                         Con_Printf("Using external lightmaps\n");
4526                 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4527                 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false);
4528                 if(!inpixels[0])
4529                         return;
4530
4531                 // using EXTERNAL lightmaps instead
4532                 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4533                 {
4534                         Mem_Free(inpixels[0]);
4535                         Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4536                 }
4537
4538                 size = image_width;
4539                 bytesperpixel = 4;
4540                 rgbmap[0] = 0;
4541                 rgbmap[1] = 1;
4542                 rgbmap[2] = 2;
4543                 external = true;
4544
4545                 for(count = 1; ; ++count)
4546                 {
4547                         inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false);
4548                         if(!inpixels[count])
4549                                 break; // we got all of them
4550                         if(image_width != size || image_height != size)
4551                         {
4552                                 for(i = 0; i <= count; ++i)
4553                                         Mem_Free(inpixels[i]);
4554                                 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4555                         }
4556                 }
4557         }
4558
4559         convertedpixels = (unsigned char *) Mem_Alloc(tempmempool, size*size*4);
4560         loadmodel->brushq3.lightmapsize = size;
4561         loadmodel->brushq3.num_originallightmaps = count;
4562
4563         // now check the surfaces to see if any of them index an odd numbered
4564         // lightmap, if so this is not a deluxemapped bsp file
4565         //
4566         // also check what lightmaps are actually used, because q3map2 sometimes
4567         // (always?) makes an unused one at the end, which
4568         // q3map2 sometimes (or always?) makes a second blank lightmap for no
4569         // reason when only one lightmap is used, which can throw off the
4570         // deluxemapping detection method, so check 2-lightmap bsp's specifically
4571         // to see if the second lightmap is blank, if so it is not deluxemapped.
4572         loadmodel->brushq3.deluxemapping = !(count & 1);
4573         loadmodel->brushq3.deluxemapping_modelspace = true;
4574         endlightmap = 0;
4575         if (loadmodel->brushq3.deluxemapping)
4576         {
4577                 int facecount = faceslump->filelen / sizeof(q3dface_t);
4578                 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4579                 for (i = 0;i < facecount;i++)
4580                 {
4581                         j = LittleLong(faces[i].lightmapindex);
4582                         if (j >= 0)
4583                         {
4584                                 endlightmap = max(endlightmap, j + 1);
4585                                 if ((j & 1) || j + 1 >= count)
4586                                 {
4587                                         loadmodel->brushq3.deluxemapping = false;
4588                                         break;
4589                                 }
4590                         }
4591                 }
4592         }
4593
4594         // q3map2 sometimes (or always?) makes a second blank lightmap for no
4595         // reason when only one lightmap is used, which can throw off the
4596         // deluxemapping detection method, so check 2-lightmap bsp's specifically
4597         // to see if the second lightmap is blank, if so it is not deluxemapped.
4598         //
4599         // further research has shown q3map2 sometimes creates a deluxemap and two
4600         // blank lightmaps, which must be handled properly as well
4601         if (endlightmap == 1 && count > 1)
4602         {
4603                 c = inpixels[1];
4604                 for (i = 0;i < size*size;i++)
4605                 {
4606                         if (c[bytesperpixel*i + rgbmap[0]])
4607                                 break;
4608                         if (c[bytesperpixel*i + rgbmap[1]])
4609                                 break;
4610                         if (c[bytesperpixel*i + rgbmap[2]])
4611                                 break;
4612                 }
4613                 if (i == size*size)
4614                 {
4615                         // all pixels in the unused lightmap were black...
4616                         loadmodel->brushq3.deluxemapping = false;
4617                 }
4618         }
4619
4620         Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4621
4622         // figure out what the most reasonable merge power is within limits
4623
4624         loadmodel->brushq3.num_lightmapmergepower = 0;
4625
4626         for(i = 0; (128 << i) < size; ++i)
4627                 ;
4628         // i is now 0 for 128, 1 for 256, etc
4629
4630         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++)
4631                 loadmodel->brushq3.num_lightmapmergepower = power;
4632
4633         loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4634
4635         loadmodel->brushq3.num_mergedlightmaps = ((count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4636         loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4637         if (loadmodel->brushq3.deluxemapping)
4638                 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4639
4640         // allocate a texture pool if we need it
4641         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4642                 loadmodel->texturepool = R_AllocTexturePool();
4643
4644         power = loadmodel->brushq3.num_lightmapmergepower;
4645         power2 = power * 2;
4646         mask = (1 << power) - 1;
4647         for (i = 0;i < count;i++)
4648         {
4649                 // figure out which merged lightmap texture this fits into
4650                 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4651                 for (k = 0;k < size*size;k++)
4652                 {
4653                         convertedpixels[k*4+0] = inpixels[i][k*bytesperpixel+rgbmap[0]];
4654                         convertedpixels[k*4+1] = inpixels[i][k*bytesperpixel+rgbmap[1]];
4655                         convertedpixels[k*4+2] = inpixels[i][k*bytesperpixel+rgbmap[2]];
4656                         convertedpixels[k*4+3] = 255;
4657                 }
4658                 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4659                 {
4660                         // if the lightmap has not been allocated yet, create it
4661                         if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4662                         {
4663                                 // create a lightmap only as large as necessary to hold the
4664                                 // remaining size*size blocks
4665                                 // if there are multiple merged lightmap textures then they will
4666                                 // all be full size except the last one which may be smaller
4667                                 // because it only needs to the remaining blocks, and it will often
4668                                 // be odd sizes like 2048x512 due to only being 25% full or so.
4669                                 j = (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) - (lightmapindex << power2);
4670                                 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4671                                         ;
4672                                 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4673                                         ;
4674                                 if (developer_loading.integer)
4675                                         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);
4676                                 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);
4677                                 if (loadmodel->brushq3.data_deluxemaps)
4678                                         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);
4679                         }
4680                         mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4681                         mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4682                         j = (i >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) & ((1 << power2) - 1);
4683                         if (loadmodel->brushq3.deluxemapping && (i & 1))
4684                                 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4685                         else
4686                                 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4687                 }
4688                 else
4689                 {
4690                         // figure out which merged lightmap texture this fits into
4691                         if (loadmodel->brushq3.deluxemapping && (i & 1))
4692                                 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);
4693                         else
4694                                 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);
4695                 }
4696         }
4697
4698         Mem_Free(convertedpixels);
4699         if(external)
4700         {
4701                 for(i = 0; i < count; ++i)
4702                         Mem_Free(inpixels[i]);
4703         }
4704 }
4705
4706 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
4707 {
4708         int j, k, cnt, tri;
4709         float *mins, *maxs;
4710         const float *vert;
4711         if(stride > 0)
4712         {
4713                 *collisionstride = stride;
4714                 cnt = (num_triangles + stride - 1) / stride;
4715                 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
4716                 for(j = 0; j < cnt; ++j)
4717                 {
4718                         mins = &((*collisionbbox6f)[6 * j + 0]);
4719                         maxs = &((*collisionbbox6f)[6 * j + 3]);
4720                         for(k = 0; k < stride; ++k)
4721                         {
4722                                 tri = j * stride + k;
4723                                 if(tri >= num_triangles)
4724                                         break;
4725                                 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
4726                                 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
4727                                 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
4728                                 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
4729                                 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
4730                                 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
4731                                 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
4732                                 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
4733                                 if(vert[0] < mins[0]) mins[0] = vert[0];
4734                                 if(vert[1] < mins[1]) mins[1] = vert[1];
4735                                 if(vert[2] < mins[2]) mins[2] = vert[2];
4736                                 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4737                                 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4738                                 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4739                                 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
4740                                 if(vert[0] < mins[0]) mins[0] = vert[0];
4741                                 if(vert[1] < mins[1]) mins[1] = vert[1];
4742                                 if(vert[2] < mins[2]) mins[2] = vert[2];
4743                                 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4744                                 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4745                                 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4746                         }
4747                 }
4748         }
4749         else
4750         {
4751                 *collisionstride = 0;
4752                 *collisionbbox6f = NULL;
4753         }
4754 }
4755
4756 typedef struct patchtess_s
4757 {
4758         patchinfo_t info;
4759
4760         // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
4761         int surface_id;
4762         float lodgroup[6];
4763         float *originalvertex3f;
4764 } patchtess_t;
4765
4766 #define PATCHTESS_SAME_LODGROUP(a,b) \
4767         ( \
4768                 (a).lodgroup[0] == (b).lodgroup[0] && \
4769                 (a).lodgroup[1] == (b).lodgroup[1] && \
4770                 (a).lodgroup[2] == (b).lodgroup[2] && \
4771                 (a).lodgroup[3] == (b).lodgroup[3] && \
4772                 (a).lodgroup[4] == (b).lodgroup[4] && \
4773                 (a).lodgroup[5] == (b).lodgroup[5] \
4774         )
4775
4776 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4777 {
4778         q3dface_t *in, *oldin;
4779         msurface_t *out, *oldout;
4780         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;
4781         float lightmaptcbase[2], lightmaptcscale[2];
4782         //int *originalelement3i;
4783         //int *originalneighbor3i;
4784         float *originalvertex3f;
4785         //float *originalsvector3f;
4786         //float *originaltvector3f;
4787         float *originalnormal3f;
4788         float *originalcolor4f;
4789         float *originaltexcoordtexture2f;
4790         float *originaltexcoordlightmap2f;
4791         float *v;
4792         patchtess_t *patchtess = NULL;
4793         int patchtesscount = 0;
4794         qboolean again;
4795
4796         in = (q3dface_t *)(mod_base + l->fileofs);
4797         if (l->filelen % sizeof(*in))
4798                 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4799         count = l->filelen / sizeof(*in);
4800         out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4801
4802         loadmodel->data_surfaces = out;
4803         loadmodel->num_surfaces = count;
4804
4805         if(count > 0)
4806                 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
4807
4808         i = 0;
4809         oldi = i;
4810         oldin = in;
4811         oldout = out;
4812         meshvertices = 0;
4813         meshtriangles = 0;
4814         for (;i < count;i++, in++, out++)
4815         {
4816                 // check face type first
4817                 type = LittleLong(in->type);
4818                 if (type != Q3FACETYPE_FLAT
4819                  && type != Q3FACETYPE_PATCH
4820                  && type != Q3FACETYPE_MESH
4821                  && type != Q3FACETYPE_FLARE)
4822                 {
4823                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4824                         continue;
4825                 }
4826
4827                 n = LittleLong(in->textureindex);
4828                 if (n < 0 || n >= loadmodel->num_textures)
4829                 {
4830                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4831                         continue;
4832                 }
4833                 out->texture = loadmodel->data_textures + n;
4834                 n = LittleLong(in->effectindex);
4835                 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4836                 {
4837                         if (developer.integer >= 100)
4838                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4839                         n = -1;
4840                 }
4841                 if (n == -1)
4842                         out->effect = NULL;
4843                 else
4844                         out->effect = loadmodel->brushq3.data_effects + n;
4845
4846                 if (cls.state != ca_dedicated)
4847                 {
4848                         out->lightmaptexture = NULL;
4849                         out->deluxemaptexture = r_texture_blanknormalmap;
4850                         n = LittleLong(in->lightmapindex);
4851                         if (n < 0)
4852                                 n = -1;
4853                         else if (n >= loadmodel->brushq3.num_originallightmaps)
4854                         {
4855                                 if(loadmodel->brushq3.num_originallightmaps != 0)
4856                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4857                                 n = -1;
4858                         }
4859                         else
4860                         {
4861                                 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4862                                 if (loadmodel->brushq3.deluxemapping)
4863                                         out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4864                         }
4865                 }
4866
4867                 firstvertex = LittleLong(in->firstvertex);
4868                 numvertices = LittleLong(in->numvertices);
4869                 firstelement = LittleLong(in->firstelement);
4870                 numtriangles = LittleLong(in->numelements) / 3;
4871                 if (numtriangles * 3 != LittleLong(in->numelements))
4872                 {
4873                         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));
4874                         continue;
4875                 }
4876                 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4877                 {
4878                         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);
4879                         continue;
4880                 }
4881                 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4882                 {
4883                         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);
4884                         continue;
4885                 }
4886                 switch(type)
4887                 {
4888                 case Q3FACETYPE_FLAT:
4889                 case Q3FACETYPE_MESH:
4890                         // no processing necessary
4891                         break;
4892                 case Q3FACETYPE_PATCH:
4893                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4894                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4895                         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))
4896                         {
4897                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4898                                 continue;
4899                         }
4900                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4901
4902                         // convert patch to Q3FACETYPE_MESH
4903                         xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4904                         ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4905                         // bound to user settings
4906                         xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4907                         ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4908                         // bound to sanity settings
4909                         xtess = bound(0, xtess, 1024);
4910                         ytess = bound(0, ytess, 1024);
4911
4912                         // lower quality collision patches! Same procedure as before, but different cvars
4913                         // convert patch to Q3FACETYPE_MESH
4914                         cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4915                         cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4916                         // bound to user settings
4917                         cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
4918                         cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
4919                         // bound to sanity settings
4920                         cxtess = bound(0, cxtess, 1024);
4921                         cytess = bound(0, cytess, 1024);
4922
4923                         // store it for the LOD grouping step
4924                         patchtess[patchtesscount].info.xsize = patchsize[0];
4925                         patchtess[patchtesscount].info.ysize = patchsize[1];
4926                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
4927                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
4928                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
4929                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
4930
4931                         patchtess[patchtesscount].surface_id = i;
4932                         patchtess[patchtesscount].lodgroup[0] = in->specific.patch.mins[0];
4933                         patchtess[patchtesscount].lodgroup[1] = in->specific.patch.mins[1];
4934                         patchtess[patchtesscount].lodgroup[2] = in->specific.patch.mins[2];
4935                         patchtess[patchtesscount].lodgroup[3] = in->specific.patch.maxs[0];
4936                         patchtess[patchtesscount].lodgroup[4] = in->specific.patch.maxs[1];
4937                         patchtess[patchtesscount].lodgroup[5] = in->specific.patch.maxs[2];
4938                         patchtess[patchtesscount].originalvertex3f = originalvertex3f;
4939                         ++patchtesscount;
4940                         break;
4941                 case Q3FACETYPE_FLARE:
4942                         if (developer.integer >= 100)
4943                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4944                         // don't render it
4945                         continue;
4946                 }
4947                 out->num_vertices = numvertices;
4948                 out->num_triangles = numtriangles;
4949                 meshvertices += out->num_vertices;
4950                 meshtriangles += out->num_triangles;
4951         }
4952
4953         // Fix patches tesselations so that they make no seams
4954         do
4955         {
4956                 again = false;
4957                 for(i = 0; i < patchtesscount; ++i)
4958                 {
4959                         for(j = i+1; j < patchtesscount; ++j)
4960                         {
4961                                 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
4962                                         continue;
4963
4964                                 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
4965                                         again = true;
4966                         }
4967                 }
4968         }
4969         while (again);
4970
4971         // Calculate resulting number of triangles
4972         for(i = 0; i < patchtesscount; ++i)
4973         {
4974                 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
4975                 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
4976                 numvertices = finalwidth * finalheight;
4977                 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4978
4979                 oldout[patchtess[i].surface_id].num_vertices = numvertices;
4980                 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
4981                 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
4982                 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
4983         }
4984
4985         i = oldi;
4986         in = oldin;
4987         out = oldout;
4988         Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4989         meshvertices = 0;
4990         meshtriangles = 0;
4991         for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
4992         {
4993                 if (out->num_vertices < 3 || out->num_triangles < 1)
4994                         continue;
4995
4996                 type = LittleLong(in->type);
4997                 firstvertex = LittleLong(in->firstvertex);
4998                 firstelement = LittleLong(in->firstelement);
4999                 out->num_firstvertex = meshvertices;
5000                 out->num_firsttriangle = meshtriangles;
5001                 switch(type)
5002                 {
5003                 case Q3FACETYPE_FLAT:
5004                 case Q3FACETYPE_MESH:
5005                         // no processing necessary, except for lightmap merging
5006                         for (j = 0;j < out->num_vertices;j++)
5007                         {
5008                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5009                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5010                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5011                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5012                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5013                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5014                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5015                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5016                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5017                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5018                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5019                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5020                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5021                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5022                         }
5023                         for (j = 0;j < out->num_triangles*3;j++)
5024                                 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5025                         break;
5026                 case Q3FACETYPE_PATCH:
5027                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5028                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5029                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5030                         originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5031                         originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5032                         originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5033                         originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5034
5035                         xtess = ytess = cxtess = cytess = -1;
5036                         for(j = 0; j < patchtesscount; ++j)
5037                                 if(patchtess[j].surface_id == i)
5038                                 {
5039                                         xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5040                                         ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5041                                         cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5042                                         cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5043                                         break;
5044                                 }
5045                         if(xtess == -1)
5046                         {
5047                                 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5048                                 xtess = ytess = cxtess = cytess = 0;
5049                         }
5050
5051                         finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5052                         finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5053                         finalvertices = finalwidth * finalheight;
5054                         finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5055                         type = Q3FACETYPE_MESH;
5056                         // generate geometry
5057                         // (note: normals are skipped because they get recalculated)
5058                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5059                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5060                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5061                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5062                         Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5063                         Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5064
5065                         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);
5066
5067                         if (developer.integer >= 100)
5068                         {
5069                                 if (out->num_triangles < finaltriangles)
5070                                         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);
5071                                 else
5072                                         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);
5073                         }
5074                         // q3map does not put in collision brushes for curves... ugh
5075                         // build the lower quality collision geometry
5076                         finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5077                         finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5078                         finalvertices = finalwidth * finalheight;
5079                         finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5080
5081                         out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5082                         out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5083                         out->num_collisionvertices = finalvertices;
5084                         out->num_collisiontriangles = finaltriangles;
5085                         Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5086                         Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
5087
5088                         //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5089                         Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
5090
5091                         oldnumtriangles = out->num_triangles;
5092                         oldnumtriangles2 = out->num_collisiontriangles;
5093                         out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
5094
5095                         // now optimize the collision mesh by finding triangle bboxes...
5096                         Mod_Q3BSP_BuildBBoxes(out->data_collisionelement3i, out->num_collisiontriangles, out->data_collisionvertex3f, &out->data_collisionbbox6f, &out->num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5097                         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);
5098
5099                         if (developer.integer >= 100)
5100                                 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);
5101                         break;
5102                 default:
5103                         break;
5104                 }
5105                 meshvertices += out->num_vertices;
5106                 meshtriangles += out->num_triangles;
5107                 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5108                         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)
5109                                 invalidelements++;
5110                 if (invalidelements)
5111                 {
5112                         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);
5113                         for (j = 0;j < out->num_triangles * 3;j++)
5114                         {
5115                                 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5116                                 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)
5117                                         (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5118                         }
5119                         Con_Print("\n");
5120                 }
5121                 // calculate a bounding box
5122                 VectorClear(out->mins);
5123                 VectorClear(out->maxs);
5124                 if (out->num_vertices)
5125                 {
5126                         if (cls.state != ca_dedicated && out->lightmaptexture)
5127                         {
5128                                 // figure out which part of the merged lightmap this fits into
5129                                 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5130                                 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5131                                 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5132                                 lightmapindex &= mergewidth * mergeheight - 1;
5133                                 lightmaptcscale[0] = 1.0f / mergewidth;
5134                                 lightmaptcscale[1] = 1.0f / mergeheight;
5135                                 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5136                                 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5137                                 // modify the lightmap texcoords to match this region of the merged lightmap
5138                                 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5139                                 {
5140                                         v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5141                                         v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5142                                 }
5143                         }
5144                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5145                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5146                         for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5147                         {
5148                                 out->mins[0] = min(out->mins[0], v[0]);
5149                                 out->maxs[0] = max(out->maxs[0], v[0]);
5150                                 out->mins[1] = min(out->mins[1], v[1]);
5151                                 out->maxs[1] = max(out->maxs[1], v[1]);
5152                                 out->mins[2] = min(out->mins[2], v[2]);
5153                                 out->maxs[2] = max(out->maxs[2], v[2]);
5154                         }
5155                         out->mins[0] -= 1.0f;
5156                         out->mins[1] -= 1.0f;
5157                         out->mins[2] -= 1.0f;
5158                         out->maxs[0] += 1.0f;
5159                         out->maxs[1] += 1.0f;
5160                         out->maxs[2] += 1.0f;
5161                 }
5162                 // set lightmap styles for consistency with q1bsp
5163                 //out->lightmapinfo->styles[0] = 0;
5164                 //out->lightmapinfo->styles[1] = 255;
5165                 //out->lightmapinfo->styles[2] = 255;
5166                 //out->lightmapinfo->styles[3] = 255;
5167         }
5168
5169         i = oldi;
5170         out = oldout;
5171         for (;i < count;i++, out++)
5172         {
5173                 if(out->num_vertices && out->num_triangles)
5174                         continue;
5175                 if(out->num_vertices == 0)
5176                         Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no vertices, ignoring\n", i);
5177                 if(out->num_triangles == 0)
5178                         Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no triangles, ignoring\n", i);
5179         }
5180
5181         // for per pixel lighting
5182         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);
5183
5184         // generate ushort elements array if possible
5185         if (loadmodel->surfmesh.data_element3s)
5186                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5187                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5188
5189         // free the no longer needed vertex data
5190         loadmodel->brushq3.num_vertices = 0;
5191         if (loadmodel->brushq3.data_vertex3f)
5192                 Mem_Free(loadmodel->brushq3.data_vertex3f);
5193         loadmodel->brushq3.data_vertex3f = NULL;
5194         loadmodel->brushq3.data_normal3f = NULL;
5195         loadmodel->brushq3.data_texcoordtexture2f = NULL;
5196         loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5197         loadmodel->brushq3.data_color4f = NULL;
5198         // free the no longer needed triangle data
5199         loadmodel->brushq3.num_triangles = 0;
5200         if (loadmodel->brushq3.data_element3i)
5201                 Mem_Free(loadmodel->brushq3.data_element3i);
5202         loadmodel->brushq3.data_element3i = NULL;
5203
5204         if(patchtess)
5205                 Mem_Free(patchtess);
5206 }
5207
5208 static void Mod_Q3BSP_LoadModels(lump_t *l)
5209 {
5210         q3dmodel_t *in;
5211         q3dmodel_t *out;
5212         int i, j, n, c, count;
5213
5214         in = (q3dmodel_t *)(mod_base + l->fileofs);
5215         if (l->filelen % sizeof(*in))
5216                 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5217         count = l->filelen / sizeof(*in);
5218         out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5219
5220         loadmodel->brushq3.data_models = out;
5221         loadmodel->brushq3.num_models = count;
5222
5223         for (i = 0;i < count;i++, in++, out++)
5224         {
5225                 for (j = 0;j < 3;j++)
5226                 {
5227                         out->mins[j] = LittleFloat(in->mins[j]);
5228                         out->maxs[j] = LittleFloat(in->maxs[j]);
5229                 }
5230                 n = LittleLong(in->firstface);
5231                 c = LittleLong(in->numfaces);
5232                 if (n < 0 || n + c > loadmodel->num_surfaces)
5233                         Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5234                 out->firstface = n;
5235                 out->numfaces = c;
5236                 n = LittleLong(in->firstbrush);
5237                 c = LittleLong(in->numbrushes);
5238                 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5239                         Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5240                 out->firstbrush = n;
5241                 out->numbrushes = c;
5242         }
5243 }
5244
5245 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5246 {
5247         int *in;
5248         int *out;
5249         int i, n, count;
5250
5251         in = (int *)(mod_base + l->fileofs);
5252         if (l->filelen % sizeof(*in))
5253                 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5254         count = l->filelen / sizeof(*in);
5255         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5256
5257         loadmodel->brush.data_leafbrushes = out;
5258         loadmodel->brush.num_leafbrushes = count;
5259
5260         for (i = 0;i < count;i++, in++, out++)
5261         {
5262                 n = LittleLong(*in);
5263                 if (n < 0 || n >= loadmodel->brush.num_brushes)
5264                         Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5265                 *out = n;
5266         }
5267 }
5268
5269 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5270 {
5271         int *in;
5272         int *out;
5273         int i, n, count;
5274
5275         in = (int *)(mod_base + l->fileofs);
5276         if (l->filelen % sizeof(*in))
5277                 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5278         count = l->filelen / sizeof(*in);
5279         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5280
5281         loadmodel->brush.data_leafsurfaces = out;
5282         loadmodel->brush.num_leafsurfaces = count;
5283
5284         for (i = 0;i < count;i++, in++, out++)
5285         {
5286                 n = LittleLong(*in);
5287                 if (n < 0 || n >= loadmodel->num_surfaces)
5288                         Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5289                 *out = n;
5290         }
5291 }
5292
5293 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5294 {
5295         q3dleaf_t *in;
5296         mleaf_t *out;
5297         int i, j, n, c, count;
5298
5299         in = (q3dleaf_t *)(mod_base + l->fileofs);
5300         if (l->filelen % sizeof(*in))
5301                 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5302         count = l->filelen / sizeof(*in);
5303         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5304
5305         loadmodel->brush.data_leafs = out;
5306         loadmodel->brush.num_leafs = count;
5307
5308         for (i = 0;i < count;i++, in++, out++)
5309         {
5310                 out->parent = NULL;
5311                 out->plane = NULL;
5312                 out->clusterindex = LittleLong(in->clusterindex);
5313                 out->areaindex = LittleLong(in->areaindex);
5314                 for (j = 0;j < 3;j++)
5315                 {
5316                         // yes the mins/maxs are ints
5317                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5318                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5319                 }
5320                 n = LittleLong(in->firstleafface);
5321                 c = LittleLong(in->numleaffaces);
5322                 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5323                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5324                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5325                 out->numleafsurfaces = c;
5326                 n = LittleLong(in->firstleafbrush);
5327                 c = LittleLong(in->numleafbrushes);
5328                 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5329                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5330                 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5331                 out->numleafbrushes = c;
5332         }
5333 }
5334
5335 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5336 {
5337         q3dnode_t *in;
5338         mnode_t *out;
5339         int i, j, n, count;
5340
5341         in = (q3dnode_t *)(mod_base + l->fileofs);
5342         if (l->filelen % sizeof(*in))
5343                 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5344         count = l->filelen / sizeof(*in);
5345         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5346
5347         loadmodel->brush.data_nodes = out;
5348         loadmodel->brush.num_nodes = count;
5349
5350         for (i = 0;i < count;i++, in++, out++)
5351         {
5352                 out->parent = NULL;
5353                 n = LittleLong(in->planeindex);
5354                 if (n < 0 || n >= loadmodel->brush.num_planes)
5355                         Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5356                 out->plane = loadmodel->brush.data_planes + n;
5357                 for (j = 0;j < 2;j++)
5358                 {
5359                         n = LittleLong(in->childrenindex[j]);
5360                         if (n >= 0)
5361                         {
5362                                 if (n >= loadmodel->brush.num_nodes)
5363                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5364                                 out->children[j] = loadmodel->brush.data_nodes + n;
5365                         }
5366                         else
5367                         {
5368                                 n = -1 - n;
5369                                 if (n >= loadmodel->brush.num_leafs)
5370                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5371                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5372                         }
5373                 }
5374                 for (j = 0;j < 3;j++)
5375                 {
5376                         // yes the mins/maxs are ints
5377                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5378                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5379                 }
5380         }
5381
5382         // set the parent pointers
5383         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5384 }
5385
5386 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5387 {
5388         q3dlightgrid_t *in;
5389         q3dlightgrid_t *out;
5390         int count;
5391
5392         in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5393         if (l->filelen % sizeof(*in))
5394                 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5395         loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5396         loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5397         loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5398         loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5399         loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5400         loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5401         loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5402         loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5403         loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5404         loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5405         loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5406         loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5407         count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5408         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]);
5409         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]);
5410
5411         // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5412         if (l->filelen)
5413         {
5414                 if (l->filelen < count * (int)sizeof(*in))
5415                         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]);
5416                 if (l->filelen != count * (int)sizeof(*in))
5417                         Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5418                 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5419                 loadmodel->brushq3.data_lightgrid = out;
5420                 loadmodel->brushq3.num_lightgrid = count;
5421                 // no swapping or validation necessary
5422                 memcpy(out, in, count * (int)sizeof(*out));
5423         }
5424 }
5425
5426 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5427 {
5428         q3dpvs_t *in;
5429         int totalchains;
5430
5431         if (l->filelen == 0)
5432         {
5433                 int i;
5434                 // unvised maps often have cluster indices even without pvs, so check
5435                 // leafs to find real number of clusters
5436                 loadmodel->brush.num_pvsclusters = 1;
5437                 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5438                         loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5439
5440                 // create clusters
5441                 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5442                 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5443                 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5444                 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5445                 return;
5446         }
5447
5448         in = (q3dpvs_t *)(mod_base + l->fileofs);
5449         if (l->filelen < 9)
5450                 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5451
5452         loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5453         loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5454         if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5455                 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5456         totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5457         if (l->filelen < totalchains + (int)sizeof(*in))
5458                 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);
5459
5460         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5461         memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5462 }
5463
5464 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5465 {
5466         int i, j, k, index[3];
5467         float transformed[3], blend1, blend2, blend, stylescale;
5468         q3dlightgrid_t *a, *s;
5469
5470         // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5471         stylescale = r_refdef.scene.rtlightstylevalue[0];
5472
5473         if (!model->brushq3.num_lightgrid)
5474         {
5475                 ambientcolor[0] = stylescale;
5476                 ambientcolor[1] = stylescale;
5477                 ambientcolor[2] = stylescale;
5478                 return;
5479         }
5480
5481         Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5482         //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5483         //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5484         transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5485         transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5486         transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5487         index[0] = (int)floor(transformed[0]);
5488         index[1] = (int)floor(transformed[1]);
5489         index[2] = (int)floor(transformed[2]);
5490         //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5491
5492         // now lerp the values
5493         VectorClear(diffusenormal);
5494         a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5495         for (k = 0;k < 2;k++)
5496         {
5497                 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5498                 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5499                         continue;
5500                 for (j = 0;j < 2;j++)
5501                 {
5502                         blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5503                         if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5504                                 continue;
5505                         for (i = 0;i < 2;i++)
5506                         {
5507                                 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5508                                 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5509                                         continue;
5510                                 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5511                                 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5512                                 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5513                                 // this uses the mod_md3_sin table because the values are
5514                                 // already in the 0-255 range, the 64+ bias fetches a cosine
5515                                 // instead of a sine value
5516                                 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5517                                 diffusenormal[1] += blend * (mod_md3_sin[     s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5518                                 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5519                                 //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)));
5520                         }
5521                 }
5522         }
5523
5524         // normalize the light direction before turning
5525         VectorNormalize(diffusenormal);
5526         //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]);
5527 }
5528
5529 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
5530 {
5531         int i;
5532         mleaf_t *leaf;
5533         colbrushf_t *brush;
5534         // find which leaf the point is in
5535         while (node->plane)
5536                 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5537         // point trace the brushes
5538         leaf = (mleaf_t *)node;
5539         for (i = 0;i < leaf->numleafbrushes;i++)
5540         {
5541                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5542                 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5543                 {
5544                         brush->markframe = markframe;
5545                         Collision_TracePointBrushFloat(trace, point, brush);
5546                 }
5547         }
5548         // can't do point traces on curves (they have no thickness)
5549 }
5550
5551 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)
5552 {
5553         int i, startside, endside;
5554         float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5555         mleaf_t *leaf;
5556         msurface_t *surface;
5557         mplane_t *plane;
5558         colbrushf_t *brush;
5559         // walk the tree until we hit a leaf, recursing for any split cases
5560         while (node->plane)
5561         {
5562                 // abort if this part of the bsp tree can not be hit by this trace
5563 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5564 //                      return;
5565                 plane = node->plane;
5566                 // axial planes are much more common than non-axial, so an optimized
5567                 // axial case pays off here
5568                 if (plane->type < 3)
5569                 {
5570                         dist1 = start[plane->type] - plane->dist;
5571                         dist2 = end[plane->type] - plane->dist;
5572                 }
5573                 else
5574                 {
5575                         dist1 = DotProduct(start, plane->normal) - plane->dist;
5576                         dist2 = DotProduct(end, plane->normal) - plane->dist;
5577                 }
5578                 startside = dist1 < 0;
5579                 endside = dist2 < 0;
5580                 if (startside == endside)
5581                 {
5582                         // most of the time the line fragment is on one side of the plane
5583                         node = node->children[startside];
5584                 }
5585                 else
5586                 {
5587                         // line crosses node plane, split the line
5588                         dist1 = PlaneDiff(linestart, plane);
5589                         dist2 = PlaneDiff(lineend, plane);
5590                         midfrac = dist1 / (dist1 - dist2);
5591                         VectorLerp(linestart, midfrac, lineend, mid);
5592                         // take the near side first
5593                         Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5594                         // if we found an impact on the front side, don't waste time
5595                         // exploring the far side
5596                         if (midfrac <= trace->realfraction)
5597                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5598                         return;
5599                 }
5600         }
5601         // abort if this part of the bsp tree can not be hit by this trace
5602 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5603 //              return;
5604         // hit a leaf
5605         nodesegmentmins[0] = min(start[0], end[0]) - 1;
5606         nodesegmentmins[1] = min(start[1], end[1]) - 1;
5607         nodesegmentmins[2] = min(start[2], end[2]) - 1;
5608         nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5609         nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5610         nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5611         // line trace the brushes
5612         leaf = (mleaf_t *)node;
5613         for (i = 0;i < leaf->numleafbrushes;i++)
5614         {
5615                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5616                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5617                 {
5618                         brush->markframe = markframe;
5619                         Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5620                 }
5621         }
5622         // can't do point traces on curves (they have no thickness)
5623         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5624         {
5625                 // line trace the curves
5626                 for (i = 0;i < leaf->numleafsurfaces;i++)
5627                 {
5628                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5629                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5630                         {
5631                                 surface->collisionmarkframe = markframe;
5632                                 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);
5633                         }
5634                 }
5635         }
5636 }
5637
5638 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)
5639 {
5640         int i;
5641         int sides;
5642         mleaf_t *leaf;
5643         colbrushf_t *brush;
5644         msurface_t *surface;
5645         mplane_t *plane;
5646         float nodesegmentmins[3], nodesegmentmaxs[3];
5647         // walk the tree until we hit a leaf, recursing for any split cases
5648         while (node->plane)
5649         {
5650                 // abort if this part of the bsp tree can not be hit by this trace
5651 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5652 //                      return;
5653                 plane = node->plane;
5654                 // axial planes are much more common than non-axial, so an optimized
5655                 // axial case pays off here
5656                 if (plane->type < 3)
5657                 {
5658                         // this is an axial plane, compare bounding box directly to it and
5659                         // recurse sides accordingly
5660                         // recurse down node sides
5661                         // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5662                         //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5663                         //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5664                         sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5665                 }
5666                 else
5667                 {
5668                         // this is a non-axial plane, so check if the start and end boxes
5669                         // are both on one side of the plane to handle 'diagonal' cases
5670                         sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5671                 }
5672                 if (sides == 3)
5673                 {
5674                         // segment crosses plane
5675                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5676                         sides = 2;
5677                 }
5678                 // if sides == 0 then the trace itself is bogus (Not A Number values),
5679                 // in this case we simply pretend the trace hit nothing
5680                 if (sides == 0)
5681                         return; // ERROR: NAN bounding box!
5682                 // take whichever side the segment box is on
5683                 node = node->children[sides - 1];
5684         }
5685         // abort if this part of the bsp tree can not be hit by this trace
5686 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5687 //              return;
5688         nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5689         nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5690         nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5691         nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5692         nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5693         nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5694         // hit a leaf
5695         leaf = (mleaf_t *)node;
5696         for (i = 0;i < leaf->numleafbrushes;i++)
5697         {
5698                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5699                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5700                 {
5701                         brush->markframe = markframe;
5702                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5703                 }
5704         }
5705         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5706         {
5707                 for (i = 0;i < leaf->numleafsurfaces;i++)
5708                 {
5709                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5710                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5711                         {
5712                                 surface->collisionmarkframe = markframe;
5713                                 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);
5714                         }
5715                 }
5716         }
5717 }
5718
5719 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)
5720 {
5721         int i;
5722         vec3_t shiftstart, shiftend;
5723         float segmentmins[3], segmentmaxs[3];
5724         static int markframe = 0;
5725         msurface_t *surface;
5726         q3mbrush_t *brush;
5727         memset(trace, 0, sizeof(*trace));
5728         trace->fraction = 1;
5729         trace->realfraction = 1;
5730         trace->hitsupercontentsmask = hitsupercontentsmask;
5731         if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
5732         {
5733                 VectorAdd(start, boxmins, shiftstart);
5734                 VectorAdd(end, boxmins, shiftend);
5735                 if (VectorCompare(shiftstart, shiftend))
5736                 {
5737                         // point trace
5738                         if (model->brush.submodel)
5739                         {
5740                                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5741                                         if (brush->colbrushf)
5742                                                 Collision_TracePointBrushFloat(trace, shiftstart, brush->colbrushf);
5743                         }
5744                         else
5745                                 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, shiftstart, ++markframe);
5746                 }
5747                 else
5748                 {
5749                         // line trace
5750                         segmentmins[0] = min(shiftstart[0], shiftend[0]) - 1;
5751                         segmentmins[1] = min(shiftstart[1], shiftend[1]) - 1;
5752                         segmentmins[2] = min(shiftstart[2], shiftend[2]) - 1;
5753                         segmentmaxs[0] = max(shiftstart[0], shiftend[0]) + 1;
5754                         segmentmaxs[1] = max(shiftstart[1], shiftend[1]) + 1;
5755                         segmentmaxs[2] = max(shiftstart[2], shiftend[2]) + 1;
5756                         if (model->brush.submodel)
5757                         {
5758                                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5759                                         if (brush->colbrushf)
5760                                                 Collision_TraceLineBrushFloat(trace, shiftstart, shiftend, brush->colbrushf, brush->colbrushf);
5761                                 if (mod_q3bsp_curves_collisions.integer)
5762                                         for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5763                                                 if (surface->num_collisiontriangles)
5764                                                         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);
5765                         }
5766                         else
5767                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, shiftstart, shiftend, 0, 1, shiftstart, shiftend, ++markframe, segmentmins, segmentmaxs);
5768                 }
5769         }
5770         else
5771         {
5772                 // box trace, performed as brush trace
5773                 colbrushf_t *thisbrush_start, *thisbrush_end;
5774                 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5775                 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5776                 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5777                 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5778                 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5779                 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5780                 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5781                 VectorAdd(start, boxmins, boxstartmins);
5782                 VectorAdd(start, boxmaxs, boxstartmaxs);
5783                 VectorAdd(end, boxmins, boxendmins);
5784                 VectorAdd(end, boxmaxs, boxendmaxs);
5785                 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5786                 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5787                 if (model->brush.submodel)
5788                 {
5789                         for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5790                                 if (brush->colbrushf)
5791                                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5792                         if (mod_q3bsp_curves_collisions.integer)
5793                                 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5794                                         if (surface->num_collisiontriangles)
5795                                                 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);
5796                 }
5797                 else
5798                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5799         }
5800 }
5801
5802 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5803 {
5804         int i;
5805         int supercontents = 0;
5806         q3mbrush_t *brush;
5807         // test if the point is inside each brush
5808         if (model->brush.submodel)
5809         {
5810                 // submodels are effectively one leaf
5811                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5812                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5813                                 supercontents |= brush->colbrushf->supercontents;
5814         }
5815         else
5816         {
5817                 mnode_t *node = model->brush.data_nodes;
5818                 mleaf_t *leaf;
5819                 // find which leaf the point is in
5820                 while (node->plane)
5821                         node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5822                 leaf = (mleaf_t *)node;
5823                 // now check the brushes in the leaf
5824                 for (i = 0;i < leaf->numleafbrushes;i++)
5825                 {
5826                         brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5827                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5828                                 supercontents |= brush->colbrushf->supercontents;
5829                 }
5830         }
5831         return supercontents;
5832 }
5833
5834 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
5835 {
5836         int supercontents = 0;
5837         if (nativecontents & CONTENTSQ3_SOLID)
5838                 supercontents |= SUPERCONTENTS_SOLID;
5839         if (nativecontents & CONTENTSQ3_WATER)
5840                 supercontents |= SUPERCONTENTS_WATER;
5841         if (nativecontents & CONTENTSQ3_SLIME)
5842                 supercontents |= SUPERCONTENTS_SLIME;
5843         if (nativecontents & CONTENTSQ3_LAVA)
5844                 supercontents |= SUPERCONTENTS_LAVA;
5845         if (nativecontents & CONTENTSQ3_BODY)
5846                 supercontents |= SUPERCONTENTS_BODY;
5847         if (nativecontents & CONTENTSQ3_CORPSE)
5848                 supercontents |= SUPERCONTENTS_CORPSE;
5849         if (nativecontents & CONTENTSQ3_NODROP)
5850                 supercontents |= SUPERCONTENTS_NODROP;
5851         if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5852                 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5853         if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5854                 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5855         if (nativecontents & CONTENTSQ3_DONOTENTER)
5856                 supercontents |= SUPERCONTENTS_DONOTENTER;
5857         if (nativecontents & CONTENTSQ3_BOTCLIP)
5858                 supercontents |= SUPERCONTENTS_BOTCLIP;
5859         if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
5860                 supercontents |= SUPERCONTENTS_OPAQUE;
5861         return supercontents;
5862 }
5863
5864 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
5865 {
5866         int nativecontents = 0;
5867         if (supercontents & SUPERCONTENTS_SOLID)
5868                 nativecontents |= CONTENTSQ3_SOLID;
5869         if (supercontents & SUPERCONTENTS_WATER)
5870                 nativecontents |= CONTENTSQ3_WATER;
5871         if (supercontents & SUPERCONTENTS_SLIME)
5872                 nativecontents |= CONTENTSQ3_SLIME;
5873         if (supercontents & SUPERCONTENTS_LAVA)
5874                 nativecontents |= CONTENTSQ3_LAVA;
5875         if (supercontents & SUPERCONTENTS_BODY)
5876                 nativecontents |= CONTENTSQ3_BODY;
5877         if (supercontents & SUPERCONTENTS_CORPSE)
5878                 nativecontents |= CONTENTSQ3_CORPSE;
5879         if (supercontents & SUPERCONTENTS_NODROP)
5880                 nativecontents |= CONTENTSQ3_NODROP;
5881         if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5882                 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5883         if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5884                 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5885         if (supercontents & SUPERCONTENTS_DONOTENTER)
5886                 nativecontents |= CONTENTSQ3_DONOTENTER;
5887         if (supercontents & SUPERCONTENTS_BOTCLIP)
5888                 nativecontents |= CONTENTSQ3_BOTCLIP;
5889         if (!(supercontents & SUPERCONTENTS_OPAQUE))
5890                 nativecontents |= CONTENTSQ3_TRANSLUCENT;
5891         return nativecontents;
5892 }
5893
5894 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5895 {
5896         int numleafs;
5897         while (node->plane)
5898         {
5899                 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5900                 node = node->children[1];
5901         }
5902         numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5903         if (loadmodel->brush.num_leafs < numleafs)
5904                 loadmodel->brush.num_leafs = numleafs;
5905 }
5906
5907 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
5908 {
5909         int i, j, numshadowmeshtriangles, lumps;
5910         q3dheader_t *header;
5911         float corner[3], yawradius, modelradius;
5912         msurface_t *surface;
5913
5914         mod->modeldatatypestring = "Q3BSP";
5915
5916         mod->type = mod_brushq3;
5917         mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5918         mod->numskins = 1;
5919
5920         header = (q3dheader_t *)buffer;
5921         if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
5922                 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
5923
5924         i = LittleLong(header->version);
5925         if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
5926                 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5927
5928         mod->soundfromcenter = true;
5929         mod->TraceBox = Mod_Q3BSP_TraceBox;
5930         mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
5931         mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
5932         mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5933         mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5934         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5935         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5936         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5937         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5938         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5939         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
5940         mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5941         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5942         mod->brush.AmbientSoundLevelsForPoint = NULL;
5943         mod->brush.RoundUpToHullSize = NULL;
5944         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5945         mod->Draw = R_Q1BSP_Draw;
5946         mod->DrawDepth = R_Q1BSP_DrawDepth;
5947         mod->DrawDebug = R_Q1BSP_DrawDebug;
5948         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5949         mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
5950         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5951         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5952         mod->DrawLight = R_Q1BSP_DrawLight;
5953
5954         mod_base = (unsigned char *)header;
5955
5956         // swap all the lumps
5957         header->ident = LittleLong(header->ident);
5958         header->version = LittleLong(header->version);
5959         lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
5960         for (i = 0;i < lumps;i++)
5961         {
5962                 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
5963                 if((char *) bufferend < (char *) buffer + j)
5964                         Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
5965                 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
5966                 if((char *) bufferend < (char *) buffer + j)
5967                         Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
5968         }
5969         /*
5970          * NO, do NOT clear them!
5971          * they contain actual data referenced by other stuff.
5972          * Instead, before using the advertisements lump, check header->versio
5973          * again!
5974          * Sorry, but otherwise it breaks memory of the first lump.
5975         for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
5976         {
5977                 header->lumps[i].fileofs = 0;
5978                 header->lumps[i].filelen = 0;
5979         }
5980         */
5981
5982         mod->brush.qw_md4sum = 0;
5983         mod->brush.qw_md4sum2 = 0;
5984         for (i = 0;i < lumps;i++)
5985         {
5986                 if (i == Q3LUMP_ENTITIES)
5987                         continue;
5988                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5989                 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
5990                         continue;
5991                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5992
5993                 // all this checksumming can take a while, so let's send keepalives here too
5994                 CL_KeepaliveMessage(false);
5995         }
5996
5997         Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5998         Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5999         Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
6000         if (header->version == Q3BSPVERSION_IG)
6001                 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
6002         else
6003                 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
6004         Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
6005         Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
6006         Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
6007         Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
6008         Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
6009         Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
6010         Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
6011         Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
6012         Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
6013         Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
6014         Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
6015         Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
6016         Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
6017         loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
6018
6019         // the MakePortals code works fine on the q3bsp data as well
6020         Mod_Q1BSP_MakePortals();
6021
6022         // FIXME: shader alpha should replace r_wateralpha support in q3bsp
6023         loadmodel->brush.supportwateralpha = true;
6024
6025         // make a single combined shadow mesh to allow optimized shadow volume creation
6026         numshadowmeshtriangles = 0;
6027         if (cls.state != ca_dedicated)
6028         {
6029                 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6030                 {
6031                         surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
6032                         numshadowmeshtriangles += surface->num_triangles;
6033                 }
6034                 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
6035                 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6036                         if (surface->num_triangles > 0)
6037                                 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));
6038                 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
6039                 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
6040         }
6041
6042         loadmodel->brush.num_leafs = 0;
6043         Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
6044
6045         mod = loadmodel;
6046         for (i = 0;i < loadmodel->brush.numsubmodels;i++)
6047         {
6048                 if (i > 0)
6049                 {
6050                         char name[10];
6051                         // duplicate the basic information
6052                         dpsnprintf(name, sizeof(name), "*%i", i);
6053                         mod = Mod_FindName(name, loadmodel->name);
6054                         // copy the base model to this one
6055                         *mod = *loadmodel;
6056                         // rename the clone back to its proper name
6057                         strlcpy(mod->name, name, sizeof(mod->name));
6058                         mod->brush.parentmodel = loadmodel;
6059                         // textures and memory belong to the main model
6060                         mod->texturepool = NULL;
6061                         mod->mempool = NULL;
6062                         mod->brush.TraceLineOfSight = NULL;
6063                         mod->brush.GetPVS = NULL;
6064                         mod->brush.FatPVS = NULL;
6065                         mod->brush.BoxTouchingPVS = NULL;
6066                         mod->brush.BoxTouchingLeafPVS = NULL;
6067                         mod->brush.BoxTouchingVisibleLeafs = NULL;
6068                         mod->brush.FindBoxClusters = NULL;
6069                         mod->brush.LightPoint = NULL;
6070                         mod->brush.AmbientSoundLevelsForPoint = NULL;
6071                 }
6072                 mod->brush.submodel = i;
6073
6074                 // make the model surface list (used by shadowing/lighting)
6075                 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
6076                 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
6077                 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
6078                 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
6079                 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
6080                 Mod_MakeSortedSurfaces(mod);
6081
6082                 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
6083                 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
6084                 // enlarge the bounding box to enclose all geometry of this model,
6085                 // because q3map2 sometimes lies (mostly to affect the lightgrid),
6086                 // which can in turn mess up the farclip (as well as culling when
6087                 // outside the level - an unimportant concern)
6088
6089                 //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]);
6090                 for (j = 0;j < mod->nummodelsurfaces;j++)
6091                 {
6092                         const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
6093                         const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
6094                         int k;
6095                         if (!surface->num_vertices)
6096                                 continue;
6097                         for (k = 0;k < surface->num_vertices;k++, v += 3)
6098                         {
6099                                 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
6100                                 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
6101                                 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
6102                                 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
6103                                 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
6104                                 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
6105                         }
6106                 }
6107                 //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]);
6108                 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
6109                 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
6110                 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
6111                 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
6112                 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
6113                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
6114                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
6115                 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
6116                 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
6117                 mod->yawmins[2] = mod->normalmins[2];
6118                 mod->yawmaxs[2] = mod->normalmaxs[2];
6119                 mod->radius = modelradius;
6120                 mod->radius2 = modelradius * modelradius;
6121
6122                 // this gets altered below if sky or water is used
6123                 mod->DrawSky = NULL;
6124                 mod->DrawAddWaterPlanes = NULL;
6125
6126                 for (j = 0;j < mod->nummodelsurfaces;j++)
6127                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
6128                                 break;
6129                 if (j < mod->nummodelsurfaces)
6130                         mod->DrawSky = R_Q1BSP_DrawSky;
6131
6132                 for (j = 0;j < mod->nummodelsurfaces;j++)
6133                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
6134                                 break;
6135                 if (j < mod->nummodelsurfaces)
6136                         mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
6137         }
6138 }
6139
6140 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6141 {
6142         int i = LittleLong(((int *)buffer)[1]);
6143         if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
6144                 Mod_Q3BSP_Load(mod,buffer, bufferend);
6145         else if (i == Q2BSPVERSION)
6146                 Mod_Q2BSP_Load(mod,buffer, bufferend);
6147         else
6148                 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
6149 }
6150
6151 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6152 {
6153         Host_Error("Mod_MAP_Load: not yet implemented");
6154 }
6155
6156 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
6157 {
6158         // we already have done PVS culling at this point...
6159         // so we don't need to do it again.
6160
6161         int i;
6162         vec3_t testorigin, mins, maxs;
6163
6164         testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
6165         testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
6166         testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
6167
6168         if(model->brush.TraceLineOfSight(model, eye, testorigin))
6169                 return 1;
6170
6171         // expand the box a little
6172         mins[0] = (t+1) * minsX[0] - t * maxsX[0];
6173         maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
6174         mins[1] = (t+1) * minsX[1] - t * maxsX[1];
6175         maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
6176         mins[2] = (t+1) * minsX[2] - t * maxsX[2];
6177         maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
6178
6179         for(i = 0; i != numsamples; ++i)
6180         {
6181                 testorigin[0] = lhrandom(mins[0], maxs[0]);
6182                 testorigin[1] = lhrandom(mins[1], maxs[1]);
6183                 testorigin[2] = lhrandom(mins[2], maxs[2]);
6184
6185                 if(model->brush.TraceLineOfSight(model, eye, testorigin))
6186                         return 1;
6187         }
6188
6189         return 0;
6190 }
6191