model_brush.c

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