model_brush.c

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