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_CLIENT | 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 = {CVAR_CLIENT | CVAR_SERVER, "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 = {CVAR_CLIENT, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
  32 cvar_t r_nosurftextures = {CVAR_CLIENT, "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 = {CVAR_CLIENT, "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 = {CVAR_CLIENT, "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 = {CVAR_CLIENT, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
  36 cvar_t r_subdivisions_maxvertices = {CVAR_CLIENT, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
  37 cvar_t r_subdivisions_collision_tolerance = {CVAR_CLIENT, "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 = {CVAR_CLIENT, "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 = {CVAR_CLIENT, "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 = {CVAR_CLIENT, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
  41 cvar_t r_trippy = {CVAR_CLIENT, "r_trippy", "0", "easter egg"};
  42 cvar_t r_fxaa = {CVAR_CLIENT | CVAR_SAVE, "r_fxaa", "0", "fast approximate anti aliasing"};
  43 cvar_t mod_noshader_default_offsetmapping = {CVAR_CLIENT | 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 = {CVAR_CLIENT | CVAR_SERVER, "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 = {CVAR_CLIENT, "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 = {CVAR_CLIENT | CVAR_SERVER, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
  47 cvar_t mod_q3bsp_curves_collisions_stride = {CVAR_CLIENT | CVAR_SERVER, "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 = {CVAR_CLIENT | CVAR_SERVER, "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 = {CVAR_CLIENT | CVAR_SERVER, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
  50 cvar_t mod_q3bsp_debugtracebrush = {CVAR_CLIENT | CVAR_SERVER, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
  51 cvar_t mod_q3bsp_lightmapmergepower = {CVAR_CLIENT | 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_CLIENT | 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 = {CVAR_CLIENT | CVAR_SERVER, "mod_q3bsp_tracelineofsight_brushes", "0", "enables culling of entities behind detail brushes, curves, etc"};
  54 cvar_t mod_q3bsp_sRGBlightmaps = {CVAR_CLIENT, "mod_q3bsp_sRGBlightmaps", "0", "treat lightmaps from Q3 maps as sRGB when vid_sRGB is active"};
  55 cvar_t mod_q3bsp_lightgrid_texture = {CVAR_CLIENT, "mod_q3bsp_lightgrid_texture", "1", "directly apply the lightgrid as a global texture rather than only reading it at the entity origin"};
  56 cvar_t mod_q3bsp_lightgrid_world_surfaces = {CVAR_CLIENT, "mod_q3bsp_lightgrid_world_surfaces", "0", "apply lightgrid lighting to the world bsp geometry rather than using lightmaps (experimental/debug tool)"};
  57 cvar_t mod_q3bsp_lightgrid_bsp_surfaces = {CVAR_CLIENT, "mod_q3bsp_lightgrid_bsp_surfaces", "0", "apply lightgrid lighting to bsp models other than the world rather than using their lightmaps (experimental/debug tool)"};
  58 cvar_t mod_q3shader_default_offsetmapping = {CVAR_CLIENT | CVAR_SAVE, "mod_q3shader_default_offsetmapping", "1", "use offsetmapping by default on all surfaces that are using q3 shader files"};
  59 cvar_t mod_q3shader_default_offsetmapping_scale = {CVAR_CLIENT | CVAR_SAVE, "mod_q3shader_default_offsetmapping_scale", "1", "default scale used for offsetmapping"};
  60 cvar_t mod_q3shader_default_offsetmapping_bias = {CVAR_CLIENT | CVAR_SAVE, "mod_q3shader_default_offsetmapping_bias", "0", "default bias used for offsetmapping"};
  61 cvar_t mod_q3shader_default_polygonfactor = {CVAR_CLIENT, "mod_q3shader_default_polygonfactor", "0", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
  62 cvar_t mod_q3shader_default_polygonoffset = {CVAR_CLIENT, "mod_q3shader_default_polygonoffset", "-2", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
  63 cvar_t mod_q3shader_default_refractive_index = {CVAR_CLIENT, "mod_q3shader_default_refractive_index", "1.33", "angle of refraction specified as n to apply when a photon is refracted, example values are: 1.0003 = air, water = 1.333, crown glass = 1.517, flint glass = 1.655, diamond = 2.417"};
  64 cvar_t mod_q3shader_force_addalpha = {CVAR_CLIENT, "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"};
  65 cvar_t mod_q3shader_force_terrain_alphaflag = {CVAR_CLIENT, "mod_q3shader_force_terrain_alphaflag", "0", "for multilayered terrain shaders force TEXF_ALPHA flag on both layers"};
  66
  67 cvar_t mod_q1bsp_polygoncollisions = {CVAR_CLIENT | CVAR_SERVER, "mod_q1bsp_polygoncollisions", "0", "disables use of precomputed cliphulls and instead collides with polygons (uses Bounding Interval Hierarchy optimizations)"};
  68 cvar_t mod_recalculatenodeboxes = {CVAR_CLIENT | CVAR_SERVER, "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"};
  69
  70 static texture_t mod_q1bsp_texture_solid;
  71 static texture_t mod_q1bsp_texture_sky;
  72 static texture_t mod_q1bsp_texture_lava;
  73 static texture_t mod_q1bsp_texture_slime;
  74 static texture_t mod_q1bsp_texture_water;
  75
  76 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);
  77
  78 void Mod_BrushInit(void)
  79 {
  80 //      Cvar_RegisterVariable(&r_subdivide_size);
  81         Cvar_RegisterVariable(&mod_bsp_portalize);
  82         Cvar_RegisterVariable(&r_novis);
  83         Cvar_RegisterVariable(&r_nosurftextures);
  84         Cvar_RegisterVariable(&r_subdivisions_tolerance);
  85         Cvar_RegisterVariable(&r_subdivisions_mintess);
  86         Cvar_RegisterVariable(&r_subdivisions_maxtess);
  87         Cvar_RegisterVariable(&r_subdivisions_maxvertices);
  88         Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
  89         Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
  90         Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
  91         Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
  92         Cvar_RegisterVariable(&r_trippy);
  93         Cvar_RegisterVariable(&r_fxaa);
  94         Cvar_RegisterVariable(&mod_noshader_default_offsetmapping);
  95         Cvar_RegisterVariable(&mod_obj_orientation);
  96         Cvar_RegisterVariable(&mod_q2bsp_littransparentsurfaces);
  97         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
  98         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
  99         Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
 100         Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
 101         Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
 102         Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
 103         Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
 104         Cvar_RegisterVariable(&mod_q3bsp_sRGBlightmaps);
 105         Cvar_RegisterVariable(&mod_q3bsp_lightgrid_texture);
 106         Cvar_RegisterVariable(&mod_q3bsp_lightgrid_world_surfaces);
 107         Cvar_RegisterVariable(&mod_q3bsp_lightgrid_bsp_surfaces);
 108         Cvar_RegisterVariable(&mod_q3bsp_tracelineofsight_brushes);
 109         Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping);
 110         Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping_scale);
 111         Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping_bias);
 112         Cvar_RegisterVariable(&mod_q3shader_default_polygonfactor);
 113         Cvar_RegisterVariable(&mod_q3shader_default_polygonoffset);
 114         Cvar_RegisterVariable(&mod_q3shader_default_refractive_index);
 115         Cvar_RegisterVariable(&mod_q3shader_force_addalpha);
 116         Cvar_RegisterVariable(&mod_q3shader_force_terrain_alphaflag);
 117         Cvar_RegisterVariable(&mod_q1bsp_polygoncollisions);
 118         Cvar_RegisterVariable(&mod_recalculatenodeboxes);
 119
 120         // these games were made for older DP engines and are no longer
 121         // maintained; use this hack to show their textures properly
 122         if(gamemode == GAME_NEXUIZ)
 123                 Cvar_SetQuick(&mod_q3shader_force_addalpha, "1");
 124
 125         memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
 126         strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
 127         mod_q1bsp_texture_solid.surfaceflags = 0;
 128         mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
 129
 130         mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
 131         strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
 132         mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
 133         mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
 134
 135         mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
 136         strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
 137         mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
 138         mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
 139
 140         mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
 141         strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
 142         mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
 143         mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
 144
 145         mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
 146         strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
 147         mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
 148         mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
 149 }
 150
 151 static mleaf_t *Mod_BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
 152 {
 153         mnode_t *node;
 154
 155         if (model == NULL)
 156                 return NULL;
 157
 158         // LadyHavoc: modified to start at first clip node,
 159         // in other words: first node of the (sub)model
 160         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 161         while (node->plane)
 162                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
 163
 164         return (mleaf_t *)node;
 165 }
 166
 167 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
 168 {
 169         int i;
 170         mleaf_t *leaf;
 171         leaf = Mod_BSP_PointInLeaf(model, p);
 172         if (leaf)
 173         {
 174                 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
 175                 if (i)
 176                 {
 177                         memcpy(out, leaf->ambient_sound_level, i);
 178                         out += i;
 179                         outsize -= i;
 180                 }
 181         }
 182         if (outsize)
 183                 memset(out, 0, outsize);
 184 }
 185
 186 static int Mod_BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
 187 {
 188         int numclusters = 0;
 189         int nodestackindex = 0;
 190         mnode_t *node, *nodestack[1024];
 191         if (!model->brush.num_pvsclusters)
 192                 return -1;
 193         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 194         for (;;)
 195         {
 196 #if 1
 197                 if (node->plane)
 198                 {
 199                         // node - recurse down the BSP tree
 200                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 201                         if (sides < 3)
 202                         {
 203                                 if (sides == 0)
 204                                         return -1; // ERROR: NAN bounding box!
 205                                 // box is on one side of plane, take that path
 206                                 node = node->children[sides-1];
 207                         }
 208                         else
 209                         {
 210                                 // box crosses plane, take one path and remember the other
 211                                 if (nodestackindex < 1024)
 212                                         nodestack[nodestackindex++] = node->children[0];
 213                                 node = node->children[1];
 214                         }
 215                         continue;
 216                 }
 217                 else
 218                 {
 219                         // leaf - add clusterindex to list
 220                         if (numclusters < maxclusters)
 221                                 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
 222                         numclusters++;
 223                 }
 224 #else
 225                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 226                 {
 227                         if (node->plane)
 228                         {
 229                                 if (nodestackindex < 1024)
 230                                         nodestack[nodestackindex++] = node->children[0];
 231                                 node = node->children[1];
 232                                 continue;
 233                         }
 234                         else
 235                         {
 236                                 // leaf - add clusterindex to list
 237                                 if (numclusters < maxclusters)
 238                                         clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
 239                                 numclusters++;
 240                         }
 241                 }
 242 #endif
 243                 // try another path we didn't take earlier
 244                 if (nodestackindex == 0)
 245                         break;
 246                 node = nodestack[--nodestackindex];
 247         }
 248         // return number of clusters found (even if more than the maxclusters)
 249         return numclusters;
 250 }
 251
 252 static int Mod_BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
 253 {
 254         int nodestackindex = 0;
 255         mnode_t *node, *nodestack[1024];
 256         if (!model->brush.num_pvsclusters)
 257                 return true;
 258         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 259         for (;;)
 260         {
 261 #if 1
 262                 if (node->plane)
 263                 {
 264                         // node - recurse down the BSP tree
 265                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 266                         if (sides < 3)
 267                         {
 268                                 if (sides == 0)
 269                                         return -1; // ERROR: NAN bounding box!
 270                                 // box is on one side of plane, take that path
 271                                 node = node->children[sides-1];
 272                         }
 273                         else
 274                         {
 275                                 // box crosses plane, take one path and remember the other
 276                                 if (nodestackindex < 1024)
 277                                         nodestack[nodestackindex++] = node->children[0];
 278                                 node = node->children[1];
 279                         }
 280                         continue;
 281                 }
 282                 else
 283                 {
 284                         // leaf - check cluster bit
 285                         int clusterindex = ((mleaf_t *)node)->clusterindex;
 286                         if (CHECKPVSBIT(pvs, clusterindex))
 287                         {
 288                                 // it is visible, return immediately with the news
 289                                 return true;
 290                         }
 291                 }
 292 #else
 293                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 294                 {
 295                         if (node->plane)
 296                         {
 297                                 if (nodestackindex < 1024)
 298                                         nodestack[nodestackindex++] = node->children[0];
 299                                 node = node->children[1];
 300                                 continue;
 301                         }
 302                         else
 303                         {
 304                                 // leaf - check cluster bit
 305                                 int clusterindex = ((mleaf_t *)node)->clusterindex;
 306                                 if (CHECKPVSBIT(pvs, clusterindex))
 307                                 {
 308                                         // it is visible, return immediately with the news
 309                                         return true;
 310                                 }
 311                         }
 312                 }
 313 #endif
 314                 // nothing to see here, try another path we didn't take earlier
 315                 if (nodestackindex == 0)
 316                         break;
 317                 node = nodestack[--nodestackindex];
 318         }
 319         // it is not visible
 320         return false;
 321 }
 322
 323 static int Mod_BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
 324 {
 325         int nodestackindex = 0;
 326         mnode_t *node, *nodestack[1024];
 327         if (!model->brush.num_leafs)
 328                 return true;
 329         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 330         for (;;)
 331         {
 332 #if 1
 333                 if (node->plane)
 334                 {
 335                         // node - recurse down the BSP tree
 336                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 337                         if (sides < 3)
 338                         {
 339                                 if (sides == 0)
 340                                         return -1; // ERROR: NAN bounding box!
 341                                 // box is on one side of plane, take that path
 342                                 node = node->children[sides-1];
 343                         }
 344                         else
 345                         {
 346                                 // box crosses plane, take one path and remember the other
 347                                 if (nodestackindex < 1024)
 348                                         nodestack[nodestackindex++] = node->children[0];
 349                                 node = node->children[1];
 350                         }
 351                         continue;
 352                 }
 353                 else
 354                 {
 355                         // leaf - check cluster bit
 356                         int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
 357                         if (CHECKPVSBIT(pvs, clusterindex))
 358                         {
 359                                 // it is visible, return immediately with the news
 360                                 return true;
 361                         }
 362                 }
 363 #else
 364                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 365                 {
 366                         if (node->plane)
 367                         {
 368                                 if (nodestackindex < 1024)
 369                                         nodestack[nodestackindex++] = node->children[0];
 370                                 node = node->children[1];
 371                                 continue;
 372                         }
 373                         else
 374                         {
 375                                 // leaf - check cluster bit
 376                                 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
 377                                 if (CHECKPVSBIT(pvs, clusterindex))
 378                                 {
 379                                         // it is visible, return immediately with the news
 380                                         return true;
 381                                 }
 382                         }
 383                 }
 384 #endif
 385                 // nothing to see here, try another path we didn't take earlier
 386                 if (nodestackindex == 0)
 387                         break;
 388                 node = nodestack[--nodestackindex];
 389         }
 390         // it is not visible
 391         return false;
 392 }
 393
 394 static int Mod_BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
 395 {
 396         int nodestackindex = 0;
 397         mnode_t *node, *nodestack[1024];
 398         if (!model->brush.num_leafs)
 399                 return true;
 400         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 401         for (;;)
 402         {
 403 #if 1
 404                 if (node->plane)
 405                 {
 406                         // node - recurse down the BSP tree
 407                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 408                         if (sides < 3)
 409                         {
 410                                 if (sides == 0)
 411                                         return -1; // ERROR: NAN bounding box!
 412                                 // box is on one side of plane, take that path
 413                                 node = node->children[sides-1];
 414                         }
 415                         else
 416                         {
 417                                 // box crosses plane, take one path and remember the other
 418                                 if (nodestackindex < 1024)
 419                                         nodestack[nodestackindex++] = node->children[0];
 420                                 node = node->children[1];
 421                         }
 422                         continue;
 423                 }
 424                 else
 425                 {
 426                         // leaf - check if it is visible
 427                         if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
 428                         {
 429                                 // it is visible, return immediately with the news
 430                                 return true;
 431                         }
 432                 }
 433 #else
 434                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 435                 {
 436                         if (node->plane)
 437                         {
 438                                 if (nodestackindex < 1024)
 439                                         nodestack[nodestackindex++] = node->children[0];
 440                                 node = node->children[1];
 441                                 continue;
 442                         }
 443                         else
 444                         {
 445                                 // leaf - check if it is visible
 446                                 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
 447                                 {
 448                                         // it is visible, return immediately with the news
 449                                         return true;
 450                                 }
 451                         }
 452                 }
 453 #endif
 454                 // nothing to see here, try another path we didn't take earlier
 455                 if (nodestackindex == 0)
 456                         break;
 457                 node = nodestack[--nodestackindex];
 458         }
 459         // it is not visible
 460         return false;
 461 }
 462
 463 typedef struct findnonsolidlocationinfo_s
 464 {
 465         vec3_t center;
 466         vec3_t absmin, absmax;
 467         vec_t radius;
 468         vec3_t nudge;
 469         vec_t bestdist;
 470         dp_model_t *model;
 471 }
 472 findnonsolidlocationinfo_t;
 473
 474 static void Mod_Q1BSP_FindNonSolidLocation_r_Triangle(findnonsolidlocationinfo_t *info, msurface_t *surface, int k)
 475 {
 476         int i, *tri;
 477         float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
 478
 479         tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
 480         VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
 481         VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
 482         VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
 483         VectorSubtract(vert[1], vert[0], edge[0]);
 484         VectorSubtract(vert[2], vert[1], edge[1]);
 485         CrossProduct(edge[1], edge[0], facenormal);
 486         if (facenormal[0] || facenormal[1] || facenormal[2])
 487         {
 488                 VectorNormalize(facenormal);
 489                 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 490                 if (f <= info->bestdist && f >= -info->bestdist)
 491                 {
 492                         VectorSubtract(vert[0], vert[2], edge[2]);
 493                         VectorNormalize(edge[0]);
 494                         VectorNormalize(edge[1]);
 495                         VectorNormalize(edge[2]);
 496                         CrossProduct(facenormal, edge[0], edgenormal[0]);
 497                         CrossProduct(facenormal, edge[1], edgenormal[1]);
 498                         CrossProduct(facenormal, edge[2], edgenormal[2]);
 499                         // face distance
 500                         if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
 501                                         && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
 502                                         && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
 503                         {
 504                                 // we got lucky, the center is within the face
 505                                 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 506                                 if (dist < 0)
 507                                 {
 508                                         dist = -dist;
 509                                         if (info->bestdist > dist)
 510                                         {
 511                                                 info->bestdist = dist;
 512                                                 VectorScale(facenormal, (info->radius - -dist), info->nudge);
 513                                         }
 514                                 }
 515                                 else
 516                                 {
 517                                         if (info->bestdist > dist)
 518                                         {
 519                                                 info->bestdist = dist;
 520                                                 VectorScale(facenormal, (info->radius - dist), info->nudge);
 521                                         }
 522                                 }
 523                         }
 524                         else
 525                         {
 526                                 // check which edge or vertex the center is nearest
 527                                 for (i = 0;i < 3;i++)
 528                                 {
 529                                         f = DotProduct(info->center, edge[i]);
 530                                         if (f >= DotProduct(vert[0], edge[i])
 531                                                         && f <= DotProduct(vert[1], edge[i]))
 532                                         {
 533                                                 // on edge
 534                                                 VectorMA(info->center, -f, edge[i], point);
 535                                                 dist = sqrt(DotProduct(point, point));
 536                                                 if (info->bestdist > dist)
 537                                                 {
 538                                                         info->bestdist = dist;
 539                                                         VectorScale(point, (info->radius / dist), info->nudge);
 540                                                 }
 541                                                 // skip both vertex checks
 542                                                 // (both are further away than this edge)
 543                                                 i++;
 544                                         }
 545                                         else
 546                                         {
 547                                                 // not on edge, check first vertex of edge
 548                                                 VectorSubtract(info->center, vert[i], point);
 549                                                 dist = sqrt(DotProduct(point, point));
 550                                                 if (info->bestdist > dist)
 551                                                 {
 552                                                         info->bestdist = dist;
 553                                                         VectorScale(point, (info->radius / dist), info->nudge);
 554                                                 }
 555                                         }
 556                                 }
 557                         }
 558                 }
 559         }
 560 }
 561
 562 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
 563 {
 564         int surfacenum, k, *mark;
 565         msurface_t *surface;
 566         for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
 567         {
 568                 surface = info->model->data_surfaces + *mark;
 569                 if(!surface->texture)
 570                         continue;
 571                 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
 572                 {
 573                         for (k = 0;k < surface->num_triangles;k++)
 574                         {
 575                                 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, k);
 576                         }
 577                 }
 578         }
 579 }
 580
 581 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
 582 {
 583         if (node->plane)
 584         {
 585                 float f = PlaneDiff(info->center, node->plane);
 586                 if (f >= -info->bestdist)
 587                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
 588                 if (f <= info->bestdist)
 589                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
 590         }
 591         else
 592         {
 593                 if (((mleaf_t *)node)->numleafsurfaces)
 594                         Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
 595         }
 596 }
 597
 598 static void Mod_BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
 599 {
 600         int i;
 601         findnonsolidlocationinfo_t info;
 602         if (model == NULL)
 603         {
 604                 VectorCopy(in, out);
 605                 return;
 606         }
 607         VectorCopy(in, info.center);
 608         info.radius = radius;
 609         info.model = model;
 610         i = 0;
 611         do
 612         {
 613                 VectorClear(info.nudge);
 614                 info.bestdist = radius;
 615                 VectorCopy(info.center, info.absmin);
 616                 VectorCopy(info.center, info.absmax);
 617                 info.absmin[0] -= info.radius + 1;
 618                 info.absmin[1] -= info.radius + 1;
 619                 info.absmin[2] -= info.radius + 1;
 620                 info.absmax[0] += info.radius + 1;
 621                 info.absmax[1] += info.radius + 1;
 622                 info.absmax[2] += info.radius + 1;
 623                 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
 624                 VectorAdd(info.center, info.nudge, info.center);
 625         }
 626         while (info.bestdist < radius && ++i < 10);
 627         VectorCopy(info.center, out);
 628 }
 629
 630 int Mod_Q1BSP_SuperContentsFromNativeContents(int nativecontents)
 631 {
 632         switch(nativecontents)
 633         {
 634                 case CONTENTS_EMPTY:
 635                         return 0;
 636                 case CONTENTS_SOLID:
 637                         return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
 638                 case CONTENTS_WATER:
 639                         return SUPERCONTENTS_WATER;
 640                 case CONTENTS_SLIME:
 641                         return SUPERCONTENTS_SLIME;
 642                 case CONTENTS_LAVA:
 643                         return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
 644                 case CONTENTS_SKY:
 645                         return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
 646         }
 647         return 0;
 648 }
 649
 650 int Mod_Q1BSP_NativeContentsFromSuperContents(int supercontents)
 651 {
 652         if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
 653                 return CONTENTS_SOLID;
 654         if (supercontents & SUPERCONTENTS_SKY)
 655                 return CONTENTS_SKY;
 656         if (supercontents & SUPERCONTENTS_LAVA)
 657                 return CONTENTS_LAVA;
 658         if (supercontents & SUPERCONTENTS_SLIME)
 659                 return CONTENTS_SLIME;
 660         if (supercontents & SUPERCONTENTS_WATER)
 661                 return CONTENTS_WATER;
 662         return CONTENTS_EMPTY;
 663 }
 664
 665 typedef struct RecursiveHullCheckTraceInfo_s
 666 {
 667         // the hull we're tracing through
 668         const hull_t *hull;
 669
 670         // the trace structure to fill in
 671         trace_t *trace;
 672
 673         // start, end, and end - start (in model space)
 674         double start[3];
 675         double end[3];
 676         double dist[3];
 677 }
 678 RecursiveHullCheckTraceInfo_t;
 679
 680 // 1/32 epsilon to keep floating point happy
 681 #define DIST_EPSILON (0.03125)
 682
 683 #define HULLCHECKSTATE_EMPTY 0
 684 #define HULLCHECKSTATE_SOLID 1
 685 #define HULLCHECKSTATE_DONE 2
 686
 687 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
 688 {
 689         // status variables, these don't need to be saved on the stack when
 690         // recursing...  but are because this should be thread-safe
 691         // (note: tracing against a bbox is not thread-safe, yet)
 692         int ret;
 693         mplane_t *plane;
 694         double t1, t2;
 695
 696         // variables that need to be stored on the stack when recursing
 697         mclipnode_t *node;
 698         int p1side, p2side;
 699         double midf, mid[3];
 700
 701         // keep looping until we hit a leaf
 702         while (num >= 0)
 703         {
 704                 // find the point distances
 705                 node = t->hull->clipnodes + num;
 706                 plane = t->hull->planes + node->planenum;
 707
 708                 // axial planes can be calculated more quickly without the DotProduct
 709                 if (plane->type < 3)
 710                 {
 711                         t1 = p1[plane->type] - plane->dist;
 712                         t2 = p2[plane->type] - plane->dist;
 713                 }
 714                 else
 715                 {
 716                         t1 = DotProduct (plane->normal, p1) - plane->dist;
 717                         t2 = DotProduct (plane->normal, p2) - plane->dist;
 718                 }
 719
 720                 // negative plane distances indicate children[1] (behind plane)
 721                 p1side = t1 < 0;
 722                 p2side = t2 < 0;
 723
 724                 // if the line starts and ends on the same side of the plane, recurse
 725                 // into that child instantly
 726                 if (p1side == p2side)
 727                 {
 728 #if COLLISIONPARANOID >= 3
 729                         if (p1side)
 730                                 Con_Print("<");
 731                         else
 732                                 Con_Print(">");
 733 #endif
 734                         // loop back and process the start child
 735                         num = node->children[p1side];
 736                 }
 737                 else
 738                 {
 739                         // find the midpoint where the line crosses the plane, use the
 740                         // original line for best accuracy
 741 #if COLLISIONPARANOID >= 3
 742                         Con_Print("M");
 743 #endif
 744                         if (plane->type < 3)
 745                         {
 746                                 t1 = t->start[plane->type] - plane->dist;
 747                                 t2 = t->end[plane->type] - plane->dist;
 748                         }
 749                         else
 750                         {
 751                                 t1 = DotProduct (plane->normal, t->start) - plane->dist;
 752                                 t2 = DotProduct (plane->normal, t->end) - plane->dist;
 753                         }
 754                         midf = t1 / (t1 - t2);
 755                         midf = bound(p1f, midf, p2f);
 756                         VectorMA(t->start, midf, t->dist, mid);
 757
 758                         // we now have a mid point, essentially splitting the line into
 759                         // the segments in the near child and the far child, we can now
 760                         // recurse those in order and get their results
 761
 762                         // recurse both sides, front side first
 763                         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[p1side], p1f, midf, p1, mid);
 764                         // if this side is not empty, return what it is (solid or done)
 765                         if (ret != HULLCHECKSTATE_EMPTY)
 766                                 return ret;
 767
 768                         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[p2side], midf, p2f, mid, p2);
 769                         // if other side is not solid, return what it is (empty or done)
 770                         if (ret != HULLCHECKSTATE_SOLID)
 771                                 return ret;
 772
 773                         // front is air and back is solid, this is the impact point...
 774
 775                         // copy the plane information, flipping it if needed
 776                         if (p1side)
 777                         {
 778                                 t->trace->plane.dist = -plane->dist;
 779                                 VectorNegate (plane->normal, t->trace->plane.normal);
 780                         }
 781                         else
 782                         {
 783                                 t->trace->plane.dist = plane->dist;
 784                                 VectorCopy (plane->normal, t->trace->plane.normal);
 785                         }
 786
 787                         // calculate the return fraction which is nudged off the surface a bit
 788                         t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
 789                         t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
 790                         midf = (t1 - collision_impactnudge.value) / (t1 - t2);
 791                         t->trace->fraction = bound(0, midf, 1);
 792
 793 #if COLLISIONPARANOID >= 3
 794                         Con_Print("D");
 795 #endif
 796                         return HULLCHECKSTATE_DONE;
 797                 }
 798         }
 799
 800         // we reached a leaf contents
 801
 802         // check for empty
 803         num = Mod_Q1BSP_SuperContentsFromNativeContents(num);
 804         if (!t->trace->startfound)
 805         {
 806                 t->trace->startfound = true;
 807                 t->trace->startsupercontents |= num;
 808         }
 809         if (num & SUPERCONTENTS_LIQUIDSMASK)
 810                 t->trace->inwater = true;
 811         if (num == 0)
 812                 t->trace->inopen = true;
 813         if (num & SUPERCONTENTS_SOLID)
 814                 t->trace->hittexture = &mod_q1bsp_texture_solid;
 815         else if (num & SUPERCONTENTS_SKY)
 816                 t->trace->hittexture = &mod_q1bsp_texture_sky;
 817         else if (num & SUPERCONTENTS_LAVA)
 818                 t->trace->hittexture = &mod_q1bsp_texture_lava;
 819         else if (num & SUPERCONTENTS_SLIME)
 820                 t->trace->hittexture = &mod_q1bsp_texture_slime;
 821         else
 822                 t->trace->hittexture = &mod_q1bsp_texture_water;
 823         t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
 824         t->trace->hitsupercontents = num;
 825         if (num & t->trace->hitsupercontentsmask)
 826         {
 827                 // if the first leaf is solid, set startsolid
 828                 if (t->trace->allsolid)
 829                         t->trace->startsolid = true;
 830 #if COLLISIONPARANOID >= 3
 831                 Con_Print("S");
 832 #endif
 833                 return HULLCHECKSTATE_SOLID;
 834         }
 835         else
 836         {
 837                 t->trace->allsolid = false;
 838 #if COLLISIONPARANOID >= 3
 839                 Con_Print("E");
 840 #endif
 841                 return HULLCHECKSTATE_EMPTY;
 842         }
 843 }
 844
 845 //#if COLLISIONPARANOID < 2
 846 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
 847 {
 848         mplane_t *plane;
 849         mclipnode_t *nodes = t->hull->clipnodes;
 850         mplane_t *planes = t->hull->planes;
 851         vec3_t point;
 852         VectorCopy(t->start, point);
 853         while (num >= 0)
 854         {
 855                 plane = planes + nodes[num].planenum;
 856                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
 857         }
 858         num = Mod_Q1BSP_SuperContentsFromNativeContents(num);
 859         t->trace->startsupercontents |= num;
 860         if (num & SUPERCONTENTS_LIQUIDSMASK)
 861                 t->trace->inwater = true;
 862         if (num == 0)
 863                 t->trace->inopen = true;
 864         if (num & t->trace->hitsupercontentsmask)
 865         {
 866                 t->trace->allsolid = t->trace->startsolid = true;
 867                 return HULLCHECKSTATE_SOLID;
 868         }
 869         else
 870         {
 871                 t->trace->allsolid = t->trace->startsolid = false;
 872                 return HULLCHECKSTATE_EMPTY;
 873         }
 874 }
 875 //#endif
 876
 877 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)
 878 {
 879         RecursiveHullCheckTraceInfo_t rhc;
 880
 881         memset(&rhc, 0, sizeof(rhc));
 882         memset(trace, 0, sizeof(trace_t));
 883         rhc.trace = trace;
 884         rhc.trace->fraction = 1;
 885         rhc.trace->allsolid = true;
 886         rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
 887         VectorCopy(start, rhc.start);
 888         VectorCopy(start, rhc.end);
 889         Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 890 }
 891
 892 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);
 893
 894 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)
 895 {
 896         RecursiveHullCheckTraceInfo_t rhc;
 897
 898         if (VectorCompare(start, end))
 899         {
 900                 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
 901                 return;
 902         }
 903
 904         // 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...
 905         if (sv_gameplayfix_q1bsptracelinereportstexture.integer)
 906         {
 907                 Mod_Q1BSP_TraceLineAgainstSurfaces(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
 908                 return;
 909         }
 910
 911         memset(&rhc, 0, sizeof(rhc));
 912         memset(trace, 0, sizeof(trace_t));
 913         rhc.trace = trace;
 914         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 915         rhc.trace->skipsupercontentsmask = skipsupercontentsmask;
 916         rhc.trace->skipmaterialflagsmask = skipmaterialflagsmask;
 917         rhc.trace->fraction = 1;
 918         rhc.trace->allsolid = true;
 919         rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
 920         VectorCopy(start, rhc.start);
 921         VectorCopy(end, rhc.end);
 922         VectorSubtract(rhc.end, rhc.start, rhc.dist);
 923 #if COLLISIONPARANOID >= 2
 924         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]);
 925         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 926         {
 927
 928                 double test[3];
 929                 trace_t testtrace;
 930                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
 931                 memset(&testtrace, 0, sizeof(trace_t));
 932                 rhc.trace = &testtrace;
 933                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 934                 rhc.trace->skipsupercontentsmask = skipsupercontentsmask;
 935                 rhc.trace->skipmaterialflagsmask = skipmaterialflagsmask;
 936                 rhc.trace->fraction = 1;
 937                 rhc.trace->allsolid = true;
 938                 VectorCopy(test, rhc.start);
 939                 VectorCopy(test, rhc.end);
 940                 VectorClear(rhc.dist);
 941                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 942                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
 943                 if (!trace->startsolid && testtrace.startsolid)
 944                         Con_Printf(" - ended in solid!\n");
 945         }
 946         Con_Print("\n");
 947 #else
 948         if (VectorLength2(rhc.dist))
 949                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 950         else
 951                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 952 #endif
 953 }
 954
 955 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)
 956 {
 957         // this function currently only supports same size start and end
 958         double boxsize[3];
 959         RecursiveHullCheckTraceInfo_t rhc;
 960
 961         if (VectorCompare(boxmins, boxmaxs))
 962         {
 963                 if (VectorCompare(start, end))
 964                         Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
 965                 else
 966                         Mod_Q1BSP_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
 967                 return;
 968         }
 969
 970         memset(&rhc, 0, sizeof(rhc));
 971         memset(trace, 0, sizeof(trace_t));
 972         rhc.trace = trace;
 973         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 974         rhc.trace->skipsupercontentsmask = skipsupercontentsmask;
 975         rhc.trace->skipmaterialflagsmask = skipmaterialflagsmask;
 976         rhc.trace->fraction = 1;
 977         rhc.trace->allsolid = true;
 978         VectorSubtract(boxmaxs, boxmins, boxsize);
 979         if (boxsize[0] < 3)
 980                 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
 981         else if (model->brush.ishlbsp)
 982         {
 983                 // LadyHavoc: this has to have a minor tolerance (the .1) because of
 984                 // minor float precision errors from the box being transformed around
 985                 if (boxsize[0] < 32.1)
 986                 {
 987                         if (boxsize[2] < 54) // pick the nearest of 36 or 72
 988                                 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
 989                         else
 990                                 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
 991                 }
 992                 else
 993                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
 994         }
 995         else
 996         {
 997                 // LadyHavoc: this has to have a minor tolerance (the .1) because of
 998                 // minor float precision errors from the box being transformed around
 999                 if (boxsize[0] < 32.1)
1000                         rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
1001                 else
1002                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
1003         }
1004         VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
1005         VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
1006         VectorSubtract(rhc.end, rhc.start, rhc.dist);
1007 #if COLLISIONPARANOID >= 2
1008         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]);
1009         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1010         {
1011
1012                 double test[3];
1013                 trace_t testtrace;
1014                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
1015                 memset(&testtrace, 0, sizeof(trace_t));
1016                 rhc.trace = &testtrace;
1017                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1018                 rhc.trace->skipsupercontentsmask = skipsupercontentsmask;
1019                 rhc.trace->skipmaterialflagsmask = skipmaterialflagsmask;
1020                 rhc.trace->fraction = 1;
1021                 rhc.trace->allsolid = true;
1022                 VectorCopy(test, rhc.start);
1023                 VectorCopy(test, rhc.end);
1024                 VectorClear(rhc.dist);
1025                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1026                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
1027                 if (!trace->startsolid && testtrace.startsolid)
1028                         Con_Printf(" - ended in solid!\n");
1029         }
1030         Con_Print("\n");
1031 #else
1032         if (VectorLength2(rhc.dist))
1033                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1034         else
1035                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1036 #endif
1037 }
1038
1039 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
1040 {
1041         int num = model->brushq1.hulls[0].firstclipnode;
1042         mplane_t *plane;
1043         mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
1044         mplane_t *planes = model->brushq1.hulls[0].planes;
1045         while (num >= 0)
1046         {
1047                 plane = planes + nodes[num].planenum;
1048                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
1049         }
1050         return Mod_Q1BSP_SuperContentsFromNativeContents(num);
1051 }
1052
1053 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)
1054 {
1055 #if 1
1056         colbrushf_t cbox;
1057         colplanef_t cbox_planes[6];
1058         cbox.isaabb = true;
1059         cbox.hasaabbplanes = true;
1060         cbox.supercontents = boxsupercontents;
1061         cbox.numplanes = 6;
1062         cbox.numpoints = 0;
1063         cbox.numtriangles = 0;
1064         cbox.planes = cbox_planes;
1065         cbox.points = NULL;
1066         cbox.elements = NULL;
1067         cbox.markframe = 0;
1068         cbox.mins[0] = 0;
1069         cbox.mins[1] = 0;
1070         cbox.mins[2] = 0;
1071         cbox.maxs[0] = 0;
1072         cbox.maxs[1] = 0;
1073         cbox.maxs[2] = 0;
1074         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];
1075         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];
1076         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];
1077         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];
1078         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];
1079         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];
1080         cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1081         cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1082         cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1083         cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1084         cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1085         cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1086         memset(trace, 0, sizeof(trace_t));
1087         trace->hitsupercontentsmask = hitsupercontentsmask;
1088         trace->skipsupercontentsmask = skipsupercontentsmask;
1089         trace->skipmaterialflagsmask = skipmaterialflagsmask;
1090         trace->fraction = 1;
1091         Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1092 #else
1093         RecursiveHullCheckTraceInfo_t rhc;
1094         static hull_t box_hull;
1095         static mclipnode_t box_clipnodes[6];
1096         static mplane_t box_planes[6];
1097         // fill in a default trace
1098         memset(&rhc, 0, sizeof(rhc));
1099         memset(trace, 0, sizeof(trace_t));
1100         //To keep everything totally uniform, bounding boxes are turned into small
1101         //BSP trees instead of being compared directly.
1102         // create a temp hull from bounding box sizes
1103         box_planes[0].dist = cmaxs[0] - mins[0];
1104         box_planes[1].dist = cmins[0] - maxs[0];
1105         box_planes[2].dist = cmaxs[1] - mins[1];
1106         box_planes[3].dist = cmins[1] - maxs[1];
1107         box_planes[4].dist = cmaxs[2] - mins[2];
1108         box_planes[5].dist = cmins[2] - maxs[2];
1109 #if COLLISIONPARANOID >= 3
1110         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]);
1111 #endif
1112
1113         if (box_hull.clipnodes == NULL)
1114         {
1115                 int i, side;
1116
1117                 //Set up the planes and clipnodes so that the six floats of a bounding box
1118                 //can just be stored out and get a proper hull_t structure.
1119
1120                 box_hull.clipnodes = box_clipnodes;
1121                 box_hull.planes = box_planes;
1122                 box_hull.firstclipnode = 0;
1123                 box_hull.lastclipnode = 5;
1124
1125                 for (i = 0;i < 6;i++)
1126                 {
1127                         box_clipnodes[i].planenum = i;
1128
1129                         side = i&1;
1130
1131                         box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1132                         if (i != 5)
1133                                 box_clipnodes[i].children[side^1] = i + 1;
1134                         else
1135                                 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1136
1137                         box_planes[i].type = i>>1;
1138                         box_planes[i].normal[i>>1] = 1;
1139                 }
1140         }
1141
1142         // trace a line through the generated clipping hull
1143         //rhc.boxsupercontents = boxsupercontents;
1144         rhc.hull = &box_hull;
1145         rhc.trace = trace;
1146         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1147         rhc.trace->skipsupercontentsmask = skipsupercontentsmask;
1148         rhc.trace->skipmaterialflagsmask = skipmaterialflagsmask;
1149         rhc.trace->fraction = 1;
1150         rhc.trace->allsolid = true;
1151         VectorCopy(start, rhc.start);
1152         VectorCopy(end, rhc.end);
1153         VectorSubtract(rhc.end, rhc.start, rhc.dist);
1154         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1155         //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1156         if (rhc.trace->startsupercontents)
1157                 rhc.trace->startsupercontents = boxsupercontents;
1158 #endif
1159 }
1160
1161 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)
1162 {
1163         memset(trace, 0, sizeof(trace_t));
1164         trace->fraction = 1;
1165         trace->hitsupercontentsmask = hitsupercontentsmask;
1166         trace->skipsupercontentsmask = skipsupercontentsmask;
1167         trace->skipmaterialflagsmask = skipmaterialflagsmask;
1168         if (BoxesOverlap(start, start, cmins, cmaxs))
1169         {
1170                 trace->startsupercontents |= boxsupercontents;
1171                 if ((hitsupercontentsmask & boxsupercontents) && !(skipsupercontentsmask & boxsupercontents))
1172                 {
1173                         trace->startsolid = true;
1174                         trace->allsolid = true;
1175                 }
1176         }
1177 }
1178
1179 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)
1180 {
1181         trace_t trace;
1182         Mod_Q1BSP_TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK, 0, MATERIALFLAGMASK_TRANSLUCENT);
1183         return trace.fraction == 1 || BoxesOverlap(trace.endpos, trace.endpos, acceptmins, acceptmaxs);
1184 }
1185
1186 static int Mod_BSP_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)
1187 {
1188         int side;
1189         float front, back;
1190         float mid, distz = endz - startz;
1191
1192         while (node->plane)
1193         {
1194                 switch (node->plane->type)
1195                 {
1196                 case PLANE_X:
1197                         node = node->children[x < node->plane->dist];
1198                         continue; // loop back and process the new node
1199                 case PLANE_Y:
1200                         node = node->children[y < node->plane->dist];
1201                         continue; // loop back and process the new node
1202                 case PLANE_Z:
1203                         side = startz < node->plane->dist;
1204                         if ((endz < node->plane->dist) == side)
1205                         {
1206                                 node = node->children[side];
1207                                 continue; // loop back and process the new node
1208                         }
1209                         // found an intersection
1210                         mid = node->plane->dist;
1211                         break;
1212                 default:
1213                         back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1214                         front += startz * node->plane->normal[2];
1215                         back += endz * node->plane->normal[2];
1216                         side = front < node->plane->dist;
1217                         if ((back < 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 = startz + distz * (front - node->plane->dist) / (front - back);
1224                         break;
1225                 }
1226
1227                 // go down front side
1228                 if (node->children[side]->plane && Mod_BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1229                         return true;    // hit something
1230
1231                 // check for impact on this node
1232                 if (node->numsurfaces)
1233                 {
1234                         unsigned int i;
1235                         int dsi, dti, lmwidth, lmheight;
1236                         float ds, dt;
1237                         msurface_t *surface;
1238                         unsigned char *lightmap;
1239                         int maps, line3, size3;
1240                         float dsfrac;
1241                         float dtfrac;
1242                         float scale, w, w00, w01, w10, w11;
1243
1244                         surface = model->data_surfaces + node->firstsurface;
1245                         for (i = 0;i < node->numsurfaces;i++, surface++)
1246                         {
1247                                 if(!surface->texture)
1248                                         continue;
1249                                 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo || !surface->lightmapinfo->samples)
1250                                         continue;       // no lightmaps
1251
1252                                 // location we want to sample in the lightmap
1253                                 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;
1254                                 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;
1255
1256                                 // check the bounds
1257                                 // thanks to jitspoe for pointing out that this int cast was
1258                                 // rounding toward zero, so we floor it
1259                                 dsi = (int)floor(ds);
1260                                 dti = (int)floor(dt);
1261                                 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1262                                 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1263
1264                                 // is it in bounds?
1265                                 // we have to tolerate a position of lmwidth-1 for some rare
1266                                 // cases - in which case the sampling position still gets
1267                                 // clamped but the color gets interpolated to that edge.
1268                                 if (dsi >= 0 && dsi < lmwidth && dti >= 0 && dti < lmheight)
1269                                 {
1270                                         // in the rare cases where we're sampling slightly off
1271                                         // the polygon, clamp the sampling position (we can still
1272                                         // interpolate outside it, where it becomes extrapolation)
1273                                         if (dsi < 0)
1274                                                 dsi = 0;
1275                                         if (dti < 0)
1276                                                 dti = 0;
1277                                         if (dsi > lmwidth-2)
1278                                                 dsi = lmwidth-2;
1279                                         if (dti > lmheight-2)
1280                                                 dti = lmheight-2;
1281
1282                                         // calculate bilinear interpolation factors
1283                                         // and also multiply by fixedpoint conversion factors to
1284                                         // compensate for lightmaps being 0-255 (as 0-2), we use
1285                                         // r_refdef.scene.rtlightstylevalue here which is already
1286                                         // 0.000-2.148 range
1287                                         // (if we used r_refdef.scene.lightstylevalue this
1288                                         //  divisor would be 32768 rather than 128)
1289                                         dsfrac = ds - dsi;
1290                                         dtfrac = dt - dti;
1291                                         w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 128.0f);
1292                                         w01 = (    dsfrac) * (1 - dtfrac) * (1.0f / 128.0f);
1293                                         w10 = (1 - dsfrac) * (    dtfrac) * (1.0f / 128.0f);
1294                                         w11 = (    dsfrac) * (    dtfrac) * (1.0f / 128.0f);
1295
1296                                         // values for pointer math
1297                                         line3 = lmwidth * 3; // LadyHavoc: *3 for colored lighting
1298                                         size3 = lmwidth * lmheight * 3; // LadyHavoc: *3 for colored lighting
1299
1300                                         // look up the pixel
1301                                         lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LadyHavoc: *3 for colored lighting
1302
1303                                         // bilinear filter each lightmap style, and sum them
1304                                         for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1305                                         {
1306                                                 scale = r_refdef.scene.rtlightstylevalue[surface->lightmapinfo->styles[maps]];
1307                                                 w = w00 * scale;VectorMA(ambientcolor, w, lightmap            , ambientcolor);
1308                                                 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3        , ambientcolor);
1309                                                 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3    , ambientcolor);
1310                                                 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1311                                                 lightmap += size3;
1312                                         }
1313
1314                                         return true; // success
1315                                 }
1316                         }
1317                 }
1318
1319                 // go down back side
1320                 node = node->children[side ^ 1];
1321                 startz = mid;
1322                 distz = endz - startz;
1323                 // loop back and process the new node
1324         }
1325
1326         // did not hit anything
1327         return false;
1328 }
1329
1330 static void Mod_BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1331 {
1332         // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1333         VectorSet(diffusenormal, 0, 0, 1);
1334
1335         if (!model->brushq1.lightdata)
1336         {
1337                 VectorSet(ambientcolor, 1, 1, 1);
1338                 VectorSet(diffusecolor, 0, 0, 0);
1339                 return;
1340         }
1341
1342         Mod_BSP_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);
1343 }
1344
1345 static const texture_t *Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(RecursiveHullCheckTraceInfo_t *t, const dp_model_t *model, const mnode_t *node, double mid[3])
1346 {
1347         unsigned int i;
1348         int j;
1349         int k;
1350         const msurface_t *surface;
1351         float normal[3];
1352         float v0[3];
1353         float v1[3];
1354         float edgedir[3];
1355         float edgenormal[3];
1356         float p[4];
1357         float midf;
1358         float t1;
1359         float t2;
1360         VectorCopy(mid, p);
1361         p[3] = 1;
1362         surface = model->data_surfaces + node->firstsurface;
1363         for (i = 0;i < node->numsurfaces;i++, surface++)
1364         {
1365                 if(!surface->texture)
1366                         continue;
1367                 // skip surfaces whose bounding box does not include the point
1368 //              if (!BoxesOverlap(mid, mid, surface->mins, surface->maxs))
1369 //                      continue;
1370                 // skip faces with contents we don't care about
1371                 if (!(t->trace->hitsupercontentsmask & surface->texture->supercontents))
1372                         continue;
1373                 // ignore surfaces matching the skipsupercontentsmask (this is rare)
1374                 if (t->trace->skipsupercontentsmask & surface->texture->supercontents)
1375                         continue;
1376                 // skip surfaces matching the skipmaterialflagsmask (e.g. MATERIALFLAG_NOSHADOW)
1377                 if (t->trace->skipmaterialflagsmask & surface->texture->currentmaterialflags)
1378                         continue;
1379                 // get the surface normal - since it is flat we know any vertex normal will suffice
1380                 VectorCopy(model->surfmesh.data_normal3f + 3 * surface->num_firstvertex, normal);
1381                 // skip backfaces
1382                 if (DotProduct(t->dist, normal) > 0)
1383                         continue;
1384                 // iterate edges and see if the point is outside one of them
1385                 for (j = 0, k = surface->num_vertices - 1;j < surface->num_vertices;k = j, j++)
1386                 {
1387                         VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + k), v0);
1388                         VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + j), v1);
1389                         VectorSubtract(v0, v1, edgedir);
1390                         CrossProduct(edgedir, normal, edgenormal);
1391                         if (DotProduct(edgenormal, p) > DotProduct(edgenormal, v0))
1392                                 break;
1393                 }
1394                 // if the point is outside one of the edges, it is not within the surface
1395                 if (j < surface->num_vertices)
1396                         continue;
1397
1398                 // we hit a surface, this is the impact point...
1399                 VectorCopy(normal, t->trace->plane.normal);
1400                 t->trace->plane.dist = DotProduct(normal, p);
1401
1402                 // calculate the return fraction which is nudged off the surface a bit
1403                 t1 = DotProduct(t->start, t->trace->plane.normal) - t->trace->plane.dist;
1404                 t2 = DotProduct(t->end, t->trace->plane.normal) - t->trace->plane.dist;
1405                 midf = (t1 - collision_impactnudge.value) / (t1 - t2);
1406                 t->trace->fraction = bound(0, midf, 1);
1407
1408                 t->trace->hittexture = surface->texture->currentframe;
1409                 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
1410                 t->trace->hitsupercontents = t->trace->hittexture->supercontents;
1411                 return surface->texture->currentframe;
1412         }
1413         return NULL;
1414 }
1415
1416 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])
1417 {
1418         const mplane_t *plane;
1419         double t1, t2;
1420         int side;
1421         double midf, mid[3];
1422         const mleaf_t *leaf;
1423
1424         while (node->plane)
1425         {
1426                 plane = node->plane;
1427                 if (plane->type < 3)
1428                 {
1429                         t1 = p1[plane->type] - plane->dist;
1430                         t2 = p2[plane->type] - plane->dist;
1431                 }
1432                 else
1433                 {
1434                         t1 = DotProduct (plane->normal, p1) - plane->dist;
1435                         t2 = DotProduct (plane->normal, p2) - plane->dist;
1436                 }
1437                 if (t1 < 0)
1438                 {
1439                         if (t2 < 0)
1440                         {
1441                                 node = node->children[1];
1442                                 continue;
1443                         }
1444                         side = 1;
1445                 }
1446                 else
1447                 {
1448                         if (t2 >= 0)
1449                         {
1450                                 node = node->children[0];
1451                                 continue;
1452                         }
1453                         side = 0;
1454                 }
1455
1456                 // the line intersects, find intersection point
1457                 // LadyHavoc: this uses the original trace for maximum accuracy
1458                 if (plane->type < 3)
1459                 {
1460                         t1 = t->start[plane->type] - plane->dist;
1461                         t2 = t->end[plane->type] - plane->dist;
1462                 }
1463                 else
1464                 {
1465                         t1 = DotProduct (plane->normal, t->start) - plane->dist;
1466                         t2 = DotProduct (plane->normal, t->end) - plane->dist;
1467                 }
1468
1469                 midf = t1 / (t1 - t2);
1470                 VectorMA(t->start, midf, t->dist, mid);
1471
1472                 // recurse both sides, front side first, return if we hit a surface
1473                 if (Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side], p1, mid) == HULLCHECKSTATE_DONE)
1474                         return HULLCHECKSTATE_DONE;
1475
1476                 // test each surface on the node
1477                 Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(t, model, node, mid);
1478                 if (t->trace->hittexture)
1479                         return HULLCHECKSTATE_DONE;
1480
1481                 // recurse back side
1482                 return Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side ^ 1], mid, p2);
1483         }
1484         leaf = (const mleaf_t *)node;
1485         side = Mod_Q1BSP_SuperContentsFromNativeContents(leaf->contents);
1486         if (!t->trace->startfound)
1487         {
1488                 t->trace->startfound = true;
1489                 t->trace->startsupercontents |= side;
1490         }
1491         if (side & SUPERCONTENTS_LIQUIDSMASK)
1492                 t->trace->inwater = true;
1493         if (side == 0)
1494                 t->trace->inopen = true;
1495         if (side & t->trace->hitsupercontentsmask)
1496         {
1497                 // if the first leaf is solid, set startsolid
1498                 if (t->trace->allsolid)
1499                         t->trace->startsolid = true;
1500                 return HULLCHECKSTATE_SOLID;
1501         }
1502         else
1503         {
1504                 t->trace->allsolid = false;
1505                 return HULLCHECKSTATE_EMPTY;
1506         }
1507 }
1508
1509 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)
1510 {
1511         RecursiveHullCheckTraceInfo_t rhc;
1512
1513         memset(&rhc, 0, sizeof(rhc));
1514         memset(trace, 0, sizeof(trace_t));
1515         rhc.trace = trace;
1516         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1517         rhc.trace->skipsupercontentsmask = skipsupercontentsmask;
1518         rhc.trace->skipmaterialflagsmask = skipmaterialflagsmask;
1519         rhc.trace->fraction = 1;
1520         rhc.trace->allsolid = true;
1521         rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
1522         VectorCopy(start, rhc.start);
1523         VectorCopy(end, rhc.end);
1524         VectorSubtract(rhc.end, rhc.start, rhc.dist);
1525         Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(&rhc, model, model->brush.data_nodes + rhc.hull->firstclipnode, rhc.start, rhc.end);
1526         VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1527 }
1528
1529 static void Mod_BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1530 {
1531         int c;
1532         unsigned char *outstart = out;
1533         while (out < outend)
1534         {
1535                 if (in == inend)
1536                 {
1537                         Con_Printf("Mod_BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1538                         return;
1539                 }
1540                 c = *in++;
1541                 if (c)
1542                         *out++ = c;
1543                 else
1544                 {
1545                         if (in == inend)
1546                         {
1547                                 Con_Printf("Mod_BSP_DecompressVis: input underrun (during zero-run) on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1548                                 return;
1549                         }
1550                         for (c = *in++;c > 0;c--)
1551                         {
1552                                 if (out == outend)
1553                                 {
1554                                         Con_Printf("Mod_BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1555                                         return;
1556                                 }
1557                                 *out++ = 0;
1558                         }
1559                 }
1560         }
1561 }
1562
1563 /*
1564 =============
1565 Mod_Q1BSP_LoadSplitSky
1566
1567 A sky texture is 256*128, with the right side being a masked overlay
1568 ==============
1569 */
1570 static void Mod_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1571 {
1572         int x, y;
1573         int w = width/2;
1574         int h = height;
1575         unsigned int *solidpixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1576         unsigned int *alphapixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1577
1578         // allocate a texture pool if we need it
1579         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1580                 loadmodel->texturepool = R_AllocTexturePool();
1581
1582         if (bytesperpixel == 4)
1583         {
1584                 for (y = 0;y < h;y++)
1585                 {
1586                         for (x = 0;x < w;x++)
1587                         {
1588                                 solidpixels[y*w+x] = ((unsigned *)src)[y*width+x+w];
1589                                 alphapixels[y*w+x] = ((unsigned *)src)[y*width+x];
1590                         }
1591                 }
1592         }
1593         else
1594         {
1595                 // make an average value for the back to avoid
1596                 // a fringe on the top level
1597                 int p, r, g, b;
1598                 union
1599                 {
1600                         unsigned int i;
1601                         unsigned char b[4];
1602                 }
1603                 bgra;
1604                 r = g = b = 0;
1605                 for (y = 0;y < h;y++)
1606                 {
1607                         for (x = 0;x < w;x++)
1608                         {
1609                                 p = src[x*width+y+w];
1610                                 r += palette_rgb[p][0];
1611                                 g += palette_rgb[p][1];
1612                                 b += palette_rgb[p][2];
1613                         }
1614                 }
1615                 bgra.b[2] = r/(w*h);
1616                 bgra.b[1] = g/(w*h);
1617                 bgra.b[0] = b/(w*h);
1618                 bgra.b[3] = 0;
1619                 for (y = 0;y < h;y++)
1620                 {
1621                         for (x = 0;x < w;x++)
1622                         {
1623                                 solidpixels[y*w+x] = palette_bgra_complete[src[y*width+x+w]];
1624                                 p = src[y*width+x];
1625                                 alphapixels[y*w+x] = p ? palette_bgra_complete[p] : bgra.i;
1626                         }
1627                 }
1628         }
1629
1630         loadmodel->brush.solidskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_solidtexture", 0         , (unsigned char *) solidpixels, w, h, 0, 0, 0, vid.sRGB3D);
1631         loadmodel->brush.alphaskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_alphatexture", TEXF_ALPHA, (unsigned char *) alphapixels, w, h, 0, 0, 0, vid.sRGB3D);
1632         Mem_Free(solidpixels);
1633         Mem_Free(alphapixels);
1634 }
1635
1636 static void Mod_Q1BSP_LoadTextures(sizebuf_t *sb)
1637 {
1638         int i, j, k, num, max, altmax, mtwidth, mtheight, doffset, incomplete, nummiptex = 0, firstskynoshadowtexture = 0;
1639         skinframe_t *skinframemissing;
1640         texture_t *tx, *tx2, *anims[10], *altanims[10], *currentskynoshadowtexture;
1641         texture_t backuptex;
1642         unsigned char *data, *mtdata;
1643         const char *s;
1644         char mapname[MAX_QPATH], name[MAX_QPATH];
1645         unsigned char zeroopaque[4], zerotrans[4];
1646         sizebuf_t miptexsb;
1647         char vabuf[1024];
1648         Vector4Set(zeroopaque, 0, 0, 0, 255);
1649         Vector4Set(zerotrans, 0, 0, 0, 128);
1650
1651         loadmodel->data_textures = NULL;
1652
1653         // add two slots for notexture walls and notexture liquids, and duplicate
1654         // all sky textures; sky surfaces can be shadow-casting or not, the surface
1655         // loading will choose according to the contents behind the surface
1656         // (necessary to support e1m5 logo shadow which has a SKY contents brush,
1657         // while correctly treating sky textures as occluders in other situations).
1658         if (sb->cursize)
1659         {
1660                 int numsky = 0;
1661                 size_t watermark;
1662                 nummiptex = MSG_ReadLittleLong(sb);
1663                 loadmodel->num_textures = nummiptex + 2;
1664                 // save the position so we can go back to it
1665                 watermark = sb->readcount;
1666                 for (i = 0; i < nummiptex; i++)
1667                 {
1668                         doffset = MSG_ReadLittleLong(sb);
1669                         if (r_nosurftextures.integer)
1670                                 continue;
1671                         if (doffset == -1)
1672                         {
1673                                 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1674                                 continue;
1675                         }
1676
1677                         MSG_InitReadBuffer(&miptexsb, sb->data + doffset, sb->cursize - doffset);
1678
1679                         // copy name, but only up to 16 characters
1680                         // (the output buffer can hold more than this, but the input buffer is
1681                         //  only 16)
1682                         for (j = 0; j < 16; j++)
1683                                 name[j] = MSG_ReadByte(&miptexsb);
1684                         name[j] = 0;
1685                         // pretty up the buffer (replacing any trailing garbage with 0)
1686                         for (j = (int)strlen(name); j < 16; j++)
1687                                 name[j] = 0;
1688
1689                         if (!strncmp(name, "sky", 3))
1690                                 numsky++;
1691                 }
1692
1693                 // bump it back to where we started parsing
1694                 sb->readcount = (int)watermark;
1695
1696                 firstskynoshadowtexture = loadmodel->num_textures;
1697                 loadmodel->num_textures += numsky;
1698         }
1699         else
1700         {
1701                 loadmodel->num_textures = 2;
1702                 firstskynoshadowtexture = loadmodel->num_textures;
1703         }
1704         loadmodel->num_texturesperskin = loadmodel->num_textures;
1705
1706         loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1707
1708         // we'll be writing to these in parallel for sky textures
1709         currentskynoshadowtexture = loadmodel->data_textures + firstskynoshadowtexture;
1710
1711         // fill out all slots with notexture
1712         skinframemissing = R_SkinFrame_LoadMissing();
1713         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1714         {
1715                 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1716                 tx->width = 16;
1717                 tx->height = 16;
1718                 tx->basealpha = 1.0f;
1719                 tx->materialshaderpass = tx->shaderpasses[0] = Mod_CreateShaderPass(loadmodel->mempool, skinframemissing);
1720                 tx->materialshaderpass->skinframes[0] = skinframemissing;
1721                 tx->currentskinframe = skinframemissing;
1722                 tx->basematerialflags = MATERIALFLAG_WALL;
1723                 if (i == loadmodel->num_textures - 1)
1724                 {
1725                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1726                         tx->supercontents = mod_q1bsp_texture_water.supercontents;
1727                         tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1728                 }
1729                 else
1730                 {
1731                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1732                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1733                 }
1734                 tx->currentframe = tx;
1735
1736                 // clear water settings
1737                 tx->reflectmin = 0;
1738                 tx->reflectmax = 1;
1739                 tx->refractive_index = mod_q3shader_default_refractive_index.value;
1740                 tx->refractfactor = 1;
1741                 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1742                 tx->reflectfactor = 1;
1743                 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1744                 tx->r_water_wateralpha = 1;
1745                 tx->offsetmapping = OFFSETMAPPING_DEFAULT;
1746                 tx->offsetscale = 1;
1747                 tx->offsetbias = 0;
1748                 tx->specularscalemod = 1;
1749                 tx->specularpowermod = 1;
1750                 tx->transparentsort = TRANSPARENTSORT_DISTANCE;
1751                 // WHEN ADDING DEFAULTS HERE, REMEMBER TO PUT DEFAULTS IN ALL LOADERS
1752                 // JUST GREP FOR "specularscalemod = 1".
1753         }
1754
1755         if (!sb->cursize)
1756         {
1757                 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1758                 return;
1759         }
1760
1761         s = loadmodel->name;
1762         if (!strncasecmp(s, "maps/", 5))
1763                 s += 5;
1764         FS_StripExtension(s, mapname, sizeof(mapname));
1765
1766         // LadyHavoc: mostly rewritten map texture loader
1767         for (i = 0;i < nummiptex;i++)
1768         {
1769                 doffset = MSG_ReadLittleLong(sb);
1770                 if (r_nosurftextures.integer)
1771                         continue;
1772                 if (doffset == -1)
1773                 {
1774                         Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1775                         continue;
1776                 }
1777
1778                 MSG_InitReadBuffer(&miptexsb, sb->data + doffset, sb->cursize - doffset);
1779
1780                 // copy name, but only up to 16 characters
1781                 // (the output buffer can hold more than this, but the input buffer is
1782                 //  only 16)
1783                 for (j = 0;j < 16;j++)
1784                         name[j] = MSG_ReadByte(&miptexsb);
1785                 name[j] = 0;
1786                 // pretty up the buffer (replacing any trailing garbage with 0)
1787                 for (j = (int)strlen(name);j < 16;j++)
1788                         name[j] = 0;
1789
1790                 if (!name[0])
1791                 {
1792                         dpsnprintf(name, sizeof(name), "unnamed%i", i);
1793                         Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1794                 }
1795
1796                 mtwidth = MSG_ReadLittleLong(&miptexsb);
1797                 mtheight = MSG_ReadLittleLong(&miptexsb);
1798                 mtdata = NULL;
1799                 j = MSG_ReadLittleLong(&miptexsb);
1800                 if (j)
1801                 {
1802                         // texture included
1803                         if (j < 40 || j + mtwidth * mtheight > miptexsb.cursize)
1804                         {
1805                                 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, name);
1806                                 continue;
1807                         }
1808                         mtdata = miptexsb.data + j;
1809                 }
1810
1811                 if ((mtwidth & 15) || (mtheight & 15))
1812                         Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, name);
1813
1814                 // LadyHavoc: force all names to lowercase
1815                 for (j = 0;name[j];j++)
1816                         if (name[j] >= 'A' && name[j] <= 'Z')
1817                                 name[j] += 'a' - 'A';
1818
1819                 tx = loadmodel->data_textures + i;
1820                 // try to load shader or external textures, but first we have to backup the texture_t because shader loading overwrites it even if it fails
1821                 backuptex = loadmodel->data_textures[i];
1822                 if (name[0] && /* HACK */ strncmp(name, "sky", 3) /* END HACK */ && (Mod_LoadTextureFromQ3Shader(loadmodel->mempool, loadmodel->name, loadmodel->data_textures + i, va(vabuf, sizeof(vabuf), "%s/%s", mapname, name), false, false, TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, MATERIALFLAG_WALL) ||
1823                                 Mod_LoadTextureFromQ3Shader(loadmodel->mempool, loadmodel->name, loadmodel->data_textures + i, va(vabuf, sizeof(vabuf), "%s"   , name), false, false, TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, MATERIALFLAG_WALL)))
1824                 {
1825                         // set the width/height fields which are used for parsing texcoords in this bsp format
1826                         tx->width = mtwidth;
1827                         tx->height = mtheight;
1828                         continue;
1829                 }
1830                 // no luck with loading shaders or external textures - restore the in-progress texture loading
1831                 loadmodel->data_textures[i] = backuptex;
1832
1833                 strlcpy(tx->name, name, sizeof(tx->name));
1834                 tx->width = mtwidth;
1835                 tx->height = mtheight;
1836                 tx->basealpha = 1.0f;
1837
1838                 // start out with no animation
1839                 tx->currentframe = tx;
1840                 tx->currentskinframe = tx->materialshaderpass != NULL ? tx->materialshaderpass->skinframes[0] : NULL;
1841
1842                 if (tx->name[0] == '*')
1843                 {
1844                         if (!strncmp(tx->name, "*lava", 5))
1845                         {
1846                                 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1847                                 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1848                         }
1849                         else if (!strncmp(tx->name, "*slime", 6))
1850                         {
1851                                 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1852                                 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1853                         }
1854                         else
1855                         {
1856                                 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1857                                 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1858                         }
1859                 }
1860                 else if (!strncmp(tx->name, "sky", 3))
1861                 {
1862                         tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1863                         tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1864                         // for the surface traceline we need to hit this surface as a solid...
1865                         tx->supercontents |= SUPERCONTENTS_SOLID;
1866                 }
1867                 else
1868                 {
1869                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1870                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1871                 }
1872
1873                 if (cls.state != ca_dedicated)
1874                 {
1875                         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);
1876                         if ((!skinframe &&
1877                             !(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)))
1878                                 // HACK: It loads custom skybox textures as a wall if loaded as a skinframe.
1879                                 || !strncmp(tx->name, "sky", 3))
1880                         {
1881                                 // did not find external texture via shader loading, load it from the bsp or wad3
1882                                 if (loadmodel->brush.ishlbsp)
1883                                 {
1884                                         // internal texture overrides wad
1885                                         unsigned char* pixels, * freepixels;
1886                                         pixels = freepixels = NULL;
1887                                         if (mtdata)
1888                                                 pixels = W_ConvertWAD3TextureBGRA(&miptexsb);
1889                                         if (pixels == NULL)
1890                                                 pixels = freepixels = W_GetTextureBGRA(tx->name);
1891                                         if (pixels != NULL)
1892                                         {
1893                                                 tx->width = image_width;
1894                                                 tx->height = image_height;
1895                                                 tx->materialshaderpass->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, pixels, image_width, image_height, image_width, image_height, CRC_Block(pixels, image_width * image_height * 4), true);
1896                                         }
1897                                         if (freepixels)
1898                                                 Mem_Free(freepixels);
1899                                 }
1900                                 else if (!strncmp(tx->name, "sky", 3) && mtwidth == mtheight * 2)
1901                                 {
1902                                         data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va(vabuf, sizeof(vabuf), "textures/%s/%s", mapname, tx->name), false, false, false, NULL);
1903                                         if (!data)
1904                                                 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va(vabuf, sizeof(vabuf), "textures/%s", tx->name), false, false, false, NULL);
1905                                         if (data && image_width == image_height * 2)
1906                                         {
1907                                                 Mod_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1908                                                 Mem_Free(data);
1909                                         }
1910                                         else if (mtdata != NULL)
1911                                                 Mod_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1912                                 }
1913                                 else if (mtdata) // texture included
1914                                         tx->materialshaderpass->skinframes[0] = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1915                                 // if mtdata is NULL, the "missing" texture has already been assigned to this
1916                                 // LadyHavoc: some Tenebrae textures get replaced by black
1917                                 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1918                                         tx->materialshaderpass->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA, zerotrans, 1, 1, 0, 0, 0, false);
1919                                 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1920                                         tx->materialshaderpass->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, 0, zeroopaque, 1, 1, 0, 0, 0, false);
1921                         }
1922                         else
1923                                 tx->materialshaderpass->skinframes[0] = skinframe;
1924                         tx->currentskinframe = tx->materialshaderpass->skinframes[0];
1925                 }
1926
1927                 tx->basematerialflags = MATERIALFLAG_WALL;
1928                 if (tx->name[0] == '*')
1929                 {
1930                         // LadyHavoc: some turbulent textures should not be affected by wateralpha
1931                         if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1932                                 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1933                         else if (!strncmp(tx->name,"*lava",5)
1934                          || !strncmp(tx->name,"*teleport",9)
1935                          || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1936                                 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1937                         else
1938                                 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1939                         if (tx->currentskinframe != NULL && tx->currentskinframe->hasalpha)
1940                                 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1941                 }
1942                 else if (tx->name[0] == '{') // fence textures
1943                 {
1944                         tx->basematerialflags |= MATERIALFLAG_ALPHATEST | MATERIALFLAG_NOSHADOW;
1945                 }
1946                 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1947                 {
1948                         // replace the texture with black
1949                         tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1950                 }
1951                 else if (!strncmp(tx->name, "sky", 3))
1952                         tx->basematerialflags = MATERIALFLAG_SKY;
1953                 else if (!strcmp(tx->name, "caulk"))
1954                         tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1955                 else if (tx->currentskinframe != NULL && tx->currentskinframe->hasalpha)
1956                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1957                 tx->currentmaterialflags = tx->basematerialflags;
1958
1959                 // duplicate of sky with NOSHADOW
1960                 if (tx->basematerialflags & MATERIALFLAG_SKY)
1961                 {
1962                         *currentskynoshadowtexture = *tx;
1963                         currentskynoshadowtexture->basematerialflags |= MATERIALFLAG_NOSHADOW;
1964                         tx->skynoshadowtexture = currentskynoshadowtexture;
1965                         currentskynoshadowtexture++;
1966                 }
1967         }
1968
1969         // sequence the animations
1970         for (i = 0;i < nummiptex;i++)
1971         {
1972                 tx = loadmodel->data_textures + i;
1973                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1974                         continue;
1975                 num = tx->name[1];
1976                 if ((num < '0' || num > '9') && (num < 'a' || num > 'j'))
1977                 {
1978                         Con_Printf("Bad animating texture %s\n", tx->name);
1979                         continue;
1980                 }
1981                 if (tx->anim_total[0] || tx->anim_total[1])
1982                         continue;       // already sequenced
1983
1984                 // find the number of frames in the animation
1985                 memset(anims, 0, sizeof(anims));
1986                 memset(altanims, 0, sizeof(altanims));
1987
1988                 for (j = i;j < nummiptex;j++)
1989                 {
1990                         tx2 = loadmodel->data_textures + j;
1991                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1992                                 continue;
1993
1994                         num = tx2->name[1];
1995                         if (num >= '0' && num <= '9')
1996                                 anims[num - '0'] = tx2;
1997                         else if (num >= 'a' && num <= 'j')
1998                                 altanims[num - 'a'] = tx2;
1999                         // No need to warn otherwise - we already did above.
2000                 }
2001
2002                 max = altmax = 0;
2003                 for (j = 0;j < 10;j++)
2004                 {
2005                         if (anims[j])
2006                                 max = j + 1;
2007                         if (altanims[j])
2008                                 altmax = j + 1;
2009                 }
2010                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
2011
2012                 incomplete = false;
2013                 for (j = 0;j < max;j++)
2014                 {
2015                         if (!anims[j])
2016                         {
2017                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
2018                                 incomplete = true;
2019                         }
2020                 }
2021                 for (j = 0;j < altmax;j++)
2022                 {
2023                         if (!altanims[j])
2024                         {
2025                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
2026                                 incomplete = true;
2027                         }
2028                 }
2029                 if (incomplete)
2030                         continue;
2031
2032                 // If we have exactly one frame, something's wrong.
2033                 if (max + altmax <= 1)
2034                 {
2035                         Con_Printf("Texture %s is animated (leading +) but has only one frame\n", tx->name);
2036                 }
2037
2038                 if (altmax < 1)
2039                 {
2040                         // if there is no alternate animation, duplicate the primary
2041                         // animation into the alternate
2042                         altmax = max;
2043                         for (k = 0;k < 10;k++)
2044                                 altanims[k] = anims[k];
2045                 }
2046
2047                 if (max < 1)
2048                 {
2049                         // Warn.
2050                         Con_Printf("Missing frame 0 of %s\n", tx->name);
2051
2052                         // however, we can handle this by duplicating the alternate animation into the primary
2053                         max = altmax;
2054                         for (k = 0;k < 10;k++)
2055                                 anims[k] = altanims[k];
2056                 }
2057
2058
2059                 // link together the primary animation
2060                 for (j = 0;j < max;j++)
2061                 {
2062                         tx2 = anims[j];
2063                         tx2->animated = 1; // q1bsp
2064                         tx2->anim_total[0] = max;
2065                         tx2->anim_total[1] = altmax;
2066                         for (k = 0;k < 10;k++)
2067                         {
2068                                 tx2->anim_frames[0][k] = anims[k];
2069                                 tx2->anim_frames[1][k] = altanims[k];
2070                         }
2071                 }
2072
2073                 // if there really is an alternate anim...
2074                 if (anims[0] != altanims[0])
2075                 {
2076                         // link together the alternate animation
2077                         for (j = 0;j < altmax;j++)
2078                         {
2079                                 tx2 = altanims[j];
2080                                 tx2->animated = 1; // q1bsp
2081                                 // the primary/alternate are reversed here
2082                                 tx2->anim_total[0] = altmax;
2083                                 tx2->anim_total[1] = max;
2084                                 for (k = 0;k < 10;k++)
2085                                 {
2086                                         tx2->anim_frames[0][k] = altanims[k];
2087                                         tx2->anim_frames[1][k] = anims[k];
2088                                 }
2089                         }
2090                 }
2091         }
2092 }
2093
2094 static void Mod_Q1BSP_LoadLighting(sizebuf_t *sb)
2095 {
2096         int i;
2097         unsigned char *in, *out, *data, d;
2098         char litfilename[MAX_QPATH];
2099         char dlitfilename[MAX_QPATH];
2100         fs_offset_t filesize;
2101         if (loadmodel->brush.ishlbsp) // LadyHavoc: load the colored lighting data straight
2102         {
2103                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, sb->cursize);
2104                 for (i = 0;i < sb->cursize;i++)
2105                         loadmodel->brushq1.lightdata[i] = sb->data[i] >>= 1;
2106         }
2107         else // LadyHavoc: bsp version 29 (normal white lighting)
2108         {
2109                 // LadyHavoc: hope is not lost yet, check for a .lit file to load
2110                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
2111                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
2112                 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
2113                 strlcat (litfilename, ".lit", sizeof (litfilename));
2114                 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
2115                 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
2116                 if (data)
2117                 {
2118                         if (filesize == (fs_offset_t)(8 + sb->cursize * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
2119                         {
2120                                 i = LittleLong(((int *)data)[1]);
2121                                 if (i == 1)
2122                                 {
2123                                         if (developer_loading.integer)
2124                                                 Con_Printf("loaded %s\n", litfilename);
2125                                         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
2126                                         memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
2127                                         Mem_Free(data);
2128                                         data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
2129                                         if (data)
2130                                         {
2131                                                 if (filesize == (fs_offset_t)(8 + sb->cursize * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
2132                                                 {
2133                                                         i = LittleLong(((int *)data)[1]);
2134                                                         if (i == 1)
2135                                                         {
2136                                                                 if (developer_loading.integer)
2137                                                                         Con_Printf("loaded %s\n", dlitfilename);
2138                                                                 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
2139                                                                 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
2140                                                                 loadmodel->brushq3.deluxemapping_modelspace = false;
2141                                                                 loadmodel->brushq3.deluxemapping = true;
2142                                                         }
2143                                                 }
2144                                                 Mem_Free(data);
2145                                                 data = NULL;
2146                                         }
2147                                         return;
2148                                 }
2149                                 else
2150                                         Con_Printf("Unknown .lit file version (%d)\n", i);
2151                         }
2152                         else if (filesize == 8)
2153                                 Con_Print("Empty .lit file, ignoring\n");
2154                         else
2155                                 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + sb->cursize * 3));
2156                         if (data)
2157                         {
2158                                 Mem_Free(data);
2159                                 data = NULL;
2160                         }
2161                 }
2162                 // LadyHavoc: oh well, expand the white lighting data
2163                 if (!sb->cursize)
2164                         return;
2165                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, sb->cursize*3);
2166                 in = sb->data;
2167                 out = loadmodel->brushq1.lightdata;
2168                 for (i = 0;i < sb->cursize;i++)
2169                 {
2170                         d = *in++;
2171                         *out++ = d;
2172                         *out++ = d;
2173                         *out++ = d;
2174                 }
2175         }
2176 }
2177
2178 static void Mod_Q1BSP_LoadVisibility(sizebuf_t *sb)
2179 {
2180         loadmodel->brushq1.num_compressedpvs = 0;
2181         loadmodel->brushq1.data_compressedpvs = NULL;
2182         if (!sb->cursize)
2183                 return;
2184         loadmodel->brushq1.num_compressedpvs = sb->cursize;
2185         loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, sb->cursize);
2186         MSG_ReadBytes(sb, sb->cursize, loadmodel->brushq1.data_compressedpvs);
2187 }
2188
2189 // used only for HalfLife maps
2190 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
2191 {
2192         char key[128], value[4096];
2193         int i, j, k;
2194         if (!data)
2195                 return;
2196         if (!COM_ParseToken_Simple(&data, false, false, true))
2197                 return; // error
2198         if (com_token[0] != '{')
2199                 return; // error
2200         while (1)
2201         {
2202                 if (!COM_ParseToken_Simple(&data, false, false, true))
2203                         return; // error
2204                 if (com_token[0] == '}')
2205                         break; // end of worldspawn
2206                 if (com_token[0] == '_')
2207                         strlcpy(key, com_token + 1, sizeof(key));
2208                 else
2209                         strlcpy(key, com_token, sizeof(key));
2210                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
2211                         key[strlen(key)-1] = 0;
2212                 if (!COM_ParseToken_Simple(&data, false, false, true))
2213                         return; // error
2214                 dpsnprintf(value, sizeof(value), "%s", com_token);
2215                 if (!strcmp("wad", key)) // for HalfLife maps
2216                 {
2217                         if (loadmodel->brush.ishlbsp)
2218                         {
2219                                 j = 0;
2220                                 for (i = 0;i < (int)sizeof(value);i++)
2221                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
2222                                                 break;
2223                                 if (i < (int)sizeof(value) && value[i])
2224                                 {
2225                                         for (;i < (int)sizeof(value);i++)
2226                                         {
2227                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
2228                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
2229                                                         j = i+1;
2230                                                 else if (value[i] == ';' || value[i] == 0)
2231                                                 {
2232                                                         k = value[i];
2233                                                         value[i] = 0;
2234                                                         W_LoadTextureWadFile(&value[j], false);
2235                                                         j = i+1;
2236                                                         if (!k)
2237                                                                 break;
2238                                                 }
2239                                         }
2240                                 }
2241                         }
2242                 }
2243         }
2244 }
2245
2246 static void Mod_Q1BSP_LoadEntities(sizebuf_t *sb)
2247 {
2248         loadmodel->brush.entities = NULL;
2249         if (!sb->cursize)
2250                 return;
2251         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, sb->cursize + 1);
2252         MSG_ReadBytes(sb, sb->cursize, (unsigned char *)loadmodel->brush.entities);
2253         loadmodel->brush.entities[sb->cursize] = 0;
2254         if (loadmodel->brush.ishlbsp)
2255                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
2256 }
2257
2258
2259 static void Mod_Q1BSP_LoadVertexes(sizebuf_t *sb)
2260 {
2261         mvertex_t       *out;
2262         int                     i, count;
2263         int                     structsize = 12;
2264
2265         if (sb->cursize % structsize)
2266                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
2267         count = sb->cursize / structsize;
2268         out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2269
2270         loadmodel->brushq1.vertexes = out;
2271         loadmodel->brushq1.numvertexes = count;
2272
2273         for ( i=0 ; i<count ; i++, out++)
2274         {
2275                 out->position[0] = MSG_ReadLittleFloat(sb);
2276                 out->position[1] = MSG_ReadLittleFloat(sb);
2277                 out->position[2] = MSG_ReadLittleFloat(sb);
2278         }
2279 }
2280
2281 static void Mod_BSP_LoadSubmodels(sizebuf_t *sb, hullinfo_t *hullinfo)
2282 {
2283         mmodel_t        *out;
2284         int                     i, j, count;
2285         int                     structsize = hullinfo ? (48+4*hullinfo->filehulls) : 48;
2286
2287         if (sb->cursize % structsize)
2288                 Host_Error ("Mod_BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
2289
2290         count = sb->cursize / structsize;
2291         out = (mmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
2292
2293         loadmodel->brushq1.submodels = out;
2294         loadmodel->brush.numsubmodels = count;
2295
2296         for (i = 0; i < count; i++, out++)
2297         {
2298         // spread out the mins / maxs by a pixel
2299                 out->mins[0] = MSG_ReadLittleFloat(sb) - 1;
2300                 out->mins[1] = MSG_ReadLittleFloat(sb) - 1;
2301                 out->mins[2] = MSG_ReadLittleFloat(sb) - 1;
2302                 out->maxs[0] = MSG_ReadLittleFloat(sb) + 1;
2303                 out->maxs[1] = MSG_ReadLittleFloat(sb) + 1;
2304                 out->maxs[2] = MSG_ReadLittleFloat(sb) + 1;
2305                 out->origin[0] = MSG_ReadLittleFloat(sb);
2306                 out->origin[1] = MSG_ReadLittleFloat(sb);
2307                 out->origin[2] = MSG_ReadLittleFloat(sb);
2308                 if(hullinfo)
2309                 {
2310                         for (j = 0; j < hullinfo->filehulls; j++)
2311                                 out->headnode[j] = MSG_ReadLittleLong(sb);
2312                         out->visleafs  = MSG_ReadLittleLong(sb);
2313                 }
2314                 else // Quake 2 has only one hull
2315                         out->headnode[0] = MSG_ReadLittleLong(sb);
2316
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) // LadyHavoc: HalfLife map (bsp version 30)
2711                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + lightmapoffset;
2712                 else // LadyHavoc: 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                                 // LadyHavoc: 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_BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2838 {
2839         //if (node->parent)
2840         //      Host_Error("Mod_BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2841         node->parent = parent;
2842         if (node->plane)
2843         {
2844                 // this is a node, recurse to children
2845                 Mod_BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2846                 Mod_BSP_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                         // LadyHavoc: 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_BSP_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_BSP_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                         // LadyHavoc: 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_BSP_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_BSP_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_BSP_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_BSP_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_BSP_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(CON_WARN "Mod_BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3668                 nodeportal->numpoints = 0;
3669         }
3670         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3671         {
3672                 Con_Print(CON_WARN "Mod_BSP_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_BSP_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_BSP_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_BSP_RecursiveNodePortals(front);
3745         Mod_BSP_RecursiveNodePortals(back);
3746
3747         portalpointsbufferoffset -= 6*MAX_PORTALPOINTS;
3748 }
3749
3750 static void Mod_BSP_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_BSP_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_BSP_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_BSP_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_BSP_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_BSP_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_BSP_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_BSP_GetPVS(model, org))
3812         {
3813                 memset(pvsbuffer, 0xFF, bytes);
3814                 return bytes;
3815         }
3816         if (!merge)
3817                 memset(pvsbuffer, 0, bytes);
3818         Mod_BSP_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 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);
3856
3857 void Mod_2PSB_Load(dp_model_t *mod, void *buffer, void *bufferend)
3858 {
3859         mod->brush.isbsp2 = true;
3860         mod->brush.isbsp2rmqe = true; // like bsp2 except leaf/node bounds are 16bit (unexpanded)
3861         mod->modeldatatypestring = "Q1BSP2rmqe";
3862         Mod_Q1BSP_Load(mod, buffer, bufferend);
3863 }
3864
3865 void Mod_BSP2_Load(dp_model_t *mod, void *buffer, void *bufferend)
3866 {
3867         mod->brush.isbsp2 = true;
3868         mod->modeldatatypestring = "Q1BSP2";
3869         Mod_Q1BSP_Load(mod, buffer, bufferend);
3870 }
3871
3872 void Mod_HLBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3873 {
3874         mod->brush.ishlbsp = true;
3875         mod->modeldatatypestring = "HLBSP";
3876         Mod_Q1BSP_Load(mod, buffer, bufferend);
3877 }
3878
3879 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3880 {
3881         int i, j, k;
3882         sizebuf_t lumpsb[HEADER_LUMPS];
3883         mmodel_t *bm;
3884         float dist, modelyawradius, modelradius;
3885         msurface_t *surface;
3886         hullinfo_t hullinfo;
3887         int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3888         model_brush_lightstyleinfo_t styleinfo[256];
3889         unsigned char *datapointer;
3890         sizebuf_t sb;
3891
3892         MSG_InitReadBuffer(&sb, (unsigned char *)buffer, (unsigned char *)bufferend - (unsigned char *)buffer);
3893
3894         mod->type = mod_brushq1;
3895
3896         mod->brush.ishlbsp = false;
3897         mod->brush.isbsp2rmqe = false;
3898         mod->brush.isbsp2 = false;
3899         mod->brush.isq2bsp = false;
3900         mod->brush.isq3bsp = false;
3901         mod->brush.skymasking = true;
3902         i = MSG_ReadLittleLong(&sb);
3903
3904         if(!mod->modeldatatypestring)
3905                 mod->modeldatatypestring = "Q1BSP";
3906
3907 // fill in hull info
3908         VectorClear (hullinfo.hullsizes[0][0]);
3909         VectorClear (hullinfo.hullsizes[0][1]);
3910         if (mod->brush.ishlbsp)
3911         {
3912                 hullinfo.filehulls = 4;
3913                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3914                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3915                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3916                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3917                 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3918                 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3919         }
3920         else
3921         {
3922                 hullinfo.filehulls = 4;
3923                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3924                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3925                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3926                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3927         }
3928
3929 // read lumps
3930         for (i = 0; i < HEADER_LUMPS; i++)
3931         {
3932                 int offset = MSG_ReadLittleLong(&sb);
3933                 int size = MSG_ReadLittleLong(&sb);
3934                 if (offset < 0 || offset + size > sb.cursize)
3935                         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);
3936                 MSG_InitReadBuffer(&lumpsb[i], sb.data + offset, size);
3937         }
3938
3939         mod->soundfromcenter = true;
3940         mod->TraceBox = Mod_Q1BSP_TraceBox;
3941         mod->TraceLine = Mod_Q1BSP_TraceLine;
3942         mod->TracePoint = Mod_Q1BSP_TracePoint;
3943         mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3944         mod->TraceLineAgainstSurfaces = Mod_Q1BSP_TraceLineAgainstSurfaces;
3945         mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3946         mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3947         mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3948         mod->brush.GetPVS = Mod_BSP_GetPVS;
3949         mod->brush.FatPVS = Mod_BSP_FatPVS;
3950         mod->brush.BoxTouchingPVS = Mod_BSP_BoxTouchingPVS;
3951         mod->brush.BoxTouchingLeafPVS = Mod_BSP_BoxTouchingLeafPVS;
3952         mod->brush.BoxTouchingVisibleLeafs = Mod_BSP_BoxTouchingVisibleLeafs;
3953         mod->brush.FindBoxClusters = Mod_BSP_FindBoxClusters;
3954         mod->brush.LightPoint = Mod_BSP_LightPoint;
3955         mod->brush.FindNonSolidLocation = Mod_BSP_FindNonSolidLocation;
3956         mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3957         mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3958         mod->brush.PointInLeaf = Mod_BSP_PointInLeaf;
3959         mod->Draw = R_Mod_Draw;
3960         mod->DrawDepth = R_Mod_DrawDepth;
3961         mod->DrawDebug = R_Mod_DrawDebug;
3962         mod->DrawPrepass = R_Mod_DrawPrepass;
3963         mod->GetLightInfo = R_Mod_GetLightInfo;
3964         mod->CompileShadowMap = R_Mod_CompileShadowMap;
3965         mod->DrawShadowMap = R_Mod_DrawShadowMap;
3966         mod->DrawLight = R_Mod_DrawLight;
3967
3968 // load into heap
3969
3970         mod->brush.qw_md4sum = 0;
3971         mod->brush.qw_md4sum2 = 0;
3972         for (i = 0;i < HEADER_LUMPS;i++)
3973         {
3974                 int temp;
3975                 if (i == LUMP_ENTITIES)
3976                         continue;
3977                 temp = Com_BlockChecksum(lumpsb[i].data, lumpsb[i].cursize);
3978                 mod->brush.qw_md4sum ^= LittleLong(temp);
3979                 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3980                         continue;
3981                 mod->brush.qw_md4sum2 ^= LittleLong(temp);
3982         }
3983
3984         Mod_Q1BSP_LoadEntities(&lumpsb[LUMP_ENTITIES]);
3985         Mod_Q1BSP_LoadVertexes(&lumpsb[LUMP_VERTEXES]);
3986         Mod_Q1BSP_LoadEdges(&lumpsb[LUMP_EDGES]);
3987         Mod_Q1BSP_LoadSurfedges(&lumpsb[LUMP_SURFEDGES]);
3988         Mod_Q1BSP_LoadTextures(&lumpsb[LUMP_TEXTURES]);
3989         Mod_Q1BSP_LoadLighting(&lumpsb[LUMP_LIGHTING]);
3990         Mod_Q1BSP_LoadPlanes(&lumpsb[LUMP_PLANES]);
3991         Mod_Q1BSP_LoadTexinfo(&lumpsb[LUMP_TEXINFO]);
3992         Mod_Q1BSP_LoadFaces(&lumpsb[LUMP_FACES]);
3993         Mod_Q1BSP_LoadLeaffaces(&lumpsb[LUMP_MARKSURFACES]);
3994         Mod_Q1BSP_LoadVisibility(&lumpsb[LUMP_VISIBILITY]);
3995         // load submodels before leafs because they contain the number of vis leafs
3996         Mod_BSP_LoadSubmodels(&lumpsb[LUMP_MODELS], &hullinfo);
3997         Mod_Q1BSP_LoadLeafs(&lumpsb[LUMP_LEAFS]);
3998         Mod_Q1BSP_LoadNodes(&lumpsb[LUMP_NODES]);
3999         Mod_Q1BSP_LoadClipnodes(&lumpsb[LUMP_CLIPNODES], &hullinfo);
4000
4001         for (i = 0; i < HEADER_LUMPS; i++)
4002                 if (lumpsb[i].readcount != lumpsb[i].cursize && i != LUMP_TEXTURES && i != LUMP_LIGHTING)
4003                         Host_Error("Lump %i incorrectly loaded (readcount %i, size %i)\n", i, lumpsb[i].readcount, lumpsb[i].cursize);
4004
4005         // check if the map supports transparent water rendering
4006         loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
4007
4008         // we don't need the compressed pvs data anymore
4009         if (mod->brushq1.data_compressedpvs)
4010                 Mem_Free(mod->brushq1.data_compressedpvs);
4011         mod->brushq1.data_compressedpvs = NULL;
4012         mod->brushq1.num_compressedpvs = 0;
4013
4014         Mod_Q1BSP_MakeHull0();
4015         if (mod_bsp_portalize.integer)
4016                 Mod_BSP_MakePortals();
4017
4018         mod->numframes = 2;             // regular and alternate animation
4019         mod->numskins = 1;
4020
4021         if (loadmodel->brush.numsubmodels)
4022                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
4023
4024         // LadyHavoc: to clear the fog around the original quake submodel code, I
4025         // will explain:
4026         // first of all, some background info on the submodels:
4027         // model 0 is the map model (the world, named maps/e1m1.bsp for example)
4028         // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
4029         // now the weird for loop itself:
4030         // the loop functions in an odd way, on each iteration it sets up the
4031         // current 'mod' model (which despite the confusing code IS the model of
4032         // the number i), at the end of the loop it duplicates the model to become
4033         // the next submodel, and loops back to set up the new submodel.
4034
4035         // LadyHavoc: now the explanation of my sane way (which works identically):
4036         // set up the world model, then on each submodel copy from the world model
4037         // and set up the submodel with the respective model info.
4038         totalstylesurfaces = 0;
4039         totalstyles = 0;
4040         for (i = 0;i < mod->brush.numsubmodels;i++)
4041         {
4042                 memset(stylecounts, 0, sizeof(stylecounts));
4043                 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
4044                 {
4045                         surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
4046                         for (j = 0;j < MAXLIGHTMAPS;j++)
4047                                 stylecounts[surface->lightmapinfo->styles[j]]++;
4048                 }
4049                 for (k = 0;k < 255;k++)
4050                 {
4051                         totalstyles++;
4052                         if (stylecounts[k])
4053                                 totalstylesurfaces += stylecounts[k];
4054                 }
4055         }
4056         datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
4057         for (i = 0;i < mod->brush.numsubmodels;i++)
4058         {
4059                 // LadyHavoc: this code was originally at the end of this loop, but
4060                 // has been transformed to something more readable at the start here.
4061
4062                 if (i > 0)
4063                 {
4064                         char name[10];
4065                         // duplicate the basic information
4066                         dpsnprintf(name, sizeof(name), "*%i", i);
4067                         mod = Mod_FindName(name, loadmodel->name);
4068                         // copy the base model to this one
4069                         *mod = *loadmodel;
4070                         // rename the clone back to its proper name
4071                         strlcpy(mod->name, name, sizeof(mod->name));
4072                         mod->brush.parentmodel = loadmodel;
4073                         // textures and memory belong to the main model
4074                         mod->texturepool = NULL;
4075                         mod->mempool = NULL;
4076                         mod->brush.GetPVS = NULL;
4077                         mod->brush.FatPVS = NULL;
4078                         mod->brush.BoxTouchingPVS = NULL;
4079                         mod->brush.BoxTouchingLeafPVS = NULL;
4080                         mod->brush.BoxTouchingVisibleLeafs = NULL;
4081                         mod->brush.FindBoxClusters = NULL;
4082                         mod->brush.LightPoint = NULL;
4083                         mod->brush.AmbientSoundLevelsForPoint = NULL;
4084                 }
4085
4086                 mod->brush.submodel = i;
4087
4088                 if (loadmodel->brush.submodels)
4089                         loadmodel->brush.submodels[i] = mod;
4090
4091                 bm = &mod->brushq1.submodels[i];
4092
4093                 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
4094                 for (j=1 ; j<MAX_MAP_HULLS ; j++)
4095                 {
4096                         mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
4097                         mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
4098                 }
4099
4100                 mod->firstmodelsurface = bm->firstface;
4101                 mod->nummodelsurfaces = bm->numfaces;
4102
4103                 // set node/leaf parents for this submodel
4104                 Mod_BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
4105
4106                 // this has to occur after hull info has been set, as it uses Mod_Q1BSP_PointSuperContents
4107                 Mod_Q1BSP_AssignNoShadowSkySurfaces(mod);
4108
4109                 // make the model surface list (used by shadowing/lighting)
4110                 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
4111                 Mod_MakeSortedSurfaces(mod);
4112
4113                 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
4114                 // (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)
4115                 VectorCopy(bm->mins, mod->normalmins);
4116                 VectorCopy(bm->maxs, mod->normalmaxs);
4117                 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
4118                 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
4119                 modelyawradius = dist*dist+modelyawradius*modelyawradius;
4120                 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
4121                 modelradius = modelyawradius + modelradius * modelradius;
4122                 modelyawradius = sqrt(modelyawradius);
4123                 modelradius = sqrt(modelradius);
4124                 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
4125                 mod->yawmins[2] = mod->normalmins[2];
4126                 mod->yawmaxs[0] = mod->yawmaxs[1] =  modelyawradius;
4127                 mod->yawmaxs[2] = mod->normalmaxs[2];
4128                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
4129                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] =  modelradius;
4130                 mod->radius = modelradius;
4131                 mod->radius2 = modelradius * modelradius;
4132
4133                 // this gets altered below if sky or water is used
4134                 mod->DrawSky = NULL;
4135                 mod->DrawAddWaterPlanes = NULL;
4136
4137                 // scan surfaces for sky and water and flag the submodel as possessing these features or not
4138                 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
4139                 if (mod->nummodelsurfaces)
4140                 {
4141                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
4142                                 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
4143                                         break;
4144                         if (j < mod->nummodelsurfaces)
4145                                 mod->DrawSky = R_Mod_DrawSky;
4146
4147                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
4148                                 if (surface->texture && surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
4149                                         break;
4150                         if (j < mod->nummodelsurfaces)
4151                                 mod->DrawAddWaterPlanes = R_Mod_DrawAddWaterPlanes;
4152
4153                         // build lightstyle update chains
4154                         // (used to rapidly mark lightmapupdateflags on many surfaces
4155                         // when d_lightstylevalue changes)
4156                         memset(stylecounts, 0, sizeof(stylecounts));
4157                         for (k = 0;k < mod->nummodelsurfaces;k++)
4158                         {
4159                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
4160                                 for (j = 0;j < MAXLIGHTMAPS;j++)
4161                                         stylecounts[surface->lightmapinfo->styles[j]]++;
4162                         }
4163                         mod->brushq1.num_lightstyles = 0;
4164                         for (k = 0;k < 255;k++)
4165                         {
4166                                 if (stylecounts[k])
4167                                 {
4168                                         styleinfo[mod->brushq1.num_lightstyles].style = k;
4169                                         styleinfo[mod->brushq1.num_lightstyles].value = 0;
4170                                         styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
4171                                         styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
4172                                         remapstyles[k] = mod->brushq1.num_lightstyles;
4173                                         mod->brushq1.num_lightstyles++;
4174                                 }
4175                         }
4176                         for (k = 0;k < mod->nummodelsurfaces;k++)
4177                         {
4178                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
4179                                 for (j = 0;j < MAXLIGHTMAPS;j++)
4180                                 {
4181                                         if (surface->lightmapinfo->styles[j] != 255)
4182                                         {
4183                                                 int r = remapstyles[surface->lightmapinfo->styles[j]];
4184                                                 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
4185                                         }
4186                                 }
4187                         }
4188                         mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
4189                         memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
4190                 }
4191                 else
4192                 {
4193                         // LadyHavoc: empty submodel(lacrima.bsp has such a glitch)
4194                         Con_Printf(CON_WARN "warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
4195                 }
4196                 //mod->brushq1.num_visleafs = bm->visleafs;
4197
4198                 // build a Bounding Interval Hierarchy for culling triangles in light rendering
4199                 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
4200
4201                 if (mod_q1bsp_polygoncollisions.integer)
4202                 {
4203                         mod->collision_bih = mod->render_bih;
4204                         // point traces and contents checks still use the bsp tree
4205                         mod->TraceLine = Mod_CollisionBIH_TraceLine;
4206                         mod->TraceBox = Mod_CollisionBIH_TraceBox;
4207                         mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
4208                         mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLineAgainstSurfaces;
4209                 }
4210
4211                 // generate VBOs and other shared data before cloning submodels
4212                 if (i == 0)
4213                 {
4214                         Mod_BuildVBOs();
4215                         Mod_Q1BSP_LoadMapBrushes();
4216                         //Mod_Q1BSP_ProcessLightList();
4217                 }
4218         }
4219
4220         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);
4221 }
4222
4223 int Mod_Q2BSP_SuperContentsFromNativeContents(int nativecontents)
4224 {
4225         int supercontents = 0;
4226         if (nativecontents & CONTENTSQ2_SOLID)
4227                 supercontents |= SUPERCONTENTS_SOLID;
4228         if (nativecontents & CONTENTSQ2_WATER)
4229                 supercontents |= SUPERCONTENTS_WATER;
4230         if (nativecontents & CONTENTSQ2_SLIME)
4231                 supercontents |= SUPERCONTENTS_SLIME;
4232         if (nativecontents & CONTENTSQ2_LAVA)
4233                 supercontents |= SUPERCONTENTS_LAVA;
4234         if (nativecontents & CONTENTSQ2_MONSTER)
4235                 supercontents |= SUPERCONTENTS_BODY;
4236         if (nativecontents & CONTENTSQ2_DEADMONSTER)
4237                 supercontents |= SUPERCONTENTS_CORPSE;
4238         if (nativecontents & CONTENTSQ2_PLAYERCLIP)
4239                 supercontents |= SUPERCONTENTS_PLAYERCLIP;
4240         if (nativecontents & CONTENTSQ2_MONSTERCLIP)
4241                 supercontents |= SUPERCONTENTS_MONSTERCLIP;
4242         if (!(nativecontents & CONTENTSQ2_TRANSLUCENT))
4243                 supercontents |= SUPERCONTENTS_OPAQUE;
4244         return supercontents;
4245 }
4246
4247 int Mod_Q2BSP_NativeContentsFromSuperContents(int supercontents)
4248 {
4249         int nativecontents = 0;
4250         if (supercontents & SUPERCONTENTS_SOLID)
4251                 nativecontents |= CONTENTSQ2_SOLID;
4252         if (supercontents & SUPERCONTENTS_WATER)
4253                 nativecontents |= CONTENTSQ2_WATER;
4254         if (supercontents & SUPERCONTENTS_SLIME)
4255                 nativecontents |= CONTENTSQ2_SLIME;
4256         if (supercontents & SUPERCONTENTS_LAVA)
4257                 nativecontents |= CONTENTSQ2_LAVA;
4258         if (supercontents & SUPERCONTENTS_BODY)
4259                 nativecontents |= CONTENTSQ2_MONSTER;
4260         if (supercontents & SUPERCONTENTS_CORPSE)
4261                 nativecontents |= CONTENTSQ2_DEADMONSTER;
4262         if (supercontents & SUPERCONTENTS_PLAYERCLIP)
4263                 nativecontents |= CONTENTSQ2_PLAYERCLIP;
4264         if (supercontents & SUPERCONTENTS_MONSTERCLIP)
4265                 nativecontents |= CONTENTSQ2_MONSTERCLIP;
4266         if (!(supercontents & SUPERCONTENTS_OPAQUE))
4267                 nativecontents |= CONTENTSQ2_TRANSLUCENT;
4268         return nativecontents;
4269 }
4270
4271 static void Mod_Q2BSP_LoadVisibility(sizebuf_t *sb)
4272 {
4273         int i, count;
4274         loadmodel->brushq1.num_compressedpvs = 0;
4275         loadmodel->brushq1.data_compressedpvs = NULL;
4276         loadmodel->brush.num_pvsclusters = 0;
4277         loadmodel->brush.num_pvsclusterbytes = 0;
4278         loadmodel->brush.data_pvsclusters = NULL;
4279
4280         if (!sb->cursize)
4281                 return;
4282
4283         count = MSG_ReadLittleLong(sb);
4284         loadmodel->brush.num_pvsclusters = count;
4285         loadmodel->brush.num_pvsclusterbytes = (count+7)>>3;
4286         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*loadmodel->brush.num_pvsclusterbytes);
4287         for (i = 0;i < count;i++)
4288         {
4289                 int pvsofs = MSG_ReadLittleLong(sb);
4290                 /*int phsofs = */MSG_ReadLittleLong(sb);
4291                 // decompress the vis data for this cluster
4292                 // (note this accesses the underlying data store of sb, which is kind of evil)
4293                 Mod_BSP_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);
4294         }
4295         // hush the loading error check later - we had to do random access on this lump, so we didn't read to the end
4296         sb->readcount = sb->cursize;
4297 }
4298
4299 static void Mod_Q2BSP_LoadNodes(sizebuf_t *sb)
4300 {
4301         int                     i, j, count, p, child[2];
4302         mnode_t         *out;
4303         int structsize = 28;
4304
4305         if (sb->cursize % structsize)
4306                 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4307         count = sb->cursize / structsize;
4308         if (count == 0)
4309                 Host_Error("Mod_Q2BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
4310         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
4311
4312         loadmodel->brush.data_nodes = out;
4313         loadmodel->brush.num_nodes = count;
4314
4315         for ( i=0 ; i<count ; i++, out++)
4316         {
4317                 p = MSG_ReadLittleLong(sb);
4318                 out->plane = loadmodel->brush.data_planes + p;
4319                 child[0] = MSG_ReadLittleLong(sb);
4320                 child[1] = MSG_ReadLittleLong(sb);
4321                 out->mins[0] = MSG_ReadLittleShort(sb);
4322                 out->mins[1] = MSG_ReadLittleShort(sb);
4323                 out->mins[2] = MSG_ReadLittleShort(sb);
4324                 out->maxs[0] = MSG_ReadLittleShort(sb);
4325                 out->maxs[1] = MSG_ReadLittleShort(sb);
4326                 out->maxs[2] = MSG_ReadLittleShort(sb);
4327                 out->firstsurface = (unsigned short)MSG_ReadLittleShort(sb);
4328                 out->numsurfaces = (unsigned short)MSG_ReadLittleShort(sb);
4329                 if (out->firstsurface + out->numsurfaces > (unsigned int)loadmodel->num_surfaces)
4330                 {
4331                         Con_Printf("Mod_Q2BSP_LoadNodes: invalid surface index range %i+%i (file has only %i surfaces)\n", out->firstsurface, out->numsurfaces, loadmodel->num_surfaces);
4332                         out->firstsurface = 0;
4333                         out->numsurfaces = 0;
4334                 }
4335                 for (j=0 ; j<2 ; j++)
4336                 {
4337                         p = child[j];
4338                         if (p >= 0)
4339                         {
4340                                 if (p < loadmodel->brush.num_nodes)
4341                                         out->children[j] = loadmodel->brush.data_nodes + p;
4342                                 else
4343                                 {
4344                                         Con_Printf("Mod_Q2BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
4345                                         // map it to the solid leaf
4346                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
4347                                 }
4348                         }
4349                         else
4350                         {
4351                                 // get leaf index as a positive value starting at 0 (-1 becomes 0, -2 becomes 1, etc)
4352                                 p = -(p+1);
4353                                 if (p < loadmodel->brush.num_leafs)
4354                                         out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
4355                                 else
4356                                 {
4357                                         Con_Printf("Mod_Q2BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
4358                                         // map it to the solid leaf
4359                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
4360                                 }
4361                         }
4362                 }
4363         }
4364
4365         Mod_BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);        // sets nodes and leafs
4366 }
4367
4368 static void Mod_Q2BSP_LoadTexinfo(sizebuf_t *sb)
4369 {
4370         mtexinfo_t *out;
4371         int i, l, count;
4372         int structsize = 76;
4373         int maxtextures = 1024; // hardcoded limit of quake2 engine, so we may as well use it as an upper bound
4374         char filename[MAX_QPATH];
4375
4376         if (sb->cursize % structsize)
4377                 Host_Error("Mod_Q2BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
4378         count = sb->cursize / structsize;
4379         out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4380         loadmodel->brushq1.texinfo = out;
4381         loadmodel->brushq1.numtexinfo = count;
4382         loadmodel->num_texturesperskin = 0;
4383         loadmodel->data_textures = (texture_t*)Mem_Alloc(loadmodel->mempool, maxtextures * sizeof(texture_t));
4384
4385         for (i = 0;i < count;i++, out++)
4386         {
4387                 int j, k;
4388                 for (k = 0;k < 2;k++)
4389                         for (j = 0;j < 4;j++)
4390                                 out->vecs[k][j] = MSG_ReadLittleFloat(sb);
4391
4392                 out->q2flags = MSG_ReadLittleLong(sb);
4393                 out->q2value = MSG_ReadLittleLong(sb);
4394                 MSG_ReadBytes(sb, 32, (unsigned char*)out->q2texture);
4395                 out->q2texture[31] = 0; // make absolutely sure it is terminated
4396                 out->q2nexttexinfo = MSG_ReadLittleLong(sb);
4397
4398                 // find an existing match for the texture if possible
4399                 dpsnprintf(filename, sizeof(filename), "textures/%s.wal", out->q2texture);
4400                 for (j = 0;j < loadmodel->num_texturesperskin;j++)
4401                         if (!strcmp(filename, loadmodel->data_textures[j].name)
4402                          && out->q2flags == loadmodel->data_textures[j].q2flags
4403                          && out->q2value == loadmodel->data_textures[j].q2value)
4404                                 break;
4405                 // if we don't find the texture, store the new texture
4406                 if (j == loadmodel->num_texturesperskin)
4407                 {
4408                         if (loadmodel->num_texturesperskin < maxtextures)
4409                         {
4410                                 texture_t *tx = loadmodel->data_textures + j;
4411                                 int q2flags = out->q2flags;
4412                                 unsigned char *walfile = NULL;
4413                                 fs_offset_t walfilesize = 0;
4414                                 Mod_LoadTextureFromQ3Shader(loadmodel->mempool, loadmodel->name, tx, filename, true, true, TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, MATERIALFLAG_WALL);
4415                                 // now read the .wal file to get metadata (even if a .tga was overriding it, we still need the wal data)
4416                                 walfile = FS_LoadFile(filename, tempmempool, true, &walfilesize);
4417                                 if (walfile)
4418                                 {
4419                                         int w, h;
4420                                         LoadWAL_GetMetadata(walfile, (int)walfilesize, &w, &h, NULL, NULL, &tx->q2contents, NULL);
4421                                         tx->width = w;
4422                                         tx->height = h;
4423                                         Mem_Free(walfile);
4424                                 }
4425                                 else
4426                                 {
4427                                         tx->width = 16;
4428                                         tx->height = 16;
4429                                 }
4430                                 tx->q2flags = out->q2flags;
4431                                 tx->q2value = out->q2value;
4432                                 // also modify the texture to have the correct contents and such based on flags
4433                                 // note that we create multiple texture_t structures if q2flags differs
4434                                 if (q2flags & Q2SURF_LIGHT)
4435                                 {
4436                                         // doesn't mean anything to us
4437                                 }
4438                                 if (q2flags & Q2SURF_SLICK)
4439                                 {
4440                                         // would be nice to support...
4441                                 }
4442                                 if (q2flags & Q2SURF_SKY)
4443                                 {
4444                                         // sky is a rather specific thing
4445                                         q2flags &= ~Q2SURF_NODRAW; // quake2 had a slightly different meaning than we have in mind here...
4446                                         tx->basematerialflags = MATERIALFLAG_SKY;
4447                                         tx->supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE;
4448                                         tx->surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
4449                                 }
4450                                 if (q2flags & Q2SURF_WARP)
4451                                 {
4452                                         // we use a scroll instead of a warp
4453                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_FULLBRIGHT;
4454                                         // if it's also transparent, we can enable the WATERSHADER
4455                                         // but we do not set the WATERALPHA flag because we don't
4456                                         // want to honor r_wateralpha in q2bsp
4457                                         // (it would go against the artistic intent)
4458                                         if (q2flags & (Q2SURF_TRANS33 | Q2SURF_TRANS66))
4459                                                 tx->basematerialflags |= MATERIALFLAG_WATERSHADER;
4460                                 }
4461                                 if (q2flags & Q2SURF_TRANS33)
4462                                 {
4463                                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED;
4464                                         tx->basealpha = 1.0f / 3.0f;
4465                                         tx->supercontents &= ~SUPERCONTENTS_OPAQUE;
4466                                         if (tx->q2contents & Q2CONTENTS_SOLID)
4467                                                 tx->q2contents = (tx->q2contents & ~Q2CONTENTS_SOLID) | Q2CONTENTS_WINDOW;
4468                                 }
4469                                 if (q2flags & Q2SURF_TRANS66)
4470                                 {
4471                                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED;
4472                                         tx->basealpha = 2.0f / 3.0f;
4473                                         tx->supercontents &= ~SUPERCONTENTS_OPAQUE;
4474                                         if (tx->q2contents & Q2CONTENTS_SOLID)
4475                                                 tx->q2contents = (tx->q2contents & ~Q2CONTENTS_SOLID) | Q2CONTENTS_WINDOW;
4476                                 }
4477                                 if ((q2flags & Q2SURF_FLOWING) && tx->materialshaderpass != NULL)
4478                                 {
4479                                         tx->materialshaderpass->tcmods[0].tcmod = Q3TCMOD_SCROLL;
4480                                         if (q2flags & Q2SURF_WARP)
4481                                                 tx->materialshaderpass->tcmods[0].parms[0] = -0.5f;
4482                                         else
4483                                                 tx->materialshaderpass->tcmods[0].parms[0] = -1.6f;
4484                                         tx->materialshaderpass->tcmods[0].parms[1] = 0.0f;
4485                                 }
4486                                 if (q2flags & Q2SURF_ALPHATEST)
4487                                 {
4488                                         // KMQUAKE2 and other modded engines added this flag for lit alpha tested surfaces
4489                                         tx->basematerialflags |= MATERIALFLAG_ALPHATEST | MATERIALFLAG_NOSHADOW;
4490                                 }
4491                                 else if (q2flags & (Q2SURF_TRANS33 | Q2SURF_TRANS66 | Q2SURF_WARP))
4492                                 {
4493                                         if (!mod_q2bsp_littransparentsurfaces.integer)
4494                                                 tx->basematerialflags |= MATERIALFLAG_FULLBRIGHT;
4495                                 }
4496                                 if (q2flags & Q2SURF_NODRAW)
4497                                 {
4498                                         tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
4499                                 }
4500                                 if (tx->q2contents & (Q2CONTENTS_TRANSLUCENT | Q2CONTENTS_MONSTERCLIP | Q2CONTENTS_PLAYERCLIP))
4501                                         tx->q2contents |= Q2CONTENTS_DETAIL;
4502                                 if (!(tx->q2contents & (Q2CONTENTS_SOLID | Q2CONTENTS_WINDOW | Q2CONTENTS_AUX | Q2CONTENTS_LAVA | Q2CONTENTS_SLIME | Q2CONTENTS_WATER | Q2CONTENTS_MIST | Q2CONTENTS_PLAYERCLIP | Q2CONTENTS_MONSTERCLIP | Q2CONTENTS_MIST)))
4503                                         tx->q2contents |= Q2CONTENTS_SOLID;
4504                                 if (tx->q2flags & (Q2SURF_HINT | Q2SURF_SKIP))
4505                                         tx->q2contents = 0;
4506                                 tx->supercontents = Mod_Q2BSP_SuperContentsFromNativeContents(tx->q2contents);
4507                                 // set the current values to the base values
4508                                 tx->currentframe = tx;
4509                                 tx->currentskinframe = tx->materialshaderpass != NULL ? tx->materialshaderpass->skinframes[0] : NULL;
4510                                 tx->currentmaterialflags = tx->basematerialflags;
4511                                 loadmodel->num_texturesperskin++;
4512                                 loadmodel->num_textures = loadmodel->num_texturesperskin;
4513                         }
4514                         else
4515                         {
4516                                 Con_Printf("Mod_Q2BSP_LoadTexinfo: max textures reached (%i)\n", maxtextures);
4517                                 j = 0; // use first texture and give up
4518                         }
4519                 }
4520                 // store the index we found for this texture
4521                 out->textureindex = j;
4522         }
4523
4524         // realloc the textures array now that we know how many we actually need
4525         loadmodel->data_textures = (texture_t*)Mem_Realloc(loadmodel->mempool, loadmodel->data_textures, loadmodel->num_texturesperskin * sizeof(texture_t));
4526
4527         // now assemble the texture chains
4528         // if we encounter the textures out of order, the later ones won't mark the earlier ones in a sequence, so the earlier
4529         for (i = 0, out = loadmodel->brushq1.texinfo;i < count;i++, out++)
4530         {
4531                 int j, k;
4532                 texture_t *t = loadmodel->data_textures + out->textureindex;
4533                 t->currentframe = t; // fix the reallocated pointer
4534
4535                 // if this is not animated, skip it
4536                 // if this is already processed, skip it (part of an existing sequence)
4537                 if (out->q2nexttexinfo == 0 || t->animated)
4538                         continue;
4539
4540                 // store the array of frames to use
4541                 t->animated = 2; // q2bsp animation
4542                 t->anim_total[0] = 0;
4543                 t->anim_total[1] = 0;
4544                 // gather up to 10 frames (we don't support more)
4545                 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)
4546                 {
4547                         // detect looping and stop there
4548                         if (t->anim_total[0] && loadmodel->brushq1.texinfo[j].textureindex == out->textureindex)
4549                                 break;
4550                         t->anim_frames[0][t->anim_total[0]++] = &loadmodel->data_textures[loadmodel->brushq1.texinfo[j].textureindex];
4551                 }
4552                 // we could look for the +a sequence here if this is the +0 sequence,
4553                 // but it seems that quake2 did not implement that (even though the
4554                 // files exist in the baseq2 content)
4555
4556                 // write the frame sequence to all the textures involved (just like
4557                 // in the q1bsp loader)
4558                 //
4559                 // note that this can overwrite the rest of the sequence - so if the
4560                 // start of a sequence is found later than the other parts of the
4561                 // sequence, it will go back and rewrite them correctly.
4562                 for (k = 0;k < t->anim_total[0];k++)
4563                 {
4564                         texture_t *txk = t->anim_frames[0][k];
4565                         txk->animated = t->animated;
4566                         txk->anim_total[0] = t->anim_total[0];
4567                         for (l = 0;l < t->anim_total[0];l++)
4568                                 txk->anim_frames[0][l] = t->anim_frames[0][l];
4569                 }
4570         }
4571 }
4572
4573 static void Mod_Q2BSP_LoadLighting(sizebuf_t *sb)
4574 {
4575         // LadyHavoc: this fits exactly the same format that we use in .lit files
4576         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, sb->cursize);
4577         MSG_ReadBytes(sb, sb->cursize, loadmodel->brushq1.lightdata);
4578 }
4579
4580 static void Mod_Q2BSP_LoadLeafs(sizebuf_t *sb)
4581 {
4582         mleaf_t *out;
4583         int i, j, count, firstmarksurface, nummarksurfaces, firstmarkbrush, nummarkbrushes;
4584         int structsize = 28;
4585
4586         if (sb->cursize % structsize)
4587                 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4588         count = sb->cursize / structsize;
4589         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
4590
4591         loadmodel->brush.data_leafs = out;
4592         loadmodel->brush.num_leafs = count;
4593
4594         // FIXME: this function could really benefit from some error checking
4595         for ( i=0 ; i<count ; i++, out++)
4596         {
4597                 out->contents = MSG_ReadLittleLong(sb);
4598                 out->clusterindex = MSG_ReadLittleShort(sb);
4599                 out->areaindex = MSG_ReadLittleShort(sb);
4600                 out->mins[0] = MSG_ReadLittleShort(sb);
4601                 out->mins[1] = MSG_ReadLittleShort(sb);
4602                 out->mins[2] = MSG_ReadLittleShort(sb);
4603                 out->maxs[0] = MSG_ReadLittleShort(sb);
4604                 out->maxs[1] = MSG_ReadLittleShort(sb);
4605                 out->maxs[2] = MSG_ReadLittleShort(sb);
4606
4607                 firstmarksurface = (unsigned short)MSG_ReadLittleShort(sb);
4608                 nummarksurfaces  = (unsigned short)MSG_ReadLittleShort(sb);
4609                 firstmarkbrush = (unsigned short)MSG_ReadLittleShort(sb);
4610                 nummarkbrushes  = (unsigned short)MSG_ReadLittleShort(sb);
4611
4612                 for (j = 0;j < 4;j++)
4613                         out->ambient_sound_level[j] = 0;
4614
4615                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
4616                 {
4617                         Con_Print("Mod_Q2BSP_LoadLeafs: invalid clusterindex\n");
4618                         out->clusterindex = -1;
4619                 }
4620
4621                 if (firstmarksurface >= 0 && firstmarksurface + nummarksurfaces <= loadmodel->brush.num_leafsurfaces)
4622                 {
4623                         out->firstleafsurface = loadmodel->brush.data_leafsurfaces + firstmarksurface;
4624                         out->numleafsurfaces = nummarksurfaces;
4625                 }
4626                 else
4627                 {
4628                         Con_Printf("Mod_Q2BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", firstmarksurface, firstmarksurface+nummarksurfaces, 0, loadmodel->brush.num_leafsurfaces);
4629                         out->firstleafsurface = NULL;
4630                         out->numleafsurfaces = 0;
4631                 }
4632
4633                 if (firstmarkbrush >= 0 && firstmarkbrush + nummarkbrushes <= loadmodel->brush.num_leafbrushes)
4634                 {
4635                         out->firstleafbrush = loadmodel->brush.data_leafbrushes + firstmarkbrush;
4636                         out->numleafbrushes = nummarkbrushes;
4637                 }
4638                 else
4639                 {
4640                         Con_Printf("Mod_Q2BSP_LoadLeafs: invalid leafbrush range %i:%i outside range %i:%i\n", firstmarkbrush, firstmarkbrush+nummarkbrushes, 0, loadmodel->brush.num_leafbrushes);
4641                         out->firstleafbrush = NULL;
4642                         out->numleafbrushes = 0;
4643                 }
4644         }
4645 }
4646
4647 static void Mod_Q2BSP_LoadLeafBrushes(sizebuf_t *sb)
4648 {
4649         int i, j;
4650         int structsize = 2;
4651
4652         if (sb->cursize % structsize)
4653                 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4654         loadmodel->brush.num_leafbrushes = sb->cursize / structsize;
4655         loadmodel->brush.data_leafbrushes = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafbrushes * sizeof(int));
4656
4657         for (i = 0;i < loadmodel->brush.num_leafbrushes;i++)
4658         {
4659                 j = (unsigned short) MSG_ReadLittleShort(sb);
4660                 if (j >= loadmodel->brush.num_brushes)
4661                         Host_Error("Mod_Q1BSP_LoadLeafBrushes: bad brush number");
4662                 loadmodel->brush.data_leafbrushes[i] = j;
4663         }
4664 }
4665
4666 static void Mod_Q2BSP_LoadBrushSides(sizebuf_t *sb)
4667 {
4668         q3mbrushside_t *out;
4669         int i, n, count;
4670         int structsize = 4;
4671
4672         if (sb->cursize % structsize)
4673                 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4674         count = sb->cursize / structsize;
4675         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4676
4677         loadmodel->brush.data_brushsides = out;
4678         loadmodel->brush.num_brushsides = count;
4679
4680         for (i = 0;i < count;i++, out++)
4681         {
4682                 n = (unsigned short)MSG_ReadLittleShort(sb);
4683                 if (n < 0 || n >= loadmodel->brush.num_planes)
4684                         Host_Error("Mod_Q2BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4685                 out->plane = loadmodel->brush.data_planes + n;
4686                 n = MSG_ReadLittleShort(sb);
4687                 if (n >= 0)
4688                 {
4689                         if (n >= loadmodel->brushq1.numtexinfo)
4690                                 Host_Error("Mod_Q2BSP_LoadBrushSides: invalid texinfo index %i (%i texinfos)", n, loadmodel->brushq1.numtexinfo);
4691                         out->texture = loadmodel->data_textures + loadmodel->brushq1.texinfo[n].textureindex;
4692                 }
4693                 else
4694                 {
4695                         //Con_Printf("Mod_Q2BSP_LoadBrushSides: brushside %i has texinfo index %i < 0, changing to generic texture!\n", i, n);
4696                         out->texture = &mod_q1bsp_texture_solid;
4697                 }
4698         }
4699 }
4700
4701 static void Mod_Q2BSP_LoadBrushes(sizebuf_t *sb)
4702 {
4703         q3mbrush_t *out;
4704         int i, j, firstside, numsides, contents, count, maxplanes, q3surfaceflags, supercontents;
4705         colplanef_t *planes;
4706         int structsize = 12;
4707         qboolean brushmissingtextures;
4708         int numbrushesmissingtextures = 0;
4709         int numcreatedtextures = 0;
4710
4711         if (sb->cursize % structsize)
4712                 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4713         count = sb->cursize / structsize;
4714         out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4715
4716         loadmodel->brush.data_brushes = out;
4717         loadmodel->brush.num_brushes = count;
4718
4719         maxplanes = 0;
4720         planes = NULL;
4721
4722         for (i = 0; i < count; i++, out++)
4723         {
4724                 firstside = MSG_ReadLittleLong(sb);
4725                 numsides = MSG_ReadLittleLong(sb);
4726                 contents = MSG_ReadLittleLong(sb);
4727                 if (firstside < 0 || firstside + numsides > loadmodel->brush.num_brushsides)
4728                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", firstside, firstside + numsides, loadmodel->brush.num_brushsides);
4729
4730                 out->firstbrushside = loadmodel->brush.data_brushsides + firstside;
4731                 out->numbrushsides = numsides;
4732                 // convert the contents to our values
4733                 supercontents = Mod_Q2BSP_SuperContentsFromNativeContents(contents);
4734
4735                 // problem: q2bsp brushes have contents but not a texture
4736                 // problem: q2bsp brushsides *may* have a texture or may not
4737                 // problem: all brushsides and brushes must have a texture for trace_hittexture functionality to work, and the collision code is engineered around this assumption
4738                 // solution: nasty hacks
4739                 brushmissingtextures = false;
4740                 out->texture = NULL;
4741                 for (j = 0; j < out->numbrushsides; j++)
4742                 {
4743                         if (out->firstbrushside[j].texture == &mod_q1bsp_texture_solid)
4744                                 brushmissingtextures = true;
4745                         else
4746                         {
4747                                 // if we can find a matching texture on a brush side we can use it instead of creating one
4748                                 if (out->firstbrushside[j].texture->supercontents == supercontents)
4749                                         out->texture = out->firstbrushside[j].texture;
4750                         }
4751                 }
4752                 if (brushmissingtextures || out->texture == NULL)
4753                 {
4754                         numbrushesmissingtextures++;
4755                         // if we didn't find any appropriate texture (matching contents), we'll have to create one
4756                         // we could search earlier ones for a matching one but that can be slow
4757                         if (out->texture == NULL)
4758                         {
4759                                 texture_t *validtexture;
4760                                 validtexture = (texture_t *)Mem_Alloc(loadmodel->mempool, sizeof(texture_t));
4761                                 dpsnprintf(validtexture->name, sizeof(validtexture->name), "brushcollision%i", numcreatedtextures);
4762                                 validtexture->surfaceflags = 0;
4763                                 validtexture->supercontents = supercontents;
4764                                 numcreatedtextures++;
4765                                 out->texture = validtexture;
4766                         }
4767                         // out->texture now contains a texture with appropriate contents, copy onto any missing sides
4768                         for (j = 0; j < out->numbrushsides; j++)
4769                                 if (out->firstbrushside[j].texture == &mod_q1bsp_texture_solid)
4770                                         out->firstbrushside[j].texture = out->texture;
4771                 }
4772
4773                 // make a colbrush from the brush
4774                 q3surfaceflags = 0;
4775                 // make a list of mplane_t structs to construct a colbrush from
4776                 if (maxplanes < out->numbrushsides)
4777                 {
4778                         maxplanes = out->numbrushsides;
4779                         if (planes)
4780                                 Mem_Free(planes);
4781                         planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4782                 }
4783                 for (j = 0;j < out->numbrushsides;j++)
4784                 {
4785                         VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4786                         planes[j].dist = out->firstbrushside[j].plane->dist;
4787                         planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4788                         planes[j].texture = out->firstbrushside[j].texture;
4789                         q3surfaceflags |= planes[j].q3surfaceflags;
4790                 }
4791                 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4792
4793                 // this whole loop can take a while (e.g. on redstarrepublic4)
4794                 CL_KeepaliveMessage(false);
4795         }
4796         if (planes)
4797                 Mem_Free(planes);
4798         if (numcreatedtextures)
4799                 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);
4800 }
4801
4802 static void Mod_Q2BSP_LoadPOP(sizebuf_t *sb)
4803 {
4804         // 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)
4805         sb->readcount = sb->cursize;
4806 }
4807
4808 static void Mod_Q2BSP_LoadAreas(sizebuf_t *sb)
4809 {
4810         // we currently don't use areas, they represent closable doors as vis blockers
4811         sb->readcount = sb->cursize;
4812 }
4813
4814 static void Mod_Q2BSP_LoadAreaPortals(sizebuf_t *sb)
4815 {
4816         // we currently don't use areas, they represent closable doors as vis blockers
4817         sb->readcount = sb->cursize;
4818 }
4819
4820 static void Mod_Q2BSP_FindSubmodelBrushRange_r(dp_model_t *mod, mnode_t *node, int *first, int *last)
4821 {
4822         int i;
4823         mleaf_t *leaf;
4824         while (node->plane)
4825         {
4826                 Mod_Q2BSP_FindSubmodelBrushRange_r(mod, node->children[0], first, last);
4827                 node = node->children[1];
4828         }
4829         leaf = (mleaf_t*)node;
4830         for (i = 0;i < leaf->numleafbrushes;i++)
4831         {
4832                 int brushnum = leaf->firstleafbrush[i];
4833                 if (*first > brushnum)
4834                         *first = brushnum;
4835                 if (*last < brushnum)
4836                         *last = brushnum;
4837         }
4838 }
4839
4840 static void Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4841 {
4842         int i, j, k;
4843         sizebuf_t lumpsb[Q2HEADER_LUMPS];
4844         mmodel_t *bm;
4845         float dist, modelyawradius, modelradius;
4846         msurface_t *surface;
4847         int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
4848         model_brush_lightstyleinfo_t styleinfo[256];
4849         unsigned char *datapointer;
4850         sizebuf_t sb;
4851
4852         MSG_InitReadBuffer(&sb, (unsigned char *)buffer, (unsigned char *)bufferend - (unsigned char *)buffer);
4853
4854         mod->type = mod_brushq2;
4855
4856         mod->brush.ishlbsp = false;
4857         mod->brush.isbsp2rmqe = false;
4858         mod->brush.isbsp2 = false;
4859         mod->brush.isq2bsp = true; // q1bsp loaders mostly work but we need a few tweaks
4860         mod->brush.isq3bsp = false;
4861         mod->brush.skymasking = true;
4862         mod->modeldatatypestring = "Q2BSP";
4863
4864         i = MSG_ReadLittleLong(&sb);
4865         if (i != Q2BSPMAGIC)
4866                 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4867
4868         i = MSG_ReadLittleLong(&sb);
4869         if (i != Q2BSPVERSION)
4870                 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4871
4872 // read lumps
4873         for (i = 0; i < Q2HEADER_LUMPS; i++)
4874         {
4875                 int offset = MSG_ReadLittleLong(&sb);
4876                 int size = MSG_ReadLittleLong(&sb);
4877                 if (offset < 0 || offset + size > sb.cursize)
4878                         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);
4879                 MSG_InitReadBuffer(&lumpsb[i], sb.data + offset, size);
4880         }
4881
4882         mod->soundfromcenter = true;
4883         mod->TracePoint = Mod_CollisionBIH_TracePoint;
4884         mod->TraceLine = Mod_CollisionBIH_TraceLine;
4885         mod->TraceBox = Mod_CollisionBIH_TraceBox;
4886         mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
4887         mod->PointSuperContents = Mod_CollisionBIH_PointSuperContents;
4888         mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
4889         mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
4890         mod->brush.SuperContentsFromNativeContents = Mod_Q2BSP_SuperContentsFromNativeContents;
4891         mod->brush.NativeContentsFromSuperContents = Mod_Q2BSP_NativeContentsFromSuperContents;
4892         mod->brush.GetPVS = Mod_BSP_GetPVS;
4893         mod->brush.FatPVS = Mod_BSP_FatPVS;
4894         mod->brush.BoxTouchingPVS = Mod_BSP_BoxTouchingPVS;
4895         mod->brush.BoxTouchingLeafPVS = Mod_BSP_BoxTouchingLeafPVS;
4896         mod->brush.BoxTouchingVisibleLeafs = Mod_BSP_BoxTouchingVisibleLeafs;
4897         mod->brush.FindBoxClusters = Mod_BSP_FindBoxClusters;
4898         mod->brush.LightPoint = Mod_BSP_LightPoint;
4899         mod->brush.FindNonSolidLocation = Mod_BSP_FindNonSolidLocation;
4900         mod->brush.AmbientSoundLevelsForPoint = NULL;
4901         mod->brush.RoundUpToHullSize = NULL;
4902         mod->brush.PointInLeaf = Mod_BSP_PointInLeaf;
4903         mod->Draw = R_Mod_Draw;
4904         mod->DrawDepth = R_Mod_DrawDepth;
4905         mod->DrawDebug = R_Mod_DrawDebug;
4906         mod->DrawPrepass = R_Mod_DrawPrepass;
4907         mod->GetLightInfo = R_Mod_GetLightInfo;
4908         mod->CompileShadowMap = R_Mod_CompileShadowMap;
4909         mod->DrawShadowMap = R_Mod_DrawShadowMap;
4910         mod->DrawLight = R_Mod_DrawLight;
4911
4912 // load into heap
4913
4914         mod->brush.qw_md4sum = 0;
4915         mod->brush.qw_md4sum2 = 0;
4916         for (i = 0;i < Q2HEADER_LUMPS;i++)
4917         {
4918                 int temp;
4919                 if (i == Q2LUMP_ENTITIES)
4920                         continue;
4921                 temp = Com_BlockChecksum(lumpsb[i].data, lumpsb[i].cursize);
4922                 mod->brush.qw_md4sum ^= LittleLong(temp);
4923                 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4924                         continue;
4925                 mod->brush.qw_md4sum2 ^= LittleLong(temp);
4926         }
4927
4928         // many of these functions are identical to Q1 loaders, so we use those where possible
4929         Mod_Q1BSP_LoadEntities(&lumpsb[Q2LUMP_ENTITIES]);
4930         Mod_Q1BSP_LoadVertexes(&lumpsb[Q2LUMP_VERTEXES]);
4931         Mod_Q1BSP_LoadEdges(&lumpsb[Q2LUMP_EDGES]);
4932         Mod_Q1BSP_LoadSurfedges(&lumpsb[Q2LUMP_SURFEDGES]);
4933         Mod_Q2BSP_LoadLighting(&lumpsb[Q2LUMP_LIGHTING]);
4934         Mod_Q1BSP_LoadPlanes(&lumpsb[Q2LUMP_PLANES]);
4935         Mod_Q2BSP_LoadTexinfo(&lumpsb[Q2LUMP_TEXINFO]);
4936         Mod_Q2BSP_LoadBrushSides(&lumpsb[Q2LUMP_BRUSHSIDES]);
4937         Mod_Q2BSP_LoadBrushes(&lumpsb[Q2LUMP_BRUSHES]);
4938         Mod_Q1BSP_LoadFaces(&lumpsb[Q2LUMP_FACES]);
4939         Mod_Q1BSP_LoadLeaffaces(&lumpsb[Q2LUMP_LEAFFACES]);
4940         Mod_Q2BSP_LoadLeafBrushes(&lumpsb[Q2LUMP_LEAFBRUSHES]);
4941         Mod_Q2BSP_LoadVisibility(&lumpsb[Q2LUMP_VISIBILITY]);
4942         Mod_Q2BSP_LoadPOP(&lumpsb[Q2LUMP_POP]);
4943         Mod_Q2BSP_LoadAreas(&lumpsb[Q2LUMP_AREAS]);
4944         Mod_Q2BSP_LoadAreaPortals(&lumpsb[Q2LUMP_AREAPORTALS]);
4945         Mod_Q2BSP_LoadLeafs(&lumpsb[Q2LUMP_LEAFS]);
4946         Mod_Q2BSP_LoadNodes(&lumpsb[Q2LUMP_NODES]);
4947         Mod_BSP_LoadSubmodels(&lumpsb[Q2LUMP_MODELS], NULL);
4948
4949         for (i = 0; i < Q2HEADER_LUMPS; i++)
4950                 if (lumpsb[i].readcount != lumpsb[i].cursize)
4951                         Host_Error("Lump %i incorrectly loaded (readcount %i, size %i)\n", i, lumpsb[i].readcount, lumpsb[i].cursize);
4952
4953         // we don't actually set MATERIALFLAG_WATERALPHA on anything, so this
4954         // doesn't enable the cvar, just indicates that transparent water is OK
4955         loadmodel->brush.supportwateralpha = true;
4956
4957         // we don't need the compressed pvs data anymore
4958         if (mod->brushq1.data_compressedpvs)
4959                 Mem_Free(mod->brushq1.data_compressedpvs);
4960         mod->brushq1.data_compressedpvs = NULL;
4961         mod->brushq1.num_compressedpvs = 0;
4962
4963         // the MakePortals code works fine on the q2bsp data as well
4964         if (mod_bsp_portalize.integer)
4965                 Mod_BSP_MakePortals();
4966
4967         mod->numframes = 0;             // q2bsp animations are kind of special, frame is unbounded...
4968         mod->numskins = 1;
4969
4970         if (loadmodel->brush.numsubmodels)
4971                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
4972
4973         totalstylesurfaces = 0;
4974         totalstyles = 0;
4975         for (i = 0;i < mod->brush.numsubmodels;i++)
4976         {
4977                 memset(stylecounts, 0, sizeof(stylecounts));
4978                 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
4979                 {
4980                         surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
4981                         for (j = 0;j < MAXLIGHTMAPS;j++)
4982                                 stylecounts[surface->lightmapinfo->styles[j]]++;
4983                 }
4984                 for (k = 0;k < 255;k++)
4985                 {
4986                         totalstyles++;
4987                         if (stylecounts[k])
4988                                 totalstylesurfaces += stylecounts[k];
4989                 }
4990         }
4991         datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
4992         // set up the world model, then on each submodel copy from the world model
4993         // and set up the submodel with the respective model info.
4994         mod = loadmodel;
4995         for (i = 0;i < loadmodel->brush.numsubmodels;i++)
4996         {
4997                 mnode_t *rootnode = NULL;
4998                 int firstbrush = loadmodel->brush.num_brushes, lastbrush = 0;
4999                 if (i > 0)
5000                 {
5001                         char name[10];
5002                         // duplicate the basic information
5003                         dpsnprintf(name, sizeof(name), "*%i", i);
5004                         mod = Mod_FindName(name, loadmodel->name);
5005                         // copy the base model to this one
5006                         *mod = *loadmodel;
5007                         // rename the clone back to its proper name
5008                         strlcpy(mod->name, name, sizeof(mod->name));
5009                         mod->brush.parentmodel = loadmodel;
5010                         // textures and memory belong to the main model
5011                         mod->texturepool = NULL;
5012                         mod->mempool = NULL;
5013                         mod->brush.GetPVS = NULL;
5014                         mod->brush.FatPVS = NULL;
5015                         mod->brush.BoxTouchingPVS = NULL;
5016                         mod->brush.BoxTouchingLeafPVS = NULL;
5017                         mod->brush.BoxTouchingVisibleLeafs = NULL;
5018                         mod->brush.FindBoxClusters = NULL;
5019                         mod->brush.LightPoint = NULL;
5020                         mod->brush.AmbientSoundLevelsForPoint = NULL;
5021                 }
5022                 mod->brush.submodel = i;
5023                 if (loadmodel->brush.submodels)
5024                         loadmodel->brush.submodels[i] = mod;
5025
5026                 bm = &mod->brushq1.submodels[i];
5027
5028                 // we store the headnode (there's only one in Q2BSP) as if it were the first hull
5029                 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
5030
5031                 mod->firstmodelsurface = bm->firstface;
5032                 mod->nummodelsurfaces = bm->numfaces;
5033
5034                 // set node/leaf parents for this submodel
5035                 // note: if the root of this submodel is a leaf (headnode[0] < 0) then there is nothing to do...
5036                 // (this happens in base3.bsp)
5037                 if (bm->headnode[0] >= 0)
5038                         rootnode = mod->brush.data_nodes + bm->headnode[0];
5039                 else
5040                         rootnode = (mnode_t*)(mod->brush.data_leafs + -1 - bm->headnode[0]);
5041                 Mod_BSP_LoadNodes_RecursiveSetParent(rootnode, NULL);
5042
5043                 // make the model surface list (used by shadowing/lighting)
5044                 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
5045                 Mod_Q2BSP_FindSubmodelBrushRange_r(mod, rootnode, &firstbrush, &lastbrush);
5046                 if (firstbrush <= lastbrush)
5047                 {
5048                         mod->firstmodelbrush = firstbrush;
5049                         mod->nummodelbrushes = lastbrush + 1 - firstbrush;
5050                 }
5051                 else
5052                 {
5053                         mod->firstmodelbrush = 0;
5054                         mod->nummodelbrushes = 0;
5055                 }
5056                 Mod_MakeSortedSurfaces(mod);
5057
5058                 VectorCopy(bm->mins, mod->normalmins);
5059                 VectorCopy(bm->maxs, mod->normalmaxs);
5060                 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5061                 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5062                 modelyawradius = dist*dist+modelyawradius*modelyawradius;
5063                 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5064                 modelradius = modelyawradius + modelradius * modelradius;
5065                 modelyawradius = sqrt(modelyawradius);
5066                 modelradius = sqrt(modelradius);
5067                 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
5068                 mod->yawmins[2] = mod->normalmins[2];
5069                 mod->yawmaxs[0] = mod->yawmaxs[1] =  modelyawradius;
5070                 mod->yawmaxs[2] = mod->normalmaxs[2];
5071                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5072                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] =  modelradius;
5073                 mod->radius = modelradius;
5074                 mod->radius2 = modelradius * modelradius;
5075
5076                 // this gets altered below if sky or water is used
5077                 mod->DrawSky = NULL;
5078                 mod->DrawAddWaterPlanes = NULL;
5079
5080                 // scan surfaces for sky and water and flag the submodel as possessing these features or not
5081                 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
5082                 if (mod->nummodelsurfaces)
5083                 {
5084                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
5085                                 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
5086                                         break;
5087                         if (j < mod->nummodelsurfaces)
5088                                 mod->DrawSky = R_Mod_DrawSky;
5089
5090                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
5091                                 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
5092                                         break;
5093                         if (j < mod->nummodelsurfaces)
5094                                 mod->DrawAddWaterPlanes = R_Mod_DrawAddWaterPlanes;
5095
5096                         // build lightstyle update chains
5097                         // (used to rapidly mark lightmapupdateflags on many surfaces
5098                         // when d_lightstylevalue changes)
5099                         memset(stylecounts, 0, sizeof(stylecounts));
5100                         for (k = 0;k < mod->nummodelsurfaces;k++)
5101                         {
5102                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
5103                                 for (j = 0;j < MAXLIGHTMAPS;j++)
5104                                         stylecounts[surface->lightmapinfo->styles[j]]++;
5105                         }
5106                         mod->brushq1.num_lightstyles = 0;
5107                         for (k = 0;k < 255;k++)
5108                         {
5109                                 if (stylecounts[k])
5110                                 {
5111                                         styleinfo[mod->brushq1.num_lightstyles].style = k;
5112                                         styleinfo[mod->brushq1.num_lightstyles].value = 0;
5113                                         styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
5114                                         styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
5115                                         remapstyles[k] = mod->brushq1.num_lightstyles;
5116                                         mod->brushq1.num_lightstyles++;
5117                                 }
5118                         }
5119                         for (k = 0;k < mod->nummodelsurfaces;k++)
5120                         {
5121                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
5122                                 for (j = 0;j < MAXLIGHTMAPS;j++)
5123                                 {
5124                                         if (surface->lightmapinfo->styles[j] != 255)
5125                                         {
5126                                                 int r = remapstyles[surface->lightmapinfo->styles[j]];
5127                                                 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
5128                                         }
5129                                 }
5130                         }
5131                         mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
5132                         memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
5133                 }
5134                 else
5135                 {
5136                         Con_Printf(CON_WARN "warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
5137                 }
5138                 //mod->brushq1.num_visleafs = bm->visleafs;
5139
5140                 // build a Bounding Interval Hierarchy for culling triangles in light rendering
5141                 Mod_MakeCollisionBIH(mod, false, &mod->collision_bih);
5142
5143                 // build a Bounding Interval Hierarchy for culling brushes in collision detection
5144                 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
5145
5146                 // generate VBOs and other shared data before cloning submodels
5147                 if (i == 0)
5148                         Mod_BuildVBOs();
5149         }
5150         mod = loadmodel;
5151
5152         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);
5153 }
5154
5155 static int Mod_Q3BSP_SuperContentsFromNativeContents(int nativecontents);
5156 static int Mod_Q3BSP_NativeContentsFromSuperContents(int supercontents);
5157
5158 static void Mod_Q3BSP_LoadEntities(lump_t *l)
5159 {
5160         const char *data;
5161         char key[128], value[MAX_INPUTLINE];
5162         float v[3];
5163         loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
5164         loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
5165         loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
5166         if (!l->filelen)
5167                 return;
5168         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
5169         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
5170         loadmodel->brush.entities[l->filelen] = 0;
5171         data = loadmodel->brush.entities;
5172         // some Q3 maps override the lightgrid_cellsize with a worldspawn key
5173         // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
5174         loadmodel->brushq3.deluxemapping = false;
5175         if (data && COM_ParseToken_Simple(&data, false, false, true) && com_token[0] == '{')
5176         {
5177                 while (1)
5178                 {
5179                         if (!COM_ParseToken_Simple(&data, false, false, true))
5180                                 break; // error
5181                         if (com_token[0] == '}')
5182                                 break; // end of worldspawn
5183                         if (com_token[0] == '_')
5184                                 strlcpy(key, com_token + 1, sizeof(key));
5185                         else
5186                                 strlcpy(key, com_token, sizeof(key));
5187                         while (key[strlen(key)-1] == ' ') // remove trailing spaces
5188                                 key[strlen(key)-1] = 0;
5189                         if (!COM_ParseToken_Simple(&data, false, false, true))
5190                                 break; // error
5191                         strlcpy(value, com_token, sizeof(value));
5192                         if (!strcasecmp("gridsize", key)) // this one is case insensitive to 100% match q3map2
5193                         {
5194 #if _MSC_VER >= 1400
5195 #define sscanf sscanf_s
5196 #endif
5197 #if 0
5198                                 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
5199                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
5200 #else
5201                                 VectorSet(v, 64, 64, 128);
5202                                 if(sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) != 3)
5203                                         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]);
5204                                 if (v[0] != 0 && v[1] != 0 && v[2] != 0)
5205                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
5206 #endif
5207                         }
5208                         else if (!strcmp("deluxeMaps", key))
5209                         {
5210                                 if (!strcmp(com_token, "1"))
5211                                 {
5212                                         loadmodel->brushq3.deluxemapping = true;
5213                                         loadmodel->brushq3.deluxemapping_modelspace = true;
5214                                 }
5215                                 else if (!strcmp(com_token, "2"))
5216                                 {
5217                                         loadmodel->brushq3.deluxemapping = true;
5218                                         loadmodel->brushq3.deluxemapping_modelspace = false;
5219                                 }
5220                         }
5221                 }
5222         }
5223 }
5224
5225 static void Mod_Q3BSP_LoadTextures(lump_t *l)
5226 {
5227         q3dtexture_t *in;
5228         texture_t *out;
5229         int i, count;
5230
5231         in = (q3dtexture_t *)(mod_base + l->fileofs);
5232         if (l->filelen % sizeof(*in))
5233                 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
5234         count = l->filelen / sizeof(*in);
5235         out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5236
5237         loadmodel->data_textures = out;
5238         loadmodel->num_textures = count;
5239         loadmodel->num_texturesperskin = loadmodel->num_textures;
5240
5241         for (i = 0;i < count;i++)
5242         {
5243                 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
5244                 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(LittleLong(in[i].contents));
5245                 Mod_LoadTextureFromQ3Shader(loadmodel->mempool, loadmodel->name, out + i, in[i].name, true, true, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, MATERIALFLAG_WALL);
5246                 // restore the surfaceflags and supercontents
5247                 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
5248                 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(LittleLong(in[i].contents));
5249         }
5250 }
5251
5252 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
5253 {
5254         q3dplane_t *in;
5255         mplane_t *out;
5256         int i, count;
5257
5258         in = (q3dplane_t *)(mod_base + l->fileofs);
5259         if (l->filelen % sizeof(*in))
5260                 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
5261         count = l->filelen / sizeof(*in);
5262         out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5263
5264         loadmodel->brush.data_planes = out;
5265         loadmodel->brush.num_planes = count;
5266
5267         for (i = 0;i < count;i++, in++, out++)
5268         {
5269                 out->normal[0] = LittleFloat(in->normal[0]);
5270                 out->normal[1] = LittleFloat(in->normal[1]);
5271                 out->normal[2] = LittleFloat(in->normal[2]);
5272                 out->dist = LittleFloat(in->dist);
5273                 PlaneClassify(out);
5274         }
5275 }
5276
5277 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
5278 {
5279         q3dbrushside_t *in;
5280         q3mbrushside_t *out;
5281         int i, n, count;
5282
5283         in = (q3dbrushside_t *)(mod_base + l->fileofs);
5284         if (l->filelen % sizeof(*in))
5285                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
5286         count = l->filelen / sizeof(*in);
5287         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5288
5289         loadmodel->brush.data_brushsides = out;
5290         loadmodel->brush.num_brushsides = count;
5291
5292         for (i = 0;i < count;i++, in++, out++)
5293         {
5294                 n = LittleLong(in->planeindex);
5295                 if (n < 0 || n >= loadmodel->brush.num_planes)
5296                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5297                 out->plane = loadmodel->brush.data_planes + n;
5298                 n = LittleLong(in->textureindex);
5299                 if (n < 0 || n >= loadmodel->num_textures)
5300                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
5301                 out->texture = loadmodel->data_textures + n;
5302         }
5303 }
5304
5305 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
5306 {
5307         q3dbrushside_ig_t *in;
5308         q3mbrushside_t *out;
5309         int i, n, count;
5310
5311         in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
5312         if (l->filelen % sizeof(*in))
5313                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
5314         count = l->filelen / sizeof(*in);
5315         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5316
5317         loadmodel->brush.data_brushsides = out;
5318         loadmodel->brush.num_brushsides = count;
5319
5320         for (i = 0;i < count;i++, in++, out++)
5321         {
5322                 n = LittleLong(in->planeindex);
5323                 if (n < 0 || n >= loadmodel->brush.num_planes)
5324                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5325                 out->plane = loadmodel->brush.data_planes + n;
5326                 n = LittleLong(in->textureindex);
5327                 if (n < 0 || n >= loadmodel->num_textures)
5328                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
5329                 out->texture = loadmodel->data_textures + n;
5330         }
5331 }
5332
5333 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
5334 {
5335         q3dbrush_t *in;
5336         q3mbrush_t *out;
5337         int i, j, n, c, count, maxplanes, q3surfaceflags;
5338         colplanef_t *planes;
5339
5340         in = (q3dbrush_t *)(mod_base + l->fileofs);
5341         if (l->filelen % sizeof(*in))
5342                 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
5343         count = l->filelen / sizeof(*in);
5344         out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5345
5346         loadmodel->brush.data_brushes = out;
5347         loadmodel->brush.num_brushes = count;
5348
5349         maxplanes = 0;
5350         planes = NULL;
5351
5352         for (i = 0;i < count;i++, in++, out++)
5353         {
5354                 n = LittleLong(in->firstbrushside);
5355                 c = LittleLong(in->numbrushsides);
5356                 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
5357                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
5358                 out->firstbrushside = loadmodel->brush.data_brushsides + n;
5359                 out->numbrushsides = c;
5360                 n = LittleLong(in->textureindex);
5361                 if (n < 0 || n >= loadmodel->num_textures)
5362                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
5363                 out->texture = loadmodel->data_textures + n;
5364
5365                 // make a list of mplane_t structs to construct a colbrush from
5366                 if (maxplanes < out->numbrushsides)
5367                 {
5368                         maxplanes = out->numbrushsides;
5369                         if (planes)
5370                                 Mem_Free(planes);
5371                         planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
5372                 }
5373                 q3surfaceflags = 0;
5374                 for (j = 0;j < out->numbrushsides;j++)
5375                 {
5376                         VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
5377                         planes[j].dist = out->firstbrushside[j].plane->dist;
5378                         planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
5379                         planes[j].texture = out->firstbrushside[j].texture;
5380                         q3surfaceflags |= planes[j].q3surfaceflags;
5381                 }
5382                 // make the colbrush from the planes
5383                 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
5384
5385                 // this whole loop can take a while (e.g. on redstarrepublic4)
5386                 CL_KeepaliveMessage(false);
5387         }
5388         if (planes)
5389                 Mem_Free(planes);
5390 }
5391
5392 static void Mod_Q3BSP_LoadEffects(lump_t *l)
5393 {
5394         q3deffect_t *in;
5395         q3deffect_t *out;
5396         int i, n, count;
5397
5398         in = (q3deffect_t *)(mod_base + l->fileofs);
5399         if (l->filelen % sizeof(*in))
5400                 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
5401         count = l->filelen / sizeof(*in);
5402         out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5403
5404         loadmodel->brushq3.data_effects = out;
5405         loadmodel->brushq3.num_effects = count;
5406
5407         for (i = 0;i < count;i++, in++, out++)
5408         {
5409                 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
5410                 n = LittleLong(in->brushindex);
5411                 if (n >= loadmodel->brush.num_brushes)
5412                 {
5413                         Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
5414                         n = -1;
5415                 }
5416                 out->brushindex = n;
5417                 out->unknown = LittleLong(in->unknown);
5418         }
5419 }
5420
5421 static void Mod_Q3BSP_LoadVertices(lump_t *l)
5422 {
5423         q3dvertex_t *in;
5424         int i, count;
5425
5426         in = (q3dvertex_t *)(mod_base + l->fileofs);
5427         if (l->filelen % sizeof(*in))
5428                 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
5429         loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
5430         loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
5431         loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
5432         loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
5433         loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
5434         loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
5435
5436         for (i = 0;i < count;i++, in++)
5437         {
5438                 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
5439                 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
5440                 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
5441                 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
5442                 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
5443                 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
5444                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
5445                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
5446                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
5447                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
5448                 // svector/tvector are calculated later in face loading
5449                 if(mod_q3bsp_sRGBlightmaps.integer)
5450                 {
5451                         // if lightmaps are sRGB, vertex colors are sRGB too, so we need to linearize them
5452                         // note: when this is in use, lightmap color 128 is no longer neutral, but "sRGB half power" is
5453                         // working like this may be odd, but matches q3map2 -gamma 2.2
5454                         if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5455                         {
5456                                 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
5457                                 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
5458                                 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
5459                                 // we fix the brightness consistently via lightmapscale
5460                         }
5461                         else
5462                         {
5463                                 loadmodel->brushq3.data_color4f[i * 4 + 0] = Image_LinearFloatFromsRGB(in->color4ub[0]);
5464                                 loadmodel->brushq3.data_color4f[i * 4 + 1] = Image_LinearFloatFromsRGB(in->color4ub[1]);
5465                                 loadmodel->brushq3.data_color4f[i * 4 + 2] = Image_LinearFloatFromsRGB(in->color4ub[2]);
5466                         }
5467                 }
5468                 else
5469                 {
5470                         if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5471                         {
5472                                 loadmodel->brushq3.data_color4f[i * 4 + 0] = Image_sRGBFloatFromLinear_Lightmap(in->color4ub[0]);
5473                                 loadmodel->brushq3.data_color4f[i * 4 + 1] = Image_sRGBFloatFromLinear_Lightmap(in->color4ub[1]);
5474                                 loadmodel->brushq3.data_color4f[i * 4 + 2] = Image_sRGBFloatFromLinear_Lightmap(in->color4ub[2]);
5475                         }
5476                         else
5477                         {
5478                                 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
5479                                 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
5480                                 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
5481                         }
5482                 }
5483                 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
5484                 if(in->color4ub[0] != 255 || in->color4ub[1] != 255 || in->color4ub[2] != 255)
5485                         loadmodel->lit = true;
5486         }
5487 }
5488
5489 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
5490 {
5491         int *in;
5492         int *out;
5493         int i, count;
5494
5495         in = (int *)(mod_base + l->fileofs);
5496         if (l->filelen % sizeof(int[3]))
5497                 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
5498         count = l->filelen / sizeof(*in);
5499
5500         if(!loadmodel->brushq3.num_vertices)
5501         {
5502                 if (count)
5503                         Con_Printf("Mod_Q3BSP_LoadTriangles: %s has triangles but no vertexes, broken compiler, ignoring problem\n", loadmodel->name);
5504                 loadmodel->brushq3.num_triangles = 0;
5505                 return;
5506         }
5507
5508         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5509         loadmodel->brushq3.num_triangles = count / 3;
5510         loadmodel->brushq3.data_element3i = out;
5511
5512         for (i = 0;i < count;i++, in++, out++)
5513         {
5514                 *out = LittleLong(*in);
5515                 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
5516                 {
5517                         Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
5518                         *out = 0;
5519                 }
5520         }
5521 }
5522
5523 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
5524 {
5525         q3dlightmap_t *input_pointer;
5526         int i;
5527         int j;
5528         int k;
5529         int count;
5530         int powerx;
5531         int powery;
5532         int powerxy;
5533         int powerdxy;
5534         int endlightmap;
5535         int mergegoal;
5536         int lightmapindex;
5537         int realcount;
5538         int realindex;
5539         int mergedwidth;
5540         int mergedheight;
5541         int mergedcolumns;
5542         int mergedrows;
5543         int mergedrowsxcolumns;
5544         int size;
5545         int bytesperpixel;
5546         int rgbmap[3];
5547         unsigned char *c;
5548         unsigned char *mergedpixels;
5549         unsigned char *mergeddeluxepixels;
5550         unsigned char *mergebuf;
5551         char mapname[MAX_QPATH];
5552         qboolean external;
5553         unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
5554         char vabuf[1024];
5555
5556         // defaults for q3bsp
5557         size = 128;
5558         bytesperpixel = 3;
5559         rgbmap[0] = 2;
5560         rgbmap[1] = 1;
5561         rgbmap[2] = 0;
5562         external = false;
5563         loadmodel->brushq3.lightmapsize = 128;
5564
5565         if (cls.state == ca_dedicated)
5566                 return;
5567
5568         if(mod_q3bsp_nolightmaps.integer)
5569         {
5570                 return;
5571         }
5572         else if(l->filelen)
5573         {
5574                 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
5575                 if (developer_loading.integer)
5576                         Con_Printf("Using internal lightmaps\n");
5577                 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
5578                 if (l->filelen % sizeof(*input_pointer))
5579                         Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
5580                 count = l->filelen / sizeof(*input_pointer);
5581                 for(i = 0; i < count; ++i)
5582                         inpixels[i] = input_pointer[i].rgb;
5583         }
5584         else
5585         {
5586                 // no internal lightmaps
5587                 // try external lightmaps
5588                 if (developer_loading.integer)
5589                         Con_Printf("Using external lightmaps\n");
5590                 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
5591                 inpixels[0] = loadimagepixelsbgra(va(vabuf, sizeof(vabuf), "%s/lm_%04d", mapname, 0), false, false, false, NULL);
5592                 if(!inpixels[0])
5593                         return;
5594
5595                 // using EXTERNAL lightmaps instead
5596                 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
5597                 {
5598                         Mem_Free(inpixels[0]);
5599                         Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
5600                 }
5601
5602                 size = image_width;
5603                 bytesperpixel = 4;
5604                 rgbmap[0] = 0;
5605                 rgbmap[1] = 1;
5606                 rgbmap[2] = 2;
5607                 external = true;
5608
5609                 for(count = 1; ; ++count)
5610                 {
5611                         inpixels[count] = loadimagepixelsbgra(va(vabuf, sizeof(vabuf), "%s/lm_%04d", mapname, count), false, false, false, NULL);
5612                         if(!inpixels[count])
5613                                 break; // we got all of them
5614                         if(image_width != size || image_height != size)
5615                         {
5616                                 Mem_Free(inpixels[count]);
5617                                 inpixels[count] = NULL;
5618                                 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);
5619                                 break;
5620                         }
5621                 }
5622         }
5623
5624         loadmodel->brushq3.lightmapsize = size;
5625         loadmodel->brushq3.num_originallightmaps = count;
5626
5627         // now check the surfaces to see if any of them index an odd numbered
5628         // lightmap, if so this is not a deluxemapped bsp file
5629         //
5630         // also check what lightmaps are actually used, because q3map2 sometimes
5631         // (always?) makes an unused one at the end, which
5632         // q3map2 sometimes (or always?) makes a second blank lightmap for no
5633         // reason when only one lightmap is used, which can throw off the
5634         // deluxemapping detection method, so check 2-lightmap bsp's specifically
5635         // to see if the second lightmap is blank, if so it is not deluxemapped.
5636         // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
5637         // in Mod_Q3BSP_LoadEntities was failed
5638         if (!loadmodel->brushq3.deluxemapping)
5639         {
5640                 loadmodel->brushq3.deluxemapping = !(count & 1);
5641                 loadmodel->brushq3.deluxemapping_modelspace = true;
5642                 endlightmap = 0;
5643                 if (loadmodel->brushq3.deluxemapping)
5644                 {
5645                         int facecount = faceslump->filelen / sizeof(q3dface_t);
5646                         q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
5647                         for (i = 0;i < facecount;i++)
5648                         {
5649                                 j = LittleLong(faces[i].lightmapindex);
5650                                 if (j >= 0)
5651                                 {
5652                                         endlightmap = max(endlightmap, j + 1);
5653                                         if ((j & 1) || j + 1 >= count)
5654                                         {
5655                                                 loadmodel->brushq3.deluxemapping = false;
5656                                                 break;
5657                                         }
5658                                 }
5659                         }
5660                 }
5661
5662                 // q3map2 sometimes (or always?) makes a second blank lightmap for no
5663                 // reason when only one lightmap is used, which can throw off the
5664                 // deluxemapping detection method, so check 2-lightmap bsp's specifically
5665                 // to see if the second lightmap is blank, if so it is not deluxemapped.
5666                 //
5667                 // further research has shown q3map2 sometimes creates a deluxemap and two
5668                 // blank lightmaps, which must be handled properly as well
5669                 if (endlightmap == 1 && count > 1)
5670                 {
5671                         c = inpixels[1];
5672                         for (i = 0;i < size*size;i++)
5673                         {
5674                                 if (c[bytesperpixel*i + rgbmap[0]])
5675                                         break;
5676                                 if (c[bytesperpixel*i + rgbmap[1]])
5677                                         break;
5678                                 if (c[bytesperpixel*i + rgbmap[2]])
5679                                         break;
5680                         }
5681                         if (i == size*size)
5682                         {
5683                                 // all pixels in the unused lightmap were black...
5684                                 loadmodel->brushq3.deluxemapping = false;
5685                         }
5686                 }
5687         }
5688
5689         Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
5690
5691         // figure out what the most reasonable merge power is within limits
5692
5693         // find the appropriate NxN dimensions to merge to, to avoid wasted space
5694         realcount = count >> (int)loadmodel->brushq3.deluxemapping;
5695
5696         // figure out how big the merged texture has to be
5697         mergegoal = 128<<bound(0, mod_q3bsp_lightmapmergepower.integer, 6);
5698         mergegoal = bound(size, mergegoal, (int)vid.maxtexturesize_2d);
5699         while (mergegoal > size && mergegoal * mergegoal / 4 >= size * size * realcount)
5700                 mergegoal /= 2;
5701         mergedwidth = mergegoal;
5702         mergedheight = mergegoal;
5703         // choose non-square size (2x1 aspect) if only half the space is used;
5704         // this really only happens when the entire set fits in one texture, if
5705         // there are multiple textures, we don't worry about shrinking the last
5706         // one to fit, because the driver prefers the same texture size on
5707         // consecutive draw calls...
5708         if (mergedwidth * mergedheight / 2 >= size*size*realcount)
5709                 mergedheight /= 2;
5710
5711         loadmodel->brushq3.num_lightmapmergedwidthpower = 0;
5712         loadmodel->brushq3.num_lightmapmergedheightpower = 0;
5713         while (mergedwidth > size<<loadmodel->brushq3.num_lightmapmergedwidthpower)
5714                 loadmodel->brushq3.num_lightmapmergedwidthpower++;
5715         while (mergedheight > size<<loadmodel->brushq3.num_lightmapmergedheightpower)
5716                 loadmodel->brushq3.num_lightmapmergedheightpower++;
5717         loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower = loadmodel->brushq3.num_lightmapmergedwidthpower + loadmodel->brushq3.num_lightmapmergedheightpower + (loadmodel->brushq3.deluxemapping ? 1 : 0);
5718
5719         powerx = loadmodel->brushq3.num_lightmapmergedwidthpower;
5720         powery = loadmodel->brushq3.num_lightmapmergedheightpower;
5721         powerxy = powerx+powery;
5722         powerdxy = loadmodel->brushq3.deluxemapping + powerxy;
5723
5724         mergedcolumns = 1 << powerx;
5725         mergedrows = 1 << powery;
5726         mergedrowsxcolumns = 1 << powerxy;
5727
5728         loadmodel->brushq3.num_mergedlightmaps = (realcount + (1 << powerxy) - 1) >> powerxy;
5729         loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
5730         if (loadmodel->brushq3.deluxemapping)
5731                 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
5732
5733         mergedpixels = (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4);
5734         mergeddeluxepixels = loadmodel->brushq3.deluxemapping ? (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4) : NULL;
5735         for (i = 0;i < count;i++)
5736         {
5737                 // figure out which merged lightmap texture this fits into
5738                 realindex = i >> (int)loadmodel->brushq3.deluxemapping;
5739                 lightmapindex = i >> powerdxy;
5740
5741                 // choose the destination address
5742                 mergebuf = (loadmodel->brushq3.deluxemapping && (i & 1)) ? mergeddeluxepixels : mergedpixels;
5743                 mergebuf += 4 * (realindex & (mergedcolumns-1))*size + 4 * ((realindex >> powerx) & (mergedrows-1))*mergedwidth*size;
5744                 if ((i & 1) == 0 || !loadmodel->brushq3.deluxemapping)
5745                         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);
5746
5747                 // convert pixels from RGB or BGRA while copying them into the destination rectangle
5748                 for (j = 0;j < size;j++)
5749                 for (k = 0;k < size;k++)
5750                 {
5751                         mergebuf[(j*mergedwidth+k)*4+0] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[0]];
5752                         mergebuf[(j*mergedwidth+k)*4+1] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[1]];
5753                         mergebuf[(j*mergedwidth+k)*4+2] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[2]];
5754                         mergebuf[(j*mergedwidth+k)*4+3] = 255;
5755                 }
5756
5757                 // upload texture if this was the last tile being written to the texture
5758                 if (((realindex + 1) & (mergedrowsxcolumns - 1)) == 0 || (realindex + 1) == realcount)
5759                 {
5760                         if (loadmodel->brushq3.deluxemapping && (i & 1))
5761                                 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);
5762                         else
5763                         {
5764                                 if(mod_q3bsp_sRGBlightmaps.integer)
5765                                 {
5766                                         textype_t t;
5767                                         if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5768                                         {
5769                                                 t = TEXTYPE_BGRA; // in stupid fallback mode, we upload lightmaps in sRGB form and just fix their brightness
5770                                                 // we fix the brightness consistently via lightmapscale
5771                                         }
5772                                         else
5773                                                 t = TEXTYPE_SRGB_BGRA; // normally, we upload lightmaps in sRGB form (possibly downconverted to linear)
5774                                         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);
5775                                 }
5776                                 else
5777                                 {
5778                                         if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5779                                                 Image_MakesRGBColorsFromLinear_Lightmap(mergedpixels, mergedpixels, mergedwidth * mergedheight);
5780                                         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);
5781                                 }
5782                         }
5783                 }
5784         }
5785
5786         if (mergeddeluxepixels)
5787                 Mem_Free(mergeddeluxepixels);
5788         Mem_Free(mergedpixels);
5789         if(external)
5790         {
5791                 for(i = 0; i < count; ++i)
5792                         Mem_Free(inpixels[i]);
5793         }
5794 }
5795
5796 typedef struct patchtess_s
5797 {
5798         patchinfo_t info;
5799
5800         // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
5801         int surface_id;
5802         float lodgroup[6];
5803         float *originalvertex3f;
5804 } patchtess_t;
5805
5806 #define PATCHTESS_SAME_LODGROUP(a,b) \
5807         ( \
5808                 (a).lodgroup[0] == (b).lodgroup[0] && \
5809                 (a).lodgroup[1] == (b).lodgroup[1] && \
5810                 (a).lodgroup[2] == (b).lodgroup[2] && \
5811                 (a).lodgroup[3] == (b).lodgroup[3] && \
5812                 (a).lodgroup[4] == (b).lodgroup[4] && \
5813                 (a).lodgroup[5] == (b).lodgroup[5] \
5814         )
5815
5816 static void Mod_Q3BSP_LoadFaces(lump_t *l)
5817 {
5818         q3dface_t *in, *oldin;
5819         msurface_t *out, *oldout;
5820         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;
5821         float lightmaptcbase[2], lightmaptcscale[2];
5822         //int *originalelement3i;
5823         float *originalvertex3f;
5824         //float *originalsvector3f;
5825         //float *originaltvector3f;
5826         float *originalnormal3f;
5827         float *originalcolor4f;
5828         float *originaltexcoordtexture2f;
5829         float *originaltexcoordlightmap2f;
5830         float *surfacecollisionvertex3f;
5831         int *surfacecollisionelement3i;
5832         float *v;
5833         patchtess_t *patchtess = NULL;
5834         int patchtesscount = 0;
5835         qboolean again;
5836
5837         in = (q3dface_t *)(mod_base + l->fileofs);
5838         if (l->filelen % sizeof(*in))
5839                 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
5840         count = l->filelen / sizeof(*in);
5841         out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5842
5843         loadmodel->data_surfaces = out;
5844         loadmodel->num_surfaces = count;
5845
5846         if(count > 0)
5847                 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
5848
5849         i = 0;
5850         oldi = i;
5851         oldin = in;
5852         oldout = out;
5853         meshvertices = 0;
5854         meshtriangles = 0;
5855         for (;i < count;i++, in++, out++)
5856         {
5857                 // check face type first
5858                 type = LittleLong(in->type);
5859                 if (type != Q3FACETYPE_FLAT
5860                  && type != Q3FACETYPE_PATCH
5861                  && type != Q3FACETYPE_MESH
5862                  && type != Q3FACETYPE_FLARE)
5863                 {
5864                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
5865                         continue;
5866                 }
5867
5868                 n = LittleLong(in->textureindex);
5869                 if (n < 0 || n >= loadmodel->num_textures)
5870                 {
5871                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
5872                         continue;
5873                 }
5874                 out->texture = loadmodel->data_textures + n;
5875                 n = LittleLong(in->effectindex);
5876                 if (n < -1 || n >= loadmodel->brushq3.num_effects)
5877                 {
5878                         if (developer_extra.integer)
5879                                 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
5880                         n = -1;
5881                 }
5882                 if (n == -1)
5883                         out->effect = NULL;
5884                 else
5885                         out->effect = loadmodel->brushq3.data_effects + n;
5886
5887                 if (cls.state != ca_dedicated)
5888                 {
5889                         out->lightmaptexture = NULL;
5890                         out->deluxemaptexture = r_texture_blanknormalmap;
5891                         n = LittleLong(in->lightmapindex);
5892                         if (n < 0)
5893                                 n = -1;
5894                         else if (n >= loadmodel->brushq3.num_originallightmaps)
5895                         {
5896                                 if(loadmodel->brushq3.num_originallightmaps != 0)
5897                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
5898                                 n = -1;
5899                         }
5900                         else
5901                         {
5902                                 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5903                                 if (loadmodel->brushq3.deluxemapping)
5904                                         out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5905                                 loadmodel->lit = true;
5906                         }
5907                 }
5908
5909                 firstvertex = LittleLong(in->firstvertex);
5910                 numvertices = LittleLong(in->numvertices);
5911                 firstelement = LittleLong(in->firstelement);
5912                 numtriangles = LittleLong(in->numelements) / 3;
5913                 if (numtriangles * 3 != LittleLong(in->numelements))
5914                 {
5915                         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));
5916                         continue;
5917                 }
5918                 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
5919                 {
5920                         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);
5921                         continue;
5922                 }
5923                 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
5924                 {
5925                         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);
5926                         continue;
5927                 }
5928                 switch(type)
5929                 {
5930                 case Q3FACETYPE_FLAT:
5931                 case Q3FACETYPE_MESH:
5932                         // no processing necessary
5933                         break;
5934                 case Q3FACETYPE_PATCH:
5935                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5936                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5937                         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))
5938                         {
5939                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
5940                                 continue;
5941                         }
5942                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5943
5944                         // convert patch to Q3FACETYPE_MESH
5945                         xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5946                         ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5947                         // bound to user settings
5948                         xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
5949                         ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
5950                         // bound to sanity settings
5951                         xtess = bound(0, xtess, 1024);
5952                         ytess = bound(0, ytess, 1024);
5953
5954                         // lower quality collision patches! Same procedure as before, but different cvars
5955                         // convert patch to Q3FACETYPE_MESH
5956                         cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5957                         cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5958                         // bound to user settings
5959                         cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
5960                         cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
5961                         // bound to sanity settings
5962                         cxtess = bound(0, cxtess, 1024);
5963                         cytess = bound(0, cytess, 1024);
5964
5965                         // store it for the LOD grouping step
5966                         patchtess[patchtesscount].info.xsize = patchsize[0];
5967                         patchtess[patchtesscount].info.ysize = patchsize[1];
5968                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
5969                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
5970                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
5971                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
5972
5973                         patchtess[patchtesscount].surface_id = i;
5974                         patchtess[patchtesscount].lodgroup[0] = LittleFloat(in->specific.patch.mins[0]);
5975                         patchtess[patchtesscount].lodgroup[1] = LittleFloat(in->specific.patch.mins[1]);
5976                         patchtess[patchtesscount].lodgroup[2] = LittleFloat(in->specific.patch.mins[2]);
5977                         patchtess[patchtesscount].lodgroup[3] = LittleFloat(in->specific.patch.maxs[0]);
5978                         patchtess[patchtesscount].lodgroup[4] = LittleFloat(in->specific.patch.maxs[1]);
5979                         patchtess[patchtesscount].lodgroup[5] = LittleFloat(in->specific.patch.maxs[2]);
5980                         patchtess[patchtesscount].originalvertex3f = originalvertex3f;
5981                         ++patchtesscount;
5982                         break;
5983                 case Q3FACETYPE_FLARE:
5984                         if (developer_extra.integer)
5985                                 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
5986                         // don't render it
5987                         continue;
5988                 }
5989                 out->num_vertices = numvertices;
5990                 out->num_triangles = numtriangles;
5991                 meshvertices += out->num_vertices;
5992                 meshtriangles += out->num_triangles;
5993         }
5994
5995         // Fix patches tesselations so that they make no seams
5996         do
5997         {
5998                 again = false;
5999                 for(i = 0; i < patchtesscount; ++i)
6000                 {
6001                         for(j = i+1; j < patchtesscount; ++j)
6002                         {
6003                                 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
6004                                         continue;
6005
6006                                 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
6007                                         again = true;
6008                         }
6009                 }
6010         }
6011         while (again);
6012
6013         // Calculate resulting number of triangles
6014         collisionvertices = 0;
6015         collisiontriangles = 0;
6016         for(i = 0; i < patchtesscount; ++i)
6017         {
6018                 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
6019                 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
6020                 numvertices = finalwidth * finalheight;
6021                 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
6022
6023                 oldout[patchtess[i].surface_id].num_vertices = numvertices;
6024                 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
6025                 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
6026                 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
6027
6028                 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_COLLISION].xtess);
6029                 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_COLLISION].ytess);
6030                 numvertices = finalwidth * finalheight;
6031                 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
6032
6033                 oldout[patchtess[i].surface_id].num_collisionvertices = numvertices;
6034                 oldout[patchtess[i].surface_id].num_collisiontriangles = numtriangles;
6035                 collisionvertices += oldout[patchtess[i].surface_id].num_collisionvertices;
6036                 collisiontriangles += oldout[patchtess[i].surface_id].num_collisiontriangles;
6037         }
6038
6039         i = oldi;
6040         in = oldin;
6041         out = oldout;
6042         Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true);
6043         if (collisiontriangles)
6044         {
6045                 loadmodel->brush.data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, collisionvertices * sizeof(float[3]));
6046                 loadmodel->brush.data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, collisiontriangles * sizeof(int[3]));
6047         }
6048         meshvertices = 0;
6049         meshtriangles = 0;
6050         collisionvertices = 0;
6051         collisiontriangles = 0;
6052         for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
6053         {
6054                 if (out->num_vertices < 3 || out->num_triangles < 1)
6055                         continue;
6056
6057                 type = LittleLong(in->type);
6058                 firstvertex = LittleLong(in->firstvertex);
6059                 firstelement = LittleLong(in->firstelement);
6060                 out->num_firstvertex = meshvertices;
6061                 out->num_firsttriangle = meshtriangles;
6062                 out->num_firstcollisiontriangle = collisiontriangles;
6063                 switch(type)
6064                 {
6065                 case Q3FACETYPE_FLAT:
6066                 case Q3FACETYPE_MESH:
6067                         // no processing necessary, except for lightmap merging
6068                         for (j = 0;j < out->num_vertices;j++)
6069                         {
6070                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
6071                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
6072                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
6073                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
6074                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
6075                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
6076                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
6077                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
6078                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
6079                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
6080                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
6081                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
6082                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
6083                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
6084                         }
6085                         for (j = 0;j < out->num_triangles*3;j++)
6086                                 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
6087                         break;
6088                 case Q3FACETYPE_PATCH:
6089                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
6090                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
6091                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
6092                         originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
6093                         originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
6094                         originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
6095                         originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
6096
6097                         xtess = ytess = cxtess = cytess = -1;
6098                         for(j = 0; j < patchtesscount; ++j)
6099                                 if(patchtess[j].surface_id == i)
6100                                 {
6101                                         xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
6102                                         ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
6103                                         cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
6104                                         cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
6105                                         break;
6106                                 }
6107                         if(xtess == -1)
6108                         {
6109                                 Con_Printf(CON_ERROR "ERROR: patch %d isn't preprocessed?!?\n", i);
6110                                 xtess = ytess = cxtess = cytess = 0;
6111                         }
6112
6113                         finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
6114                         finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
6115                         finalvertices = finalwidth * finalheight;
6116                         oldnumtriangles = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
6117                         type = Q3FACETYPE_MESH;
6118                         // generate geometry
6119                         // (note: normals are skipped because they get recalculated)
6120                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
6121                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
6122                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
6123                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
6124                         Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
6125                         Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
6126
6127                         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);
6128
6129                         if (developer_extra.integer)
6130                         {
6131                                 if (out->num_triangles < finaltriangles)
6132                                         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);
6133                                 else
6134                                         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);
6135                         }
6136                         // q3map does not put in collision brushes for curves... ugh
6137                         // build the lower quality collision geometry
6138                         finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
6139                         finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
6140                         finalvertices = finalwidth * finalheight;
6141                         oldnumtriangles2 = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
6142
6143                         // store collision geometry for BIH collision tree
6144                         out->num_collisionvertices = finalvertices;
6145                         out->num_collisiontriangles = finaltriangles;
6146                         surfacecollisionvertex3f = loadmodel->brush.data_collisionvertex3f + collisionvertices * 3;
6147                         surfacecollisionelement3i = loadmodel->brush.data_collisionelement3i + collisiontriangles * 3;
6148                         Q3PatchTesselateFloat(3, sizeof(float[3]), surfacecollisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
6149                         Q3PatchTriangleElements(surfacecollisionelement3i, finalwidth, finalheight, collisionvertices);
6150                         Mod_SnapVertices(3, finalvertices, surfacecollisionvertex3f, 1);
6151                         out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, surfacecollisionelement3i, surfacecollisionelement3i, loadmodel->brush.data_collisionvertex3f);
6152
6153                         if (developer_extra.integer)
6154                                 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);
6155
6156                         collisionvertices += finalvertices;
6157                         collisiontriangles += out->num_collisiontriangles;
6158                         break;
6159                 default:
6160                         break;
6161                 }
6162                 meshvertices += out->num_vertices;
6163                 meshtriangles += out->num_triangles;
6164                 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
6165                         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)
6166                                 invalidelements++;
6167                 if (invalidelements)
6168                 {
6169                         Con_Printf(CON_WARN "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);
6170                         for (j = 0;j < out->num_triangles * 3;j++)
6171                         {
6172                                 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
6173                                 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)
6174                                         (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
6175                         }
6176                         Con_Print("\n");
6177                 }
6178                 // calculate a bounding box
6179                 VectorClear(out->mins);
6180                 VectorClear(out->maxs);
6181                 if (out->num_vertices)
6182                 {
6183                         if (cls.state != ca_dedicated && out->lightmaptexture)
6184                         {
6185                                 // figure out which part of the merged lightmap this fits into
6186                                 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
6187                                 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
6188                                 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
6189                                 lightmapindex &= mergewidth * mergeheight - 1;
6190                                 lightmaptcscale[0] = 1.0f / mergewidth;
6191                                 lightmaptcscale[1] = 1.0f / mergeheight;
6192                                 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
6193                                 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
6194                                 // modify the lightmap texcoords to match this region of the merged lightmap
6195                                 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
6196                                 {
6197                                         v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
6198                                         v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
6199                                 }
6200                         }
6201                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
6202                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
6203                         for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
6204                         {
6205                                 out->mins[0] = min(out->mins[0], v[0]);
6206                                 out->maxs[0] = max(out->maxs[0], v[0]);
6207                                 out->mins[1] = min(out->mins[1], v[1]);
6208                                 out->maxs[1] = max(out->maxs[1], v[1]);
6209                                 out->mins[2] = min(out->mins[2], v[2]);
6210                                 out->maxs[2] = max(out->maxs[2], v[2]);
6211                         }
6212                         out->mins[0] -= 1.0f;
6213                         out->mins[1] -= 1.0f;
6214                         out->mins[2] -= 1.0f;
6215                         out->maxs[0] += 1.0f;
6216                         out->maxs[1] += 1.0f;
6217                         out->maxs[2] += 1.0f;
6218                 }
6219                 // set lightmap styles for consistency with q1bsp
6220                 //out->lightmapinfo->styles[0] = 0;
6221                 //out->lightmapinfo->styles[1] = 255;
6222                 //out->lightmapinfo->styles[2] = 255;
6223                 //out->lightmapinfo->styles[3] = 255;
6224         }
6225
6226         i = oldi;
6227         out = oldout;
6228         for (;i < count;i++, out++)
6229         {
6230                 if(out->num_vertices && out->num_triangles)
6231                         continue;
6232                 if(out->num_vertices == 0)
6233                 {
6234                         Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no vertices, ignoring\n", i, out->texture ? out->texture->name : "(none)");
6235                         if(out->num_triangles == 0)
6236                                 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no triangles, ignoring\n", i, out->texture ? out->texture->name : "(none)");
6237                 }
6238                 else if(out->num_triangles == 0)
6239                         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)",
6240                                         (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[0 * 3 + 0],
6241                                         (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[1 * 3 + 0],
6242                                         (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[2 * 3 + 0]);
6243         }
6244
6245         // for per pixel lighting
6246         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);
6247
6248         // generate ushort elements array if possible
6249         if (loadmodel->surfmesh.data_element3s)
6250                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
6251                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
6252
6253         // free the no longer needed vertex data
6254         loadmodel->brushq3.num_vertices = 0;
6255         if (loadmodel->brushq3.data_vertex3f)
6256                 Mem_Free(loadmodel->brushq3.data_vertex3f);
6257         loadmodel->brushq3.data_vertex3f = NULL;
6258         loadmodel->brushq3.data_normal3f = NULL;
6259         loadmodel->brushq3.data_texcoordtexture2f = NULL;
6260         loadmodel->brushq3.data_texcoordlightmap2f = NULL;
6261         loadmodel->brushq3.data_color4f = NULL;
6262         // free the no longer needed triangle data
6263         loadmodel->brushq3.num_triangles = 0;
6264         if (loadmodel->brushq3.data_element3i)
6265                 Mem_Free(loadmodel->brushq3.data_element3i);
6266         loadmodel->brushq3.data_element3i = NULL;
6267
6268         if(patchtess)
6269                 Mem_Free(patchtess);
6270 }
6271
6272 static void Mod_Q3BSP_LoadModels(lump_t *l)
6273 {
6274         q3dmodel_t *in;
6275         q3dmodel_t *out;
6276         int i, j, n, c, count;
6277
6278         in = (q3dmodel_t *)(mod_base + l->fileofs);
6279         if (l->filelen % sizeof(*in))
6280                 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
6281         count = l->filelen / sizeof(*in);
6282         out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6283
6284         loadmodel->brushq3.data_models = out;
6285         loadmodel->brushq3.num_models = count;
6286
6287         for (i = 0;i < count;i++, in++, out++)
6288         {
6289                 for (j = 0;j < 3;j++)
6290                 {
6291                         out->mins[j] = LittleFloat(in->mins[j]);
6292                         out->maxs[j] = LittleFloat(in->maxs[j]);
6293                 }
6294                 n = LittleLong(in->firstface);
6295                 c = LittleLong(in->numfaces);
6296                 if (n < 0 || n + c > loadmodel->num_surfaces)
6297                         Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
6298                 out->firstface = n;
6299                 out->numfaces = c;
6300                 n = LittleLong(in->firstbrush);
6301                 c = LittleLong(in->numbrushes);
6302                 if (n < 0 || n + c > loadmodel->brush.num_brushes)
6303                         Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
6304                 out->firstbrush = n;
6305                 out->numbrushes = c;
6306         }
6307 }
6308
6309 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
6310 {
6311         int *in;
6312         int *out;
6313         int i, n, count;
6314
6315         in = (int *)(mod_base + l->fileofs);
6316         if (l->filelen % sizeof(*in))
6317                 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
6318         count = l->filelen / sizeof(*in);
6319         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6320
6321         loadmodel->brush.data_leafbrushes = out;
6322         loadmodel->brush.num_leafbrushes = count;
6323
6324         for (i = 0;i < count;i++, in++, out++)
6325         {
6326                 n = LittleLong(*in);
6327                 if (n < 0 || n >= loadmodel->brush.num_brushes)
6328                         Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
6329                 *out = n;
6330         }
6331 }
6332
6333 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
6334 {
6335         int *in;
6336         int *out;
6337         int i, n, count;
6338
6339         in = (int *)(mod_base + l->fileofs);
6340         if (l->filelen % sizeof(*in))
6341                 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
6342         count = l->filelen / sizeof(*in);
6343         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6344
6345         loadmodel->brush.data_leafsurfaces = out;
6346         loadmodel->brush.num_leafsurfaces = count;
6347
6348         for (i = 0;i < count;i++, in++, out++)
6349         {
6350                 n = LittleLong(*in);
6351                 if (n < 0 || n >= loadmodel->num_surfaces)
6352                         Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
6353                 *out = n;
6354         }
6355 }
6356
6357 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
6358 {
6359         q3dleaf_t *in;
6360         mleaf_t *out;
6361         int i, j, n, c, count;
6362
6363         in = (q3dleaf_t *)(mod_base + l->fileofs);
6364         if (l->filelen % sizeof(*in))
6365                 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
6366         count = l->filelen / sizeof(*in);
6367         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6368
6369         loadmodel->brush.data_leafs = out;
6370         loadmodel->brush.num_leafs = count;
6371
6372         for (i = 0;i < count;i++, in++, out++)
6373         {
6374                 out->parent = NULL;
6375                 out->plane = NULL;
6376                 out->clusterindex = LittleLong(in->clusterindex);
6377                 out->areaindex = LittleLong(in->areaindex);
6378                 for (j = 0;j < 3;j++)
6379                 {
6380                         // yes the mins/maxs are ints
6381                         out->mins[j] = LittleLong(in->mins[j]) - 1;
6382                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
6383                 }
6384                 n = LittleLong(in->firstleafface);
6385                 c = LittleLong(in->numleaffaces);
6386                 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
6387                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
6388                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
6389                 out->numleafsurfaces = c;
6390                 n = LittleLong(in->firstleafbrush);
6391                 c = LittleLong(in->numleafbrushes);
6392                 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
6393                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
6394                 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
6395                 out->numleafbrushes = c;
6396         }
6397 }
6398
6399 static void Mod_Q3BSP_LoadNodes(lump_t *l)
6400 {
6401         q3dnode_t *in;
6402         mnode_t *out;
6403         int i, j, n, count;
6404
6405         in = (q3dnode_t *)(mod_base + l->fileofs);
6406         if (l->filelen % sizeof(*in))
6407                 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
6408         count = l->filelen / sizeof(*in);
6409         if (count == 0)
6410                 Host_Error("Mod_Q3BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
6411         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6412
6413         loadmodel->brush.data_nodes = out;
6414         loadmodel->brush.num_nodes = count;
6415
6416         for (i = 0;i < count;i++, in++, out++)
6417         {
6418                 out->parent = NULL;
6419                 n = LittleLong(in->planeindex);
6420                 if (n < 0 || n >= loadmodel->brush.num_planes)
6421                         Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
6422                 out->plane = loadmodel->brush.data_planes + n;
6423                 for (j = 0;j < 2;j++)
6424                 {
6425                         n = LittleLong(in->childrenindex[j]);
6426                         if (n >= 0)
6427                         {
6428                                 if (n >= loadmodel->brush.num_nodes)
6429                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
6430                                 out->children[j] = loadmodel->brush.data_nodes + n;
6431                         }
6432                         else
6433                         {
6434                                 n = -1 - n;
6435                                 if (n >= loadmodel->brush.num_leafs)
6436                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
6437                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
6438                         }
6439                 }
6440                 for (j = 0;j < 3;j++)
6441                 {
6442                         // yes the mins/maxs are ints
6443                         out->mins[j] = LittleLong(in->mins[j]) - 1;
6444                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
6445                 }
6446         }
6447
6448         // set the parent pointers
6449         Mod_BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
6450 }
6451
6452 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
6453 {
6454         q3dlightgrid_t *in;
6455         q3dlightgrid_t *out;
6456         int count;
6457         int i;
6458         int texturesize[3];
6459         unsigned char *texturergba, *texturelayer[3], *texturepadding[2];
6460         double lightgridmatrix[4][4];
6461
6462         in = (q3dlightgrid_t *)(mod_base + l->fileofs);
6463         if (l->filelen % sizeof(*in))
6464                 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
6465         loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
6466         loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
6467         loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
6468         loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
6469         loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
6470         loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
6471         loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
6472         loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
6473         loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
6474         loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
6475         loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
6476         loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
6477         count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
6478         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]);
6479         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]);
6480
6481         // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
6482         if (l->filelen)
6483         {
6484                 if (l->filelen < count * (int)sizeof(*in))
6485                 {
6486                         Con_Printf(CON_ERROR "Mod_Q3BSP_LoadLightGrid: invalid lightgrid lump size %i bytes, should be %i bytes (%ix%ix%i)", l->filelen, (int)(count * sizeof(*in)), loadmodel->brushq3.num_lightgrid_isize[0], loadmodel->brushq3.num_lightgrid_isize[1], loadmodel->brushq3.num_lightgrid_isize[2]);
6487                         return; // ignore the grid if we cannot understand it
6488                 }
6489                 if (l->filelen != count * (int)sizeof(*in))
6490                         Con_Printf(CON_WARN "Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
6491                 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6492                 loadmodel->brushq3.data_lightgrid = out;
6493                 loadmodel->brushq3.num_lightgrid = count;
6494                 // no swapping or validation necessary
6495                 memcpy(out, in, count * (int)sizeof(*out));
6496
6497                 if(mod_q3bsp_sRGBlightmaps.integer)
6498                 {
6499                         if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
6500                         {
6501                                 // we fix the brightness consistently via lightmapscale
6502                         }
6503                         else
6504                         {
6505                                 for(i = 0; i < count; ++i)
6506                                 {
6507                                         out[i].ambientrgb[0] = floor(Image_LinearFloatFromsRGB(out[i].ambientrgb[0]) * 255.0f + 0.5f);
6508                                         out[i].ambientrgb[1] = floor(Image_LinearFloatFromsRGB(out[i].ambientrgb[1]) * 255.0f + 0.5f);
6509                                         out[i].ambientrgb[2] = floor(Image_LinearFloatFromsRGB(out[i].ambientrgb[2]) * 255.0f + 0.5f);
6510                                         out[i].diffusergb[0] = floor(Image_LinearFloatFromsRGB(out[i].diffusergb[0]) * 255.0f + 0.5f);
6511                                         out[i].diffusergb[1] = floor(Image_LinearFloatFromsRGB(out[i].diffusergb[1]) * 255.0f + 0.5f);
6512                                         out[i].diffusergb[2] = floor(Image_LinearFloatFromsRGB(out[i].diffusergb[2]) * 255.0f + 0.5f);
6513                                 }
6514                         }
6515                 }
6516                 else
6517                 {
6518                         if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
6519                         {
6520                                 for(i = 0; i < count; ++i)
6521                                 {
6522                                         out[i].ambientrgb[0] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].ambientrgb[0]) * 255.0f + 0.5f);
6523                                         out[i].ambientrgb[1] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].ambientrgb[1]) * 255.0f + 0.5f);
6524                                         out[i].ambientrgb[2] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].ambientrgb[2]) * 255.0f + 0.5f);
6525                                         out[i].diffusergb[0] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].diffusergb[0]) * 255.0f + 0.5f);
6526                                         out[i].diffusergb[1] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].diffusergb[1]) * 255.0f + 0.5f);
6527                                         out[i].diffusergb[2] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].diffusergb[2]) * 255.0f + 0.5f);
6528                                 }
6529                         }
6530                         else
6531                         {
6532                                 // all is good
6533                         }
6534                 }
6535
6536                 if (mod_q3bsp_lightgrid_texture.integer)
6537                 {
6538                         // build a texture to hold the data for per-pixel sampling
6539                         // this has 3 different kinds of data stacked in it:
6540                         // ambient color
6541                         // bent-normal light color
6542                         // bent-normal light dir
6543
6544                         texturesize[0] = loadmodel->brushq3.num_lightgrid_isize[0];
6545                         texturesize[1] = loadmodel->brushq3.num_lightgrid_isize[1];
6546                         texturesize[2] = (loadmodel->brushq3.num_lightgrid_isize[2] + 2) * 3;
6547                         texturergba = (unsigned char*)Mem_Alloc(loadmodel->mempool, texturesize[0] * texturesize[1] * texturesize[2] * sizeof(char[4]));
6548                         texturelayer[0] = texturergba + loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * 4;
6549                         texturelayer[1] = texturelayer[0] + (loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * (loadmodel->brushq3.num_lightgrid_isize[2] + 2)) * 4;
6550                         texturelayer[2] = texturelayer[1] + (loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * (loadmodel->brushq3.num_lightgrid_isize[2] + 2)) * 4;
6551                         // the light dir layer needs padding above/below it that is a neutral unsigned normal (127,127,127,255)
6552                         texturepadding[0] = texturelayer[2] - loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * 4;
6553                         texturepadding[1] = texturelayer[2] + loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2] * 4;
6554                         for (i = 0; i < texturesize[0] * texturesize[1]; i++)
6555                         {
6556                                 texturepadding[0][i * 4] = texturepadding[1][i * 4] = 127;
6557                                 texturepadding[0][i * 4 + 1] = texturepadding[1][i * 4 + 1] = 127;
6558                                 texturepadding[0][i * 4 + 2] = texturepadding[1][i * 4 + 2] = 127;
6559                                 texturepadding[0][i * 4 + 3] = texturepadding[1][i * 4 + 3] = 255;
6560                         }
6561                         for (i = 0; i < count; i++)
6562                         {
6563                                 texturelayer[0][i * 4 + 0] = out[i].ambientrgb[0];
6564                                 texturelayer[0][i * 4 + 1] = out[i].ambientrgb[1];
6565                                 texturelayer[0][i * 4 + 2] = out[i].ambientrgb[2];
6566                                 texturelayer[0][i * 4 + 3] = 255;
6567                                 texturelayer[1][i * 4 + 0] = out[i].diffusergb[0];
6568                                 texturelayer[1][i * 4 + 1] = out[i].diffusergb[1];
6569                                 texturelayer[1][i * 4 + 2] = out[i].diffusergb[2];
6570                                 texturelayer[1][i * 4 + 3] = 255;
6571                                 // this uses the mod_md3_sin table because the values are
6572                                 // already in the 0-255 range, the 64+ bias fetches a cosine
6573                                 // instead of a sine value
6574                                 texturelayer[2][i * 4 + 0] = (char)((mod_md3_sin[64 + out[i].diffuseyaw] * mod_md3_sin[out[i].diffusepitch]) * 127 + 127);
6575                                 texturelayer[2][i * 4 + 1] = (char)((mod_md3_sin[out[i].diffuseyaw] * mod_md3_sin[out[i].diffusepitch]) * 127 + 127);
6576                                 texturelayer[2][i * 4 + 2] = (char)((mod_md3_sin[64 + out[i].diffusepitch]) * 127 + 127);
6577                                 texturelayer[2][i * 4 + 3] = 255;
6578                         }
6579 #if 0
6580                         // debugging hack
6581                         int x, y, z;
6582                         for (z = 0; z < loadmodel->brushq3.num_lightgrid_isize[2]; z++)
6583                         {
6584                                 for (y = 0; y < loadmodel->brushq3.num_lightgrid_isize[1]; y++)
6585                                 {
6586                                         for (x = 0; x < loadmodel->brushq3.num_lightgrid_isize[0]; x++)
6587                                         {
6588                                                 i = (z * texturesize[1] + y) * texturesize[0] + x;
6589                                                 texturelayer[0][i * 4 + 0] = x * 256 / loadmodel->brushq3.num_lightgrid_isize[0];
6590                                                 texturelayer[0][i * 4 + 1] = y * 256 / loadmodel->brushq3.num_lightgrid_isize[1];
6591                                                 texturelayer[0][i * 4 + 2] = z * 256 / loadmodel->brushq3.num_lightgrid_isize[2];
6592                                         }
6593                                 }
6594                         }
6595 #endif
6596                         loadmodel->brushq3.lightgridtexturesize[0] = texturesize[0];
6597                         loadmodel->brushq3.lightgridtexturesize[1] = texturesize[1];
6598                         loadmodel->brushq3.lightgridtexturesize[2] = texturesize[2];
6599                         memset(lightgridmatrix[0], 0, sizeof(lightgridmatrix));
6600                         lightgridmatrix[0][0] = loadmodel->brushq3.num_lightgrid_scale[0] / texturesize[0];
6601                         lightgridmatrix[1][1] = loadmodel->brushq3.num_lightgrid_scale[1] / texturesize[1];
6602                         lightgridmatrix[2][2] = loadmodel->brushq3.num_lightgrid_scale[2] / texturesize[2];
6603                         lightgridmatrix[0][3] = -(loadmodel->brushq3.num_lightgrid_imins[0] - 0.5f) / texturesize[0];
6604                         lightgridmatrix[1][3] = -(loadmodel->brushq3.num_lightgrid_imins[1] - 0.5f) / texturesize[1];
6605                         lightgridmatrix[2][3] = -(loadmodel->brushq3.num_lightgrid_imins[2] - 1.5f) / texturesize[2];
6606                         lightgridmatrix[3][3] = 1;
6607                         Matrix4x4_FromArrayDoubleD3D(&loadmodel->brushq3.lightgridworldtotexturematrix, lightgridmatrix[0]);
6608                         loadmodel->brushq3.lightgridtexture = R_LoadTexture3D(loadmodel->texturepool, "lightgrid", texturesize[0], texturesize[1], texturesize[2], texturergba, TEXTYPE_RGBA, TEXF_CLAMP, 0, NULL);
6609                         Mem_Free(texturergba);
6610                 }
6611         }
6612 }
6613
6614 static void Mod_Q3BSP_LoadPVS(lump_t *l)
6615 {
6616         q3dpvs_t *in;
6617         int totalchains;
6618
6619         if (l->filelen == 0)
6620         {
6621                 int i;
6622                 // unvised maps often have cluster indices even without pvs, so check
6623                 // leafs to find real number of clusters
6624                 loadmodel->brush.num_pvsclusters = 1;
6625                 for (i = 0;i < loadmodel->brush.num_leafs;i++)
6626                         loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
6627
6628                 // create clusters
6629                 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
6630                 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
6631                 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
6632                 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
6633                 return;
6634         }
6635
6636         in = (q3dpvs_t *)(mod_base + l->fileofs);
6637         if (l->filelen < 9)
6638                 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
6639
6640         loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
6641         loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
6642         if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
6643                 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
6644         totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
6645         if (l->filelen < totalchains + (int)sizeof(*in))
6646                 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);
6647
6648         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
6649         memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
6650 }
6651
6652 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
6653 {
6654         int i, j, k, index[3];
6655         float transformed[3], blend1, blend2, blend, stylescale = 1;
6656         q3dlightgrid_t *a, *s;
6657
6658         // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
6659         // LadyHavoc: FIXME: is this true?
6660         stylescale = 1; // added while render
6661         //stylescale = r_refdef.scene.rtlightstylevalue[0];
6662
6663         if (!model->brushq3.num_lightgrid)
6664         {
6665                 ambientcolor[0] = stylescale;
6666                 ambientcolor[1] = stylescale;
6667                 ambientcolor[2] = stylescale;
6668                 return;
6669         }
6670
6671         Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
6672         //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
6673         //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
6674         transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
6675         transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
6676         transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
6677         index[0] = (int)floor(transformed[0]);
6678         index[1] = (int)floor(transformed[1]);
6679         index[2] = (int)floor(transformed[2]);
6680         //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
6681
6682         // now lerp the values
6683         VectorClear(diffusenormal);
6684         a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
6685         for (k = 0;k < 2;k++)
6686         {
6687                 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
6688                 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
6689                         continue;
6690                 for (j = 0;j < 2;j++)
6691                 {
6692                         blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
6693                         if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
6694                                 continue;
6695                         for (i = 0;i < 2;i++)
6696                         {
6697                                 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
6698                                 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
6699                                         continue;
6700                                 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
6701                                 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
6702                                 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
6703                                 // this uses the mod_md3_sin table because the values are
6704                                 // already in the 0-255 range, the 64+ bias fetches a cosine
6705                                 // instead of a sine value
6706                                 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
6707                                 diffusenormal[1] += blend * (mod_md3_sin[     s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
6708                                 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
6709                                 //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)));
6710                         }
6711                 }
6712         }
6713
6714         // normalize the light direction before turning
6715         VectorNormalize(diffusenormal);
6716         //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]);
6717 }
6718
6719 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3], double endpos[3])
6720 {
6721         double t1, t2;
6722         double midf, mid[3];
6723         int ret, side;
6724
6725         // check for empty
6726         while (node->plane)
6727         {
6728                 // find the point distances
6729                 mplane_t *plane = node->plane;
6730                 if (plane->type < 3)
6731                 {
6732                         t1 = p1[plane->type] - plane->dist;
6733                         t2 = p2[plane->type] - plane->dist;
6734                 }
6735                 else
6736                 {
6737                         t1 = DotProduct (plane->normal, p1) - plane->dist;
6738                         t2 = DotProduct (plane->normal, p2) - plane->dist;
6739                 }
6740
6741                 if (t1 < 0)
6742                 {
6743                         if (t2 < 0)
6744                         {
6745                                 node = node->children[1];
6746                                 continue;
6747                         }
6748                         side = 1;
6749                 }
6750                 else
6751                 {
6752                         if (t2 >= 0)
6753                         {
6754                                 node = node->children[0];
6755                                 continue;
6756                         }
6757                         side = 0;
6758                 }
6759
6760                 midf = t1 / (t1 - t2);
6761                 VectorLerp(p1, midf, p2, mid);
6762
6763                 // recurse both sides, front side first
6764                 // return 2 if empty is followed by solid (hit something)
6765                 // do not return 2 if both are solid or both empty,
6766                 // or if start is solid and end is empty
6767                 // as these degenerate cases usually indicate the eye is in solid and
6768                 // should see the target point anyway
6769                 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side    ], p1, mid, endpos);
6770                 if (ret != 0)
6771                         return ret;
6772                 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2, endpos);
6773                 if (ret != 1)
6774                         return ret;
6775                 VectorCopy(mid, endpos);
6776                 return 2;
6777         }
6778         return ((mleaf_t *)node)->clusterindex < 0;
6779 }
6780
6781 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)
6782 {
6783         if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
6784         {
6785                 trace_t trace;
6786                 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK, 0, MATERIALFLAGMASK_TRANSLUCENT);
6787                 return trace.fraction == 1 || BoxesOverlap(trace.endpos, trace.endpos, acceptmins, acceptmaxs);
6788         }
6789         else
6790         {
6791                 double tracestart[3], traceend[3], traceendpos[3];
6792                 VectorCopy(start, tracestart);
6793                 VectorCopy(end, traceend);
6794                 VectorCopy(end, traceendpos);
6795                 Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend, traceendpos);
6796                 return BoxesOverlap(traceendpos, traceendpos, acceptmins, acceptmaxs);
6797         }
6798 }
6799
6800 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)
6801 {
6802         const bih_t *bih;
6803         const bih_leaf_t *leaf;
6804         const bih_node_t *node;
6805         const colbrushf_t *brush;
6806         int axis;
6807         int nodenum;
6808         int nodestackpos = 0;
6809         int nodestack[1024];
6810
6811         memset(trace, 0, sizeof(*trace));
6812         trace->fraction = 1;
6813         trace->hitsupercontentsmask = hitsupercontentsmask;
6814         trace->skipsupercontentsmask = skipsupercontentsmask;
6815         trace->skipmaterialflagsmask = skipmaterialflagsmask;
6816
6817         bih = &model->collision_bih;
6818         if(!bih->nodes)
6819                 return;
6820
6821         nodenum = bih->rootnode;
6822         nodestack[nodestackpos++] = nodenum;
6823         while (nodestackpos)
6824         {
6825                 nodenum = nodestack[--nodestackpos];
6826                 node = bih->nodes + nodenum;
6827 #if 1
6828                 if (!BoxesOverlap(start, start, node->mins, node->maxs))
6829                         continue;
6830 #endif
6831                 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6832                 {
6833                         axis = node->type - BIH_SPLITX;
6834                         if (start[axis] >= node->frontmin)
6835                                 nodestack[nodestackpos++] = node->front;
6836                         if (start[axis] <= node->backmax)
6837                                 nodestack[nodestackpos++] = node->back;
6838                 }
6839                 else if (node->type == BIH_UNORDERED)
6840                 {
6841                         for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6842                         {
6843                                 leaf = bih->leafs + node->children[axis];
6844 #if 1
6845                                 if (!BoxesOverlap(start, start, leaf->mins, leaf->maxs))
6846                                         continue;
6847 #endif
6848                                 switch(leaf->type)
6849                                 {
6850                                 case BIH_BRUSH:
6851                                         brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6852                                         Collision_TracePointBrushFloat(trace, start, brush);
6853                                         break;
6854                                 case BIH_COLLISIONTRIANGLE:
6855                                         // collision triangle - skipped because they have no volume
6856                                         break;
6857                                 case BIH_RENDERTRIANGLE:
6858                                         // render triangle - skipped because they have no volume
6859                                         break;
6860                                 }
6861                         }
6862                 }
6863         }
6864 }
6865
6866 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)
6867 {
6868         const bih_leaf_t *leaf;
6869         const bih_node_t *node;
6870         const colbrushf_t *brush;
6871         const int *e;
6872         const texture_t *texture;
6873         vec3_t nodebigmins, nodebigmaxs, nodestart, nodeend, sweepnodemins, sweepnodemaxs;
6874         vec_t d1, d2, d3, d4, f, nodestackline[1024][6];
6875         int axis, nodenum, nodestackpos = 0, nodestack[1024];
6876
6877         if(!bih->nodes)
6878                 return;
6879
6880         if (VectorCompare(start, end))
6881         {
6882                 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
6883                 return;
6884         }
6885
6886         nodenum = bih->rootnode;
6887
6888         memset(trace, 0, sizeof(*trace));
6889         trace->fraction = 1;
6890         trace->hitsupercontentsmask = hitsupercontentsmask;
6891         trace->skipsupercontentsmask = skipsupercontentsmask;
6892         trace->skipmaterialflagsmask = skipmaterialflagsmask;
6893
6894         // push first node
6895         nodestackline[nodestackpos][0] = start[0];
6896         nodestackline[nodestackpos][1] = start[1];
6897         nodestackline[nodestackpos][2] = start[2];
6898         nodestackline[nodestackpos][3] = end[0];
6899         nodestackline[nodestackpos][4] = end[1];
6900         nodestackline[nodestackpos][5] = end[2];
6901         nodestack[nodestackpos++] = nodenum;
6902         while (nodestackpos)
6903         {
6904                 nodenum = nodestack[--nodestackpos];
6905                 node = bih->nodes + nodenum;
6906                 VectorCopy(nodestackline[nodestackpos], nodestart);
6907                 VectorCopy(nodestackline[nodestackpos] + 3, nodeend);
6908                 sweepnodemins[0] = min(nodestart[0], nodeend[0]) - 1;
6909                 sweepnodemins[1] = min(nodestart[1], nodeend[1]) - 1;
6910                 sweepnodemins[2] = min(nodestart[2], nodeend[2]) - 1;
6911                 sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + 1;
6912                 sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + 1;
6913                 sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + 1;
6914                 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs) && !collision_bih_fullrecursion.integer)
6915                         continue;
6916                 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6917                 {
6918                         // recurse children of the split
6919                         axis = node->type - BIH_SPLITX;
6920                         d1 = node->backmax - nodestart[axis];
6921                         d2 = node->backmax - nodeend[axis];
6922                         d3 = nodestart[axis] - node->frontmin;
6923                         d4 = nodeend[axis] - node->frontmin;
6924                         if (collision_bih_fullrecursion.integer)
6925                                 d1 = d2 = d3 = d4 = 1; // force full recursion
6926                         switch((d1 < 0) | ((d2 < 0) << 1) | ((d3 < 0) << 2) | ((d4 < 0) << 3))
6927                         {
6928                         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;
6929                         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;
6930                         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;
6931                         case  3: /* <<>> */                                                                                                                                                                                                                      VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6932                         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;
6933                         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;
6934                         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;
6935                         case  7: /* <<<> */                                                                                                                                                                                                  f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6936                         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;
6937                         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;
6938                         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;
6939                         case 11: /* <<>< */                                                                                                                                                                                                  f = d3 / (d3 - d4); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6940                         case 12: /* >><< */                     VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                                                                                                                                                                                                   break;
6941                         case 13: /* <><< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                                                                                                                                                                                                   break;
6942                         case 14: /* ><<< */ f = d1 / (d1 - d2); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                                                                                                                                                                                                   break;
6943                         case 15: /* <<<< */                                                                                                                                                                                                                                                                                                                                                                                                   break;
6944                         }
6945                 }
6946                 else if (node->type == BIH_UNORDERED)
6947                 {
6948                         // calculate sweep bounds for this node
6949                         // copy node bounds into local variables
6950                         VectorCopy(node->mins, nodebigmins);
6951                         VectorCopy(node->maxs, nodebigmaxs);
6952                         // clip line to this node bounds
6953                         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); }
6954                         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); }
6955                         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); }
6956                         // some of the line intersected the enlarged node box
6957                         // calculate sweep bounds for this node
6958                         sweepnodemins[0] = min(nodestart[0], nodeend[0]) - 1;
6959                         sweepnodemins[1] = min(nodestart[1], nodeend[1]) - 1;
6960                         sweepnodemins[2] = min(nodestart[2], nodeend[2]) - 1;
6961                         sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + 1;
6962                         sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + 1;
6963                         sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + 1;
6964                         for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6965                         {
6966                                 leaf = bih->leafs + node->children[axis];
6967                                 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, leaf->mins, leaf->maxs))
6968                                         continue;
6969                                 switch(leaf->type)
6970                                 {
6971                                 case BIH_BRUSH:
6972                                         brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6973                                         Collision_TraceLineBrushFloat(trace, start, end, brush, brush);
6974                                         break;
6975                                 case BIH_COLLISIONTRIANGLE:
6976                                         if (!mod_q3bsp_curves_collisions.integer)
6977                                                 continue;
6978                                         e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6979                                         texture = model->data_textures + leaf->textureindex;
6980                                         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);
6981                                         break;
6982                                 case BIH_RENDERTRIANGLE:
6983                                         e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6984                                         texture = model->data_textures + leaf->textureindex;
6985                                         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);
6986                                         break;
6987                                 }
6988                         }
6989                 }
6990         }
6991 }
6992
6993 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)
6994 {
6995         if (VectorCompare(start, end))
6996         {
6997                 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
6998                 return;
6999         }
7000         Mod_CollisionBIH_TraceLineShared(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask, &model->collision_bih);
7001 }
7002
7003 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)
7004 {
7005         const bih_t *bih;
7006         const bih_leaf_t *leaf;
7007         const bih_node_t *node;
7008         const colbrushf_t *brush;
7009         const int *e;
7010         const texture_t *texture;
7011         vec3_t start, end, startmins, startmaxs, endmins, endmaxs, mins, maxs;
7012         vec3_t nodebigmins, nodebigmaxs, nodestart, nodeend, sweepnodemins, sweepnodemaxs;
7013         vec_t d1, d2, d3, d4, f, nodestackline[1024][6];
7014         int axis, nodenum, nodestackpos = 0, nodestack[1024];
7015
7016         if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(thisbrush_start->mins, thisbrush_start->maxs) && VectorCompare(thisbrush_end->mins, thisbrush_end->maxs))
7017         {
7018                 if (VectorCompare(thisbrush_start->mins, thisbrush_end->mins))
7019                         Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, thisbrush_start->mins, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7020                 else
7021                         Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, thisbrush_start->mins, thisbrush_end->mins, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7022                 return;
7023         }
7024
7025         bih = &model->collision_bih;
7026         if(!bih->nodes)
7027                 return;
7028         nodenum = bih->rootnode;
7029
7030         // box trace, performed as brush trace
7031         memset(trace, 0, sizeof(*trace));
7032         trace->fraction = 1;
7033         trace->hitsupercontentsmask = hitsupercontentsmask;
7034         trace->skipsupercontentsmask = skipsupercontentsmask;
7035         trace->skipmaterialflagsmask = skipmaterialflagsmask;
7036
7037         // calculate tracebox-like parameters for efficient culling
7038         VectorMAM(0.5f, thisbrush_start->mins, 0.5f, thisbrush_start->maxs, start);
7039         VectorMAM(0.5f, thisbrush_end->mins, 0.5f, thisbrush_end->maxs, end);
7040         VectorSubtract(thisbrush_start->mins, start, startmins);
7041         VectorSubtract(thisbrush_start->maxs, start, startmaxs);
7042         VectorSubtract(thisbrush_end->mins, end, endmins);
7043         VectorSubtract(thisbrush_end->maxs, end, endmaxs);
7044         mins[0] = min(startmins[0], endmins[0]);
7045         mins[1] = min(startmins[1], endmins[1]);
7046         mins[2] = min(startmins[2], endmins[2]);
7047         maxs[0] = max(startmaxs[0], endmaxs[0]);
7048         maxs[1] = max(startmaxs[1], endmaxs[1]);
7049         maxs[2] = max(startmaxs[2], endmaxs[2]);
7050
7051         // push first node
7052         nodestackline[nodestackpos][0] = start[0];
7053         nodestackline[nodestackpos][1] = start[1];
7054         nodestackline[nodestackpos][2] = start[2];
7055         nodestackline[nodestackpos][3] = end[0];
7056         nodestackline[nodestackpos][4] = end[1];
7057         nodestackline[nodestackpos][5] = end[2];
7058         nodestack[nodestackpos++] = nodenum;
7059         while (nodestackpos)
7060         {
7061                 nodenum = nodestack[--nodestackpos];
7062                 node = bih->nodes + nodenum;
7063                 VectorCopy(nodestackline[nodestackpos], nodestart);
7064                 VectorCopy(nodestackline[nodestackpos] + 3, nodeend);
7065                 sweepnodemins[0] = min(nodestart[0], nodeend[0]) + mins[0] - 1;
7066                 sweepnodemins[1] = min(nodestart[1], nodeend[1]) + mins[1] - 1;
7067                 sweepnodemins[2] = min(nodestart[2], nodeend[2]) + mins[2] - 1;
7068                 sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + maxs[0] + 1;
7069                 sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + maxs[1] + 1;
7070                 sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + maxs[2] + 1;
7071                 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs))
7072                         continue;
7073                 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
7074                 {
7075                         // recurse children of the split
7076                         axis = node->type - BIH_SPLITX;
7077                         d1 = node->backmax - nodestart[axis] - mins[axis];
7078                         d2 = node->backmax - nodeend[axis] - mins[axis];
7079                         d3 = nodestart[axis] - node->frontmin + maxs[axis];
7080                         d4 = nodeend[axis] - node->frontmin + maxs[axis];
7081                         switch((d1 < 0) | ((d2 < 0) << 1) | ((d3 < 0) << 2) | ((d4 < 0) << 3))
7082                         {
7083                         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;
7084                         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;
7085                         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;
7086                         case  3: /* <<>> */                                                                                                                                                                                                                      VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7087                         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;
7088                         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;
7089                         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;
7090                         case  7: /* <<<> */                                                                                                                                                                                                  f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7091                         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;
7092                         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;
7093                         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;
7094                         case 11: /* <<>< */                                                                                                                                                                                                  f = d3 / (d3 - d4); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7095                         case 12: /* >><< */                     VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                                                                                                                                                                                                   break;
7096                         case 13: /* <><< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy(              nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                                                                                                                                                                                                   break;
7097                         case 14: /* ><<< */ f = d1 / (d1 - d2); VectorCopy(nodestart,             nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back;                                                                                                                                                                                                   break;
7098                         case 15: /* <<<< */                                                                                                                                                                                                                                                                                                                                                                                                   break;
7099                         }
7100                 }
7101                 else if (node->type == BIH_UNORDERED)
7102                 {
7103                         // calculate sweep bounds for this node
7104                         // copy node bounds into local variables and expand to get Minkowski Sum of the two shapes
7105                         VectorSubtract(node->mins, maxs, nodebigmins);
7106                         VectorSubtract(node->maxs, mins, nodebigmaxs);
7107                         // clip line to this node bounds
7108                         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); }
7109                         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); }
7110                         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); }
7111                         // some of the line intersected the enlarged node box
7112                         // calculate sweep bounds for this node
7113                         sweepnodemins[0] = min(nodestart[0], nodeend[0]) + mins[0] - 1;
7114                         sweepnodemins[1] = min(nodestart[1], nodeend[1]) + mins[1] - 1;
7115                         sweepnodemins[2] = min(nodestart[2], nodeend[2]) + mins[2] - 1;
7116                         sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + maxs[0] + 1;
7117                         sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + maxs[1] + 1;
7118                         sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + maxs[2] + 1;
7119                         for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
7120                         {
7121                                 leaf = bih->leafs + node->children[axis];
7122                                 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, leaf->mins, leaf->maxs))
7123                                         continue;
7124                                 switch(leaf->type)
7125                                 {
7126                                 case BIH_BRUSH:
7127                                         brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
7128                                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
7129                                         break;
7130                                 case BIH_COLLISIONTRIANGLE:
7131                                         if (!mod_q3bsp_curves_collisions.integer)
7132                                                 continue;
7133                                         e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
7134                                         texture = model->data_textures + leaf->textureindex;
7135                                         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);
7136                                         break;
7137                                 case BIH_RENDERTRIANGLE:
7138                                         e = model->surfmesh.data_element3i + 3*leaf->itemindex;
7139                                         texture = model->data_textures + leaf->textureindex;
7140                                         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);
7141                                         break;
7142                                 }
7143                         }
7144                 }
7145         }
7146 }
7147
7148 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)
7149 {
7150         colboxbrushf_t thisbrush_start, thisbrush_end;
7151         vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
7152
7153         // box trace, performed as brush trace
7154         VectorAdd(start, boxmins, boxstartmins);
7155         VectorAdd(start, boxmaxs, boxstartmaxs);
7156         VectorAdd(end, boxmins, boxendmins);
7157         VectorAdd(end, boxmaxs, boxendmaxs);
7158         Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
7159         Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
7160         Mod_CollisionBIH_TraceBrush(model, frameblend, skeleton, trace, &thisbrush_start.brush, &thisbrush_end.brush, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7161 }
7162
7163
7164 int Mod_CollisionBIH_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
7165 {
7166         trace_t trace;
7167         Mod_CollisionBIH_TracePoint(model, NULL, NULL, &trace, point, 0, 0, 0);
7168         return trace.startsupercontents;
7169 }
7170
7171 qboolean Mod_CollisionBIH_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end, const vec3_t acceptmins, const vec3_t acceptmaxs)
7172 {
7173         trace_t trace;
7174         Mod_CollisionBIH_TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK, 0, MATERIALFLAGMASK_TRANSLUCENT);
7175         return trace.fraction == 1 || BoxesOverlap(trace.endpos, trace.endpos, acceptmins, acceptmaxs);
7176 }
7177
7178 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)
7179 {
7180 #if 0
7181         // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
7182         vec3_t end;
7183         int hitsupercontents;
7184         VectorSet(end, start[0], start[1], model->normalmins[2]);
7185 #endif
7186         memset(trace, 0, sizeof(*trace));
7187         trace->fraction = 1;
7188         trace->hitsupercontentsmask = hitsupercontentsmask;
7189         trace->skipsupercontentsmask = skipsupercontentsmask;
7190         trace->skipmaterialflagsmask = skipmaterialflagsmask;
7191 #if 0
7192         Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7193         hitsupercontents = trace->hitsupercontents;
7194         memset(trace, 0, sizeof(*trace));
7195         trace->fraction = 1;
7196         trace->hitsupercontentsmask = hitsupercontentsmask;
7197         trace->skipsupercontentsmask = skipsupercontentsmask;
7198         trace->skipmaterialflagsmask = skipmaterialflagsmask;
7199         trace->startsupercontents = hitsupercontents;
7200 #endif
7201 }
7202
7203 int Mod_CollisionBIH_PointSuperContents_Mesh(struct model_s *model, int frame, const vec3_t start)
7204 {
7205 #if 0
7206         // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
7207         trace_t trace;
7208         vec3_t end;
7209         VectorSet(end, start[0], start[1], model->normalmins[2]);
7210         memset(&trace, 0, sizeof(trace));
7211         trace.fraction = 1;
7212         trace.hitsupercontentsmask = hitsupercontentsmask;
7213         trace.skipsupercontentsmask = skipsupercontentsmask;
7214         trace.skipmaterialflagsmask = skipmaterialflagsmask;
7215         Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7216         return trace.hitsupercontents;
7217 #else
7218         return 0;
7219 #endif
7220 }
7221
7222 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)
7223 {
7224         Mod_CollisionBIH_TraceLineShared(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask, &model->render_bih);
7225 }
7226
7227
7228 bih_t *Mod_MakeCollisionBIH(dp_model_t *model, qboolean userendersurfaces, bih_t *out)
7229 {
7230         int j;
7231         int bihnumleafs;
7232         int bihmaxnodes;
7233         int brushindex;
7234         int triangleindex;
7235         int bihleafindex;
7236         int nummodelbrushes = model->nummodelbrushes;
7237         int nummodelsurfaces = model->nummodelsurfaces;
7238         const int *e;
7239         const int *collisionelement3i;
7240         const float *collisionvertex3f;
7241         const int *renderelement3i;
7242         const float *rendervertex3f;
7243         bih_leaf_t *bihleafs;
7244         bih_node_t *bihnodes;
7245         int *temp_leafsort;
7246         int *temp_leafsortscratch;
7247         const msurface_t *surface;
7248         const q3mbrush_t *brush;
7249
7250         // find out how many BIH leaf nodes we need
7251         bihnumleafs = 0;
7252         if (userendersurfaces)
7253         {
7254                 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7255                         bihnumleafs += surface->num_triangles;
7256         }
7257         else
7258         {
7259                 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
7260                         if (brush->colbrushf)
7261                                 bihnumleafs++;
7262                 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7263                 {
7264                         if (surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS)
7265                                 bihnumleafs += surface->num_triangles + surface->num_collisiontriangles;
7266                         else
7267                                 bihnumleafs += surface->num_collisiontriangles;
7268                 }
7269         }
7270
7271         if (!bihnumleafs)
7272                 return NULL;
7273
7274         // allocate the memory for the BIH leaf nodes
7275         bihleafs = (bih_leaf_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_leaf_t) * bihnumleafs);
7276
7277         // now populate the BIH leaf nodes
7278         bihleafindex = 0;
7279
7280         // add render surfaces
7281         renderelement3i = model->surfmesh.data_element3i;
7282         rendervertex3f = model->surfmesh.data_vertex3f;
7283         for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7284         {
7285                 for (triangleindex = 0, e = renderelement3i + 3*surface->num_firsttriangle;triangleindex < surface->num_triangles;triangleindex++, e += 3)
7286                 {
7287                         if (!userendersurfaces && !(surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS))
7288                                 continue;
7289                         bihleafs[bihleafindex].type = BIH_RENDERTRIANGLE;
7290                         bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
7291                         bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
7292                         bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firsttriangle;
7293                         bihleafs[bihleafindex].mins[0] = min(rendervertex3f[3*e[0]+0], min(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) - 1;
7294                         bihleafs[bihleafindex].mins[1] = min(rendervertex3f[3*e[0]+1], min(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) - 1;
7295                         bihleafs[bihleafindex].mins[2] = min(rendervertex3f[3*e[0]+2], min(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) - 1;
7296                         bihleafs[bihleafindex].maxs[0] = max(rendervertex3f[3*e[0]+0], max(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) + 1;
7297                         bihleafs[bihleafindex].maxs[1] = max(rendervertex3f[3*e[0]+1], max(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) + 1;
7298                         bihleafs[bihleafindex].maxs[2] = max(rendervertex3f[3*e[0]+2], max(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) + 1;
7299                         bihleafindex++;
7300                 }
7301         }
7302
7303         if (!userendersurfaces)
7304         {
7305                 // add collision brushes
7306                 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
7307                 {
7308                         if (!brush->colbrushf)
7309                                 continue;
7310                         bihleafs[bihleafindex].type = BIH_BRUSH;
7311                         bihleafs[bihleafindex].textureindex = brush->texture - model->data_textures;
7312                         bihleafs[bihleafindex].surfaceindex = -1;
7313                         bihleafs[bihleafindex].itemindex = brushindex+model->firstmodelbrush;
7314                         VectorCopy(brush->colbrushf->mins, bihleafs[bihleafindex].mins);
7315                         VectorCopy(brush->colbrushf->maxs, bihleafs[bihleafindex].maxs);
7316                         bihleafindex++;
7317                 }
7318
7319                 // add collision surfaces
7320                 collisionelement3i = model->brush.data_collisionelement3i;
7321                 collisionvertex3f = model->brush.data_collisionvertex3f;
7322                 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7323                 {
7324                         for (triangleindex = 0, e = collisionelement3i + 3*surface->num_firstcollisiontriangle;triangleindex < surface->num_collisiontriangles;triangleindex++, e += 3)
7325                         {
7326                                 bihleafs[bihleafindex].type = BIH_COLLISIONTRIANGLE;
7327                                 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
7328                                 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
7329                                 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firstcollisiontriangle;
7330                                 bihleafs[bihleafindex].mins[0] = min(collisionvertex3f[3*e[0]+0], min(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) - 1;
7331                                 bihleafs[bihleafindex].mins[1] = min(collisionvertex3f[3*e[0]+1], min(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) - 1;
7332                                 bihleafs[bihleafindex].mins[2] = min(collisionvertex3f[3*e[0]+2], min(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) - 1;
7333                                 bihleafs[bihleafindex].maxs[0] = max(collisionvertex3f[3*e[0]+0], max(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) + 1;
7334                                 bihleafs[bihleafindex].maxs[1] = max(collisionvertex3f[3*e[0]+1], max(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) + 1;
7335                                 bihleafs[bihleafindex].maxs[2] = max(collisionvertex3f[3*e[0]+2], max(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) + 1;
7336                                 bihleafindex++;
7337                         }
7338                 }
7339         }
7340
7341         // allocate buffers for the produced and temporary data
7342         bihmaxnodes = bihnumleafs + 1;
7343         bihnodes = (bih_node_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_node_t) * bihmaxnodes);
7344         temp_leafsort = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * bihnumleafs * 2);
7345         temp_leafsortscratch = temp_leafsort + bihnumleafs;
7346
7347         // now build it
7348         BIH_Build(out, bihnumleafs, bihleafs, bihmaxnodes, bihnodes, temp_leafsort, temp_leafsortscratch);
7349
7350         // we're done with the temporary data
7351         Mem_Free(temp_leafsort);
7352
7353         // resize the BIH nodes array if it over-allocated
7354         if (out->maxnodes > out->numnodes)
7355         {
7356                 out->maxnodes = out->numnodes;
7357                 out->nodes = (bih_node_t *)Mem_Realloc(loadmodel->mempool, out->nodes, out->numnodes * sizeof(bih_node_t));
7358         }
7359
7360         return out;
7361 }
7362
7363 static int Mod_Q3BSP_SuperContentsFromNativeContents(int nativecontents)
7364 {
7365         int supercontents = 0;
7366         if (nativecontents & CONTENTSQ3_SOLID)
7367                 supercontents |= SUPERCONTENTS_SOLID;
7368         if (nativecontents & CONTENTSQ3_WATER)
7369                 supercontents |= SUPERCONTENTS_WATER;
7370         if (nativecontents & CONTENTSQ3_SLIME)
7371                 supercontents |= SUPERCONTENTS_SLIME;
7372         if (nativecontents & CONTENTSQ3_LAVA)
7373                 supercontents |= SUPERCONTENTS_LAVA;
7374         if (nativecontents & CONTENTSQ3_BODY)
7375                 supercontents |= SUPERCONTENTS_BODY;
7376         if (nativecontents & CONTENTSQ3_CORPSE)
7377                 supercontents |= SUPERCONTENTS_CORPSE;
7378         if (nativecontents & CONTENTSQ3_NODROP)
7379                 supercontents |= SUPERCONTENTS_NODROP;
7380         if (nativecontents & CONTENTSQ3_PLAYERCLIP)
7381                 supercontents |= SUPERCONTENTS_PLAYERCLIP;
7382         if (nativecontents & CONTENTSQ3_MONSTERCLIP)
7383                 supercontents |= SUPERCONTENTS_MONSTERCLIP;
7384         if (nativecontents & CONTENTSQ3_DONOTENTER)
7385                 supercontents |= SUPERCONTENTS_DONOTENTER;
7386         if (nativecontents & CONTENTSQ3_BOTCLIP)
7387                 supercontents |= SUPERCONTENTS_BOTCLIP;
7388         if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
7389                 supercontents |= SUPERCONTENTS_OPAQUE;
7390         return supercontents;
7391 }
7392
7393 static int Mod_Q3BSP_NativeContentsFromSuperContents(int supercontents)
7394 {
7395         int nativecontents = 0;
7396         if (supercontents & SUPERCONTENTS_SOLID)
7397                 nativecontents |= CONTENTSQ3_SOLID;
7398         if (supercontents & SUPERCONTENTS_WATER)
7399                 nativecontents |= CONTENTSQ3_WATER;
7400         if (supercontents & SUPERCONTENTS_SLIME)
7401                 nativecontents |= CONTENTSQ3_SLIME;
7402         if (supercontents & SUPERCONTENTS_LAVA)
7403                 nativecontents |= CONTENTSQ3_LAVA;
7404         if (supercontents & SUPERCONTENTS_BODY)
7405                 nativecontents |= CONTENTSQ3_BODY;
7406         if (supercontents & SUPERCONTENTS_CORPSE)
7407                 nativecontents |= CONTENTSQ3_CORPSE;
7408         if (supercontents & SUPERCONTENTS_NODROP)
7409                 nativecontents |= CONTENTSQ3_NODROP;
7410         if (supercontents & SUPERCONTENTS_PLAYERCLIP)
7411                 nativecontents |= CONTENTSQ3_PLAYERCLIP;
7412         if (supercontents & SUPERCONTENTS_MONSTERCLIP)
7413                 nativecontents |= CONTENTSQ3_MONSTERCLIP;
7414         if (supercontents & SUPERCONTENTS_DONOTENTER)
7415                 nativecontents |= CONTENTSQ3_DONOTENTER;
7416         if (supercontents & SUPERCONTENTS_BOTCLIP)
7417                 nativecontents |= CONTENTSQ3_BOTCLIP;
7418         if (!(supercontents & SUPERCONTENTS_OPAQUE))
7419                 nativecontents |= CONTENTSQ3_TRANSLUCENT;
7420         return nativecontents;
7421 }
7422
7423 static void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
7424 {
7425         int numleafs;
7426         while (node->plane)
7427         {
7428                 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
7429                 node = node->children[1];
7430         }
7431         numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
7432         if (loadmodel->brush.num_leafs < numleafs)
7433                 loadmodel->brush.num_leafs = numleafs;
7434 }
7435
7436 static void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7437 {
7438         int i, j, lumps;
7439         q3dheader_t *header;
7440         float corner[3], yawradius, modelradius;
7441
7442         mod->modeldatatypestring = "Q3BSP";
7443
7444         mod->type = mod_brushq3;
7445         mod->brush.ishlbsp = false;
7446         mod->brush.isbsp2rmqe = false;
7447         mod->brush.isbsp2 = false;
7448         mod->brush.isq2bsp = false;
7449         mod->brush.isq3bsp = true;
7450         mod->brush.skymasking = true;
7451         mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
7452         mod->numskins = 1;
7453
7454         header = (q3dheader_t *)buffer;
7455         if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
7456                 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
7457
7458         i = LittleLong(header->version);
7459         if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
7460                 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
7461
7462         mod->soundfromcenter = true;
7463         mod->TraceBox = Mod_CollisionBIH_TraceBox;
7464         mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
7465         mod->TraceLine = Mod_CollisionBIH_TraceLine;
7466         mod->TracePoint = Mod_CollisionBIH_TracePoint;
7467         mod->PointSuperContents = Mod_CollisionBIH_PointSuperContents;
7468         mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7469         mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
7470         mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
7471         mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
7472         mod->brush.GetPVS = Mod_BSP_GetPVS;
7473         mod->brush.FatPVS = Mod_BSP_FatPVS;
7474         mod->brush.BoxTouchingPVS = Mod_BSP_BoxTouchingPVS;
7475         mod->brush.BoxTouchingLeafPVS = Mod_BSP_BoxTouchingLeafPVS;
7476         mod->brush.BoxTouchingVisibleLeafs = Mod_BSP_BoxTouchingVisibleLeafs;
7477         mod->brush.FindBoxClusters = Mod_BSP_FindBoxClusters;
7478         mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
7479         mod->brush.FindNonSolidLocation = Mod_BSP_FindNonSolidLocation;
7480         mod->brush.AmbientSoundLevelsForPoint = NULL;
7481         mod->brush.RoundUpToHullSize = NULL;
7482         mod->brush.PointInLeaf = Mod_BSP_PointInLeaf;
7483         mod->Draw = R_Mod_Draw;
7484         mod->DrawDepth = R_Mod_DrawDepth;
7485         mod->DrawDebug = R_Mod_DrawDebug;
7486         mod->DrawPrepass = R_Mod_DrawPrepass;
7487         mod->GetLightInfo = R_Mod_GetLightInfo;
7488         mod->CompileShadowMap = R_Mod_CompileShadowMap;
7489         mod->DrawShadowMap = R_Mod_DrawShadowMap;
7490         mod->DrawLight = R_Mod_DrawLight;
7491
7492         mod_base = (unsigned char *)header;
7493
7494         // swap all the lumps
7495         header->ident = LittleLong(header->ident);
7496         header->version = LittleLong(header->version);
7497         lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
7498         for (i = 0;i < lumps;i++)
7499         {
7500                 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
7501                 if((char *) bufferend < (char *) buffer + j)
7502                         Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
7503                 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
7504                 if((char *) bufferend < (char *) buffer + j)
7505                         Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
7506         }
7507         /*
7508          * NO, do NOT clear them!
7509          * they contain actual data referenced by other stuff.
7510          * Instead, before using the advertisements lump, check header->versio
7511          * again!
7512          * Sorry, but otherwise it breaks memory of the first lump.
7513         for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
7514         {
7515                 header->lumps[i].fileofs = 0;
7516                 header->lumps[i].filelen = 0;
7517         }
7518         */
7519
7520         mod->brush.qw_md4sum = 0;
7521         mod->brush.qw_md4sum2 = 0;
7522         for (i = 0;i < lumps;i++)
7523         {
7524                 if (i == Q3LUMP_ENTITIES)
7525                         continue;
7526                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7527                 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
7528                         continue;
7529                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7530
7531                 // all this checksumming can take a while, so let's send keepalives here too
7532                 CL_KeepaliveMessage(false);
7533         }
7534
7535         // allocate a texture pool if we need it
7536         if (mod->texturepool == NULL)
7537                 mod->texturepool = R_AllocTexturePool();
7538
7539         Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
7540         Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
7541         Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
7542         if (header->version == Q3BSPVERSION_IG)
7543                 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
7544         else
7545                 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
7546         Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
7547         Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
7548         Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
7549         Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
7550         Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
7551         Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
7552         Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
7553         Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
7554         Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
7555         Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
7556         Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
7557         Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
7558         Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
7559         loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
7560
7561         // the MakePortals code works fine on the q3bsp data as well
7562         if (mod_bsp_portalize.integer)
7563                 Mod_BSP_MakePortals();
7564
7565         // FIXME: shader alpha should replace r_wateralpha support in q3bsp
7566         loadmodel->brush.supportwateralpha = true;
7567
7568         loadmodel->brush.num_leafs = 0;
7569         Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
7570
7571         if (loadmodel->brush.numsubmodels)
7572                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7573
7574         mod = loadmodel;
7575         for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7576         {
7577                 if (i > 0)
7578                 {
7579                         char name[10];
7580                         // duplicate the basic information
7581                         dpsnprintf(name, sizeof(name), "*%i", i);
7582                         mod = Mod_FindName(name, loadmodel->name);
7583                         // copy the base model to this one
7584                         *mod = *loadmodel;
7585                         // rename the clone back to its proper name
7586                         strlcpy(mod->name, name, sizeof(mod->name));
7587                         mod->brush.parentmodel = loadmodel;
7588                         // textures and memory belong to the main model
7589                         mod->texturepool = NULL;
7590                         mod->mempool = NULL;
7591                         mod->brush.GetPVS = NULL;
7592                         mod->brush.FatPVS = NULL;
7593                         mod->brush.BoxTouchingPVS = NULL;
7594                         mod->brush.BoxTouchingLeafPVS = NULL;
7595                         mod->brush.BoxTouchingVisibleLeafs = NULL;
7596                         mod->brush.FindBoxClusters = NULL;
7597                         mod->brush.LightPoint = NULL;
7598                         mod->brush.AmbientSoundLevelsForPoint = NULL;
7599                 }
7600                 mod->brush.submodel = i;
7601                 if (loadmodel->brush.submodels)
7602                         loadmodel->brush.submodels[i] = mod;
7603
7604                 // make the model surface list (used by shadowing/lighting)
7605                 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
7606                 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
7607                 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
7608                 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
7609                 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
7610                 Mod_MakeSortedSurfaces(mod);
7611
7612                 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
7613                 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
7614                 // enlarge the bounding box to enclose all geometry of this model,
7615                 // because q3map2 sometimes lies (mostly to affect the lightgrid),
7616                 // which can in turn mess up the farclip (as well as culling when
7617                 // outside the level - an unimportant concern)
7618
7619                 //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]);
7620                 for (j = 0;j < mod->nummodelsurfaces;j++)
7621                 {
7622                         const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7623                         const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7624                         int k;
7625                         if (!surface->num_vertices)
7626                                 continue;
7627                         for (k = 0;k < surface->num_vertices;k++, v += 3)
7628                         {
7629                                 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7630                                 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7631                                 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7632                                 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7633                                 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7634                                 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7635                         }
7636                 }
7637                 //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]);
7638                 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7639                 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7640                 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7641                 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7642                 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7643                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7644                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7645                 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7646                 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7647                 mod->yawmins[2] = mod->normalmins[2];
7648                 mod->yawmaxs[2] = mod->normalmaxs[2];
7649                 mod->radius = modelradius;
7650                 mod->radius2 = modelradius * modelradius;
7651
7652                 // this gets altered below if sky or water is used
7653                 mod->DrawSky = NULL;
7654                 mod->DrawAddWaterPlanes = NULL;
7655
7656                 for (j = 0;j < mod->nummodelsurfaces;j++)
7657                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7658                                 break;
7659                 if (j < mod->nummodelsurfaces)
7660                         mod->DrawSky = R_Mod_DrawSky;
7661
7662                 for (j = 0;j < mod->nummodelsurfaces;j++)
7663                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7664                                 break;
7665                 if (j < mod->nummodelsurfaces)
7666                         mod->DrawAddWaterPlanes = R_Mod_DrawAddWaterPlanes;
7667
7668                 Mod_MakeCollisionBIH(mod, false, &mod->collision_bih);
7669                 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
7670
7671                 // generate VBOs and other shared data before cloning submodels
7672                 if (i == 0)
7673                         Mod_BuildVBOs();
7674         }
7675
7676         if (mod_q3bsp_sRGBlightmaps.integer)
7677         {
7678                 if (vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
7679                 {
7680                         // actually we do in sRGB fallback with sRGB lightmaps: Image_sRGBFloatFromLinear_Lightmap(Image_LinearFloatFromsRGBFloat(x))
7681                         // neutral point is at Image_sRGBFloatFromLinearFloat(0.5)
7682                         // so we need to map Image_sRGBFloatFromLinearFloat(0.5) to 0.5
7683                         // factor is 0.5 / Image_sRGBFloatFromLinearFloat(0.5)
7684                         //loadmodel->lightmapscale *= 0.679942f; // fixes neutral level
7685                 }
7686                 else // if this is NOT set, regular rendering looks right by this requirement anyway
7687                 {
7688                         /*
7689                         // we want color 1 to do the same as without sRGB
7690                         // so, we want to map 1 to Image_LinearFloatFromsRGBFloat(2) instead of to 2
7691                         loadmodel->lightmapscale *= 2.476923f; // fixes max level
7692                         */
7693
7694                         // neutral level 0.5 gets uploaded as sRGB and becomes Image_LinearFloatFromsRGBFloat(0.5)
7695                         // we need to undo that
7696                         loadmodel->lightmapscale *= 2.336f; // fixes neutral level
7697                 }
7698         }
7699
7700         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);
7701 }
7702
7703 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7704 {
7705         int i = LittleLong(((int *)buffer)[1]);
7706         if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
7707                 Mod_Q3BSP_Load(mod,buffer, bufferend);
7708         else if (i == Q2BSPVERSION)
7709                 Mod_Q2BSP_Load(mod,buffer, bufferend);
7710         else
7711                 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
7712 }
7713
7714 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7715 {
7716         Host_Error("Mod_MAP_Load: not yet implemented");
7717 }
7718
7719 typedef struct objvertex_s
7720 {
7721         int nextindex;
7722         int submodelindex;
7723         int textureindex;
7724         float v[3];
7725         float vt[2];
7726         float vn[3];
7727 }
7728 objvertex_t;
7729
7730 static unsigned char nobsp_pvs[1] = {1};
7731
7732 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
7733 {
7734         const char *textbase = (char *)buffer, *text = textbase;
7735         char *s;
7736         char *argv[512];
7737         char line[1024];
7738         char materialname[MAX_QPATH];
7739         int i, j, l, numvertices, firstvertex, firsttriangle, elementindex, vertexindex, surfacevertices, surfacetriangles, surfaceelements, submodelindex = 0;
7740         int index1, index2, index3;
7741         objvertex_t vfirst, vprev, vcurrent;
7742         int argc;
7743         int linelen;
7744         int numtriangles = 0;
7745         int maxtriangles = 0;
7746         objvertex_t *vertices = NULL;
7747         int linenumber = 0;
7748         int maxtextures = 0, numtextures = 0, textureindex = 0;
7749         int maxv = 0, numv = 1;
7750         int maxvt = 0, numvt = 1;
7751         int maxvn = 0, numvn = 1;
7752         char *texturenames = NULL;
7753         float dist, modelradius, modelyawradius, yawradius;
7754         float *obj_v = NULL;
7755         float *obj_vt = NULL;
7756         float *obj_vn = NULL;
7757         float mins[3];
7758         float maxs[3];
7759         float corner[3];
7760         objvertex_t *thisvertex = NULL;
7761         int vertexhashindex;
7762         int *vertexhashtable = NULL;
7763         objvertex_t *vertexhashdata = NULL;
7764         objvertex_t *vdata = NULL;
7765         int vertexhashsize = 0;
7766         int vertexhashcount = 0;
7767         skinfile_t *skinfiles = NULL;
7768         unsigned char *data = NULL;
7769         int *submodelfirstsurface;
7770         msurface_t *tempsurface;
7771         msurface_t *tempsurfaces;
7772
7773         memset(&vfirst, 0, sizeof(vfirst));
7774         memset(&vprev, 0, sizeof(vprev));
7775         memset(&vcurrent, 0, sizeof(vcurrent));
7776
7777         dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
7778
7779         loadmodel->modeldatatypestring = "OBJ";
7780
7781         loadmodel->type = mod_obj;
7782         loadmodel->soundfromcenter = true;
7783         loadmodel->TraceBox = Mod_CollisionBIH_TraceBox;
7784         loadmodel->TraceBrush = Mod_CollisionBIH_TraceBrush;
7785         loadmodel->TraceLine = Mod_CollisionBIH_TraceLine;
7786         loadmodel->TracePoint = Mod_CollisionBIH_TracePoint_Mesh;
7787         loadmodel->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7788         loadmodel->PointSuperContents = Mod_CollisionBIH_PointSuperContents_Mesh;
7789         loadmodel->brush.TraceLineOfSight = NULL;
7790         loadmodel->brush.SuperContentsFromNativeContents = NULL;
7791         loadmodel->brush.NativeContentsFromSuperContents = NULL;
7792         loadmodel->brush.GetPVS = NULL;
7793         loadmodel->brush.FatPVS = NULL;
7794         loadmodel->brush.BoxTouchingPVS = NULL;
7795         loadmodel->brush.BoxTouchingLeafPVS = NULL;
7796         loadmodel->brush.BoxTouchingVisibleLeafs = NULL;
7797         loadmodel->brush.FindBoxClusters = NULL;
7798         loadmodel->brush.LightPoint = NULL;
7799         loadmodel->brush.FindNonSolidLocation = NULL;
7800         loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
7801         loadmodel->brush.RoundUpToHullSize = NULL;
7802         loadmodel->brush.PointInLeaf = NULL;
7803         loadmodel->Draw = R_Mod_Draw;
7804         loadmodel->DrawDepth = R_Mod_DrawDepth;
7805         loadmodel->DrawDebug = R_Mod_DrawDebug;
7806         loadmodel->DrawPrepass = R_Mod_DrawPrepass;
7807         loadmodel->GetLightInfo = R_Mod_GetLightInfo;
7808         loadmodel->CompileShadowMap = R_Mod_CompileShadowMap;
7809         loadmodel->DrawShadowMap = R_Mod_DrawShadowMap;
7810         loadmodel->DrawLight = R_Mod_DrawLight;
7811
7812         skinfiles = Mod_LoadSkinFiles();
7813         if (loadmodel->numskins < 1)
7814                 loadmodel->numskins = 1;
7815
7816         // make skinscenes for the skins (no groups)
7817         loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
7818         for (i = 0;i < loadmodel->numskins;i++)
7819         {
7820                 loadmodel->skinscenes[i].firstframe = i;
7821                 loadmodel->skinscenes[i].framecount = 1;
7822                 loadmodel->skinscenes[i].loop = true;
7823                 loadmodel->skinscenes[i].framerate = 10;
7824         }
7825
7826         VectorClear(mins);
7827         VectorClear(maxs);
7828
7829         // we always have model 0, i.e. the first "submodel"
7830         loadmodel->brush.numsubmodels = 1;
7831
7832         // parse the OBJ text now
7833         for(;;)
7834         {
7835                 static char emptyarg[1] = "";
7836                 if (!*text)
7837                         break;
7838                 linenumber++;
7839                 linelen = 0;
7840                 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
7841                         line[linelen] = text[linelen];
7842                 line[linelen] = 0;
7843                 for (argc = 0;argc < 4;argc++)
7844                         argv[argc] = emptyarg;
7845                 argc = 0;
7846                 s = line;
7847                 while (*s == ' ' || *s == '\t')
7848                         s++;
7849                 while (*s)
7850                 {
7851                         argv[argc++] = s;
7852                         while (*s > ' ')
7853                                 s++;
7854                         if (!*s)
7855                                 break;
7856                         *s++ = 0;
7857                         while (*s == ' ' || *s == '\t')
7858                                 s++;
7859                 }
7860                 text += linelen;
7861                 if (*text == '\r')
7862                         text++;
7863                 if (*text == '\n')
7864                         text++;
7865                 if (!argc)
7866                         continue;
7867                 if (argv[0][0] == '#')
7868                         continue;
7869                 if (!strcmp(argv[0], "v"))
7870                 {
7871                         if (maxv <= numv)
7872                         {
7873                                 maxv = max(maxv * 2, 1024);
7874                                 obj_v = (float *)Mem_Realloc(tempmempool, obj_v, maxv * sizeof(float[3]));
7875                         }
7876                         if(mod_obj_orientation.integer)
7877                         {
7878                                 obj_v[numv*3+0] = atof(argv[1]);
7879                                 obj_v[numv*3+2] = atof(argv[2]);
7880                                 obj_v[numv*3+1] = atof(argv[3]);
7881                         }
7882                         else
7883                         {
7884                                 obj_v[numv*3+0] = atof(argv[1]);
7885                                 obj_v[numv*3+1] = atof(argv[2]);
7886                                 obj_v[numv*3+2] = atof(argv[3]);
7887                         }
7888                         numv++;
7889                 }
7890                 else if (!strcmp(argv[0], "vt"))
7891                 {
7892                         if (maxvt <= numvt)
7893                         {
7894                                 maxvt = max(maxvt * 2, 1024);
7895                                 obj_vt = (float *)Mem_Realloc(tempmempool, obj_vt, maxvt * sizeof(float[2]));
7896                         }
7897                         obj_vt[numvt*2+0] = atof(argv[1]);
7898                         obj_vt[numvt*2+1] = 1-atof(argv[2]);
7899                         numvt++;
7900                 }
7901                 else if (!strcmp(argv[0], "vn"))
7902                 {
7903                         if (maxvn <= numvn)
7904                         {
7905                                 maxvn = max(maxvn * 2, 1024);
7906                                 obj_vn = (float *)Mem_Realloc(tempmempool, obj_vn, maxvn * sizeof(float[3]));
7907                         }
7908                         if(mod_obj_orientation.integer)
7909                         {
7910                                 obj_vn[numvn*3+0] = atof(argv[1]);
7911                                 obj_vn[numvn*3+2] = atof(argv[2]);
7912                                 obj_vn[numvn*3+1] = atof(argv[3]);
7913                         }
7914                         else
7915                         {
7916                                 obj_vn[numvn*3+0] = atof(argv[1]);
7917                                 obj_vn[numvn*3+1] = atof(argv[2]);
7918                                 obj_vn[numvn*3+2] = atof(argv[3]);
7919                         }
7920                         numvn++;
7921                 }
7922                 else if (!strcmp(argv[0], "f"))
7923                 {
7924                         if (!numtextures)
7925                         {
7926                                 if (maxtextures <= numtextures)
7927                                 {
7928                                         maxtextures = max(maxtextures * 2, 256);
7929                                         texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7930                                 }
7931                                 textureindex = numtextures++;
7932                                 strlcpy(texturenames + textureindex*MAX_QPATH, loadmodel->name, MAX_QPATH);
7933                         }
7934                         for (j = 1;j < argc;j++)
7935                         {
7936                                 index1 = atoi(argv[j]);
7937                                 while(argv[j][0] && argv[j][0] != '/')
7938                                         argv[j]++;
7939                                 if (argv[j][0])
7940                                         argv[j]++;
7941                                 index2 = atoi(argv[j]);
7942                                 while(argv[j][0] && argv[j][0] != '/')
7943                                         argv[j]++;
7944                                 if (argv[j][0])
7945                                         argv[j]++;
7946                                 index3 = atoi(argv[j]);
7947                                 // negative refers to a recent vertex
7948                                 // zero means not specified
7949                                 // positive means an absolute vertex index
7950                                 if (index1 < 0)
7951                                         index1 = numv - index1;
7952                                 if (index2 < 0)
7953                                         index2 = numvt - index2;
7954                                 if (index3 < 0)
7955                                         index3 = numvn - index3;
7956                                 vcurrent.nextindex = -1;
7957                                 vcurrent.textureindex = textureindex;
7958                                 vcurrent.submodelindex = submodelindex;
7959                                 if (obj_v && index1 >= 0 && index1 < numv)
7960                                         VectorCopy(obj_v + 3*index1, vcurrent.v);
7961                                 if (obj_vt && index2 >= 0 && index2 < numvt)
7962                                         Vector2Copy(obj_vt + 2*index2, vcurrent.vt);
7963                                 if (obj_vn && index3 >= 0 && index3 < numvn)
7964                                         VectorCopy(obj_vn + 3*index3, vcurrent.vn);
7965                                 if (numtriangles == 0)
7966                                 {
7967                                         VectorCopy(vcurrent.v, mins);
7968                                         VectorCopy(vcurrent.v, maxs);
7969                                 }
7970                                 else
7971                                 {
7972                                         mins[0] = min(mins[0], vcurrent.v[0]);
7973                                         mins[1] = min(mins[1], vcurrent.v[1]);
7974                                         mins[2] = min(mins[2], vcurrent.v[2]);
7975                                         maxs[0] = max(maxs[0], vcurrent.v[0]);
7976                                         maxs[1] = max(maxs[1], vcurrent.v[1]);
7977                                         maxs[2] = max(maxs[2], vcurrent.v[2]);
7978                                 }
7979                                 if (j == 1)
7980                                         vfirst = vcurrent;
7981                                 else if (j >= 3)
7982                                 {
7983                                         if (maxtriangles <= numtriangles)
7984                                         {
7985                                                 maxtriangles = max(maxtriangles * 2, 32768);
7986                                                 vertices = (objvertex_t*)Mem_Realloc(loadmodel->mempool, vertices, maxtriangles * sizeof(objvertex_t[3]));
7987                                         }
7988                                         if(mod_obj_orientation.integer)
7989                                         {
7990                                                 vertices[numtriangles*3+0] = vfirst;
7991                                                 vertices[numtriangles*3+1] = vprev;
7992                                                 vertices[numtriangles*3+2] = vcurrent;
7993                                         }
7994                                         else
7995                                         {
7996                                                 vertices[numtriangles*3+0] = vfirst;
7997                                                 vertices[numtriangles*3+2] = vprev;
7998                                                 vertices[numtriangles*3+1] = vcurrent;
7999                                         }
8000                                         numtriangles++;
8001                                 }
8002                                 vprev = vcurrent;
8003                         }
8004                 }
8005                 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
8006                 {
8007                         submodelindex = atof(argv[1]);
8008                         loadmodel->brush.numsubmodels = max(submodelindex + 1, loadmodel->brush.numsubmodels);
8009                 }
8010                 else if (!strcmp(argv[0], "usemtl"))
8011                 {
8012                         for (i = 0;i < numtextures;i++)
8013                                 if (!strcmp(texturenames+i*MAX_QPATH, argv[1]))
8014                                         break;
8015                         if (i < numtextures)
8016                                 textureindex = i;
8017                         else
8018                         {
8019                                 if (maxtextures <= numtextures)
8020                                 {
8021                                         maxtextures = max(maxtextures * 2, 256);
8022                                         texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
8023                                 }
8024                                 textureindex = numtextures++;
8025                                 strlcpy(texturenames + textureindex*MAX_QPATH, argv[1], MAX_QPATH);
8026                         }
8027                 }
8028         }
8029
8030         // now that we have the OBJ data loaded as-is, we can convert it
8031
8032         // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
8033         VectorCopy(mins, loadmodel->normalmins);
8034         VectorCopy(maxs, loadmodel->normalmaxs);
8035         dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
8036         modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
8037         modelyawradius = dist*dist+modelyawradius*modelyawradius;
8038         modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
8039         modelradius = modelyawradius + modelradius * modelradius;
8040         modelyawradius = sqrt(modelyawradius);
8041         modelradius = sqrt(modelradius);
8042         loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
8043         loadmodel->yawmins[2] = loadmodel->normalmins[2];
8044         loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] =  modelyawradius;
8045         loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
8046         loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
8047         loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] =  modelradius;
8048         loadmodel->radius = modelradius;
8049         loadmodel->radius2 = modelradius * modelradius;
8050
8051         // allocate storage for triangles
8052         loadmodel->surfmesh.data_element3i = (int *)Mem_Alloc(loadmodel->mempool, numtriangles * sizeof(int[3]));
8053         // allocate vertex hash structures to build an optimal vertex subset
8054         vertexhashsize = numtriangles*2;
8055         vertexhashtable = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * vertexhashsize);
8056         memset(vertexhashtable, 0xFF, sizeof(int) * vertexhashsize);
8057         vertexhashdata = (objvertex_t *)Mem_Alloc(loadmodel->mempool, sizeof(*vertexhashdata) * numtriangles*3);
8058         vertexhashcount = 0;
8059
8060         // gather surface stats for assigning vertex/triangle ranges
8061         firstvertex = 0;
8062         firsttriangle = 0;
8063         elementindex = 0;
8064         loadmodel->num_surfaces = 0;
8065         // allocate storage for the worst case number of surfaces, later we resize
8066         tempsurfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, numtextures * loadmodel->brush.numsubmodels * sizeof(msurface_t));
8067         submodelfirstsurface = (int *)Mem_Alloc(loadmodel->mempool, (loadmodel->brush.numsubmodels+1) * sizeof(int));
8068         tempsurface = tempsurfaces;
8069         for (submodelindex = 0;submodelindex < loadmodel->brush.numsubmodels;submodelindex++)
8070         {
8071                 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
8072                 for (textureindex = 0;textureindex < numtextures;textureindex++)
8073                 {
8074                         for (vertexindex = 0;vertexindex < numtriangles*3;vertexindex++)
8075                         {
8076                                 thisvertex = vertices + vertexindex;
8077                                 if (thisvertex->submodelindex == submodelindex && thisvertex->textureindex == textureindex)
8078                                         break;
8079                         }
8080                         // skip the surface creation if there are no triangles for it
8081                         if (vertexindex == numtriangles*3)
8082                                 continue;
8083                         // create a surface for these vertices
8084                         surfacevertices = 0;
8085                         surfaceelements = 0;
8086                         // we hack in a texture index in the surface to be fixed up later...
8087                         tempsurface->texture = (texture_t *)((size_t)textureindex);
8088                         // calculate bounds as we go
8089                         VectorCopy(thisvertex->v, tempsurface->mins);
8090                         VectorCopy(thisvertex->v, tempsurface->maxs);
8091                         for (;vertexindex < numtriangles*3;vertexindex++)
8092                         {
8093                                 thisvertex = vertices + vertexindex;
8094                                 if (thisvertex->submodelindex != submodelindex)
8095                                         continue;
8096                                 if (thisvertex->textureindex != textureindex)
8097                                         continue;
8098                                 // add vertex to surface bounds
8099                                 tempsurface->mins[0] = min(tempsurface->mins[0], thisvertex->v[0]);
8100                                 tempsurface->mins[1] = min(tempsurface->mins[1], thisvertex->v[1]);
8101                                 tempsurface->mins[2] = min(tempsurface->mins[2], thisvertex->v[2]);
8102                                 tempsurface->maxs[0] = max(tempsurface->maxs[0], thisvertex->v[0]);
8103                                 tempsurface->maxs[1] = max(tempsurface->maxs[1], thisvertex->v[1]);
8104                                 tempsurface->maxs[2] = max(tempsurface->maxs[2], thisvertex->v[2]);
8105                                 // add the vertex if it is not found in the merged set, and
8106                                 // get its index (triangle element) for the surface
8107                                 vertexhashindex = (unsigned int)(thisvertex->v[0] * 3571 + thisvertex->v[0] * 1777 + thisvertex->v[0] * 457) % (unsigned int)vertexhashsize;
8108                                 for (i = vertexhashtable[vertexhashindex];i >= 0;i = vertexhashdata[i].nextindex)
8109                                 {
8110                                         vdata = vertexhashdata + i;
8111                                         if (vdata->submodelindex == thisvertex->submodelindex && vdata->textureindex == thisvertex->textureindex && VectorCompare(thisvertex->v, vdata->v) && VectorCompare(thisvertex->vn, vdata->vn) && Vector2Compare(thisvertex->vt, vdata->vt))
8112                                                 break;
8113                                 }
8114                                 if (i < 0)
8115                                 {
8116                                         i = vertexhashcount++;
8117                                         vdata = vertexhashdata + i;
8118                                         *vdata = *thisvertex;
8119                                         vdata->nextindex = vertexhashtable[vertexhashindex];
8120                                         vertexhashtable[vertexhashindex] = i;
8121                                         surfacevertices++;
8122                                 }
8123                                 loadmodel->surfmesh.data_element3i[elementindex++] = i;
8124                                 surfaceelements++;
8125                         }
8126                         surfacetriangles = surfaceelements / 3;
8127                         tempsurface->num_vertices = surfacevertices;
8128                         tempsurface->num_triangles = surfacetriangles;
8129                         tempsurface->num_firstvertex = firstvertex;
8130                         tempsurface->num_firsttriangle = firsttriangle;
8131                         firstvertex += tempsurface->num_vertices;
8132                         firsttriangle += tempsurface->num_triangles;
8133                         tempsurface++;
8134                         loadmodel->num_surfaces++;
8135                 }
8136         }
8137         submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
8138         numvertices = firstvertex;
8139         loadmodel->data_surfaces = (msurface_t *)Mem_Realloc(loadmodel->mempool, tempsurfaces, loadmodel->num_surfaces * sizeof(msurface_t));
8140         tempsurfaces = NULL;
8141
8142         // allocate storage for final mesh data
8143         loadmodel->num_textures = numtextures * loadmodel->numskins;
8144         loadmodel->num_texturesperskin = numtextures;
8145         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 *));
8146         loadmodel->brush.submodels = (dp_model_t **)data;data += loadmodel->brush.numsubmodels * sizeof(dp_model_t *);
8147         loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
8148         loadmodel->data_textures = (texture_t *)data;data += loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t);
8149         loadmodel->surfmesh.num_vertices = numvertices;
8150         loadmodel->surfmesh.num_triangles = numtriangles;
8151         loadmodel->surfmesh.data_vertex3f = (float *)data;data += numvertices * sizeof(float[3]);
8152         loadmodel->surfmesh.data_svector3f = (float *)data;data += numvertices * sizeof(float[3]);
8153         loadmodel->surfmesh.data_tvector3f = (float *)data;data += numvertices * sizeof(float[3]);
8154         loadmodel->surfmesh.data_normal3f = (float *)data;data += numvertices * sizeof(float[3]);
8155         loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += numvertices * sizeof(float[2]);
8156
8157         if (loadmodel->surfmesh.num_vertices <= 65536) {
8158                 loadmodel->surfmesh.data_element3s = (unsigned short *)data;data += loadmodel->surfmesh.num_triangles * sizeof(unsigned short[3]);
8159         }
8160
8161         for (j = 0;j < loadmodel->surfmesh.num_vertices;j++)
8162         {
8163                 VectorCopy(vertexhashdata[j].v, loadmodel->surfmesh.data_vertex3f + 3*j);
8164                 VectorCopy(vertexhashdata[j].vn, loadmodel->surfmesh.data_normal3f + 3*j);
8165                 Vector2Copy(vertexhashdata[j].vt, loadmodel->surfmesh.data_texcoordtexture2f + 2*j);
8166         }
8167
8168         // load the textures
8169         for (textureindex = 0;textureindex < numtextures;textureindex++)
8170                 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures + textureindex, skinfiles, texturenames + textureindex*MAX_QPATH, texturenames + textureindex*MAX_QPATH);
8171         Mod_FreeSkinFiles(skinfiles);
8172
8173         // set the surface textures to their real values now that we loaded them...
8174         for (i = 0;i < loadmodel->num_surfaces;i++)
8175                 loadmodel->data_surfaces[i].texture = loadmodel->data_textures + (size_t)loadmodel->data_surfaces[i].texture;
8176
8177         // free data
8178         Mem_Free(vertices);
8179         Mem_Free(texturenames);
8180         Mem_Free(obj_v);
8181         Mem_Free(obj_vt);
8182         Mem_Free(obj_vn);
8183         Mem_Free(vertexhashtable);
8184         Mem_Free(vertexhashdata);
8185
8186         // compute all the mesh information that was not loaded from the file
8187         if (loadmodel->surfmesh.data_element3s)
8188                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
8189                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
8190         Mod_ValidateElements(loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.data_element3s, loadmodel->surfmesh.num_triangles, 0, loadmodel->surfmesh.num_vertices, __FILE__, __LINE__);
8191         // generate normals if the file did not have them
8192         if (!VectorLength2(loadmodel->surfmesh.data_normal3f))
8193                 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);
8194         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);
8195
8196         // if this is a worldmodel and has no BSP tree, create a fake one for the purpose
8197         loadmodel->brush.num_visleafs = 1;
8198         loadmodel->brush.num_leafs = 1;
8199         loadmodel->brush.num_nodes = 0;
8200         loadmodel->brush.num_leafsurfaces = loadmodel->num_surfaces;
8201         loadmodel->brush.data_leafs = (mleaf_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
8202         loadmodel->brush.data_nodes = (mnode_t *)loadmodel->brush.data_leafs;
8203         loadmodel->brush.num_pvsclusters = 1;
8204         loadmodel->brush.num_pvsclusterbytes = 1;
8205         loadmodel->brush.data_pvsclusters = nobsp_pvs;
8206         //if (loadmodel->num_nodes) loadmodel->data_nodes = (mnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_nodes * sizeof(mnode_t));
8207         //loadmodel->data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->num_leafsurfaces * sizeof(int));
8208         loadmodel->brush.data_leafsurfaces = loadmodel->sortedmodelsurfaces;
8209         VectorCopy(loadmodel->normalmins, loadmodel->brush.data_leafs->mins);
8210         VectorCopy(loadmodel->normalmaxs, loadmodel->brush.data_leafs->maxs);
8211         loadmodel->brush.data_leafs->combinedsupercontents = 0; // FIXME?
8212         loadmodel->brush.data_leafs->clusterindex = 0;
8213         loadmodel->brush.data_leafs->areaindex = 0;
8214         loadmodel->brush.data_leafs->numleafsurfaces = loadmodel->brush.num_leafsurfaces;
8215         loadmodel->brush.data_leafs->firstleafsurface = loadmodel->brush.data_leafsurfaces;
8216         loadmodel->brush.data_leafs->numleafbrushes = 0;
8217         loadmodel->brush.data_leafs->firstleafbrush = NULL;
8218         loadmodel->brush.supportwateralpha = true;
8219
8220         if (loadmodel->brush.numsubmodels)
8221                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
8222
8223         mod = loadmodel;
8224         for (i = 0;i < loadmodel->brush.numsubmodels;i++)
8225         {
8226                 if (i > 0)
8227                 {
8228                         char name[10];
8229                         // duplicate the basic information
8230                         dpsnprintf(name, sizeof(name), "*%i", i);
8231                         mod = Mod_FindName(name, loadmodel->name);
8232                         // copy the base model to this one
8233                         *mod = *loadmodel;
8234                         // rename the clone back to its proper name
8235                         strlcpy(mod->name, name, sizeof(mod->name));
8236                         mod->brush.parentmodel = loadmodel;
8237                         // textures and memory belong to the main model
8238                         mod->texturepool = NULL;
8239                         mod->mempool = NULL;
8240                         mod->brush.GetPVS = NULL;
8241                         mod->brush.FatPVS = NULL;
8242                         mod->brush.BoxTouchingPVS = NULL;
8243                         mod->brush.BoxTouchingLeafPVS = NULL;
8244                         mod->brush.BoxTouchingVisibleLeafs = NULL;
8245                         mod->brush.FindBoxClusters = NULL;
8246                         mod->brush.LightPoint = NULL;
8247                         mod->brush.AmbientSoundLevelsForPoint = NULL;
8248                 }
8249                 mod->brush.submodel = i;
8250                 if (loadmodel->brush.submodels)
8251                         loadmodel->brush.submodels[i] = mod;
8252
8253                 // make the model surface list (used by shadowing/lighting)
8254                 mod->firstmodelsurface = submodelfirstsurface[i];
8255                 mod->nummodelsurfaces = submodelfirstsurface[i+1] - submodelfirstsurface[i];
8256                 mod->firstmodelbrush = 0;
8257                 mod->nummodelbrushes = 0;
8258                 mod->sortedmodelsurfaces = loadmodel->sortedmodelsurfaces + mod->firstmodelsurface;
8259                 Mod_MakeSortedSurfaces(mod);
8260
8261                 VectorClear(mod->normalmins);
8262                 VectorClear(mod->normalmaxs);
8263                 l = false;
8264                 for (j = 0;j < mod->nummodelsurfaces;j++)
8265                 {
8266                         const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
8267                         const float *v3f = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
8268                         int k;
8269                         if (!surface->num_vertices)
8270                                 continue;
8271                         if (!l)
8272                         {
8273                                 l = true;
8274                                 VectorCopy(v3f, mod->normalmins);
8275                                 VectorCopy(v3f, mod->normalmaxs);
8276                         }
8277                         for (k = 0;k < surface->num_vertices;k++, v3f += 3)
8278                         {
8279                                 mod->normalmins[0] = min(mod->normalmins[0], v3f[0]);
8280                                 mod->normalmins[1] = min(mod->normalmins[1], v3f[1]);
8281                                 mod->normalmins[2] = min(mod->normalmins[2], v3f[2]);
8282                                 mod->normalmaxs[0] = max(mod->normalmaxs[0], v3f[0]);
8283                                 mod->normalmaxs[1] = max(mod->normalmaxs[1], v3f[1]);
8284                                 mod->normalmaxs[2] = max(mod->normalmaxs[2], v3f[2]);
8285                         }
8286                 }
8287                 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
8288                 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
8289                 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
8290                 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
8291                 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
8292                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
8293                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
8294                 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
8295                 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
8296                 mod->yawmins[2] = mod->normalmins[2];
8297                 mod->yawmaxs[2] = mod->normalmaxs[2];
8298                 mod->radius = modelradius;
8299                 mod->radius2 = modelradius * modelradius;
8300
8301                 // this gets altered below if sky or water is used
8302                 mod->DrawSky = NULL;
8303                 mod->DrawAddWaterPlanes = NULL;
8304
8305                 for (j = 0;j < mod->nummodelsurfaces;j++)
8306                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
8307                                 break;
8308                 if (j < mod->nummodelsurfaces)
8309                         mod->DrawSky = R_Mod_DrawSky;
8310
8311                 for (j = 0;j < mod->nummodelsurfaces;j++)
8312                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
8313                                 break;
8314                 if (j < mod->nummodelsurfaces)
8315                         mod->DrawAddWaterPlanes = R_Mod_DrawAddWaterPlanes;
8316
8317                 Mod_MakeCollisionBIH(mod, true, &mod->collision_bih);
8318                 mod->render_bih = mod->collision_bih;
8319
8320                 // generate VBOs and other shared data before cloning submodels
8321                 if (i == 0)
8322                         Mod_BuildVBOs();
8323         }
8324         mod = loadmodel;
8325         Mem_Free(submodelfirstsurface);
8326
8327         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);
8328 }