model_brush.c

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