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