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