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