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 r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
  31 cvar_t r_picmipworld = {CVAR_SAVE, "r_picmipworld", "1", "whether gl_picmip shall apply to world textures too"};
  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 mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
  42 cvar_t mod_q3bsp_curves_collisions_stride = {0, "mod_q3bsp_curves_collisions_stride", "32", "collisions against curves: optimize performance by doing a combined collision check for this triangle amount first"};
  43 cvar_t mod_q3bsp_curves_stride = {0, "mod_q3bsp_curves_stride", "32", "particle effect collisions against curves: optimize performance by doing a combined collision check for this triangle amount first"};
  44 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
  45 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
  46 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, ..."};
  47 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)"};
  48
  49 static texture_t mod_q1bsp_texture_solid;
  50 static texture_t mod_q1bsp_texture_sky;
  51 static texture_t mod_q1bsp_texture_lava;
  52 static texture_t mod_q1bsp_texture_slime;
  53 static texture_t mod_q1bsp_texture_water;
  54
  55 void Mod_BrushInit(void)
  56 {
  57 //      Cvar_RegisterVariable(&r_subdivide_size);
  58         Cvar_RegisterVariable(&r_novis);
  59         Cvar_RegisterVariable(&r_picmipworld);
  60         Cvar_RegisterVariable(&r_nosurftextures);
  61         Cvar_RegisterVariable(&r_subdivisions_tolerance);
  62         Cvar_RegisterVariable(&r_subdivisions_mintess);
  63         Cvar_RegisterVariable(&r_subdivisions_maxtess);
  64         Cvar_RegisterVariable(&r_subdivisions_maxvertices);
  65         Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
  66         Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
  67         Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
  68         Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
  69         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
  70         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
  71         Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
  72         Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
  73         Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
  74         Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
  75         Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
  76
  77         memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
  78         strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
  79         mod_q1bsp_texture_solid.surfaceflags = 0;
  80         mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
  81
  82         mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
  83         strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
  84         mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
  85         mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
  86
  87         mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
  88         strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
  89         mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
  90         mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
  91
  92         mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
  93         strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
  94         mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
  95         mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
  96
  97         mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
  98         strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
  99         mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
 100         mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
 101 }
 102
 103 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
 104 {
 105         mnode_t *node;
 106
 107         if (model == NULL)
 108                 return NULL;
 109
 110         // LordHavoc: modified to start at first clip node,
 111         // in other words: first node of the (sub)model
 112         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 113         while (node->plane)
 114                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
 115
 116         return (mleaf_t *)node;
 117 }
 118
 119 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
 120 {
 121         int i;
 122         mleaf_t *leaf;
 123         leaf = Mod_Q1BSP_PointInLeaf(model, p);
 124         if (leaf)
 125         {
 126                 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
 127                 if (i)
 128                 {
 129                         memcpy(out, leaf->ambient_sound_level, i);
 130                         out += i;
 131                         outsize -= i;
 132                 }
 133         }
 134         if (outsize)
 135                 memset(out, 0, outsize);
 136 }
 137
 138 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
 139 {
 140         int numclusters = 0;
 141         int nodestackindex = 0;
 142         mnode_t *node, *nodestack[1024];
 143         if (!model->brush.num_pvsclusters)
 144                 return -1;
 145         node = model->brush.data_nodes;
 146         for (;;)
 147         {
 148 #if 1
 149                 if (node->plane)
 150                 {
 151                         // node - recurse down the BSP tree
 152                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 153                         if (sides < 3)
 154                         {
 155                                 if (sides == 0)
 156                                         return -1; // ERROR: NAN bounding box!
 157                                 // box is on one side of plane, take that path
 158                                 node = node->children[sides-1];
 159                         }
 160                         else
 161                         {
 162                                 // box crosses plane, take one path and remember the other
 163                                 if (nodestackindex < 1024)
 164                                         nodestack[nodestackindex++] = node->children[0];
 165                                 node = node->children[1];
 166                         }
 167                         continue;
 168                 }
 169                 else
 170                 {
 171                         // leaf - add clusterindex to list
 172                         if (numclusters < maxclusters)
 173                                 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
 174                         numclusters++;
 175                 }
 176 #else
 177                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 178                 {
 179                         if (node->plane)
 180                         {
 181                                 if (nodestackindex < 1024)
 182                                         nodestack[nodestackindex++] = node->children[0];
 183                                 node = node->children[1];
 184                                 continue;
 185                         }
 186                         else
 187                         {
 188                                 // leaf - add clusterindex to list
 189                                 if (numclusters < maxclusters)
 190                                         clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
 191                                 numclusters++;
 192                         }
 193                 }
 194 #endif
 195                 // try another path we didn't take earlier
 196                 if (nodestackindex == 0)
 197                         break;
 198                 node = nodestack[--nodestackindex];
 199         }
 200         // return number of clusters found (even if more than the maxclusters)
 201         return numclusters;
 202 }
 203
 204 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
 205 {
 206         int nodestackindex = 0;
 207         mnode_t *node, *nodestack[1024];
 208         if (!model->brush.num_pvsclusters)
 209                 return true;
 210         node = model->brush.data_nodes;
 211         for (;;)
 212         {
 213 #if 1
 214                 if (node->plane)
 215                 {
 216                         // node - recurse down the BSP tree
 217                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 218                         if (sides < 3)
 219                         {
 220                                 if (sides == 0)
 221                                         return -1; // ERROR: NAN bounding box!
 222                                 // box is on one side of plane, take that path
 223                                 node = node->children[sides-1];
 224                         }
 225                         else
 226                         {
 227                                 // box crosses plane, take one path and remember the other
 228                                 if (nodestackindex < 1024)
 229                                         nodestack[nodestackindex++] = node->children[0];
 230                                 node = node->children[1];
 231                         }
 232                         continue;
 233                 }
 234                 else
 235                 {
 236                         // leaf - check cluster bit
 237                         int clusterindex = ((mleaf_t *)node)->clusterindex;
 238                         if (CHECKPVSBIT(pvs, clusterindex))
 239                         {
 240                                 // it is visible, return immediately with the news
 241                                 return true;
 242                         }
 243                 }
 244 #else
 245                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 246                 {
 247                         if (node->plane)
 248                         {
 249                                 if (nodestackindex < 1024)
 250                                         nodestack[nodestackindex++] = node->children[0];
 251                                 node = node->children[1];
 252                                 continue;
 253                         }
 254                         else
 255                         {
 256                                 // leaf - check cluster bit
 257                                 int clusterindex = ((mleaf_t *)node)->clusterindex;
 258                                 if (CHECKPVSBIT(pvs, clusterindex))
 259                                 {
 260                                         // it is visible, return immediately with the news
 261                                         return true;
 262                                 }
 263                         }
 264                 }
 265 #endif
 266                 // nothing to see here, try another path we didn't take earlier
 267                 if (nodestackindex == 0)
 268                         break;
 269                 node = nodestack[--nodestackindex];
 270         }
 271         // it is not visible
 272         return false;
 273 }
 274
 275 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
 276 {
 277         int nodestackindex = 0;
 278         mnode_t *node, *nodestack[1024];
 279         if (!model->brush.num_leafs)
 280                 return true;
 281         node = model->brush.data_nodes;
 282         for (;;)
 283         {
 284 #if 1
 285                 if (node->plane)
 286                 {
 287                         // node - recurse down the BSP tree
 288                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 289                         if (sides < 3)
 290                         {
 291                                 if (sides == 0)
 292                                         return -1; // ERROR: NAN bounding box!
 293                                 // box is on one side of plane, take that path
 294                                 node = node->children[sides-1];
 295                         }
 296                         else
 297                         {
 298                                 // box crosses plane, take one path and remember the other
 299                                 if (nodestackindex < 1024)
 300                                         nodestack[nodestackindex++] = node->children[0];
 301                                 node = node->children[1];
 302                         }
 303                         continue;
 304                 }
 305                 else
 306                 {
 307                         // leaf - check cluster bit
 308                         int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
 309                         if (CHECKPVSBIT(pvs, clusterindex))
 310                         {
 311                                 // it is visible, return immediately with the news
 312                                 return true;
 313                         }
 314                 }
 315 #else
 316                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 317                 {
 318                         if (node->plane)
 319                         {
 320                                 if (nodestackindex < 1024)
 321                                         nodestack[nodestackindex++] = node->children[0];
 322                                 node = node->children[1];
 323                                 continue;
 324                         }
 325                         else
 326                         {
 327                                 // leaf - check cluster bit
 328                                 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
 329                                 if (CHECKPVSBIT(pvs, clusterindex))
 330                                 {
 331                                         // it is visible, return immediately with the news
 332                                         return true;
 333                                 }
 334                         }
 335                 }
 336 #endif
 337                 // nothing to see here, try another path we didn't take earlier
 338                 if (nodestackindex == 0)
 339                         break;
 340                 node = nodestack[--nodestackindex];
 341         }
 342         // it is not visible
 343         return false;
 344 }
 345
 346 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
 347 {
 348         int nodestackindex = 0;
 349         mnode_t *node, *nodestack[1024];
 350         if (!model->brush.num_leafs)
 351                 return true;
 352         node = model->brush.data_nodes;
 353         for (;;)
 354         {
 355 #if 1
 356                 if (node->plane)
 357                 {
 358                         // node - recurse down the BSP tree
 359                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 360                         if (sides < 3)
 361                         {
 362                                 if (sides == 0)
 363                                         return -1; // ERROR: NAN bounding box!
 364                                 // box is on one side of plane, take that path
 365                                 node = node->children[sides-1];
 366                         }
 367                         else
 368                         {
 369                                 // box crosses plane, take one path and remember the other
 370                                 if (nodestackindex < 1024)
 371                                         nodestack[nodestackindex++] = node->children[0];
 372                                 node = node->children[1];
 373                         }
 374                         continue;
 375                 }
 376                 else
 377                 {
 378                         // leaf - check if it is visible
 379                         if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
 380                         {
 381                                 // it is visible, return immediately with the news
 382                                 return true;
 383                         }
 384                 }
 385 #else
 386                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 387                 {
 388                         if (node->plane)
 389                         {
 390                                 if (nodestackindex < 1024)
 391                                         nodestack[nodestackindex++] = node->children[0];
 392                                 node = node->children[1];
 393                                 continue;
 394                         }
 395                         else
 396                         {
 397                                 // leaf - check if it is visible
 398                                 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
 399                                 {
 400                                         // it is visible, return immediately with the news
 401                                         return true;
 402                                 }
 403                         }
 404                 }
 405 #endif
 406                 // nothing to see here, try another path we didn't take earlier
 407                 if (nodestackindex == 0)
 408                         break;
 409                 node = nodestack[--nodestackindex];
 410         }
 411         // it is not visible
 412         return false;
 413 }
 414
 415 typedef struct findnonsolidlocationinfo_s
 416 {
 417         vec3_t center;
 418         vec_t radius;
 419         vec3_t nudge;
 420         vec_t bestdist;
 421         dp_model_t *model;
 422 }
 423 findnonsolidlocationinfo_t;
 424
 425 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
 426 {
 427         int i, surfacenum, k, *tri, *mark;
 428         float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
 429         msurface_t *surface;
 430         for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
 431         {
 432                 surface = info->model->data_surfaces + *mark;
 433                 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
 434                 {
 435                         for (k = 0;k < surface->num_triangles;k++)
 436                         {
 437                                 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
 438                                 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
 439                                 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
 440                                 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
 441                                 VectorSubtract(vert[1], vert[0], edge[0]);
 442                                 VectorSubtract(vert[2], vert[1], edge[1]);
 443                                 CrossProduct(edge[1], edge[0], facenormal);
 444                                 if (facenormal[0] || facenormal[1] || facenormal[2])
 445                                 {
 446                                         VectorNormalize(facenormal);
 447                                         f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 448                                         if (f <= info->bestdist && f >= -info->bestdist)
 449                                         {
 450                                                 VectorSubtract(vert[0], vert[2], edge[2]);
 451                                                 VectorNormalize(edge[0]);
 452                                                 VectorNormalize(edge[1]);
 453                                                 VectorNormalize(edge[2]);
 454                                                 CrossProduct(facenormal, edge[0], edgenormal[0]);
 455                                                 CrossProduct(facenormal, edge[1], edgenormal[1]);
 456                                                 CrossProduct(facenormal, edge[2], edgenormal[2]);
 457                                                 // face distance
 458                                                 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
 459                                                  && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
 460                                                  && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
 461                                                 {
 462                                                         // we got lucky, the center is within the face
 463                                                         dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 464                                                         if (dist < 0)
 465                                                         {
 466                                                                 dist = -dist;
 467                                                                 if (info->bestdist > dist)
 468                                                                 {
 469                                                                         info->bestdist = dist;
 470                                                                         VectorScale(facenormal, (info->radius - -dist), info->nudge);
 471                                                                 }
 472                                                         }
 473                                                         else
 474                                                         {
 475                                                                 if (info->bestdist > dist)
 476                                                                 {
 477                                                                         info->bestdist = dist;
 478                                                                         VectorScale(facenormal, (info->radius - dist), info->nudge);
 479                                                                 }
 480                                                         }
 481                                                 }
 482                                                 else
 483                                                 {
 484                                                         // check which edge or vertex the center is nearest
 485                                                         for (i = 0;i < 3;i++)
 486                                                         {
 487                                                                 f = DotProduct(info->center, edge[i]);
 488                                                                 if (f >= DotProduct(vert[0], edge[i])
 489                                                                  && f <= DotProduct(vert[1], edge[i]))
 490                                                                 {
 491                                                                         // on edge
 492                                                                         VectorMA(info->center, -f, edge[i], point);
 493                                                                         dist = sqrt(DotProduct(point, point));
 494                                                                         if (info->bestdist > dist)
 495                                                                         {
 496                                                                                 info->bestdist = dist;
 497                                                                                 VectorScale(point, (info->radius / dist), info->nudge);
 498                                                                         }
 499                                                                         // skip both vertex checks
 500                                                                         // (both are further away than this edge)
 501                                                                         i++;
 502                                                                 }
 503                                                                 else
 504                                                                 {
 505                                                                         // not on edge, check first vertex of edge
 506                                                                         VectorSubtract(info->center, vert[i], point);
 507                                                                         dist = sqrt(DotProduct(point, point));
 508                                                                         if (info->bestdist > dist)
 509                                                                         {
 510                                                                                 info->bestdist = dist;
 511                                                                                 VectorScale(point, (info->radius / dist), info->nudge);
 512                                                                         }
 513                                                                 }
 514                                                         }
 515                                                 }
 516                                         }
 517                                 }
 518                         }
 519                 }
 520         }
 521 }
 522
 523 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
 524 {
 525         if (node->plane)
 526         {
 527                 float f = PlaneDiff(info->center, node->plane);
 528                 if (f >= -info->bestdist)
 529                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
 530                 if (f <= info->bestdist)
 531                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
 532         }
 533         else
 534         {
 535                 if (((mleaf_t *)node)->numleafsurfaces)
 536                         Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
 537         }
 538 }
 539
 540 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
 541 {
 542         int i;
 543         findnonsolidlocationinfo_t info;
 544         if (model == NULL)
 545         {
 546                 VectorCopy(in, out);
 547                 return;
 548         }
 549         VectorCopy(in, info.center);
 550         info.radius = radius;
 551         info.model = model;
 552         i = 0;
 553         do
 554         {
 555                 VectorClear(info.nudge);
 556                 info.bestdist = radius;
 557                 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
 558                 VectorAdd(info.center, info.nudge, info.center);
 559         }
 560         while (info.bestdist < radius && ++i < 10);
 561         VectorCopy(info.center, out);
 562 }
 563
 564 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
 565 {
 566         switch(nativecontents)
 567         {
 568                 case CONTENTS_EMPTY:
 569                         return 0;
 570                 case CONTENTS_SOLID:
 571                         return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
 572                 case CONTENTS_WATER:
 573                         return SUPERCONTENTS_WATER;
 574                 case CONTENTS_SLIME:
 575                         return SUPERCONTENTS_SLIME;
 576                 case CONTENTS_LAVA:
 577                         return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
 578                 case CONTENTS_SKY:
 579                         return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
 580         }
 581         return 0;
 582 }
 583
 584 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
 585 {
 586         if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
 587                 return CONTENTS_SOLID;
 588         if (supercontents & SUPERCONTENTS_SKY)
 589                 return CONTENTS_SKY;
 590         if (supercontents & SUPERCONTENTS_LAVA)
 591                 return CONTENTS_LAVA;
 592         if (supercontents & SUPERCONTENTS_SLIME)
 593                 return CONTENTS_SLIME;
 594         if (supercontents & SUPERCONTENTS_WATER)
 595                 return CONTENTS_WATER;
 596         return CONTENTS_EMPTY;
 597 }
 598
 599 typedef struct RecursiveHullCheckTraceInfo_s
 600 {
 601         // the hull we're tracing through
 602         const hull_t *hull;
 603
 604         // the trace structure to fill in
 605         trace_t *trace;
 606
 607         // start, end, and end - start (in model space)
 608         double start[3];
 609         double end[3];
 610         double dist[3];
 611 }
 612 RecursiveHullCheckTraceInfo_t;
 613
 614 // 1/32 epsilon to keep floating point happy
 615 #define DIST_EPSILON (0.03125)
 616
 617 #define HULLCHECKSTATE_EMPTY 0
 618 #define HULLCHECKSTATE_SOLID 1
 619 #define HULLCHECKSTATE_DONE 2
 620
 621 extern cvar_t collision_prefernudgedfraction;
 622 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
 623 {
 624         // status variables, these don't need to be saved on the stack when
 625         // recursing...  but are because this should be thread-safe
 626         // (note: tracing against a bbox is not thread-safe, yet)
 627         int ret;
 628         mplane_t *plane;
 629         double t1, t2;
 630
 631         // variables that need to be stored on the stack when recursing
 632         mclipnode_t *node;
 633         int side;
 634         double midf, mid[3];
 635
 636         // LordHavoc: a goto!  everyone flee in terror... :)
 637 loc0:
 638         // check for empty
 639         if (num < 0)
 640         {
 641                 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
 642                 if (!t->trace->startfound)
 643                 {
 644                         t->trace->startfound = true;
 645                         t->trace->startsupercontents |= num;
 646                 }
 647                 if (num & SUPERCONTENTS_LIQUIDSMASK)
 648                         t->trace->inwater = true;
 649                 if (num == 0)
 650                         t->trace->inopen = true;
 651                 if (num & SUPERCONTENTS_SOLID)
 652                         t->trace->hittexture = &mod_q1bsp_texture_solid;
 653                 else if (num & SUPERCONTENTS_SKY)
 654                         t->trace->hittexture = &mod_q1bsp_texture_sky;
 655                 else if (num & SUPERCONTENTS_LAVA)
 656                         t->trace->hittexture = &mod_q1bsp_texture_lava;
 657                 else if (num & SUPERCONTENTS_SLIME)
 658                         t->trace->hittexture = &mod_q1bsp_texture_slime;
 659                 else
 660                         t->trace->hittexture = &mod_q1bsp_texture_water;
 661                 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
 662                 t->trace->hitsupercontents = num;
 663                 if (num & t->trace->hitsupercontentsmask)
 664                 {
 665                         // if the first leaf is solid, set startsolid
 666                         if (t->trace->allsolid)
 667                                 t->trace->startsolid = true;
 668 #if COLLISIONPARANOID >= 3
 669                         Con_Print("S");
 670 #endif
 671                         return HULLCHECKSTATE_SOLID;
 672                 }
 673                 else
 674                 {
 675                         t->trace->allsolid = false;
 676 #if COLLISIONPARANOID >= 3
 677                         Con_Print("E");
 678 #endif
 679                         return HULLCHECKSTATE_EMPTY;
 680                 }
 681         }
 682
 683         // find the point distances
 684         node = t->hull->clipnodes + num;
 685
 686         plane = t->hull->planes + node->planenum;
 687         if (plane->type < 3)
 688         {
 689                 t1 = p1[plane->type] - plane->dist;
 690                 t2 = p2[plane->type] - plane->dist;
 691         }
 692         else
 693         {
 694                 t1 = DotProduct (plane->normal, p1) - plane->dist;
 695                 t2 = DotProduct (plane->normal, p2) - plane->dist;
 696         }
 697
 698         if (t1 < 0)
 699         {
 700                 if (t2 < 0)
 701                 {
 702 #if COLLISIONPARANOID >= 3
 703                         Con_Print("<");
 704 #endif
 705                         num = node->children[1];
 706                         goto loc0;
 707                 }
 708                 side = 1;
 709         }
 710         else
 711         {
 712                 if (t2 >= 0)
 713                 {
 714 #if COLLISIONPARANOID >= 3
 715                         Con_Print(">");
 716 #endif
 717                         num = node->children[0];
 718                         goto loc0;
 719                 }
 720                 side = 0;
 721         }
 722
 723         // the line intersects, find intersection point
 724         // LordHavoc: this uses the original trace for maximum accuracy
 725 #if COLLISIONPARANOID >= 3
 726         Con_Print("M");
 727 #endif
 728         if (plane->type < 3)
 729         {
 730                 t1 = t->start[plane->type] - plane->dist;
 731                 t2 = t->end[plane->type] - plane->dist;
 732         }
 733         else
 734         {
 735                 t1 = DotProduct (plane->normal, t->start) - plane->dist;
 736                 t2 = DotProduct (plane->normal, t->end) - plane->dist;
 737         }
 738
 739         midf = t1 / (t1 - t2);
 740         midf = bound(p1f, midf, p2f);
 741         VectorMA(t->start, midf, t->dist, mid);
 742
 743         // recurse both sides, front side first
 744         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
 745         // if this side is not empty, return what it is (solid or done)
 746         if (ret != HULLCHECKSTATE_EMPTY)
 747                 return ret;
 748
 749         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
 750         // if other side is not solid, return what it is (empty or done)
 751         if (ret != HULLCHECKSTATE_SOLID)
 752                 return ret;
 753
 754         // front is air and back is solid, this is the impact point...
 755         if (side)
 756         {
 757                 t->trace->plane.dist = -plane->dist;
 758                 VectorNegate (plane->normal, t->trace->plane.normal);
 759         }
 760         else
 761         {
 762                 t->trace->plane.dist = plane->dist;
 763                 VectorCopy (plane->normal, t->trace->plane.normal);
 764         }
 765
 766         // calculate the true fraction
 767         t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
 768         t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
 769         midf = t1 / (t1 - t2);
 770         t->trace->realfraction = bound(0, midf, 1);
 771
 772         // calculate the return fraction which is nudged off the surface a bit
 773         midf = (t1 - DIST_EPSILON) / (t1 - t2);
 774         t->trace->fraction = bound(0, midf, 1);
 775
 776         if (collision_prefernudgedfraction.integer)
 777                 t->trace->realfraction = t->trace->fraction;
 778
 779 #if COLLISIONPARANOID >= 3
 780         Con_Print("D");
 781 #endif
 782         return HULLCHECKSTATE_DONE;
 783 }
 784
 785 //#if COLLISIONPARANOID < 2
 786 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
 787 {
 788         mplane_t *plane;
 789         mclipnode_t *nodes = t->hull->clipnodes;
 790         mplane_t *planes = t->hull->planes;
 791         vec3_t point;
 792         VectorCopy(t->start, point);
 793         while (num >= 0)
 794         {
 795                 plane = planes + nodes[num].planenum;
 796                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
 797         }
 798         num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
 799         t->trace->startsupercontents |= num;
 800         if (num & SUPERCONTENTS_LIQUIDSMASK)
 801                 t->trace->inwater = true;
 802         if (num == 0)
 803                 t->trace->inopen = true;
 804         if (num & t->trace->hitsupercontentsmask)
 805         {
 806                 t->trace->allsolid = t->trace->startsolid = true;
 807                 return HULLCHECKSTATE_SOLID;
 808         }
 809         else
 810         {
 811                 t->trace->allsolid = t->trace->startsolid = false;
 812                 return HULLCHECKSTATE_EMPTY;
 813         }
 814 }
 815 //#endif
 816
 817 static void Mod_Q1BSP_TraceBox(struct model_s *model, int frame, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
 818 {
 819         // this function currently only supports same size start and end
 820         double boxsize[3];
 821         RecursiveHullCheckTraceInfo_t rhc;
 822
 823         memset(&rhc, 0, sizeof(rhc));
 824         memset(trace, 0, sizeof(trace_t));
 825         rhc.trace = trace;
 826         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 827         rhc.trace->fraction = 1;
 828         rhc.trace->realfraction = 1;
 829         rhc.trace->allsolid = true;
 830         VectorSubtract(boxmaxs, boxmins, boxsize);
 831         if (boxsize[0] < 3)
 832                 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
 833         else if (model->brush.ishlbsp)
 834         {
 835                 // LordHavoc: this has to have a minor tolerance (the .1) because of
 836                 // minor float precision errors from the box being transformed around
 837                 if (boxsize[0] < 32.1)
 838                 {
 839                         if (boxsize[2] < 54) // pick the nearest of 36 or 72
 840                                 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
 841                         else
 842                                 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
 843                 }
 844                 else
 845                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
 846         }
 847         else
 848         {
 849                 // LordHavoc: this has to have a minor tolerance (the .1) because of
 850                 // minor float precision errors from the box being transformed around
 851                 if (boxsize[0] < 32.1)
 852                         rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
 853                 else
 854                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
 855         }
 856         VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
 857         VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
 858         VectorSubtract(rhc.end, rhc.start, rhc.dist);
 859 #if COLLISIONPARANOID >= 2
 860         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]);
 861         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 862         {
 863
 864                 double test[3];
 865                 trace_t testtrace;
 866                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
 867                 memset(&testtrace, 0, sizeof(trace_t));
 868                 rhc.trace = &testtrace;
 869                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 870                 rhc.trace->fraction = 1;
 871                 rhc.trace->realfraction = 1;
 872                 rhc.trace->allsolid = true;
 873                 VectorCopy(test, rhc.start);
 874                 VectorCopy(test, rhc.end);
 875                 VectorClear(rhc.dist);
 876                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 877                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
 878                 if (!trace->startsolid && testtrace.startsolid)
 879                         Con_Printf(" - ended in solid!\n");
 880         }
 881         Con_Print("\n");
 882 #else
 883         if (VectorLength2(rhc.dist))
 884                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 885         else
 886                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 887 #endif
 888 }
 889
 890 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
 891 {
 892         int num = model->brushq1.hulls[0].firstclipnode;
 893         mplane_t *plane;
 894         mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
 895         mplane_t *planes = model->brushq1.hulls[0].planes;
 896         while (num >= 0)
 897         {
 898                 plane = planes + nodes[num].planenum;
 899                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
 900         }
 901         return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
 902 }
 903
 904 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, texture_t *boxtexture)
 905 {
 906 #if 1
 907         colbrushf_t cbox;
 908         colplanef_t cbox_planes[6];
 909         cbox.supercontents = boxsupercontents;
 910         cbox.numplanes = 6;
 911         cbox.numpoints = 0;
 912         cbox.numtriangles = 0;
 913         cbox.planes = cbox_planes;
 914         cbox.points = NULL;
 915         cbox.elements = NULL;
 916         cbox.markframe = 0;
 917         cbox.mins[0] = 0;
 918         cbox.mins[1] = 0;
 919         cbox.mins[2] = 0;
 920         cbox.maxs[0] = 0;
 921         cbox.maxs[1] = 0;
 922         cbox.maxs[2] = 0;
 923         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];
 924         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];
 925         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];
 926         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];
 927         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];
 928         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];
 929         cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
 930         cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
 931         cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
 932         cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
 933         cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
 934         cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
 935         memset(trace, 0, sizeof(trace_t));
 936         trace->hitsupercontentsmask = hitsupercontentsmask;
 937         trace->fraction = 1;
 938         trace->realfraction = 1;
 939         Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
 940 #else
 941         RecursiveHullCheckTraceInfo_t rhc;
 942         static hull_t box_hull;
 943         static mclipnode_t box_clipnodes[6];
 944         static mplane_t box_planes[6];
 945         // fill in a default trace
 946         memset(&rhc, 0, sizeof(rhc));
 947         memset(trace, 0, sizeof(trace_t));
 948         //To keep everything totally uniform, bounding boxes are turned into small
 949         //BSP trees instead of being compared directly.
 950         // create a temp hull from bounding box sizes
 951         box_planes[0].dist = cmaxs[0] - mins[0];
 952         box_planes[1].dist = cmins[0] - maxs[0];
 953         box_planes[2].dist = cmaxs[1] - mins[1];
 954         box_planes[3].dist = cmins[1] - maxs[1];
 955         box_planes[4].dist = cmaxs[2] - mins[2];
 956         box_planes[5].dist = cmins[2] - maxs[2];
 957 #if COLLISIONPARANOID >= 3
 958         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]);
 959 #endif
 960
 961         if (box_hull.clipnodes == NULL)
 962         {
 963                 int i, side;
 964
 965                 //Set up the planes and clipnodes so that the six floats of a bounding box
 966                 //can just be stored out and get a proper hull_t structure.
 967
 968                 box_hull.clipnodes = box_clipnodes;
 969                 box_hull.planes = box_planes;
 970                 box_hull.firstclipnode = 0;
 971                 box_hull.lastclipnode = 5;
 972
 973                 for (i = 0;i < 6;i++)
 974                 {
 975                         box_clipnodes[i].planenum = i;
 976
 977                         side = i&1;
 978
 979                         box_clipnodes[i].children[side] = CONTENTS_EMPTY;
 980                         if (i != 5)
 981                                 box_clipnodes[i].children[side^1] = i + 1;
 982                         else
 983                                 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
 984
 985                         box_planes[i].type = i>>1;
 986                         box_planes[i].normal[i>>1] = 1;
 987                 }
 988         }
 989
 990         // trace a line through the generated clipping hull
 991         //rhc.boxsupercontents = boxsupercontents;
 992         rhc.hull = &box_hull;
 993         rhc.trace = trace;
 994         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 995         rhc.trace->fraction = 1;
 996         rhc.trace->realfraction = 1;
 997         rhc.trace->allsolid = true;
 998         VectorCopy(start, rhc.start);
 999         VectorCopy(end, rhc.end);
1000         VectorSubtract(rhc.end, rhc.start, rhc.dist);
1001         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1002         //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1003         if (rhc.trace->startsupercontents)
1004                 rhc.trace->startsupercontents = boxsupercontents;
1005 #endif
1006 }
1007
1008 static int Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
1009 {
1010         double t1, t2;
1011         double midf, mid[3];
1012         int ret, side;
1013
1014         // check for empty
1015         while (node->plane)
1016         {
1017                 // find the point distances
1018                 mplane_t *plane = node->plane;
1019                 if (plane->type < 3)
1020                 {
1021                         t1 = p1[plane->type] - plane->dist;
1022                         t2 = p2[plane->type] - plane->dist;
1023                 }
1024                 else
1025                 {
1026                         t1 = DotProduct (plane->normal, p1) - plane->dist;
1027                         t2 = DotProduct (plane->normal, p2) - plane->dist;
1028                 }
1029
1030                 if (t1 < 0)
1031                 {
1032                         if (t2 < 0)
1033                         {
1034                                 node = node->children[1];
1035                                 continue;
1036                         }
1037                         side = 1;
1038                 }
1039                 else
1040                 {
1041                         if (t2 >= 0)
1042                         {
1043                                 node = node->children[0];
1044                                 continue;
1045                         }
1046                         side = 0;
1047                 }
1048
1049                 midf = t1 / (t1 - t2);
1050                 VectorLerp(p1, midf, p2, mid);
1051
1052                 // recurse both sides, front side first
1053                 // return 2 if empty is followed by solid (hit something)
1054                 // do not return 2 if both are solid or both empty,
1055                 // or if start is solid and end is empty
1056                 // as these degenerate cases usually indicate the eye is in solid and
1057                 // should see the target point anyway
1058                 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side    ], p1, mid);
1059                 if (ret != 0)
1060                         return ret;
1061                 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
1062                 if (ret != 1)
1063                         return ret;
1064                 return 2;
1065         }
1066         return ((mleaf_t *)node)->clusterindex < 0;
1067 }
1068
1069 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1070 {
1071         // this function currently only supports same size start and end
1072         double tracestart[3], traceend[3];
1073         VectorCopy(start, tracestart);
1074         VectorCopy(end, traceend);
1075         return Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend) != 2;
1076 }
1077
1078 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)
1079 {
1080         int side;
1081         float front, back;
1082         float mid, distz = endz - startz;
1083
1084 loc0:
1085         if (!node->plane)
1086                 return false;           // didn't hit anything
1087
1088         switch (node->plane->type)
1089         {
1090         case PLANE_X:
1091                 node = node->children[x < node->plane->dist];
1092                 goto loc0;
1093         case PLANE_Y:
1094                 node = node->children[y < node->plane->dist];
1095                 goto loc0;
1096         case PLANE_Z:
1097                 side = startz < node->plane->dist;
1098                 if ((endz < node->plane->dist) == side)
1099                 {
1100                         node = node->children[side];
1101                         goto loc0;
1102                 }
1103                 // found an intersection
1104                 mid = node->plane->dist;
1105                 break;
1106         default:
1107                 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1108                 front += startz * node->plane->normal[2];
1109                 back += endz * node->plane->normal[2];
1110                 side = front < node->plane->dist;
1111                 if ((back < node->plane->dist) == side)
1112                 {
1113                         node = node->children[side];
1114                         goto loc0;
1115                 }
1116                 // found an intersection
1117                 mid = startz + distz * (front - node->plane->dist) / (front - back);
1118                 break;
1119         }
1120
1121         // go down front side
1122         if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1123                 return true;    // hit something
1124         else
1125         {
1126                 // check for impact on this node
1127                 if (node->numsurfaces)
1128                 {
1129                         int i, dsi, dti, lmwidth, lmheight;
1130                         float ds, dt;
1131                         msurface_t *surface;
1132                         unsigned char *lightmap;
1133                         int maps, line3, size3;
1134                         float dsfrac;
1135                         float dtfrac;
1136                         float scale, w, w00, w01, w10, w11;
1137
1138                         surface = model->data_surfaces + node->firstsurface;
1139                         for (i = 0;i < node->numsurfaces;i++, surface++)
1140                         {
1141                                 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1142                                         continue;       // no lightmaps
1143
1144                                 // location we want to sample in the lightmap
1145                                 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;
1146                                 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;
1147
1148                                 // check the bounds
1149                                 dsi = (int)ds;
1150                                 dti = (int)dt;
1151                                 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1152                                 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1153
1154                                 // is it in bounds?
1155                                 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1156                                 {
1157                                         // calculate bilinear interpolation factors
1158                                         // and also multiply by fixedpoint conversion factors
1159                                         dsfrac = ds - dsi;
1160                                         dtfrac = dt - dti;
1161                                         w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1162                                         w01 = (    dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1163                                         w10 = (1 - dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1164                                         w11 = (    dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1165
1166                                         // values for pointer math
1167                                         line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1168                                         size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1169
1170                                         // look up the pixel
1171                                         lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1172
1173                                         // bilinear filter each lightmap style, and sum them
1174                                         for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1175                                         {
1176                                                 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1177                                                 w = w00 * scale;VectorMA(ambientcolor, w, lightmap            , ambientcolor);
1178                                                 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3        , ambientcolor);
1179                                                 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3    , ambientcolor);
1180                                                 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1181                                                 lightmap += size3;
1182                                         }
1183
1184                                         return true; // success
1185                                 }
1186                         }
1187                 }
1188
1189                 // go down back side
1190                 node = node->children[side ^ 1];
1191                 startz = mid;
1192                 distz = endz - startz;
1193                 goto loc0;
1194         }
1195 }
1196
1197 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1198 {
1199         // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1200         VectorSet(diffusenormal, 0, 0, 1);
1201
1202         if (!model->brushq1.lightdata)
1203         {
1204                 VectorSet(ambientcolor, 1, 1, 1);
1205                 VectorSet(diffusecolor, 0, 0, 0);
1206                 return;
1207         }
1208
1209         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);
1210 }
1211
1212 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1213 {
1214         int c;
1215         unsigned char *outstart = out;
1216         while (out < outend)
1217         {
1218                 if (in == inend)
1219                 {
1220                         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));
1221                         return;
1222                 }
1223                 c = *in++;
1224                 if (c)
1225                         *out++ = c;
1226                 else
1227                 {
1228                         if (in == inend)
1229                         {
1230                                 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));
1231                                 return;
1232                         }
1233                         for (c = *in++;c > 0;c--)
1234                         {
1235                                 if (out == outend)
1236                                 {
1237                                         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));
1238                                         return;
1239                                 }
1240                                 *out++ = 0;
1241                         }
1242                 }
1243         }
1244 }
1245
1246 /*
1247 =============
1248 R_Q1BSP_LoadSplitSky
1249
1250 A sky texture is 256*128, with the right side being a masked overlay
1251 ==============
1252 */
1253 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1254 {
1255         int i, j;
1256         unsigned solidpixels[128*128], alphapixels[128*128];
1257
1258         // allocate a texture pool if we need it
1259         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1260                 loadmodel->texturepool = R_AllocTexturePool();
1261
1262         if (bytesperpixel == 4)
1263         {
1264                 for (i = 0;i < 128;i++)
1265                 {
1266                         for (j = 0;j < 128;j++)
1267                         {
1268                                 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1269                                 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1270                         }
1271                 }
1272         }
1273         else
1274         {
1275                 // make an average value for the back to avoid
1276                 // a fringe on the top level
1277                 int p, r, g, b;
1278                 union
1279                 {
1280                         unsigned int i;
1281                         unsigned char b[4];
1282                 }
1283                 bgra;
1284                 r = g = b = 0;
1285                 for (i = 0;i < 128;i++)
1286                 {
1287                         for (j = 0;j < 128;j++)
1288                         {
1289                                 p = src[i*256 + j + 128];
1290                                 r += palette_rgb[p][0];
1291                                 g += palette_rgb[p][1];
1292                                 b += palette_rgb[p][2];
1293                         }
1294                 }
1295                 bgra.b[2] = r/(128*128);
1296                 bgra.b[1] = g/(128*128);
1297                 bgra.b[0] = b/(128*128);
1298                 bgra.b[3] = 0;
1299                 for (i = 0;i < 128;i++)
1300                 {
1301                         for (j = 0;j < 128;j++)
1302                         {
1303                                 solidpixels[(i*128) + j] = palette_bgra_complete[src[i*256 + j + 128]];
1304                                 p = src[i*256 + j];
1305                                 alphapixels[(i*128) + j] = p ? palette_bgra_complete[p] : bgra.i;
1306                         }
1307                 }
1308         }
1309
1310         loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1311         loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1312 }
1313
1314 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1315 {
1316         int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1317         skinframe_t *skinframe;
1318         miptex_t *dmiptex;
1319         texture_t *tx, *tx2, *anims[10], *altanims[10];
1320         dmiptexlump_t *m;
1321         unsigned char *data, *mtdata;
1322         const char *s;
1323         char mapname[MAX_QPATH], name[MAX_QPATH];
1324         unsigned char zero[4];
1325
1326         memset(zero, 0, sizeof(zero));
1327
1328         loadmodel->data_textures = NULL;
1329
1330         // add two slots for notexture walls and notexture liquids
1331         if (l->filelen)
1332         {
1333                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1334                 m->nummiptex = LittleLong (m->nummiptex);
1335                 loadmodel->num_textures = m->nummiptex + 2;
1336                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1337         }
1338         else
1339         {
1340                 m = NULL;
1341                 loadmodel->num_textures = 2;
1342                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1343         }
1344
1345         loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1346
1347         // fill out all slots with notexture
1348         if (cls.state != ca_dedicated)
1349                 skinframe = R_SkinFrame_LoadMissing();
1350         else
1351                 skinframe = NULL;
1352         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1353         {
1354                 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1355                 tx->width = 16;
1356                 tx->height = 16;
1357                 if (cls.state != ca_dedicated)
1358                 {
1359                         tx->numskinframes = 1;
1360                         tx->skinframerate = 1;
1361                         tx->skinframes[0] = skinframe;
1362                         tx->currentskinframe = tx->skinframes[0];
1363                 }
1364                 tx->basematerialflags = MATERIALFLAG_WALL;
1365                 if (i == loadmodel->num_textures - 1)
1366                 {
1367                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1368                         tx->supercontents = mod_q1bsp_texture_water.supercontents;
1369                         tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1370                 }
1371                 else
1372                 {
1373                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1374                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1375                 }
1376                 tx->currentframe = tx;
1377
1378                 // clear water settings
1379                 tx->reflectmin = 0;
1380                 tx->reflectmax = 1;
1381                 tx->refractfactor = 1;
1382                 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1383                 tx->reflectfactor = 1;
1384                 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1385                 tx->r_water_wateralpha = 1;
1386         }
1387
1388         if (!m)
1389         {
1390                 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1391                 return;
1392         }
1393
1394         s = loadmodel->name;
1395         if (!strncasecmp(s, "maps/", 5))
1396                 s += 5;
1397         FS_StripExtension(s, mapname, sizeof(mapname));
1398
1399         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1400         dofs = m->dataofs;
1401         // LordHavoc: mostly rewritten map texture loader
1402         for (i = 0;i < m->nummiptex;i++)
1403         {
1404                 dofs[i] = LittleLong(dofs[i]);
1405                 if (r_nosurftextures.integer)
1406                         continue;
1407                 if (dofs[i] == -1)
1408                 {
1409                         Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1410                         continue;
1411                 }
1412                 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1413
1414                 // copy name, but only up to 16 characters
1415                 // (the output buffer can hold more than this, but the input buffer is
1416                 //  only 16)
1417                 for (j = 0;j < 16 && dmiptex->name[j];j++)
1418                         name[j] = dmiptex->name[j];
1419                 name[j] = 0;
1420
1421                 if (!name[0])
1422                 {
1423                         dpsnprintf(name, sizeof(name), "unnamed%i", i);
1424                         Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1425                 }
1426
1427                 mtwidth = LittleLong(dmiptex->width);
1428                 mtheight = LittleLong(dmiptex->height);
1429                 mtdata = NULL;
1430                 j = LittleLong(dmiptex->offsets[0]);
1431                 if (j)
1432                 {
1433                         // texture included
1434                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1435                         {
1436                                 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1437                                 continue;
1438                         }
1439                         mtdata = (unsigned char *)dmiptex + j;
1440                 }
1441
1442                 if ((mtwidth & 15) || (mtheight & 15))
1443                         Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1444
1445                 // LordHavoc: force all names to lowercase
1446                 for (j = 0;name[j];j++)
1447                         if (name[j] >= 'A' && name[j] <= 'Z')
1448                                 name[j] += 'a' - 'A';
1449
1450                 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1451                         continue;
1452
1453                 tx = loadmodel->data_textures + i;
1454                 strlcpy(tx->name, name, sizeof(tx->name));
1455                 tx->width = mtwidth;
1456                 tx->height = mtheight;
1457
1458                 if (tx->name[0] == '*')
1459                 {
1460                         if (!strncmp(tx->name, "*lava", 5))
1461                         {
1462                                 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1463                                 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1464                         }
1465                         else if (!strncmp(tx->name, "*slime", 6))
1466                         {
1467                                 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1468                                 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1469                         }
1470                         else
1471                         {
1472                                 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1473                                 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1474                         }
1475                 }
1476                 else if (!strncmp(tx->name, "sky", 3))
1477                 {
1478                         tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1479                         tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1480                 }
1481                 else
1482                 {
1483                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1484                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1485                 }
1486
1487                 if (cls.state != ca_dedicated)
1488                 {
1489                         // LordHavoc: HL sky textures are entirely different than quake
1490                         if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1491                         {
1492                                 data = loadimagepixelsbgra(tx->name, false, false);
1493                                 if (data && image_width == 256 && image_height == 128)
1494                                 {
1495                                         R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1496                                         Mem_Free(data);
1497                                 }
1498                                 else if (mtdata != NULL)
1499                                         R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1500                         }
1501                         else
1502                         {
1503                                 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1504                                 if (!skinframe)
1505                                         skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1506                                 if (!skinframe)
1507                                 {
1508                                         // did not find external texture, load it from the bsp or wad3
1509                                         if (loadmodel->brush.ishlbsp)
1510                                         {
1511                                                 // internal texture overrides wad
1512                                                 unsigned char *pixels, *freepixels;
1513                                                 pixels = freepixels = NULL;
1514                                                 if (mtdata)
1515                                                         pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1516                                                 if (pixels == NULL)
1517                                                         pixels = freepixels = W_GetTextureBGRA(tx->name);
1518                                                 if (pixels != NULL)
1519                                                 {
1520                                                         tx->width = image_width;
1521                                                         tx->height = image_height;
1522                                                         skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1523                                                 }
1524                                                 if (freepixels)
1525                                                         Mem_Free(freepixels);
1526                                         }
1527                                         else if (mtdata) // texture included
1528                                                 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1529                                 }
1530                                 // if skinframe is still NULL the "missing" texture will be used
1531                                 if (skinframe)
1532                                         tx->skinframes[0] = skinframe;
1533                         }
1534
1535                         tx->basematerialflags = MATERIALFLAG_WALL;
1536                         if (tx->name[0] == '*')
1537                         {
1538                                 // LordHavoc: some turbulent textures should not be affected by wateralpha
1539                                 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1540                                 {
1541                                         // replace the texture with transparent black
1542                                         Vector4Set(zero, 128, 128, 128, 128);
1543                                         tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1544                                         tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1545                                 }
1546                                 else if (!strncmp(tx->name,"*lava",5)
1547                                  || !strncmp(tx->name,"*teleport",9)
1548                                  || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1549                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1550                                 else
1551                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1552                                 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1553                                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1554                         }
1555                         else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1556                         {
1557                                 // replace the texture with black
1558                                 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1559                                 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1560                         }
1561                         else if (!strncmp(tx->name, "sky", 3))
1562                                 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1563                         else if (!strcmp(tx->name, "caulk"))
1564                                 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1565                         else if (tx->skinframes[0] && tx->skinframes[0]->fog)
1566                                 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1567
1568                         // start out with no animation
1569                         tx->currentframe = tx;
1570                         tx->currentskinframe = tx->skinframes[0];
1571                 }
1572         }
1573
1574         // sequence the animations
1575         for (i = 0;i < m->nummiptex;i++)
1576         {
1577                 tx = loadmodel->data_textures + i;
1578                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1579                         continue;
1580                 if (tx->anim_total[0] || tx->anim_total[1])
1581                         continue;       // already sequenced
1582
1583                 // find the number of frames in the animation
1584                 memset(anims, 0, sizeof(anims));
1585                 memset(altanims, 0, sizeof(altanims));
1586
1587                 for (j = i;j < m->nummiptex;j++)
1588                 {
1589                         tx2 = loadmodel->data_textures + j;
1590                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1591                                 continue;
1592
1593                         num = tx2->name[1];
1594                         if (num >= '0' && num <= '9')
1595                                 anims[num - '0'] = tx2;
1596                         else if (num >= 'a' && num <= 'j')
1597                                 altanims[num - 'a'] = tx2;
1598                         else
1599                                 Con_Printf("Bad animating texture %s\n", tx->name);
1600                 }
1601
1602                 max = altmax = 0;
1603                 for (j = 0;j < 10;j++)
1604                 {
1605                         if (anims[j])
1606                                 max = j + 1;
1607                         if (altanims[j])
1608                                 altmax = j + 1;
1609                 }
1610                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1611
1612                 incomplete = false;
1613                 for (j = 0;j < max;j++)
1614                 {
1615                         if (!anims[j])
1616                         {
1617                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1618                                 incomplete = true;
1619                         }
1620                 }
1621                 for (j = 0;j < altmax;j++)
1622                 {
1623                         if (!altanims[j])
1624                         {
1625                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1626                                 incomplete = true;
1627                         }
1628                 }
1629                 if (incomplete)
1630                         continue;
1631
1632                 if (altmax < 1)
1633                 {
1634                         // if there is no alternate animation, duplicate the primary
1635                         // animation into the alternate
1636                         altmax = max;
1637                         for (k = 0;k < 10;k++)
1638                                 altanims[k] = anims[k];
1639                 }
1640
1641                 // link together the primary animation
1642                 for (j = 0;j < max;j++)
1643                 {
1644                         tx2 = anims[j];
1645                         tx2->animated = true;
1646                         tx2->anim_total[0] = max;
1647                         tx2->anim_total[1] = altmax;
1648                         for (k = 0;k < 10;k++)
1649                         {
1650                                 tx2->anim_frames[0][k] = anims[k];
1651                                 tx2->anim_frames[1][k] = altanims[k];
1652                         }
1653                 }
1654
1655                 // if there really is an alternate anim...
1656                 if (anims[0] != altanims[0])
1657                 {
1658                         // link together the alternate animation
1659                         for (j = 0;j < altmax;j++)
1660                         {
1661                                 tx2 = altanims[j];
1662                                 tx2->animated = true;
1663                                 // the primary/alternate are reversed here
1664                                 tx2->anim_total[0] = altmax;
1665                                 tx2->anim_total[1] = max;
1666                                 for (k = 0;k < 10;k++)
1667                                 {
1668                                         tx2->anim_frames[0][k] = altanims[k];
1669                                         tx2->anim_frames[1][k] = anims[k];
1670                                 }
1671                         }
1672                 }
1673         }
1674 }
1675
1676 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1677 {
1678         int i;
1679         unsigned char *in, *out, *data, d;
1680         char litfilename[MAX_QPATH];
1681         char dlitfilename[MAX_QPATH];
1682         fs_offset_t filesize;
1683         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1684         {
1685                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1686                 for (i=0; i<l->filelen; i++)
1687                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1688         }
1689         else // LordHavoc: bsp version 29 (normal white lighting)
1690         {
1691                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1692                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1693                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1694                 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1695                 strlcat (litfilename, ".lit", sizeof (litfilename));
1696                 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1697                 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1698                 if (data)
1699                 {
1700                         if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1701                         {
1702                                 i = LittleLong(((int *)data)[1]);
1703                                 if (i == 1)
1704                                 {
1705                                         if (developer_loading.integer)
1706                                                 Con_Printf("loaded %s\n", litfilename);
1707                                         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1708                                         memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1709                                         Mem_Free(data);
1710                                         data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1711                                         if (data)
1712                                         {
1713                                                 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1714                                                 {
1715                                                         i = LittleLong(((int *)data)[1]);
1716                                                         if (i == 1)
1717                                                         {
1718                                                                 if (developer_loading.integer)
1719                                                                         Con_Printf("loaded %s\n", dlitfilename);
1720                                                                 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1721                                                                 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1722                                                                 loadmodel->brushq3.deluxemapping_modelspace = false;
1723                                                                 loadmodel->brushq3.deluxemapping = true;
1724                                                         }
1725                                                 }
1726                                                 Mem_Free(data);
1727                                                 data = NULL;
1728                                         }
1729                                         return;
1730                                 }
1731                                 else
1732                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1733                         }
1734                         else if (filesize == 8)
1735                                 Con_Print("Empty .lit file, ignoring\n");
1736                         else
1737                                 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1738                         if (data)
1739                         {
1740                                 Mem_Free(data);
1741                                 data = NULL;
1742                         }
1743                 }
1744                 // LordHavoc: oh well, expand the white lighting data
1745                 if (!l->filelen)
1746                         return;
1747                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1748                 in = mod_base + l->fileofs;
1749                 out = loadmodel->brushq1.lightdata;
1750                 for (i = 0;i < l->filelen;i++)
1751                 {
1752                         d = *in++;
1753                         *out++ = d;
1754                         *out++ = d;
1755                         *out++ = d;
1756                 }
1757         }
1758 }
1759
1760 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1761 {
1762         loadmodel->brushq1.num_compressedpvs = 0;
1763         loadmodel->brushq1.data_compressedpvs = NULL;
1764         if (!l->filelen)
1765                 return;
1766         loadmodel->brushq1.num_compressedpvs = l->filelen;
1767         loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1768         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1769 }
1770
1771 // used only for HalfLife maps
1772 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1773 {
1774         char key[128], value[4096];
1775         int i, j, k;
1776         if (!data)
1777                 return;
1778         if (!COM_ParseToken_Simple(&data, false, false))
1779                 return; // error
1780         if (com_token[0] != '{')
1781                 return; // error
1782         while (1)
1783         {
1784                 if (!COM_ParseToken_Simple(&data, false, false))
1785                         return; // error
1786                 if (com_token[0] == '}')
1787                         break; // end of worldspawn
1788                 if (com_token[0] == '_')
1789                         strlcpy(key, com_token + 1, sizeof(key));
1790                 else
1791                         strlcpy(key, com_token, sizeof(key));
1792                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1793                         key[strlen(key)-1] = 0;
1794                 if (!COM_ParseToken_Simple(&data, false, false))
1795                         return; // error
1796                 dpsnprintf(value, sizeof(value), "%s", com_token);
1797                 if (!strcmp("wad", key)) // for HalfLife maps
1798                 {
1799                         if (loadmodel->brush.ishlbsp)
1800                         {
1801                                 j = 0;
1802                                 for (i = 0;i < (int)sizeof(value);i++)
1803                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1804                                                 break;
1805                                 if (value[i])
1806                                 {
1807                                         for (;i < (int)sizeof(value);i++)
1808                                         {
1809                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1810                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1811                                                         j = i+1;
1812                                                 else if (value[i] == ';' || value[i] == 0)
1813                                                 {
1814                                                         k = value[i];
1815                                                         value[i] = 0;
1816                                                         W_LoadTextureWadFile(&value[j], false);
1817                                                         j = i+1;
1818                                                         if (!k)
1819                                                                 break;
1820                                                 }
1821                                         }
1822                                 }
1823                         }
1824                 }
1825         }
1826 }
1827
1828 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1829 {
1830         loadmodel->brush.entities = NULL;
1831         if (!l->filelen)
1832                 return;
1833         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
1834         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1835         loadmodel->brush.entities[l->filelen] = 0;
1836         if (loadmodel->brush.ishlbsp)
1837                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1838 }
1839
1840
1841 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1842 {
1843         dvertex_t       *in;
1844         mvertex_t       *out;
1845         int                     i, count;
1846
1847         in = (dvertex_t *)(mod_base + l->fileofs);
1848         if (l->filelen % sizeof(*in))
1849                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1850         count = l->filelen / sizeof(*in);
1851         out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1852
1853         loadmodel->brushq1.vertexes = out;
1854         loadmodel->brushq1.numvertexes = count;
1855
1856         for ( i=0 ; i<count ; i++, in++, out++)
1857         {
1858                 out->position[0] = LittleFloat(in->point[0]);
1859                 out->position[1] = LittleFloat(in->point[1]);
1860                 out->position[2] = LittleFloat(in->point[2]);
1861         }
1862 }
1863
1864 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1865 // can be used for this
1866 // REMOVEME
1867 int SB_ReadInt (unsigned char **buffer)
1868 {
1869         int     i;
1870         i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1871         (*buffer) += 4;
1872         return i;
1873 }
1874
1875 // REMOVEME
1876 float SB_ReadFloat (unsigned char **buffer)
1877 {
1878         union
1879         {
1880                 int             i;
1881                 float   f;
1882         } u;
1883
1884         u.i = SB_ReadInt (buffer);
1885         return u.f;
1886 }
1887
1888 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1889 {
1890         unsigned char           *index;
1891         dmodel_t        *out;
1892         int                     i, j, count;
1893
1894         index = (unsigned char *)(mod_base + l->fileofs);
1895         if (l->filelen % (48+4*hullinfo->filehulls))
1896                 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1897
1898         count = l->filelen / (48+4*hullinfo->filehulls);
1899         out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1900
1901         loadmodel->brushq1.submodels = out;
1902         loadmodel->brush.numsubmodels = count;
1903
1904         for (i = 0; i < count; i++, out++)
1905         {
1906         // spread out the mins / maxs by a pixel
1907                 out->mins[0] = SB_ReadFloat (&index) - 1;
1908                 out->mins[1] = SB_ReadFloat (&index) - 1;
1909                 out->mins[2] = SB_ReadFloat (&index) - 1;
1910                 out->maxs[0] = SB_ReadFloat (&index) + 1;
1911                 out->maxs[1] = SB_ReadFloat (&index) + 1;
1912                 out->maxs[2] = SB_ReadFloat (&index) + 1;
1913                 out->origin[0] = SB_ReadFloat (&index);
1914                 out->origin[1] = SB_ReadFloat (&index);
1915                 out->origin[2] = SB_ReadFloat (&index);
1916                 for (j = 0; j < hullinfo->filehulls; j++)
1917                         out->headnode[j] = SB_ReadInt (&index);
1918                 out->visleafs = SB_ReadInt (&index);
1919                 out->firstface = SB_ReadInt (&index);
1920                 out->numfaces = SB_ReadInt (&index);
1921         }
1922 }
1923
1924 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1925 {
1926         dedge_t *in;
1927         medge_t *out;
1928         int     i, count;
1929
1930         in = (dedge_t *)(mod_base + l->fileofs);
1931         if (l->filelen % sizeof(*in))
1932                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1933         count = l->filelen / sizeof(*in);
1934         out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1935
1936         loadmodel->brushq1.edges = out;
1937         loadmodel->brushq1.numedges = count;
1938
1939         for ( i=0 ; i<count ; i++, in++, out++)
1940         {
1941                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1942                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1943                 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1944                 {
1945                         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);
1946                         out->v[0] = 0;
1947                         out->v[1] = 0;
1948                 }
1949         }
1950 }
1951
1952 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1953 {
1954         texinfo_t *in;
1955         mtexinfo_t *out;
1956         int i, j, k, count, miptex;
1957
1958         in = (texinfo_t *)(mod_base + l->fileofs);
1959         if (l->filelen % sizeof(*in))
1960                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1961         count = l->filelen / sizeof(*in);
1962         out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1963
1964         loadmodel->brushq1.texinfo = out;
1965         loadmodel->brushq1.numtexinfo = count;
1966
1967         for (i = 0;i < count;i++, in++, out++)
1968         {
1969                 for (k = 0;k < 2;k++)
1970                         for (j = 0;j < 4;j++)
1971                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1972
1973                 miptex = LittleLong(in->miptex);
1974                 out->flags = LittleLong(in->flags);
1975
1976                 out->texture = NULL;
1977                 if (loadmodel->data_textures)
1978                 {
1979                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1980                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1981                         else
1982                                 out->texture = loadmodel->data_textures + miptex;
1983                 }
1984                 if (out->flags & TEX_SPECIAL)
1985                 {
1986                         // if texture chosen is NULL or the shader needs a lightmap,
1987                         // force to notexture water shader
1988                         if (out->texture == NULL)
1989                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1990                 }
1991                 else
1992                 {
1993                         // if texture chosen is NULL, force to notexture
1994                         if (out->texture == NULL)
1995                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1996                 }
1997         }
1998 }
1999
2000 #if 0
2001 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2002 {
2003         int             i, j;
2004         float   *v;
2005
2006         mins[0] = mins[1] = mins[2] = 9999;
2007         maxs[0] = maxs[1] = maxs[2] = -9999;
2008         v = verts;
2009         for (i = 0;i < numverts;i++)
2010         {
2011                 for (j = 0;j < 3;j++, v++)
2012                 {
2013                         if (*v < mins[j])
2014                                 mins[j] = *v;
2015                         if (*v > maxs[j])
2016                                 maxs[j] = *v;
2017                 }
2018         }
2019 }
2020
2021 #define MAX_SUBDIVPOLYTRIANGLES 4096
2022 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2023
2024 static int subdivpolyverts, subdivpolytriangles;
2025 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2026 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2027
2028 static int subdivpolylookupvert(vec3_t v)
2029 {
2030         int i;
2031         for (i = 0;i < subdivpolyverts;i++)
2032                 if (subdivpolyvert[i][0] == v[0]
2033                  && subdivpolyvert[i][1] == v[1]
2034                  && subdivpolyvert[i][2] == v[2])
2035                         return i;
2036         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2037                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2038         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2039         return subdivpolyverts++;
2040 }
2041
2042 static void SubdividePolygon(int numverts, float *verts)
2043 {
2044         int             i, i1, i2, i3, f, b, c, p;
2045         vec3_t  mins, maxs, front[256], back[256];
2046         float   m, *pv, *cv, dist[256], frac;
2047
2048         if (numverts > 250)
2049                 Host_Error("SubdividePolygon: ran out of verts in buffer");
2050
2051         BoundPoly(numverts, verts, mins, maxs);
2052
2053         for (i = 0;i < 3;i++)
2054         {
2055                 m = (mins[i] + maxs[i]) * 0.5;
2056                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2057                 if (maxs[i] - m < 8)
2058                         continue;
2059                 if (m - mins[i] < 8)
2060                         continue;
2061
2062                 // cut it
2063                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2064                         dist[c] = cv[i] - m;
2065
2066                 f = b = 0;
2067                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2068                 {
2069                         if (dist[p] >= 0)
2070                         {
2071                                 VectorCopy(pv, front[f]);
2072                                 f++;
2073                         }
2074                         if (dist[p] <= 0)
2075                         {
2076                                 VectorCopy(pv, back[b]);
2077                                 b++;
2078                         }
2079                         if (dist[p] == 0 || dist[c] == 0)
2080                                 continue;
2081                         if ((dist[p] > 0) != (dist[c] > 0) )
2082                         {
2083                                 // clip point
2084                                 frac = dist[p] / (dist[p] - dist[c]);
2085                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2086                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2087                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2088                                 f++;
2089                                 b++;
2090                         }
2091                 }
2092
2093                 SubdividePolygon(f, front[0]);
2094                 SubdividePolygon(b, back[0]);
2095                 return;
2096         }
2097
2098         i1 = subdivpolylookupvert(verts);
2099         i2 = subdivpolylookupvert(verts + 3);
2100         for (i = 2;i < numverts;i++)
2101         {
2102                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2103                 {
2104                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2105                         return;
2106                 }
2107
2108                 i3 = subdivpolylookupvert(verts + i * 3);
2109                 subdivpolyindex[subdivpolytriangles][0] = i1;
2110                 subdivpolyindex[subdivpolytriangles][1] = i2;
2111                 subdivpolyindex[subdivpolytriangles][2] = i3;
2112                 i2 = i3;
2113                 subdivpolytriangles++;
2114         }
2115 }
2116
2117 //Breaks a polygon up along axial 64 unit
2118 //boundaries so that turbulent and sky warps
2119 //can be done reasonably.
2120 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2121 {
2122         int i, j;
2123         surfvertex_t *v;
2124         surfmesh_t *mesh;
2125
2126         subdivpolytriangles = 0;
2127         subdivpolyverts = 0;
2128         SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2129         if (subdivpolytriangles < 1)
2130                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2131
2132         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2133         mesh->num_vertices = subdivpolyverts;
2134         mesh->num_triangles = subdivpolytriangles;
2135         mesh->vertex = (surfvertex_t *)(mesh + 1);
2136         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2137         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2138
2139         for (i = 0;i < mesh->num_triangles;i++)
2140                 for (j = 0;j < 3;j++)
2141                         mesh->index[i*3+j] = subdivpolyindex[i][j];
2142
2143         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2144         {
2145                 VectorCopy(subdivpolyvert[i], v->v);
2146                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2147                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2148         }
2149 }
2150 #endif
2151
2152 /* Maximum size of a single LM */
2153 #define MAX_SINGLE_LM_SIZE    256
2154
2155 struct alloc_lm_row
2156 {
2157         int rowY;
2158         int currentX;
2159 };
2160
2161 struct alloc_lm_state
2162 {
2163         int currentY;
2164         struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2165 };
2166
2167 static void init_alloc_lm_state (struct alloc_lm_state* state)
2168 {
2169         int r;
2170
2171         state->currentY = 0;
2172         for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2173         {
2174           state->rows[r].currentX = 0;
2175           state->rows[r].rowY = -1;
2176         }
2177 }
2178
2179 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2180 {
2181         struct alloc_lm_row* row;
2182         int r;
2183
2184         row = &(state->rows[blockheight]);
2185         if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2186         {
2187                 if (state->currentY + blockheight <= totalheight)
2188                 {
2189                         row->rowY = state->currentY;
2190                         row->currentX = 0;
2191                         state->currentY += blockheight;
2192                 }
2193                 else
2194                 {
2195                         /* See if we can stuff the block into a higher row */
2196                         row = NULL;
2197                         for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2198                         {
2199                                 if ((state->rows[r].rowY >= 0)
2200                                   && (state->rows[r].currentX + blockwidth <= totalwidth))
2201                                 {
2202                                         row = &(state->rows[r]);
2203                                         break;
2204                                 }
2205                         }
2206                         if (row == NULL) return false;
2207                 }
2208         }
2209         *outy = row->rowY;
2210         *outx = row->currentX;
2211         row->currentX += blockwidth;
2212
2213         return true;
2214 }
2215
2216 extern cvar_t gl_max_size;
2217 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2218 {
2219         dface_t *in;
2220         msurface_t *surface;
2221         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2222         float texmins[2], texmaxs[2], val;
2223         rtexture_t *lightmaptexture, *deluxemaptexture;
2224
2225         in = (dface_t *)(mod_base + l->fileofs);
2226         if (l->filelen % sizeof(*in))
2227                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2228         count = l->filelen / sizeof(*in);
2229         loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2230         loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2231
2232         loadmodel->num_surfaces = count;
2233
2234         loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2235
2236         totalverts = 0;
2237         totaltris = 0;
2238         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2239         {
2240                 numedges = (unsigned short)LittleShort(in->numedges);
2241                 totalverts += numedges;
2242                 totaltris += numedges - 2;
2243         }
2244
2245         Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2246
2247         lightmaptexture = NULL;
2248         deluxemaptexture = r_texture_blanknormalmap;
2249         lightmapnumber = 1;
2250         lightmapsize = max(256, gl_max_size.integer);
2251         totallightmapsamples = 0;
2252
2253         totalverts = 0;
2254         totaltris = 0;
2255         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2256         {
2257                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2258
2259                 // FIXME: validate edges, texinfo, etc?
2260                 firstedge = LittleLong(in->firstedge);
2261                 numedges = (unsigned short)LittleShort(in->numedges);
2262                 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)
2263                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2264                 i = (unsigned short)LittleShort(in->texinfo);
2265                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2266                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2267                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2268                 surface->texture = surface->lightmapinfo->texinfo->texture;
2269
2270                 planenum = (unsigned short)LittleShort(in->planenum);
2271                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2272                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2273
2274                 //surface->flags = surface->texture->flags;
2275                 //if (LittleShort(in->side))
2276                 //      surface->flags |= SURF_PLANEBACK;
2277                 //surface->plane = loadmodel->brush.data_planes + planenum;
2278
2279                 surface->num_firstvertex = totalverts;
2280                 surface->num_vertices = numedges;
2281                 surface->num_firsttriangle = totaltris;
2282                 surface->num_triangles = numedges - 2;
2283                 totalverts += numedges;
2284                 totaltris += numedges - 2;
2285
2286                 // convert edges back to a normal polygon
2287                 for (i = 0;i < surface->num_vertices;i++)
2288                 {
2289                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2290                         float s, t;
2291                         if (lindex > 0)
2292                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2293                         else
2294                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2295                         s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2296                         t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2297                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2298                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2299                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2300                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2301                         (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2302                 }
2303
2304                 for (i = 0;i < surface->num_triangles;i++)
2305                 {
2306                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2307                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2308                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2309                 }
2310
2311                 // compile additional data about the surface geometry
2312                 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, true);
2313                 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, true);
2314                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2315
2316                 // generate surface extents information
2317                 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2318                 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2319                 for (i = 1;i < surface->num_vertices;i++)
2320                 {
2321                         for (j = 0;j < 2;j++)
2322                         {
2323                                 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2324                                 texmins[j] = min(texmins[j], val);
2325                                 texmaxs[j] = max(texmaxs[j], val);
2326                         }
2327                 }
2328                 for (i = 0;i < 2;i++)
2329                 {
2330                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2331                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2332                 }
2333
2334                 smax = surface->lightmapinfo->extents[0] >> 4;
2335                 tmax = surface->lightmapinfo->extents[1] >> 4;
2336                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2337                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2338
2339                 // lighting info
2340                 for (i = 0;i < MAXLIGHTMAPS;i++)
2341                         surface->lightmapinfo->styles[i] = in->styles[i];
2342                 surface->lightmaptexture = NULL;
2343                 surface->deluxemaptexture = r_texture_blanknormalmap;
2344                 i = LittleLong(in->lightofs);
2345                 if (i == -1)
2346                 {
2347                         surface->lightmapinfo->samples = NULL;
2348 #if 0
2349                         // give non-lightmapped water a 1x white lightmap
2350                         if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2351                         {
2352                                 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2353                                 surface->lightmapinfo->styles[0] = 0;
2354                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2355                         }
2356 #endif
2357                 }
2358                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2359                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2360                 else // LordHavoc: white lighting (bsp version 29)
2361                 {
2362                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2363                         if (loadmodel->brushq1.nmaplightdata)
2364                                 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2365                 }
2366
2367                 // check if we should apply a lightmap to this
2368                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2369                 {
2370                         if (ssize > 256 || tsize > 256)
2371                                 Host_Error("Bad surface extents");
2372
2373                         if (lightmapsize < ssize)
2374                                 lightmapsize = ssize;
2375                         if (lightmapsize < tsize)
2376                                 lightmapsize = tsize;
2377
2378                         totallightmapsamples += ssize*tsize;
2379
2380                         // force lightmap upload on first time seeing the surface
2381                         //
2382                         // additionally this is used by the later code to see if a
2383                         // lightmap is needed on this surface (rather than duplicating the
2384                         // logic above)
2385                         loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2386                 }
2387         }
2388
2389         // small maps (such as ammo boxes especially) don't need big lightmap
2390         // textures, so this code tries to guess a good size based on
2391         // totallightmapsamples (size of the lightmaps lump basically), as well as
2392         // trying to max out the gl_max_size if there is a lot of lightmap data to
2393         // store
2394         // additionally, never choose a lightmapsize that is smaller than the
2395         // largest surface encountered (as it would fail)
2396         i = lightmapsize;
2397         for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2398                 ;
2399
2400         // now that we've decided the lightmap texture size, we can do the rest
2401         if (cls.state != ca_dedicated)
2402         {
2403                 int stainmapsize = 0;
2404                 struct alloc_lm_state allocState;
2405
2406                 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2407                 {
2408                         int i, iu, iv, lightmapx = 0, lightmapy = 0;
2409                         float u, v, ubase, vbase, uscale, vscale;
2410
2411                         if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2412                                 continue;
2413
2414                         smax = surface->lightmapinfo->extents[0] >> 4;
2415                         tmax = surface->lightmapinfo->extents[1] >> 4;
2416                         ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2417                         tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2418                         stainmapsize += ssize * tsize * 3;
2419
2420                         if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2421                         {
2422                                 // allocate a texture pool if we need it
2423                                 if (loadmodel->texturepool == NULL)
2424                                         loadmodel->texturepool = R_AllocTexturePool();
2425                                 // could not find room, make a new lightmap
2426                                 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2427                                 if (loadmodel->brushq1.nmaplightdata)
2428                                         deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2429                                 lightmapnumber++;
2430                                 init_alloc_lm_state (&allocState);
2431                                 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2432                         }
2433                         surface->lightmaptexture = lightmaptexture;
2434                         surface->deluxemaptexture = deluxemaptexture;
2435                         surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2436                         surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2437
2438                         uscale = 1.0f / (float)lightmapsize;
2439                         vscale = 1.0f / (float)lightmapsize;
2440                         ubase = lightmapx * uscale;
2441                         vbase = lightmapy * vscale;
2442
2443                         for (i = 0;i < surface->num_vertices;i++)
2444                         {
2445                                 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);
2446                                 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);
2447                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2448                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2449                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2450                                 iu = (int) u;
2451                                 iv = (int) v;
2452                                 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2453                         }
2454                 }
2455
2456                 if (cl_stainmaps.integer)
2457                 {
2458                         // allocate stainmaps for permanent marks on walls and clear white
2459                         unsigned char *stainsamples = NULL;
2460                         stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2461                         memset(stainsamples, 255, stainmapsize);
2462                         // assign pointers
2463                         for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2464                         {
2465                                 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2466                                         continue;
2467                                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2468                                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2469                                 surface->lightmapinfo->stainsamples = stainsamples;
2470                                 stainsamples += ssize * tsize * 3;
2471                         }
2472                 }
2473         }
2474
2475         // generate ushort elements array if possible
2476         if (loadmodel->surfmesh.data_element3s)
2477                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2478                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2479 }
2480
2481 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2482 {
2483         //if (node->parent)
2484         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2485         node->parent = parent;
2486         if (node->plane)
2487         {
2488                 // this is a node, recurse to children
2489                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2490                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2491                 // combine supercontents of children
2492                 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2493         }
2494         else
2495         {
2496                 int j;
2497                 mleaf_t *leaf = (mleaf_t *)node;
2498                 // if this is a leaf, calculate supercontents mask from all collidable
2499                 // primitives in the leaf (brushes and collision surfaces)
2500                 // also flag if the leaf contains any collision surfaces
2501                 leaf->combinedsupercontents = 0;
2502                 // combine the supercontents values of all brushes in this leaf
2503                 for (j = 0;j < leaf->numleafbrushes;j++)
2504                         leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2505                 // check if this leaf contains any collision surfaces (q3 patches)
2506                 for (j = 0;j < leaf->numleafsurfaces;j++)
2507                 {
2508                         msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2509                         if (surface->num_collisiontriangles)
2510                         {
2511                                 leaf->containscollisionsurfaces = true;
2512                                 leaf->combinedsupercontents |= surface->texture->supercontents;
2513                         }
2514                 }
2515         }
2516 }
2517
2518 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2519 {
2520         int                     i, j, count, p;
2521         dnode_t         *in;
2522         mnode_t         *out;
2523
2524         in = (dnode_t *)(mod_base + l->fileofs);
2525         if (l->filelen % sizeof(*in))
2526                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2527         count = l->filelen / sizeof(*in);
2528         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2529
2530         loadmodel->brush.data_nodes = out;
2531         loadmodel->brush.num_nodes = count;
2532
2533         for ( i=0 ; i<count ; i++, in++, out++)
2534         {
2535                 for (j=0 ; j<3 ; j++)
2536                 {
2537                         out->mins[j] = LittleShort(in->mins[j]);
2538                         out->maxs[j] = LittleShort(in->maxs[j]);
2539                 }
2540
2541                 p = LittleLong(in->planenum);
2542                 out->plane = loadmodel->brush.data_planes + p;
2543
2544                 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2545                 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2546
2547                 for (j=0 ; j<2 ; j++)
2548                 {
2549                         // LordHavoc: this code supports broken bsp files produced by
2550                         // arguire qbsp which can produce more than 32768 nodes, any value
2551                         // below count is assumed to be a node number, any other value is
2552                         // assumed to be a leaf number
2553                         p = (unsigned short)LittleShort(in->children[j]);
2554                         if (p < count)
2555                         {
2556                                 if (p < loadmodel->brush.num_nodes)
2557                                         out->children[j] = loadmodel->brush.data_nodes + p;
2558                                 else
2559                                 {
2560                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2561                                         // map it to the solid leaf
2562                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2563                                 }
2564                         }
2565                         else
2566                         {
2567                                 // note this uses 65535 intentionally, -1 is leaf 0
2568                                 p = 65535 - p;
2569                                 if (p < loadmodel->brush.num_leafs)
2570                                         out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2571                                 else
2572                                 {
2573                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2574                                         // map it to the solid leaf
2575                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2576                                 }
2577                         }
2578                 }
2579         }
2580
2581         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2582 }
2583
2584 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2585 {
2586         dleaf_t *in;
2587         mleaf_t *out;
2588         int i, j, count, p;
2589
2590         in = (dleaf_t *)(mod_base + l->fileofs);
2591         if (l->filelen % sizeof(*in))
2592                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2593         count = l->filelen / sizeof(*in);
2594         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2595
2596         loadmodel->brush.data_leafs = out;
2597         loadmodel->brush.num_leafs = count;
2598         // get visleafs from the submodel data
2599         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2600         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2601         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2602         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2603
2604         for ( i=0 ; i<count ; i++, in++, out++)
2605         {
2606                 for (j=0 ; j<3 ; j++)
2607                 {
2608                         out->mins[j] = LittleShort(in->mins[j]);
2609                         out->maxs[j] = LittleShort(in->maxs[j]);
2610                 }
2611
2612                 // FIXME: this function could really benefit from some error checking
2613
2614                 out->contents = LittleLong(in->contents);
2615
2616                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2617                 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2618                 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2619                 {
2620                         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);
2621                         out->firstleafsurface = NULL;
2622                         out->numleafsurfaces = 0;
2623                 }
2624
2625                 out->clusterindex = i - 1;
2626                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2627                         out->clusterindex = -1;
2628
2629                 p = LittleLong(in->visofs);
2630                 // ignore visofs errors on leaf 0 (solid)
2631                 if (p >= 0 && out->clusterindex >= 0)
2632                 {
2633                         if (p >= loadmodel->brushq1.num_compressedpvs)
2634                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2635                         else
2636                                 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);
2637                 }
2638
2639                 for (j = 0;j < 4;j++)
2640                         out->ambient_sound_level[j] = in->ambient_level[j];
2641
2642                 // FIXME: Insert caustics here
2643         }
2644 }
2645
2646 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2647 {
2648         int i, j;
2649         mleaf_t *leaf;
2650         const unsigned char *pvs;
2651         // if there's no vis data, assume supported (because everything is visible all the time)
2652         if (!loadmodel->brush.data_pvsclusters)
2653                 return true;
2654         // check all liquid leafs to see if they can see into empty leafs, if any
2655         // can we can assume this map supports r_wateralpha
2656         for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2657         {
2658                 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2659                 {
2660                         pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2661                         for (j = 0;j < loadmodel->brush.num_leafs;j++)
2662                                 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2663                                         return true;
2664                 }
2665         }
2666         return false;
2667 }
2668
2669 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2670 {
2671         dclipnode_t *in;
2672         mclipnode_t *out;
2673         int                     i, count;
2674         hull_t          *hull;
2675
2676         in = (dclipnode_t *)(mod_base + l->fileofs);
2677         if (l->filelen % sizeof(*in))
2678                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2679         count = l->filelen / sizeof(*in);
2680         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2681
2682         loadmodel->brushq1.clipnodes = out;
2683         loadmodel->brushq1.numclipnodes = count;
2684
2685         for (i = 1; i < MAX_MAP_HULLS; i++)
2686         {
2687                 hull = &loadmodel->brushq1.hulls[i];
2688                 hull->clipnodes = out;
2689                 hull->firstclipnode = 0;
2690                 hull->lastclipnode = count-1;
2691                 hull->planes = loadmodel->brush.data_planes;
2692                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2693                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2694                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2695                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2696                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2697                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2698                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2699         }
2700
2701         for (i=0 ; i<count ; i++, out++, in++)
2702         {
2703                 out->planenum = LittleLong(in->planenum);
2704                 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2705                 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2706                 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2707                 if (out->children[0] >= count)
2708                         out->children[0] -= 65536;
2709                 if (out->children[1] >= count)
2710                         out->children[1] -= 65536;
2711                 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2712                         Host_Error("Corrupt clipping hull(out of range planenum)");
2713         }
2714 }
2715
2716 //Duplicate the drawing hull structure as a clipping hull
2717 static void Mod_Q1BSP_MakeHull0(void)
2718 {
2719         mnode_t         *in;
2720         mclipnode_t *out;
2721         int                     i;
2722         hull_t          *hull;
2723
2724         hull = &loadmodel->brushq1.hulls[0];
2725
2726         in = loadmodel->brush.data_nodes;
2727         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2728
2729         hull->clipnodes = out;
2730         hull->firstclipnode = 0;
2731         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2732         hull->planes = loadmodel->brush.data_planes;
2733
2734         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2735         {
2736                 out->planenum = in->plane - loadmodel->brush.data_planes;
2737                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2738                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2739         }
2740 }
2741
2742 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2743 {
2744         int i, j;
2745         short *in;
2746
2747         in = (short *)(mod_base + l->fileofs);
2748         if (l->filelen % sizeof(*in))
2749                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2750         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2751         loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2752
2753         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2754         {
2755                 j = (unsigned short) LittleShort(in[i]);
2756                 if (j >= loadmodel->num_surfaces)
2757                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2758                 loadmodel->brush.data_leafsurfaces[i] = j;
2759         }
2760 }
2761
2762 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2763 {
2764         int             i;
2765         int             *in;
2766
2767         in = (int *)(mod_base + l->fileofs);
2768         if (l->filelen % sizeof(*in))
2769                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2770         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2771         loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2772
2773         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2774                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2775 }
2776
2777
2778 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2779 {
2780         int                     i;
2781         mplane_t        *out;
2782         dplane_t        *in;
2783
2784         in = (dplane_t *)(mod_base + l->fileofs);
2785         if (l->filelen % sizeof(*in))
2786                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2787
2788         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2789         loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2790
2791         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2792         {
2793                 out->normal[0] = LittleFloat(in->normal[0]);
2794                 out->normal[1] = LittleFloat(in->normal[1]);
2795                 out->normal[2] = LittleFloat(in->normal[2]);
2796                 out->dist = LittleFloat(in->dist);
2797
2798                 PlaneClassify(out);
2799         }
2800 }
2801
2802 static void Mod_Q1BSP_LoadMapBrushes(void)
2803 {
2804 #if 0
2805 // unfinished
2806         int submodel, numbrushes;
2807         qboolean firstbrush;
2808         char *text, *maptext;
2809         char mapfilename[MAX_QPATH];
2810         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2811         strlcat (mapfilename, ".map", sizeof (mapfilename));
2812         maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2813         if (!maptext)
2814                 return;
2815         text = maptext;
2816         if (!COM_ParseToken_Simple(&data, false, false))
2817                 return; // error
2818         submodel = 0;
2819         for (;;)
2820         {
2821                 if (!COM_ParseToken_Simple(&data, false, false))
2822                         break;
2823                 if (com_token[0] != '{')
2824                         return; // error
2825                 // entity
2826                 firstbrush = true;
2827                 numbrushes = 0;
2828                 maxbrushes = 256;
2829                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2830                 for (;;)
2831                 {
2832                         if (!COM_ParseToken_Simple(&data, false, false))
2833                                 return; // error
2834                         if (com_token[0] == '}')
2835                                 break; // end of entity
2836                         if (com_token[0] == '{')
2837                         {
2838                                 // brush
2839                                 if (firstbrush)
2840                                 {
2841                                         if (submodel)
2842                                         {
2843                                                 if (submodel > loadmodel->brush.numsubmodels)
2844                                                 {
2845                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2846                                                         model = NULL;
2847                                                 }
2848                                                 else
2849                                                         model = loadmodel->brush.submodels[submodel];
2850                                         }
2851                                         else
2852                                                 model = loadmodel;
2853                                 }
2854                                 for (;;)
2855                                 {
2856                                         if (!COM_ParseToken_Simple(&data, false, false))
2857                                                 return; // error
2858                                         if (com_token[0] == '}')
2859                                                 break; // end of brush
2860                                         // each brush face should be this format:
2861                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2862                                         // FIXME: support hl .map format
2863                                         for (pointnum = 0;pointnum < 3;pointnum++)
2864                                         {
2865                                                 COM_ParseToken_Simple(&data, false, false);
2866                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2867                                                 {
2868                                                         COM_ParseToken_Simple(&data, false, false);
2869                                                         point[pointnum][componentnum] = atof(com_token);
2870                                                 }
2871                                                 COM_ParseToken_Simple(&data, false, false);
2872                                         }
2873                                         COM_ParseToken_Simple(&data, false, false);
2874                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2875                                         COM_ParseToken_Simple(&data, false, false);
2876                                         //scroll_s = atof(com_token);
2877                                         COM_ParseToken_Simple(&data, false, false);
2878                                         //scroll_t = atof(com_token);
2879                                         COM_ParseToken_Simple(&data, false, false);
2880                                         //rotate = atof(com_token);
2881                                         COM_ParseToken_Simple(&data, false, false);
2882                                         //scale_s = atof(com_token);
2883                                         COM_ParseToken_Simple(&data, false, false);
2884                                         //scale_t = atof(com_token);
2885                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2886                                         VectorNormalizeDouble(planenormal);
2887                                         planedist = DotProduct(point[0], planenormal);
2888                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2889                                 }
2890                                 continue;
2891                         }
2892                 }
2893         }
2894 #endif
2895 }
2896
2897
2898 #define MAX_PORTALPOINTS 64
2899
2900 typedef struct portal_s
2901 {
2902         mplane_t plane;
2903         mnode_t *nodes[2];              // [0] = front side of plane
2904         struct portal_s *next[2];
2905         int numpoints;
2906         double points[3*MAX_PORTALPOINTS];
2907         struct portal_s *chain; // all portals are linked into a list
2908 }
2909 portal_t;
2910
2911 static portal_t *portalchain;
2912
2913 /*
2914 ===========
2915 AllocPortal
2916 ===========
2917 */
2918 static portal_t *AllocPortal(void)
2919 {
2920         portal_t *p;
2921         p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2922         p->chain = portalchain;
2923         portalchain = p;
2924         return p;
2925 }
2926
2927 static void FreePortal(portal_t *p)
2928 {
2929         Mem_Free(p);
2930 }
2931
2932 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2933 {
2934         // process only nodes (leafs already had their box calculated)
2935         if (!node->plane)
2936                 return;
2937
2938         // calculate children first
2939         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2940         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2941
2942         // make combined bounding box from children
2943         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2944         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2945         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2946         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2947         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2948         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2949 }
2950
2951 static void Mod_Q1BSP_FinalizePortals(void)
2952 {
2953         int i, j, numportals, numpoints;
2954         portal_t *p, *pnext;
2955         mportal_t *portal;
2956         mvertex_t *point;
2957         mleaf_t *leaf, *endleaf;
2958
2959         // tally up portal and point counts and recalculate bounding boxes for all
2960         // leafs (because qbsp is very sloppy)
2961         leaf = loadmodel->brush.data_leafs;
2962         endleaf = leaf + loadmodel->brush.num_leafs;
2963         for (;leaf < endleaf;leaf++)
2964         {
2965                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
2966                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2967         }
2968         p = portalchain;
2969         numportals = 0;
2970         numpoints = 0;
2971         while (p)
2972         {
2973                 // note: this check must match the one below or it will usually corrupt memory
2974                 // 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
2975                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2976                 {
2977                         numportals += 2;
2978                         numpoints += p->numpoints * 2;
2979                 }
2980                 p = p->chain;
2981         }
2982         loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2983         loadmodel->brush.num_portals = numportals;
2984         loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2985         loadmodel->brush.num_portalpoints = numpoints;
2986         // clear all leaf portal chains
2987         for (i = 0;i < loadmodel->brush.num_leafs;i++)
2988                 loadmodel->brush.data_leafs[i].portals = NULL;
2989         // process all portals in the global portal chain, while freeing them
2990         portal = loadmodel->brush.data_portals;
2991         point = loadmodel->brush.data_portalpoints;
2992         p = portalchain;
2993         portalchain = NULL;
2994         while (p)
2995         {
2996                 pnext = p->chain;
2997
2998                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2999                 {
3000                         // note: this check must match the one above or it will usually corrupt memory
3001                         // 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
3002                         if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3003                         {
3004                                 // first make the back to front portal(forward portal)
3005                                 portal->points = point;
3006                                 portal->numpoints = p->numpoints;
3007                                 portal->plane.dist = p->plane.dist;
3008                                 VectorCopy(p->plane.normal, portal->plane.normal);
3009                                 portal->here = (mleaf_t *)p->nodes[1];
3010                                 portal->past = (mleaf_t *)p->nodes[0];
3011                                 // copy points
3012                                 for (j = 0;j < portal->numpoints;j++)
3013                                 {
3014                                         VectorCopy(p->points + j*3, point->position);
3015                                         point++;
3016                                 }
3017                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3018                                 PlaneClassify(&portal->plane);
3019
3020                                 // link into leaf's portal chain
3021                                 portal->next = portal->here->portals;
3022                                 portal->here->portals = portal;
3023
3024                                 // advance to next portal
3025                                 portal++;
3026
3027                                 // then make the front to back portal(backward portal)
3028                                 portal->points = point;
3029                                 portal->numpoints = p->numpoints;
3030                                 portal->plane.dist = -p->plane.dist;
3031                                 VectorNegate(p->plane.normal, portal->plane.normal);
3032                                 portal->here = (mleaf_t *)p->nodes[0];
3033                                 portal->past = (mleaf_t *)p->nodes[1];
3034                                 // copy points
3035                                 for (j = portal->numpoints - 1;j >= 0;j--)
3036                                 {
3037                                         VectorCopy(p->points + j*3, point->position);
3038                                         point++;
3039                                 }
3040                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3041                                 PlaneClassify(&portal->plane);
3042
3043                                 // link into leaf's portal chain
3044                                 portal->next = portal->here->portals;
3045                                 portal->here->portals = portal;
3046
3047                                 // advance to next portal
3048                                 portal++;
3049                         }
3050                         // add the portal's polygon points to the leaf bounding boxes
3051                         for (i = 0;i < 2;i++)
3052                         {
3053                                 leaf = (mleaf_t *)p->nodes[i];
3054                                 for (j = 0;j < p->numpoints;j++)
3055                                 {
3056                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3057                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3058                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3059                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3060                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3061                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3062                                 }
3063                         }
3064                 }
3065                 FreePortal(p);
3066                 p = pnext;
3067         }
3068         // now recalculate the node bounding boxes from the leafs
3069         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
3070 }
3071
3072 /*
3073 =============
3074 AddPortalToNodes
3075 =============
3076 */
3077 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3078 {
3079         if (!front)
3080                 Host_Error("AddPortalToNodes: NULL front node");
3081         if (!back)
3082                 Host_Error("AddPortalToNodes: NULL back node");
3083         if (p->nodes[0] || p->nodes[1])
3084                 Host_Error("AddPortalToNodes: already included");
3085         // 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
3086
3087         p->nodes[0] = front;
3088         p->next[0] = (portal_t *)front->portals;
3089         front->portals = (mportal_t *)p;
3090
3091         p->nodes[1] = back;
3092         p->next[1] = (portal_t *)back->portals;
3093         back->portals = (mportal_t *)p;
3094 }
3095
3096 /*
3097 =============
3098 RemovePortalFromNode
3099 =============
3100 */
3101 static void RemovePortalFromNodes(portal_t *portal)
3102 {
3103         int i;
3104         mnode_t *node;
3105         void **portalpointer;
3106         portal_t *t;
3107         for (i = 0;i < 2;i++)
3108         {
3109                 node = portal->nodes[i];
3110
3111                 portalpointer = (void **) &node->portals;
3112                 while (1)
3113                 {
3114                         t = (portal_t *)*portalpointer;
3115                         if (!t)
3116                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
3117
3118                         if (t == portal)
3119                         {
3120                                 if (portal->nodes[0] == node)
3121                                 {
3122                                         *portalpointer = portal->next[0];
3123                                         portal->nodes[0] = NULL;
3124                                 }
3125                                 else if (portal->nodes[1] == node)
3126                                 {
3127                                         *portalpointer = portal->next[1];
3128                                         portal->nodes[1] = NULL;
3129                                 }
3130                                 else
3131                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3132                                 break;
3133                         }
3134
3135                         if (t->nodes[0] == node)
3136                                 portalpointer = (void **) &t->next[0];
3137                         else if (t->nodes[1] == node)
3138                                 portalpointer = (void **) &t->next[1];
3139                         else
3140                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3141                 }
3142         }
3143 }
3144
3145 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3146 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3147 {
3148         int i, side;
3149         mnode_t *front, *back, *other_node;
3150         mplane_t clipplane, *plane;
3151         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3152         int numfrontpoints, numbackpoints;
3153         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3154
3155         // if a leaf, we're done
3156         if (!node->plane)
3157                 return;
3158
3159         plane = node->plane;
3160
3161         front = node->children[0];
3162         back = node->children[1];
3163         if (front == back)
3164                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3165
3166         // create the new portal by generating a polygon for the node plane,
3167         // and clipping it by all of the other portals(which came from nodes above this one)
3168         nodeportal = AllocPortal();
3169         nodeportal->plane = *plane;
3170
3171         // 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)
3172         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);
3173         nodeportal->numpoints = 4;
3174         side = 0;       // shut up compiler warning
3175         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3176         {
3177                 clipplane = portal->plane;
3178                 if (portal->nodes[0] == portal->nodes[1])
3179                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3180                 if (portal->nodes[0] == node)
3181                         side = 0;
3182                 else if (portal->nodes[1] == node)
3183                 {
3184                         clipplane.dist = -clipplane.dist;
3185                         VectorNegate(clipplane.normal, clipplane.normal);
3186                         side = 1;
3187                 }
3188                 else
3189                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3190
3191                 for (i = 0;i < nodeportal->numpoints*3;i++)
3192                         frontpoints[i] = nodeportal->points[i];
3193                 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);
3194                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3195                         break;
3196         }
3197
3198         if (nodeportal->numpoints < 3)
3199         {
3200                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3201                 nodeportal->numpoints = 0;
3202         }
3203         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3204         {
3205                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3206                 nodeportal->numpoints = 0;
3207         }
3208
3209         AddPortalToNodes(nodeportal, front, back);
3210
3211         // split the portals of this node along this node's plane and assign them to the children of this node
3212         // (migrating the portals downward through the tree)
3213         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3214         {
3215                 if (portal->nodes[0] == portal->nodes[1])
3216                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3217                 if (portal->nodes[0] == node)
3218                         side = 0;
3219                 else if (portal->nodes[1] == node)
3220                         side = 1;
3221                 else
3222                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3223                 nextportal = portal->next[side];
3224                 if (!portal->numpoints)
3225                         continue;
3226
3227                 other_node = portal->nodes[!side];
3228                 RemovePortalFromNodes(portal);
3229
3230                 // cut the portal into two portals, one on each side of the node plane
3231                 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);
3232
3233                 if (!numfrontpoints)
3234                 {
3235                         if (side == 0)
3236                                 AddPortalToNodes(portal, back, other_node);
3237                         else
3238                                 AddPortalToNodes(portal, other_node, back);
3239                         continue;
3240                 }
3241                 if (!numbackpoints)
3242                 {
3243                         if (side == 0)
3244                                 AddPortalToNodes(portal, front, other_node);
3245                         else
3246                                 AddPortalToNodes(portal, other_node, front);
3247                         continue;
3248                 }
3249
3250                 // the portal is split
3251                 splitportal = AllocPortal();
3252                 temp = splitportal->chain;
3253                 *splitportal = *portal;
3254                 splitportal->chain = temp;
3255                 for (i = 0;i < numbackpoints*3;i++)
3256                         splitportal->points[i] = backpoints[i];
3257                 splitportal->numpoints = numbackpoints;
3258                 for (i = 0;i < numfrontpoints*3;i++)
3259                         portal->points[i] = frontpoints[i];
3260                 portal->numpoints = numfrontpoints;
3261
3262                 if (side == 0)
3263                 {
3264                         AddPortalToNodes(portal, front, other_node);
3265                         AddPortalToNodes(splitportal, back, other_node);
3266                 }
3267                 else
3268                 {
3269                         AddPortalToNodes(portal, other_node, front);
3270                         AddPortalToNodes(splitportal, other_node, back);
3271                 }
3272         }
3273
3274         Mod_Q1BSP_RecursiveNodePortals(front);
3275         Mod_Q1BSP_RecursiveNodePortals(back);
3276 }
3277
3278 static void Mod_Q1BSP_MakePortals(void)
3279 {
3280         portalchain = NULL;
3281         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3282         Mod_Q1BSP_FinalizePortals();
3283 }
3284
3285 //Returns PVS data for a given point
3286 //(note: can return NULL)
3287 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3288 {
3289         mnode_t *node;
3290         node = model->brush.data_nodes;
3291         while (node->plane)
3292                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3293         if (((mleaf_t *)node)->clusterindex >= 0)
3294                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3295         else
3296                 return NULL;
3297 }
3298
3299 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)
3300 {
3301         while (node->plane)
3302         {
3303                 float d = PlaneDiff(org, node->plane);
3304                 if (d > radius)
3305                         node = node->children[0];
3306                 else if (d < -radius)
3307                         node = node->children[1];
3308                 else
3309                 {
3310                         // go down both sides
3311                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3312                         node = node->children[1];
3313                 }
3314         }
3315         // if this leaf is in a cluster, accumulate the pvs bits
3316         if (((mleaf_t *)node)->clusterindex >= 0)
3317         {
3318                 int i;
3319                 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3320                 for (i = 0;i < pvsbytes;i++)
3321                         pvsbuffer[i] |= pvs[i];
3322         }
3323 }
3324
3325 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3326 //of the given point.
3327 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3328 {
3329         int bytes = model->brush.num_pvsclusterbytes;
3330         bytes = min(bytes, pvsbufferlength);
3331         if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3332         {
3333                 memset(pvsbuffer, 0xFF, bytes);
3334                 return bytes;
3335         }
3336         if (!merge)
3337                 memset(pvsbuffer, 0, bytes);
3338         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3339         return bytes;
3340 }
3341
3342 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3343 {
3344         vec3_t size;
3345         const hull_t *hull;
3346
3347         VectorSubtract(inmaxs, inmins, size);
3348         if (cmodel->brush.ishlbsp)
3349         {
3350                 if (size[0] < 3)
3351                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3352                 else if (size[0] <= 32)
3353                 {
3354                         if (size[2] < 54) // pick the nearest of 36 or 72
3355                                 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3356                         else
3357                                 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3358                 }
3359                 else
3360                         hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3361         }
3362         else
3363         {
3364                 if (size[0] < 3)
3365                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3366                 else if (size[0] <= 32)
3367                         hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3368                 else
3369                         hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3370         }
3371         VectorCopy(inmins, outmins);
3372         VectorAdd(inmins, hull->clip_size, outmaxs);
3373 }
3374
3375 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3376 {
3377         int i, j, k;
3378         dheader_t *header;
3379         dmodel_t *bm;
3380         mempool_t *mainmempool;
3381         float dist, modelyawradius, modelradius;
3382         msurface_t *surface;
3383         int numshadowmeshtriangles;
3384         hullinfo_t hullinfo;
3385         int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3386         model_brush_lightstyleinfo_t styleinfo[256];
3387         unsigned char *datapointer;
3388
3389         mod->modeldatatypestring = "Q1BSP";
3390
3391         mod->type = mod_brushq1;
3392
3393         header = (dheader_t *)buffer;
3394
3395         i = LittleLong(header->version);
3396         if (i != BSPVERSION && i != 30)
3397                 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3398         mod->brush.ishlbsp = i == 30;
3399
3400 // fill in hull info
3401         VectorClear (hullinfo.hullsizes[0][0]);
3402         VectorClear (hullinfo.hullsizes[0][1]);
3403         if (mod->brush.ishlbsp)
3404         {
3405                 mod->modeldatatypestring = "HLBSP";
3406
3407                 hullinfo.filehulls = 4;
3408                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3409                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3410                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3411                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3412                 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3413                 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3414         }
3415         else
3416         {
3417                 hullinfo.filehulls = 4;
3418                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3419                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3420                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3421                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3422         }
3423
3424 // read lumps
3425         mod_base = (unsigned char*)buffer;
3426         for (i = 0; i < HEADER_LUMPS; i++)
3427         {
3428                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3429                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3430         }
3431
3432         mod->soundfromcenter = true;
3433         mod->TraceBox = Mod_Q1BSP_TraceBox;
3434         mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3435         mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3436         mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3437         mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3438         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3439         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3440         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3441         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3442         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3443         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3444         mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3445         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3446         mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3447         mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3448         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3449         mod->Draw = R_Q1BSP_Draw;
3450         mod->DrawDepth = R_Q1BSP_DrawDepth;
3451         mod->DrawDebug = R_Q1BSP_DrawDebug;
3452         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3453         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3454         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3455         mod->DrawLight = R_Q1BSP_DrawLight;
3456
3457 // load into heap
3458
3459         mod->brush.qw_md4sum = 0;
3460         mod->brush.qw_md4sum2 = 0;
3461         for (i = 0;i < HEADER_LUMPS;i++)
3462         {
3463                 if (i == LUMP_ENTITIES)
3464                         continue;
3465                 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3466                 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3467                         continue;
3468                 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3469         }
3470
3471         Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3472         Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3473         Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3474         Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3475         Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3476         Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3477         Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3478         Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3479         Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3480         Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3481         Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3482         // load submodels before leafs because they contain the number of vis leafs
3483         Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3484         Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3485         Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3486         Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3487
3488         // check if the map supports transparent water rendering
3489         loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3490
3491         if (mod->brushq1.data_compressedpvs)
3492                 Mem_Free(mod->brushq1.data_compressedpvs);
3493         mod->brushq1.data_compressedpvs = NULL;
3494         mod->brushq1.num_compressedpvs = 0;
3495
3496         Mod_Q1BSP_MakeHull0();
3497         Mod_Q1BSP_MakePortals();
3498
3499         mod->numframes = 2;             // regular and alternate animation
3500         mod->numskins = 1;
3501
3502         mainmempool = mod->mempool;
3503
3504         // make a single combined shadow mesh to allow optimized shadow volume creation
3505         numshadowmeshtriangles = 0;
3506         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3507         {
3508                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3509                 numshadowmeshtriangles += surface->num_triangles;
3510         }
3511         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3512         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3513                 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, loadmodel->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
3514         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3515         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3516
3517         if (loadmodel->brush.numsubmodels)
3518                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3519
3520         // LordHavoc: to clear the fog around the original quake submodel code, I
3521         // will explain:
3522         // first of all, some background info on the submodels:
3523         // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3524         // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3525         // now the weird for loop itself:
3526         // the loop functions in an odd way, on each iteration it sets up the
3527         // current 'mod' model (which despite the confusing code IS the model of
3528         // the number i), at the end of the loop it duplicates the model to become
3529         // the next submodel, and loops back to set up the new submodel.
3530
3531         // LordHavoc: now the explanation of my sane way (which works identically):
3532         // set up the world model, then on each submodel copy from the world model
3533         // and set up the submodel with the respective model info.
3534         totalstylesurfaces = 0;
3535         totalstyles = 0;
3536         for (i = 0;i < mod->brush.numsubmodels;i++)
3537         {
3538                 memset(stylecounts, 0, sizeof(stylecounts));
3539                 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3540                 {
3541                         surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3542                         for (j = 0;j < MAXLIGHTMAPS;j++)
3543                                 stylecounts[surface->lightmapinfo->styles[j]]++;
3544                 }
3545                 for (k = 0;k < 255;k++)
3546                 {
3547                         totalstyles++;
3548                         if (stylecounts[k])
3549                                 totalstylesurfaces += stylecounts[k];
3550                 }
3551         }
3552         datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3553         for (i = 0;i < mod->brush.numsubmodels;i++)
3554         {
3555                 // LordHavoc: this code was originally at the end of this loop, but
3556                 // has been transformed to something more readable at the start here.
3557
3558                 if (i > 0)
3559                 {
3560                         char name[10];
3561                         // duplicate the basic information
3562                         dpsnprintf(name, sizeof(name), "*%i", i);
3563                         mod = Mod_FindName(name, loadmodel->name);
3564                         // copy the base model to this one
3565                         *mod = *loadmodel;
3566                         // rename the clone back to its proper name
3567                         strlcpy(mod->name, name, sizeof(mod->name));
3568                         mod->brush.parentmodel = loadmodel;
3569                         // textures and memory belong to the main model
3570                         mod->texturepool = NULL;
3571                         mod->mempool = NULL;
3572                         mod->brush.TraceLineOfSight = NULL;
3573                         mod->brush.GetPVS = NULL;
3574                         mod->brush.FatPVS = NULL;
3575                         mod->brush.BoxTouchingPVS = NULL;
3576                         mod->brush.BoxTouchingLeafPVS = NULL;
3577                         mod->brush.BoxTouchingVisibleLeafs = NULL;
3578                         mod->brush.FindBoxClusters = NULL;
3579                         mod->brush.LightPoint = NULL;
3580                         mod->brush.AmbientSoundLevelsForPoint = NULL;
3581                 }
3582
3583                 mod->brush.submodel = i;
3584
3585                 if (loadmodel->brush.submodels)
3586                         loadmodel->brush.submodels[i] = mod;
3587
3588                 bm = &mod->brushq1.submodels[i];
3589
3590                 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3591                 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3592                 {
3593                         mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3594                         mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3595                 }
3596
3597                 mod->firstmodelsurface = bm->firstface;
3598                 mod->nummodelsurfaces = bm->numfaces;
3599
3600                 // make the model surface list (used by shadowing/lighting)
3601                 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3602                 Mod_MakeSortedSurfaces(mod);
3603
3604                 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3605                 // (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)
3606                 VectorCopy(bm->mins, mod->normalmins);
3607                 VectorCopy(bm->maxs, mod->normalmaxs);
3608                 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3609                 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3610                 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3611                 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3612                 modelradius = modelyawradius + modelradius * modelradius;
3613                 modelyawradius = sqrt(modelyawradius);
3614                 modelradius = sqrt(modelradius);
3615                 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3616                 mod->yawmins[2] = mod->normalmins[2];
3617                 mod->yawmaxs[0] = mod->yawmaxs[1] =  modelyawradius;
3618                 mod->yawmaxs[2] = mod->normalmaxs[2];
3619                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3620                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] =  modelradius;
3621                 mod->radius = modelradius;
3622                 mod->radius2 = modelradius * modelradius;
3623
3624                 // this gets altered below if sky or water is used
3625                 mod->DrawSky = NULL;
3626                 mod->DrawAddWaterPlanes = NULL;
3627
3628                 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3629                 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3630                 if (mod->nummodelsurfaces)
3631                 {
3632                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3633                                 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3634                                         break;
3635                         if (j < mod->nummodelsurfaces)
3636                                 mod->DrawSky = R_Q1BSP_DrawSky;
3637
3638                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3639                                 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3640                                         break;
3641                         if (j < mod->nummodelsurfaces)
3642                                 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3643
3644                         // build lightstyle update chains
3645                         // (used to rapidly mark lightmapupdateflags on many surfaces
3646                         // when d_lightstylevalue changes)
3647                         memset(stylecounts, 0, sizeof(stylecounts));
3648                         for (k = 0;k < mod->nummodelsurfaces;k++)
3649                         {
3650                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3651                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3652                                         stylecounts[surface->lightmapinfo->styles[j]]++;
3653                         }
3654                         mod->brushq1.num_lightstyles = 0;
3655                         for (k = 0;k < 255;k++)
3656                         {
3657                                 if (stylecounts[k])
3658                                 {
3659                                         styleinfo[mod->brushq1.num_lightstyles].style = k;
3660                                         styleinfo[mod->brushq1.num_lightstyles].value = 0;
3661                                         styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3662                                         styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3663                                         remapstyles[k] = mod->brushq1.num_lightstyles;
3664                                         mod->brushq1.num_lightstyles++;
3665                                 }
3666                         }
3667                         for (k = 0;k < mod->nummodelsurfaces;k++)
3668                         {
3669                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3670                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3671                                 {
3672                                         if (surface->lightmapinfo->styles[j] != 255)
3673                                         {
3674                                                 int r = remapstyles[surface->lightmapinfo->styles[j]];
3675                                                 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3676                                         }
3677                                 }
3678                         }
3679                         mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3680                         memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3681                 }
3682                 else
3683                 {
3684                         // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3685                         Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3686                 }
3687                 //mod->brushq1.num_visleafs = bm->visleafs;
3688         }
3689
3690         Mod_Q1BSP_LoadMapBrushes();
3691
3692         //Mod_Q1BSP_ProcessLightList();
3693
3694         if (developer.integer >= 10)
3695                 Con_Printf("Some stats for q1bsp model \"%s\": %i faces, %i nodes, %i leafs, %i visleafs, %i visleafportals\n", loadmodel->name, loadmodel->num_surfaces, loadmodel->brush.num_nodes, loadmodel->brush.num_leafs, mod->brush.num_pvsclusters, loadmodel->brush.num_portals);
3696 }
3697
3698 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3699 {
3700 }
3701
3702 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3703 {
3704 /*
3705         d_t *in;
3706         m_t *out;
3707         int i, count;
3708
3709         in = (void *)(mod_base + l->fileofs);
3710         if (l->filelen % sizeof(*in))
3711                 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3712         count = l->filelen / sizeof(*in);
3713         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3714
3715         loadmodel-> = out;
3716         loadmodel->num = count;
3717
3718         for (i = 0;i < count;i++, in++, out++)
3719         {
3720         }
3721 */
3722 }
3723
3724 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3725 {
3726 /*
3727         d_t *in;
3728         m_t *out;
3729         int i, count;
3730
3731         in = (void *)(mod_base + l->fileofs);
3732         if (l->filelen % sizeof(*in))
3733                 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3734         count = l->filelen / sizeof(*in);
3735         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3736
3737         loadmodel-> = out;
3738         loadmodel->num = count;
3739
3740         for (i = 0;i < count;i++, in++, out++)
3741         {
3742         }
3743 */
3744 }
3745
3746 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3747 {
3748 /*
3749         d_t *in;
3750         m_t *out;
3751         int i, count;
3752
3753         in = (void *)(mod_base + l->fileofs);
3754         if (l->filelen % sizeof(*in))
3755                 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3756         count = l->filelen / sizeof(*in);
3757         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3758
3759         loadmodel-> = out;
3760         loadmodel->num = count;
3761
3762         for (i = 0;i < count;i++, in++, out++)
3763         {
3764         }
3765 */
3766 }
3767
3768 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3769 {
3770 /*
3771         d_t *in;
3772         m_t *out;
3773         int i, count;
3774
3775         in = (void *)(mod_base + l->fileofs);
3776         if (l->filelen % sizeof(*in))
3777                 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3778         count = l->filelen / sizeof(*in);
3779         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3780
3781         loadmodel-> = out;
3782         loadmodel->num = count;
3783
3784         for (i = 0;i < count;i++, in++, out++)
3785         {
3786         }
3787 */
3788 }
3789
3790 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3791 {
3792 /*
3793         d_t *in;
3794         m_t *out;
3795         int i, count;
3796
3797         in = (void *)(mod_base + l->fileofs);
3798         if (l->filelen % sizeof(*in))
3799                 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3800         count = l->filelen / sizeof(*in);
3801         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3802
3803         loadmodel-> = out;
3804         loadmodel->num = count;
3805
3806         for (i = 0;i < count;i++, in++, out++)
3807         {
3808         }
3809 */
3810 }
3811
3812 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3813 {
3814 /*
3815         d_t *in;
3816         m_t *out;
3817         int i, count;
3818
3819         in = (void *)(mod_base + l->fileofs);
3820         if (l->filelen % sizeof(*in))
3821                 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3822         count = l->filelen / sizeof(*in);
3823         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3824
3825         loadmodel-> = out;
3826         loadmodel->num = count;
3827
3828         for (i = 0;i < count;i++, in++, out++)
3829         {
3830         }
3831 */
3832 }
3833
3834 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3835 {
3836 /*
3837         d_t *in;
3838         m_t *out;
3839         int i, count;
3840
3841         in = (void *)(mod_base + l->fileofs);
3842         if (l->filelen % sizeof(*in))
3843                 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3844         count = l->filelen / sizeof(*in);
3845         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3846
3847         loadmodel-> = out;
3848         loadmodel->num = count;
3849
3850         for (i = 0;i < count;i++, in++, out++)
3851         {
3852         }
3853 */
3854 }
3855
3856 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3857 {
3858 /*
3859         d_t *in;
3860         m_t *out;
3861         int i, count;
3862
3863         in = (void *)(mod_base + l->fileofs);
3864         if (l->filelen % sizeof(*in))
3865                 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3866         count = l->filelen / sizeof(*in);
3867         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3868
3869         loadmodel-> = out;
3870         loadmodel->num = count;
3871
3872         for (i = 0;i < count;i++, in++, out++)
3873         {
3874         }
3875 */
3876 }
3877
3878 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3879 {
3880 /*
3881         d_t *in;
3882         m_t *out;
3883         int i, count;
3884
3885         in = (void *)(mod_base + l->fileofs);
3886         if (l->filelen % sizeof(*in))
3887                 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3888         count = l->filelen / sizeof(*in);
3889         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3890
3891         loadmodel-> = out;
3892         loadmodel->num = count;
3893
3894         for (i = 0;i < count;i++, in++, out++)
3895         {
3896         }
3897 */
3898 }
3899
3900 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3901 {
3902 /*
3903         d_t *in;
3904         m_t *out;
3905         int i, count;
3906
3907         in = (void *)(mod_base + l->fileofs);
3908         if (l->filelen % sizeof(*in))
3909                 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3910         count = l->filelen / sizeof(*in);
3911         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3912
3913         loadmodel-> = out;
3914         loadmodel->num = count;
3915
3916         for (i = 0;i < count;i++, in++, out++)
3917         {
3918         }
3919 */
3920 }
3921
3922 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3923 {
3924 /*
3925         d_t *in;
3926         m_t *out;
3927         int i, count;
3928
3929         in = (void *)(mod_base + l->fileofs);
3930         if (l->filelen % sizeof(*in))
3931                 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3932         count = l->filelen / sizeof(*in);
3933         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3934
3935         loadmodel-> = out;
3936         loadmodel->num = count;
3937
3938         for (i = 0;i < count;i++, in++, out++)
3939         {
3940         }
3941 */
3942 }
3943
3944 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3945 {
3946 /*
3947         d_t *in;
3948         m_t *out;
3949         int i, count;
3950
3951         in = (void *)(mod_base + l->fileofs);
3952         if (l->filelen % sizeof(*in))
3953                 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3954         count = l->filelen / sizeof(*in);
3955         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3956
3957         loadmodel-> = out;
3958         loadmodel->num = count;
3959
3960         for (i = 0;i < count;i++, in++, out++)
3961         {
3962         }
3963 */
3964 }
3965
3966 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3967 {
3968 /*
3969         d_t *in;
3970         m_t *out;
3971         int i, count;
3972
3973         in = (void *)(mod_base + l->fileofs);
3974         if (l->filelen % sizeof(*in))
3975                 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3976         count = l->filelen / sizeof(*in);
3977         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3978
3979         loadmodel-> = out;
3980         loadmodel->num = count;
3981
3982         for (i = 0;i < count;i++, in++, out++)
3983         {
3984         }
3985 */
3986 }
3987
3988 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
3989 {
3990 /*
3991         d_t *in;
3992         m_t *out;
3993         int i, count;
3994
3995         in = (void *)(mod_base + l->fileofs);
3996         if (l->filelen % sizeof(*in))
3997                 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3998         count = l->filelen / sizeof(*in);
3999         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4000
4001         loadmodel-> = out;
4002         loadmodel->num = count;
4003
4004         for (i = 0;i < count;i++, in++, out++)
4005         {
4006         }
4007 */
4008 }
4009
4010 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4011 {
4012 /*
4013         d_t *in;
4014         m_t *out;
4015         int i, count;
4016
4017         in = (void *)(mod_base + l->fileofs);
4018         if (l->filelen % sizeof(*in))
4019                 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4020         count = l->filelen / sizeof(*in);
4021         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4022
4023         loadmodel-> = out;
4024         loadmodel->num = count;
4025
4026         for (i = 0;i < count;i++, in++, out++)
4027         {
4028         }
4029 */
4030 }
4031
4032 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4033 {
4034 /*
4035         d_t *in;
4036         m_t *out;
4037         int i, count;
4038
4039         in = (void *)(mod_base + l->fileofs);
4040         if (l->filelen % sizeof(*in))
4041                 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4042         count = l->filelen / sizeof(*in);
4043         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4044
4045         loadmodel-> = out;
4046         loadmodel->num = count;
4047
4048         for (i = 0;i < count;i++, in++, out++)
4049         {
4050         }
4051 */
4052 }
4053
4054 static void Mod_Q2BSP_LoadModels(lump_t *l)
4055 {
4056 /*
4057         d_t *in;
4058         m_t *out;
4059         int i, count;
4060
4061         in = (void *)(mod_base + l->fileofs);
4062         if (l->filelen % sizeof(*in))
4063                 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4064         count = l->filelen / sizeof(*in);
4065         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4066
4067         loadmodel-> = out;
4068         loadmodel->num = count;
4069
4070         for (i = 0;i < count;i++, in++, out++)
4071         {
4072         }
4073 */
4074 }
4075
4076 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4077 {
4078         int i;
4079         q2dheader_t *header;
4080
4081         Host_Error("Mod_Q2BSP_Load: not yet implemented");
4082
4083         mod->modeldatatypestring = "Q2BSP";
4084
4085         mod->type = mod_brushq2;
4086
4087         header = (q2dheader_t *)buffer;
4088
4089         i = LittleLong(header->version);
4090         if (i != Q2BSPVERSION)
4091                 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4092
4093         mod_base = (unsigned char *)header;
4094
4095         // swap all the lumps
4096         for (i = 0;i < (int) sizeof(*header) / 4;i++)
4097                 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4098
4099         mod->brush.qw_md4sum = 0;
4100         mod->brush.qw_md4sum2 = 0;
4101         for (i = 0;i < Q2HEADER_LUMPS;i++)
4102         {
4103                 if (i == Q2LUMP_ENTITIES)
4104                         continue;
4105                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4106                 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4107                         continue;
4108                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4109         }
4110
4111         Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4112         Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4113         Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4114         Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4115         Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4116         Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4117         Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4118         Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4119         Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4120         Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4121         Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4122         Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4123         Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4124         Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4125         Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4126         Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4127         Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4128         // LordHavoc: must go last because this makes the submodels
4129         Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4130 }
4131
4132 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4133 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4134
4135 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4136 {
4137         const char *data;
4138         char key[128], value[MAX_INPUTLINE];
4139         float v[3];
4140         loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4141         loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4142         loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4143         if (!l->filelen)
4144                 return;
4145         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4146         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4147         loadmodel->brush.entities[l->filelen] = 0;
4148         data = loadmodel->brush.entities;
4149         // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4150         if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4151         {
4152                 while (1)
4153                 {
4154                         if (!COM_ParseToken_Simple(&data, false, false))
4155                                 break; // error
4156                         if (com_token[0] == '}')
4157                                 break; // end of worldspawn
4158                         if (com_token[0] == '_')
4159                                 strlcpy(key, com_token + 1, sizeof(key));
4160                         else
4161                                 strlcpy(key, com_token, sizeof(key));
4162                         while (key[strlen(key)-1] == ' ') // remove trailing spaces
4163                                 key[strlen(key)-1] = 0;
4164                         if (!COM_ParseToken_Simple(&data, false, false))
4165                                 break; // error
4166                         strlcpy(value, com_token, sizeof(value));
4167                         if (!strcmp("gridsize", key))
4168                         {
4169 #if _MSC_VER >= 1400
4170 #define sscanf sscanf_s
4171 #endif
4172                                 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4173                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4174                         }
4175                 }
4176         }
4177 }
4178
4179 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4180 {
4181         q3dtexture_t *in;
4182         texture_t *out;
4183         int i, count;
4184
4185         in = (q3dtexture_t *)(mod_base + l->fileofs);
4186         if (l->filelen % sizeof(*in))
4187                 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4188         count = l->filelen / sizeof(*in);
4189         out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4190
4191         loadmodel->data_textures = out;
4192         loadmodel->num_textures = count;
4193         loadmodel->num_texturesperskin = loadmodel->num_textures;
4194
4195         for (i = 0;i < count;i++)
4196         {
4197                 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4198                 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4199                 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4200         }
4201
4202         if (cls.state == ca_dedicated)
4203                 return;
4204
4205         for (i = 0;i < count;i++, in++, out++)
4206                 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4207 }
4208
4209 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4210 {
4211         q3dplane_t *in;
4212         mplane_t *out;
4213         int i, count;
4214
4215         in = (q3dplane_t *)(mod_base + l->fileofs);
4216         if (l->filelen % sizeof(*in))
4217                 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4218         count = l->filelen / sizeof(*in);
4219         out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4220
4221         loadmodel->brush.data_planes = out;
4222         loadmodel->brush.num_planes = count;
4223
4224         for (i = 0;i < count;i++, in++, out++)
4225         {
4226                 out->normal[0] = LittleFloat(in->normal[0]);
4227                 out->normal[1] = LittleFloat(in->normal[1]);
4228                 out->normal[2] = LittleFloat(in->normal[2]);
4229                 out->dist = LittleFloat(in->dist);
4230                 PlaneClassify(out);
4231         }
4232 }
4233
4234 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4235 {
4236         q3dbrushside_t *in;
4237         q3mbrushside_t *out;
4238         int i, n, count;
4239
4240         in = (q3dbrushside_t *)(mod_base + l->fileofs);
4241         if (l->filelen % sizeof(*in))
4242                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4243         count = l->filelen / sizeof(*in);
4244         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4245
4246         loadmodel->brush.data_brushsides = out;
4247         loadmodel->brush.num_brushsides = count;
4248
4249         for (i = 0;i < count;i++, in++, out++)
4250         {
4251                 n = LittleLong(in->planeindex);
4252                 if (n < 0 || n >= loadmodel->brush.num_planes)
4253                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4254                 out->plane = loadmodel->brush.data_planes + n;
4255                 n = LittleLong(in->textureindex);
4256                 if (n < 0 || n >= loadmodel->num_textures)
4257                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4258                 out->texture = loadmodel->data_textures + n;
4259         }
4260 }
4261
4262 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4263 {
4264         q3dbrushside_ig_t *in;
4265         q3mbrushside_t *out;
4266         int i, n, count;
4267
4268         in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4269         if (l->filelen % sizeof(*in))
4270                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4271         count = l->filelen / sizeof(*in);
4272         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4273
4274         loadmodel->brush.data_brushsides = out;
4275         loadmodel->brush.num_brushsides = count;
4276
4277         for (i = 0;i < count;i++, in++, out++)
4278         {
4279                 n = LittleLong(in->planeindex);
4280                 if (n < 0 || n >= loadmodel->brush.num_planes)
4281                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4282                 out->plane = loadmodel->brush.data_planes + n;
4283                 n = LittleLong(in->textureindex);
4284                 if (n < 0 || n >= loadmodel->num_textures)
4285                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4286                 out->texture = loadmodel->data_textures + n;
4287         }
4288 }
4289
4290 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4291 {
4292         q3dbrush_t *in;
4293         q3mbrush_t *out;
4294         int i, j, n, c, count, maxplanes;
4295         colplanef_t *planes;
4296
4297         in = (q3dbrush_t *)(mod_base + l->fileofs);
4298         if (l->filelen % sizeof(*in))
4299                 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4300         count = l->filelen / sizeof(*in);
4301         out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4302
4303         loadmodel->brush.data_brushes = out;
4304         loadmodel->brush.num_brushes = count;
4305
4306         maxplanes = 0;
4307         planes = NULL;
4308
4309         for (i = 0;i < count;i++, in++, out++)
4310         {
4311                 n = LittleLong(in->firstbrushside);
4312                 c = LittleLong(in->numbrushsides);
4313                 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4314                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4315                 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4316                 out->numbrushsides = c;
4317                 n = LittleLong(in->textureindex);
4318                 if (n < 0 || n >= loadmodel->num_textures)
4319                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4320                 out->texture = loadmodel->data_textures + n;
4321
4322                 // make a list of mplane_t structs to construct a colbrush from
4323                 if (maxplanes < out->numbrushsides)
4324                 {
4325                         maxplanes = out->numbrushsides;
4326                         if (planes)
4327                                 Mem_Free(planes);
4328                         planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4329                 }
4330                 for (j = 0;j < out->numbrushsides;j++)
4331                 {
4332                         VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4333                         planes[j].dist = out->firstbrushside[j].plane->dist;
4334                         planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4335                         planes[j].texture = out->firstbrushside[j].texture;
4336                 }
4337                 // make the colbrush from the planes
4338                 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4339
4340                 // this whole loop can take a while (e.g. on redstarrepublic4)
4341                 CL_KeepaliveMessage(false);
4342         }
4343         if (planes)
4344                 Mem_Free(planes);
4345 }
4346
4347 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4348 {
4349         q3deffect_t *in;
4350         q3deffect_t *out;
4351         int i, n, count;
4352
4353         in = (q3deffect_t *)(mod_base + l->fileofs);
4354         if (l->filelen % sizeof(*in))
4355                 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4356         count = l->filelen / sizeof(*in);
4357         out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4358
4359         loadmodel->brushq3.data_effects = out;
4360         loadmodel->brushq3.num_effects = count;
4361
4362         for (i = 0;i < count;i++, in++, out++)
4363         {
4364                 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4365                 n = LittleLong(in->brushindex);
4366                 if (n >= loadmodel->brush.num_brushes)
4367                 {
4368                         Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4369                         n = -1;
4370                 }
4371                 out->brushindex = n;
4372                 out->unknown = LittleLong(in->unknown);
4373         }
4374 }
4375
4376 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4377 {
4378         q3dvertex_t *in;
4379         int i, count;
4380
4381         in = (q3dvertex_t *)(mod_base + l->fileofs);
4382         if (l->filelen % sizeof(*in))
4383                 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4384         loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4385         loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4386         loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4387         loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4388         loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4389         loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4390
4391         for (i = 0;i < count;i++, in++)
4392         {
4393                 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4394                 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4395                 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4396                 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4397                 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4398                 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4399                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4400                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4401                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4402                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4403                 // svector/tvector are calculated later in face loading
4404                 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4405                 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4406                 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4407                 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4408         }
4409 }
4410
4411 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4412 {
4413         int *in;
4414         int *out;
4415         int i, count;
4416
4417         in = (int *)(mod_base + l->fileofs);
4418         if (l->filelen % sizeof(int[3]))
4419                 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4420         count = l->filelen / sizeof(*in);
4421         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4422
4423         loadmodel->brushq3.num_triangles = count / 3;
4424         loadmodel->brushq3.data_element3i = out;
4425
4426         for (i = 0;i < count;i++, in++, out++)
4427         {
4428                 *out = LittleLong(*in);
4429                 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4430                 {
4431                         Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4432                         *out = 0;
4433                 }
4434         }
4435 }
4436
4437 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4438 {
4439         q3dlightmap_t *input_pointer;
4440         int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4441         unsigned char *c;
4442
4443         unsigned char *convertedpixels;
4444         char mapname[MAX_QPATH];
4445         int size, bytesperpixel, rgbmap[3];
4446         qboolean external;
4447         unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4448
4449         // defaults for q3bsp
4450         size = 128;
4451         bytesperpixel = 3;
4452         rgbmap[0] = 2;
4453         rgbmap[1] = 1;
4454         rgbmap[2] = 0;
4455         external = false;
4456         loadmodel->brushq3.lightmapsize = 128;
4457
4458         if (cls.state == ca_dedicated)
4459                 return;
4460
4461         if(mod_q3bsp_nolightmaps.integer)
4462         {
4463                 return;
4464         }
4465         else if(l->filelen)
4466         {
4467                 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4468                 if (developer_loading.integer)
4469                         Con_Printf("Using internal lightmaps\n");
4470                 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4471                 if (l->filelen % sizeof(*input_pointer))
4472                         Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4473                 count = l->filelen / sizeof(*input_pointer);
4474                 for(i = 0; i < count; ++i)
4475                         inpixels[i] = input_pointer[i].rgb;
4476         }
4477         else
4478         {
4479                 // no internal lightmaps
4480                 // try external lightmaps
4481                 if (developer_loading.integer)
4482                         Con_Printf("Using external lightmaps\n");
4483                 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4484                 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false);
4485                 if(!inpixels[0])
4486                         return;
4487
4488                 // using EXTERNAL lightmaps instead
4489                 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4490                 {
4491                         Mem_Free(inpixels[0]);
4492                         Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4493                 }
4494
4495                 size = image_width;
4496                 bytesperpixel = 4;
4497                 rgbmap[0] = 0;
4498                 rgbmap[1] = 1;
4499                 rgbmap[2] = 2;
4500                 external = true;
4501
4502                 for(count = 1; ; ++count)
4503                 {
4504                         inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false);
4505                         if(!inpixels[count])
4506                                 break; // we got all of them
4507                         if(image_width != size || image_height != size)
4508                         {
4509                                 for(i = 0; i <= count; ++i)
4510                                         Mem_Free(inpixels[i]);
4511                                 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4512                         }
4513                 }
4514         }
4515
4516         convertedpixels = (unsigned char *) Mem_Alloc(tempmempool, size*size*4);
4517         loadmodel->brushq3.lightmapsize = size;
4518         loadmodel->brushq3.num_originallightmaps = count;
4519
4520         // now check the surfaces to see if any of them index an odd numbered
4521         // lightmap, if so this is not a deluxemapped bsp file
4522         //
4523         // also check what lightmaps are actually used, because q3map2 sometimes
4524         // (always?) makes an unused one at the end, which
4525         // q3map2 sometimes (or always?) makes a second blank lightmap for no
4526         // reason when only one lightmap is used, which can throw off the
4527         // deluxemapping detection method, so check 2-lightmap bsp's specifically
4528         // to see if the second lightmap is blank, if so it is not deluxemapped.
4529         loadmodel->brushq3.deluxemapping = !(count & 1);
4530         loadmodel->brushq3.deluxemapping_modelspace = true;
4531         endlightmap = 0;
4532         if (loadmodel->brushq3.deluxemapping)
4533         {
4534                 int facecount = faceslump->filelen / sizeof(q3dface_t);
4535                 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4536                 for (i = 0;i < facecount;i++)
4537                 {
4538                         j = LittleLong(faces[i].lightmapindex);
4539                         if (j >= 0)
4540                         {
4541                                 endlightmap = max(endlightmap, j + 1);
4542                                 if ((j & 1) || j + 1 >= count)
4543                                 {
4544                                         loadmodel->brushq3.deluxemapping = false;
4545                                         break;
4546                                 }
4547                         }
4548                 }
4549         }
4550
4551         // q3map2 sometimes (or always?) makes a second blank lightmap for no
4552         // reason when only one lightmap is used, which can throw off the
4553         // deluxemapping detection method, so check 2-lightmap bsp's specifically
4554         // to see if the second lightmap is blank, if so it is not deluxemapped.
4555         //
4556         // further research has shown q3map2 sometimes creates a deluxemap and two
4557         // blank lightmaps, which must be handled properly as well
4558         if (endlightmap == 1 && count > 1)
4559         {
4560                 c = inpixels[1];
4561                 for (i = 0;i < size*size;i++)
4562                 {
4563                         if (c[bytesperpixel*i + rgbmap[0]])
4564                                 break;
4565                         if (c[bytesperpixel*i + rgbmap[1]])
4566                                 break;
4567                         if (c[bytesperpixel*i + rgbmap[2]])
4568                                 break;
4569                 }
4570                 if (i == size*size)
4571                 {
4572                         // all pixels in the unused lightmap were black...
4573                         loadmodel->brushq3.deluxemapping = false;
4574                 }
4575         }
4576
4577         Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4578
4579         // figure out what the most reasonable merge power is within limits
4580         loadmodel->brushq3.num_lightmapmergepower = 0;
4581         for (power = 1;power <= mod_q3bsp_lightmapmergepower.integer && (128 << power) <= gl_max_texture_size && (1 << (power * 2)) < 4 * (count >> loadmodel->brushq3.deluxemapping);power++)
4582                 loadmodel->brushq3.num_lightmapmergepower = power;
4583
4584         // as the lightmap size may actually be another power of 2, adjust for this
4585         // (and interpret it as the power for 128x128 lightmaps above)
4586         for(i = 0; (128 << i) < size; ++i)
4587                 loadmodel->brushq3.num_lightmapmergepower -= 1;
4588         if(loadmodel->brushq3.num_lightmapmergepower < 0)
4589                 loadmodel->brushq3.num_lightmapmergepower = 0;
4590
4591         loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4592
4593         loadmodel->brushq3.num_mergedlightmaps = ((count >> loadmodel->brushq3.deluxemapping) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4594         loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4595         if (loadmodel->brushq3.deluxemapping)
4596                 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4597
4598         // allocate a texture pool if we need it
4599         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4600                 loadmodel->texturepool = R_AllocTexturePool();
4601
4602         power = loadmodel->brushq3.num_lightmapmergepower;
4603         power2 = power * 2;
4604         mask = (1 << power) - 1;
4605         for (i = 0;i < count;i++)
4606         {
4607                 // figure out which merged lightmap texture this fits into
4608                 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4609                 for (k = 0;k < size*size;k++)
4610                 {
4611                         convertedpixels[k*4+0] = inpixels[i][k*bytesperpixel+rgbmap[0]];
4612                         convertedpixels[k*4+1] = inpixels[i][k*bytesperpixel+rgbmap[1]];
4613                         convertedpixels[k*4+2] = inpixels[i][k*bytesperpixel+rgbmap[2]];
4614                         convertedpixels[k*4+3] = 255;
4615                 }
4616                 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4617                 {
4618                         // if the lightmap has not been allocated yet, create it
4619                         if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4620                         {
4621                                 // create a lightmap only as large as necessary to hold the
4622                                 // remaining size*size blocks
4623                                 // if there are multiple merged lightmap textures then they will
4624                                 // all be full size except the last one which may be smaller
4625                                 // because it only needs to the remaining blocks, and it will often
4626                                 // be odd sizes like 2048x512 due to only being 25% full or so.
4627                                 j = (count >> loadmodel->brushq3.deluxemapping) - (lightmapindex << power2);
4628                                 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4629                                         ;
4630                                 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4631                                         ;
4632                                 if (developer_loading.integer)
4633                                         Con_Printf("lightmap merge texture #%i is %ix%i (%i of %i used)\n", lightmapindex, mergewidth*size, mergeheight*size, min(j, mergewidth*mergeheight), mergewidth*mergeheight);
4634                                 loadmodel->brushq3.data_lightmaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), mergewidth * size, mergeheight * size, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), NULL);
4635                                 if (loadmodel->brushq3.data_deluxemaps)
4636                                         loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), mergewidth * size, mergeheight * size, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), NULL);
4637                         }
4638                         mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4639                         mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4640                         j = (i >> loadmodel->brushq3.deluxemapping) & ((1 << power2) - 1);
4641                         if (loadmodel->brushq3.deluxemapping && (i & 1))
4642                                 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4643                         else
4644                                 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4645                 }
4646                 else
4647                 {
4648                         // figure out which merged lightmap texture this fits into
4649                         if (loadmodel->brushq3.deluxemapping && (i & 1))
4650                                 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), size, size, convertedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), NULL);
4651                         else
4652                                 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), size, size, convertedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), NULL);
4653                 }
4654         }
4655
4656         Mem_Free(convertedpixels);
4657         if(external)
4658         {
4659                 for(i = 0; i < count; ++i)
4660                         Mem_Free(inpixels[i]);
4661         }
4662 }
4663
4664 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
4665 {
4666         int j, k, cnt, tri;
4667         float *mins, *maxs;
4668         const float *vert;
4669         if(stride > 0)
4670         {
4671                 *collisionstride = stride;
4672                 cnt = (num_triangles + stride - 1) / stride;
4673                 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
4674                 for(j = 0; j < cnt; ++j)
4675                 {
4676                         mins = &((*collisionbbox6f)[6 * j + 0]);
4677                         maxs = &((*collisionbbox6f)[6 * j + 3]);
4678                         for(k = 0; k < stride; ++k)
4679                         {
4680                                 tri = j * stride;
4681                                 if(tri >= num_triangles)
4682                                         break;
4683                                 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
4684                                 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
4685                                 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
4686                                 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
4687                                 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
4688                                 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
4689                                 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
4690                                 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
4691                                 if(vert[0] < mins[0]) mins[0] = vert[0];
4692                                 if(vert[1] < mins[1]) mins[1] = vert[1];
4693                                 if(vert[2] < mins[2]) mins[2] = vert[2];
4694                                 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4695                                 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4696                                 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4697                                 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
4698                                 if(vert[0] < mins[0]) mins[0] = vert[0];
4699                                 if(vert[1] < mins[1]) mins[1] = vert[1];
4700                                 if(vert[2] < mins[2]) mins[2] = vert[2];
4701                                 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4702                                 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4703                                 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4704                         }
4705                 }
4706         }
4707         else
4708         {
4709                 *collisionstride = 0;
4710                 *collisionbbox6f = NULL;
4711         }
4712 }
4713
4714 typedef struct patchtess_s
4715 {
4716         patchinfo_t info;
4717
4718         // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
4719         int surface_id;
4720         float lodgroup[6];
4721         float *originalvertex3f;
4722 } patchtess_t;
4723
4724 #define PATCHTESS_SAME_LODGROUP(a,b) \
4725         ( \
4726                 (a).lodgroup[0] == (b).lodgroup[0] && \
4727                 (a).lodgroup[1] == (b).lodgroup[1] && \
4728                 (a).lodgroup[2] == (b).lodgroup[2] && \
4729                 (a).lodgroup[3] == (b).lodgroup[3] && \
4730                 (a).lodgroup[4] == (b).lodgroup[4] && \
4731                 (a).lodgroup[5] == (b).lodgroup[5] \
4732         )
4733
4734 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4735 {
4736         q3dface_t *in, *oldin;
4737         msurface_t *out, *oldout;
4738         int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, numvertices, numtriangles, cxtess, cytess;
4739         float lightmaptcbase[2], lightmaptcscale[2];
4740         //int *originalelement3i;
4741         //int *originalneighbor3i;
4742         float *originalvertex3f;
4743         //float *originalsvector3f;
4744         //float *originaltvector3f;
4745         float *originalnormal3f;
4746         float *originalcolor4f;
4747         float *originaltexcoordtexture2f;
4748         float *originaltexcoordlightmap2f;
4749         float *v;
4750         patchtess_t *patchtess = NULL;
4751         int patchtesscount = 0;
4752         qboolean again;
4753
4754         in = (q3dface_t *)(mod_base + l->fileofs);
4755         if (l->filelen % sizeof(*in))
4756                 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4757         count = l->filelen / sizeof(*in);
4758         out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4759
4760         loadmodel->data_surfaces = out;
4761         loadmodel->num_surfaces = count;
4762
4763         if(count > 0)
4764                 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
4765
4766         i = 0;
4767         oldi = i;
4768         oldin = in;
4769         oldout = out;
4770         meshvertices = 0;
4771         meshtriangles = 0;
4772         for (;i < count;i++, in++, out++)
4773         {
4774                 // check face type first
4775                 type = LittleLong(in->type);
4776                 if (type != Q3FACETYPE_FLAT
4777                  && type != Q3FACETYPE_PATCH
4778                  && type != Q3FACETYPE_MESH
4779                  && type != Q3FACETYPE_FLARE)
4780                 {
4781                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4782                         continue;
4783                 }
4784
4785                 n = LittleLong(in->textureindex);
4786                 if (n < 0 || n >= loadmodel->num_textures)
4787                 {
4788                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4789                         continue;
4790                 }
4791                 out->texture = loadmodel->data_textures + n;
4792                 n = LittleLong(in->effectindex);
4793                 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4794                 {
4795                         if (developer.integer >= 100)
4796                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4797                         n = -1;
4798                 }
4799                 if (n == -1)
4800                         out->effect = NULL;
4801                 else
4802                         out->effect = loadmodel->brushq3.data_effects + n;
4803
4804                 if (cls.state != ca_dedicated)
4805                 {
4806                         out->lightmaptexture = NULL;
4807                         out->deluxemaptexture = r_texture_blanknormalmap;
4808                         n = LittleLong(in->lightmapindex);
4809                         if (n < 0)
4810                                 n = -1;
4811                         else if (n >= loadmodel->brushq3.num_originallightmaps)
4812                         {
4813                                 if(loadmodel->brushq3.num_originallightmaps != 0)
4814                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4815                                 n = -1;
4816                         }
4817                         else
4818                         {
4819                                 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4820                                 if (loadmodel->brushq3.deluxemapping)
4821                                         out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4822                         }
4823                 }
4824
4825                 firstvertex = LittleLong(in->firstvertex);
4826                 numvertices = LittleLong(in->numvertices);
4827                 firstelement = LittleLong(in->firstelement);
4828                 numtriangles = LittleLong(in->numelements) / 3;
4829                 if (numtriangles * 3 != LittleLong(in->numelements))
4830                 {
4831                         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));
4832                         continue;
4833                 }
4834                 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4835                 {
4836                         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);
4837                         continue;
4838                 }
4839                 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4840                 {
4841                         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);
4842                         continue;
4843                 }
4844                 switch(type)
4845                 {
4846                 case Q3FACETYPE_FLAT:
4847                 case Q3FACETYPE_MESH:
4848                         // no processing necessary
4849                         break;
4850                 case Q3FACETYPE_PATCH:
4851                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4852                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4853                         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))
4854                         {
4855                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4856                                 continue;
4857                         }
4858                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4859
4860                         // convert patch to Q3FACETYPE_MESH
4861                         xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4862                         ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4863                         // bound to user settings
4864                         xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4865                         ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4866                         // bound to sanity settings
4867                         xtess = bound(0, xtess, 1024);
4868                         ytess = bound(0, ytess, 1024);
4869
4870                         // lower quality collision patches! Same procedure as before, but different cvars
4871                         // convert patch to Q3FACETYPE_MESH
4872                         cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4873                         cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4874                         // bound to user settings
4875                         cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
4876                         cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
4877                         // bound to sanity settings
4878                         cxtess = bound(0, cxtess, 1024);
4879                         cytess = bound(0, cytess, 1024);
4880
4881                         // store it for the LOD grouping step
4882                         patchtess[patchtesscount].info.xsize = patchsize[0];
4883                         patchtess[patchtesscount].info.ysize = patchsize[1];
4884                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
4885                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
4886                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
4887                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
4888
4889                         patchtess[patchtesscount].surface_id = i;
4890                         patchtess[patchtesscount].lodgroup[0] = in->specific.patch.mins[0];
4891                         patchtess[patchtesscount].lodgroup[1] = in->specific.patch.mins[1];
4892                         patchtess[patchtesscount].lodgroup[2] = in->specific.patch.mins[2];
4893                         patchtess[patchtesscount].lodgroup[3] = in->specific.patch.maxs[0];
4894                         patchtess[patchtesscount].lodgroup[4] = in->specific.patch.maxs[1];
4895                         patchtess[patchtesscount].lodgroup[5] = in->specific.patch.maxs[2];
4896                         patchtess[patchtesscount].originalvertex3f = originalvertex3f;
4897                         ++patchtesscount;
4898                         break;
4899                 case Q3FACETYPE_FLARE:
4900                         if (developer.integer >= 100)
4901                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4902                         // don't render it
4903                         continue;
4904                 }
4905                 out->num_vertices = numvertices;
4906                 out->num_triangles = numtriangles;
4907                 meshvertices += out->num_vertices;
4908                 meshtriangles += out->num_triangles;
4909         }
4910
4911         // Fix patches tesselations so that they make no seams
4912         do
4913         {
4914                 again = false;
4915                 for(i = 0; i < patchtesscount; ++i)
4916                 {
4917                         for(j = i+1; j < patchtesscount; ++j)
4918                         {
4919                                 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
4920                                         continue;
4921
4922                                 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
4923                                         again = true;
4924                         }
4925                 }
4926         }
4927         while (again);
4928
4929         // Calculate resulting number of triangles
4930         for(i = 0; i < patchtesscount; ++i)
4931         {
4932                 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
4933                 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
4934                 numvertices = finalwidth * finalheight;
4935                 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4936
4937                 oldout[patchtess[i].surface_id].num_vertices = numvertices;
4938                 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
4939                 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
4940                 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
4941         }
4942
4943         i = oldi;
4944         in = oldin;
4945         out = oldout;
4946         Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4947         meshvertices = 0;
4948         meshtriangles = 0;
4949         for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
4950         {
4951                 if (out->num_vertices < 3 || out->num_triangles < 1)
4952                         continue;
4953
4954                 type = LittleLong(in->type);
4955                 firstvertex = LittleLong(in->firstvertex);
4956                 firstelement = LittleLong(in->firstelement);
4957                 out->num_firstvertex = meshvertices;
4958                 out->num_firsttriangle = meshtriangles;
4959                 switch(type)
4960                 {
4961                 case Q3FACETYPE_FLAT:
4962                 case Q3FACETYPE_MESH:
4963                         // no processing necessary, except for lightmap merging
4964                         for (j = 0;j < out->num_vertices;j++)
4965                         {
4966                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4967                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4968                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4969                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
4970                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
4971                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
4972                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4973                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4974                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4975                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4976                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4977                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4978                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4979                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4980                         }
4981                         for (j = 0;j < out->num_triangles*3;j++)
4982                                 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
4983                         break;
4984                 case Q3FACETYPE_PATCH:
4985                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4986                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4987                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4988                         originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
4989                         originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4990                         originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4991                         originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4992
4993                         xtess = ytess = cxtess = cytess = -1;
4994                         for(j = 0; j < patchtesscount; ++j)
4995                                 if(patchtess[j].surface_id == i)
4996                                 {
4997                                         xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
4998                                         ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
4999                                         cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5000                                         cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5001                                         break;
5002                                 }
5003                         if(xtess == -1)
5004                         {
5005                                 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5006                                 xtess = ytess = cxtess = cytess = 0;
5007                         }
5008
5009                         finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5010                         finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5011                         finalvertices = finalwidth * finalheight;
5012                         finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5013                         type = Q3FACETYPE_MESH;
5014                         // generate geometry
5015                         // (note: normals are skipped because they get recalculated)
5016                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5017                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5018                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5019                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5020                         Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5021                         Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5022
5023                         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 + 3 * out->num_firstvertex);
5024
5025                         if (developer.integer >= 100)
5026                         {
5027                                 if (out->num_triangles < finaltriangles)
5028                                         Con_Printf("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);
5029                                 else
5030                                         Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles\n", patchsize[0], patchsize[1], out->num_vertices, out->num_triangles);
5031                         }
5032                         // q3map does not put in collision brushes for curves... ugh
5033                         // build the lower quality collision geometry
5034                         finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5035                         finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5036                         finalvertices = finalwidth * finalheight;
5037                         finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5038
5039                         out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5040                         out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5041                         out->num_collisionvertices = finalvertices;
5042                         out->num_collisiontriangles = finaltriangles;
5043                         Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5044                         Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
5045
5046                         //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5047                         Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
5048
5049                         oldnumtriangles = out->num_triangles;
5050                         oldnumtriangles2 = out->num_collisiontriangles;
5051                         out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
5052
5053                         // now optimize the collision mesh by finding triangle bboxes...
5054                         Mod_Q3BSP_BuildBBoxes(out->data_collisionelement3i, out->num_collisiontriangles, out->data_collisionvertex3f, &out->data_collisionbbox6f, &out->num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5055                         Mod_Q3BSP_BuildBBoxes(loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle, out->num_triangles, loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex, &out->data_bbox6f, &out->num_bboxstride, mod_q3bsp_curves_stride.integer);
5056
5057                         if (developer.integer >= 100)
5058                                 Con_Printf("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);
5059                         break;
5060                 default:
5061                         break;
5062                 }
5063                 meshvertices += out->num_vertices;
5064                 meshtriangles += out->num_triangles;
5065                 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5066                         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)
5067                                 invalidelements++;
5068                 if (invalidelements)
5069                 {
5070                         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);
5071                         for (j = 0;j < out->num_triangles * 3;j++)
5072                         {
5073                                 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5074                                 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)
5075                                         (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5076                         }
5077                         Con_Print("\n");
5078                 }
5079                 // calculate a bounding box
5080                 VectorClear(out->mins);
5081                 VectorClear(out->maxs);
5082                 if (out->num_vertices)
5083                 {
5084                         if (cls.state != ca_dedicated && out->lightmaptexture)
5085                         {
5086                                 // figure out which part of the merged lightmap this fits into
5087                                 int lightmapindex = LittleLong(in->lightmapindex) >> loadmodel->brushq3.deluxemapping;
5088                                 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5089                                 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5090                                 lightmapindex &= mergewidth * mergeheight - 1;
5091                                 lightmaptcscale[0] = 1.0f / mergewidth;
5092                                 lightmaptcscale[1] = 1.0f / mergeheight;
5093                                 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5094                                 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5095                                 // modify the lightmap texcoords to match this region of the merged lightmap
5096                                 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5097                                 {
5098                                         v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5099                                         v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5100                                 }
5101                         }
5102                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5103                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5104                         for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5105                         {
5106                                 out->mins[0] = min(out->mins[0], v[0]);
5107                                 out->maxs[0] = max(out->maxs[0], v[0]);
5108                                 out->mins[1] = min(out->mins[1], v[1]);
5109                                 out->maxs[1] = max(out->maxs[1], v[1]);
5110                                 out->mins[2] = min(out->mins[2], v[2]);
5111                                 out->maxs[2] = max(out->maxs[2], v[2]);
5112                         }
5113                         out->mins[0] -= 1.0f;
5114                         out->mins[1] -= 1.0f;
5115                         out->mins[2] -= 1.0f;
5116                         out->maxs[0] += 1.0f;
5117                         out->maxs[1] += 1.0f;
5118                         out->maxs[2] += 1.0f;
5119                 }
5120                 // set lightmap styles for consistency with q1bsp
5121                 //out->lightmapinfo->styles[0] = 0;
5122                 //out->lightmapinfo->styles[1] = 255;
5123                 //out->lightmapinfo->styles[2] = 255;
5124                 //out->lightmapinfo->styles[3] = 255;
5125         }
5126
5127         i = oldi;
5128         out = oldout;
5129         for (;i < count;i++, out++)
5130         {
5131                 if(out->num_vertices && out->num_triangles)
5132                         continue;
5133                 if(out->num_vertices == 0)
5134                         Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no vertices, ignoring\n", i);
5135                 if(out->num_triangles == 0)
5136                         Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no triangles, ignoring\n", i);
5137         }
5138
5139         // for per pixel lighting
5140         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, true);
5141
5142         // generate ushort elements array if possible
5143         if (loadmodel->surfmesh.data_element3s)
5144                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5145                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5146
5147         // free the no longer needed vertex data
5148         loadmodel->brushq3.num_vertices = 0;
5149         if (loadmodel->brushq3.data_vertex3f)
5150                 Mem_Free(loadmodel->brushq3.data_vertex3f);
5151         loadmodel->brushq3.data_vertex3f = NULL;
5152         loadmodel->brushq3.data_normal3f = NULL;
5153         loadmodel->brushq3.data_texcoordtexture2f = NULL;
5154         loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5155         loadmodel->brushq3.data_color4f = NULL;
5156         // free the no longer needed triangle data
5157         loadmodel->brushq3.num_triangles = 0;
5158         if (loadmodel->brushq3.data_element3i)
5159                 Mem_Free(loadmodel->brushq3.data_element3i);
5160         loadmodel->brushq3.data_element3i = NULL;
5161
5162         if(patchtess)
5163                 Mem_Free(patchtess);
5164 }
5165
5166 static void Mod_Q3BSP_LoadModels(lump_t *l)
5167 {
5168         q3dmodel_t *in;
5169         q3dmodel_t *out;
5170         int i, j, n, c, count;
5171
5172         in = (q3dmodel_t *)(mod_base + l->fileofs);
5173         if (l->filelen % sizeof(*in))
5174                 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5175         count = l->filelen / sizeof(*in);
5176         out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5177
5178         loadmodel->brushq3.data_models = out;
5179         loadmodel->brushq3.num_models = count;
5180
5181         for (i = 0;i < count;i++, in++, out++)
5182         {
5183                 for (j = 0;j < 3;j++)
5184                 {
5185                         out->mins[j] = LittleFloat(in->mins[j]);
5186                         out->maxs[j] = LittleFloat(in->maxs[j]);
5187                 }
5188                 n = LittleLong(in->firstface);
5189                 c = LittleLong(in->numfaces);
5190                 if (n < 0 || n + c > loadmodel->num_surfaces)
5191                         Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5192                 out->firstface = n;
5193                 out->numfaces = c;
5194                 n = LittleLong(in->firstbrush);
5195                 c = LittleLong(in->numbrushes);
5196                 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5197                         Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5198                 out->firstbrush = n;
5199                 out->numbrushes = c;
5200         }
5201 }
5202
5203 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5204 {
5205         int *in;
5206         int *out;
5207         int i, n, count;
5208
5209         in = (int *)(mod_base + l->fileofs);
5210         if (l->filelen % sizeof(*in))
5211                 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5212         count = l->filelen / sizeof(*in);
5213         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5214
5215         loadmodel->brush.data_leafbrushes = out;
5216         loadmodel->brush.num_leafbrushes = count;
5217
5218         for (i = 0;i < count;i++, in++, out++)
5219         {
5220                 n = LittleLong(*in);
5221                 if (n < 0 || n >= loadmodel->brush.num_brushes)
5222                         Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5223                 *out = n;
5224         }
5225 }
5226
5227 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5228 {
5229         int *in;
5230         int *out;
5231         int i, n, count;
5232
5233         in = (int *)(mod_base + l->fileofs);
5234         if (l->filelen % sizeof(*in))
5235                 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5236         count = l->filelen / sizeof(*in);
5237         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5238
5239         loadmodel->brush.data_leafsurfaces = out;
5240         loadmodel->brush.num_leafsurfaces = count;
5241
5242         for (i = 0;i < count;i++, in++, out++)
5243         {
5244                 n = LittleLong(*in);
5245                 if (n < 0 || n >= loadmodel->num_surfaces)
5246                         Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5247                 *out = n;
5248         }
5249 }
5250
5251 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5252 {
5253         q3dleaf_t *in;
5254         mleaf_t *out;
5255         int i, j, n, c, count;
5256
5257         in = (q3dleaf_t *)(mod_base + l->fileofs);
5258         if (l->filelen % sizeof(*in))
5259                 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5260         count = l->filelen / sizeof(*in);
5261         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5262
5263         loadmodel->brush.data_leafs = out;
5264         loadmodel->brush.num_leafs = count;
5265
5266         for (i = 0;i < count;i++, in++, out++)
5267         {
5268                 out->parent = NULL;
5269                 out->plane = NULL;
5270                 out->clusterindex = LittleLong(in->clusterindex);
5271                 out->areaindex = LittleLong(in->areaindex);
5272                 for (j = 0;j < 3;j++)
5273                 {
5274                         // yes the mins/maxs are ints
5275                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5276                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5277                 }
5278                 n = LittleLong(in->firstleafface);
5279                 c = LittleLong(in->numleaffaces);
5280                 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5281                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5282                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5283                 out->numleafsurfaces = c;
5284                 n = LittleLong(in->firstleafbrush);
5285                 c = LittleLong(in->numleafbrushes);
5286                 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5287                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5288                 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5289                 out->numleafbrushes = c;
5290         }
5291 }
5292
5293 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5294 {
5295         q3dnode_t *in;
5296         mnode_t *out;
5297         int i, j, n, count;
5298
5299         in = (q3dnode_t *)(mod_base + l->fileofs);
5300         if (l->filelen % sizeof(*in))
5301                 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5302         count = l->filelen / sizeof(*in);
5303         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5304
5305         loadmodel->brush.data_nodes = out;
5306         loadmodel->brush.num_nodes = count;
5307
5308         for (i = 0;i < count;i++, in++, out++)
5309         {
5310                 out->parent = NULL;
5311                 n = LittleLong(in->planeindex);
5312                 if (n < 0 || n >= loadmodel->brush.num_planes)
5313                         Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5314                 out->plane = loadmodel->brush.data_planes + n;
5315                 for (j = 0;j < 2;j++)
5316                 {
5317                         n = LittleLong(in->childrenindex[j]);
5318                         if (n >= 0)
5319                         {
5320                                 if (n >= loadmodel->brush.num_nodes)
5321                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5322                                 out->children[j] = loadmodel->brush.data_nodes + n;
5323                         }
5324                         else
5325                         {
5326                                 n = -1 - n;
5327                                 if (n >= loadmodel->brush.num_leafs)
5328                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5329                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5330                         }
5331                 }
5332                 for (j = 0;j < 3;j++)
5333                 {
5334                         // yes the mins/maxs are ints
5335                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5336                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5337                 }
5338         }
5339
5340         // set the parent pointers
5341         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5342 }
5343
5344 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5345 {
5346         q3dlightgrid_t *in;
5347         q3dlightgrid_t *out;
5348         int count;
5349
5350         in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5351         if (l->filelen % sizeof(*in))
5352                 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5353         loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5354         loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5355         loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5356         loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5357         loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5358         loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5359         loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5360         loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5361         loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5362         loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5363         loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5364         loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5365         count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5366         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]);
5367         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]);
5368
5369         // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5370         if (l->filelen)
5371         {
5372                 if (l->filelen < count * (int)sizeof(*in))
5373                         Host_Error("Mod_Q3BSP_LoadLightGrid: invalid lightgrid lump size %i bytes, should be %i bytes (%ix%ix%i)", l->filelen, (int)(count * sizeof(*in)), loadmodel->brushq3.num_lightgrid_isize[0], loadmodel->brushq3.num_lightgrid_isize[1], loadmodel->brushq3.num_lightgrid_isize[2]);
5374                 if (l->filelen != count * (int)sizeof(*in))
5375                         Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5376                 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5377                 loadmodel->brushq3.data_lightgrid = out;
5378                 loadmodel->brushq3.num_lightgrid = count;
5379                 // no swapping or validation necessary
5380                 memcpy(out, in, count * (int)sizeof(*out));
5381         }
5382 }
5383
5384 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5385 {
5386         q3dpvs_t *in;
5387         int totalchains;
5388
5389         if (l->filelen == 0)
5390         {
5391                 int i;
5392                 // unvised maps often have cluster indices even without pvs, so check
5393                 // leafs to find real number of clusters
5394                 loadmodel->brush.num_pvsclusters = 1;
5395                 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5396                         loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5397
5398                 // create clusters
5399                 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5400                 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5401                 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5402                 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5403                 return;
5404         }
5405
5406         in = (q3dpvs_t *)(mod_base + l->fileofs);
5407         if (l->filelen < 9)
5408                 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5409
5410         loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5411         loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5412         if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5413                 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5414         totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5415         if (l->filelen < totalchains + (int)sizeof(*in))
5416                 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);
5417
5418         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5419         memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5420 }
5421
5422 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5423 {
5424         int i, j, k, index[3];
5425         float transformed[3], blend1, blend2, blend, stylescale;
5426         q3dlightgrid_t *a, *s;
5427
5428         // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5429         stylescale = r_refdef.scene.rtlightstylevalue[0];
5430
5431         if (!model->brushq3.num_lightgrid)
5432         {
5433                 ambientcolor[0] = stylescale;
5434                 ambientcolor[1] = stylescale;
5435                 ambientcolor[2] = stylescale;
5436                 return;
5437         }
5438
5439         Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5440         //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5441         //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5442         transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5443         transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5444         transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5445         index[0] = (int)floor(transformed[0]);
5446         index[1] = (int)floor(transformed[1]);
5447         index[2] = (int)floor(transformed[2]);
5448         //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5449
5450         // now lerp the values
5451         VectorClear(diffusenormal);
5452         a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5453         for (k = 0;k < 2;k++)
5454         {
5455                 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5456                 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5457                         continue;
5458                 for (j = 0;j < 2;j++)
5459                 {
5460                         blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5461                         if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5462                                 continue;
5463                         for (i = 0;i < 2;i++)
5464                         {
5465                                 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5466                                 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5467                                         continue;
5468                                 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5469                                 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5470                                 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5471                                 // this uses the mod_md3_sin table because the values are
5472                                 // already in the 0-255 range, the 64+ bias fetches a cosine
5473                                 // instead of a sine value
5474                                 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5475                                 diffusenormal[1] += blend * (mod_md3_sin[     s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5476                                 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5477                                 //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)));
5478                         }
5479                 }
5480         }
5481
5482         // normalize the light direction before turning
5483         VectorNormalize(diffusenormal);
5484         //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]);
5485 }
5486
5487 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
5488 {
5489         int i;
5490         mleaf_t *leaf;
5491         colbrushf_t *brush;
5492         // find which leaf the point is in
5493         while (node->plane)
5494                 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5495         // point trace the brushes
5496         leaf = (mleaf_t *)node;
5497         for (i = 0;i < leaf->numleafbrushes;i++)
5498         {
5499                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5500                 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5501                 {
5502                         brush->markframe = markframe;
5503                         Collision_TracePointBrushFloat(trace, point, brush);
5504                 }
5505         }
5506         // can't do point traces on curves (they have no thickness)
5507 }
5508
5509 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)
5510 {
5511         int i, startside, endside;
5512         float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5513         mleaf_t *leaf;
5514         msurface_t *surface;
5515         mplane_t *plane;
5516         colbrushf_t *brush;
5517         // walk the tree until we hit a leaf, recursing for any split cases
5518         while (node->plane)
5519         {
5520                 // abort if this part of the bsp tree can not be hit by this trace
5521 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5522 //                      return;
5523                 plane = node->plane;
5524                 // axial planes are much more common than non-axial, so an optimized
5525                 // axial case pays off here
5526                 if (plane->type < 3)
5527                 {
5528                         dist1 = start[plane->type] - plane->dist;
5529                         dist2 = end[plane->type] - plane->dist;
5530                 }
5531                 else
5532                 {
5533                         dist1 = DotProduct(start, plane->normal) - plane->dist;
5534                         dist2 = DotProduct(end, plane->normal) - plane->dist;
5535                 }
5536                 startside = dist1 < 0;
5537                 endside = dist2 < 0;
5538                 if (startside == endside)
5539                 {
5540                         // most of the time the line fragment is on one side of the plane
5541                         node = node->children[startside];
5542                 }
5543                 else
5544                 {
5545                         // line crosses node plane, split the line
5546                         dist1 = PlaneDiff(linestart, plane);
5547                         dist2 = PlaneDiff(lineend, plane);
5548                         midfrac = dist1 / (dist1 - dist2);
5549                         VectorLerp(linestart, midfrac, lineend, mid);
5550                         // take the near side first
5551                         Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5552                         // if we found an impact on the front side, don't waste time
5553                         // exploring the far side
5554                         if (midfrac <= trace->realfraction)
5555                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5556                         return;
5557                 }
5558         }
5559         // abort if this part of the bsp tree can not be hit by this trace
5560 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5561 //              return;
5562         // hit a leaf
5563         nodesegmentmins[0] = min(start[0], end[0]) - 1;
5564         nodesegmentmins[1] = min(start[1], end[1]) - 1;
5565         nodesegmentmins[2] = min(start[2], end[2]) - 1;
5566         nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5567         nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5568         nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5569         // line trace the brushes
5570         leaf = (mleaf_t *)node;
5571         for (i = 0;i < leaf->numleafbrushes;i++)
5572         {
5573                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5574                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5575                 {
5576                         brush->markframe = markframe;
5577                         Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5578                 }
5579         }
5580         // can't do point traces on curves (they have no thickness)
5581         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5582         {
5583                 // line trace the curves
5584                 for (i = 0;i < leaf->numleafsurfaces;i++)
5585                 {
5586                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5587                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5588                         {
5589                                 surface->collisionmarkframe = markframe;
5590                                 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5591                         }
5592                 }
5593         }
5594 }
5595
5596 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)
5597 {
5598         int i;
5599         int sides;
5600         mleaf_t *leaf;
5601         colbrushf_t *brush;
5602         msurface_t *surface;
5603         mplane_t *plane;
5604         float nodesegmentmins[3], nodesegmentmaxs[3];
5605         // walk the tree until we hit a leaf, recursing for any split cases
5606         while (node->plane)
5607         {
5608                 // abort if this part of the bsp tree can not be hit by this trace
5609 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5610 //                      return;
5611                 plane = node->plane;
5612                 // axial planes are much more common than non-axial, so an optimized
5613                 // axial case pays off here
5614                 if (plane->type < 3)
5615                 {
5616                         // this is an axial plane, compare bounding box directly to it and
5617                         // recurse sides accordingly
5618                         // recurse down node sides
5619                         // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5620                         //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5621                         //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5622                         sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5623                 }
5624                 else
5625                 {
5626                         // this is a non-axial plane, so check if the start and end boxes
5627                         // are both on one side of the plane to handle 'diagonal' cases
5628                         sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5629                 }
5630                 if (sides == 3)
5631                 {
5632                         // segment crosses plane
5633                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5634                         sides = 2;
5635                 }
5636                 // if sides == 0 then the trace itself is bogus (Not A Number values),
5637                 // in this case we simply pretend the trace hit nothing
5638                 if (sides == 0)
5639                         return; // ERROR: NAN bounding box!
5640                 // take whichever side the segment box is on
5641                 node = node->children[sides - 1];
5642         }
5643         // abort if this part of the bsp tree can not be hit by this trace
5644 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5645 //              return;
5646         nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5647         nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5648         nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5649         nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5650         nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5651         nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5652         // hit a leaf
5653         leaf = (mleaf_t *)node;
5654         for (i = 0;i < leaf->numleafbrushes;i++)
5655         {
5656                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5657                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5658                 {
5659                         brush->markframe = markframe;
5660                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5661                 }
5662         }
5663         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5664         {
5665                 for (i = 0;i < leaf->numleafsurfaces;i++)
5666                 {
5667                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5668                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5669                         {
5670                                 surface->collisionmarkframe = markframe;
5671                                 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5672                         }
5673                 }
5674         }
5675 }
5676
5677 static void Mod_Q3BSP_TraceBox(dp_model_t *model, int frame, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
5678 {
5679         int i;
5680         vec3_t shiftstart, shiftend;
5681         float segmentmins[3], segmentmaxs[3];
5682         static int markframe = 0;
5683         msurface_t *surface;
5684         q3mbrush_t *brush;
5685         memset(trace, 0, sizeof(*trace));
5686         trace->fraction = 1;
5687         trace->realfraction = 1;
5688         trace->hitsupercontentsmask = hitsupercontentsmask;
5689         if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
5690         {
5691                 VectorAdd(start, boxmins, shiftstart);
5692                 VectorAdd(end, boxmins, shiftend);
5693                 if (VectorCompare(shiftstart, shiftend))
5694                 {
5695                         // point trace
5696                         if (model->brush.submodel)
5697                         {
5698                                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5699                                         if (brush->colbrushf)
5700                                                 Collision_TracePointBrushFloat(trace, shiftstart, brush->colbrushf);
5701                         }
5702                         else
5703                                 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, shiftstart, ++markframe);
5704                 }
5705                 else
5706                 {
5707                         // line trace
5708                         segmentmins[0] = min(shiftstart[0], shiftend[0]) - 1;
5709                         segmentmins[1] = min(shiftstart[1], shiftend[1]) - 1;
5710                         segmentmins[2] = min(shiftstart[2], shiftend[2]) - 1;
5711                         segmentmaxs[0] = max(shiftstart[0], shiftend[0]) + 1;
5712                         segmentmaxs[1] = max(shiftstart[1], shiftend[1]) + 1;
5713                         segmentmaxs[2] = max(shiftstart[2], shiftend[2]) + 1;
5714                         if (model->brush.submodel)
5715                         {
5716                                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5717                                         if (brush->colbrushf)
5718                                                 Collision_TraceLineBrushFloat(trace, shiftstart, shiftend, brush->colbrushf, brush->colbrushf);
5719                                 if (mod_q3bsp_curves_collisions.integer)
5720                                         for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5721                                                 if (surface->num_collisiontriangles)
5722                                                         Collision_TraceLineTriangleMeshFloat(trace, shiftstart, shiftend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5723                         }
5724                         else
5725                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, shiftstart, shiftend, 0, 1, shiftstart, shiftend, ++markframe, segmentmins, segmentmaxs);
5726                 }
5727         }
5728         else
5729         {
5730                 // box trace, performed as brush trace
5731                 colbrushf_t *thisbrush_start, *thisbrush_end;
5732                 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5733                 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5734                 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5735                 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5736                 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5737                 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5738                 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5739                 VectorAdd(start, boxmins, boxstartmins);
5740                 VectorAdd(start, boxmaxs, boxstartmaxs);
5741                 VectorAdd(end, boxmins, boxendmins);
5742                 VectorAdd(end, boxmaxs, boxendmaxs);
5743                 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5744                 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5745                 if (model->brush.submodel)
5746                 {
5747                         for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5748                                 if (brush->colbrushf)
5749                                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5750                         if (mod_q3bsp_curves_collisions.integer)
5751                                 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5752                                         if (surface->num_collisiontriangles)
5753                                                 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5754                 }
5755                 else
5756                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5757         }
5758 }
5759
5760 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5761 {
5762         int i;
5763         int supercontents = 0;
5764         q3mbrush_t *brush;
5765         // test if the point is inside each brush
5766         if (model->brush.submodel)
5767         {
5768                 // submodels are effectively one leaf
5769                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5770                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5771                                 supercontents |= brush->colbrushf->supercontents;
5772         }
5773         else
5774         {
5775                 mnode_t *node = model->brush.data_nodes;
5776                 mleaf_t *leaf;
5777                 // find which leaf the point is in
5778                 while (node->plane)
5779                         node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5780                 leaf = (mleaf_t *)node;
5781                 // now check the brushes in the leaf
5782                 for (i = 0;i < leaf->numleafbrushes;i++)
5783                 {
5784                         brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5785                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5786                                 supercontents |= brush->colbrushf->supercontents;
5787                 }
5788         }
5789         return supercontents;
5790 }
5791
5792 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
5793 {
5794         int supercontents = 0;
5795         if (nativecontents & CONTENTSQ3_SOLID)
5796                 supercontents |= SUPERCONTENTS_SOLID;
5797         if (nativecontents & CONTENTSQ3_WATER)
5798                 supercontents |= SUPERCONTENTS_WATER;
5799         if (nativecontents & CONTENTSQ3_SLIME)
5800                 supercontents |= SUPERCONTENTS_SLIME;
5801         if (nativecontents & CONTENTSQ3_LAVA)
5802                 supercontents |= SUPERCONTENTS_LAVA;
5803         if (nativecontents & CONTENTSQ3_BODY)
5804                 supercontents |= SUPERCONTENTS_BODY;
5805         if (nativecontents & CONTENTSQ3_CORPSE)
5806                 supercontents |= SUPERCONTENTS_CORPSE;
5807         if (nativecontents & CONTENTSQ3_NODROP)
5808                 supercontents |= SUPERCONTENTS_NODROP;
5809         if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5810                 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5811         if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5812                 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5813         if (nativecontents & CONTENTSQ3_DONOTENTER)
5814                 supercontents |= SUPERCONTENTS_DONOTENTER;
5815         if (nativecontents & CONTENTSQ3_BOTCLIP)
5816                 supercontents |= SUPERCONTENTS_BOTCLIP;
5817         if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
5818                 supercontents |= SUPERCONTENTS_OPAQUE;
5819         return supercontents;
5820 }
5821
5822 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
5823 {
5824         int nativecontents = 0;
5825         if (supercontents & SUPERCONTENTS_SOLID)
5826                 nativecontents |= CONTENTSQ3_SOLID;
5827         if (supercontents & SUPERCONTENTS_WATER)
5828                 nativecontents |= CONTENTSQ3_WATER;
5829         if (supercontents & SUPERCONTENTS_SLIME)
5830                 nativecontents |= CONTENTSQ3_SLIME;
5831         if (supercontents & SUPERCONTENTS_LAVA)
5832                 nativecontents |= CONTENTSQ3_LAVA;
5833         if (supercontents & SUPERCONTENTS_BODY)
5834                 nativecontents |= CONTENTSQ3_BODY;
5835         if (supercontents & SUPERCONTENTS_CORPSE)
5836                 nativecontents |= CONTENTSQ3_CORPSE;
5837         if (supercontents & SUPERCONTENTS_NODROP)
5838                 nativecontents |= CONTENTSQ3_NODROP;
5839         if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5840                 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5841         if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5842                 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5843         if (supercontents & SUPERCONTENTS_DONOTENTER)
5844                 nativecontents |= CONTENTSQ3_DONOTENTER;
5845         if (supercontents & SUPERCONTENTS_BOTCLIP)
5846                 nativecontents |= CONTENTSQ3_BOTCLIP;
5847         if (!(supercontents & SUPERCONTENTS_OPAQUE))
5848                 nativecontents |= CONTENTSQ3_TRANSLUCENT;
5849         return nativecontents;
5850 }
5851
5852 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5853 {
5854         int numleafs;
5855         while (node->plane)
5856         {
5857                 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5858                 node = node->children[1];
5859         }
5860         numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5861         if (loadmodel->brush.num_leafs < numleafs)
5862                 loadmodel->brush.num_leafs = numleafs;
5863 }
5864
5865 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
5866 {
5867         int i, j, numshadowmeshtriangles, lumps;
5868         q3dheader_t *header;
5869         float corner[3], yawradius, modelradius;
5870         msurface_t *surface;
5871
5872         mod->modeldatatypestring = "Q3BSP";
5873
5874         mod->type = mod_brushq3;
5875         mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5876         mod->numskins = 1;
5877
5878         header = (q3dheader_t *)buffer;
5879         if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
5880                 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
5881
5882         i = LittleLong(header->version);
5883         if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
5884                 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5885
5886         mod->soundfromcenter = true;
5887         mod->TraceBox = Mod_Q3BSP_TraceBox;
5888         mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
5889         mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
5890         mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5891         mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5892         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5893         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5894         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5895         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5896         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5897         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
5898         mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5899         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5900         mod->brush.AmbientSoundLevelsForPoint = NULL;
5901         mod->brush.RoundUpToHullSize = NULL;
5902         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5903         mod->Draw = R_Q1BSP_Draw;
5904         mod->DrawDepth = R_Q1BSP_DrawDepth;
5905         mod->DrawDebug = R_Q1BSP_DrawDebug;
5906         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5907         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5908         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5909         mod->DrawLight = R_Q1BSP_DrawLight;
5910
5911         mod_base = (unsigned char *)header;
5912
5913         // swap all the lumps
5914         header->ident = LittleLong(header->ident);
5915         header->version = LittleLong(header->version);
5916         lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
5917         for (i = 0;i < lumps;i++)
5918         {
5919                 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
5920                 if((char *) bufferend < (char *) buffer + j)
5921                         Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
5922                 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
5923                 if((char *) bufferend < (char *) buffer + j)
5924                         Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
5925         }
5926         /*
5927          * NO, do NOT clear them!
5928          * they contain actual data referenced by other stuff.
5929          * Instead, before using the advertisements lump, check header->versio
5930          * again!
5931          * Sorry, but otherwise it breaks memory of the first lump.
5932         for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
5933         {
5934                 header->lumps[i].fileofs = 0;
5935                 header->lumps[i].filelen = 0;
5936         }
5937         */
5938
5939         mod->brush.qw_md4sum = 0;
5940         mod->brush.qw_md4sum2 = 0;
5941         for (i = 0;i < lumps;i++)
5942         {
5943                 if (i == Q3LUMP_ENTITIES)
5944                         continue;
5945                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5946                 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
5947                         continue;
5948                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5949
5950                 // all this checksumming can take a while, so let's send keepalives here too
5951                 CL_KeepaliveMessage(false);
5952         }
5953
5954         Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5955         Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5956         Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5957         if (header->version == Q3BSPVERSION_IG)
5958                 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
5959         else
5960                 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5961         Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5962         Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5963         Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5964         Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5965         Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
5966         Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5967         Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5968         Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5969         Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5970         Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5971         Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5972         Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5973         Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5974         loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5975
5976         // the MakePortals code works fine on the q3bsp data as well
5977         Mod_Q1BSP_MakePortals();
5978
5979         // FIXME: shader alpha should replace r_wateralpha support in q3bsp
5980         loadmodel->brush.supportwateralpha = true;
5981
5982         // make a single combined shadow mesh to allow optimized shadow volume creation
5983         numshadowmeshtriangles = 0;
5984         if (cls.state != ca_dedicated)
5985         {
5986                 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5987                 {
5988                         surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5989                         numshadowmeshtriangles += surface->num_triangles;
5990                 }
5991                 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5992                 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5993                         if (surface->num_triangles > 0)
5994                                 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, loadmodel->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
5995                 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
5996                 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5997         }
5998
5999         loadmodel->brush.num_leafs = 0;
6000         Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
6001
6002         mod = loadmodel;
6003         for (i = 0;i < loadmodel->brush.numsubmodels;i++)
6004         {
6005                 if (i > 0)
6006                 {
6007                         char name[10];
6008                         // duplicate the basic information
6009                         dpsnprintf(name, sizeof(name), "*%i", i);
6010                         mod = Mod_FindName(name, loadmodel->name);
6011                         // copy the base model to this one
6012                         *mod = *loadmodel;
6013                         // rename the clone back to its proper name
6014                         strlcpy(mod->name, name, sizeof(mod->name));
6015                         mod->brush.parentmodel = loadmodel;
6016                         // textures and memory belong to the main model
6017                         mod->texturepool = NULL;
6018                         mod->mempool = NULL;
6019                         mod->brush.TraceLineOfSight = NULL;
6020                         mod->brush.GetPVS = NULL;
6021                         mod->brush.FatPVS = NULL;
6022                         mod->brush.BoxTouchingPVS = NULL;
6023                         mod->brush.BoxTouchingLeafPVS = NULL;
6024                         mod->brush.BoxTouchingVisibleLeafs = NULL;
6025                         mod->brush.FindBoxClusters = NULL;
6026                         mod->brush.LightPoint = NULL;
6027                         mod->brush.AmbientSoundLevelsForPoint = NULL;
6028                 }
6029                 mod->brush.submodel = i;
6030
6031                 // make the model surface list (used by shadowing/lighting)
6032                 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
6033                 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
6034                 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
6035                 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
6036                 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
6037                 Mod_MakeSortedSurfaces(mod);
6038
6039                 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
6040                 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
6041                 // enlarge the bounding box to enclose all geometry of this model,
6042                 // because q3map2 sometimes lies (mostly to affect the lightgrid),
6043                 // which can in turn mess up the farclip (as well as culling when
6044                 // outside the level - an unimportant concern)
6045
6046                 //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]);
6047                 for (j = 0;j < mod->nummodelsurfaces;j++)
6048                 {
6049                         const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
6050                         const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
6051                         int k;
6052                         if (!surface->num_vertices)
6053                                 continue;
6054                         for (k = 0;k < surface->num_vertices;k++, v += 3)
6055                         {
6056                                 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
6057                                 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
6058                                 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
6059                                 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
6060                                 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
6061                                 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
6062                         }
6063                 }
6064                 //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]);
6065                 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
6066                 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
6067                 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
6068                 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
6069                 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
6070                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
6071                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
6072                 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
6073                 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
6074                 mod->yawmins[2] = mod->normalmins[2];
6075                 mod->yawmaxs[2] = mod->normalmaxs[2];
6076                 mod->radius = modelradius;
6077                 mod->radius2 = modelradius * modelradius;
6078
6079                 // this gets altered below if sky or water is used
6080                 mod->DrawSky = NULL;
6081                 mod->DrawAddWaterPlanes = NULL;
6082
6083                 for (j = 0;j < mod->nummodelsurfaces;j++)
6084                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
6085                                 break;
6086                 if (j < mod->nummodelsurfaces)
6087                         mod->DrawSky = R_Q1BSP_DrawSky;
6088
6089                 for (j = 0;j < mod->nummodelsurfaces;j++)
6090                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
6091                                 break;
6092                 if (j < mod->nummodelsurfaces)
6093                         mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
6094         }
6095 }
6096
6097 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6098 {
6099         int i = LittleLong(((int *)buffer)[1]);
6100         if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
6101                 Mod_Q3BSP_Load(mod,buffer, bufferend);
6102         else if (i == Q2BSPVERSION)
6103                 Mod_Q2BSP_Load(mod,buffer, bufferend);
6104         else
6105                 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
6106 }
6107
6108 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6109 {
6110         Host_Error("Mod_MAP_Load: not yet implemented");
6111 }
6112
6113 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
6114 {
6115         // we already have done PVS culling at this point...
6116         // so we don't need to do it again.
6117
6118         int i;
6119         vec3_t testorigin, mins, maxs;
6120
6121         testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
6122         testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
6123         testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
6124
6125         if(model->brush.TraceLineOfSight(model, eye, testorigin))
6126                 return 1;
6127
6128         // expand the box a little
6129         mins[0] = (t+1) * minsX[0] - t * maxsX[0];
6130         maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
6131         mins[1] = (t+1) * minsX[1] - t * maxsX[1];
6132         maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
6133         mins[2] = (t+1) * minsX[2] - t * maxsX[2];
6134         maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
6135
6136         for(i = 0; i != numsamples; ++i)
6137         {
6138                 testorigin[0] = lhrandom(mins[0], maxs[0]);
6139                 testorigin[1] = lhrandom(mins[1], maxs[1]);
6140                 testorigin[2] = lhrandom(mins[2], maxs[2]);
6141
6142                 if(model->brush.TraceLineOfSight(model, eye, testorigin))
6143                         return 1;
6144         }
6145
6146         return 0;
6147 }
6148