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 mod_bsp_portalize = {0, "mod_bsp_portalize", "1", "enables portal generation from BSP tree (may take several seconds per map), used by r_drawportals, r_useportalculling, r_shadow_realtime_world_compileportalculling, sv_cullentities_portal"};
  31 cvar_t r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
  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 r_trippy = {0, "r_trippy", "0", "easter egg"};
  42 cvar_t mod_noshader_default_offsetmapping = {CVAR_SAVE, "mod_noshader_default_offsetmapping", "1", "use offsetmapping by default on all surfaces that are not using q3 shader files"};
  43 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
  44 cvar_t mod_q3bsp_curves_collisions_stride = {0, "mod_q3bsp_curves_collisions_stride", "16", "collisions against curves: optimize performance by doing a combined collision check for this triangle amount first (-1 avoids any box tests)"};
  45 cvar_t mod_q3bsp_curves_stride = {0, "mod_q3bsp_curves_stride", "16", "particle effect collisions against curves: optimize performance by doing a combined collision check for this triangle amount first (-1 avoids any box tests)"};
  46 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
  47 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
  48 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, ..."};
  49 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)"};
  50 cvar_t mod_q3bsp_tracelineofsight_brushes = {0, "mod_q3bsp_tracelineofsight_brushes", "0", "enables culling of entities behind detail brushes, curves, etc"};
  51 cvar_t mod_q3shader_default_offsetmapping = {CVAR_SAVE, "mod_q3shader_default_offsetmapping", "1", "use offsetmapping by default on all surfaces that are using q3 shader files"};
  52 cvar_t mod_q3shader_default_polygonfactor = {0, "mod_q3shader_default_polygonfactor", "0", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
  53 cvar_t mod_q3shader_default_polygonoffset = {0, "mod_q3shader_default_polygonoffset", "-2", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
  54
  55 cvar_t mod_q1bsp_polygoncollisions = {0, "mod_q1bsp_polygoncollisions", "0", "disables use of precomputed cliphulls and instead collides with polygons (uses Bounding Interval Hierarchy optimizations)"};
  56 cvar_t mod_collision_bih = {0, "mod_collision_bih", "1", "enables use of generated Bounding Interval Hierarchy tree instead of compiled bsp tree in collision code"};
  57 cvar_t mod_recalculatenodeboxes = {0, "mod_recalculatenodeboxes", "1", "enables use of generated node bounding boxes based on BSP tree portal reconstruction, rather than the node boxes supplied by the map compiler"};
  58
  59 static texture_t mod_q1bsp_texture_solid;
  60 static texture_t mod_q1bsp_texture_sky;
  61 static texture_t mod_q1bsp_texture_lava;
  62 static texture_t mod_q1bsp_texture_slime;
  63 static texture_t mod_q1bsp_texture_water;
  64
  65 void Mod_BrushInit(void)
  66 {
  67 //      Cvar_RegisterVariable(&r_subdivide_size);
  68         Cvar_RegisterVariable(&mod_bsp_portalize);
  69         Cvar_RegisterVariable(&r_novis);
  70         Cvar_RegisterVariable(&r_nosurftextures);
  71         Cvar_RegisterVariable(&r_subdivisions_tolerance);
  72         Cvar_RegisterVariable(&r_subdivisions_mintess);
  73         Cvar_RegisterVariable(&r_subdivisions_maxtess);
  74         Cvar_RegisterVariable(&r_subdivisions_maxvertices);
  75         Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
  76         Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
  77         Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
  78         Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
  79         Cvar_RegisterVariable(&r_trippy);
  80         Cvar_RegisterVariable(&mod_noshader_default_offsetmapping);
  81         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
  82         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
  83         Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
  84         Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
  85         Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
  86         Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
  87         Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
  88         Cvar_RegisterVariable(&mod_q3bsp_tracelineofsight_brushes);
  89         Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping);
  90         Cvar_RegisterVariable(&mod_q3shader_default_polygonfactor);
  91         Cvar_RegisterVariable(&mod_q3shader_default_polygonoffset);
  92         Cvar_RegisterVariable(&mod_q1bsp_polygoncollisions);
  93         Cvar_RegisterVariable(&mod_collision_bih);
  94         Cvar_RegisterVariable(&mod_recalculatenodeboxes);
  95
  96         memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
  97         strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
  98         mod_q1bsp_texture_solid.surfaceflags = 0;
  99         mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
 100
 101         mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
 102         strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
 103         mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
 104         mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
 105
 106         mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
 107         strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
 108         mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
 109         mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
 110
 111         mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
 112         strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
 113         mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
 114         mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
 115
 116         mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
 117         strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
 118         mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
 119         mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
 120 }
 121
 122 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
 123 {
 124         mnode_t *node;
 125
 126         if (model == NULL)
 127                 return NULL;
 128
 129         // LordHavoc: modified to start at first clip node,
 130         // in other words: first node of the (sub)model
 131         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 132         while (node->plane)
 133                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
 134
 135         return (mleaf_t *)node;
 136 }
 137
 138 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
 139 {
 140         int i;
 141         mleaf_t *leaf;
 142         leaf = Mod_Q1BSP_PointInLeaf(model, p);
 143         if (leaf)
 144         {
 145                 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
 146                 if (i)
 147                 {
 148                         memcpy(out, leaf->ambient_sound_level, i);
 149                         out += i;
 150                         outsize -= i;
 151                 }
 152         }
 153         if (outsize)
 154                 memset(out, 0, outsize);
 155 }
 156
 157 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
 158 {
 159         int numclusters = 0;
 160         int nodestackindex = 0;
 161         mnode_t *node, *nodestack[1024];
 162         if (!model->brush.num_pvsclusters)
 163                 return -1;
 164         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 165         for (;;)
 166         {
 167 #if 1
 168                 if (node->plane)
 169                 {
 170                         // node - recurse down the BSP tree
 171                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 172                         if (sides < 3)
 173                         {
 174                                 if (sides == 0)
 175                                         return -1; // ERROR: NAN bounding box!
 176                                 // box is on one side of plane, take that path
 177                                 node = node->children[sides-1];
 178                         }
 179                         else
 180                         {
 181                                 // box crosses plane, take one path and remember the other
 182                                 if (nodestackindex < 1024)
 183                                         nodestack[nodestackindex++] = node->children[0];
 184                                 node = node->children[1];
 185                         }
 186                         continue;
 187                 }
 188                 else
 189                 {
 190                         // leaf - add clusterindex to list
 191                         if (numclusters < maxclusters)
 192                                 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
 193                         numclusters++;
 194                 }
 195 #else
 196                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 197                 {
 198                         if (node->plane)
 199                         {
 200                                 if (nodestackindex < 1024)
 201                                         nodestack[nodestackindex++] = node->children[0];
 202                                 node = node->children[1];
 203                                 continue;
 204                         }
 205                         else
 206                         {
 207                                 // leaf - add clusterindex to list
 208                                 if (numclusters < maxclusters)
 209                                         clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
 210                                 numclusters++;
 211                         }
 212                 }
 213 #endif
 214                 // try another path we didn't take earlier
 215                 if (nodestackindex == 0)
 216                         break;
 217                 node = nodestack[--nodestackindex];
 218         }
 219         // return number of clusters found (even if more than the maxclusters)
 220         return numclusters;
 221 }
 222
 223 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
 224 {
 225         int nodestackindex = 0;
 226         mnode_t *node, *nodestack[1024];
 227         if (!model->brush.num_pvsclusters)
 228                 return true;
 229         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 230         for (;;)
 231         {
 232 #if 1
 233                 if (node->plane)
 234                 {
 235                         // node - recurse down the BSP tree
 236                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 237                         if (sides < 3)
 238                         {
 239                                 if (sides == 0)
 240                                         return -1; // ERROR: NAN bounding box!
 241                                 // box is on one side of plane, take that path
 242                                 node = node->children[sides-1];
 243                         }
 244                         else
 245                         {
 246                                 // box crosses plane, take one path and remember the other
 247                                 if (nodestackindex < 1024)
 248                                         nodestack[nodestackindex++] = node->children[0];
 249                                 node = node->children[1];
 250                         }
 251                         continue;
 252                 }
 253                 else
 254                 {
 255                         // leaf - check cluster bit
 256                         int clusterindex = ((mleaf_t *)node)->clusterindex;
 257                         if (CHECKPVSBIT(pvs, clusterindex))
 258                         {
 259                                 // it is visible, return immediately with the news
 260                                 return true;
 261                         }
 262                 }
 263 #else
 264                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 265                 {
 266                         if (node->plane)
 267                         {
 268                                 if (nodestackindex < 1024)
 269                                         nodestack[nodestackindex++] = node->children[0];
 270                                 node = node->children[1];
 271                                 continue;
 272                         }
 273                         else
 274                         {
 275                                 // leaf - check cluster bit
 276                                 int clusterindex = ((mleaf_t *)node)->clusterindex;
 277                                 if (CHECKPVSBIT(pvs, clusterindex))
 278                                 {
 279                                         // it is visible, return immediately with the news
 280                                         return true;
 281                                 }
 282                         }
 283                 }
 284 #endif
 285                 // nothing to see here, try another path we didn't take earlier
 286                 if (nodestackindex == 0)
 287                         break;
 288                 node = nodestack[--nodestackindex];
 289         }
 290         // it is not visible
 291         return false;
 292 }
 293
 294 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
 295 {
 296         int nodestackindex = 0;
 297         mnode_t *node, *nodestack[1024];
 298         if (!model->brush.num_leafs)
 299                 return true;
 300         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 301         for (;;)
 302         {
 303 #if 1
 304                 if (node->plane)
 305                 {
 306                         // node - recurse down the BSP tree
 307                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 308                         if (sides < 3)
 309                         {
 310                                 if (sides == 0)
 311                                         return -1; // ERROR: NAN bounding box!
 312                                 // box is on one side of plane, take that path
 313                                 node = node->children[sides-1];
 314                         }
 315                         else
 316                         {
 317                                 // box crosses plane, take one path and remember the other
 318                                 if (nodestackindex < 1024)
 319                                         nodestack[nodestackindex++] = node->children[0];
 320                                 node = node->children[1];
 321                         }
 322                         continue;
 323                 }
 324                 else
 325                 {
 326                         // leaf - check cluster bit
 327                         int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
 328                         if (CHECKPVSBIT(pvs, clusterindex))
 329                         {
 330                                 // it is visible, return immediately with the news
 331                                 return true;
 332                         }
 333                 }
 334 #else
 335                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 336                 {
 337                         if (node->plane)
 338                         {
 339                                 if (nodestackindex < 1024)
 340                                         nodestack[nodestackindex++] = node->children[0];
 341                                 node = node->children[1];
 342                                 continue;
 343                         }
 344                         else
 345                         {
 346                                 // leaf - check cluster bit
 347                                 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
 348                                 if (CHECKPVSBIT(pvs, clusterindex))
 349                                 {
 350                                         // it is visible, return immediately with the news
 351                                         return true;
 352                                 }
 353                         }
 354                 }
 355 #endif
 356                 // nothing to see here, try another path we didn't take earlier
 357                 if (nodestackindex == 0)
 358                         break;
 359                 node = nodestack[--nodestackindex];
 360         }
 361         // it is not visible
 362         return false;
 363 }
 364
 365 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
 366 {
 367         int nodestackindex = 0;
 368         mnode_t *node, *nodestack[1024];
 369         if (!model->brush.num_leafs)
 370                 return true;
 371         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 372         for (;;)
 373         {
 374 #if 1
 375                 if (node->plane)
 376                 {
 377                         // node - recurse down the BSP tree
 378                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 379                         if (sides < 3)
 380                         {
 381                                 if (sides == 0)
 382                                         return -1; // ERROR: NAN bounding box!
 383                                 // box is on one side of plane, take that path
 384                                 node = node->children[sides-1];
 385                         }
 386                         else
 387                         {
 388                                 // box crosses plane, take one path and remember the other
 389                                 if (nodestackindex < 1024)
 390                                         nodestack[nodestackindex++] = node->children[0];
 391                                 node = node->children[1];
 392                         }
 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 #else
 405                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 406                 {
 407                         if (node->plane)
 408                         {
 409                                 if (nodestackindex < 1024)
 410                                         nodestack[nodestackindex++] = node->children[0];
 411                                 node = node->children[1];
 412                                 continue;
 413                         }
 414                         else
 415                         {
 416                                 // leaf - check if it is visible
 417                                 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
 418                                 {
 419                                         // it is visible, return immediately with the news
 420                                         return true;
 421                                 }
 422                         }
 423                 }
 424 #endif
 425                 // nothing to see here, try another path we didn't take earlier
 426                 if (nodestackindex == 0)
 427                         break;
 428                 node = nodestack[--nodestackindex];
 429         }
 430         // it is not visible
 431         return false;
 432 }
 433
 434 typedef struct findnonsolidlocationinfo_s
 435 {
 436         vec3_t center;
 437         vec3_t absmin, absmax;
 438         vec_t radius;
 439         vec3_t nudge;
 440         vec_t bestdist;
 441         dp_model_t *model;
 442 }
 443 findnonsolidlocationinfo_t;
 444
 445 static void Mod_Q1BSP_FindNonSolidLocation_r_Triangle(findnonsolidlocationinfo_t *info, msurface_t *surface, int k)
 446 {
 447         int i, *tri;
 448         float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
 449
 450         tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
 451         VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
 452         VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
 453         VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
 454         VectorSubtract(vert[1], vert[0], edge[0]);
 455         VectorSubtract(vert[2], vert[1], edge[1]);
 456         CrossProduct(edge[1], edge[0], facenormal);
 457         if (facenormal[0] || facenormal[1] || facenormal[2])
 458         {
 459                 VectorNormalize(facenormal);
 460                 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 461                 if (f <= info->bestdist && f >= -info->bestdist)
 462                 {
 463                         VectorSubtract(vert[0], vert[2], edge[2]);
 464                         VectorNormalize(edge[0]);
 465                         VectorNormalize(edge[1]);
 466                         VectorNormalize(edge[2]);
 467                         CrossProduct(facenormal, edge[0], edgenormal[0]);
 468                         CrossProduct(facenormal, edge[1], edgenormal[1]);
 469                         CrossProduct(facenormal, edge[2], edgenormal[2]);
 470                         // face distance
 471                         if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
 472                                         && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
 473                                         && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
 474                         {
 475                                 // we got lucky, the center is within the face
 476                                 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 477                                 if (dist < 0)
 478                                 {
 479                                         dist = -dist;
 480                                         if (info->bestdist > dist)
 481                                         {
 482                                                 info->bestdist = dist;
 483                                                 VectorScale(facenormal, (info->radius - -dist), info->nudge);
 484                                         }
 485                                 }
 486                                 else
 487                                 {
 488                                         if (info->bestdist > dist)
 489                                         {
 490                                                 info->bestdist = dist;
 491                                                 VectorScale(facenormal, (info->radius - dist), info->nudge);
 492                                         }
 493                                 }
 494                         }
 495                         else
 496                         {
 497                                 // check which edge or vertex the center is nearest
 498                                 for (i = 0;i < 3;i++)
 499                                 {
 500                                         f = DotProduct(info->center, edge[i]);
 501                                         if (f >= DotProduct(vert[0], edge[i])
 502                                                         && f <= DotProduct(vert[1], edge[i]))
 503                                         {
 504                                                 // on edge
 505                                                 VectorMA(info->center, -f, edge[i], point);
 506                                                 dist = sqrt(DotProduct(point, point));
 507                                                 if (info->bestdist > dist)
 508                                                 {
 509                                                         info->bestdist = dist;
 510                                                         VectorScale(point, (info->radius / dist), info->nudge);
 511                                                 }
 512                                                 // skip both vertex checks
 513                                                 // (both are further away than this edge)
 514                                                 i++;
 515                                         }
 516                                         else
 517                                         {
 518                                                 // not on edge, check first vertex of edge
 519                                                 VectorSubtract(info->center, vert[i], point);
 520                                                 dist = sqrt(DotProduct(point, point));
 521                                                 if (info->bestdist > dist)
 522                                                 {
 523                                                         info->bestdist = dist;
 524                                                         VectorScale(point, (info->radius / dist), info->nudge);
 525                                                 }
 526                                         }
 527                                 }
 528                         }
 529                 }
 530         }
 531 }
 532
 533 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
 534 {
 535         int surfacenum, k, *mark;
 536         msurface_t *surface;
 537         for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
 538         {
 539                 surface = info->model->data_surfaces + *mark;
 540                 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
 541                 {
 542                         if(surface->deprecatedq3num_bboxstride > 0)
 543                         {
 544                                 int i, cnt, tri;
 545                                 cnt = (surface->num_triangles + surface->deprecatedq3num_bboxstride - 1) / surface->deprecatedq3num_bboxstride;
 546                                 for(i = 0; i < cnt; ++i)
 547                                 {
 548                                         if(BoxesOverlap(surface->deprecatedq3data_bbox6f + i * 6, surface->deprecatedq3data_bbox6f + i * 6 + 3, info->absmin, info->absmax))
 549                                         {
 550                                                 for(k = 0; k < surface->deprecatedq3num_bboxstride; ++k)
 551                                                 {
 552                                                         tri = i * surface->deprecatedq3num_bboxstride + k;
 553                                                         if(tri >= surface->num_triangles)
 554                                                                 break;
 555                                                         Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, tri);
 556                                                 }
 557                                         }
 558                                 }
 559                         }
 560                         else
 561                         {
 562                                 for (k = 0;k < surface->num_triangles;k++)
 563                                 {
 564                                         Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, k);
 565                                 }
 566                         }
 567                 }
 568         }
 569 }
 570
 571 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
 572 {
 573         if (node->plane)
 574         {
 575                 float f = PlaneDiff(info->center, node->plane);
 576                 if (f >= -info->bestdist)
 577                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
 578                 if (f <= info->bestdist)
 579                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
 580         }
 581         else
 582         {
 583                 if (((mleaf_t *)node)->numleafsurfaces)
 584                         Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
 585         }
 586 }
 587
 588 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
 589 {
 590         int i;
 591         findnonsolidlocationinfo_t info;
 592         if (model == NULL)
 593         {
 594                 VectorCopy(in, out);
 595                 return;
 596         }
 597         VectorCopy(in, info.center);
 598         info.radius = radius;
 599         info.model = model;
 600         i = 0;
 601         do
 602         {
 603                 VectorClear(info.nudge);
 604                 info.bestdist = radius;
 605                 VectorCopy(info.center, info.absmin);
 606                 VectorCopy(info.center, info.absmax);
 607                 info.absmin[0] -= info.radius + 1;
 608                 info.absmin[1] -= info.radius + 1;
 609                 info.absmin[2] -= info.radius + 1;
 610                 info.absmax[0] += info.radius + 1;
 611                 info.absmax[1] += info.radius + 1;
 612                 info.absmax[2] += info.radius + 1;
 613                 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
 614                 VectorAdd(info.center, info.nudge, info.center);
 615         }
 616         while (info.bestdist < radius && ++i < 10);
 617         VectorCopy(info.center, out);
 618 }
 619
 620 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
 621 {
 622         switch(nativecontents)
 623         {
 624                 case CONTENTS_EMPTY:
 625                         return 0;
 626                 case CONTENTS_SOLID:
 627                         return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
 628                 case CONTENTS_WATER:
 629                         return SUPERCONTENTS_WATER;
 630                 case CONTENTS_SLIME:
 631                         return SUPERCONTENTS_SLIME;
 632                 case CONTENTS_LAVA:
 633                         return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
 634                 case CONTENTS_SKY:
 635                         return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
 636         }
 637         return 0;
 638 }
 639
 640 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
 641 {
 642         if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
 643                 return CONTENTS_SOLID;
 644         if (supercontents & SUPERCONTENTS_SKY)
 645                 return CONTENTS_SKY;
 646         if (supercontents & SUPERCONTENTS_LAVA)
 647                 return CONTENTS_LAVA;
 648         if (supercontents & SUPERCONTENTS_SLIME)
 649                 return CONTENTS_SLIME;
 650         if (supercontents & SUPERCONTENTS_WATER)
 651                 return CONTENTS_WATER;
 652         return CONTENTS_EMPTY;
 653 }
 654
 655 typedef struct RecursiveHullCheckTraceInfo_s
 656 {
 657         // the hull we're tracing through
 658         const hull_t *hull;
 659
 660         // the trace structure to fill in
 661         trace_t *trace;
 662
 663         // start, end, and end - start (in model space)
 664         double start[3];
 665         double end[3];
 666         double dist[3];
 667 }
 668 RecursiveHullCheckTraceInfo_t;
 669
 670 // 1/32 epsilon to keep floating point happy
 671 #define DIST_EPSILON (0.03125)
 672
 673 #define HULLCHECKSTATE_EMPTY 0
 674 #define HULLCHECKSTATE_SOLID 1
 675 #define HULLCHECKSTATE_DONE 2
 676
 677 extern cvar_t collision_prefernudgedfraction;
 678 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
 679 {
 680         // status variables, these don't need to be saved on the stack when
 681         // recursing...  but are because this should be thread-safe
 682         // (note: tracing against a bbox is not thread-safe, yet)
 683         int ret;
 684         mplane_t *plane;
 685         double t1, t2;
 686
 687         // variables that need to be stored on the stack when recursing
 688         mclipnode_t *node;
 689         int side;
 690         double midf, mid[3];
 691
 692         // LordHavoc: a goto!  everyone flee in terror... :)
 693 loc0:
 694         // check for empty
 695         if (num < 0)
 696         {
 697                 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
 698                 if (!t->trace->startfound)
 699                 {
 700                         t->trace->startfound = true;
 701                         t->trace->startsupercontents |= num;
 702                 }
 703                 if (num & SUPERCONTENTS_LIQUIDSMASK)
 704                         t->trace->inwater = true;
 705                 if (num == 0)
 706                         t->trace->inopen = true;
 707                 if (num & SUPERCONTENTS_SOLID)
 708                         t->trace->hittexture = &mod_q1bsp_texture_solid;
 709                 else if (num & SUPERCONTENTS_SKY)
 710                         t->trace->hittexture = &mod_q1bsp_texture_sky;
 711                 else if (num & SUPERCONTENTS_LAVA)
 712                         t->trace->hittexture = &mod_q1bsp_texture_lava;
 713                 else if (num & SUPERCONTENTS_SLIME)
 714                         t->trace->hittexture = &mod_q1bsp_texture_slime;
 715                 else
 716                         t->trace->hittexture = &mod_q1bsp_texture_water;
 717                 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
 718                 t->trace->hitsupercontents = num;
 719                 if (num & t->trace->hitsupercontentsmask)
 720                 {
 721                         // if the first leaf is solid, set startsolid
 722                         if (t->trace->allsolid)
 723                                 t->trace->startsolid = true;
 724 #if COLLISIONPARANOID >= 3
 725                         Con_Print("S");
 726 #endif
 727                         return HULLCHECKSTATE_SOLID;
 728                 }
 729                 else
 730                 {
 731                         t->trace->allsolid = false;
 732 #if COLLISIONPARANOID >= 3
 733                         Con_Print("E");
 734 #endif
 735                         return HULLCHECKSTATE_EMPTY;
 736                 }
 737         }
 738
 739         // find the point distances
 740         node = t->hull->clipnodes + num;
 741
 742         plane = t->hull->planes + node->planenum;
 743         if (plane->type < 3)
 744         {
 745                 t1 = p1[plane->type] - plane->dist;
 746                 t2 = p2[plane->type] - plane->dist;
 747         }
 748         else
 749         {
 750                 t1 = DotProduct (plane->normal, p1) - plane->dist;
 751                 t2 = DotProduct (plane->normal, p2) - plane->dist;
 752         }
 753
 754         if (t1 < 0)
 755         {
 756                 if (t2 < 0)
 757                 {
 758 #if COLLISIONPARANOID >= 3
 759                         Con_Print("<");
 760 #endif
 761                         num = node->children[1];
 762                         goto loc0;
 763                 }
 764                 side = 1;
 765         }
 766         else
 767         {
 768                 if (t2 >= 0)
 769                 {
 770 #if COLLISIONPARANOID >= 3
 771                         Con_Print(">");
 772 #endif
 773                         num = node->children[0];
 774                         goto loc0;
 775                 }
 776                 side = 0;
 777         }
 778
 779         // the line intersects, find intersection point
 780         // LordHavoc: this uses the original trace for maximum accuracy
 781 #if COLLISIONPARANOID >= 3
 782         Con_Print("M");
 783 #endif
 784         if (plane->type < 3)
 785         {
 786                 t1 = t->start[plane->type] - plane->dist;
 787                 t2 = t->end[plane->type] - plane->dist;
 788         }
 789         else
 790         {
 791                 t1 = DotProduct (plane->normal, t->start) - plane->dist;
 792                 t2 = DotProduct (plane->normal, t->end) - plane->dist;
 793         }
 794
 795         midf = t1 / (t1 - t2);
 796         midf = bound(p1f, midf, p2f);
 797         VectorMA(t->start, midf, t->dist, mid);
 798
 799         // recurse both sides, front side first
 800         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
 801         // if this side is not empty, return what it is (solid or done)
 802         if (ret != HULLCHECKSTATE_EMPTY)
 803                 return ret;
 804
 805         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
 806         // if other side is not solid, return what it is (empty or done)
 807         if (ret != HULLCHECKSTATE_SOLID)
 808                 return ret;
 809
 810         // front is air and back is solid, this is the impact point...
 811         if (side)
 812         {
 813                 t->trace->plane.dist = -plane->dist;
 814                 VectorNegate (plane->normal, t->trace->plane.normal);
 815         }
 816         else
 817         {
 818                 t->trace->plane.dist = plane->dist;
 819                 VectorCopy (plane->normal, t->trace->plane.normal);
 820         }
 821
 822         // calculate the true fraction
 823         t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
 824         t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
 825         midf = t1 / (t1 - t2);
 826         t->trace->realfraction = bound(0, midf, 1);
 827
 828         // calculate the return fraction which is nudged off the surface a bit
 829         midf = (t1 - DIST_EPSILON) / (t1 - t2);
 830         t->trace->fraction = bound(0, midf, 1);
 831
 832         if (collision_prefernudgedfraction.integer)
 833                 t->trace->realfraction = t->trace->fraction;
 834
 835 #if COLLISIONPARANOID >= 3
 836         Con_Print("D");
 837 #endif
 838         return HULLCHECKSTATE_DONE;
 839 }
 840
 841 //#if COLLISIONPARANOID < 2
 842 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
 843 {
 844         mplane_t *plane;
 845         mclipnode_t *nodes = t->hull->clipnodes;
 846         mplane_t *planes = t->hull->planes;
 847         vec3_t point;
 848         VectorCopy(t->start, point);
 849         while (num >= 0)
 850         {
 851                 plane = planes + nodes[num].planenum;
 852                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
 853         }
 854         num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
 855         t->trace->startsupercontents |= num;
 856         if (num & SUPERCONTENTS_LIQUIDSMASK)
 857                 t->trace->inwater = true;
 858         if (num == 0)
 859                 t->trace->inopen = true;
 860         if (num & t->trace->hitsupercontentsmask)
 861         {
 862                 t->trace->allsolid = t->trace->startsolid = true;
 863                 return HULLCHECKSTATE_SOLID;
 864         }
 865         else
 866         {
 867                 t->trace->allsolid = t->trace->startsolid = false;
 868                 return HULLCHECKSTATE_EMPTY;
 869         }
 870 }
 871 //#endif
 872
 873 static void Mod_Q1BSP_TracePoint(struct model_s *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
 874 {
 875         RecursiveHullCheckTraceInfo_t rhc;
 876
 877         memset(&rhc, 0, sizeof(rhc));
 878         memset(trace, 0, sizeof(trace_t));
 879         rhc.trace = trace;
 880         rhc.trace->fraction = 1;
 881         rhc.trace->realfraction = 1;
 882         rhc.trace->allsolid = true;
 883         rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
 884         VectorCopy(start, rhc.start);
 885         VectorCopy(start, rhc.end);
 886         Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 887 }
 888
 889 static void Mod_Q1BSP_TraceLine(struct model_s *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
 890 {
 891         RecursiveHullCheckTraceInfo_t rhc;
 892
 893         if (VectorCompare(start, end))
 894         {
 895                 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
 896                 return;
 897         }
 898
 899         memset(&rhc, 0, sizeof(rhc));
 900         memset(trace, 0, sizeof(trace_t));
 901         rhc.trace = trace;
 902         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 903         rhc.trace->fraction = 1;
 904         rhc.trace->realfraction = 1;
 905         rhc.trace->allsolid = true;
 906         rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
 907         VectorCopy(start, rhc.start);
 908         VectorCopy(end, rhc.end);
 909         VectorSubtract(rhc.end, rhc.start, rhc.dist);
 910 #if COLLISIONPARANOID >= 2
 911         Con_Printf("t(%f %f %f,%f %f %f)", rhc.start[0], rhc.start[1], rhc.start[2], rhc.end[0], rhc.end[1], rhc.end[2]);
 912         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 913         {
 914
 915                 double test[3];
 916                 trace_t testtrace;
 917                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
 918                 memset(&testtrace, 0, sizeof(trace_t));
 919                 rhc.trace = &testtrace;
 920                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 921                 rhc.trace->fraction = 1;
 922                 rhc.trace->realfraction = 1;
 923                 rhc.trace->allsolid = true;
 924                 VectorCopy(test, rhc.start);
 925                 VectorCopy(test, rhc.end);
 926                 VectorClear(rhc.dist);
 927                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 928                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
 929                 if (!trace->startsolid && testtrace.startsolid)
 930                         Con_Printf(" - ended in solid!\n");
 931         }
 932         Con_Print("\n");
 933 #else
 934         if (VectorLength2(rhc.dist))
 935                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 936         else
 937                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 938 #endif
 939 }
 940
 941 static void Mod_Q1BSP_TraceBox(struct model_s *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
 942 {
 943         // this function currently only supports same size start and end
 944         double boxsize[3];
 945         RecursiveHullCheckTraceInfo_t rhc;
 946
 947         if (VectorCompare(boxmins, boxmaxs))
 948         {
 949                 if (VectorCompare(start, end))
 950                         Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
 951                 else
 952                         Mod_Q1BSP_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
 953                 return;
 954         }
 955
 956         memset(&rhc, 0, sizeof(rhc));
 957         memset(trace, 0, sizeof(trace_t));
 958         rhc.trace = trace;
 959         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 960         rhc.trace->fraction = 1;
 961         rhc.trace->realfraction = 1;
 962         rhc.trace->allsolid = true;
 963         VectorSubtract(boxmaxs, boxmins, boxsize);
 964         if (boxsize[0] < 3)
 965                 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
 966         else if (model->brush.ishlbsp)
 967         {
 968                 // LordHavoc: this has to have a minor tolerance (the .1) because of
 969                 // minor float precision errors from the box being transformed around
 970                 if (boxsize[0] < 32.1)
 971                 {
 972                         if (boxsize[2] < 54) // pick the nearest of 36 or 72
 973                                 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
 974                         else
 975                                 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
 976                 }
 977                 else
 978                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
 979         }
 980         else
 981         {
 982                 // LordHavoc: this has to have a minor tolerance (the .1) because of
 983                 // minor float precision errors from the box being transformed around
 984                 if (boxsize[0] < 32.1)
 985                         rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
 986                 else
 987                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
 988         }
 989         VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
 990         VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
 991         VectorSubtract(rhc.end, rhc.start, rhc.dist);
 992 #if COLLISIONPARANOID >= 2
 993         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]);
 994         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 995         {
 996
 997                 double test[3];
 998                 trace_t testtrace;
 999                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
1000                 memset(&testtrace, 0, sizeof(trace_t));
1001                 rhc.trace = &testtrace;
1002                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1003                 rhc.trace->fraction = 1;
1004                 rhc.trace->realfraction = 1;
1005                 rhc.trace->allsolid = true;
1006                 VectorCopy(test, rhc.start);
1007                 VectorCopy(test, rhc.end);
1008                 VectorClear(rhc.dist);
1009                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1010                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
1011                 if (!trace->startsolid && testtrace.startsolid)
1012                         Con_Printf(" - ended in solid!\n");
1013         }
1014         Con_Print("\n");
1015 #else
1016         if (VectorLength2(rhc.dist))
1017                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1018         else
1019                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1020 #endif
1021 }
1022
1023 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
1024 {
1025         int num = model->brushq1.hulls[0].firstclipnode;
1026         mplane_t *plane;
1027         mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
1028         mplane_t *planes = model->brushq1.hulls[0].planes;
1029         while (num >= 0)
1030         {
1031                 plane = planes + nodes[num].planenum;
1032                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
1033         }
1034         return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
1035 }
1036
1037 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, const texture_t *boxtexture)
1038 {
1039 #if 1
1040         colbrushf_t cbox;
1041         colplanef_t cbox_planes[6];
1042         cbox.isaabb = true;
1043         cbox.hasaabbplanes = true;
1044         cbox.supercontents = boxsupercontents;
1045         cbox.numplanes = 6;
1046         cbox.numpoints = 0;
1047         cbox.numtriangles = 0;
1048         cbox.planes = cbox_planes;
1049         cbox.points = NULL;
1050         cbox.elements = NULL;
1051         cbox.markframe = 0;
1052         cbox.mins[0] = 0;
1053         cbox.mins[1] = 0;
1054         cbox.mins[2] = 0;
1055         cbox.maxs[0] = 0;
1056         cbox.maxs[1] = 0;
1057         cbox.maxs[2] = 0;
1058         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];
1059         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];
1060         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];
1061         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];
1062         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];
1063         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];
1064         cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1065         cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1066         cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1067         cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1068         cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1069         cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1070         memset(trace, 0, sizeof(trace_t));
1071         trace->hitsupercontentsmask = hitsupercontentsmask;
1072         trace->fraction = 1;
1073         trace->realfraction = 1;
1074         Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1075 #else
1076         RecursiveHullCheckTraceInfo_t rhc;
1077         static hull_t box_hull;
1078         static mclipnode_t box_clipnodes[6];
1079         static mplane_t box_planes[6];
1080         // fill in a default trace
1081         memset(&rhc, 0, sizeof(rhc));
1082         memset(trace, 0, sizeof(trace_t));
1083         //To keep everything totally uniform, bounding boxes are turned into small
1084         //BSP trees instead of being compared directly.
1085         // create a temp hull from bounding box sizes
1086         box_planes[0].dist = cmaxs[0] - mins[0];
1087         box_planes[1].dist = cmins[0] - maxs[0];
1088         box_planes[2].dist = cmaxs[1] - mins[1];
1089         box_planes[3].dist = cmins[1] - maxs[1];
1090         box_planes[4].dist = cmaxs[2] - mins[2];
1091         box_planes[5].dist = cmins[2] - maxs[2];
1092 #if COLLISIONPARANOID >= 3
1093         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]);
1094 #endif
1095
1096         if (box_hull.clipnodes == NULL)
1097         {
1098                 int i, side;
1099
1100                 //Set up the planes and clipnodes so that the six floats of a bounding box
1101                 //can just be stored out and get a proper hull_t structure.
1102
1103                 box_hull.clipnodes = box_clipnodes;
1104                 box_hull.planes = box_planes;
1105                 box_hull.firstclipnode = 0;
1106                 box_hull.lastclipnode = 5;
1107
1108                 for (i = 0;i < 6;i++)
1109                 {
1110                         box_clipnodes[i].planenum = i;
1111
1112                         side = i&1;
1113
1114                         box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1115                         if (i != 5)
1116                                 box_clipnodes[i].children[side^1] = i + 1;
1117                         else
1118                                 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1119
1120                         box_planes[i].type = i>>1;
1121                         box_planes[i].normal[i>>1] = 1;
1122                 }
1123         }
1124
1125         // trace a line through the generated clipping hull
1126         //rhc.boxsupercontents = boxsupercontents;
1127         rhc.hull = &box_hull;
1128         rhc.trace = trace;
1129         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1130         rhc.trace->fraction = 1;
1131         rhc.trace->realfraction = 1;
1132         rhc.trace->allsolid = true;
1133         VectorCopy(start, rhc.start);
1134         VectorCopy(end, rhc.end);
1135         VectorSubtract(rhc.end, rhc.start, rhc.dist);
1136         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1137         //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1138         if (rhc.trace->startsupercontents)
1139                 rhc.trace->startsupercontents = boxsupercontents;
1140 #endif
1141 }
1142
1143 void Collision_ClipTrace_Point(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, int hitsupercontentsmask, int boxsupercontents, int boxq3surfaceflags, const texture_t *boxtexture)
1144 {
1145         memset(trace, 0, sizeof(trace_t));
1146         trace->fraction = 1;
1147         trace->realfraction = 1;
1148         if (BoxesOverlap(start, start, cmins, cmaxs))
1149         {
1150                 trace->startsupercontents |= boxsupercontents;
1151                 if (hitsupercontentsmask & boxsupercontents)
1152                 {
1153                         trace->startsolid = true;
1154                         trace->allsolid = true;
1155                 }
1156         }
1157 }
1158
1159 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1160 {
1161         trace_t trace;
1162         Mod_Q1BSP_TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
1163         return trace.fraction == 1;
1164 }
1165
1166 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)
1167 {
1168         int side;
1169         float front, back;
1170         float mid, distz = endz - startz;
1171
1172 loc0:
1173         if (!node->plane)
1174                 return false;           // didn't hit anything
1175
1176         switch (node->plane->type)
1177         {
1178         case PLANE_X:
1179                 node = node->children[x < node->plane->dist];
1180                 goto loc0;
1181         case PLANE_Y:
1182                 node = node->children[y < node->plane->dist];
1183                 goto loc0;
1184         case PLANE_Z:
1185                 side = startz < node->plane->dist;
1186                 if ((endz < node->plane->dist) == side)
1187                 {
1188                         node = node->children[side];
1189                         goto loc0;
1190                 }
1191                 // found an intersection
1192                 mid = node->plane->dist;
1193                 break;
1194         default:
1195                 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1196                 front += startz * node->plane->normal[2];
1197                 back += endz * node->plane->normal[2];
1198                 side = front < node->plane->dist;
1199                 if ((back < node->plane->dist) == side)
1200                 {
1201                         node = node->children[side];
1202                         goto loc0;
1203                 }
1204                 // found an intersection
1205                 mid = startz + distz * (front - node->plane->dist) / (front - back);
1206                 break;
1207         }
1208
1209         // go down front side
1210         if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1211                 return true;    // hit something
1212         else
1213         {
1214                 // check for impact on this node
1215                 if (node->numsurfaces)
1216                 {
1217                         int i, dsi, dti, lmwidth, lmheight;
1218                         float ds, dt;
1219                         msurface_t *surface;
1220                         unsigned char *lightmap;
1221                         int maps, line3, size3;
1222                         float dsfrac;
1223                         float dtfrac;
1224                         float scale, w, w00, w01, w10, w11;
1225
1226                         surface = model->data_surfaces + node->firstsurface;
1227                         for (i = 0;i < node->numsurfaces;i++, surface++)
1228                         {
1229                                 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo || !surface->lightmapinfo->samples)
1230                                         continue;       // no lightmaps
1231
1232                                 // location we want to sample in the lightmap
1233                                 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;
1234                                 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;
1235
1236                                 // check the bounds
1237                                 dsi = (int)ds;
1238                                 dti = (int)dt;
1239                                 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1240                                 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1241
1242                                 // is it in bounds?
1243                                 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1244                                 {
1245                                         // calculate bilinear interpolation factors
1246                                         // and also multiply by fixedpoint conversion factors
1247                                         dsfrac = ds - dsi;
1248                                         dtfrac = dt - dti;
1249                                         w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1250                                         w01 = (    dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1251                                         w10 = (1 - dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1252                                         w11 = (    dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1253
1254                                         // values for pointer math
1255                                         line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1256                                         size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1257
1258                                         // look up the pixel
1259                                         lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1260
1261                                         // bilinear filter each lightmap style, and sum them
1262                                         for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1263                                         {
1264                                                 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1265                                                 w = w00 * scale;VectorMA(ambientcolor, w, lightmap            , ambientcolor);
1266                                                 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3        , ambientcolor);
1267                                                 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3    , ambientcolor);
1268                                                 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1269                                                 lightmap += size3;
1270                                         }
1271
1272                                         return true; // success
1273                                 }
1274                         }
1275                 }
1276
1277                 // go down back side
1278                 node = node->children[side ^ 1];
1279                 startz = mid;
1280                 distz = endz - startz;
1281                 goto loc0;
1282         }
1283 }
1284
1285 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1286 {
1287         // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1288         VectorSet(diffusenormal, 0, 0, 1);
1289
1290         if (!model->brushq1.lightdata)
1291         {
1292                 VectorSet(ambientcolor, 1, 1, 1);
1293                 VectorSet(diffusecolor, 0, 0, 0);
1294                 return;
1295         }
1296
1297         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);
1298 }
1299
1300 static const texture_t *Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(RecursiveHullCheckTraceInfo_t *t, const dp_model_t *model, const mnode_t *node, double mid[3])
1301 {
1302         int i;
1303         int j;
1304         int k;
1305         const msurface_t *surface;
1306         float normal[3];
1307         float v0[3];
1308         float v1[3];
1309         float edgedir[3];
1310         float edgenormal[3];
1311         float p[4];
1312         float midf;
1313         float t1;
1314         float t2;
1315         VectorCopy(mid, p);
1316         p[3] = 1;
1317         surface = model->data_surfaces + node->firstsurface;
1318         for (i = 0;i < node->numsurfaces;i++, surface++)
1319         {
1320                 // skip surfaces whose bounding box does not include the point
1321 //              if (!BoxesOverlap(mid, mid, surface->mins, surface->maxs))
1322 //                      continue;
1323                 // skip faces with contents we don't care about
1324                 if (!(t->trace->hitsupercontentsmask & surface->texture->supercontents))
1325                         continue;
1326                 // get the surface normal - since it is flat we know any vertex normal will suffice
1327                 VectorCopy(model->surfmesh.data_normal3f + 3 * surface->num_firstvertex, normal);
1328                 // skip backfaces
1329                 if (DotProduct(t->dist, normal) > 0)
1330                         continue;
1331                 // iterate edges and see if the point is outside one of them
1332                 for (j = 0, k = surface->num_vertices - 1;j < surface->num_vertices;k = j, j++)
1333                 {
1334                         VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + k), v0);
1335                         VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + j), v1);
1336                         VectorSubtract(v0, v1, edgedir);
1337                         CrossProduct(edgedir, normal, edgenormal);
1338                         if (DotProduct(edgenormal, p) > DotProduct(edgenormal, v0))
1339                                 break;
1340                 }
1341                 // if the point is outside one of the edges, it is not within the surface
1342                 if (j < surface->num_vertices)
1343                         continue;
1344
1345                 // we hit a surface, this is the impact point...
1346                 VectorCopy(normal, t->trace->plane.normal);
1347                 t->trace->plane.dist = DotProduct(normal, p);
1348
1349                 // calculate the true fraction
1350                 t1 = DotProduct(t->start, t->trace->plane.normal) - t->trace->plane.dist;
1351                 t2 = DotProduct(t->end, t->trace->plane.normal) - t->trace->plane.dist;
1352                 midf = t1 / (t1 - t2);
1353                 t->trace->realfraction = midf;
1354
1355                 // calculate the return fraction which is nudged off the surface a bit
1356                 midf = (t1 - DIST_EPSILON) / (t1 - t2);
1357                 t->trace->fraction = bound(0, midf, 1);
1358
1359                 if (collision_prefernudgedfraction.integer)
1360                         t->trace->realfraction = t->trace->fraction;
1361
1362                 t->trace->hittexture = surface->texture->currentframe;
1363                 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
1364                 t->trace->hitsupercontents = t->trace->hittexture->supercontents;
1365                 return surface->texture->currentframe;
1366         }
1367         return NULL;
1368 }
1369
1370 static int Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(RecursiveHullCheckTraceInfo_t *t, const dp_model_t *model, const mnode_t *node, const double p1[3], const double p2[3])
1371 {
1372         const mplane_t *plane;
1373         double t1, t2;
1374         int side;
1375         double midf, mid[3];
1376         const mleaf_t *leaf;
1377
1378         while (node->plane)
1379         {
1380                 plane = node->plane;
1381                 if (plane->type < 3)
1382                 {
1383                         t1 = p1[plane->type] - plane->dist;
1384                         t2 = p2[plane->type] - plane->dist;
1385                 }
1386                 else
1387                 {
1388                         t1 = DotProduct (plane->normal, p1) - plane->dist;
1389                         t2 = DotProduct (plane->normal, p2) - plane->dist;
1390                 }
1391                 if (t1 < 0)
1392                 {
1393                         if (t2 < 0)
1394                         {
1395                                 node = node->children[1];
1396                                 continue;
1397                         }
1398                         side = 1;
1399                 }
1400                 else
1401                 {
1402                         if (t2 >= 0)
1403                         {
1404                                 node = node->children[0];
1405                                 continue;
1406                         }
1407                         side = 0;
1408                 }
1409
1410                 // the line intersects, find intersection point
1411                 // LordHavoc: this uses the original trace for maximum accuracy
1412                 if (plane->type < 3)
1413                 {
1414                         t1 = t->start[plane->type] - plane->dist;
1415                         t2 = t->end[plane->type] - plane->dist;
1416                 }
1417                 else
1418                 {
1419                         t1 = DotProduct (plane->normal, t->start) - plane->dist;
1420                         t2 = DotProduct (plane->normal, t->end) - plane->dist;
1421                 }
1422
1423                 midf = t1 / (t1 - t2);
1424                 VectorMA(t->start, midf, t->dist, mid);
1425
1426                 // recurse both sides, front side first, return if we hit a surface
1427                 if (Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side], p1, mid) == HULLCHECKSTATE_DONE)
1428                         return HULLCHECKSTATE_DONE;
1429
1430                 // test each surface on the node
1431                 Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(t, model, node, mid);
1432                 if (t->trace->hittexture)
1433                         return HULLCHECKSTATE_DONE;
1434
1435                 // recurse back side
1436                 return Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side ^ 1], mid, p2);
1437         }
1438         leaf = (const mleaf_t *)node;
1439         side = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, leaf->contents);
1440         if (!t->trace->startfound)
1441         {
1442                 t->trace->startfound = true;
1443                 t->trace->startsupercontents |= side;
1444         }
1445         if (side & SUPERCONTENTS_LIQUIDSMASK)
1446                 t->trace->inwater = true;
1447         if (side == 0)
1448                 t->trace->inopen = true;
1449         if (side & t->trace->hitsupercontentsmask)
1450         {
1451                 // if the first leaf is solid, set startsolid
1452                 if (t->trace->allsolid)
1453                         t->trace->startsolid = true;
1454                 return HULLCHECKSTATE_SOLID;
1455         }
1456         else
1457         {
1458                 t->trace->allsolid = false;
1459                 return HULLCHECKSTATE_EMPTY;
1460         }
1461 }
1462
1463 static void Mod_Q1BSP_TraceLineAgainstSurfaces(struct model_s *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
1464 {
1465         RecursiveHullCheckTraceInfo_t rhc;
1466
1467         memset(&rhc, 0, sizeof(rhc));
1468         memset(trace, 0, sizeof(trace_t));
1469         rhc.trace = trace;
1470         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1471         rhc.trace->fraction = 1;
1472         rhc.trace->realfraction = 1;
1473         rhc.trace->allsolid = true;
1474         rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
1475         VectorCopy(start, rhc.start);
1476         VectorCopy(end, rhc.end);
1477         VectorSubtract(rhc.end, rhc.start, rhc.dist);
1478         Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(&rhc, model, model->brush.data_nodes + rhc.hull->firstclipnode, rhc.start, rhc.end);
1479         VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1480 }
1481
1482 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1483 {
1484         int c;
1485         unsigned char *outstart = out;
1486         while (out < outend)
1487         {
1488                 if (in == inend)
1489                 {
1490                         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));
1491                         return;
1492                 }
1493                 c = *in++;
1494                 if (c)
1495                         *out++ = c;
1496                 else
1497                 {
1498                         if (in == inend)
1499                         {
1500                                 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));
1501                                 return;
1502                         }
1503                         for (c = *in++;c > 0;c--)
1504                         {
1505                                 if (out == outend)
1506                                 {
1507                                         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));
1508                                         return;
1509                                 }
1510                                 *out++ = 0;
1511                         }
1512                 }
1513         }
1514 }
1515
1516 /*
1517 =============
1518 R_Q1BSP_LoadSplitSky
1519
1520 A sky texture is 256*128, with the right side being a masked overlay
1521 ==============
1522 */
1523 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1524 {
1525         int x, y;
1526         int w = width/2;
1527         int h = height;
1528         unsigned int *solidpixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1529         unsigned int *alphapixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1530
1531         // allocate a texture pool if we need it
1532         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1533                 loadmodel->texturepool = R_AllocTexturePool();
1534
1535         if (bytesperpixel == 4)
1536         {
1537                 for (y = 0;y < h;y++)
1538                 {
1539                         for (x = 0;x < w;x++)
1540                         {
1541                                 solidpixels[y*w+x] = ((unsigned *)src)[y*width+x+w];
1542                                 alphapixels[y*w+x] = ((unsigned *)src)[y*width+x];
1543                         }
1544                 }
1545         }
1546         else
1547         {
1548                 // make an average value for the back to avoid
1549                 // a fringe on the top level
1550                 int p, r, g, b;
1551                 union
1552                 {
1553                         unsigned int i;
1554                         unsigned char b[4];
1555                 }
1556                 bgra;
1557                 r = g = b = 0;
1558                 for (y = 0;y < h;y++)
1559                 {
1560                         for (x = 0;x < w;x++)
1561                         {
1562                                 p = src[x*width+y+w];
1563                                 r += palette_rgb[p][0];
1564                                 g += palette_rgb[p][1];
1565                                 b += palette_rgb[p][2];
1566                         }
1567                 }
1568                 bgra.b[2] = r/(w*h);
1569                 bgra.b[1] = g/(w*h);
1570                 bgra.b[0] = b/(w*h);
1571                 bgra.b[3] = 0;
1572                 for (y = 0;y < h;y++)
1573                 {
1574                         for (x = 0;x < w;x++)
1575                         {
1576                                 solidpixels[y*w+x] = palette_bgra_complete[src[y*width+x+w]];
1577                                 p = src[y*width+x];
1578                                 alphapixels[y*w+x] = p ? palette_bgra_complete[p] : bgra.i;
1579                         }
1580                 }
1581         }
1582
1583         loadmodel->brush.solidskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_solidtexture", 0         , (unsigned char *) solidpixels, w, h, vid.sRGB3D);
1584         loadmodel->brush.alphaskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_alphatexture", TEXF_ALPHA, (unsigned char *) alphapixels, w, h, vid.sRGB3D);
1585         Mem_Free(solidpixels);
1586         Mem_Free(alphapixels);
1587 }
1588
1589 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1590 {
1591         int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1592         skinframe_t *skinframe;
1593         miptex_t *dmiptex;
1594         texture_t *tx, *tx2, *anims[10], *altanims[10];
1595         texture_t backuptex;
1596         dmiptexlump_t *m;
1597         unsigned char *data, *mtdata;
1598         const char *s;
1599         char mapname[MAX_QPATH], name[MAX_QPATH];
1600         unsigned char zeroopaque[4], zerotrans[4];
1601         Vector4Set(zeroopaque, 0, 0, 0, 255);
1602         Vector4Set(zerotrans, 0, 0, 0, 128);
1603
1604         loadmodel->data_textures = NULL;
1605
1606         // add two slots for notexture walls and notexture liquids
1607         if (l->filelen)
1608         {
1609                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1610                 m->nummiptex = LittleLong (m->nummiptex);
1611                 loadmodel->num_textures = m->nummiptex + 2;
1612                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1613         }
1614         else
1615         {
1616                 m = NULL;
1617                 loadmodel->num_textures = 2;
1618                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1619         }
1620
1621         loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1622
1623         // fill out all slots with notexture
1624         if (cls.state != ca_dedicated)
1625                 skinframe = R_SkinFrame_LoadMissing();
1626         else
1627                 skinframe = NULL;
1628         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1629         {
1630                 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1631                 tx->width = 16;
1632                 tx->height = 16;
1633                 if (cls.state != ca_dedicated)
1634                 {
1635                         tx->numskinframes = 1;
1636                         tx->skinframerate = 1;
1637                         tx->skinframes[0] = skinframe;
1638                         tx->currentskinframe = tx->skinframes[0];
1639                 }
1640                 tx->basematerialflags = MATERIALFLAG_WALL;
1641                 if (i == loadmodel->num_textures - 1)
1642                 {
1643                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1644                         tx->supercontents = mod_q1bsp_texture_water.supercontents;
1645                         tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1646                 }
1647                 else
1648                 {
1649                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1650                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1651                 }
1652                 tx->currentframe = tx;
1653
1654                 // clear water settings
1655                 tx->reflectmin = 0;
1656                 tx->reflectmax = 1;
1657                 tx->refractfactor = 1;
1658                 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1659                 tx->reflectfactor = 1;
1660                 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1661                 tx->r_water_wateralpha = 1;
1662                 tx->offsetmapping = OFFSETMAPPING_OFF;
1663                 tx->offsetscale = 1;
1664                 tx->specularscalemod = 1;
1665                 tx->specularpowermod = 1;
1666         }
1667
1668         if (!m)
1669         {
1670                 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1671                 return;
1672         }
1673
1674         s = loadmodel->name;
1675         if (!strncasecmp(s, "maps/", 5))
1676                 s += 5;
1677         FS_StripExtension(s, mapname, sizeof(mapname));
1678
1679         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1680         dofs = m->dataofs;
1681         // LordHavoc: mostly rewritten map texture loader
1682         for (i = 0;i < m->nummiptex;i++)
1683         {
1684                 dofs[i] = LittleLong(dofs[i]);
1685                 if (r_nosurftextures.integer)
1686                         continue;
1687                 if (dofs[i] == -1)
1688                 {
1689                         Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1690                         continue;
1691                 }
1692                 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1693
1694                 // copy name, but only up to 16 characters
1695                 // (the output buffer can hold more than this, but the input buffer is
1696                 //  only 16)
1697                 for (j = 0;j < 16 && dmiptex->name[j];j++)
1698                         name[j] = dmiptex->name[j];
1699                 name[j] = 0;
1700
1701                 if (!name[0])
1702                 {
1703                         dpsnprintf(name, sizeof(name), "unnamed%i", i);
1704                         Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1705                 }
1706
1707                 mtwidth = LittleLong(dmiptex->width);
1708                 mtheight = LittleLong(dmiptex->height);
1709                 mtdata = NULL;
1710                 j = LittleLong(dmiptex->offsets[0]);
1711                 if (j)
1712                 {
1713                         // texture included
1714                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1715                         {
1716                                 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1717                                 continue;
1718                         }
1719                         mtdata = (unsigned char *)dmiptex + j;
1720                 }
1721
1722                 if ((mtwidth & 15) || (mtheight & 15))
1723                         Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1724
1725                 // LordHavoc: force all names to lowercase
1726                 for (j = 0;name[j];j++)
1727                         if (name[j] >= 'A' && name[j] <= 'Z')
1728                                 name[j] += 'a' - 'A';
1729
1730                 // LordHavoc: backup the texture_t because q3 shader loading overwrites it
1731                 backuptex = loadmodel->data_textures[i];
1732                 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1733                         continue;
1734                 loadmodel->data_textures[i] = backuptex;
1735
1736                 tx = loadmodel->data_textures + i;
1737                 strlcpy(tx->name, name, sizeof(tx->name));
1738                 tx->width = mtwidth;
1739                 tx->height = mtheight;
1740
1741                 if (tx->name[0] == '*')
1742                 {
1743                         if (!strncmp(tx->name, "*lava", 5))
1744                         {
1745                                 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1746                                 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1747                         }
1748                         else if (!strncmp(tx->name, "*slime", 6))
1749                         {
1750                                 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1751                                 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1752                         }
1753                         else
1754                         {
1755                                 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1756                                 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1757                         }
1758                 }
1759                 else if (!strncmp(tx->name, "sky", 3))
1760                 {
1761                         tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1762                         tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1763                 }
1764                 else
1765                 {
1766                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1767                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1768                 }
1769
1770                 if (cls.state != ca_dedicated)
1771                 {
1772                         // LordHavoc: HL sky textures are entirely different than quake
1773                         if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == mtheight * 2)
1774                         {
1775                                 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), false, false, false, NULL);
1776                                 if (!data)
1777                                         data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), false, false, false, NULL);
1778                                 if (data && image_width == image_height * 2)
1779                                 {
1780                                         R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1781                                         Mem_Free(data);
1782                                 }
1783                                 else if (mtdata != NULL)
1784                                         R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1785                         }
1786                         else
1787                         {
1788                                 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, false);
1789                                 if (!skinframe)
1790                                         skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, false);
1791                                 if (!skinframe)
1792                                 {
1793                                         // did not find external texture, load it from the bsp or wad3
1794                                         if (loadmodel->brush.ishlbsp)
1795                                         {
1796                                                 // internal texture overrides wad
1797                                                 unsigned char *pixels, *freepixels;
1798                                                 pixels = freepixels = NULL;
1799                                                 if (mtdata)
1800                                                         pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1801                                                 if (pixels == NULL)
1802                                                         pixels = freepixels = W_GetTextureBGRA(tx->name);
1803                                                 if (pixels != NULL)
1804                                                 {
1805                                                         tx->width = image_width;
1806                                                         tx->height = image_height;
1807                                                         skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, pixels, image_width, image_height, true);
1808                                                 }
1809                                                 if (freepixels)
1810                                                         Mem_Free(freepixels);
1811                                         }
1812                                         else if (mtdata) // texture included
1813                                                 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1814                                 }
1815                                 // if skinframe is still NULL the "missing" texture will be used
1816                                 if (skinframe)
1817                                         tx->skinframes[0] = skinframe;
1818                         }
1819
1820                         tx->basematerialflags = MATERIALFLAG_WALL;
1821                         if (tx->name[0] == '*')
1822                         {
1823                                 // LordHavoc: some turbulent textures should not be affected by wateralpha
1824                                 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1825                                 {
1826                                         // replace the texture with transparent black
1827                                         tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA, zerotrans, 1, 1, false);
1828                                         tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1829                                 }
1830                                 else if (!strncmp(tx->name,"*lava",5)
1831                                  || !strncmp(tx->name,"*teleport",9)
1832                                  || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1833                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1834                                 else
1835                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1836                                 if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1837                                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1838                         }
1839                         else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1840                         {
1841                                 // replace the texture with black
1842                                 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, 0, zeroopaque, 1, 1, false);
1843                                 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1844                         }
1845                         else if (!strncmp(tx->name, "sky", 3))
1846                                 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1847                         else if (!strcmp(tx->name, "caulk"))
1848                                 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1849                         else if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1850                                 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1851
1852                         // start out with no animation
1853                         tx->currentframe = tx;
1854                         tx->currentskinframe = tx->skinframes[0];
1855                 }
1856         }
1857
1858         // sequence the animations
1859         for (i = 0;i < m->nummiptex;i++)
1860         {
1861                 tx = loadmodel->data_textures + i;
1862                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1863                         continue;
1864                 if (tx->anim_total[0] || tx->anim_total[1])
1865                         continue;       // already sequenced
1866
1867                 // find the number of frames in the animation
1868                 memset(anims, 0, sizeof(anims));
1869                 memset(altanims, 0, sizeof(altanims));
1870
1871                 for (j = i;j < m->nummiptex;j++)
1872                 {
1873                         tx2 = loadmodel->data_textures + j;
1874                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1875                                 continue;
1876
1877                         num = tx2->name[1];
1878                         if (num >= '0' && num <= '9')
1879                                 anims[num - '0'] = tx2;
1880                         else if (num >= 'a' && num <= 'j')
1881                                 altanims[num - 'a'] = tx2;
1882                         else
1883                                 Con_Printf("Bad animating texture %s\n", tx->name);
1884                 }
1885
1886                 max = altmax = 0;
1887                 for (j = 0;j < 10;j++)
1888                 {
1889                         if (anims[j])
1890                                 max = j + 1;
1891                         if (altanims[j])
1892                                 altmax = j + 1;
1893                 }
1894                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1895
1896                 incomplete = false;
1897                 for (j = 0;j < max;j++)
1898                 {
1899                         if (!anims[j])
1900                         {
1901                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1902                                 incomplete = true;
1903                         }
1904                 }
1905                 for (j = 0;j < altmax;j++)
1906                 {
1907                         if (!altanims[j])
1908                         {
1909                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1910                                 incomplete = true;
1911                         }
1912                 }
1913                 if (incomplete)
1914                         continue;
1915
1916                 if (altmax < 1)
1917                 {
1918                         // if there is no alternate animation, duplicate the primary
1919                         // animation into the alternate
1920                         altmax = max;
1921                         for (k = 0;k < 10;k++)
1922                                 altanims[k] = anims[k];
1923                 }
1924
1925                 // link together the primary animation
1926                 for (j = 0;j < max;j++)
1927                 {
1928                         tx2 = anims[j];
1929                         tx2->animated = true;
1930                         tx2->anim_total[0] = max;
1931                         tx2->anim_total[1] = altmax;
1932                         for (k = 0;k < 10;k++)
1933                         {
1934                                 tx2->anim_frames[0][k] = anims[k];
1935                                 tx2->anim_frames[1][k] = altanims[k];
1936                         }
1937                 }
1938
1939                 // if there really is an alternate anim...
1940                 if (anims[0] != altanims[0])
1941                 {
1942                         // link together the alternate animation
1943                         for (j = 0;j < altmax;j++)
1944                         {
1945                                 tx2 = altanims[j];
1946                                 tx2->animated = true;
1947                                 // the primary/alternate are reversed here
1948                                 tx2->anim_total[0] = altmax;
1949                                 tx2->anim_total[1] = max;
1950                                 for (k = 0;k < 10;k++)
1951                                 {
1952                                         tx2->anim_frames[0][k] = altanims[k];
1953                                         tx2->anim_frames[1][k] = anims[k];
1954                                 }
1955                         }
1956                 }
1957         }
1958 }
1959
1960 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1961 {
1962         int i;
1963         unsigned char *in, *out, *data, d;
1964         char litfilename[MAX_QPATH];
1965         char dlitfilename[MAX_QPATH];
1966         fs_offset_t filesize;
1967         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1968         {
1969                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1970                 for (i=0; i<l->filelen; i++)
1971                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1972         }
1973         else // LordHavoc: bsp version 29 (normal white lighting)
1974         {
1975                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1976                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1977                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1978                 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1979                 strlcat (litfilename, ".lit", sizeof (litfilename));
1980                 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1981                 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1982                 if (data)
1983                 {
1984                         if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1985                         {
1986                                 i = LittleLong(((int *)data)[1]);
1987                                 if (i == 1)
1988                                 {
1989                                         if (developer_loading.integer)
1990                                                 Con_Printf("loaded %s\n", litfilename);
1991                                         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1992                                         memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1993                                         Mem_Free(data);
1994                                         data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1995                                         if (data)
1996                                         {
1997                                                 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1998                                                 {
1999                                                         i = LittleLong(((int *)data)[1]);
2000                                                         if (i == 1)
2001                                                         {
2002                                                                 if (developer_loading.integer)
2003                                                                         Con_Printf("loaded %s\n", dlitfilename);
2004                                                                 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
2005                                                                 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
2006                                                                 loadmodel->brushq3.deluxemapping_modelspace = false;
2007                                                                 loadmodel->brushq3.deluxemapping = true;
2008                                                         }
2009                                                 }
2010                                                 Mem_Free(data);
2011                                                 data = NULL;
2012                                         }
2013                                         return;
2014                                 }
2015                                 else
2016                                         Con_Printf("Unknown .lit file version (%d)\n", i);
2017                         }
2018                         else if (filesize == 8)
2019                                 Con_Print("Empty .lit file, ignoring\n");
2020                         else
2021                                 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
2022                         if (data)
2023                         {
2024                                 Mem_Free(data);
2025                                 data = NULL;
2026                         }
2027                 }
2028                 // LordHavoc: oh well, expand the white lighting data
2029                 if (!l->filelen)
2030                         return;
2031                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
2032                 in = mod_base + l->fileofs;
2033                 out = loadmodel->brushq1.lightdata;
2034                 for (i = 0;i < l->filelen;i++)
2035                 {
2036                         d = *in++;
2037                         *out++ = d;
2038                         *out++ = d;
2039                         *out++ = d;
2040                 }
2041         }
2042 }
2043
2044 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
2045 {
2046         loadmodel->brushq1.num_compressedpvs = 0;
2047         loadmodel->brushq1.data_compressedpvs = NULL;
2048         if (!l->filelen)
2049                 return;
2050         loadmodel->brushq1.num_compressedpvs = l->filelen;
2051         loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
2052         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
2053 }
2054
2055 // used only for HalfLife maps
2056 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
2057 {
2058         char key[128], value[4096];
2059         int i, j, k;
2060         if (!data)
2061                 return;
2062         if (!COM_ParseToken_Simple(&data, false, false))
2063                 return; // error
2064         if (com_token[0] != '{')
2065                 return; // error
2066         while (1)
2067         {
2068                 if (!COM_ParseToken_Simple(&data, false, false))
2069                         return; // error
2070                 if (com_token[0] == '}')
2071                         break; // end of worldspawn
2072                 if (com_token[0] == '_')
2073                         strlcpy(key, com_token + 1, sizeof(key));
2074                 else
2075                         strlcpy(key, com_token, sizeof(key));
2076                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
2077                         key[strlen(key)-1] = 0;
2078                 if (!COM_ParseToken_Simple(&data, false, false))
2079                         return; // error
2080                 dpsnprintf(value, sizeof(value), "%s", com_token);
2081                 if (!strcmp("wad", key)) // for HalfLife maps
2082                 {
2083                         if (loadmodel->brush.ishlbsp)
2084                         {
2085                                 j = 0;
2086                                 for (i = 0;i < (int)sizeof(value);i++)
2087                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
2088                                                 break;
2089                                 if (value[i])
2090                                 {
2091                                         for (;i < (int)sizeof(value);i++)
2092                                         {
2093                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
2094                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
2095                                                         j = i+1;
2096                                                 else if (value[i] == ';' || value[i] == 0)
2097                                                 {
2098                                                         k = value[i];
2099                                                         value[i] = 0;
2100                                                         W_LoadTextureWadFile(&value[j], false);
2101                                                         j = i+1;
2102                                                         if (!k)
2103                                                                 break;
2104                                                 }
2105                                         }
2106                                 }
2107                         }
2108                 }
2109         }
2110 }
2111
2112 static void Mod_Q1BSP_LoadEntities(lump_t *l)
2113 {
2114         loadmodel->brush.entities = NULL;
2115         if (!l->filelen)
2116                 return;
2117         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
2118         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
2119         loadmodel->brush.entities[l->filelen] = 0;
2120         if (loadmodel->brush.ishlbsp)
2121                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
2122 }
2123
2124
2125 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
2126 {
2127         dvertex_t       *in;
2128         mvertex_t       *out;
2129         int                     i, count;
2130
2131         in = (dvertex_t *)(mod_base + l->fileofs);
2132         if (l->filelen % sizeof(*in))
2133                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
2134         count = l->filelen / sizeof(*in);
2135         out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2136
2137         loadmodel->brushq1.vertexes = out;
2138         loadmodel->brushq1.numvertexes = count;
2139
2140         for ( i=0 ; i<count ; i++, in++, out++)
2141         {
2142                 out->position[0] = LittleFloat(in->point[0]);
2143                 out->position[1] = LittleFloat(in->point[1]);
2144                 out->position[2] = LittleFloat(in->point[2]);
2145         }
2146 }
2147
2148 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
2149 // can be used for this
2150 // REMOVEME
2151 int SB_ReadInt (unsigned char **buffer)
2152 {
2153         int     i;
2154         i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
2155         (*buffer) += 4;
2156         return i;
2157 }
2158
2159 // REMOVEME
2160 float SB_ReadFloat (unsigned char **buffer)
2161 {
2162         union
2163         {
2164                 int             i;
2165                 float   f;
2166         } u;
2167
2168         u.i = SB_ReadInt (buffer);
2169         return u.f;
2170 }
2171
2172 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
2173 {
2174         unsigned char           *index;
2175         dmodel_t        *out;
2176         int                     i, j, count;
2177
2178         index = (unsigned char *)(mod_base + l->fileofs);
2179         if (l->filelen % (48+4*hullinfo->filehulls))
2180                 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
2181
2182         count = l->filelen / (48+4*hullinfo->filehulls);
2183         out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
2184
2185         loadmodel->brushq1.submodels = out;
2186         loadmodel->brush.numsubmodels = count;
2187
2188         for (i = 0; i < count; i++, out++)
2189         {
2190         // spread out the mins / maxs by a pixel
2191                 out->mins[0] = SB_ReadFloat (&index) - 1;
2192                 out->mins[1] = SB_ReadFloat (&index) - 1;
2193                 out->mins[2] = SB_ReadFloat (&index) - 1;
2194                 out->maxs[0] = SB_ReadFloat (&index) + 1;
2195                 out->maxs[1] = SB_ReadFloat (&index) + 1;
2196                 out->maxs[2] = SB_ReadFloat (&index) + 1;
2197                 out->origin[0] = SB_ReadFloat (&index);
2198                 out->origin[1] = SB_ReadFloat (&index);
2199                 out->origin[2] = SB_ReadFloat (&index);
2200                 for (j = 0; j < hullinfo->filehulls; j++)
2201                         out->headnode[j] = SB_ReadInt (&index);
2202                 out->visleafs = SB_ReadInt (&index);
2203                 out->firstface = SB_ReadInt (&index);
2204                 out->numfaces = SB_ReadInt (&index);
2205         }
2206 }
2207
2208 static void Mod_Q1BSP_LoadEdges(lump_t *l)
2209 {
2210         dedge_t *in;
2211         medge_t *out;
2212         int     i, count;
2213
2214         in = (dedge_t *)(mod_base + l->fileofs);
2215         if (l->filelen % sizeof(*in))
2216                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2217         count = l->filelen / sizeof(*in);
2218         out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2219
2220         loadmodel->brushq1.edges = out;
2221         loadmodel->brushq1.numedges = count;
2222
2223         for ( i=0 ; i<count ; i++, in++, out++)
2224         {
2225                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2226                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2227                 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2228                 {
2229                         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);
2230                         if(!loadmodel->brushq1.numvertexes)
2231                                 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2232
2233                         out->v[0] = 0;
2234                         out->v[1] = 0;
2235                 }
2236         }
2237 }
2238
2239 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2240 {
2241         texinfo_t *in;
2242         mtexinfo_t *out;
2243         int i, j, k, count, miptex;
2244
2245         in = (texinfo_t *)(mod_base + l->fileofs);
2246         if (l->filelen % sizeof(*in))
2247                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2248         count = l->filelen / sizeof(*in);
2249         out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2250
2251         loadmodel->brushq1.texinfo = out;
2252         loadmodel->brushq1.numtexinfo = count;
2253
2254         for (i = 0;i < count;i++, in++, out++)
2255         {
2256                 for (k = 0;k < 2;k++)
2257                         for (j = 0;j < 4;j++)
2258                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2259
2260                 miptex = LittleLong(in->miptex);
2261                 out->flags = LittleLong(in->flags);
2262
2263                 out->texture = NULL;
2264                 if (loadmodel->data_textures)
2265                 {
2266                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2267                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2268                         else
2269                                 out->texture = loadmodel->data_textures + miptex;
2270                 }
2271                 if (out->flags & TEX_SPECIAL)
2272                 {
2273                         // if texture chosen is NULL or the shader needs a lightmap,
2274                         // force to notexture water shader
2275                         if (out->texture == NULL)
2276                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2277                 }
2278                 else
2279                 {
2280                         // if texture chosen is NULL, force to notexture
2281                         if (out->texture == NULL)
2282                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2283                 }
2284         }
2285 }
2286
2287 #if 0
2288 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2289 {
2290         int             i, j;
2291         float   *v;
2292
2293         mins[0] = mins[1] = mins[2] = 9999;
2294         maxs[0] = maxs[1] = maxs[2] = -9999;
2295         v = verts;
2296         for (i = 0;i < numverts;i++)
2297         {
2298                 for (j = 0;j < 3;j++, v++)
2299                 {
2300                         if (*v < mins[j])
2301                                 mins[j] = *v;
2302                         if (*v > maxs[j])
2303                                 maxs[j] = *v;
2304                 }
2305         }
2306 }
2307
2308 #define MAX_SUBDIVPOLYTRIANGLES 4096
2309 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2310
2311 static int subdivpolyverts, subdivpolytriangles;
2312 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2313 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2314
2315 static int subdivpolylookupvert(vec3_t v)
2316 {
2317         int i;
2318         for (i = 0;i < subdivpolyverts;i++)
2319                 if (subdivpolyvert[i][0] == v[0]
2320                  && subdivpolyvert[i][1] == v[1]
2321                  && subdivpolyvert[i][2] == v[2])
2322                         return i;
2323         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2324                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2325         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2326         return subdivpolyverts++;
2327 }
2328
2329 static void SubdividePolygon(int numverts, float *verts)
2330 {
2331         int             i, i1, i2, i3, f, b, c, p;
2332         vec3_t  mins, maxs, front[256], back[256];
2333         float   m, *pv, *cv, dist[256], frac;
2334
2335         if (numverts > 250)
2336                 Host_Error("SubdividePolygon: ran out of verts in buffer");
2337
2338         BoundPoly(numverts, verts, mins, maxs);
2339
2340         for (i = 0;i < 3;i++)
2341         {
2342                 m = (mins[i] + maxs[i]) * 0.5;
2343                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2344                 if (maxs[i] - m < 8)
2345                         continue;
2346                 if (m - mins[i] < 8)
2347                         continue;
2348
2349                 // cut it
2350                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2351                         dist[c] = cv[i] - m;
2352
2353                 f = b = 0;
2354                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2355                 {
2356                         if (dist[p] >= 0)
2357                         {
2358                                 VectorCopy(pv, front[f]);
2359                                 f++;
2360                         }
2361                         if (dist[p] <= 0)
2362                         {
2363                                 VectorCopy(pv, back[b]);
2364                                 b++;
2365                         }
2366                         if (dist[p] == 0 || dist[c] == 0)
2367                                 continue;
2368                         if ((dist[p] > 0) != (dist[c] > 0) )
2369                         {
2370                                 // clip point
2371                                 frac = dist[p] / (dist[p] - dist[c]);
2372                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2373                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2374                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2375                                 f++;
2376                                 b++;
2377                         }
2378                 }
2379
2380                 SubdividePolygon(f, front[0]);
2381                 SubdividePolygon(b, back[0]);
2382                 return;
2383         }
2384
2385         i1 = subdivpolylookupvert(verts);
2386         i2 = subdivpolylookupvert(verts + 3);
2387         for (i = 2;i < numverts;i++)
2388         {
2389                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2390                 {
2391                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2392                         return;
2393                 }
2394
2395                 i3 = subdivpolylookupvert(verts + i * 3);
2396                 subdivpolyindex[subdivpolytriangles][0] = i1;
2397                 subdivpolyindex[subdivpolytriangles][1] = i2;
2398                 subdivpolyindex[subdivpolytriangles][2] = i3;
2399                 i2 = i3;
2400                 subdivpolytriangles++;
2401         }
2402 }
2403
2404 //Breaks a polygon up along axial 64 unit
2405 //boundaries so that turbulent and sky warps
2406 //can be done reasonably.
2407 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2408 {
2409         int i, j;
2410         surfvertex_t *v;
2411         surfmesh_t *mesh;
2412
2413         subdivpolytriangles = 0;
2414         subdivpolyverts = 0;
2415         SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2416         if (subdivpolytriangles < 1)
2417                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2418
2419         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2420         mesh->num_vertices = subdivpolyverts;
2421         mesh->num_triangles = subdivpolytriangles;
2422         mesh->vertex = (surfvertex_t *)(mesh + 1);
2423         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2424         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2425
2426         for (i = 0;i < mesh->num_triangles;i++)
2427                 for (j = 0;j < 3;j++)
2428                         mesh->index[i*3+j] = subdivpolyindex[i][j];
2429
2430         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2431         {
2432                 VectorCopy(subdivpolyvert[i], v->v);
2433                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2434                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2435         }
2436 }
2437 #endif
2438
2439 extern cvar_t gl_max_lightmapsize;
2440 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2441 {
2442         dface_t *in;
2443         msurface_t *surface;
2444         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2445         float texmins[2], texmaxs[2], val;
2446         rtexture_t *lightmaptexture, *deluxemaptexture;
2447
2448         in = (dface_t *)(mod_base + l->fileofs);
2449         if (l->filelen % sizeof(*in))
2450                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2451         count = l->filelen / sizeof(*in);
2452         loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2453         loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2454
2455         loadmodel->num_surfaces = count;
2456
2457         loadmodel->brushq1.firstrender = true;
2458         loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2459
2460         totalverts = 0;
2461         totaltris = 0;
2462         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2463         {
2464                 numedges = (unsigned short)LittleShort(in->numedges);
2465                 totalverts += numedges;
2466                 totaltris += numedges - 2;
2467         }
2468
2469         Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2470
2471         lightmaptexture = NULL;
2472         deluxemaptexture = r_texture_blanknormalmap;
2473         lightmapnumber = 0;
2474         lightmapsize = bound(256, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d);
2475         totallightmapsamples = 0;
2476
2477         totalverts = 0;
2478         totaltris = 0;
2479         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2480         {
2481                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2482
2483                 // FIXME: validate edges, texinfo, etc?
2484                 firstedge = LittleLong(in->firstedge);
2485                 numedges = (unsigned short)LittleShort(in->numedges);
2486                 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)
2487                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2488                 i = (unsigned short)LittleShort(in->texinfo);
2489                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2490                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2491                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2492                 surface->texture = surface->lightmapinfo->texinfo->texture;
2493
2494                 planenum = (unsigned short)LittleShort(in->planenum);
2495                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2496                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2497
2498                 //surface->flags = surface->texture->flags;
2499                 //if (LittleShort(in->side))
2500                 //      surface->flags |= SURF_PLANEBACK;
2501                 //surface->plane = loadmodel->brush.data_planes + planenum;
2502
2503                 surface->num_firstvertex = totalverts;
2504                 surface->num_vertices = numedges;
2505                 surface->num_firsttriangle = totaltris;
2506                 surface->num_triangles = numedges - 2;
2507                 totalverts += numedges;
2508                 totaltris += numedges - 2;
2509
2510                 // convert edges back to a normal polygon
2511                 for (i = 0;i < surface->num_vertices;i++)
2512                 {
2513                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2514                         float s, t;
2515                         // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2516                         if (lindex >= 0)
2517                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2518                         else
2519                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2520                         s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2521                         t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2522                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2523                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2524                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2525                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2526                         (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2527                 }
2528
2529                 for (i = 0;i < surface->num_triangles;i++)
2530                 {
2531                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2532                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2533                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2534                 }
2535
2536                 // compile additional data about the surface geometry
2537                 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, r_smoothnormals_areaweighting.integer != 0);
2538                 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, r_smoothnormals_areaweighting.integer != 0);
2539                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2540
2541                 // generate surface extents information
2542                 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2543                 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2544                 for (i = 1;i < surface->num_vertices;i++)
2545                 {
2546                         for (j = 0;j < 2;j++)
2547                         {
2548                                 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2549                                 texmins[j] = min(texmins[j], val);
2550                                 texmaxs[j] = max(texmaxs[j], val);
2551                         }
2552                 }
2553                 for (i = 0;i < 2;i++)
2554                 {
2555                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2556                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2557                 }
2558
2559                 smax = surface->lightmapinfo->extents[0] >> 4;
2560                 tmax = surface->lightmapinfo->extents[1] >> 4;
2561                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2562                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2563
2564                 // lighting info
2565                 for (i = 0;i < MAXLIGHTMAPS;i++)
2566                         surface->lightmapinfo->styles[i] = in->styles[i];
2567                 surface->lightmaptexture = NULL;
2568                 surface->deluxemaptexture = r_texture_blanknormalmap;
2569                 i = LittleLong(in->lightofs);
2570                 if (i == -1)
2571                 {
2572                         surface->lightmapinfo->samples = NULL;
2573 #if 1
2574                         // give non-lightmapped water a 1x white lightmap
2575                         if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2576                         {
2577                                 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2578                                 surface->lightmapinfo->styles[0] = 0;
2579                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2580                         }
2581 #endif
2582                 }
2583                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2584                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2585                 else // LordHavoc: white lighting (bsp version 29)
2586                 {
2587                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2588                         if (loadmodel->brushq1.nmaplightdata)
2589                                 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2590                 }
2591
2592                 // check if we should apply a lightmap to this
2593                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2594                 {
2595                         if (ssize > 256 || tsize > 256)
2596                                 Host_Error("Bad surface extents");
2597
2598                         if (lightmapsize < ssize)
2599                                 lightmapsize = ssize;
2600                         if (lightmapsize < tsize)
2601                                 lightmapsize = tsize;
2602
2603                         totallightmapsamples += ssize*tsize;
2604
2605                         // force lightmap upload on first time seeing the surface
2606                         //
2607                         // additionally this is used by the later code to see if a
2608                         // lightmap is needed on this surface (rather than duplicating the
2609                         // logic above)
2610                         loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2611                         loadmodel->lit = true;
2612                 }
2613         }
2614
2615         // small maps (such as ammo boxes especially) don't need big lightmap
2616         // textures, so this code tries to guess a good size based on
2617         // totallightmapsamples (size of the lightmaps lump basically), as well as
2618         // trying to max out the size if there is a lot of lightmap data to store
2619         // additionally, never choose a lightmapsize that is smaller than the
2620         // largest surface encountered (as it would fail)
2621         i = lightmapsize;
2622         for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < bound(128, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d)) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2623                 ;
2624
2625         // now that we've decided the lightmap texture size, we can do the rest
2626         if (cls.state != ca_dedicated)
2627         {
2628                 int stainmapsize = 0;
2629                 mod_alloclightmap_state_t allocState;
2630
2631                 Mod_AllocLightmap_Init(&allocState, lightmapsize, lightmapsize);
2632                 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2633                 {
2634                         int i, iu, iv, lightmapx = 0, lightmapy = 0;
2635                         float u, v, ubase, vbase, uscale, vscale;
2636
2637                         if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2638                                 continue;
2639
2640                         smax = surface->lightmapinfo->extents[0] >> 4;
2641                         tmax = surface->lightmapinfo->extents[1] >> 4;
2642                         ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2643                         tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2644                         stainmapsize += ssize * tsize * 3;
2645
2646                         if (!lightmaptexture || !Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy))
2647                         {
2648                                 // allocate a texture pool if we need it
2649                                 if (loadmodel->texturepool == NULL)
2650                                         loadmodel->texturepool = R_AllocTexturePool();
2651                                 // could not find room, make a new lightmap
2652                                 loadmodel->brushq3.num_mergedlightmaps = lightmapnumber + 1;
2653                                 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_lightmaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_lightmaps[0]));
2654                                 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_deluxemaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_deluxemaps[0]));
2655                                 loadmodel->brushq3.data_lightmaps[lightmapnumber] = lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_ALLOWUPDATES, -1, NULL);
2656                                 if (loadmodel->brushq1.nmaplightdata)
2657                                         loadmodel->brushq3.data_deluxemaps[lightmapnumber] = deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_ALLOWUPDATES, -1, NULL);
2658                                 lightmapnumber++;
2659                                 Mod_AllocLightmap_Reset(&allocState);
2660                                 Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy);
2661                         }
2662                         surface->lightmaptexture = lightmaptexture;
2663                         surface->deluxemaptexture = deluxemaptexture;
2664                         surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2665                         surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2666
2667                         uscale = 1.0f / (float)lightmapsize;
2668                         vscale = 1.0f / (float)lightmapsize;
2669                         ubase = lightmapx * uscale;
2670                         vbase = lightmapy * vscale;
2671
2672                         for (i = 0;i < surface->num_vertices;i++)
2673                         {
2674                                 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);
2675                                 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);
2676                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2677                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2678                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2679                                 iu = (int) u;
2680                                 iv = (int) v;
2681                                 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2682                         }
2683                 }
2684
2685                 if (cl_stainmaps.integer)
2686                 {
2687                         // allocate stainmaps for permanent marks on walls and clear white
2688                         unsigned char *stainsamples = NULL;
2689                         stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2690                         memset(stainsamples, 255, stainmapsize);
2691                         // assign pointers
2692                         for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2693                         {
2694                                 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2695                                         continue;
2696                                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2697                                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2698                                 surface->lightmapinfo->stainsamples = stainsamples;
2699                                 stainsamples += ssize * tsize * 3;
2700                         }
2701                 }
2702         }
2703
2704         // generate ushort elements array if possible
2705         if (loadmodel->surfmesh.data_element3s)
2706                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2707                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2708 }
2709
2710 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2711 {
2712         //if (node->parent)
2713         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2714         node->parent = parent;
2715         if (node->plane)
2716         {
2717                 // this is a node, recurse to children
2718                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2719                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2720                 // combine supercontents of children
2721                 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2722         }
2723         else
2724         {
2725                 int j;
2726                 mleaf_t *leaf = (mleaf_t *)node;
2727                 // if this is a leaf, calculate supercontents mask from all collidable
2728                 // primitives in the leaf (brushes and collision surfaces)
2729                 // also flag if the leaf contains any collision surfaces
2730                 leaf->combinedsupercontents = 0;
2731                 // combine the supercontents values of all brushes in this leaf
2732                 for (j = 0;j < leaf->numleafbrushes;j++)
2733                         leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2734                 // check if this leaf contains any collision surfaces (q3 patches)
2735                 for (j = 0;j < leaf->numleafsurfaces;j++)
2736                 {
2737                         msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2738                         if (surface->num_collisiontriangles)
2739                         {
2740                                 leaf->containscollisionsurfaces = true;
2741                                 leaf->combinedsupercontents |= surface->texture->supercontents;
2742                         }
2743                 }
2744         }
2745 }
2746
2747 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2748 {
2749         int                     i, j, count, p;
2750         dnode_t         *in;
2751         mnode_t         *out;
2752
2753         in = (dnode_t *)(mod_base + l->fileofs);
2754         if (l->filelen % sizeof(*in))
2755                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2756         count = l->filelen / sizeof(*in);
2757         if (count == 0)
2758                 Host_Error("Mod_Q1BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
2759         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2760
2761         loadmodel->brush.data_nodes = out;
2762         loadmodel->brush.num_nodes = count;
2763
2764         for ( i=0 ; i<count ; i++, in++, out++)
2765         {
2766                 for (j=0 ; j<3 ; j++)
2767                 {
2768                         out->mins[j] = LittleShort(in->mins[j]);
2769                         out->maxs[j] = LittleShort(in->maxs[j]);
2770                 }
2771
2772                 p = LittleLong(in->planenum);
2773                 out->plane = loadmodel->brush.data_planes + p;
2774
2775                 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2776                 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2777
2778                 for (j=0 ; j<2 ; j++)
2779                 {
2780                         // LordHavoc: this code supports broken bsp files produced by
2781                         // arguire qbsp which can produce more than 32768 nodes, any value
2782                         // below count is assumed to be a node number, any other value is
2783                         // assumed to be a leaf number
2784                         p = (unsigned short)LittleShort(in->children[j]);
2785                         if (p < count)
2786                         {
2787                                 if (p < loadmodel->brush.num_nodes)
2788                                         out->children[j] = loadmodel->brush.data_nodes + p;
2789                                 else
2790                                 {
2791                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2792                                         // map it to the solid leaf
2793                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2794                                 }
2795                         }
2796                         else
2797                         {
2798                                 // note this uses 65535 intentionally, -1 is leaf 0
2799                                 p = 65535 - p;
2800                                 if (p < loadmodel->brush.num_leafs)
2801                                         out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2802                                 else
2803                                 {
2804                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2805                                         // map it to the solid leaf
2806                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2807                                 }
2808                         }
2809                 }
2810         }
2811
2812         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2813 }
2814
2815 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2816 {
2817         dleaf_t *in;
2818         mleaf_t *out;
2819         int i, j, count, p;
2820
2821         in = (dleaf_t *)(mod_base + l->fileofs);
2822         if (l->filelen % sizeof(*in))
2823                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2824         count = l->filelen / sizeof(*in);
2825         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2826
2827         loadmodel->brush.data_leafs = out;
2828         loadmodel->brush.num_leafs = count;
2829         // get visleafs from the submodel data
2830         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2831         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2832         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2833         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2834
2835         for ( i=0 ; i<count ; i++, in++, out++)
2836         {
2837                 for (j=0 ; j<3 ; j++)
2838                 {
2839                         out->mins[j] = LittleShort(in->mins[j]);
2840                         out->maxs[j] = LittleShort(in->maxs[j]);
2841                 }
2842
2843                 // FIXME: this function could really benefit from some error checking
2844
2845                 out->contents = LittleLong(in->contents);
2846
2847                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2848                 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2849                 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2850                 {
2851                         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);
2852                         out->firstleafsurface = NULL;
2853                         out->numleafsurfaces = 0;
2854                 }
2855
2856                 out->clusterindex = i - 1;
2857                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2858                         out->clusterindex = -1;
2859
2860                 p = LittleLong(in->visofs);
2861                 // ignore visofs errors on leaf 0 (solid)
2862                 if (p >= 0 && out->clusterindex >= 0)
2863                 {
2864                         if (p >= loadmodel->brushq1.num_compressedpvs)
2865                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2866                         else
2867                                 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);
2868                 }
2869
2870                 for (j = 0;j < 4;j++)
2871                         out->ambient_sound_level[j] = in->ambient_level[j];
2872
2873                 // FIXME: Insert caustics here
2874         }
2875 }
2876
2877 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2878 {
2879         int i, j;
2880         mleaf_t *leaf;
2881         const unsigned char *pvs;
2882         // if there's no vis data, assume supported (because everything is visible all the time)
2883         if (!loadmodel->brush.data_pvsclusters)
2884                 return true;
2885         // check all liquid leafs to see if they can see into empty leafs, if any
2886         // can we can assume this map supports r_wateralpha
2887         for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2888         {
2889                 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2890                 {
2891                         pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2892                         for (j = 0;j < loadmodel->brush.num_leafs;j++)
2893                                 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2894                                         return true;
2895                 }
2896         }
2897         return false;
2898 }
2899
2900 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2901 {
2902         dclipnode_t *in;
2903         mclipnode_t *out;
2904         int                     i, count;
2905         hull_t          *hull;
2906
2907         in = (dclipnode_t *)(mod_base + l->fileofs);
2908         if (l->filelen % sizeof(*in))
2909                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2910         count = l->filelen / sizeof(*in);
2911         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2912
2913         loadmodel->brushq1.clipnodes = out;
2914         loadmodel->brushq1.numclipnodes = count;
2915
2916         for (i = 1; i < MAX_MAP_HULLS; i++)
2917         {
2918                 hull = &loadmodel->brushq1.hulls[i];
2919                 hull->clipnodes = out;
2920                 hull->firstclipnode = 0;
2921                 hull->lastclipnode = count-1;
2922                 hull->planes = loadmodel->brush.data_planes;
2923                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2924                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2925                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2926                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2927                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2928                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2929                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2930         }
2931
2932         for (i=0 ; i<count ; i++, out++, in++)
2933         {
2934                 out->planenum = LittleLong(in->planenum);
2935                 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2936                 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2937                 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2938                 if (out->children[0] >= count)
2939                         out->children[0] -= 65536;
2940                 if (out->children[1] >= count)
2941                         out->children[1] -= 65536;
2942                 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2943                         Host_Error("Corrupt clipping hull(out of range planenum)");
2944         }
2945 }
2946
2947 //Duplicate the drawing hull structure as a clipping hull
2948 static void Mod_Q1BSP_MakeHull0(void)
2949 {
2950         mnode_t         *in;
2951         mclipnode_t *out;
2952         int                     i;
2953         hull_t          *hull;
2954
2955         hull = &loadmodel->brushq1.hulls[0];
2956
2957         in = loadmodel->brush.data_nodes;
2958         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2959
2960         hull->clipnodes = out;
2961         hull->firstclipnode = 0;
2962         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2963         hull->planes = loadmodel->brush.data_planes;
2964
2965         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2966         {
2967                 out->planenum = in->plane - loadmodel->brush.data_planes;
2968                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2969                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2970         }
2971 }
2972
2973 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2974 {
2975         int i, j;
2976         short *in;
2977
2978         in = (short *)(mod_base + l->fileofs);
2979         if (l->filelen % sizeof(*in))
2980                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2981         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2982         loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2983
2984         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2985         {
2986                 j = (unsigned short) LittleShort(in[i]);
2987                 if (j >= loadmodel->num_surfaces)
2988                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2989                 loadmodel->brush.data_leafsurfaces[i] = j;
2990         }
2991 }
2992
2993 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2994 {
2995         int             i;
2996         int             *in;
2997
2998         in = (int *)(mod_base + l->fileofs);
2999         if (l->filelen % sizeof(*in))
3000                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
3001         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
3002         loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
3003
3004         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
3005                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
3006 }
3007
3008
3009 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
3010 {
3011         int                     i;
3012         mplane_t        *out;
3013         dplane_t        *in;
3014
3015         in = (dplane_t *)(mod_base + l->fileofs);
3016         if (l->filelen % sizeof(*in))
3017                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
3018
3019         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
3020         loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
3021
3022         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
3023         {
3024                 out->normal[0] = LittleFloat(in->normal[0]);
3025                 out->normal[1] = LittleFloat(in->normal[1]);
3026                 out->normal[2] = LittleFloat(in->normal[2]);
3027                 out->dist = LittleFloat(in->dist);
3028
3029                 PlaneClassify(out);
3030         }
3031 }
3032
3033 static void Mod_Q1BSP_LoadMapBrushes(void)
3034 {
3035 #if 0
3036 // unfinished
3037         int submodel, numbrushes;
3038         qboolean firstbrush;
3039         char *text, *maptext;
3040         char mapfilename[MAX_QPATH];
3041         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
3042         strlcat (mapfilename, ".map", sizeof (mapfilename));
3043         maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
3044         if (!maptext)
3045                 return;
3046         text = maptext;
3047         if (!COM_ParseToken_Simple(&data, false, false))
3048                 return; // error
3049         submodel = 0;
3050         for (;;)
3051         {
3052                 if (!COM_ParseToken_Simple(&data, false, false))
3053                         break;
3054                 if (com_token[0] != '{')
3055                         return; // error
3056                 // entity
3057                 firstbrush = true;
3058                 numbrushes = 0;
3059                 maxbrushes = 256;
3060                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
3061                 for (;;)
3062                 {
3063                         if (!COM_ParseToken_Simple(&data, false, false))
3064                                 return; // error
3065                         if (com_token[0] == '}')
3066                                 break; // end of entity
3067                         if (com_token[0] == '{')
3068                         {
3069                                 // brush
3070                                 if (firstbrush)
3071                                 {
3072                                         if (submodel)
3073                                         {
3074                                                 if (submodel > loadmodel->brush.numsubmodels)
3075                                                 {
3076                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
3077                                                         model = NULL;
3078                                                 }
3079                                                 else
3080                                                         model = loadmodel->brush.submodels[submodel];
3081                                         }
3082                                         else
3083                                                 model = loadmodel;
3084                                 }
3085                                 for (;;)
3086                                 {
3087                                         if (!COM_ParseToken_Simple(&data, false, false))
3088                                                 return; // error
3089                                         if (com_token[0] == '}')
3090                                                 break; // end of brush
3091                                         // each brush face should be this format:
3092                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
3093                                         // FIXME: support hl .map format
3094                                         for (pointnum = 0;pointnum < 3;pointnum++)
3095                                         {
3096                                                 COM_ParseToken_Simple(&data, false, false);
3097                                                 for (componentnum = 0;componentnum < 3;componentnum++)
3098                                                 {
3099                                                         COM_ParseToken_Simple(&data, false, false);
3100                                                         point[pointnum][componentnum] = atof(com_token);
3101                                                 }
3102                                                 COM_ParseToken_Simple(&data, false, false);
3103                                         }
3104                                         COM_ParseToken_Simple(&data, false, false);
3105                                         strlcpy(facetexture, com_token, sizeof(facetexture));
3106                                         COM_ParseToken_Simple(&data, false, false);
3107                                         //scroll_s = atof(com_token);
3108                                         COM_ParseToken_Simple(&data, false, false);
3109                                         //scroll_t = atof(com_token);
3110                                         COM_ParseToken_Simple(&data, false, false);
3111                                         //rotate = atof(com_token);
3112                                         COM_ParseToken_Simple(&data, false, false);
3113                                         //scale_s = atof(com_token);
3114                                         COM_ParseToken_Simple(&data, false, false);
3115                                         //scale_t = atof(com_token);
3116                                         TriangleNormal(point[0], point[1], point[2], planenormal);
3117                                         VectorNormalizeDouble(planenormal);
3118                                         planedist = DotProduct(point[0], planenormal);
3119                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
3120                                 }
3121                                 continue;
3122                         }
3123                 }
3124         }
3125 #endif
3126 }
3127
3128
3129 #define MAX_PORTALPOINTS 64
3130
3131 typedef struct portal_s
3132 {
3133         mplane_t plane;
3134         mnode_t *nodes[2];              // [0] = front side of plane
3135         struct portal_s *next[2];
3136         int numpoints;
3137         double points[3*MAX_PORTALPOINTS];
3138         struct portal_s *chain; // all portals are linked into a list
3139 }
3140 portal_t;
3141
3142 static memexpandablearray_t portalarray;
3143
3144 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
3145 {
3146         // process only nodes (leafs already had their box calculated)
3147         if (!node->plane)
3148                 return;
3149
3150         // calculate children first
3151         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
3152         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
3153
3154         // make combined bounding box from children
3155         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
3156         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
3157         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
3158         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
3159         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
3160         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
3161 }
3162
3163 static void Mod_Q1BSP_FinalizePortals(void)
3164 {
3165         int i, j, numportals, numpoints, portalindex, portalrange = Mem_ExpandableArray_IndexRange(&portalarray);
3166         portal_t *p;
3167         mportal_t *portal;
3168         mvertex_t *point;
3169         mleaf_t *leaf, *endleaf;
3170
3171         // tally up portal and point counts and recalculate bounding boxes for all
3172         // leafs (because qbsp is very sloppy)
3173         leaf = loadmodel->brush.data_leafs;
3174         endleaf = leaf + loadmodel->brush.num_leafs;
3175         if (mod_recalculatenodeboxes.integer)
3176         {
3177                 for (;leaf < endleaf;leaf++)
3178                 {
3179                         VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
3180                         VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3181                 }
3182         }
3183         numportals = 0;
3184         numpoints = 0;
3185         for (portalindex = 0;portalindex < portalrange;portalindex++)
3186         {
3187                 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3188                 if (!p)
3189                         continue;
3190                 // note: this check must match the one below or it will usually corrupt memory
3191                 // 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
3192                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3193                 {
3194                         numportals += 2;
3195                         numpoints += p->numpoints * 2;
3196                 }
3197         }
3198         loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3199         loadmodel->brush.num_portals = numportals;
3200         loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3201         loadmodel->brush.num_portalpoints = numpoints;
3202         // clear all leaf portal chains
3203         for (i = 0;i < loadmodel->brush.num_leafs;i++)
3204                 loadmodel->brush.data_leafs[i].portals = NULL;
3205         // process all portals in the global portal chain, while freeing them
3206         portal = loadmodel->brush.data_portals;
3207         point = loadmodel->brush.data_portalpoints;
3208         for (portalindex = 0;portalindex < portalrange;portalindex++)
3209         {
3210                 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3211                 if (!p)
3212                         continue;
3213                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3214                 {
3215                         // note: this check must match the one above or it will usually corrupt memory
3216                         // 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
3217                         if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3218                         {
3219                                 // first make the back to front portal(forward portal)
3220                                 portal->points = point;
3221                                 portal->numpoints = p->numpoints;
3222                                 portal->plane.dist = p->plane.dist;
3223                                 VectorCopy(p->plane.normal, portal->plane.normal);
3224                                 portal->here = (mleaf_t *)p->nodes[1];
3225                                 portal->past = (mleaf_t *)p->nodes[0];
3226                                 // copy points
3227                                 for (j = 0;j < portal->numpoints;j++)
3228                                 {
3229                                         VectorCopy(p->points + j*3, point->position);
3230                                         point++;
3231                                 }
3232                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3233                                 PlaneClassify(&portal->plane);
3234
3235                                 // link into leaf's portal chain
3236                                 portal->next = portal->here->portals;
3237                                 portal->here->portals = portal;
3238
3239                                 // advance to next portal
3240                                 portal++;
3241
3242                                 // then make the front to back portal(backward portal)
3243                                 portal->points = point;
3244                                 portal->numpoints = p->numpoints;
3245                                 portal->plane.dist = -p->plane.dist;
3246                                 VectorNegate(p->plane.normal, portal->plane.normal);
3247                                 portal->here = (mleaf_t *)p->nodes[0];
3248                                 portal->past = (mleaf_t *)p->nodes[1];
3249                                 // copy points
3250                                 for (j = portal->numpoints - 1;j >= 0;j--)
3251                                 {
3252                                         VectorCopy(p->points + j*3, point->position);
3253                                         point++;
3254                                 }
3255                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3256                                 PlaneClassify(&portal->plane);
3257
3258                                 // link into leaf's portal chain
3259                                 portal->next = portal->here->portals;
3260                                 portal->here->portals = portal;
3261
3262                                 // advance to next portal
3263                                 portal++;
3264                         }
3265                         // add the portal's polygon points to the leaf bounding boxes
3266                         if (mod_recalculatenodeboxes.integer)
3267                         {
3268                                 for (i = 0;i < 2;i++)
3269                                 {
3270                                         leaf = (mleaf_t *)p->nodes[i];
3271                                         for (j = 0;j < p->numpoints;j++)
3272                                         {
3273                                                 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3274                                                 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3275                                                 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3276                                                 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3277                                                 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3278                                                 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3279                                         }
3280                                 }
3281                         }
3282                 }
3283         }
3284         // now recalculate the node bounding boxes from the leafs
3285         if (mod_recalculatenodeboxes.integer)
3286                 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3287 }
3288
3289 /*
3290 =============
3291 AddPortalToNodes
3292 =============
3293 */
3294 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3295 {
3296         if (!front)
3297                 Host_Error("AddPortalToNodes: NULL front node");
3298         if (!back)
3299                 Host_Error("AddPortalToNodes: NULL back node");
3300         if (p->nodes[0] || p->nodes[1])
3301                 Host_Error("AddPortalToNodes: already included");
3302         // 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
3303
3304         p->nodes[0] = front;
3305         p->next[0] = (portal_t *)front->portals;
3306         front->portals = (mportal_t *)p;
3307
3308         p->nodes[1] = back;
3309         p->next[1] = (portal_t *)back->portals;
3310         back->portals = (mportal_t *)p;
3311 }
3312
3313 /*
3314 =============
3315 RemovePortalFromNode
3316 =============
3317 */
3318 static void RemovePortalFromNodes(portal_t *portal)
3319 {
3320         int i;
3321         mnode_t *node;
3322         void **portalpointer;
3323         portal_t *t;
3324         for (i = 0;i < 2;i++)
3325         {
3326                 node = portal->nodes[i];
3327
3328                 portalpointer = (void **) &node->portals;
3329                 while (1)
3330                 {
3331                         t = (portal_t *)*portalpointer;
3332                         if (!t)
3333                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
3334
3335                         if (t == portal)
3336                         {
3337                                 if (portal->nodes[0] == node)
3338                                 {
3339                                         *portalpointer = portal->next[0];
3340                                         portal->nodes[0] = NULL;
3341                                 }
3342                                 else if (portal->nodes[1] == node)
3343                                 {
3344                                         *portalpointer = portal->next[1];
3345                                         portal->nodes[1] = NULL;
3346                                 }
3347                                 else
3348                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3349                                 break;
3350                         }
3351
3352                         if (t->nodes[0] == node)
3353                                 portalpointer = (void **) &t->next[0];
3354                         else if (t->nodes[1] == node)
3355                                 portalpointer = (void **) &t->next[1];
3356                         else
3357                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3358                 }
3359         }
3360 }
3361
3362 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3363 static double *portalpointsbuffer;
3364 static int portalpointsbufferoffset;
3365 static int portalpointsbuffersize;
3366 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3367 {
3368         int i, side;
3369         mnode_t *front, *back, *other_node;
3370         mplane_t clipplane, *plane;
3371         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3372         int numfrontpoints, numbackpoints;
3373         double *frontpoints, *backpoints;
3374
3375         // if a leaf, we're done
3376         if (!node->plane)
3377                 return;
3378
3379         // get some space for our clipping operations to use
3380         if (portalpointsbuffersize < portalpointsbufferoffset + 6*MAX_PORTALPOINTS)
3381         {
3382                 portalpointsbuffersize = portalpointsbufferoffset * 2;
3383                 portalpointsbuffer = (double *)Mem_Realloc(loadmodel->mempool, portalpointsbuffer, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3384         }
3385         frontpoints = portalpointsbuffer + portalpointsbufferoffset;
3386         portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3387         backpoints = portalpointsbuffer + portalpointsbufferoffset;
3388         portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3389
3390         plane = node->plane;
3391
3392         front = node->children[0];
3393         back = node->children[1];
3394         if (front == back)
3395                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3396
3397         // create the new portal by generating a polygon for the node plane,
3398         // and clipping it by all of the other portals(which came from nodes above this one)
3399         nodeportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3400         nodeportal->plane = *plane;
3401
3402         // 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)
3403         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);
3404         nodeportal->numpoints = 4;
3405         side = 0;       // shut up compiler warning
3406         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3407         {
3408                 clipplane = portal->plane;
3409                 if (portal->nodes[0] == portal->nodes[1])
3410                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3411                 if (portal->nodes[0] == node)
3412                         side = 0;
3413                 else if (portal->nodes[1] == node)
3414                 {
3415                         clipplane.dist = -clipplane.dist;
3416                         VectorNegate(clipplane.normal, clipplane.normal);
3417                         side = 1;
3418                 }
3419                 else
3420                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3421
3422                 for (i = 0;i < nodeportal->numpoints*3;i++)
3423                         frontpoints[i] = nodeportal->points[i];
3424                 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);
3425                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3426                         break;
3427         }
3428
3429         if (nodeportal->numpoints < 3)
3430         {
3431                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3432                 nodeportal->numpoints = 0;
3433         }
3434         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3435         {
3436                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3437                 nodeportal->numpoints = 0;
3438         }
3439
3440         AddPortalToNodes(nodeportal, front, back);
3441
3442         // split the portals of this node along this node's plane and assign them to the children of this node
3443         // (migrating the portals downward through the tree)
3444         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3445         {
3446                 if (portal->nodes[0] == portal->nodes[1])
3447                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3448                 if (portal->nodes[0] == node)
3449                         side = 0;
3450                 else if (portal->nodes[1] == node)
3451                         side = 1;
3452                 else
3453                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3454                 nextportal = portal->next[side];
3455                 if (!portal->numpoints)
3456                         continue;
3457
3458                 other_node = portal->nodes[!side];
3459                 RemovePortalFromNodes(portal);
3460
3461                 // cut the portal into two portals, one on each side of the node plane
3462                 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);
3463
3464                 if (!numfrontpoints)
3465                 {
3466                         if (side == 0)
3467                                 AddPortalToNodes(portal, back, other_node);
3468                         else
3469                                 AddPortalToNodes(portal, other_node, back);
3470                         continue;
3471                 }
3472                 if (!numbackpoints)
3473                 {
3474                         if (side == 0)
3475                                 AddPortalToNodes(portal, front, other_node);
3476                         else
3477                                 AddPortalToNodes(portal, other_node, front);
3478                         continue;
3479                 }
3480
3481                 // the portal is split
3482                 splitportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3483                 temp = splitportal->chain;
3484                 *splitportal = *portal;
3485                 splitportal->chain = temp;
3486                 for (i = 0;i < numbackpoints*3;i++)
3487                         splitportal->points[i] = backpoints[i];
3488                 splitportal->numpoints = numbackpoints;
3489                 for (i = 0;i < numfrontpoints*3;i++)
3490                         portal->points[i] = frontpoints[i];
3491                 portal->numpoints = numfrontpoints;
3492
3493                 if (side == 0)
3494                 {
3495                         AddPortalToNodes(portal, front, other_node);
3496                         AddPortalToNodes(splitportal, back, other_node);
3497                 }
3498                 else
3499                 {
3500                         AddPortalToNodes(portal, other_node, front);
3501                         AddPortalToNodes(splitportal, other_node, back);
3502                 }
3503         }
3504
3505         Mod_Q1BSP_RecursiveNodePortals(front);
3506         Mod_Q1BSP_RecursiveNodePortals(back);
3507
3508         portalpointsbufferoffset -= 6*MAX_PORTALPOINTS;
3509 }
3510
3511 static void Mod_Q1BSP_MakePortals(void)
3512 {
3513         Mem_ExpandableArray_NewArray(&portalarray, loadmodel->mempool, sizeof(portal_t), 1020*1024/sizeof(portal_t));
3514         portalpointsbufferoffset = 0;
3515         portalpointsbuffersize = 6*MAX_PORTALPOINTS*128;
3516         portalpointsbuffer = (double *)Mem_Alloc(loadmodel->mempool, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3517         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3518         Mem_Free(portalpointsbuffer);
3519         portalpointsbuffer = NULL;
3520         portalpointsbufferoffset = 0;
3521         portalpointsbuffersize = 0;
3522         Mod_Q1BSP_FinalizePortals();
3523         Mem_ExpandableArray_FreeArray(&portalarray);
3524 }
3525
3526 //Returns PVS data for a given point
3527 //(note: can return NULL)
3528 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3529 {
3530         mnode_t *node;
3531         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3532         while (node->plane)
3533                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3534         if (((mleaf_t *)node)->clusterindex >= 0)
3535                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3536         else
3537                 return NULL;
3538 }
3539
3540 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)
3541 {
3542         while (node->plane)
3543         {
3544                 float d = PlaneDiff(org, node->plane);
3545                 if (d > radius)
3546                         node = node->children[0];
3547                 else if (d < -radius)
3548                         node = node->children[1];
3549                 else
3550                 {
3551                         // go down both sides
3552                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3553                         node = node->children[1];
3554                 }
3555         }
3556         // if this leaf is in a cluster, accumulate the pvs bits
3557         if (((mleaf_t *)node)->clusterindex >= 0)
3558         {
3559                 int i;
3560                 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3561                 for (i = 0;i < pvsbytes;i++)
3562                         pvsbuffer[i] |= pvs[i];
3563         }
3564 }
3565
3566 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3567 //of the given point.
3568 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3569 {
3570         int bytes = model->brush.num_pvsclusterbytes;
3571         bytes = min(bytes, pvsbufferlength);
3572         if (r_novis.integer || r_trippy.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3573         {
3574                 memset(pvsbuffer, 0xFF, bytes);
3575                 return bytes;
3576         }
3577         if (!merge)
3578                 memset(pvsbuffer, 0, bytes);
3579         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3580         return bytes;
3581 }
3582
3583 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3584 {
3585         vec3_t size;
3586         const hull_t *hull;
3587
3588         VectorSubtract(inmaxs, inmins, size);
3589         if (cmodel->brush.ishlbsp)
3590         {
3591                 if (size[0] < 3)
3592                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3593                 else if (size[0] <= 32)
3594                 {
3595                         if (size[2] < 54) // pick the nearest of 36 or 72
3596                                 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3597                         else
3598                                 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3599                 }
3600                 else
3601                         hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3602         }
3603         else
3604         {
3605                 if (size[0] < 3)
3606                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3607                 else if (size[0] <= 32)
3608                         hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3609                 else
3610                         hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3611         }
3612         VectorCopy(inmins, outmins);
3613         VectorAdd(inmins, hull->clip_size, outmaxs);
3614 }
3615
3616 static int Mod_Q1BSP_CreateShadowMesh(dp_model_t *mod)
3617 {
3618         int j;
3619         int numshadowmeshtriangles = 0;
3620         msurface_t *surface;
3621         if (cls.state == ca_dedicated)
3622                 return 0;
3623         // make a single combined shadow mesh to allow optimized shadow volume creation
3624
3625         for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3626         {
3627                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3628                 numshadowmeshtriangles += surface->num_triangles;
3629         }
3630         mod->brush.shadowmesh = Mod_ShadowMesh_Begin(mod->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3631         for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3632                 if (surface->num_triangles > 0)
3633                         Mod_ShadowMesh_AddMesh(mod->mempool, mod->brush.shadowmesh, NULL, NULL, NULL, mod->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (mod->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
3634         mod->brush.shadowmesh = Mod_ShadowMesh_Finish(mod->mempool, mod->brush.shadowmesh, false, r_enableshadowvolumes.integer != 0, false);
3635         if (mod->brush.shadowmesh && mod->brush.shadowmesh->neighbor3i)
3636                 Mod_BuildTriangleNeighbors(mod->brush.shadowmesh->neighbor3i, mod->brush.shadowmesh->element3i, mod->brush.shadowmesh->numtriangles);
3637
3638         return numshadowmeshtriangles;
3639 }
3640
3641 void Mod_CollisionBIH_TraceLineAgainstSurfaces(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask);
3642
3643 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3644 {
3645         int i, j, k;
3646         dheader_t *header;
3647         dmodel_t *bm;
3648         float dist, modelyawradius, modelradius;
3649         msurface_t *surface;
3650         hullinfo_t hullinfo;
3651         int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3652         model_brush_lightstyleinfo_t styleinfo[256];
3653         unsigned char *datapointer;
3654
3655         mod->modeldatatypestring = "Q1BSP";
3656
3657         mod->type = mod_brushq1;
3658
3659         header = (dheader_t *)buffer;
3660
3661         i = LittleLong(header->version);
3662         if (i != BSPVERSION && i != 30)
3663                 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3664         mod->brush.ishlbsp = i == 30;
3665
3666 // fill in hull info
3667         VectorClear (hullinfo.hullsizes[0][0]);
3668         VectorClear (hullinfo.hullsizes[0][1]);
3669         if (mod->brush.ishlbsp)
3670         {
3671                 mod->modeldatatypestring = "HLBSP";
3672
3673                 hullinfo.filehulls = 4;
3674                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3675                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3676                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3677                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3678                 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3679                 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3680         }
3681         else
3682         {
3683                 hullinfo.filehulls = 4;
3684                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3685                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3686                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3687                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3688         }
3689
3690 // read lumps
3691         mod_base = (unsigned char*)buffer;
3692         for (i = 0; i < HEADER_LUMPS; i++)
3693         {
3694                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3695                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3696         }
3697
3698         mod->soundfromcenter = true;
3699         mod->TraceBox = Mod_Q1BSP_TraceBox;
3700         mod->TraceLine = Mod_Q1BSP_TraceLineAgainstSurfaces; // LordHavoc: use the surface-hitting version of TraceLine in all cases
3701         mod->TracePoint = Mod_Q1BSP_TracePoint;
3702         mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3703         mod->TraceLineAgainstSurfaces = Mod_Q1BSP_TraceLineAgainstSurfaces;
3704         mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3705         mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3706         mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3707         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3708         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3709         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3710         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3711         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3712         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3713         mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3714         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3715         mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3716         mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3717         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3718         mod->Draw = R_Q1BSP_Draw;
3719         mod->DrawDepth = R_Q1BSP_DrawDepth;
3720         mod->DrawDebug = R_Q1BSP_DrawDebug;
3721         mod->DrawPrepass = R_Q1BSP_DrawPrepass;
3722         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3723         mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3724         mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3725         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3726         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3727         mod->DrawLight = R_Q1BSP_DrawLight;
3728
3729 // load into heap
3730
3731         mod->brush.qw_md4sum = 0;
3732         mod->brush.qw_md4sum2 = 0;
3733         for (i = 0;i < HEADER_LUMPS;i++)
3734         {
3735                 int temp;
3736                 if (i == LUMP_ENTITIES)
3737                         continue;
3738                 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3739                 mod->brush.qw_md4sum ^= LittleLong(temp);
3740                 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3741                         continue;
3742                 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3743                 mod->brush.qw_md4sum2 ^= LittleLong(temp);
3744         }
3745
3746         Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3747         Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3748         Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3749         Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3750         Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3751         Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3752         Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3753         Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3754         Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3755         Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3756         Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3757         // load submodels before leafs because they contain the number of vis leafs
3758         Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3759         Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3760         Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3761         Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3762
3763         // check if the map supports transparent water rendering
3764         loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3765
3766         if (mod->brushq1.data_compressedpvs)
3767                 Mem_Free(mod->brushq1.data_compressedpvs);
3768         mod->brushq1.data_compressedpvs = NULL;
3769         mod->brushq1.num_compressedpvs = 0;
3770
3771         Mod_Q1BSP_MakeHull0();
3772         if (mod_bsp_portalize.integer)
3773                 Mod_Q1BSP_MakePortals();
3774
3775         mod->numframes = 2;             // regular and alternate animation
3776         mod->numskins = 1;
3777
3778         // make a single combined shadow mesh to allow optimized shadow volume creation
3779         Mod_Q1BSP_CreateShadowMesh(loadmodel);
3780
3781         if (loadmodel->brush.numsubmodels)
3782                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3783
3784         // LordHavoc: to clear the fog around the original quake submodel code, I
3785         // will explain:
3786         // first of all, some background info on the submodels:
3787         // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3788         // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3789         // now the weird for loop itself:
3790         // the loop functions in an odd way, on each iteration it sets up the
3791         // current 'mod' model (which despite the confusing code IS the model of
3792         // the number i), at the end of the loop it duplicates the model to become
3793         // the next submodel, and loops back to set up the new submodel.
3794
3795         // LordHavoc: now the explanation of my sane way (which works identically):
3796         // set up the world model, then on each submodel copy from the world model
3797         // and set up the submodel with the respective model info.
3798         totalstylesurfaces = 0;
3799         totalstyles = 0;
3800         for (i = 0;i < mod->brush.numsubmodels;i++)
3801         {
3802                 memset(stylecounts, 0, sizeof(stylecounts));
3803                 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3804                 {
3805                         surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3806                         for (j = 0;j < MAXLIGHTMAPS;j++)
3807                                 stylecounts[surface->lightmapinfo->styles[j]]++;
3808                 }
3809                 for (k = 0;k < 255;k++)
3810                 {
3811                         totalstyles++;
3812                         if (stylecounts[k])
3813                                 totalstylesurfaces += stylecounts[k];
3814                 }
3815         }
3816         datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3817         for (i = 0;i < mod->brush.numsubmodels;i++)
3818         {
3819                 // LordHavoc: this code was originally at the end of this loop, but
3820                 // has been transformed to something more readable at the start here.
3821
3822                 if (i > 0)
3823                 {
3824                         char name[10];
3825                         // duplicate the basic information
3826                         dpsnprintf(name, sizeof(name), "*%i", i);
3827                         mod = Mod_FindName(name, loadmodel->name);
3828                         // copy the base model to this one
3829                         *mod = *loadmodel;
3830                         // rename the clone back to its proper name
3831                         strlcpy(mod->name, name, sizeof(mod->name));
3832                         mod->brush.parentmodel = loadmodel;
3833                         // textures and memory belong to the main model
3834                         mod->texturepool = NULL;
3835                         mod->mempool = NULL;
3836                         mod->brush.GetPVS = NULL;
3837                         mod->brush.FatPVS = NULL;
3838                         mod->brush.BoxTouchingPVS = NULL;
3839                         mod->brush.BoxTouchingLeafPVS = NULL;
3840                         mod->brush.BoxTouchingVisibleLeafs = NULL;
3841                         mod->brush.FindBoxClusters = NULL;
3842                         mod->brush.LightPoint = NULL;
3843                         mod->brush.AmbientSoundLevelsForPoint = NULL;
3844                 }
3845
3846                 mod->brush.submodel = i;
3847
3848                 if (loadmodel->brush.submodels)
3849                         loadmodel->brush.submodels[i] = mod;
3850
3851                 bm = &mod->brushq1.submodels[i];
3852
3853                 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3854                 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3855                 {
3856                         mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3857                         mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3858                 }
3859
3860                 mod->firstmodelsurface = bm->firstface;
3861                 mod->nummodelsurfaces = bm->numfaces;
3862
3863                 // set node/leaf parents for this submodel
3864                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
3865
3866                 // make the model surface list (used by shadowing/lighting)
3867                 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3868                 Mod_MakeSortedSurfaces(mod);
3869
3870                 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3871                 // (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)
3872                 VectorCopy(bm->mins, mod->normalmins);
3873                 VectorCopy(bm->maxs, mod->normalmaxs);
3874                 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3875                 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3876                 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3877                 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3878                 modelradius = modelyawradius + modelradius * modelradius;
3879                 modelyawradius = sqrt(modelyawradius);
3880                 modelradius = sqrt(modelradius);
3881                 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3882                 mod->yawmins[2] = mod->normalmins[2];
3883                 mod->yawmaxs[0] = mod->yawmaxs[1] =  modelyawradius;
3884                 mod->yawmaxs[2] = mod->normalmaxs[2];
3885                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3886                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] =  modelradius;
3887                 mod->radius = modelradius;
3888                 mod->radius2 = modelradius * modelradius;
3889
3890                 // this gets altered below if sky or water is used
3891                 mod->DrawSky = NULL;
3892                 mod->DrawAddWaterPlanes = NULL;
3893
3894                 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3895                 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3896                 if (mod->nummodelsurfaces)
3897                 {
3898                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3899                                 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3900                                         break;
3901                         if (j < mod->nummodelsurfaces)
3902                                 mod->DrawSky = R_Q1BSP_DrawSky;
3903
3904                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3905                                 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
3906                                         break;
3907                         if (j < mod->nummodelsurfaces)
3908                                 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3909
3910                         // build lightstyle update chains
3911                         // (used to rapidly mark lightmapupdateflags on many surfaces
3912                         // when d_lightstylevalue changes)
3913                         memset(stylecounts, 0, sizeof(stylecounts));
3914                         for (k = 0;k < mod->nummodelsurfaces;k++)
3915                         {
3916                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3917                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3918                                         stylecounts[surface->lightmapinfo->styles[j]]++;
3919                         }
3920                         mod->brushq1.num_lightstyles = 0;
3921                         for (k = 0;k < 255;k++)
3922                         {
3923                                 if (stylecounts[k])
3924                                 {
3925                                         styleinfo[mod->brushq1.num_lightstyles].style = k;
3926                                         styleinfo[mod->brushq1.num_lightstyles].value = 0;
3927                                         styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3928                                         styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3929                                         remapstyles[k] = mod->brushq1.num_lightstyles;
3930                                         mod->brushq1.num_lightstyles++;
3931                                 }
3932                         }
3933                         for (k = 0;k < mod->nummodelsurfaces;k++)
3934                         {
3935                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3936                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3937                                 {
3938                                         if (surface->lightmapinfo->styles[j] != 255)
3939                                         {
3940                                                 int r = remapstyles[surface->lightmapinfo->styles[j]];
3941                                                 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3942                                         }
3943                                 }
3944                         }
3945                         mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3946                         memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3947                 }
3948                 else
3949                 {
3950                         // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3951                         Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3952                 }
3953                 //mod->brushq1.num_visleafs = bm->visleafs;
3954
3955                 // build a Bounding Interval Hierarchy for culling triangles in light rendering
3956                 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
3957
3958                 if (mod_q1bsp_polygoncollisions.integer)
3959                 {
3960                         mod->collision_bih = mod->render_bih;
3961                         // point traces and contents checks still use the bsp tree
3962                         mod->TraceLine = Mod_CollisionBIH_TraceLine;
3963                         mod->TraceBox = Mod_CollisionBIH_TraceBox;
3964                         mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
3965                         mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLineAgainstSurfaces;
3966                 }
3967
3968                 // generate VBOs and other shared data before cloning submodels
3969                 if (i == 0)
3970                 {
3971                         Mod_BuildVBOs();
3972                         Mod_Q1BSP_LoadMapBrushes();
3973                         //Mod_Q1BSP_ProcessLightList();
3974                 }
3975         }
3976
3977         Con_DPrintf("Stats for q1bsp model \"%s\": %i faces, %i nodes, %i leafs, %i visleafs, %i visleafportals, mesh: %i vertices, %i triangles, %i surfaces\n", loadmodel->name, loadmodel->num_surfaces, loadmodel->brush.num_nodes, loadmodel->brush.num_leafs, mod->brush.num_pvsclusters, loadmodel->brush.num_portals, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->num_surfaces);
3978 }
3979
3980 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3981 {
3982 }
3983
3984 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3985 {
3986 /*
3987         d_t *in;
3988         m_t *out;
3989         int i, count;
3990
3991         in = (void *)(mod_base + l->fileofs);
3992         if (l->filelen % sizeof(*in))
3993                 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3994         count = l->filelen / sizeof(*in);
3995         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3996
3997         loadmodel-> = out;
3998         loadmodel->num = count;
3999
4000         for (i = 0;i < count;i++, in++, out++)
4001         {
4002         }
4003 */
4004 }
4005
4006 static void Mod_Q2BSP_LoadVertices(lump_t *l)
4007 {
4008 /*
4009         d_t *in;
4010         m_t *out;
4011         int i, count;
4012
4013         in = (void *)(mod_base + l->fileofs);
4014         if (l->filelen % sizeof(*in))
4015                 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4016         count = l->filelen / sizeof(*in);
4017         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4018
4019         loadmodel-> = out;
4020         loadmodel->num = count;
4021
4022         for (i = 0;i < count;i++, in++, out++)
4023         {
4024         }
4025 */
4026 }
4027
4028 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
4029 {
4030 /*
4031         d_t *in;
4032         m_t *out;
4033         int i, count;
4034
4035         in = (void *)(mod_base + l->fileofs);
4036         if (l->filelen % sizeof(*in))
4037                 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
4038         count = l->filelen / sizeof(*in);
4039         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4040
4041         loadmodel-> = out;
4042         loadmodel->num = count;
4043
4044         for (i = 0;i < count;i++, in++, out++)
4045         {
4046         }
4047 */
4048 }
4049
4050 static void Mod_Q2BSP_LoadNodes(lump_t *l)
4051 {
4052 /*
4053         d_t *in;
4054         m_t *out;
4055         int i, count;
4056
4057         in = (void *)(mod_base + l->fileofs);
4058         if (l->filelen % sizeof(*in))
4059                 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4060         count = l->filelen / sizeof(*in);
4061         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4062
4063         loadmodel-> = out;
4064         loadmodel->num = count;
4065
4066         for (i = 0;i < count;i++, in++, out++)
4067         {
4068         }
4069 */
4070 }
4071
4072 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
4073 {
4074 /*
4075         d_t *in;
4076         m_t *out;
4077         int i, count;
4078
4079         in = (void *)(mod_base + l->fileofs);
4080         if (l->filelen % sizeof(*in))
4081                 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
4082         count = l->filelen / sizeof(*in);
4083         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4084
4085         loadmodel-> = out;
4086         loadmodel->num = count;
4087
4088         for (i = 0;i < count;i++, in++, out++)
4089         {
4090         }
4091 */
4092 }
4093
4094 static void Mod_Q2BSP_LoadFaces(lump_t *l)
4095 {
4096 /*
4097         d_t *in;
4098         m_t *out;
4099         int i, count;
4100
4101         in = (void *)(mod_base + l->fileofs);
4102         if (l->filelen % sizeof(*in))
4103                 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4104         count = l->filelen / sizeof(*in);
4105         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4106
4107         loadmodel-> = out;
4108         loadmodel->num = count;
4109
4110         for (i = 0;i < count;i++, in++, out++)
4111         {
4112         }
4113 */
4114 }
4115
4116 static void Mod_Q2BSP_LoadLighting(lump_t *l)
4117 {
4118 /*
4119         d_t *in;
4120         m_t *out;
4121         int i, count;
4122
4123         in = (void *)(mod_base + l->fileofs);
4124         if (l->filelen % sizeof(*in))
4125                 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
4126         count = l->filelen / sizeof(*in);
4127         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4128
4129         loadmodel-> = out;
4130         loadmodel->num = count;
4131
4132         for (i = 0;i < count;i++, in++, out++)
4133         {
4134         }
4135 */
4136 }
4137
4138 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
4139 {
4140 /*
4141         d_t *in;
4142         m_t *out;
4143         int i, count;
4144
4145         in = (void *)(mod_base + l->fileofs);
4146         if (l->filelen % sizeof(*in))
4147                 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4148         count = l->filelen / sizeof(*in);
4149         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4150
4151         loadmodel-> = out;
4152         loadmodel->num = count;
4153
4154         for (i = 0;i < count;i++, in++, out++)
4155         {
4156         }
4157 */
4158 }
4159
4160 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
4161 {
4162 /*
4163         d_t *in;
4164         m_t *out;
4165         int i, count;
4166
4167         in = (void *)(mod_base + l->fileofs);
4168         if (l->filelen % sizeof(*in))
4169                 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4170         count = l->filelen / sizeof(*in);
4171         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4172
4173         loadmodel-> = out;
4174         loadmodel->num = count;
4175
4176         for (i = 0;i < count;i++, in++, out++)
4177         {
4178         }
4179 */
4180 }
4181
4182 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
4183 {
4184 /*
4185         d_t *in;
4186         m_t *out;
4187         int i, count;
4188
4189         in = (void *)(mod_base + l->fileofs);
4190         if (l->filelen % sizeof(*in))
4191                 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4192         count = l->filelen / sizeof(*in);
4193         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4194
4195         loadmodel-> = out;
4196         loadmodel->num = count;
4197
4198         for (i = 0;i < count;i++, in++, out++)
4199         {
4200         }
4201 */
4202 }
4203
4204 static void Mod_Q2BSP_LoadEdges(lump_t *l)
4205 {
4206 /*
4207         d_t *in;
4208         m_t *out;
4209         int i, count;
4210
4211         in = (void *)(mod_base + l->fileofs);
4212         if (l->filelen % sizeof(*in))
4213                 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
4214         count = l->filelen / sizeof(*in);
4215         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4216
4217         loadmodel-> = out;
4218         loadmodel->num = count;
4219
4220         for (i = 0;i < count;i++, in++, out++)
4221         {
4222         }
4223 */
4224 }
4225
4226 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
4227 {
4228 /*
4229         d_t *in;
4230         m_t *out;
4231         int i, count;
4232
4233         in = (void *)(mod_base + l->fileofs);
4234         if (l->filelen % sizeof(*in))
4235                 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
4236         count = l->filelen / sizeof(*in);
4237         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4238
4239         loadmodel-> = out;
4240         loadmodel->num = count;
4241
4242         for (i = 0;i < count;i++, in++, out++)
4243         {
4244         }
4245 */
4246 }
4247
4248 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4249 {
4250 /*
4251         d_t *in;
4252         m_t *out;
4253         int i, count;
4254
4255         in = (void *)(mod_base + l->fileofs);
4256         if (l->filelen % sizeof(*in))
4257                 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4258         count = l->filelen / sizeof(*in);
4259         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4260
4261         loadmodel-> = out;
4262         loadmodel->num = count;
4263
4264         for (i = 0;i < count;i++, in++, out++)
4265         {
4266         }
4267 */
4268 }
4269
4270 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4271 {
4272 /*
4273         d_t *in;
4274         m_t *out;
4275         int i, count;
4276
4277         in = (void *)(mod_base + l->fileofs);
4278         if (l->filelen % sizeof(*in))
4279                 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4280         count = l->filelen / sizeof(*in);
4281         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4282
4283         loadmodel-> = out;
4284         loadmodel->num = count;
4285
4286         for (i = 0;i < count;i++, in++, out++)
4287         {
4288         }
4289 */
4290 }
4291
4292 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4293 {
4294 /*
4295         d_t *in;
4296         m_t *out;
4297         int i, count;
4298
4299         in = (void *)(mod_base + l->fileofs);
4300         if (l->filelen % sizeof(*in))
4301                 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4302         count = l->filelen / sizeof(*in);
4303         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4304
4305         loadmodel-> = out;
4306         loadmodel->num = count;
4307
4308         for (i = 0;i < count;i++, in++, out++)
4309         {
4310         }
4311 */
4312 }
4313
4314 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4315 {
4316 /*
4317         d_t *in;
4318         m_t *out;
4319         int i, count;
4320
4321         in = (void *)(mod_base + l->fileofs);
4322         if (l->filelen % sizeof(*in))
4323                 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4324         count = l->filelen / sizeof(*in);
4325         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4326
4327         loadmodel-> = out;
4328         loadmodel->num = count;
4329
4330         for (i = 0;i < count;i++, in++, out++)
4331         {
4332         }
4333 */
4334 }
4335
4336 static void Mod_Q2BSP_LoadModels(lump_t *l)
4337 {
4338 /*
4339         d_t *in;
4340         m_t *out;
4341         int i, count;
4342
4343         in = (void *)(mod_base + l->fileofs);
4344         if (l->filelen % sizeof(*in))
4345                 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4346         count = l->filelen / sizeof(*in);
4347         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4348
4349         loadmodel-> = out;
4350         loadmodel->num = count;
4351
4352         for (i = 0;i < count;i++, in++, out++)
4353         {
4354         }
4355 */
4356 }
4357
4358 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4359 {
4360         int i;
4361         q2dheader_t *header;
4362
4363         Host_Error("Mod_Q2BSP_Load: not yet implemented");
4364
4365         mod->modeldatatypestring = "Q2BSP";
4366
4367         mod->type = mod_brushq2;
4368
4369         header = (q2dheader_t *)buffer;
4370
4371         i = LittleLong(header->version);
4372         if (i != Q2BSPVERSION)
4373                 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4374
4375         mod_base = (unsigned char *)header;
4376
4377         // swap all the lumps
4378         for (i = 0;i < (int) sizeof(*header) / 4;i++)
4379                 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4380
4381         mod->brush.qw_md4sum = 0;
4382         mod->brush.qw_md4sum2 = 0;
4383         for (i = 0;i < Q2HEADER_LUMPS;i++)
4384         {
4385                 if (i == Q2LUMP_ENTITIES)
4386                         continue;
4387                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4388                 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4389                         continue;
4390                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4391         }
4392
4393         Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4394         Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4395         Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4396         Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4397         Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4398         Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4399         Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4400         Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4401         Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4402         Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4403         Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4404         Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4405         Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4406         Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4407         Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4408         Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4409         Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4410         // LordHavoc: must go last because this makes the submodels
4411         Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4412 }
4413
4414 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4415 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4416
4417 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4418 {
4419         const char *data;
4420         char key[128], value[MAX_INPUTLINE];
4421         float v[3];
4422         loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4423         loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4424         loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4425         if (!l->filelen)
4426                 return;
4427         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4428         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4429         loadmodel->brush.entities[l->filelen] = 0;
4430         data = loadmodel->brush.entities;
4431         // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4432         // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
4433         loadmodel->brushq3.deluxemapping = false;
4434         if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4435         {
4436                 while (1)
4437                 {
4438                         if (!COM_ParseToken_Simple(&data, false, false))
4439                                 break; // error
4440                         if (com_token[0] == '}')
4441                                 break; // end of worldspawn
4442                         if (com_token[0] == '_')
4443                                 strlcpy(key, com_token + 1, sizeof(key));
4444                         else
4445                                 strlcpy(key, com_token, sizeof(key));
4446                         while (key[strlen(key)-1] == ' ') // remove trailing spaces
4447                                 key[strlen(key)-1] = 0;
4448                         if (!COM_ParseToken_Simple(&data, false, false))
4449                                 break; // error
4450                         strlcpy(value, com_token, sizeof(value));
4451                         if (!strcasecmp("gridsize", key)) // this one is case insensitive to 100% match q3map2
4452                         {
4453 #if _MSC_VER >= 1400
4454 #define sscanf sscanf_s
4455 #endif
4456 #if 0
4457                                 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4458                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4459 #else
4460                                 VectorSet(v, 64, 64, 128);
4461                                 if(sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) != 3)
4462                                         Con_Printf("Mod_Q3BSP_LoadEntities: funny gridsize \"%s\" in %s, interpreting as \"%f %f %f\" to match q3map2's parsing\n", value, loadmodel->name, v[0], v[1], v[2]);
4463                                 if (v[0] != 0 && v[1] != 0 && v[2] != 0)
4464                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4465 #endif
4466                         }
4467                         else if (!strcmp("deluxeMaps", key))
4468                         {
4469                                 if (!strcmp(com_token, "1"))
4470                                 {
4471                                         loadmodel->brushq3.deluxemapping = true;
4472                                         loadmodel->brushq3.deluxemapping_modelspace = true;
4473                                 }
4474                                 else if (!strcmp(com_token, "2"))
4475                                 {
4476                                         loadmodel->brushq3.deluxemapping = true;
4477                                         loadmodel->brushq3.deluxemapping_modelspace = false;
4478                                 }
4479                         }
4480                 }
4481         }
4482 }
4483
4484 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4485 {
4486         q3dtexture_t *in;
4487         texture_t *out;
4488         int i, count;
4489
4490         in = (q3dtexture_t *)(mod_base + l->fileofs);
4491         if (l->filelen % sizeof(*in))
4492                 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4493         count = l->filelen / sizeof(*in);
4494         out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4495
4496         loadmodel->data_textures = out;
4497         loadmodel->num_textures = count;
4498         loadmodel->num_texturesperskin = loadmodel->num_textures;
4499
4500         for (i = 0;i < count;i++)
4501         {
4502                 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4503                 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4504                 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4505                 Mod_LoadTextureFromQ3Shader(out + i, out[i].name, true, true, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS);
4506                 // restore the surfaceflags and supercontents
4507                 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4508                 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4509         }
4510 }
4511
4512 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4513 {
4514         q3dplane_t *in;
4515         mplane_t *out;
4516         int i, count;
4517
4518         in = (q3dplane_t *)(mod_base + l->fileofs);
4519         if (l->filelen % sizeof(*in))
4520                 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4521         count = l->filelen / sizeof(*in);
4522         out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4523
4524         loadmodel->brush.data_planes = out;
4525         loadmodel->brush.num_planes = count;
4526
4527         for (i = 0;i < count;i++, in++, out++)
4528         {
4529                 out->normal[0] = LittleFloat(in->normal[0]);
4530                 out->normal[1] = LittleFloat(in->normal[1]);
4531                 out->normal[2] = LittleFloat(in->normal[2]);
4532                 out->dist = LittleFloat(in->dist);
4533                 PlaneClassify(out);
4534         }
4535 }
4536
4537 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4538 {
4539         q3dbrushside_t *in;
4540         q3mbrushside_t *out;
4541         int i, n, count;
4542
4543         in = (q3dbrushside_t *)(mod_base + l->fileofs);
4544         if (l->filelen % sizeof(*in))
4545                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4546         count = l->filelen / sizeof(*in);
4547         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4548
4549         loadmodel->brush.data_brushsides = out;
4550         loadmodel->brush.num_brushsides = count;
4551
4552         for (i = 0;i < count;i++, in++, out++)
4553         {
4554                 n = LittleLong(in->planeindex);
4555                 if (n < 0 || n >= loadmodel->brush.num_planes)
4556                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4557                 out->plane = loadmodel->brush.data_planes + n;
4558                 n = LittleLong(in->textureindex);
4559                 if (n < 0 || n >= loadmodel->num_textures)
4560                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4561                 out->texture = loadmodel->data_textures + n;
4562         }
4563 }
4564
4565 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4566 {
4567         q3dbrushside_ig_t *in;
4568         q3mbrushside_t *out;
4569         int i, n, count;
4570
4571         in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4572         if (l->filelen % sizeof(*in))
4573                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4574         count = l->filelen / sizeof(*in);
4575         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4576
4577         loadmodel->brush.data_brushsides = out;
4578         loadmodel->brush.num_brushsides = count;
4579
4580         for (i = 0;i < count;i++, in++, out++)
4581         {
4582                 n = LittleLong(in->planeindex);
4583                 if (n < 0 || n >= loadmodel->brush.num_planes)
4584                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4585                 out->plane = loadmodel->brush.data_planes + n;
4586                 n = LittleLong(in->textureindex);
4587                 if (n < 0 || n >= loadmodel->num_textures)
4588                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4589                 out->texture = loadmodel->data_textures + n;
4590         }
4591 }
4592
4593 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4594 {
4595         q3dbrush_t *in;
4596         q3mbrush_t *out;
4597         int i, j, n, c, count, maxplanes, q3surfaceflags;
4598         colplanef_t *planes;
4599
4600         in = (q3dbrush_t *)(mod_base + l->fileofs);
4601         if (l->filelen % sizeof(*in))
4602                 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4603         count = l->filelen / sizeof(*in);
4604         out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4605
4606         loadmodel->brush.data_brushes = out;
4607         loadmodel->brush.num_brushes = count;
4608
4609         maxplanes = 0;
4610         planes = NULL;
4611
4612         for (i = 0;i < count;i++, in++, out++)
4613         {
4614                 n = LittleLong(in->firstbrushside);
4615                 c = LittleLong(in->numbrushsides);
4616                 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4617                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4618                 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4619                 out->numbrushsides = c;
4620                 n = LittleLong(in->textureindex);
4621                 if (n < 0 || n >= loadmodel->num_textures)
4622                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4623                 out->texture = loadmodel->data_textures + n;
4624
4625                 // make a list of mplane_t structs to construct a colbrush from
4626                 if (maxplanes < out->numbrushsides)
4627                 {
4628                         maxplanes = out->numbrushsides;
4629                         if (planes)
4630                                 Mem_Free(planes);
4631                         planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4632                 }
4633                 q3surfaceflags = 0;
4634                 for (j = 0;j < out->numbrushsides;j++)
4635                 {
4636                         VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4637                         planes[j].dist = out->firstbrushside[j].plane->dist;
4638                         planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4639                         planes[j].texture = out->firstbrushside[j].texture;
4640                         q3surfaceflags |= planes[j].q3surfaceflags;
4641                 }
4642                 // make the colbrush from the planes
4643                 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4644
4645                 // this whole loop can take a while (e.g. on redstarrepublic4)
4646                 CL_KeepaliveMessage(false);
4647         }
4648         if (planes)
4649                 Mem_Free(planes);
4650 }
4651
4652 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4653 {
4654         q3deffect_t *in;
4655         q3deffect_t *out;
4656         int i, n, count;
4657
4658         in = (q3deffect_t *)(mod_base + l->fileofs);
4659         if (l->filelen % sizeof(*in))
4660                 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4661         count = l->filelen / sizeof(*in);
4662         out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4663
4664         loadmodel->brushq3.data_effects = out;
4665         loadmodel->brushq3.num_effects = count;
4666
4667         for (i = 0;i < count;i++, in++, out++)
4668         {
4669                 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4670                 n = LittleLong(in->brushindex);
4671                 if (n >= loadmodel->brush.num_brushes)
4672                 {
4673                         Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4674                         n = -1;
4675                 }
4676                 out->brushindex = n;
4677                 out->unknown = LittleLong(in->unknown);
4678         }
4679 }
4680
4681 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4682 {
4683         q3dvertex_t *in;
4684         int i, count;
4685
4686         in = (q3dvertex_t *)(mod_base + l->fileofs);
4687         if (l->filelen % sizeof(*in))
4688                 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4689         loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4690         loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4691         loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4692         loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4693         loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4694         loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4695
4696         for (i = 0;i < count;i++, in++)
4697         {
4698                 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4699                 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4700                 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4701                 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4702                 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4703                 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4704                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4705                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4706                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4707                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4708                 // svector/tvector are calculated later in face loading
4709                 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4710                 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4711                 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4712                 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4713                 if(in->color4ub[0] != 255 || in->color4ub[1] != 255 || in->color4ub[2] != 255)
4714                         loadmodel->lit = true;
4715         }
4716 }
4717
4718 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4719 {
4720         int *in;
4721         int *out;
4722         int i, count;
4723
4724         in = (int *)(mod_base + l->fileofs);
4725         if (l->filelen % sizeof(int[3]))
4726                 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4727         count = l->filelen / sizeof(*in);
4728
4729         if(!loadmodel->brushq3.num_vertices)
4730         {
4731                 if (count)
4732                         Con_Printf("Mod_Q3BSP_LoadTriangles: %s has triangles but no vertexes, broken compiler, ignoring problem\n", loadmodel->name);
4733                 loadmodel->brushq3.num_triangles = 0;
4734                 return;
4735         }
4736
4737         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4738         loadmodel->brushq3.num_triangles = count / 3;
4739         loadmodel->brushq3.data_element3i = out;
4740
4741         for (i = 0;i < count;i++, in++, out++)
4742         {
4743                 *out = LittleLong(*in);
4744                 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4745                 {
4746                         Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4747                         *out = 0;
4748                 }
4749         }
4750 }
4751
4752 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4753 {
4754         q3dlightmap_t *input_pointer;
4755         int i;
4756         int j;
4757         int k;
4758         int count;
4759         int powerx;
4760         int powery;
4761         int powerxy;
4762         int powerdxy;
4763         int endlightmap;
4764         int mergegoal;
4765         int lightmapindex;
4766         int realcount;
4767         int realindex;
4768         int mergedwidth;
4769         int mergedheight;
4770         int mergedcolumns;
4771         int mergedrows;
4772         int mergedrowsxcolumns;
4773         int size;
4774         int bytesperpixel;
4775         int rgbmap[3];
4776         unsigned char *c;
4777         unsigned char *mergedpixels;
4778         unsigned char *mergeddeluxepixels;
4779         unsigned char *mergebuf;
4780         char mapname[MAX_QPATH];
4781         qboolean external;
4782         unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4783
4784         // defaults for q3bsp
4785         size = 128;
4786         bytesperpixel = 3;
4787         rgbmap[0] = 2;
4788         rgbmap[1] = 1;
4789         rgbmap[2] = 0;
4790         external = false;
4791         loadmodel->brushq3.lightmapsize = 128;
4792
4793         if (cls.state == ca_dedicated)
4794                 return;
4795
4796         if(mod_q3bsp_nolightmaps.integer)
4797         {
4798                 return;
4799         }
4800         else if(l->filelen)
4801         {
4802                 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4803                 if (developer_loading.integer)
4804                         Con_Printf("Using internal lightmaps\n");
4805                 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4806                 if (l->filelen % sizeof(*input_pointer))
4807                         Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4808                 count = l->filelen / sizeof(*input_pointer);
4809                 for(i = 0; i < count; ++i)
4810                         inpixels[i] = input_pointer[i].rgb;
4811         }
4812         else
4813         {
4814                 // no internal lightmaps
4815                 // try external lightmaps
4816                 if (developer_loading.integer)
4817                         Con_Printf("Using external lightmaps\n");
4818                 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4819                 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false, false, NULL);
4820                 if(!inpixels[0])
4821                         return;
4822
4823                 // using EXTERNAL lightmaps instead
4824                 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4825                 {
4826                         Mem_Free(inpixels[0]);
4827                         Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4828                 }
4829
4830                 size = image_width;
4831                 bytesperpixel = 4;
4832                 rgbmap[0] = 0;
4833                 rgbmap[1] = 1;
4834                 rgbmap[2] = 2;
4835                 external = true;
4836
4837                 for(count = 1; ; ++count)
4838                 {
4839                         inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false, false, NULL);
4840                         if(!inpixels[count])
4841                                 break; // we got all of them
4842                         if(image_width != size || image_height != size)
4843                         {
4844                                 Mem_Free(inpixels[count]);
4845                                 inpixels[count] = NULL;
4846                                 Con_Printf("Mod_Q3BSP_LoadLightmaps: mismatched lightmap size in %s - external lightmap %s/lm_%04d does not match earlier ones\n", loadmodel->name, mapname, count);
4847                                 break;
4848                         }
4849                 }
4850         }
4851
4852         loadmodel->brushq3.lightmapsize = size;
4853         loadmodel->brushq3.num_originallightmaps = count;
4854
4855         // now check the surfaces to see if any of them index an odd numbered
4856         // lightmap, if so this is not a deluxemapped bsp file
4857         //
4858         // also check what lightmaps are actually used, because q3map2 sometimes
4859         // (always?) makes an unused one at the end, which
4860         // q3map2 sometimes (or always?) makes a second blank lightmap for no
4861         // reason when only one lightmap is used, which can throw off the
4862         // deluxemapping detection method, so check 2-lightmap bsp's specifically
4863         // to see if the second lightmap is blank, if so it is not deluxemapped.
4864         // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
4865         // in Mod_Q3BSP_LoadEntities was failed
4866         if (!loadmodel->brushq3.deluxemapping)
4867         {
4868                 loadmodel->brushq3.deluxemapping = !(count & 1);
4869                 loadmodel->brushq3.deluxemapping_modelspace = true;
4870                 endlightmap = 0;
4871                 if (loadmodel->brushq3.deluxemapping)
4872                 {
4873                         int facecount = faceslump->filelen / sizeof(q3dface_t);
4874                         q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4875                         for (i = 0;i < facecount;i++)
4876                         {
4877                                 j = LittleLong(faces[i].lightmapindex);
4878                                 if (j >= 0)
4879                                 {
4880                                         endlightmap = max(endlightmap, j + 1);
4881                                         if ((j & 1) || j + 1 >= count)
4882                                         {
4883                                                 loadmodel->brushq3.deluxemapping = false;
4884                                                 break;
4885                                         }
4886                                 }
4887                         }
4888                 }
4889
4890                 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4891                 // reason when only one lightmap is used, which can throw off the
4892                 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4893                 // to see if the second lightmap is blank, if so it is not deluxemapped.
4894                 //
4895                 // further research has shown q3map2 sometimes creates a deluxemap and two
4896                 // blank lightmaps, which must be handled properly as well
4897                 if (endlightmap == 1 && count > 1)
4898                 {
4899                         c = inpixels[1];
4900                         for (i = 0;i < size*size;i++)
4901                         {
4902                                 if (c[bytesperpixel*i + rgbmap[0]])
4903                                         break;
4904                                 if (c[bytesperpixel*i + rgbmap[1]])
4905                                         break;
4906                                 if (c[bytesperpixel*i + rgbmap[2]])
4907                                         break;
4908                         }
4909                         if (i == size*size)
4910                         {
4911                                 // all pixels in the unused lightmap were black...
4912                                 loadmodel->brushq3.deluxemapping = false;
4913                         }
4914                 }
4915         }
4916
4917         Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4918
4919         // figure out what the most reasonable merge power is within limits
4920
4921         // find the appropriate NxN dimensions to merge to, to avoid wasted space
4922         realcount = count >> (int)loadmodel->brushq3.deluxemapping;
4923
4924         // figure out how big the merged texture has to be
4925         mergegoal = 128<<bound(0, mod_q3bsp_lightmapmergepower.integer, 6);
4926         mergegoal = bound(size, mergegoal, (int)vid.maxtexturesize_2d);
4927         while (mergegoal > size && mergegoal * mergegoal / 4 >= size * size * realcount)
4928                 mergegoal /= 2;
4929         mergedwidth = mergegoal;
4930         mergedheight = mergegoal;
4931         // choose non-square size (2x1 aspect) if only half the space is used;
4932         // this really only happens when the entire set fits in one texture, if
4933         // there are multiple textures, we don't worry about shrinking the last
4934         // one to fit, because the driver prefers the same texture size on
4935         // consecutive draw calls...
4936         if (mergedwidth * mergedheight / 2 >= size*size*realcount)
4937                 mergedheight /= 2;
4938
4939         loadmodel->brushq3.num_lightmapmergedwidthpower = 0;
4940         loadmodel->brushq3.num_lightmapmergedheightpower = 0;
4941         while (mergedwidth > size<<loadmodel->brushq3.num_lightmapmergedwidthpower)
4942                 loadmodel->brushq3.num_lightmapmergedwidthpower++;
4943         while (mergedheight > size<<loadmodel->brushq3.num_lightmapmergedheightpower)
4944                 loadmodel->brushq3.num_lightmapmergedheightpower++;
4945         loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower = loadmodel->brushq3.num_lightmapmergedwidthpower + loadmodel->brushq3.num_lightmapmergedheightpower + (loadmodel->brushq3.deluxemapping ? 1 : 0);
4946
4947         powerx = loadmodel->brushq3.num_lightmapmergedwidthpower;
4948         powery = loadmodel->brushq3.num_lightmapmergedheightpower;
4949         powerxy = powerx+powery;
4950         powerdxy = loadmodel->brushq3.deluxemapping + powerxy;
4951
4952         mergedcolumns = 1 << powerx;
4953         mergedrows = 1 << powery;
4954         mergedrowsxcolumns = 1 << powerxy;
4955
4956         loadmodel->brushq3.num_mergedlightmaps = (realcount + (1 << powerxy) - 1) >> powerxy;
4957         loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4958         if (loadmodel->brushq3.deluxemapping)
4959                 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4960
4961         // allocate a texture pool if we need it
4962         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4963                 loadmodel->texturepool = R_AllocTexturePool();
4964
4965         mergedpixels = (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4);
4966         mergeddeluxepixels = loadmodel->brushq3.deluxemapping ? (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4) : NULL;
4967         for (i = 0;i < count;i++)
4968         {
4969                 // figure out which merged lightmap texture this fits into
4970                 realindex = i >> (int)loadmodel->brushq3.deluxemapping;
4971                 lightmapindex = i >> powerdxy;
4972
4973                 // choose the destination address
4974                 mergebuf = (loadmodel->brushq3.deluxemapping && (i & 1)) ? mergeddeluxepixels : mergedpixels;
4975                 mergebuf += 4 * (realindex & (mergedcolumns-1))*size + 4 * ((realindex >> powerx) & (mergedrows-1))*mergedwidth*size;
4976                 if ((i & 1) == 0 || !loadmodel->brushq3.deluxemapping)
4977                         Con_Printf("copying original lightmap %i (%ix%i) to %i (at %i,%i)\n", i, size, size, lightmapindex, (realindex & (mergedcolumns-1))*size, ((realindex >> powerx) & (mergedrows-1))*size);
4978
4979                 // convert pixels from RGB or BGRA while copying them into the destination rectangle
4980                 for (j = 0;j < size;j++)
4981                 for (k = 0;k < size;k++)
4982                 {
4983                         mergebuf[(j*mergedwidth+k)*4+0] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[0]];
4984                         mergebuf[(j*mergedwidth+k)*4+1] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[1]];
4985                         mergebuf[(j*mergedwidth+k)*4+2] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[2]];
4986                         mergebuf[(j*mergedwidth+k)*4+3] = 255;
4987                 }
4988
4989                 // upload texture if this was the last tile being written to the texture
4990                 if (((realindex + 1) & (mergedrowsxcolumns - 1)) == 0 || (realindex + 1) == realcount)
4991                 {
4992                         if (loadmodel->brushq3.deluxemapping && (i & 1))
4993                                 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), mergedwidth, mergedheight, mergeddeluxepixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
4994                         else
4995                                 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), mergedwidth, mergedheight, mergedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
4996                 }
4997         }
4998
4999         if (mergeddeluxepixels)
5000                 Mem_Free(mergeddeluxepixels);
5001         Mem_Free(mergedpixels);
5002         if(external)
5003         {
5004                 for(i = 0; i < count; ++i)
5005                         Mem_Free(inpixels[i]);
5006         }
5007 }
5008
5009 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
5010 {
5011         int j, k, cnt, tri;
5012         float *mins, *maxs;
5013         const float *vert;
5014         *collisionstride = stride;
5015         if(stride > 0)
5016         {
5017                 cnt = (num_triangles + stride - 1) / stride;
5018                 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
5019                 for(j = 0; j < cnt; ++j)
5020                 {
5021                         mins = &((*collisionbbox6f)[6 * j + 0]);
5022                         maxs = &((*collisionbbox6f)[6 * j + 3]);
5023                         for(k = 0; k < stride; ++k)
5024                         {
5025                                 tri = j * stride + k;
5026                                 if(tri >= num_triangles)
5027                                         break;
5028                                 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
5029                                 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
5030                                 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
5031                                 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
5032                                 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
5033                                 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
5034                                 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
5035                                 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
5036                                 if(vert[0] < mins[0]) mins[0] = vert[0];
5037                                 if(vert[1] < mins[1]) mins[1] = vert[1];
5038                                 if(vert[2] < mins[2]) mins[2] = vert[2];
5039                                 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5040                                 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5041                                 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5042                                 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
5043                                 if(vert[0] < mins[0]) mins[0] = vert[0];
5044                                 if(vert[1] < mins[1]) mins[1] = vert[1];
5045                                 if(vert[2] < mins[2]) mins[2] = vert[2];
5046                                 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5047                                 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5048                                 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5049                         }
5050                 }
5051         }
5052         else
5053                 *collisionbbox6f = NULL;
5054 }
5055
5056 typedef struct patchtess_s
5057 {
5058         patchinfo_t info;
5059
5060         // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
5061         int surface_id;
5062         float lodgroup[6];
5063         float *originalvertex3f;
5064 } patchtess_t;
5065
5066 #define PATCHTESS_SAME_LODGROUP(a,b) \
5067         ( \
5068                 (a).lodgroup[0] == (b).lodgroup[0] && \
5069                 (a).lodgroup[1] == (b).lodgroup[1] && \
5070                 (a).lodgroup[2] == (b).lodgroup[2] && \
5071                 (a).lodgroup[3] == (b).lodgroup[3] && \
5072                 (a).lodgroup[4] == (b).lodgroup[4] && \
5073                 (a).lodgroup[5] == (b).lodgroup[5] \
5074         )
5075
5076 static void Mod_Q3BSP_LoadFaces(lump_t *l)
5077 {
5078         q3dface_t *in, *oldin;
5079         msurface_t *out, *oldout;
5080         int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, collisionvertices, collisiontriangles, numvertices, numtriangles, cxtess, cytess;
5081         float lightmaptcbase[2], lightmaptcscale[2];
5082         //int *originalelement3i;
5083         //int *originalneighbor3i;
5084         float *originalvertex3f;
5085         //float *originalsvector3f;
5086         //float *originaltvector3f;
5087         float *originalnormal3f;
5088         float *originalcolor4f;
5089         float *originaltexcoordtexture2f;
5090         float *originaltexcoordlightmap2f;
5091         float *surfacecollisionvertex3f;
5092         int *surfacecollisionelement3i;
5093         float *v;
5094         patchtess_t *patchtess = NULL;
5095         int patchtesscount = 0;
5096         qboolean again;
5097
5098         in = (q3dface_t *)(mod_base + l->fileofs);
5099         if (l->filelen % sizeof(*in))
5100                 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
5101         count = l->filelen / sizeof(*in);
5102         out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5103
5104         loadmodel->data_surfaces = out;
5105         loadmodel->num_surfaces = count;
5106
5107         if(count > 0)
5108                 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
5109
5110         i = 0;
5111         oldi = i;
5112         oldin = in;
5113         oldout = out;
5114         meshvertices = 0;
5115         meshtriangles = 0;
5116         for (;i < count;i++, in++, out++)
5117         {
5118                 // check face type first
5119                 type = LittleLong(in->type);
5120                 if (type != Q3FACETYPE_FLAT
5121                  && type != Q3FACETYPE_PATCH
5122                  && type != Q3FACETYPE_MESH
5123                  && type != Q3FACETYPE_FLARE)
5124                 {
5125                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
5126                         continue;
5127                 }
5128
5129                 n = LittleLong(in->textureindex);
5130                 if (n < 0 || n >= loadmodel->num_textures)
5131                 {
5132                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
5133                         continue;
5134                 }
5135                 out->texture = loadmodel->data_textures + n;
5136                 n = LittleLong(in->effectindex);
5137                 if (n < -1 || n >= loadmodel->brushq3.num_effects)
5138                 {
5139                         if (developer_extra.integer)
5140                                 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
5141                         n = -1;
5142                 }
5143                 if (n == -1)
5144                         out->effect = NULL;
5145                 else
5146                         out->effect = loadmodel->brushq3.data_effects + n;
5147
5148                 if (cls.state != ca_dedicated)
5149                 {
5150                         out->lightmaptexture = NULL;
5151                         out->deluxemaptexture = r_texture_blanknormalmap;
5152                         n = LittleLong(in->lightmapindex);
5153                         if (n < 0)
5154                                 n = -1;
5155                         else if (n >= loadmodel->brushq3.num_originallightmaps)
5156                         {
5157                                 if(loadmodel->brushq3.num_originallightmaps != 0)
5158                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
5159                                 n = -1;
5160                         }
5161                         else
5162                         {
5163                                 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5164                                 if (loadmodel->brushq3.deluxemapping)
5165                                         out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5166                                 loadmodel->lit = true;
5167                         }
5168                 }
5169
5170                 firstvertex = LittleLong(in->firstvertex);
5171                 numvertices = LittleLong(in->numvertices);
5172                 firstelement = LittleLong(in->firstelement);
5173                 numtriangles = LittleLong(in->numelements) / 3;
5174                 if (numtriangles * 3 != LittleLong(in->numelements))
5175                 {
5176                         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));
5177                         continue;
5178                 }
5179                 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
5180                 {
5181                         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);
5182                         continue;
5183                 }
5184                 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
5185                 {
5186                         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);
5187                         continue;
5188                 }
5189                 switch(type)
5190                 {
5191                 case Q3FACETYPE_FLAT:
5192                 case Q3FACETYPE_MESH:
5193                         // no processing necessary
5194                         break;
5195                 case Q3FACETYPE_PATCH:
5196                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5197                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5198                         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))
5199                         {
5200                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
5201                                 continue;
5202                         }
5203                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5204
5205                         // convert patch to Q3FACETYPE_MESH
5206                         xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5207                         ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5208                         // bound to user settings
5209                         xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
5210                         ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
5211                         // bound to sanity settings
5212                         xtess = bound(0, xtess, 1024);
5213                         ytess = bound(0, ytess, 1024);
5214
5215                         // lower quality collision patches! Same procedure as before, but different cvars
5216                         // convert patch to Q3FACETYPE_MESH
5217                         cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5218                         cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5219                         // bound to user settings
5220                         cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
5221                         cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
5222                         // bound to sanity settings
5223                         cxtess = bound(0, cxtess, 1024);
5224                         cytess = bound(0, cytess, 1024);
5225
5226                         // store it for the LOD grouping step
5227                         patchtess[patchtesscount].info.xsize = patchsize[0];
5228                         patchtess[patchtesscount].info.ysize = patchsize[1];
5229                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
5230                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
5231                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
5232                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
5233
5234                         patchtess[patchtesscount].surface_id = i;
5235                         patchtess[patchtesscount].lodgroup[0] = LittleFloat(in->specific.patch.mins[0]);
5236                         patchtess[patchtesscount].lodgroup[1] = LittleFloat(in->specific.patch.mins[1]);
5237                         patchtess[patchtesscount].lodgroup[2] = LittleFloat(in->specific.patch.mins[2]);
5238                         patchtess[patchtesscount].lodgroup[3] = LittleFloat(in->specific.patch.maxs[0]);
5239                         patchtess[patchtesscount].lodgroup[4] = LittleFloat(in->specific.patch.maxs[1]);
5240                         patchtess[patchtesscount].lodgroup[5] = LittleFloat(in->specific.patch.maxs[2]);
5241                         patchtess[patchtesscount].originalvertex3f = originalvertex3f;
5242                         ++patchtesscount;
5243                         break;
5244                 case Q3FACETYPE_FLARE:
5245                         if (developer_extra.integer)
5246                                 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
5247                         // don't render it
5248                         continue;
5249                 }
5250                 out->num_vertices = numvertices;
5251                 out->num_triangles = numtriangles;
5252                 meshvertices += out->num_vertices;
5253                 meshtriangles += out->num_triangles;
5254         }
5255
5256         // Fix patches tesselations so that they make no seams
5257         do
5258         {
5259                 again = false;
5260                 for(i = 0; i < patchtesscount; ++i)
5261                 {
5262                         for(j = i+1; j < patchtesscount; ++j)
5263                         {
5264                                 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
5265                                         continue;
5266
5267                                 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
5268                                         again = true;
5269                         }
5270                 }
5271         }
5272         while (again);
5273
5274         // Calculate resulting number of triangles
5275         collisionvertices = 0;
5276         collisiontriangles = 0;
5277         for(i = 0; i < patchtesscount; ++i)
5278         {
5279                 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
5280                 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
5281                 numvertices = finalwidth * finalheight;
5282                 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5283
5284                 oldout[patchtess[i].surface_id].num_vertices = numvertices;
5285                 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
5286                 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
5287                 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
5288
5289                 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_COLLISION].xtess);
5290                 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_COLLISION].ytess);
5291                 numvertices = finalwidth * finalheight;
5292                 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5293
5294                 oldout[patchtess[i].surface_id].num_collisionvertices = numvertices;
5295                 oldout[patchtess[i].surface_id].num_collisiontriangles = numtriangles;
5296                 collisionvertices += oldout[patchtess[i].surface_id].num_collisionvertices;
5297                 collisiontriangles += oldout[patchtess[i].surface_id].num_collisiontriangles;
5298         }
5299
5300         i = oldi;
5301         in = oldin;
5302         out = oldout;
5303         Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
5304         if (collisiontriangles)
5305         {
5306                 loadmodel->brush.data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, collisionvertices * sizeof(float[3]));
5307                 loadmodel->brush.data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, collisiontriangles * sizeof(int[3]));
5308         }
5309         meshvertices = 0;
5310         meshtriangles = 0;
5311         collisionvertices = 0;
5312         collisiontriangles = 0;
5313         for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
5314         {
5315                 if (out->num_vertices < 3 || out->num_triangles < 1)
5316                         continue;
5317
5318                 type = LittleLong(in->type);
5319                 firstvertex = LittleLong(in->firstvertex);
5320                 firstelement = LittleLong(in->firstelement);
5321                 out->num_firstvertex = meshvertices;
5322                 out->num_firsttriangle = meshtriangles;
5323                 out->num_firstcollisiontriangle = collisiontriangles;
5324                 switch(type)
5325                 {
5326                 case Q3FACETYPE_FLAT:
5327                 case Q3FACETYPE_MESH:
5328                         // no processing necessary, except for lightmap merging
5329                         for (j = 0;j < out->num_vertices;j++)
5330                         {
5331                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5332                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5333                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5334                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5335                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5336                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5337                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5338                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5339                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5340                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5341                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5342                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5343                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5344                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5345                         }
5346                         for (j = 0;j < out->num_triangles*3;j++)
5347                                 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5348                         break;
5349                 case Q3FACETYPE_PATCH:
5350                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5351                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5352                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5353                         originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5354                         originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5355                         originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5356                         originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5357
5358                         xtess = ytess = cxtess = cytess = -1;
5359                         for(j = 0; j < patchtesscount; ++j)
5360                                 if(patchtess[j].surface_id == i)
5361                                 {
5362                                         xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5363                                         ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5364                                         cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5365                                         cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5366                                         break;
5367                                 }
5368                         if(xtess == -1)
5369                         {
5370                                 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5371                                 xtess = ytess = cxtess = cytess = 0;
5372                         }
5373
5374                         finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5375                         finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5376                         finalvertices = finalwidth * finalheight;
5377                         oldnumtriangles = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5378                         type = Q3FACETYPE_MESH;
5379                         // generate geometry
5380                         // (note: normals are skipped because they get recalculated)
5381                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5382                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5383                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5384                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5385                         Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5386                         Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5387
5388                         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);
5389
5390                         if (developer_extra.integer)
5391                         {
5392                                 if (out->num_triangles < finaltriangles)
5393                                         Con_DPrintf("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);
5394                                 else
5395                                         Con_DPrintf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles\n", patchsize[0], patchsize[1], out->num_vertices, out->num_triangles);
5396                         }
5397                         // q3map does not put in collision brushes for curves... ugh
5398                         // build the lower quality collision geometry
5399                         finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5400                         finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5401                         finalvertices = finalwidth * finalheight;
5402                         oldnumtriangles2 = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5403
5404                         // legacy collision geometry implementation
5405                         out->deprecatedq3data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5406                         out->deprecatedq3data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5407                         out->num_collisionvertices = finalvertices;
5408                         out->num_collisiontriangles = finaltriangles;
5409                         Q3PatchTesselateFloat(3, sizeof(float[3]), out->deprecatedq3data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5410                         Q3PatchTriangleElements(out->deprecatedq3data_collisionelement3i, finalwidth, finalheight, 0);
5411
5412                         //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5413                         Mod_SnapVertices(3, finalvertices, out->deprecatedq3data_collisionvertex3f, 1);
5414
5415                         out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionvertex3f);
5416
5417                         // now optimize the collision mesh by finding triangle bboxes...
5418                         Mod_Q3BSP_BuildBBoxes(out->deprecatedq3data_collisionelement3i, out->num_collisiontriangles, out->deprecatedq3data_collisionvertex3f, &out->deprecatedq3data_collisionbbox6f, &out->deprecatedq3num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5419                         Mod_Q3BSP_BuildBBoxes(loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle, out->num_triangles, loadmodel->surfmesh.data_vertex3f, &out->deprecatedq3data_bbox6f, &out->deprecatedq3num_bboxstride, mod_q3bsp_curves_stride.integer);
5420
5421                         // store collision geometry for BIH collision tree
5422                         surfacecollisionvertex3f = loadmodel->brush.data_collisionvertex3f + collisionvertices * 3;
5423                         surfacecollisionelement3i = loadmodel->brush.data_collisionelement3i + collisiontriangles * 3;
5424                         Q3PatchTesselateFloat(3, sizeof(float[3]), surfacecollisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5425                         Q3PatchTriangleElements(surfacecollisionelement3i, finalwidth, finalheight, collisionvertices);
5426                         Mod_SnapVertices(3, finalvertices, surfacecollisionvertex3f, 1);
5427 #if 1
5428                         // remove this once the legacy code is removed
5429                         {
5430                                 int nc = out->num_collisiontriangles;
5431 #endif
5432                         out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, surfacecollisionelement3i, surfacecollisionelement3i, loadmodel->brush.data_collisionvertex3f);
5433 #if 1
5434                                 if(nc != out->num_collisiontriangles)
5435                                 {
5436                                         Con_Printf("number of collision triangles differs between BIH and BSP. FAIL.\n");
5437                                 }
5438                         }
5439 #endif
5440
5441                         if (developer_extra.integer)
5442                                 Con_DPrintf("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);
5443
5444                         collisionvertices += finalvertices;
5445                         collisiontriangles += out->num_collisiontriangles;
5446                         break;
5447                 default:
5448                         break;
5449                 }
5450                 meshvertices += out->num_vertices;
5451                 meshtriangles += out->num_triangles;
5452                 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5453                         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)
5454                                 invalidelements++;
5455                 if (invalidelements)
5456                 {
5457                         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);
5458                         for (j = 0;j < out->num_triangles * 3;j++)
5459                         {
5460                                 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5461                                 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)
5462                                         (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5463                         }
5464                         Con_Print("\n");
5465                 }
5466                 // calculate a bounding box
5467                 VectorClear(out->mins);
5468                 VectorClear(out->maxs);
5469                 if (out->num_vertices)
5470                 {
5471                         if (cls.state != ca_dedicated && out->lightmaptexture)
5472                         {
5473                                 // figure out which part of the merged lightmap this fits into
5474                                 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5475                                 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5476                                 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5477                                 lightmapindex &= mergewidth * mergeheight - 1;
5478                                 lightmaptcscale[0] = 1.0f / mergewidth;
5479                                 lightmaptcscale[1] = 1.0f / mergeheight;
5480                                 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5481                                 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5482                                 // modify the lightmap texcoords to match this region of the merged lightmap
5483                                 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5484                                 {
5485                                         v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5486                                         v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5487                                 }
5488                         }
5489                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5490                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5491                         for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5492                         {
5493                                 out->mins[0] = min(out->mins[0], v[0]);
5494                                 out->maxs[0] = max(out->maxs[0], v[0]);
5495                                 out->mins[1] = min(out->mins[1], v[1]);
5496                                 out->maxs[1] = max(out->maxs[1], v[1]);
5497                                 out->mins[2] = min(out->mins[2], v[2]);
5498                                 out->maxs[2] = max(out->maxs[2], v[2]);
5499                         }
5500                         out->mins[0] -= 1.0f;
5501                         out->mins[1] -= 1.0f;
5502                         out->mins[2] -= 1.0f;
5503                         out->maxs[0] += 1.0f;
5504                         out->maxs[1] += 1.0f;
5505                         out->maxs[2] += 1.0f;
5506                 }
5507                 // set lightmap styles for consistency with q1bsp
5508                 //out->lightmapinfo->styles[0] = 0;
5509                 //out->lightmapinfo->styles[1] = 255;
5510                 //out->lightmapinfo->styles[2] = 255;
5511                 //out->lightmapinfo->styles[3] = 255;
5512         }
5513
5514         i = oldi;
5515         out = oldout;
5516         for (;i < count;i++, out++)
5517         {
5518                 if(out->num_vertices && out->num_triangles)
5519                         continue;
5520                 if(out->num_vertices == 0)
5521                 {
5522                         Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no vertices, ignoring\n", i, out->texture ? out->texture->name : "(none)");
5523                         if(out->num_triangles == 0)
5524                                 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no triangles, ignoring\n", i, out->texture ? out->texture->name : "(none)");
5525                 }
5526                 else if(out->num_triangles == 0)
5527                         Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s, near %f %f %f) has no triangles, ignoring\n", i, out->texture ? out->texture->name : "(none)",
5528                                         (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[0 * 3 + 0],
5529                                         (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[1 * 3 + 0],
5530                                         (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[2 * 3 + 0]);
5531         }
5532
5533         // for per pixel lighting
5534         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, r_smoothnormals_areaweighting.integer != 0);
5535
5536         // generate ushort elements array if possible
5537         if (loadmodel->surfmesh.data_element3s)
5538                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5539                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5540
5541         // free the no longer needed vertex data
5542         loadmodel->brushq3.num_vertices = 0;
5543         if (loadmodel->brushq3.data_vertex3f)
5544                 Mem_Free(loadmodel->brushq3.data_vertex3f);
5545         loadmodel->brushq3.data_vertex3f = NULL;
5546         loadmodel->brushq3.data_normal3f = NULL;
5547         loadmodel->brushq3.data_texcoordtexture2f = NULL;
5548         loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5549         loadmodel->brushq3.data_color4f = NULL;
5550         // free the no longer needed triangle data
5551         loadmodel->brushq3.num_triangles = 0;
5552         if (loadmodel->brushq3.data_element3i)
5553                 Mem_Free(loadmodel->brushq3.data_element3i);
5554         loadmodel->brushq3.data_element3i = NULL;
5555
5556         if(patchtess)
5557                 Mem_Free(patchtess);
5558 }
5559
5560 static void Mod_Q3BSP_LoadModels(lump_t *l)
5561 {
5562         q3dmodel_t *in;
5563         q3dmodel_t *out;
5564         int i, j, n, c, count;
5565
5566         in = (q3dmodel_t *)(mod_base + l->fileofs);
5567         if (l->filelen % sizeof(*in))
5568                 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5569         count = l->filelen / sizeof(*in);
5570         out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5571
5572         loadmodel->brushq3.data_models = out;
5573         loadmodel->brushq3.num_models = count;
5574
5575         for (i = 0;i < count;i++, in++, out++)
5576         {
5577                 for (j = 0;j < 3;j++)
5578                 {
5579                         out->mins[j] = LittleFloat(in->mins[j]);
5580                         out->maxs[j] = LittleFloat(in->maxs[j]);
5581                 }
5582                 n = LittleLong(in->firstface);
5583                 c = LittleLong(in->numfaces);
5584                 if (n < 0 || n + c > loadmodel->num_surfaces)
5585                         Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5586                 out->firstface = n;
5587                 out->numfaces = c;
5588                 n = LittleLong(in->firstbrush);
5589                 c = LittleLong(in->numbrushes);
5590                 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5591                         Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5592                 out->firstbrush = n;
5593                 out->numbrushes = c;
5594         }
5595 }
5596
5597 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5598 {
5599         int *in;
5600         int *out;
5601         int i, n, count;
5602
5603         in = (int *)(mod_base + l->fileofs);
5604         if (l->filelen % sizeof(*in))
5605                 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5606         count = l->filelen / sizeof(*in);
5607         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5608
5609         loadmodel->brush.data_leafbrushes = out;
5610         loadmodel->brush.num_leafbrushes = count;
5611
5612         for (i = 0;i < count;i++, in++, out++)
5613         {
5614                 n = LittleLong(*in);
5615                 if (n < 0 || n >= loadmodel->brush.num_brushes)
5616                         Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5617                 *out = n;
5618         }
5619 }
5620
5621 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5622 {
5623         int *in;
5624         int *out;
5625         int i, n, count;
5626
5627         in = (int *)(mod_base + l->fileofs);
5628         if (l->filelen % sizeof(*in))
5629                 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5630         count = l->filelen / sizeof(*in);
5631         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5632
5633         loadmodel->brush.data_leafsurfaces = out;
5634         loadmodel->brush.num_leafsurfaces = count;
5635
5636         for (i = 0;i < count;i++, in++, out++)
5637         {
5638                 n = LittleLong(*in);
5639                 if (n < 0 || n >= loadmodel->num_surfaces)
5640                         Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5641                 *out = n;
5642         }
5643 }
5644
5645 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5646 {
5647         q3dleaf_t *in;
5648         mleaf_t *out;
5649         int i, j, n, c, count;
5650
5651         in = (q3dleaf_t *)(mod_base + l->fileofs);
5652         if (l->filelen % sizeof(*in))
5653                 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5654         count = l->filelen / sizeof(*in);
5655         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5656
5657         loadmodel->brush.data_leafs = out;
5658         loadmodel->brush.num_leafs = count;
5659
5660         for (i = 0;i < count;i++, in++, out++)
5661         {
5662                 out->parent = NULL;
5663                 out->plane = NULL;
5664                 out->clusterindex = LittleLong(in->clusterindex);
5665                 out->areaindex = LittleLong(in->areaindex);
5666                 for (j = 0;j < 3;j++)
5667                 {
5668                         // yes the mins/maxs are ints
5669                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5670                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5671                 }
5672                 n = LittleLong(in->firstleafface);
5673                 c = LittleLong(in->numleaffaces);
5674                 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5675                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5676                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5677                 out->numleafsurfaces = c;
5678                 n = LittleLong(in->firstleafbrush);
5679                 c = LittleLong(in->numleafbrushes);
5680                 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5681                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5682                 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5683                 out->numleafbrushes = c;
5684         }
5685 }
5686
5687 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5688 {
5689         q3dnode_t *in;
5690         mnode_t *out;
5691         int i, j, n, count;
5692
5693         in = (q3dnode_t *)(mod_base + l->fileofs);
5694         if (l->filelen % sizeof(*in))
5695                 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5696         count = l->filelen / sizeof(*in);
5697         if (count == 0)
5698                 Host_Error("Mod_Q3BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
5699         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5700
5701         loadmodel->brush.data_nodes = out;
5702         loadmodel->brush.num_nodes = count;
5703
5704         for (i = 0;i < count;i++, in++, out++)
5705         {
5706                 out->parent = NULL;
5707                 n = LittleLong(in->planeindex);
5708                 if (n < 0 || n >= loadmodel->brush.num_planes)
5709                         Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5710                 out->plane = loadmodel->brush.data_planes + n;
5711                 for (j = 0;j < 2;j++)
5712                 {
5713                         n = LittleLong(in->childrenindex[j]);
5714                         if (n >= 0)
5715                         {
5716                                 if (n >= loadmodel->brush.num_nodes)
5717                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5718                                 out->children[j] = loadmodel->brush.data_nodes + n;
5719                         }
5720                         else
5721                         {
5722                                 n = -1 - n;
5723                                 if (n >= loadmodel->brush.num_leafs)
5724                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5725                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5726                         }
5727                 }
5728                 for (j = 0;j < 3;j++)
5729                 {
5730                         // yes the mins/maxs are ints
5731                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5732                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5733                 }
5734         }
5735
5736         // set the parent pointers
5737         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5738 }
5739
5740 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5741 {
5742         q3dlightgrid_t *in;
5743         q3dlightgrid_t *out;
5744         int count;
5745
5746         in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5747         if (l->filelen % sizeof(*in))
5748                 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5749         loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5750         loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5751         loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5752         loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5753         loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5754         loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5755         loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5756         loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5757         loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5758         loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5759         loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5760         loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5761         count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5762         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]);
5763         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]);
5764
5765         // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5766         if (l->filelen)
5767         {
5768                 if (l->filelen < count * (int)sizeof(*in))
5769                 {
5770                         Con_Printf("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]);
5771                         return; // ignore the grid if we cannot understand it
5772                 }
5773                 if (l->filelen != count * (int)sizeof(*in))
5774                         Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5775                 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5776                 loadmodel->brushq3.data_lightgrid = out;
5777                 loadmodel->brushq3.num_lightgrid = count;
5778                 // no swapping or validation necessary
5779                 memcpy(out, in, count * (int)sizeof(*out));
5780         }
5781 }
5782
5783 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5784 {
5785         q3dpvs_t *in;
5786         int totalchains;
5787
5788         if (l->filelen == 0)
5789         {
5790                 int i;
5791                 // unvised maps often have cluster indices even without pvs, so check
5792                 // leafs to find real number of clusters
5793                 loadmodel->brush.num_pvsclusters = 1;
5794                 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5795                         loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5796
5797                 // create clusters
5798                 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5799                 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5800                 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5801                 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5802                 return;
5803         }
5804
5805         in = (q3dpvs_t *)(mod_base + l->fileofs);
5806         if (l->filelen < 9)
5807                 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5808
5809         loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5810         loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5811         if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5812                 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5813         totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5814         if (l->filelen < totalchains + (int)sizeof(*in))
5815                 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);
5816
5817         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5818         memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5819 }
5820
5821 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5822 {
5823         int i, j, k, index[3];
5824         float transformed[3], blend1, blend2, blend, stylescale = 1;
5825         q3dlightgrid_t *a, *s;
5826
5827         // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5828         switch(vid.renderpath)
5829         {
5830         case RENDERPATH_GL20:
5831         case RENDERPATH_D3D9:
5832         case RENDERPATH_D3D10:
5833         case RENDERPATH_D3D11:
5834         case RENDERPATH_SOFT:
5835         case RENDERPATH_GLES2:
5836                 // LordHavoc: FIXME: is this true?
5837                 stylescale = 1; // added while render
5838                 break;
5839         case RENDERPATH_GL11:
5840         case RENDERPATH_GL13:
5841         case RENDERPATH_GLES1:
5842                 stylescale = r_refdef.scene.rtlightstylevalue[0];
5843                 break;
5844         }
5845
5846         if (!model->brushq3.num_lightgrid)
5847         {
5848                 ambientcolor[0] = stylescale;
5849                 ambientcolor[1] = stylescale;
5850                 ambientcolor[2] = stylescale;
5851                 return;
5852         }
5853
5854         Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5855         //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5856         //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5857         transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5858         transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5859         transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5860         index[0] = (int)floor(transformed[0]);
5861         index[1] = (int)floor(transformed[1]);
5862         index[2] = (int)floor(transformed[2]);
5863         //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5864
5865         // now lerp the values
5866         VectorClear(diffusenormal);
5867         a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5868         for (k = 0;k < 2;k++)
5869         {
5870                 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5871                 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5872                         continue;
5873                 for (j = 0;j < 2;j++)
5874                 {
5875                         blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5876                         if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5877                                 continue;
5878                         for (i = 0;i < 2;i++)
5879                         {
5880                                 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5881                                 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5882                                         continue;
5883                                 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5884                                 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5885                                 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5886                                 // this uses the mod_md3_sin table because the values are
5887                                 // already in the 0-255 range, the 64+ bias fetches a cosine
5888                                 // instead of a sine value
5889                                 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5890                                 diffusenormal[1] += blend * (mod_md3_sin[     s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5891                                 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5892                                 //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)));
5893                         }
5894                 }
5895         }
5896
5897         // normalize the light direction before turning
5898         VectorNormalize(diffusenormal);
5899         //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]);
5900 }
5901
5902 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
5903 {
5904         double t1, t2;
5905         double midf, mid[3];
5906         int ret, side;
5907
5908         // check for empty
5909         while (node->plane)
5910         {
5911                 // find the point distances
5912                 mplane_t *plane = node->plane;
5913                 if (plane->type < 3)
5914                 {
5915                         t1 = p1[plane->type] - plane->dist;
5916                         t2 = p2[plane->type] - plane->dist;
5917                 }
5918                 else
5919                 {
5920                         t1 = DotProduct (plane->normal, p1) - plane->dist;
5921                         t2 = DotProduct (plane->normal, p2) - plane->dist;
5922                 }
5923
5924                 if (t1 < 0)
5925                 {
5926                         if (t2 < 0)
5927                         {
5928                                 node = node->children[1];
5929                                 continue;
5930                         }
5931                         side = 1;
5932                 }
5933                 else
5934                 {
5935                         if (t2 >= 0)
5936                         {
5937                                 node = node->children[0];
5938                                 continue;
5939                         }
5940                         side = 0;
5941                 }
5942
5943                 midf = t1 / (t1 - t2);
5944                 VectorLerp(p1, midf, p2, mid);
5945
5946                 // recurse both sides, front side first
5947                 // return 2 if empty is followed by solid (hit something)
5948                 // do not return 2 if both are solid or both empty,
5949                 // or if start is solid and end is empty
5950                 // as these degenerate cases usually indicate the eye is in solid and
5951                 // should see the target point anyway
5952                 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side    ], p1, mid);
5953                 if (ret != 0)
5954                         return ret;
5955                 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
5956                 if (ret != 1)
5957                         return ret;
5958                 return 2;
5959         }
5960         return ((mleaf_t *)node)->clusterindex < 0;
5961 }
5962
5963 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
5964 {
5965         if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
5966         {
5967                 trace_t trace;
5968                 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
5969                 return trace.fraction == 1;
5970         }
5971         else
5972         {
5973                 double tracestart[3], traceend[3];
5974                 VectorCopy(start, tracestart);
5975                 VectorCopy(end, traceend);
5976                 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
5977         }
5978 }
5979
5980 void Mod_CollisionBIH_TracePoint(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
5981 {
5982         const bih_t *bih;
5983         const bih_leaf_t *leaf;
5984         const bih_node_t *node;
5985         const colbrushf_t *brush;
5986         int axis;
5987         int nodenum;
5988         int nodestackpos = 0;
5989         int nodestack[1024];
5990
5991         memset(trace, 0, sizeof(*trace));
5992         trace->fraction = 1;
5993         trace->realfraction = 1;
5994         trace->hitsupercontentsmask = hitsupercontentsmask;
5995
5996         bih = &model->collision_bih;
5997         if(!bih->nodes)
5998                 return;
5999
6000         nodenum = bih->rootnode;
6001         nodestack[nodestackpos++] = nodenum;
6002         while (nodestackpos)
6003         {
6004                 nodenum = nodestack[--nodestackpos];
6005                 node = bih->nodes + nodenum;
6006 #if 1
6007                 if (!BoxesOverlap(start, start, node->mins, node->maxs))
6008                         continue;
6009 #endif
6010                 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6011                 {
6012                         axis = node->type - BIH_SPLITX;
6013                         if (start[axis] >= node->frontmin)
6014                                 nodestack[nodestackpos++] = node->front;
6015                         if (start[axis] <= node->backmax)
6016                                 nodestack[nodestackpos++] = node->back;
6017                 }
6018                 else if (node->type == BIH_UNORDERED)
6019                 {
6020                         for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6021                         {
6022                                 leaf = bih->leafs + node->children[axis];
6023 #if 1
6024                                 if (!BoxesOverlap(start, start, leaf->mins, leaf->maxs))
6025                                         continue;
6026 #endif
6027                                 switch(leaf->type)
6028                                 {
6029                                 case BIH_BRUSH:
6030                                         brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6031                                         Collision_TracePointBrushFloat(trace, start, brush);
6032                                         break;
6033                                 case BIH_COLLISIONTRIANGLE:
6034                                         // collision triangle - skipped because they have no volume
6035                                         break;
6036                                 case BIH_RENDERTRIANGLE:
6037                                         // render triangle - skipped because they have no volume
6038                                         break;
6039                                 }
6040                         }
6041                 }
6042         }
6043 }
6044
6045 void Mod_CollisionBIH_TraceLineShared(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask, const bih_t *bih)
6046 {
6047         const bih_leaf_t *leaf;
6048         const bih_node_t *node;
6049         const colbrushf_t *brush;
6050         const int *e;
6051         const texture_t *texture;
6052         vec3_t nodebigmins, nodebigmaxs, nodestart, nodeend, sweepnodemins, sweepnodemaxs;
6053         vec_t d1, d2, d3, d4, f, nodestackline[1024][6];
6054         int axis, nodenum, nodestackpos = 0, nodestack[1024];
6055
6056         if(!bih->nodes)
6057                 return;
6058
6059         if (VectorCompare(start, end))
6060         {
6061                 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6062                 return;
6063         }
6064
6065         nodenum = bih->rootnode;
6066
6067         memset(trace, 0, sizeof(*trace));
6068         trace->fraction = 1;
6069         trace->realfraction = 1;
6070         trace->hitsupercontentsmask = hitsupercontentsmask;
6071
6072         // push first node
6073         nodestackline[nodestackpos][0] = start[0];
6074         nodestackline[nodestackpos][1] = start[1];
6075         nodestackline[nodestackpos][2] = start[2];
6076         nodestackline[nodestackpos][3] = end[0];
6077         nodestackline[nodestackpos][4] = end[1];
6078         nodestackline[nodestackpos][5] = end[2];
6079         nodestack[nodestackpos++] = nodenum;
6080         while (nodestackpos)
6081         {
6082                 nodenum = nodestack[--nodestackpos];
6083                 node = bih->nodes + nodenum;
6084                 VectorCopy(nodestackline[nodestackpos], nodestart);
6085                 VectorCopy(nodestackline[nodestackpos] + 3, nodeend);
6086                 sweepnodemins[0] = min(nodestart[0], nodeend[0]); sweepnodemins[1] = min(nodestart[1], nodeend[1]); sweepnodemins[2] = min(nodestart[2], nodeend[2]); sweepnodemaxs[0] = max(nodestart[0], nodeend[0]); sweepnodemaxs[1] = max(nodestart[1], nodeend[1]); sweepnodemaxs[2] = max(nodestart[2], nodeend[2]);
6087                 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs))
6088                         continue;
6089                 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6090                 {
6091                         // recurse children of the split
6092                         axis = node->type - BIH_SPLITX;
6093                         d1 = node->backmax - nodestart[axis];
6094                         d2 = node->backmax - nodeend[axis];
6095                         d3 = nodestart[axis] - node->frontmin;
6096                         d4 = nodeend[axis] - node->frontmin;
6097                         switch((d1 < 0) | ((d2 < 0) << 1) | ((d3 < 0) << 2) | ((d4 < 0) << 3))
6098                         {
6099                         case  0: /* >>>> */                     VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                      VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6100                         case  1: /* <>>> */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                      VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6101                         case  2: /* ><>> */ f = d1 / (d1 - d2); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                      VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6102                         case  3: /* <<>> */                                                                                                                                                                                                                      VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6103                         case  4: /* >><> */                     VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;  f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6104                         case  5: /* <><> */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;  f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6105                         case  6: /* ><<> */ f = d1 / (d1 - d2); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;  f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6106                         case  7: /* <<<> */                                                                                                                                                                                                  f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6107                         case  8: /* >>>< */                     VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;  f = d3 / (d3 - d4); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6108                         case  9: /* <>>< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;  f = d3 / (d3 - d4); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6109                         case 10: /* ><>< */ f = d1 / (d1 - d2); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;  f = d3 / (d3 - d4); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6110                         case 11: /* <<>< */                                                                                                                                                                                                  f = d3 / (d3 - d4); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6111                         case 12: /* >><< */                     VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                                                                                                                                                                                                   break;
6112                         case 13: /* <><< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                                                                                                                                                                                                   break;
6113                         case 14: /* ><<< */ f = d1 / (d1 - d2); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                                                                                                                                                                                                   break;
6114                         case 15: /* <<<< */                                                                                                                                                                                                                                                                                                                                                                                                   break;
6115                         }
6116                 }
6117                 else if (node->type == BIH_UNORDERED)
6118                 {
6119                         // calculate sweep bounds for this node
6120                         // copy node bounds into local variables
6121                         VectorCopy(node->mins, nodebigmins);
6122                         VectorCopy(node->maxs, nodebigmaxs);
6123                         // clip line to this node bounds
6124                         axis = 0; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6125                         axis = 1; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6126                         axis = 2; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6127                         // some of the line intersected the enlarged node box
6128                         // calculate sweep bounds for this node
6129                         sweepnodemins[0] = min(nodestart[0], nodeend[0]); sweepnodemins[1] = min(nodestart[1], nodeend[1]); sweepnodemins[2] = min(nodestart[2], nodeend[2]); sweepnodemaxs[0] = max(nodestart[0], nodeend[0]); sweepnodemaxs[1] = max(nodestart[1], nodeend[1]); sweepnodemaxs[2] = max(nodestart[2], nodeend[2]);
6130                         for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6131                         {
6132                                 leaf = bih->leafs + node->children[axis];
6133                                 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, leaf->mins, leaf->maxs))
6134                                         continue;
6135                                 switch(leaf->type)
6136                                 {
6137                                 case BIH_BRUSH:
6138                                         brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6139                                         Collision_TraceLineBrushFloat(trace, start, end, brush, brush);
6140                                         break;
6141                                 case BIH_COLLISIONTRIANGLE:
6142                                         if (!mod_q3bsp_curves_collisions.integer)
6143                                                 continue;
6144                                         e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6145                                         texture = model->data_textures + leaf->textureindex;
6146                                         Collision_TraceLineTriangleFloat(trace, start, end, model->brush.data_collisionvertex3f + e[0] * 3, model->brush.data_collisionvertex3f + e[1] * 3, model->brush.data_collisionvertex3f + e[2] * 3, texture->supercontents, texture->surfaceflags, texture);
6147                                         break;
6148                                 case BIH_RENDERTRIANGLE:
6149                                         e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6150                                         texture = model->data_textures + leaf->textureindex;
6151                                         Collision_TraceLineTriangleFloat(trace, start, end, model->surfmesh.data_vertex3f + e[0] * 3, model->surfmesh.data_vertex3f + e[1] * 3, model->surfmesh.data_vertex3f + e[2] * 3, texture->supercontents, texture->surfaceflags, texture);
6152                                         break;
6153                                 }
6154                         }
6155                 }
6156         }
6157 }
6158
6159 void Mod_CollisionBIH_TraceLine(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
6160 {
6161         if (VectorCompare(start, end))
6162         {
6163                 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6164                 return;
6165         }
6166         Mod_CollisionBIH_TraceLineShared(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, &model->collision_bih);
6167 }
6168
6169 void Mod_CollisionBIH_TraceBrush(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, colbrushf_t *thisbrush_start, colbrushf_t *thisbrush_end, int hitsupercontentsmask)
6170 {
6171         const bih_t *bih;
6172         const bih_leaf_t *leaf;
6173         const bih_node_t *node;
6174         const colbrushf_t *brush;
6175         const int *e;
6176         const texture_t *texture;
6177         vec3_t start, end, startmins, startmaxs, endmins, endmaxs, mins, maxs;
6178         vec3_t nodebigmins, nodebigmaxs, nodestart, nodeend, sweepnodemins, sweepnodemaxs;
6179         vec_t d1, d2, d3, d4, f, nodestackline[1024][6];
6180         int axis, nodenum, nodestackpos = 0, nodestack[1024];
6181
6182         if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(thisbrush_start->mins, thisbrush_start->maxs) && VectorCompare(thisbrush_end->mins, thisbrush_end->maxs))
6183         {
6184                 if (VectorCompare(thisbrush_start->mins, thisbrush_end->mins))
6185                         Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, thisbrush_start->mins, hitsupercontentsmask);
6186                 else
6187                         Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, thisbrush_start->mins, thisbrush_end->mins, hitsupercontentsmask);
6188                 return;
6189         }
6190
6191         bih = &model->collision_bih;
6192         if(!bih->nodes)
6193                 return;
6194         nodenum = bih->rootnode;
6195
6196         // box trace, performed as brush trace
6197         memset(trace, 0, sizeof(*trace));
6198         trace->fraction = 1;
6199         trace->realfraction = 1;
6200         trace->hitsupercontentsmask = hitsupercontentsmask;
6201
6202         // calculate tracebox-like parameters for efficient culling
6203         VectorMAM(0.5f, thisbrush_start->mins, 0.5f, thisbrush_start->maxs, start);
6204         VectorMAM(0.5f, thisbrush_end->mins, 0.5f, thisbrush_end->maxs, end);
6205         VectorSubtract(thisbrush_start->mins, start, startmins);
6206         VectorSubtract(thisbrush_start->maxs, start, startmaxs);
6207         VectorSubtract(thisbrush_end->mins, end, endmins);
6208         VectorSubtract(thisbrush_end->maxs, end, endmaxs);
6209         mins[0] = min(startmins[0], endmins[0]);
6210         mins[1] = min(startmins[1], endmins[1]);
6211         mins[2] = min(startmins[2], endmins[2]);
6212         maxs[0] = max(startmaxs[0], endmaxs[0]);
6213         maxs[1] = max(startmaxs[1], endmaxs[1]);
6214         maxs[2] = max(startmaxs[2], endmaxs[2]);
6215
6216         // push first node
6217         nodestackline[nodestackpos][0] = start[0];
6218         nodestackline[nodestackpos][1] = start[1];
6219         nodestackline[nodestackpos][2] = start[2];
6220         nodestackline[nodestackpos][3] = end[0];
6221         nodestackline[nodestackpos][4] = end[1];
6222         nodestackline[nodestackpos][5] = end[2];
6223         nodestack[nodestackpos++] = nodenum;
6224         while (nodestackpos)
6225         {
6226                 nodenum = nodestack[--nodestackpos];
6227                 node = bih->nodes + nodenum;
6228                 VectorCopy(nodestackline[nodestackpos], nodestart);
6229                 VectorCopy(nodestackline[nodestackpos] + 3, nodeend);
6230                 sweepnodemins[0] = min(nodestart[0], nodeend[0]) + mins[0]; sweepnodemins[1] = min(nodestart[1], nodeend[1]) + mins[1]; sweepnodemins[2] = min(nodestart[2], nodeend[2]) + mins[2]; sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + maxs[0]; sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + maxs[1]; sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + maxs[2];
6231                 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs))
6232                         continue;
6233                 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6234                 {
6235                         // recurse children of the split
6236                         axis = node->type - BIH_SPLITX;
6237                         d1 = node->backmax - nodestart[axis] - mins[axis];
6238                         d2 = node->backmax - nodeend[axis] - mins[axis];
6239                         d3 = nodestart[axis] - node->frontmin + maxs[axis];
6240                         d4 = nodeend[axis] - node->frontmin + maxs[axis];
6241                         switch((d1 < 0) | ((d2 < 0) << 1) | ((d3 < 0) << 2) | ((d4 < 0) << 3))
6242                         {
6243                         case  0: /* >>>> */                     VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                      VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6244                         case  1: /* <>>> */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                      VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6245                         case  2: /* ><>> */ f = d1 / (d1 - d2); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                      VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6246                         case  3: /* <<>> */                                                                                                                                                                                                                      VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6247                         case  4: /* >><> */                     VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;  f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6248                         case  5: /* <><> */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;  f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6249                         case  6: /* ><<> */ f = d1 / (d1 - d2); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;  f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6250                         case  7: /* <<<> */                                                                                                                                                                                                  f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6251                         case  8: /* >>>< */                     VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;  f = d3 / (d3 - d4); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6252                         case  9: /* <>>< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;  f = d3 / (d3 - d4); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6253                         case 10: /* ><>< */ f = d1 / (d1 - d2); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;  f = d3 / (d3 - d4); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6254                         case 11: /* <<>< */                                                                                                                                                                                                  f = d3 / (d3 - d4); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6255                         case 12: /* >><< */                     VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                                                                                                                                                                                                   break;
6256                         case 13: /* <><< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                                                                                                                                                                                                   break;
6257                         case 14: /* ><<< */ f = d1 / (d1 - d2); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                                                                                                                                                                                                   break;
6258                         case 15: /* <<<< */                                                                                                                                                                                                                                                                                                                                                                                                   break;
6259                         }
6260                 }
6261                 else if (node->type == BIH_UNORDERED)
6262                 {
6263                         // calculate sweep bounds for this node
6264                         // copy node bounds into local variables and expand to get Minkowski Sum of the two shapes
6265                         VectorSubtract(node->mins, maxs, nodebigmins);
6266                         VectorSubtract(node->maxs, mins, nodebigmaxs);
6267                         // clip line to this node bounds
6268                         axis = 0; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6269                         axis = 1; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6270                         axis = 2; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6271                         // some of the line intersected the enlarged node box
6272                         // calculate sweep bounds for this node
6273                         sweepnodemins[0] = min(nodestart[0], nodeend[0]) + mins[0]; sweepnodemins[1] = min(nodestart[1], nodeend[1]) + mins[1]; sweepnodemins[2] = min(nodestart[2], nodeend[2]) + mins[2]; sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + maxs[0]; sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + maxs[1]; sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + maxs[2];
6274                         for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6275                         {
6276                                 leaf = bih->leafs + node->children[axis];
6277                                 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, leaf->mins, leaf->maxs))
6278                                         continue;
6279                                 switch(leaf->type)
6280                                 {
6281                                 case BIH_BRUSH:
6282                                         brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6283                                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6284                                         break;
6285                                 case BIH_COLLISIONTRIANGLE:
6286                                         if (!mod_q3bsp_curves_collisions.integer)
6287                                                 continue;
6288                                         e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6289                                         texture = model->data_textures + leaf->textureindex;
6290                                         Collision_TraceBrushTriangleFloat(trace, thisbrush_start, thisbrush_end, model->brush.data_collisionvertex3f + e[0] * 3, model->brush.data_collisionvertex3f + e[1] * 3, model->brush.data_collisionvertex3f + e[2] * 3, texture->supercontents, texture->surfaceflags, texture);
6291                                         break;
6292                                 case BIH_RENDERTRIANGLE:
6293                                         e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6294                                         texture = model->data_textures + leaf->textureindex;
6295                                         Collision_TraceBrushTriangleFloat(trace, thisbrush_start, thisbrush_end, model->surfmesh.data_vertex3f + e[0] * 3, model->surfmesh.data_vertex3f + e[1] * 3, model->surfmesh.data_vertex3f + e[2] * 3, texture->supercontents, texture->surfaceflags, texture);
6296                                         break;
6297                                 }
6298                         }
6299                 }
6300         }
6301 }
6302
6303 void Mod_CollisionBIH_TraceBox(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
6304 {
6305         colboxbrushf_t thisbrush_start, thisbrush_end;
6306         vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6307
6308         // box trace, performed as brush trace
6309         VectorAdd(start, boxmins, boxstartmins);
6310         VectorAdd(start, boxmaxs, boxstartmaxs);
6311         VectorAdd(end, boxmins, boxendmins);
6312         VectorAdd(end, boxmaxs, boxendmaxs);
6313         Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6314         Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6315         Mod_CollisionBIH_TraceBrush(model, frameblend, skeleton, trace, &thisbrush_start.brush, &thisbrush_end.brush, hitsupercontentsmask);
6316 }
6317
6318
6319 int Mod_CollisionBIH_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6320 {
6321         trace_t trace;
6322         Mod_CollisionBIH_TracePoint(model, NULL, NULL, &trace, point, 0);
6323         return trace.startsupercontents;
6324 }
6325
6326 void Mod_CollisionBIH_TracePoint_Mesh(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
6327 {
6328 #if 0
6329         // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6330         vec3_t end;
6331         int hitsupercontents;
6332         VectorSet(end, start[0], start[1], model->normalmins[2]);
6333 #endif
6334         memset(trace, 0, sizeof(*trace));
6335         trace->fraction = 1;
6336         trace->realfraction = 1;
6337         trace->hitsupercontentsmask = hitsupercontentsmask;
6338 #if 0
6339         Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
6340         hitsupercontents = trace->hitsupercontents;
6341         memset(trace, 0, sizeof(*trace));
6342         trace->fraction = 1;
6343         trace->realfraction = 1;
6344         trace->hitsupercontentsmask = hitsupercontentsmask;
6345         trace->startsupercontents = hitsupercontents;
6346 #endif
6347 }
6348
6349 int Mod_CollisionBIH_PointSuperContents_Mesh(struct model_s *model, int frame, const vec3_t start)
6350 {
6351 #if 0
6352         // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6353         trace_t trace;
6354         vec3_t end;
6355         VectorSet(end, start[0], start[1], model->normalmins[2]);
6356         memset(&trace, 0, sizeof(trace));
6357         trace.fraction = 1;
6358         trace.realfraction = 1;
6359         trace.hitsupercontentsmask = 0;
6360         Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
6361         return trace.hitsupercontents;
6362 #else
6363         return 0;
6364 #endif
6365 }
6366
6367 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
6368 {
6369         int i;
6370         mleaf_t *leaf;
6371         colbrushf_t *brush;
6372         // find which leaf the point is in
6373         while (node->plane)
6374                 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
6375         // point trace the brushes
6376         leaf = (mleaf_t *)node;
6377         for (i = 0;i < leaf->numleafbrushes;i++)
6378         {
6379                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6380                 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
6381                 {
6382                         brush->markframe = markframe;
6383                         Collision_TracePointBrushFloat(trace, point, brush);
6384                 }
6385         }
6386         // can't do point traces on curves (they have no thickness)
6387 }
6388
6389 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)
6390 {
6391         int i, startside, endside;
6392         float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
6393         mleaf_t *leaf;
6394         msurface_t *surface;
6395         mplane_t *plane;
6396         colbrushf_t *brush;
6397         // walk the tree until we hit a leaf, recursing for any split cases
6398         while (node->plane)
6399         {
6400 #if 0
6401                 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6402                         return;
6403                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[0], start, end, startfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6404                 node = node->children[1];
6405 #else
6406                 // abort if this part of the bsp tree can not be hit by this trace
6407 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6408 //                      return;
6409                 plane = node->plane;
6410                 // axial planes are much more common than non-axial, so an optimized
6411                 // axial case pays off here
6412                 if (plane->type < 3)
6413                 {
6414                         dist1 = start[plane->type] - plane->dist;
6415                         dist2 = end[plane->type] - plane->dist;
6416                 }
6417                 else
6418                 {
6419                         dist1 = DotProduct(start, plane->normal) - plane->dist;
6420                         dist2 = DotProduct(end, plane->normal) - plane->dist;
6421                 }
6422                 startside = dist1 < 0;
6423                 endside = dist2 < 0;
6424                 if (startside == endside)
6425                 {
6426                         // most of the time the line fragment is on one side of the plane
6427                         node = node->children[startside];
6428                 }
6429                 else
6430                 {
6431                         // line crosses node plane, split the line
6432                         dist1 = PlaneDiff(linestart, plane);
6433                         dist2 = PlaneDiff(lineend, plane);
6434                         midfrac = dist1 / (dist1 - dist2);
6435                         VectorLerp(linestart, midfrac, lineend, mid);
6436                         // take the near side first
6437                         Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6438                         // if we found an impact on the front side, don't waste time
6439                         // exploring the far side
6440                         if (midfrac <= trace->realfraction)
6441                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6442                         return;
6443                 }
6444 #endif
6445         }
6446         // abort if this part of the bsp tree can not be hit by this trace
6447 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6448 //              return;
6449         // hit a leaf
6450         nodesegmentmins[0] = min(start[0], end[0]) - 1;
6451         nodesegmentmins[1] = min(start[1], end[1]) - 1;
6452         nodesegmentmins[2] = min(start[2], end[2]) - 1;
6453         nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
6454         nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
6455         nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
6456         // line trace the brushes
6457         leaf = (mleaf_t *)node;
6458 #if 0
6459         if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6460                 return;
6461 #endif
6462         for (i = 0;i < leaf->numleafbrushes;i++)
6463         {
6464                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6465                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6466                 {
6467                         brush->markframe = markframe;
6468                         Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
6469                 }
6470         }
6471         // can't do point traces on curves (they have no thickness)
6472         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
6473         {
6474                 // line trace the curves
6475                 for (i = 0;i < leaf->numleafsurfaces;i++)
6476                 {
6477                         surface = model->data_surfaces + leaf->firstleafsurface[i];
6478                         if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6479                         {
6480                                 surface->deprecatedq3collisionmarkframe = markframe;
6481                                 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->deprecatedq3data_collisionelement3i, surface->deprecatedq3data_collisionvertex3f, surface->deprecatedq3num_collisionbboxstride, surface->deprecatedq3data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
6482                         }
6483                 }
6484         }
6485 }
6486
6487 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)
6488 {
6489         int i;
6490         int sides;
6491         mleaf_t *leaf;
6492         colbrushf_t *brush;
6493         msurface_t *surface;
6494         mplane_t *plane;
6495         float nodesegmentmins[3], nodesegmentmaxs[3];
6496         // walk the tree until we hit a leaf, recursing for any split cases
6497         while (node->plane)
6498         {
6499 #if 0
6500                 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6501                         return;
6502                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6503                 node = node->children[1];
6504 #else
6505                 // abort if this part of the bsp tree can not be hit by this trace
6506 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6507 //                      return;
6508                 plane = node->plane;
6509                 // axial planes are much more common than non-axial, so an optimized
6510                 // axial case pays off here
6511                 if (plane->type < 3)
6512                 {
6513                         // this is an axial plane, compare bounding box directly to it and
6514                         // recurse sides accordingly
6515                         // recurse down node sides
6516                         // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
6517                         //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
6518                         //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
6519                         sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
6520                 }
6521                 else
6522                 {
6523                         // this is a non-axial plane, so check if the start and end boxes
6524                         // are both on one side of the plane to handle 'diagonal' cases
6525                         sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
6526                 }
6527                 if (sides == 3)
6528                 {
6529                         // segment crosses plane
6530                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6531                         sides = 2;
6532                 }
6533                 // if sides == 0 then the trace itself is bogus (Not A Number values),
6534                 // in this case we simply pretend the trace hit nothing
6535                 if (sides == 0)
6536                         return; // ERROR: NAN bounding box!
6537                 // take whichever side the segment box is on
6538                 node = node->children[sides - 1];
6539 #endif
6540         }
6541         // abort if this part of the bsp tree can not be hit by this trace
6542 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6543 //              return;
6544         nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
6545         nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
6546         nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
6547         nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
6548         nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
6549         nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
6550         // hit a leaf
6551         leaf = (mleaf_t *)node;
6552 #if 0
6553         if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6554                 return;
6555 #endif
6556         for (i = 0;i < leaf->numleafbrushes;i++)
6557         {
6558                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6559                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6560                 {
6561                         brush->markframe = markframe;
6562                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6563                 }
6564         }
6565         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
6566         {
6567                 for (i = 0;i < leaf->numleafsurfaces;i++)
6568                 {
6569                         surface = model->data_surfaces + leaf->firstleafsurface[i];
6570                         if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6571                         {
6572                                 surface->deprecatedq3collisionmarkframe = markframe;
6573                                 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->deprecatedq3data_collisionelement3i, surface->deprecatedq3data_collisionvertex3f, surface->deprecatedq3num_collisionbboxstride, surface->deprecatedq3data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
6574                         }
6575                 }
6576         }
6577 }
6578
6579
6580 static int markframe = 0;
6581
6582 static void Mod_Q3BSP_TracePoint(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
6583 {
6584         int i;
6585         q3mbrush_t *brush;
6586         memset(trace, 0, sizeof(*trace));
6587         trace->fraction = 1;
6588         trace->realfraction = 1;
6589         trace->hitsupercontentsmask = hitsupercontentsmask;
6590         if (mod_collision_bih.integer)
6591                 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6592         else if (model->brush.submodel)
6593         {
6594                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6595                         if (brush->colbrushf)
6596                                 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
6597         }
6598         else
6599                 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
6600 }
6601
6602 static void Mod_Q3BSP_TraceLine(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
6603 {
6604         int i;
6605         float segmentmins[3], segmentmaxs[3];
6606         msurface_t *surface;
6607         q3mbrush_t *brush;
6608
6609         if (VectorCompare(start, end))
6610         {
6611                 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6612                 return;
6613         }
6614
6615         memset(trace, 0, sizeof(*trace));
6616         trace->fraction = 1;
6617         trace->realfraction = 1;
6618         trace->hitsupercontentsmask = hitsupercontentsmask;
6619         segmentmins[0] = min(start[0], end[0]) - 1;
6620         segmentmins[1] = min(start[1], end[1]) - 1;
6621         segmentmins[2] = min(start[2], end[2]) - 1;
6622         segmentmaxs[0] = max(start[0], end[0]) + 1;
6623         segmentmaxs[1] = max(start[1], end[1]) + 1;
6624         segmentmaxs[2] = max(start[2], end[2]) + 1;
6625         if (mod_collision_bih.integer)
6626                 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
6627         else if (model->brush.submodel)
6628         {
6629                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6630                         if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6631                                 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6632                 if (mod_q3bsp_curves_collisions.integer)
6633                         for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6634                                 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6635                                         Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->deprecatedq3data_collisionelement3i, surface->deprecatedq3data_collisionvertex3f, surface->deprecatedq3num_collisionbboxstride, surface->deprecatedq3data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
6636         }
6637         else
6638                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
6639 }
6640
6641 void Mod_Q3BSP_TraceBrush(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, colbrushf_t *start, colbrushf_t *end, int hitsupercontentsmask)
6642 {
6643         float segmentmins[3], segmentmaxs[3];
6644         int i;
6645         msurface_t *surface;
6646         q3mbrush_t *brush;
6647
6648         if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(start->mins, start->maxs) && VectorCompare(end->mins, end->maxs))
6649         {
6650                 if (VectorCompare(start->mins, end->mins))
6651                         Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start->mins, hitsupercontentsmask);
6652                 else
6653                         Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, start->mins, end->mins, hitsupercontentsmask);
6654                 return;
6655         }
6656
6657         // box trace, performed as brush trace
6658         memset(trace, 0, sizeof(*trace));
6659         trace->fraction = 1;
6660         trace->realfraction = 1;
6661         trace->hitsupercontentsmask = hitsupercontentsmask;
6662         segmentmins[0] = min(start->mins[0], end->mins[0]);
6663         segmentmins[1] = min(start->mins[1], end->mins[1]);
6664         segmentmins[2] = min(start->mins[2], end->mins[2]);
6665         segmentmaxs[0] = max(start->maxs[0], end->maxs[0]);
6666         segmentmaxs[1] = max(start->maxs[1], end->maxs[1]);
6667         segmentmaxs[2] = max(start->maxs[2], end->maxs[2]);
6668         if (mod_collision_bih.integer)
6669                 Mod_CollisionBIH_TraceBrush(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
6670         else if (model->brush.submodel)
6671         {
6672                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6673                         if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6674                                 Collision_TraceBrushBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6675                 if (mod_q3bsp_curves_collisions.integer)
6676                         for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6677                                 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6678                                         Collision_TraceBrushTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->deprecatedq3data_collisionelement3i, surface->deprecatedq3data_collisionvertex3f, surface->deprecatedq3num_collisionbboxstride, surface->deprecatedq3data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
6679         }
6680         else
6681                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, ++markframe, segmentmins, segmentmaxs);
6682 }
6683
6684 static void Mod_Q3BSP_TraceBox(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
6685 {
6686         colboxbrushf_t thisbrush_start, thisbrush_end;
6687         vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6688
6689         // box trace, performed as brush trace
6690         VectorAdd(start, boxmins, boxstartmins);
6691         VectorAdd(start, boxmaxs, boxstartmaxs);
6692         VectorAdd(end, boxmins, boxendmins);
6693         VectorAdd(end, boxmaxs, boxendmaxs);
6694         Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6695         Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6696         Mod_Q3BSP_TraceBrush(model, frameblend, skeleton, trace, &thisbrush_start.brush, &thisbrush_end.brush, hitsupercontentsmask);
6697 }
6698
6699 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6700 {
6701         int i;
6702         int supercontents = 0;
6703         q3mbrush_t *brush;
6704         if (mod_collision_bih.integer)
6705         {
6706                 trace_t trace;
6707                 Mod_Q3BSP_TracePoint(model, NULL, NULL, &trace, point, 0);
6708                 supercontents = trace.startsupercontents;
6709         }
6710         // test if the point is inside each brush
6711         else if (model->brush.submodel)
6712         {
6713                 // submodels are effectively one leaf
6714                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6715                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6716                                 supercontents |= brush->colbrushf->supercontents;
6717         }
6718         else
6719         {
6720                 mnode_t *node = model->brush.data_nodes;
6721                 mleaf_t *leaf;
6722                 // find which leaf the point is in
6723                 while (node->plane)
6724                         node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
6725                 leaf = (mleaf_t *)node;
6726                 // now check the brushes in the leaf
6727                 for (i = 0;i < leaf->numleafbrushes;i++)
6728                 {
6729                         brush = model->brush.data_brushes + leaf->firstleafbrush[i];
6730                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6731                                 supercontents |= brush->colbrushf->supercontents;
6732                 }
6733         }
6734         return supercontents;
6735 }
6736
6737 void Mod_CollisionBIH_TraceLineAgainstSurfaces(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
6738 {
6739         Mod_CollisionBIH_TraceLineShared(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, &model->render_bih);
6740 }
6741
6742
6743 bih_t *Mod_MakeCollisionBIH(dp_model_t *model, qboolean userendersurfaces, bih_t *out)
6744 {
6745         int j;
6746         int bihnumleafs;
6747         int bihmaxnodes;
6748         int brushindex;
6749         int triangleindex;
6750         int bihleafindex;
6751         int nummodelbrushes = model->nummodelbrushes;
6752         int nummodelsurfaces = model->nummodelsurfaces;
6753         const int *e;
6754         const int *collisionelement3i;
6755         const float *collisionvertex3f;
6756         const int *renderelement3i;
6757         const float *rendervertex3f;
6758         bih_leaf_t *bihleafs;
6759         bih_node_t *bihnodes;
6760         int *temp_leafsort;
6761         int *temp_leafsortscratch;
6762         const msurface_t *surface;
6763         const q3mbrush_t *brush;
6764
6765         // find out how many BIH leaf nodes we need
6766         bihnumleafs = 0;
6767         if (userendersurfaces)
6768         {
6769                 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6770                         bihnumleafs += surface->num_triangles;
6771         }
6772         else
6773         {
6774                 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
6775                         if (brush->colbrushf)
6776                                 bihnumleafs++;
6777                 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6778                 {
6779                         if (surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS)
6780                                 bihnumleafs += surface->num_triangles + surface->num_collisiontriangles;
6781                         else
6782                                 bihnumleafs += surface->num_collisiontriangles;
6783                 }
6784         }
6785
6786         if (!bihnumleafs)
6787                 return NULL;
6788
6789         // allocate the memory for the BIH leaf nodes
6790         bihleafs = (bih_leaf_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_leaf_t) * bihnumleafs);
6791
6792         // now populate the BIH leaf nodes
6793         bihleafindex = 0;
6794
6795         // add render surfaces
6796         renderelement3i = model->surfmesh.data_element3i;
6797         rendervertex3f = model->surfmesh.data_vertex3f;
6798         for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6799         {
6800                 for (triangleindex = 0, e = renderelement3i + 3*surface->num_firsttriangle;triangleindex < surface->num_triangles;triangleindex++, e += 3)
6801                 {
6802                         if (!userendersurfaces && !(surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS))
6803                                 continue;
6804                         bihleafs[bihleafindex].type = BIH_RENDERTRIANGLE;
6805                         bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
6806                         bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
6807                         bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firsttriangle;
6808                         bihleafs[bihleafindex].mins[0] = min(rendervertex3f[3*e[0]+0], min(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) - 1;
6809                         bihleafs[bihleafindex].mins[1] = min(rendervertex3f[3*e[0]+1], min(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) - 1;
6810                         bihleafs[bihleafindex].mins[2] = min(rendervertex3f[3*e[0]+2], min(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) - 1;
6811                         bihleafs[bihleafindex].maxs[0] = max(rendervertex3f[3*e[0]+0], max(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) + 1;
6812                         bihleafs[bihleafindex].maxs[1] = max(rendervertex3f[3*e[0]+1], max(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) + 1;
6813                         bihleafs[bihleafindex].maxs[2] = max(rendervertex3f[3*e[0]+2], max(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) + 1;
6814                         bihleafindex++;
6815                 }
6816         }
6817
6818         if (!userendersurfaces)
6819         {
6820                 // add collision brushes
6821                 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
6822                 {
6823                         if (!brush->colbrushf)
6824                                 continue;
6825                         bihleafs[bihleafindex].type = BIH_BRUSH;
6826                         bihleafs[bihleafindex].textureindex = brush->texture - model->data_textures;
6827                         bihleafs[bihleafindex].surfaceindex = -1;
6828                         bihleafs[bihleafindex].itemindex = brushindex+model->firstmodelbrush;
6829                         VectorCopy(brush->colbrushf->mins, bihleafs[bihleafindex].mins);
6830                         VectorCopy(brush->colbrushf->maxs, bihleafs[bihleafindex].maxs);
6831                         bihleafindex++;
6832                 }
6833
6834                 // add collision surfaces
6835                 collisionelement3i = model->brush.data_collisionelement3i;
6836                 collisionvertex3f = model->brush.data_collisionvertex3f;
6837                 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6838                 {
6839                         for (triangleindex = 0, e = collisionelement3i + 3*surface->num_firstcollisiontriangle;triangleindex < surface->num_collisiontriangles;triangleindex++, e += 3)
6840                         {
6841                                 bihleafs[bihleafindex].type = BIH_COLLISIONTRIANGLE;
6842                                 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
6843                                 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
6844                                 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firstcollisiontriangle;
6845                                 bihleafs[bihleafindex].mins[0] = min(collisionvertex3f[3*e[0]+0], min(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) - 1;
6846                                 bihleafs[bihleafindex].mins[1] = min(collisionvertex3f[3*e[0]+1], min(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) - 1;
6847                                 bihleafs[bihleafindex].mins[2] = min(collisionvertex3f[3*e[0]+2], min(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) - 1;
6848                                 bihleafs[bihleafindex].maxs[0] = max(collisionvertex3f[3*e[0]+0], max(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) + 1;
6849                                 bihleafs[bihleafindex].maxs[1] = max(collisionvertex3f[3*e[0]+1], max(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) + 1;
6850                                 bihleafs[bihleafindex].maxs[2] = max(collisionvertex3f[3*e[0]+2], max(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) + 1;
6851                                 bihleafindex++;
6852                         }
6853                 }
6854         }
6855
6856         // allocate buffers for the produced and temporary data
6857         bihmaxnodes = bihnumleafs + 1;
6858         bihnodes = (bih_node_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_node_t) * bihmaxnodes);
6859         temp_leafsort = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * bihnumleafs * 2);
6860         temp_leafsortscratch = temp_leafsort + bihnumleafs;
6861
6862         // now build it
6863         BIH_Build(out, bihnumleafs, bihleafs, bihmaxnodes, bihnodes, temp_leafsort, temp_leafsortscratch);
6864
6865         // we're done with the temporary data
6866         Mem_Free(temp_leafsort);
6867
6868         // resize the BIH nodes array if it over-allocated
6869         if (out->maxnodes > out->numnodes)
6870         {
6871                 out->maxnodes = out->numnodes;
6872                 out->nodes = (bih_node_t *)Mem_Realloc(loadmodel->mempool, out->nodes, out->numnodes * sizeof(bih_node_t));
6873         }
6874
6875         return out;
6876 }
6877
6878 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
6879 {
6880         int supercontents = 0;
6881         if (nativecontents & CONTENTSQ3_SOLID)
6882                 supercontents |= SUPERCONTENTS_SOLID;
6883         if (nativecontents & CONTENTSQ3_WATER)
6884                 supercontents |= SUPERCONTENTS_WATER;
6885         if (nativecontents & CONTENTSQ3_SLIME)
6886                 supercontents |= SUPERCONTENTS_SLIME;
6887         if (nativecontents & CONTENTSQ3_LAVA)
6888                 supercontents |= SUPERCONTENTS_LAVA;
6889         if (nativecontents & CONTENTSQ3_BODY)
6890                 supercontents |= SUPERCONTENTS_BODY;
6891         if (nativecontents & CONTENTSQ3_CORPSE)
6892                 supercontents |= SUPERCONTENTS_CORPSE;
6893         if (nativecontents & CONTENTSQ3_NODROP)
6894                 supercontents |= SUPERCONTENTS_NODROP;
6895         if (nativecontents & CONTENTSQ3_PLAYERCLIP)
6896                 supercontents |= SUPERCONTENTS_PLAYERCLIP;
6897         if (nativecontents & CONTENTSQ3_MONSTERCLIP)
6898                 supercontents |= SUPERCONTENTS_MONSTERCLIP;
6899         if (nativecontents & CONTENTSQ3_DONOTENTER)
6900                 supercontents |= SUPERCONTENTS_DONOTENTER;
6901         if (nativecontents & CONTENTSQ3_BOTCLIP)
6902                 supercontents |= SUPERCONTENTS_BOTCLIP;
6903         if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
6904                 supercontents |= SUPERCONTENTS_OPAQUE;
6905         return supercontents;
6906 }
6907
6908 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
6909 {
6910         int nativecontents = 0;
6911         if (supercontents & SUPERCONTENTS_SOLID)
6912                 nativecontents |= CONTENTSQ3_SOLID;
6913         if (supercontents & SUPERCONTENTS_WATER)
6914                 nativecontents |= CONTENTSQ3_WATER;
6915         if (supercontents & SUPERCONTENTS_SLIME)
6916                 nativecontents |= CONTENTSQ3_SLIME;
6917         if (supercontents & SUPERCONTENTS_LAVA)
6918                 nativecontents |= CONTENTSQ3_LAVA;
6919         if (supercontents & SUPERCONTENTS_BODY)
6920                 nativecontents |= CONTENTSQ3_BODY;
6921         if (supercontents & SUPERCONTENTS_CORPSE)
6922                 nativecontents |= CONTENTSQ3_CORPSE;
6923         if (supercontents & SUPERCONTENTS_NODROP)
6924                 nativecontents |= CONTENTSQ3_NODROP;
6925         if (supercontents & SUPERCONTENTS_PLAYERCLIP)
6926                 nativecontents |= CONTENTSQ3_PLAYERCLIP;
6927         if (supercontents & SUPERCONTENTS_MONSTERCLIP)
6928                 nativecontents |= CONTENTSQ3_MONSTERCLIP;
6929         if (supercontents & SUPERCONTENTS_DONOTENTER)
6930                 nativecontents |= CONTENTSQ3_DONOTENTER;
6931         if (supercontents & SUPERCONTENTS_BOTCLIP)
6932                 nativecontents |= CONTENTSQ3_BOTCLIP;
6933         if (!(supercontents & SUPERCONTENTS_OPAQUE))
6934                 nativecontents |= CONTENTSQ3_TRANSLUCENT;
6935         return nativecontents;
6936 }
6937
6938 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
6939 {
6940         int numleafs;
6941         while (node->plane)
6942         {
6943                 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
6944                 node = node->children[1];
6945         }
6946         numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
6947         if (loadmodel->brush.num_leafs < numleafs)
6948                 loadmodel->brush.num_leafs = numleafs;
6949 }
6950
6951 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6952 {
6953         int i, j, lumps;
6954         q3dheader_t *header;
6955         float corner[3], yawradius, modelradius;
6956
6957         mod->modeldatatypestring = "Q3BSP";
6958
6959         mod->type = mod_brushq3;
6960         mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
6961         mod->numskins = 1;
6962
6963         header = (q3dheader_t *)buffer;
6964         if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
6965                 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
6966
6967         i = LittleLong(header->version);
6968         if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
6969                 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
6970
6971         mod->soundfromcenter = true;
6972         mod->TraceBox = Mod_Q3BSP_TraceBox;
6973         mod->TraceBrush = Mod_Q3BSP_TraceBrush;
6974         mod->TraceLine = Mod_Q3BSP_TraceLine;
6975         mod->TracePoint = Mod_Q3BSP_TracePoint;
6976         mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
6977         mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
6978         mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
6979         mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
6980         mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
6981         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
6982         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
6983         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
6984         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
6985         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
6986         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
6987         mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
6988         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
6989         mod->brush.AmbientSoundLevelsForPoint = NULL;
6990         mod->brush.RoundUpToHullSize = NULL;
6991         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
6992         mod->Draw = R_Q1BSP_Draw;
6993         mod->DrawDepth = R_Q1BSP_DrawDepth;
6994         mod->DrawDebug = R_Q1BSP_DrawDebug;
6995         mod->DrawPrepass = R_Q1BSP_DrawPrepass;
6996         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
6997         mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6998         mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6999         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7000         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7001         mod->DrawLight = R_Q1BSP_DrawLight;
7002
7003         mod_base = (unsigned char *)header;
7004
7005         // swap all the lumps
7006         header->ident = LittleLong(header->ident);
7007         header->version = LittleLong(header->version);
7008         lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
7009         for (i = 0;i < lumps;i++)
7010         {
7011                 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
7012                 if((char *) bufferend < (char *) buffer + j)
7013                         Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
7014                 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
7015                 if((char *) bufferend < (char *) buffer + j)
7016                         Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
7017         }
7018         /*
7019          * NO, do NOT clear them!
7020          * they contain actual data referenced by other stuff.
7021          * Instead, before using the advertisements lump, check header->versio
7022          * again!
7023          * Sorry, but otherwise it breaks memory of the first lump.
7024         for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
7025         {
7026                 header->lumps[i].fileofs = 0;
7027                 header->lumps[i].filelen = 0;
7028         }
7029         */
7030
7031         mod->brush.qw_md4sum = 0;
7032         mod->brush.qw_md4sum2 = 0;
7033         for (i = 0;i < lumps;i++)
7034         {
7035                 if (i == Q3LUMP_ENTITIES)
7036                         continue;
7037                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7038                 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
7039                         continue;
7040                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7041
7042                 // all this checksumming can take a while, so let's send keepalives here too
7043                 CL_KeepaliveMessage(false);
7044         }
7045
7046         Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
7047         Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
7048         Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
7049         if (header->version == Q3BSPVERSION_IG)
7050                 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
7051         else
7052                 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
7053         Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
7054         Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
7055         Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
7056         Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
7057         Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
7058         Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
7059         Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
7060         Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
7061         Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
7062         Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
7063         Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
7064         Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
7065         Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
7066         loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
7067
7068         // the MakePortals code works fine on the q3bsp data as well
7069         if (mod_bsp_portalize.integer)
7070                 Mod_Q1BSP_MakePortals();
7071
7072         // FIXME: shader alpha should replace r_wateralpha support in q3bsp
7073         loadmodel->brush.supportwateralpha = true;
7074
7075         // make a single combined shadow mesh to allow optimized shadow volume creation
7076         Mod_Q1BSP_CreateShadowMesh(loadmodel);
7077
7078         loadmodel->brush.num_leafs = 0;
7079         Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
7080
7081         if (loadmodel->brush.numsubmodels)
7082                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7083
7084         mod = loadmodel;
7085         for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7086         {
7087                 if (i > 0)
7088                 {
7089                         char name[10];
7090                         // duplicate the basic information
7091                         dpsnprintf(name, sizeof(name), "*%i", i);
7092                         mod = Mod_FindName(name, loadmodel->name);
7093                         // copy the base model to this one
7094                         *mod = *loadmodel;
7095                         // rename the clone back to its proper name
7096                         strlcpy(mod->name, name, sizeof(mod->name));
7097                         mod->brush.parentmodel = loadmodel;
7098                         // textures and memory belong to the main model
7099                         mod->texturepool = NULL;
7100                         mod->mempool = NULL;
7101                         mod->brush.GetPVS = NULL;
7102                         mod->brush.FatPVS = NULL;
7103                         mod->brush.BoxTouchingPVS = NULL;
7104                         mod->brush.BoxTouchingLeafPVS = NULL;
7105                         mod->brush.BoxTouchingVisibleLeafs = NULL;
7106                         mod->brush.FindBoxClusters = NULL;
7107                         mod->brush.LightPoint = NULL;
7108                         mod->brush.AmbientSoundLevelsForPoint = NULL;
7109                 }
7110                 mod->brush.submodel = i;
7111                 if (loadmodel->brush.submodels)
7112                         loadmodel->brush.submodels[i] = mod;
7113
7114                 // make the model surface list (used by shadowing/lighting)
7115                 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
7116                 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
7117                 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
7118                 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
7119                 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
7120                 Mod_MakeSortedSurfaces(mod);
7121
7122                 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
7123                 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
7124                 // enlarge the bounding box to enclose all geometry of this model,
7125                 // because q3map2 sometimes lies (mostly to affect the lightgrid),
7126                 // which can in turn mess up the farclip (as well as culling when
7127                 // outside the level - an unimportant concern)
7128
7129                 //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]);
7130                 for (j = 0;j < mod->nummodelsurfaces;j++)
7131                 {
7132                         const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7133                         const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7134                         int k;
7135                         if (!surface->num_vertices)
7136                                 continue;
7137                         for (k = 0;k < surface->num_vertices;k++, v += 3)
7138                         {
7139                                 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7140                                 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7141                                 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7142                                 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7143                                 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7144                                 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7145                         }
7146                 }
7147                 //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]);
7148                 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7149                 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7150                 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7151                 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7152                 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7153                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7154                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7155                 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7156                 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7157                 mod->yawmins[2] = mod->normalmins[2];
7158                 mod->yawmaxs[2] = mod->normalmaxs[2];
7159                 mod->radius = modelradius;
7160                 mod->radius2 = modelradius * modelradius;
7161
7162                 // this gets altered below if sky or water is used
7163                 mod->DrawSky = NULL;
7164                 mod->DrawAddWaterPlanes = NULL;
7165
7166                 for (j = 0;j < mod->nummodelsurfaces;j++)
7167                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7168                                 break;
7169                 if (j < mod->nummodelsurfaces)
7170                         mod->DrawSky = R_Q1BSP_DrawSky;
7171
7172                 for (j = 0;j < mod->nummodelsurfaces;j++)
7173                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7174                                 break;
7175                 if (j < mod->nummodelsurfaces)
7176                         mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
7177
7178                 Mod_MakeCollisionBIH(mod, false, &mod->collision_bih);
7179                 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
7180
7181                 // generate VBOs and other shared data before cloning submodels
7182                 if (i == 0)
7183                         Mod_BuildVBOs();
7184         }
7185
7186         Con_DPrintf("Stats for q3bsp model \"%s\": %i faces, %i nodes, %i leafs, %i clusters, %i clusterportals, mesh: %i vertices, %i triangles, %i surfaces\n", loadmodel->name, loadmodel->num_surfaces, loadmodel->brush.num_nodes, loadmodel->brush.num_leafs, mod->brush.num_pvsclusters, loadmodel->brush.num_portals, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->num_surfaces);
7187 }
7188
7189 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7190 {
7191         int i = LittleLong(((int *)buffer)[1]);
7192         if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
7193                 Mod_Q3BSP_Load(mod,buffer, bufferend);
7194         else if (i == Q2BSPVERSION)
7195                 Mod_Q2BSP_Load(mod,buffer, bufferend);
7196         else
7197                 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
7198 }
7199
7200 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7201 {
7202         Host_Error("Mod_MAP_Load: not yet implemented");
7203 }
7204
7205 typedef struct objvertex_s
7206 {
7207         int nextindex;
7208         int submodelindex;
7209         int textureindex;
7210         float v[3];
7211         float vt[2];
7212         float vn[3];
7213 }
7214 objvertex_t;
7215
7216 static unsigned char nobsp_pvs[1] = {1};
7217
7218 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
7219 {
7220         const char *textbase = (char *)buffer, *text = textbase;
7221         char *s;
7222         char *argv[512];
7223         char line[1024];
7224         char materialname[MAX_QPATH];
7225         int i, j, l, numvertices, firstvertex, firsttriangle, elementindex, vertexindex, surfacevertices, surfacetriangles, surfaceelements, submodelindex = 0;
7226         int index1, index2, index3;
7227         objvertex_t vfirst, vprev, vcurrent;
7228         int argc;
7229         int linelen;
7230         int numtriangles = 0;
7231         int maxtriangles = 0;
7232         objvertex_t *vertices = NULL;
7233         int linenumber = 0;
7234         int maxtextures = 0, numtextures = 0, textureindex = 0;
7235         int maxv = 0, numv = 1;
7236         int maxvt = 0, numvt = 1;
7237         int maxvn = 0, numvn = 1;
7238         char *texturenames = NULL;
7239         float dist, modelradius, modelyawradius, yawradius;
7240         float *v = NULL;
7241         float *vt = NULL;
7242         float *vn = NULL;
7243         float mins[3];
7244         float maxs[3];
7245         float corner[3];
7246         objvertex_t *thisvertex = NULL;
7247         int vertexhashindex;
7248         int *vertexhashtable = NULL;
7249         objvertex_t *vertexhashdata = NULL;
7250         objvertex_t *vdata = NULL;
7251         int vertexhashsize = 0;
7252         int vertexhashcount = 0;
7253         skinfile_t *skinfiles = NULL;
7254         unsigned char *data = NULL;
7255         int *submodelfirstsurface;
7256         msurface_t *surface;
7257         msurface_t *tempsurfaces;
7258
7259         memset(&vfirst, 0, sizeof(vfirst));
7260         memset(&vprev, 0, sizeof(vprev));
7261         memset(&vcurrent, 0, sizeof(vcurrent));
7262
7263         dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
7264
7265         loadmodel->modeldatatypestring = "OBJ";
7266
7267         loadmodel->type = mod_obj;
7268         loadmodel->soundfromcenter = true;
7269         loadmodel->TraceBox = Mod_CollisionBIH_TraceBox;
7270         loadmodel->TraceBrush = Mod_CollisionBIH_TraceBrush;
7271         loadmodel->TraceLine = Mod_CollisionBIH_TraceLine;
7272         loadmodel->TracePoint = Mod_CollisionBIH_TracePoint_Mesh;
7273         loadmodel->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7274         loadmodel->PointSuperContents = Mod_CollisionBIH_PointSuperContents_Mesh;
7275         loadmodel->brush.TraceLineOfSight = NULL;
7276         loadmodel->brush.SuperContentsFromNativeContents = NULL;
7277         loadmodel->brush.NativeContentsFromSuperContents = NULL;
7278         loadmodel->brush.GetPVS = NULL;
7279         loadmodel->brush.FatPVS = NULL;
7280         loadmodel->brush.BoxTouchingPVS = NULL;
7281         loadmodel->brush.BoxTouchingLeafPVS = NULL;
7282         loadmodel->brush.BoxTouchingVisibleLeafs = NULL;
7283         loadmodel->brush.FindBoxClusters = NULL;
7284         loadmodel->brush.LightPoint = NULL;
7285         loadmodel->brush.FindNonSolidLocation = NULL;
7286         loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
7287         loadmodel->brush.RoundUpToHullSize = NULL;
7288         loadmodel->brush.PointInLeaf = NULL;
7289         loadmodel->Draw = R_Q1BSP_Draw;
7290         loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
7291         loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
7292         loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
7293         loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
7294         loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7295         loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7296         loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7297         loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7298         loadmodel->DrawLight = R_Q1BSP_DrawLight;
7299
7300         skinfiles = Mod_LoadSkinFiles();
7301         if (loadmodel->numskins < 1)
7302                 loadmodel->numskins = 1;
7303
7304         // make skinscenes for the skins (no groups)
7305         loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
7306         for (i = 0;i < loadmodel->numskins;i++)
7307         {
7308                 loadmodel->skinscenes[i].firstframe = i;
7309                 loadmodel->skinscenes[i].framecount = 1;
7310                 loadmodel->skinscenes[i].loop = true;
7311                 loadmodel->skinscenes[i].framerate = 10;
7312         }
7313
7314         VectorClear(mins);
7315         VectorClear(maxs);
7316
7317         // we always have model 0, i.e. the first "submodel"
7318         loadmodel->brush.numsubmodels = 1;
7319
7320         // parse the OBJ text now
7321         for(;;)
7322         {
7323                 static char emptyarg[1] = "";
7324                 if (!*text)
7325                         break;
7326                 linenumber++;
7327                 linelen = 0;
7328                 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
7329                         line[linelen] = text[linelen];
7330                 line[linelen] = 0;
7331                 for (argc = 0;argc < 4;argc++)
7332                         argv[argc] = emptyarg;
7333                 argc = 0;
7334                 s = line;
7335                 while (*s == ' ' || *s == '\t')
7336                         s++;
7337                 while (*s)
7338                 {
7339                         argv[argc++] = s;
7340                         while (*s > ' ')
7341                                 s++;
7342                         if (!*s)
7343                                 break;
7344                         *s++ = 0;
7345                         while (*s == ' ' || *s == '\t')
7346                                 s++;
7347                 }
7348                 text += linelen;
7349                 if (*text == '\r')
7350                         text++;
7351                 if (*text == '\n')
7352                         text++;
7353                 if (!argc)
7354                         continue;
7355                 if (argv[0][0] == '#')
7356                         continue;
7357                 if (!strcmp(argv[0], "v"))
7358                 {
7359                         if (maxv <= numv)
7360                         {
7361                                 maxv = max(maxv * 2, 1024);
7362                                 v = (float *)Mem_Realloc(tempmempool, v, maxv * sizeof(float[3]));
7363                         }
7364                         v[numv*3+0] = atof(argv[1]);
7365                         v[numv*3+2] = atof(argv[2]);
7366                         v[numv*3+1] = atof(argv[3]);
7367                         numv++;
7368                 }
7369                 else if (!strcmp(argv[0], "vt"))
7370                 {
7371                         if (maxvt <= numvt)
7372                         {
7373                                 maxvt = max(maxvt * 2, 1024);
7374                                 vt = (float *)Mem_Realloc(tempmempool, vt, maxvt * sizeof(float[2]));
7375                         }
7376                         vt[numvt*2+0] = atof(argv[1]);
7377                         vt[numvt*2+1] = 1-atof(argv[2]);
7378                         numvt++;
7379                 }
7380                 else if (!strcmp(argv[0], "vn"))
7381                 {
7382                         if (maxvn <= numvn)
7383                         {
7384                                 maxvn = max(maxvn * 2, 1024);
7385                                 vn = (float *)Mem_Realloc(tempmempool, vn, maxvn * sizeof(float[3]));
7386                         }
7387                         vn[numvn*3+0] = atof(argv[1]);
7388                         vn[numvn*3+2] = atof(argv[2]);
7389                         vn[numvn*3+1] = atof(argv[3]);
7390                         numvn++;
7391                 }
7392                 else if (!strcmp(argv[0], "f"))
7393                 {
7394                         if (!numtextures)
7395                         {
7396                                 if (maxtextures <= numtextures)
7397                                 {
7398                                         maxtextures = max(maxtextures * 2, 256);
7399                                         texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7400                                 }
7401                                 textureindex = numtextures++;
7402                                 strlcpy(texturenames + textureindex*MAX_QPATH, loadmodel->name, MAX_QPATH);
7403                         }
7404                         for (j = 1;j < argc;j++)
7405                         {
7406                                 index1 = atoi(argv[j]);
7407                                 while(argv[j][0] && argv[j][0] != '/')
7408                                         argv[j]++;
7409                                 if (argv[j][0])
7410                                         argv[j]++;
7411                                 index2 = atoi(argv[j]);
7412                                 while(argv[j][0] && argv[j][0] != '/')
7413                                         argv[j]++;
7414                                 if (argv[j][0])
7415                                         argv[j]++;
7416                                 index3 = atoi(argv[j]);
7417                                 // negative refers to a recent vertex
7418                                 // zero means not specified
7419                                 // positive means an absolute vertex index
7420                                 if (index1 < 0)
7421                                         index1 = numv - index1;
7422                                 if (index2 < 0)
7423                                         index2 = numvt - index2;
7424                                 if (index3 < 0)
7425                                         index3 = numvn - index3;
7426                                 vcurrent.nextindex = -1;
7427                                 vcurrent.textureindex = textureindex;
7428                                 vcurrent.submodelindex = submodelindex;
7429                                 if (v && index1 >= 0 && index1 < numv)
7430                                         VectorCopy(v + 3*index1, vcurrent.v);
7431                                 if (vt && index2 >= 0 && index2 < numvt)
7432                                         Vector2Copy(vt + 2*index2, vcurrent.vt);
7433                                 if (vn && index3 >= 0 && index3 < numvn)
7434                                         VectorCopy(vn + 3*index3, vcurrent.vn);
7435                                 if (numtriangles == 0)
7436                                 {
7437                                         VectorCopy(vcurrent.v, mins);
7438                                         VectorCopy(vcurrent.v, maxs);
7439                                 }
7440                                 else
7441                                 {
7442                                         mins[0] = min(mins[0], vcurrent.v[0]);
7443                                         mins[1] = min(mins[1], vcurrent.v[1]);
7444                                         mins[2] = min(mins[2], vcurrent.v[2]);
7445                                         maxs[0] = max(maxs[0], vcurrent.v[0]);
7446                                         maxs[1] = max(maxs[1], vcurrent.v[1]);
7447                                         maxs[2] = max(maxs[2], vcurrent.v[2]);
7448                                 }
7449                                 if (j == 1)
7450                                         vfirst = vcurrent;
7451                                 else if (j >= 3)
7452                                 {
7453                                         if (maxtriangles <= numtriangles)
7454                                         {
7455                                                 maxtriangles = max(maxtriangles * 2, 32768);
7456                                                 vertices = (objvertex_t*)Mem_Realloc(loadmodel->mempool, vertices, maxtriangles * sizeof(objvertex_t[3]));
7457                                         }
7458                                         vertices[numtriangles*3+0] = vfirst;
7459                                         vertices[numtriangles*3+1] = vprev;
7460                                         vertices[numtriangles*3+2] = vcurrent;
7461                                         numtriangles++;
7462                                 }
7463                                 vprev = vcurrent;
7464                         }
7465                 }
7466                 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
7467                 {
7468                         submodelindex = atof(argv[1]);
7469                         loadmodel->brush.numsubmodels = max(submodelindex + 1, loadmodel->brush.numsubmodels);
7470                 }
7471                 else if (!strcmp(argv[0], "usemtl"))
7472                 {
7473                         for (i = 0;i < numtextures;i++)
7474                                 if (!strcmp(texturenames+i*MAX_QPATH, argv[1]))
7475                                         break;
7476                         if (i < numtextures)
7477                                 textureindex = i;
7478                         else
7479                         {
7480                                 if (maxtextures <= numtextures)
7481                                 {
7482                                         maxtextures = max(maxtextures * 2, 256);
7483                                         texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7484                                 }
7485                                 textureindex = numtextures++;
7486                                 strlcpy(texturenames + textureindex*MAX_QPATH, argv[1], MAX_QPATH);
7487                         }
7488                 }
7489         }
7490
7491         // now that we have the OBJ data loaded as-is, we can convert it
7492
7493         // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
7494         VectorCopy(mins, loadmodel->normalmins);
7495         VectorCopy(maxs, loadmodel->normalmaxs);
7496         dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
7497         modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
7498         modelyawradius = dist*dist+modelyawradius*modelyawradius;
7499         modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
7500         modelradius = modelyawradius + modelradius * modelradius;
7501         modelyawradius = sqrt(modelyawradius);
7502         modelradius = sqrt(modelradius);
7503         loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
7504         loadmodel->yawmins[2] = loadmodel->normalmins[2];
7505         loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] =  modelyawradius;
7506         loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
7507         loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
7508         loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] =  modelradius;
7509         loadmodel->radius = modelradius;
7510         loadmodel->radius2 = modelradius * modelradius;
7511
7512         // allocate storage for triangles
7513         loadmodel->surfmesh.data_element3i = (int *)Mem_Alloc(loadmodel->mempool, numtriangles * sizeof(int[3]));
7514         // allocate vertex hash structures to build an optimal vertex subset
7515         vertexhashsize = numtriangles*2;
7516         vertexhashtable = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * vertexhashsize);
7517         memset(vertexhashtable, 0xFF, sizeof(int) * vertexhashsize);
7518         vertexhashdata = (objvertex_t *)Mem_Alloc(loadmodel->mempool, sizeof(*vertexhashdata) * numtriangles*3);
7519         vertexhashcount = 0;
7520
7521         // gather surface stats for assigning vertex/triangle ranges
7522         firstvertex = 0;
7523         firsttriangle = 0;
7524         elementindex = 0;
7525         loadmodel->num_surfaces = 0;
7526         // allocate storage for the worst case number of surfaces, later we resize
7527         tempsurfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, numtextures * loadmodel->brush.numsubmodels * sizeof(msurface_t));
7528         submodelfirstsurface = (int *)Mem_Alloc(loadmodel->mempool, (loadmodel->brush.numsubmodels+1) * sizeof(int));
7529         surface = tempsurfaces;
7530         for (submodelindex = 0;submodelindex < loadmodel->brush.numsubmodels;submodelindex++)
7531         {
7532                 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7533                 for (textureindex = 0;textureindex < numtextures;textureindex++)
7534                 {
7535                         for (vertexindex = 0;vertexindex < numtriangles*3;vertexindex++)
7536                         {
7537                                 thisvertex = vertices + vertexindex;
7538                                 if (thisvertex->submodelindex == submodelindex && thisvertex->textureindex == textureindex)
7539                                         break;
7540                         }
7541                         // skip the surface creation if there are no triangles for it
7542                         if (vertexindex == numtriangles*3)
7543                                 continue;
7544                         // create a surface for these vertices
7545                         surfacevertices = 0;
7546                         surfaceelements = 0;
7547                         // we hack in a texture index in the surface to be fixed up later...
7548                         surface->texture = (texture_t *)((size_t)textureindex);
7549                         // calculate bounds as we go
7550                         VectorCopy(thisvertex->v, surface->mins);
7551                         VectorCopy(thisvertex->v, surface->maxs);
7552                         for (;vertexindex < numtriangles*3;vertexindex++)
7553                         {
7554                                 thisvertex = vertices + vertexindex;
7555                                 if (thisvertex->submodelindex != submodelindex)
7556                                         continue;
7557                                 if (thisvertex->textureindex != textureindex)
7558                                         continue;
7559                                 // add vertex to surface bounds
7560                                 surface->mins[0] = min(surface->mins[0], thisvertex->v[0]);
7561                                 surface->mins[1] = min(surface->mins[1], thisvertex->v[1]);
7562                                 surface->mins[2] = min(surface->mins[2], thisvertex->v[2]);
7563                                 surface->maxs[0] = max(surface->maxs[0], thisvertex->v[0]);
7564                                 surface->maxs[1] = max(surface->maxs[1], thisvertex->v[1]);
7565                                 surface->maxs[2] = max(surface->maxs[2], thisvertex->v[2]);
7566                                 // add the vertex if it is not found in the merged set, and
7567                                 // get its index (triangle element) for the surface
7568                                 vertexhashindex = (unsigned int)(thisvertex->v[0] * 3571 + thisvertex->v[0] * 1777 + thisvertex->v[0] * 457) % (unsigned int)vertexhashsize;
7569                                 for (i = vertexhashtable[vertexhashindex];i >= 0;i = vertexhashdata[i].nextindex)
7570                                 {
7571                                         vdata = vertexhashdata + i;
7572                                         if (vdata->submodelindex == thisvertex->submodelindex && vdata->textureindex == thisvertex->textureindex && VectorCompare(thisvertex->v, vdata->v) && VectorCompare(thisvertex->vn, vdata->vn) && Vector2Compare(thisvertex->vt, vdata->vt))
7573                                                 break;
7574                                 }
7575                                 if (i < 0)
7576                                 {
7577                                         i = vertexhashcount++;
7578                                         vdata = vertexhashdata + i;
7579                                         *vdata = *thisvertex;
7580                                         vdata->nextindex = vertexhashtable[vertexhashindex];
7581                                         vertexhashtable[vertexhashindex] = i;
7582                                         surfacevertices++;
7583                                 }
7584                                 loadmodel->surfmesh.data_element3i[elementindex++] = i;
7585                                 surfaceelements++;
7586                         }
7587                         surfacetriangles = surfaceelements / 3;
7588                         surface->num_vertices = surfacevertices;
7589                         surface->num_triangles = surfacetriangles;
7590                         surface->num_firstvertex = firstvertex;
7591                         surface->num_firsttriangle = firsttriangle;
7592                         firstvertex += surface->num_vertices;
7593                         firsttriangle += surface->num_triangles;
7594                         surface++;
7595                         loadmodel->num_surfaces++;
7596                 }
7597         }
7598         submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7599         numvertices = firstvertex;
7600         loadmodel->data_surfaces = (msurface_t *)Mem_Realloc(loadmodel->mempool, tempsurfaces, loadmodel->num_surfaces * sizeof(msurface_t));
7601         tempsurfaces = NULL;
7602
7603         // allocate storage for final mesh data
7604         loadmodel->num_textures = numtextures * loadmodel->numskins;
7605         loadmodel->num_texturesperskin = numtextures;
7606         data = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * sizeof(int) + loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t) + numtriangles * sizeof(int[3]) + (numvertices <= 65536 ? numtriangles * sizeof(unsigned short[3]) : 0) + (r_enableshadowvolumes.integer ? numtriangles * sizeof(int[3]) : 0) + numvertices * sizeof(float[14]) + loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7607         loadmodel->brush.submodels = (dp_model_t **)data;data += loadmodel->brush.numsubmodels * sizeof(dp_model_t *);
7608         loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
7609         loadmodel->data_textures = (texture_t *)data;data += loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t);
7610         loadmodel->surfmesh.num_vertices = numvertices;
7611         loadmodel->surfmesh.num_triangles = numtriangles;
7612         if (r_enableshadowvolumes.integer)
7613                 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += numtriangles * sizeof(int[3]);
7614         loadmodel->surfmesh.data_vertex3f = (float *)data;data += numvertices * sizeof(float[3]);
7615         loadmodel->surfmesh.data_svector3f = (float *)data;data += numvertices * sizeof(float[3]);
7616         loadmodel->surfmesh.data_tvector3f = (float *)data;data += numvertices * sizeof(float[3]);
7617         loadmodel->surfmesh.data_normal3f = (float *)data;data += numvertices * sizeof(float[3]);
7618         loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += numvertices * sizeof(float[2]);
7619         if (loadmodel->surfmesh.num_vertices <= 65536)
7620                 loadmodel->surfmesh.data_element3s = (unsigned short *)data;data += loadmodel->surfmesh.num_triangles * sizeof(unsigned short[3]);
7621
7622         for (j = 0;j < loadmodel->surfmesh.num_vertices;j++)
7623         {
7624                 VectorCopy(vertexhashdata[j].v, loadmodel->surfmesh.data_vertex3f + 3*j);
7625                 VectorCopy(vertexhashdata[j].vn, loadmodel->surfmesh.data_normal3f + 3*j);
7626                 Vector2Copy(vertexhashdata[j].vt, loadmodel->surfmesh.data_texcoordtexture2f + 2*j);
7627         }
7628
7629         // load the textures
7630         for (textureindex = 0;textureindex < numtextures;textureindex++)
7631                 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures + textureindex, skinfiles, texturenames + textureindex*MAX_QPATH, texturenames + textureindex*MAX_QPATH);
7632         Mod_FreeSkinFiles(skinfiles);
7633
7634         // set the surface textures to their real values now that we loaded them...
7635         for (i = 0;i < loadmodel->num_surfaces;i++)
7636                 loadmodel->data_surfaces[i].texture = loadmodel->data_textures + (size_t)loadmodel->data_surfaces[i].texture;
7637
7638         // free data
7639         Mem_Free(vertices);
7640         Mem_Free(texturenames);
7641         Mem_Free(v);
7642         Mem_Free(vt);
7643         Mem_Free(vn);
7644         Mem_Free(vertexhashtable);
7645         Mem_Free(vertexhashdata);
7646
7647         // make a single combined shadow mesh to allow optimized shadow volume creation
7648         Mod_Q1BSP_CreateShadowMesh(loadmodel);
7649
7650         // compute all the mesh information that was not loaded from the file
7651         if (loadmodel->surfmesh.data_element3s)
7652                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
7653                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
7654         Mod_ValidateElements(loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles, 0, loadmodel->surfmesh.num_vertices, __FILE__, __LINE__);
7655         // generate normals if the file did not have them
7656         if (!VectorLength2(loadmodel->surfmesh.data_normal3f))
7657                 Mod_BuildNormals(0, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.data_normal3f, r_smoothnormals_areaweighting.integer != 0);
7658         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, r_smoothnormals_areaweighting.integer != 0);
7659         if (loadmodel->surfmesh.data_neighbor3i)
7660                 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
7661
7662         // if this is a worldmodel and has no BSP tree, create a fake one for the purpose
7663         loadmodel->brush.num_visleafs = 1;
7664         loadmodel->brush.num_leafs = 1;
7665         loadmodel->brush.num_nodes = 0;
7666         loadmodel->brush.num_leafsurfaces = loadmodel->num_surfaces;
7667         loadmodel->brush.data_leafs = (mleaf_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
7668         loadmodel->brush.data_nodes = (mnode_t *)loadmodel->brush.data_leafs;
7669         loadmodel->brush.num_pvsclusters = 1;
7670         loadmodel->brush.num_pvsclusterbytes = 1;
7671         loadmodel->brush.data_pvsclusters = nobsp_pvs;
7672         //if (loadmodel->num_nodes) loadmodel->data_nodes = (mnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_nodes * sizeof(mnode_t));
7673         //loadmodel->data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->num_leafsurfaces * sizeof(int));
7674         loadmodel->brush.data_leafsurfaces = loadmodel->sortedmodelsurfaces;
7675         VectorCopy(loadmodel->normalmins, loadmodel->brush.data_leafs->mins);
7676         VectorCopy(loadmodel->normalmaxs, loadmodel->brush.data_leafs->maxs);
7677         loadmodel->brush.data_leafs->combinedsupercontents = 0; // FIXME?
7678         loadmodel->brush.data_leafs->clusterindex = 0;
7679         loadmodel->brush.data_leafs->areaindex = 0;
7680         loadmodel->brush.data_leafs->numleafsurfaces = loadmodel->brush.num_leafsurfaces;
7681         loadmodel->brush.data_leafs->firstleafsurface = loadmodel->brush.data_leafsurfaces;
7682         loadmodel->brush.data_leafs->numleafbrushes = 0;
7683         loadmodel->brush.data_leafs->firstleafbrush = NULL;
7684         loadmodel->brush.supportwateralpha = true;
7685
7686         if (loadmodel->brush.numsubmodels)
7687                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7688
7689         mod = loadmodel;
7690         for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7691         {
7692                 if (i > 0)
7693                 {
7694                         char name[10];
7695                         // duplicate the basic information
7696                         dpsnprintf(name, sizeof(name), "*%i", i);
7697                         mod = Mod_FindName(name, loadmodel->name);
7698                         // copy the base model to this one
7699                         *mod = *loadmodel;
7700                         // rename the clone back to its proper name
7701                         strlcpy(mod->name, name, sizeof(mod->name));
7702                         mod->brush.parentmodel = loadmodel;
7703                         // textures and memory belong to the main model
7704                         mod->texturepool = NULL;
7705                         mod->mempool = NULL;
7706                         mod->brush.GetPVS = NULL;
7707                         mod->brush.FatPVS = NULL;
7708                         mod->brush.BoxTouchingPVS = NULL;
7709                         mod->brush.BoxTouchingLeafPVS = NULL;
7710                         mod->brush.BoxTouchingVisibleLeafs = NULL;
7711                         mod->brush.FindBoxClusters = NULL;
7712                         mod->brush.LightPoint = NULL;
7713                         mod->brush.AmbientSoundLevelsForPoint = NULL;
7714                 }
7715                 mod->brush.submodel = i;
7716                 if (loadmodel->brush.submodels)
7717                         loadmodel->brush.submodels[i] = mod;
7718
7719                 // make the model surface list (used by shadowing/lighting)
7720                 mod->firstmodelsurface = submodelfirstsurface[i];
7721                 mod->nummodelsurfaces = submodelfirstsurface[i+1] - submodelfirstsurface[i];
7722                 mod->firstmodelbrush = 0;
7723                 mod->nummodelbrushes = 0;
7724                 mod->sortedmodelsurfaces = loadmodel->sortedmodelsurfaces + mod->firstmodelsurface;
7725                 Mod_MakeSortedSurfaces(mod);
7726
7727                 VectorClear(mod->normalmins);
7728                 VectorClear(mod->normalmaxs);
7729                 l = false;
7730                 for (j = 0;j < mod->nummodelsurfaces;j++)
7731                 {
7732                         const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7733                         const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7734                         int k;
7735                         if (!surface->num_vertices)
7736                                 continue;
7737                         if (!l)
7738                         {
7739                                 l = true;
7740                                 VectorCopy(v, mod->normalmins);
7741                                 VectorCopy(v, mod->normalmaxs);
7742                         }
7743                         for (k = 0;k < surface->num_vertices;k++, v += 3)
7744                         {
7745                                 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7746                                 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7747                                 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7748                                 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7749                                 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7750                                 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7751                         }
7752                 }
7753                 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7754                 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7755                 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7756                 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7757                 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7758                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7759                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7760                 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7761                 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7762                 mod->yawmins[2] = mod->normalmins[2];
7763                 mod->yawmaxs[2] = mod->normalmaxs[2];
7764                 mod->radius = modelradius;
7765                 mod->radius2 = modelradius * modelradius;
7766
7767                 // this gets altered below if sky or water is used
7768                 mod->DrawSky = NULL;
7769                 mod->DrawAddWaterPlanes = NULL;
7770
7771                 for (j = 0;j < mod->nummodelsurfaces;j++)
7772                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7773                                 break;
7774                 if (j < mod->nummodelsurfaces)
7775                         mod->DrawSky = R_Q1BSP_DrawSky;
7776
7777                 for (j = 0;j < mod->nummodelsurfaces;j++)
7778                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7779                                 break;
7780                 if (j < mod->nummodelsurfaces)
7781                         mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
7782
7783                 Mod_MakeCollisionBIH(mod, true, &mod->collision_bih);
7784                 mod->render_bih = mod->collision_bih;
7785
7786                 // generate VBOs and other shared data before cloning submodels
7787                 if (i == 0)
7788                         Mod_BuildVBOs();
7789         }
7790         mod = loadmodel;
7791         Mem_Free(submodelfirstsurface);
7792
7793         Con_DPrintf("Stats for obj model \"%s\": %i faces, %i nodes, %i leafs, %i clusters, %i clusterportals, mesh: %i vertices, %i triangles, %i surfaces\n", loadmodel->name, loadmodel->num_surfaces, loadmodel->brush.num_nodes, loadmodel->brush.num_leafs, mod->brush.num_pvsclusters, loadmodel->brush.num_portals, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->num_surfaces);
7794 }
7795
7796 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
7797 {
7798         // we already have done PVS culling at this point...
7799         // so we don't need to do it again.
7800
7801         int i;
7802         vec3_t testorigin, mins, maxs;
7803
7804         testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
7805         testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
7806         testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
7807
7808         if(model->brush.TraceLineOfSight(model, eye, testorigin))
7809                 return 1;
7810
7811         // expand the box a little
7812         mins[0] = (t+1) * minsX[0] - t * maxsX[0];
7813         maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
7814         mins[1] = (t+1) * minsX[1] - t * maxsX[1];
7815         maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
7816         mins[2] = (t+1) * minsX[2] - t * maxsX[2];
7817         maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
7818
7819         for(i = 0; i != numsamples; ++i)
7820         {
7821                 testorigin[0] = lhrandom(mins[0], maxs[0]);
7822                 testorigin[1] = lhrandom(mins[1], maxs[1]);
7823                 testorigin[2] = lhrandom(mins[2], maxs[2]);
7824
7825                 if(model->brush.TraceLineOfSight(model, eye, testorigin))
7826                         return 1;
7827         }
7828
7829         return 0;
7830 }
7831