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