model_brush.c

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