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         unsigned char zero[4];
1321
1322         memset(zero, 0, sizeof(zero));
1323
1324         loadmodel->data_textures = NULL;
1325
1326         // add two slots for notexture walls and notexture liquids
1327         if (l->filelen)
1328         {
1329                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1330                 m->nummiptex = LittleLong (m->nummiptex);
1331                 loadmodel->num_textures = m->nummiptex + 2;
1332                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1333         }
1334         else
1335         {
1336                 m = NULL;
1337                 loadmodel->num_textures = 2;
1338                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1339         }
1340
1341         loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1342
1343         // fill out all slots with notexture
1344         if (cls.state != ca_dedicated)
1345                 skinframe = R_SkinFrame_LoadMissing();
1346         else
1347                 skinframe = NULL;
1348         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1349         {
1350                 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1351                 tx->width = 16;
1352                 tx->height = 16;
1353                 if (cls.state != ca_dedicated)
1354                 {
1355                         tx->numskinframes = 1;
1356                         tx->skinframerate = 1;
1357                         tx->skinframes[0] = skinframe;
1358                         tx->currentskinframe = tx->skinframes[0];
1359                         tx->basematerialflags = 0;
1360                 }
1361                 tx->basematerialflags = MATERIALFLAG_WALL;
1362                 if (i == loadmodel->num_textures - 1)
1363                 {
1364                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1365                         tx->supercontents = mod_q1bsp_texture_water.supercontents;
1366                         tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1367                 }
1368                 else
1369                 {
1370                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1371                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1372                 }
1373                 tx->currentframe = tx;
1374
1375                 // clear water settings
1376                 tx->reflectmin = 0;
1377                 tx->reflectmax = 1;
1378                 tx->refractfactor = 1;
1379                 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1380                 tx->reflectfactor = 1;
1381                 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1382                 tx->r_water_wateralpha = 1;
1383         }
1384
1385         if (!m)
1386         {
1387                 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1388                 return;
1389         }
1390
1391         s = loadmodel->name;
1392         if (!strncasecmp(s, "maps/", 5))
1393                 s += 5;
1394         FS_StripExtension(s, mapname, sizeof(mapname));
1395
1396         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1397         dofs = m->dataofs;
1398         // LordHavoc: mostly rewritten map texture loader
1399         for (i = 0;i < m->nummiptex;i++)
1400         {
1401                 dofs[i] = LittleLong(dofs[i]);
1402                 if (r_nosurftextures.integer)
1403                         continue;
1404                 if (dofs[i] == -1)
1405                 {
1406                         Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1407                         continue;
1408                 }
1409                 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1410
1411                 // copy name, but only up to 16 characters
1412                 // (the output buffer can hold more than this, but the input buffer is
1413                 //  only 16)
1414                 for (j = 0;dmiptex->name[j] && j < 16;j++)
1415                         name[j] = dmiptex->name[j];
1416                 name[j] = 0;
1417
1418                 if (!name[0])
1419                 {
1420                         sprintf(name, "unnamed%i", i);
1421                         Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1422                 }
1423
1424                 mtwidth = LittleLong(dmiptex->width);
1425                 mtheight = LittleLong(dmiptex->height);
1426                 mtdata = NULL;
1427                 j = LittleLong(dmiptex->offsets[0]);
1428                 if (j)
1429                 {
1430                         // texture included
1431                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1432                         {
1433                                 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1434                                 continue;
1435                         }
1436                         mtdata = (unsigned char *)dmiptex + j;
1437                 }
1438
1439                 if ((mtwidth & 15) || (mtheight & 15))
1440                         Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1441
1442                 // LordHavoc: force all names to lowercase
1443                 for (j = 0;name[j];j++)
1444                         if (name[j] >= 'A' && name[j] <= 'Z')
1445                                 name[j] += 'a' - 'A';
1446
1447                 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1448                         continue;
1449
1450                 tx = loadmodel->data_textures + i;
1451                 strlcpy(tx->name, name, sizeof(tx->name));
1452                 tx->width = mtwidth;
1453                 tx->height = mtheight;
1454
1455                 if (tx->name[0] == '*')
1456                 {
1457                         if (!strncmp(tx->name, "*lava", 5))
1458                         {
1459                                 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1460                                 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1461                         }
1462                         else if (!strncmp(tx->name, "*slime", 6))
1463                         {
1464                                 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1465                                 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1466                         }
1467                         else
1468                         {
1469                                 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1470                                 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1471                         }
1472                 }
1473                 else if (!strncmp(tx->name, "sky", 3))
1474                 {
1475                         tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1476                         tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1477                 }
1478                 else
1479                 {
1480                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1481                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1482                 }
1483
1484                 if (cls.state != ca_dedicated)
1485                 {
1486                         // LordHavoc: HL sky textures are entirely different than quake
1487                         if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1488                         {
1489                                 if (loadmodel->isworldmodel)
1490                                 {
1491                                         data = loadimagepixelsbgra(tx->name, false, false);
1492                                         if (data && image_width == 256 && image_height == 128)
1493                                         {
1494                                                 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1495                                                 Mem_Free(data);
1496                                         }
1497                                         else if (mtdata != NULL)
1498                                                 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1499                                 }
1500                         }
1501                         else
1502                         {
1503                                 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);
1504                                 if (!skinframe)
1505                                         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);
1506                                 if (!skinframe)
1507                                 {
1508                                         // did not find external texture, load it from the bsp or wad3
1509                                         if (loadmodel->brush.ishlbsp)
1510                                         {
1511                                                 // internal texture overrides wad
1512                                                 unsigned char *pixels, *freepixels;
1513                                                 pixels = freepixels = NULL;
1514                                                 if (mtdata)
1515                                                         pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1516                                                 if (pixels == NULL)
1517                                                         pixels = freepixels = W_GetTextureBGRA(tx->name);
1518                                                 if (pixels != NULL)
1519                                                 {
1520                                                         tx->width = image_width;
1521                                                         tx->height = image_height;
1522                                                         skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1523                                                 }
1524                                                 if (freepixels)
1525                                                         Mem_Free(freepixels);
1526                                         }
1527                                         else if (mtdata) // texture included
1528                                                 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1529                                 }
1530                                 // if skinframe is still NULL the "missing" texture will be used
1531                                 if (skinframe)
1532                                         tx->skinframes[0] = skinframe;
1533                         }
1534
1535                         tx->basematerialflags = MATERIALFLAG_WALL;
1536                         if (tx->name[0] == '*')
1537                         {
1538                                 // LordHavoc: some turbulent textures should not be affected by wateralpha
1539                                 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1540                                 {
1541                                         // replace the texture with transparent black
1542                                         Vector4Set(zero, 128, 128, 128, 128);
1543                                         tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1544                                         tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1545                                 }
1546                                 else if (!strncmp(tx->name,"*lava",5)
1547                                  || !strncmp(tx->name,"*teleport",9)
1548                                  || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1549                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1550                                 else
1551                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1552                                 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1553                                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1554                         }
1555                         else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1556                         {
1557                                 // replace the texture with black
1558                                 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1559                                 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1560                         }
1561                         else if (!strncmp(tx->name, "sky", 3))
1562                                 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1563                         else if (!strcmp(tx->name, "caulk"))
1564                                 tx->basematerialflags = MATERIALFLAG_NODRAW;
1565                         else if (tx->skinframes[0] && tx->skinframes[0]->fog)
1566                                 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1567
1568                         // start out with no animation
1569                         tx->currentframe = tx;
1570                         tx->currentskinframe = tx->skinframes[0];
1571                 }
1572         }
1573
1574         // sequence the animations
1575         for (i = 0;i < m->nummiptex;i++)
1576         {
1577                 tx = loadmodel->data_textures + i;
1578                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1579                         continue;
1580                 if (tx->anim_total[0] || tx->anim_total[1])
1581                         continue;       // already sequenced
1582
1583                 // find the number of frames in the animation
1584                 memset(anims, 0, sizeof(anims));
1585                 memset(altanims, 0, sizeof(altanims));
1586
1587                 for (j = i;j < m->nummiptex;j++)
1588                 {
1589                         tx2 = loadmodel->data_textures + j;
1590                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1591                                 continue;
1592
1593                         num = tx2->name[1];
1594                         if (num >= '0' && num <= '9')
1595                                 anims[num - '0'] = tx2;
1596                         else if (num >= 'a' && num <= 'j')
1597                                 altanims[num - 'a'] = tx2;
1598                         else
1599                                 Con_Printf("Bad animating texture %s\n", tx->name);
1600                 }
1601
1602                 max = altmax = 0;
1603                 for (j = 0;j < 10;j++)
1604                 {
1605                         if (anims[j])
1606                                 max = j + 1;
1607                         if (altanims[j])
1608                                 altmax = j + 1;
1609                 }
1610                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1611
1612                 incomplete = false;
1613                 for (j = 0;j < max;j++)
1614                 {
1615                         if (!anims[j])
1616                         {
1617                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1618                                 incomplete = true;
1619                         }
1620                 }
1621                 for (j = 0;j < altmax;j++)
1622                 {
1623                         if (!altanims[j])
1624                         {
1625                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1626                                 incomplete = true;
1627                         }
1628                 }
1629                 if (incomplete)
1630                         continue;
1631
1632                 if (altmax < 1)
1633                 {
1634                         // if there is no alternate animation, duplicate the primary
1635                         // animation into the alternate
1636                         altmax = max;
1637                         for (k = 0;k < 10;k++)
1638                                 altanims[k] = anims[k];
1639                 }
1640
1641                 // link together the primary animation
1642                 for (j = 0;j < max;j++)
1643                 {
1644                         tx2 = anims[j];
1645                         tx2->animated = true;
1646                         tx2->anim_total[0] = max;
1647                         tx2->anim_total[1] = altmax;
1648                         for (k = 0;k < 10;k++)
1649                         {
1650                                 tx2->anim_frames[0][k] = anims[k];
1651                                 tx2->anim_frames[1][k] = altanims[k];
1652                         }
1653                 }
1654
1655                 // if there really is an alternate anim...
1656                 if (anims[0] != altanims[0])
1657                 {
1658                         // link together the alternate animation
1659                         for (j = 0;j < altmax;j++)
1660                         {
1661                                 tx2 = altanims[j];
1662                                 tx2->animated = true;
1663                                 // the primary/alternate are reversed here
1664                                 tx2->anim_total[0] = altmax;
1665                                 tx2->anim_total[1] = max;
1666                                 for (k = 0;k < 10;k++)
1667                                 {
1668                                         tx2->anim_frames[0][k] = altanims[k];
1669                                         tx2->anim_frames[1][k] = anims[k];
1670                                 }
1671                         }
1672                 }
1673         }
1674 }
1675
1676 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1677 {
1678         int i;
1679         unsigned char *in, *out, *data, d;
1680         char litfilename[MAX_QPATH];
1681         char dlitfilename[MAX_QPATH];
1682         fs_offset_t filesize;
1683         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1684         {
1685                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1686                 for (i=0; i<l->filelen; i++)
1687                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1688         }
1689         else // LordHavoc: bsp version 29 (normal white lighting)
1690         {
1691                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1692                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1693                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1694                 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1695                 strlcat (litfilename, ".lit", sizeof (litfilename));
1696                 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1697                 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1698                 if (data)
1699                 {
1700                         if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1701                         {
1702                                 i = LittleLong(((int *)data)[1]);
1703                                 if (i == 1)
1704                                 {
1705                                         if (developer_loading.integer)
1706                                                 Con_Printf("loaded %s\n", litfilename);
1707                                         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1708                                         memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1709                                         Mem_Free(data);
1710                                         data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1711                                         if (data)
1712                                         {
1713                                                 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1714                                                 {
1715                                                         i = LittleLong(((int *)data)[1]);
1716                                                         if (i == 1)
1717                                                         {
1718                                                                 if (developer_loading.integer)
1719                                                                         Con_Printf("loaded %s\n", dlitfilename);
1720                                                                 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1721                                                                 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1722                                                                 loadmodel->brushq3.deluxemapping_modelspace = false;
1723                                                                 loadmodel->brushq3.deluxemapping = true;
1724                                                         }
1725                                                 }
1726                                                 Mem_Free(data);
1727                                                 data = NULL;
1728                                         }
1729                                         return;
1730                                 }
1731                                 else
1732                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1733                         }
1734                         else if (filesize == 8)
1735                                 Con_Print("Empty .lit file, ignoring\n");
1736                         else
1737                                 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1738                         if (data)
1739                         {
1740                                 Mem_Free(data);
1741                                 data = NULL;
1742                         }
1743                 }
1744                 // LordHavoc: oh well, expand the white lighting data
1745                 if (!l->filelen)
1746                         return;
1747                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1748                 in = mod_base + l->fileofs;
1749                 out = loadmodel->brushq1.lightdata;
1750                 for (i = 0;i < l->filelen;i++)
1751                 {
1752                         d = *in++;
1753                         *out++ = d;
1754                         *out++ = d;
1755                         *out++ = d;
1756                 }
1757         }
1758 }
1759
1760 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1761 {
1762         loadmodel->brushq1.num_compressedpvs = 0;
1763         loadmodel->brushq1.data_compressedpvs = NULL;
1764         if (!l->filelen)
1765                 return;
1766         loadmodel->brushq1.num_compressedpvs = l->filelen;
1767         loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1768         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1769 }
1770
1771 // used only for HalfLife maps
1772 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1773 {
1774         char key[128], value[4096];
1775         char wadname[128];
1776         int i, j, k;
1777         if (!data)
1778                 return;
1779         if (!COM_ParseToken_Simple(&data, false, false))
1780                 return; // error
1781         if (com_token[0] != '{')
1782                 return; // error
1783         while (1)
1784         {
1785                 if (!COM_ParseToken_Simple(&data, false, false))
1786                         return; // error
1787                 if (com_token[0] == '}')
1788                         break; // end of worldspawn
1789                 if (com_token[0] == '_')
1790                         strlcpy(key, com_token + 1, sizeof(key));
1791                 else
1792                         strlcpy(key, com_token, sizeof(key));
1793                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1794                         key[strlen(key)-1] = 0;
1795                 if (!COM_ParseToken_Simple(&data, false, false))
1796                         return; // error
1797                 dpsnprintf(value, sizeof(value), "%s", com_token);
1798                 if (!strcmp("wad", key)) // for HalfLife maps
1799                 {
1800                         if (loadmodel->brush.ishlbsp)
1801                         {
1802                                 j = 0;
1803                                 for (i = 0;i < (int)sizeof(value);i++)
1804                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1805                                                 break;
1806                                 if (value[i])
1807                                 {
1808                                         for (;i < (int)sizeof(value);i++)
1809                                         {
1810                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1811                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1812                                                         j = i+1;
1813                                                 else if (value[i] == ';' || value[i] == 0)
1814                                                 {
1815                                                         k = value[i];
1816                                                         value[i] = 0;
1817                                                         strlcpy(wadname, "textures/", sizeof(wadname));
1818                                                         strlcat(wadname, &value[j], sizeof(wadname));
1819                                                         W_LoadTextureWadFile(wadname, false);
1820                                                         j = i+1;
1821                                                         if (!k)
1822                                                                 break;
1823                                                 }
1824                                         }
1825                                 }
1826                         }
1827                 }
1828         }
1829 }
1830
1831 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1832 {
1833         loadmodel->brush.entities = NULL;
1834         if (!l->filelen)
1835                 return;
1836         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1837         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1838         if (loadmodel->brush.ishlbsp)
1839                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1840 }
1841
1842
1843 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1844 {
1845         dvertex_t       *in;
1846         mvertex_t       *out;
1847         int                     i, count;
1848
1849         in = (dvertex_t *)(mod_base + l->fileofs);
1850         if (l->filelen % sizeof(*in))
1851                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1852         count = l->filelen / sizeof(*in);
1853         out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1854
1855         loadmodel->brushq1.vertexes = out;
1856         loadmodel->brushq1.numvertexes = count;
1857
1858         for ( i=0 ; i<count ; i++, in++, out++)
1859         {
1860                 out->position[0] = LittleFloat(in->point[0]);
1861                 out->position[1] = LittleFloat(in->point[1]);
1862                 out->position[2] = LittleFloat(in->point[2]);
1863         }
1864 }
1865
1866 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1867 // can be used for this
1868 // REMOVEME
1869 int SB_ReadInt (unsigned char **buffer)
1870 {
1871         int     i;
1872         i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1873         (*buffer) += 4;
1874         return i;
1875 }
1876
1877 // REMOVEME
1878 float SB_ReadFloat (unsigned char **buffer)
1879 {
1880         union
1881         {
1882                 int             i;
1883                 float   f;
1884         } u;
1885
1886         u.i = SB_ReadInt (buffer);
1887         return u.f;
1888 }
1889
1890 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1891 {
1892         unsigned char           *index;
1893         dmodel_t        *out;
1894         int                     i, j, count;
1895
1896         index = (unsigned char *)(mod_base + l->fileofs);
1897         if (l->filelen % (48+4*hullinfo->filehulls))
1898                 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1899
1900         count = l->filelen / (48+4*hullinfo->filehulls);
1901         out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1902
1903         loadmodel->brushq1.submodels = out;
1904         loadmodel->brush.numsubmodels = count;
1905
1906         for (i = 0; i < count; i++, out++)
1907         {
1908         // spread out the mins / maxs by a pixel
1909                 out->mins[0] = SB_ReadFloat (&index) - 1;
1910                 out->mins[1] = SB_ReadFloat (&index) - 1;
1911                 out->mins[2] = SB_ReadFloat (&index) - 1;
1912                 out->maxs[0] = SB_ReadFloat (&index) + 1;
1913                 out->maxs[1] = SB_ReadFloat (&index) + 1;
1914                 out->maxs[2] = SB_ReadFloat (&index) + 1;
1915                 out->origin[0] = SB_ReadFloat (&index);
1916                 out->origin[1] = SB_ReadFloat (&index);
1917                 out->origin[2] = SB_ReadFloat (&index);
1918                 for (j = 0; j < hullinfo->filehulls; j++)
1919                         out->headnode[j] = SB_ReadInt (&index);
1920                 out->visleafs = SB_ReadInt (&index);
1921                 out->firstface = SB_ReadInt (&index);
1922                 out->numfaces = SB_ReadInt (&index);
1923         }
1924 }
1925
1926 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1927 {
1928         dedge_t *in;
1929         medge_t *out;
1930         int     i, count;
1931
1932         in = (dedge_t *)(mod_base + l->fileofs);
1933         if (l->filelen % sizeof(*in))
1934                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1935         count = l->filelen / sizeof(*in);
1936         out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1937
1938         loadmodel->brushq1.edges = out;
1939         loadmodel->brushq1.numedges = count;
1940
1941         for ( i=0 ; i<count ; i++, in++, out++)
1942         {
1943                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1944                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1945                 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1946                 {
1947                         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);
1948                         out->v[0] = 0;
1949                         out->v[1] = 0;
1950                 }
1951         }
1952 }
1953
1954 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1955 {
1956         texinfo_t *in;
1957         mtexinfo_t *out;
1958         int i, j, k, count, miptex;
1959
1960         in = (texinfo_t *)(mod_base + l->fileofs);
1961         if (l->filelen % sizeof(*in))
1962                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1963         count = l->filelen / sizeof(*in);
1964         out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1965
1966         loadmodel->brushq1.texinfo = out;
1967         loadmodel->brushq1.numtexinfo = count;
1968
1969         for (i = 0;i < count;i++, in++, out++)
1970         {
1971                 for (k = 0;k < 2;k++)
1972                         for (j = 0;j < 4;j++)
1973                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1974
1975                 miptex = LittleLong(in->miptex);
1976                 out->flags = LittleLong(in->flags);
1977
1978                 out->texture = NULL;
1979                 if (loadmodel->data_textures)
1980                 {
1981                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1982                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1983                         else
1984                                 out->texture = loadmodel->data_textures + miptex;
1985                 }
1986                 if (out->flags & TEX_SPECIAL)
1987                 {
1988                         // if texture chosen is NULL or the shader needs a lightmap,
1989                         // force to notexture water shader
1990                         if (out->texture == NULL)
1991                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1992                 }
1993                 else
1994                 {
1995                         // if texture chosen is NULL, force to notexture
1996                         if (out->texture == NULL)
1997                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1998                 }
1999         }
2000 }
2001
2002 #if 0
2003 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2004 {
2005         int             i, j;
2006         float   *v;
2007
2008         mins[0] = mins[1] = mins[2] = 9999;
2009         maxs[0] = maxs[1] = maxs[2] = -9999;
2010         v = verts;
2011         for (i = 0;i < numverts;i++)
2012         {
2013                 for (j = 0;j < 3;j++, v++)
2014                 {
2015                         if (*v < mins[j])
2016                                 mins[j] = *v;
2017                         if (*v > maxs[j])
2018                                 maxs[j] = *v;
2019                 }
2020         }
2021 }
2022
2023 #define MAX_SUBDIVPOLYTRIANGLES 4096
2024 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2025
2026 static int subdivpolyverts, subdivpolytriangles;
2027 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2028 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2029
2030 static int subdivpolylookupvert(vec3_t v)
2031 {
2032         int i;
2033         for (i = 0;i < subdivpolyverts;i++)
2034                 if (subdivpolyvert[i][0] == v[0]
2035                  && subdivpolyvert[i][1] == v[1]
2036                  && subdivpolyvert[i][2] == v[2])
2037                         return i;
2038         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2039                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2040         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2041         return subdivpolyverts++;
2042 }
2043
2044 static void SubdividePolygon(int numverts, float *verts)
2045 {
2046         int             i, i1, i2, i3, f, b, c, p;
2047         vec3_t  mins, maxs, front[256], back[256];
2048         float   m, *pv, *cv, dist[256], frac;
2049
2050         if (numverts > 250)
2051                 Host_Error("SubdividePolygon: ran out of verts in buffer");
2052
2053         BoundPoly(numverts, verts, mins, maxs);
2054
2055         for (i = 0;i < 3;i++)
2056         {
2057                 m = (mins[i] + maxs[i]) * 0.5;
2058                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2059                 if (maxs[i] - m < 8)
2060                         continue;
2061                 if (m - mins[i] < 8)
2062                         continue;
2063
2064                 // cut it
2065                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2066                         dist[c] = cv[i] - m;
2067
2068                 f = b = 0;
2069                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2070                 {
2071                         if (dist[p] >= 0)
2072                         {
2073                                 VectorCopy(pv, front[f]);
2074                                 f++;
2075                         }
2076                         if (dist[p] <= 0)
2077                         {
2078                                 VectorCopy(pv, back[b]);
2079                                 b++;
2080                         }
2081                         if (dist[p] == 0 || dist[c] == 0)
2082                                 continue;
2083                         if ((dist[p] > 0) != (dist[c] > 0) )
2084                         {
2085                                 // clip point
2086                                 frac = dist[p] / (dist[p] - dist[c]);
2087                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2088                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2089                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2090                                 f++;
2091                                 b++;
2092                         }
2093                 }
2094
2095                 SubdividePolygon(f, front[0]);
2096                 SubdividePolygon(b, back[0]);
2097                 return;
2098         }
2099
2100         i1 = subdivpolylookupvert(verts);
2101         i2 = subdivpolylookupvert(verts + 3);
2102         for (i = 2;i < numverts;i++)
2103         {
2104                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2105                 {
2106                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2107                         return;
2108                 }
2109
2110                 i3 = subdivpolylookupvert(verts + i * 3);
2111                 subdivpolyindex[subdivpolytriangles][0] = i1;
2112                 subdivpolyindex[subdivpolytriangles][1] = i2;
2113                 subdivpolyindex[subdivpolytriangles][2] = i3;
2114                 i2 = i3;
2115                 subdivpolytriangles++;
2116         }
2117 }
2118
2119 //Breaks a polygon up along axial 64 unit
2120 //boundaries so that turbulent and sky warps
2121 //can be done reasonably.
2122 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2123 {
2124         int i, j;
2125         surfvertex_t *v;
2126         surfmesh_t *mesh;
2127
2128         subdivpolytriangles = 0;
2129         subdivpolyverts = 0;
2130         SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2131         if (subdivpolytriangles < 1)
2132                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2133
2134         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2135         mesh->num_vertices = subdivpolyverts;
2136         mesh->num_triangles = subdivpolytriangles;
2137         mesh->vertex = (surfvertex_t *)(mesh + 1);
2138         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2139         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2140
2141         for (i = 0;i < mesh->num_triangles;i++)
2142                 for (j = 0;j < 3;j++)
2143                         mesh->index[i*3+j] = subdivpolyindex[i][j];
2144
2145         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2146         {
2147                 VectorCopy(subdivpolyvert[i], v->v);
2148                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2149                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2150         }
2151 }
2152 #endif
2153
2154 /* Maximum size of a single LM */
2155 #define MAX_SINGLE_LM_SIZE    256
2156
2157 struct alloc_lm_row
2158 {
2159         int rowY;
2160         int currentX;
2161 };
2162
2163 struct alloc_lm_state
2164 {
2165         int currentY;
2166         struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2167 };
2168
2169 static void init_alloc_lm_state (struct alloc_lm_state* state)
2170 {
2171         int r;
2172
2173         state->currentY = 0;
2174         for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2175         {
2176           state->rows[r].currentX = 0;
2177           state->rows[r].rowY = -1;
2178         }
2179 }
2180
2181 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2182 {
2183         struct alloc_lm_row* row;
2184         int r;
2185
2186         row = &(state->rows[blockheight]);
2187         if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2188         {
2189                 if (state->currentY + blockheight <= totalheight)
2190                 {
2191                         row->rowY = state->currentY;
2192                         row->currentX = 0;
2193                         state->currentY += blockheight;
2194                 }
2195                 else
2196                 {
2197                         /* See if we can stuff the block into a higher row */
2198                         row = NULL;
2199                         for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2200                         {
2201                                 if ((state->rows[r].rowY >= 0)
2202                                   && (state->rows[r].currentX + blockwidth <= totalwidth))
2203                                 {
2204                                         row = &(state->rows[r]);
2205                                         break;
2206                                 }
2207                         }
2208                         if (row == NULL) return false;
2209                 }
2210         }
2211         *outy = row->rowY;
2212         *outx = row->currentX;
2213         row->currentX += blockwidth;
2214
2215         return true;
2216 }
2217
2218 extern cvar_t gl_max_size;
2219 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2220 {
2221         dface_t *in;
2222         msurface_t *surface;
2223         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2224         float texmins[2], texmaxs[2], val;
2225         rtexture_t *lightmaptexture, *deluxemaptexture;
2226
2227         in = (dface_t *)(mod_base + l->fileofs);
2228         if (l->filelen % sizeof(*in))
2229                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2230         count = l->filelen / sizeof(*in);
2231         loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2232         loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2233
2234         loadmodel->num_surfaces = count;
2235
2236         totalverts = 0;
2237         totaltris = 0;
2238         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2239         {
2240                 numedges = (unsigned short)LittleShort(in->numedges);
2241                 totalverts += numedges;
2242                 totaltris += numedges - 2;
2243         }
2244
2245         Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2246
2247         lightmaptexture = NULL;
2248         deluxemaptexture = r_texture_blanknormalmap;
2249         lightmapnumber = 1;
2250         lightmapsize = max(256, gl_max_size.integer);
2251         totallightmapsamples = 0;
2252
2253         totalverts = 0;
2254         totaltris = 0;
2255         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2256         {
2257                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2258
2259                 // FIXME: validate edges, texinfo, etc?
2260                 firstedge = LittleLong(in->firstedge);
2261                 numedges = (unsigned short)LittleShort(in->numedges);
2262                 if ((unsigned int) firstedge > (unsigned int) loadmodel->brushq1.numsurfedges || (unsigned int) numedges > (unsigned int) loadmodel->brushq1.numsurfedges || (unsigned int) firstedge + (unsigned int) numedges > (unsigned int) loadmodel->brushq1.numsurfedges)
2263                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2264                 i = (unsigned short)LittleShort(in->texinfo);
2265                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2266                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2267                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2268                 surface->texture = surface->lightmapinfo->texinfo->texture;
2269
2270                 planenum = (unsigned short)LittleShort(in->planenum);
2271                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2272                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2273
2274                 //surface->flags = surface->texture->flags;
2275                 //if (LittleShort(in->side))
2276                 //      surface->flags |= SURF_PLANEBACK;
2277                 //surface->plane = loadmodel->brush.data_planes + planenum;
2278
2279                 surface->num_firstvertex = totalverts;
2280                 surface->num_vertices = numedges;
2281                 surface->num_firsttriangle = totaltris;
2282                 surface->num_triangles = numedges - 2;
2283                 totalverts += numedges;
2284                 totaltris += numedges - 2;
2285
2286                 // convert edges back to a normal polygon
2287                 for (i = 0;i < surface->num_vertices;i++)
2288                 {
2289                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2290                         float s, t;
2291                         if (lindex > 0)
2292                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2293                         else
2294                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2295                         s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2296                         t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2297                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2298                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2299                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2300                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2301                         (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2302                 }
2303
2304                 for (i = 0;i < surface->num_triangles;i++)
2305                 {
2306                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2307                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2308                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2309                 }
2310
2311                 // compile additional data about the surface geometry
2312                 Mod_BuildNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_normal3f, true);
2313                 Mod_BuildTextureVectorsFromNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_texcoordtexture2f, loadmodel->surfmesh.data_normal3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_svector3f, loadmodel->surfmesh.data_tvector3f, true);
2314                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2315
2316                 // generate surface extents information
2317                 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2318                 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2319                 for (i = 1;i < surface->num_vertices;i++)
2320                 {
2321                         for (j = 0;j < 2;j++)
2322                         {
2323                                 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2324                                 texmins[j] = min(texmins[j], val);
2325                                 texmaxs[j] = max(texmaxs[j], val);
2326                         }
2327                 }
2328                 for (i = 0;i < 2;i++)
2329                 {
2330                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2331                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2332                 }
2333
2334                 smax = surface->lightmapinfo->extents[0] >> 4;
2335                 tmax = surface->lightmapinfo->extents[1] >> 4;
2336                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2337                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2338
2339                 // lighting info
2340                 for (i = 0;i < MAXLIGHTMAPS;i++)
2341                         surface->lightmapinfo->styles[i] = in->styles[i];
2342                 surface->lightmaptexture = NULL;
2343                 surface->deluxemaptexture = r_texture_blanknormalmap;
2344                 i = LittleLong(in->lightofs);
2345                 if (i == -1)
2346                 {
2347                         surface->lightmapinfo->samples = NULL;
2348                         // give non-lightmapped water a 1x white lightmap
2349                         if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2350                         {
2351                                 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2352                                 surface->lightmapinfo->styles[0] = 0;
2353                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2354                         }
2355                 }
2356                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2357                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2358                 else // LordHavoc: white lighting (bsp version 29)
2359                 {
2360                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2361                         if (loadmodel->brushq1.nmaplightdata)
2362                                 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2363                 }
2364
2365                 // check if we should apply a lightmap to this
2366                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2367                 {
2368                         if (ssize > 256 || tsize > 256)
2369                                 Host_Error("Bad surface extents");
2370
2371                         if (lightmapsize < ssize)
2372                                 lightmapsize = ssize;
2373                         if (lightmapsize < tsize)
2374                                 lightmapsize = tsize;
2375
2376                         totallightmapsamples += ssize*tsize;
2377
2378                         // force lightmap upload on first time seeing the surface
2379                         //
2380                         // additionally this is used by the later code to see if a
2381                         // lightmap is needed on this surface (rather than duplicating the
2382                         // logic above)
2383                         surface->cached_dlight = true;
2384                 }
2385         }
2386
2387         // small maps (such as ammo boxes especially) don't need big lightmap
2388         // textures, so this code tries to guess a good size based on
2389         // totallightmapsamples (size of the lightmaps lump basically), as well as
2390         // trying to max out the gl_max_size if there is a lot of lightmap data to
2391         // store
2392         // additionally, never choose a lightmapsize that is smaller than the
2393         // largest surface encountered (as it would fail)
2394         i = lightmapsize;
2395         for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2396                 ;
2397
2398         // now that we've decided the lightmap texture size, we can do the rest
2399         if (cls.state != ca_dedicated)
2400         {
2401                 struct alloc_lm_state allocState;
2402
2403                 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2404                 {
2405                         int i, iu, iv, lightmapx, lightmapy;
2406                         float u, v, ubase, vbase, uscale, vscale;
2407
2408                         smax = surface->lightmapinfo->extents[0] >> 4;
2409                         tmax = surface->lightmapinfo->extents[1] >> 4;
2410                         ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2411                         tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2412
2413                         // stainmap for permanent marks on walls
2414                         surface->lightmapinfo->stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2415                         // clear to white
2416                         memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
2417
2418                         if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2419                         {
2420                                 // allocate a texture pool if we need it
2421                                 if (loadmodel->texturepool == NULL)
2422                                         loadmodel->texturepool = R_AllocTexturePool();
2423                                 // could not find room, make a new lightmap
2424                                 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2425                                 if (loadmodel->brushq1.nmaplightdata)
2426                                         deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2427                                 lightmapnumber++;
2428                                 init_alloc_lm_state (&allocState);
2429                                 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2430                         }
2431                         surface->lightmaptexture = lightmaptexture;
2432                         surface->deluxemaptexture = deluxemaptexture;
2433                         surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2434                         surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2435
2436                         uscale = 1.0f / (float)lightmapsize;
2437                         vscale = 1.0f / (float)lightmapsize;
2438                         ubase = lightmapx * uscale;
2439                         vbase = lightmapy * vscale;
2440
2441                         for (i = 0;i < surface->num_vertices;i++)
2442                         {
2443                                 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);
2444                                 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);
2445                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2446                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2447                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2448                                 iu = (int) u;
2449                                 iv = (int) v;
2450                                 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2451                         }
2452
2453                 }
2454         }
2455 }
2456
2457 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2458 {
2459         //if (node->parent)
2460         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2461         node->parent = parent;
2462         if (node->plane)
2463         {
2464                 // this is a node, recurse to children
2465                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2466                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2467                 // combine supercontents of children
2468                 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2469         }
2470         else
2471         {
2472                 int j;
2473                 mleaf_t *leaf = (mleaf_t *)node;
2474                 // if this is a leaf, calculate supercontents mask from all collidable
2475                 // primitives in the leaf (brushes and collision surfaces)
2476                 // also flag if the leaf contains any collision surfaces
2477                 leaf->combinedsupercontents = 0;
2478                 // combine the supercontents values of all brushes in this leaf
2479                 for (j = 0;j < leaf->numleafbrushes;j++)
2480                         leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2481                 // check if this leaf contains any collision surfaces (q3 patches)
2482                 for (j = 0;j < leaf->numleafsurfaces;j++)
2483                 {
2484                         msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2485                         if (surface->num_collisiontriangles)
2486                         {
2487                                 leaf->containscollisionsurfaces = true;
2488                                 leaf->combinedsupercontents |= surface->texture->supercontents;
2489                         }
2490                 }
2491         }
2492 }
2493
2494 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2495 {
2496         int                     i, j, count, p;
2497         dnode_t         *in;
2498         mnode_t         *out;
2499
2500         in = (dnode_t *)(mod_base + l->fileofs);
2501         if (l->filelen % sizeof(*in))
2502                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2503         count = l->filelen / sizeof(*in);
2504         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2505
2506         loadmodel->brush.data_nodes = out;
2507         loadmodel->brush.num_nodes = count;
2508
2509         for ( i=0 ; i<count ; i++, in++, out++)
2510         {
2511                 for (j=0 ; j<3 ; j++)
2512                 {
2513                         out->mins[j] = LittleShort(in->mins[j]);
2514                         out->maxs[j] = LittleShort(in->maxs[j]);
2515                 }
2516
2517                 p = LittleLong(in->planenum);
2518                 out->plane = loadmodel->brush.data_planes + p;
2519
2520                 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2521                 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2522
2523                 for (j=0 ; j<2 ; j++)
2524                 {
2525                         // LordHavoc: this code supports broken bsp files produced by
2526                         // arguire qbsp which can produce more than 32768 nodes, any value
2527                         // below count is assumed to be a node number, any other value is
2528                         // assumed to be a leaf number
2529                         p = (unsigned short)LittleShort(in->children[j]);
2530                         if (p < count)
2531                         {
2532                                 if (p < loadmodel->brush.num_nodes)
2533                                         out->children[j] = loadmodel->brush.data_nodes + p;
2534                                 else
2535                                 {
2536                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2537                                         // map it to the solid leaf
2538                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2539                                 }
2540                         }
2541                         else
2542                         {
2543                                 // note this uses 65535 intentionally, -1 is leaf 0
2544                                 p = 65535 - p;
2545                                 if (p < loadmodel->brush.num_leafs)
2546                                         out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2547                                 else
2548                                 {
2549                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2550                                         // map it to the solid leaf
2551                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2552                                 }
2553                         }
2554                 }
2555         }
2556
2557         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2558 }
2559
2560 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2561 {
2562         dleaf_t *in;
2563         mleaf_t *out;
2564         int i, j, count, p;
2565
2566         in = (dleaf_t *)(mod_base + l->fileofs);
2567         if (l->filelen % sizeof(*in))
2568                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2569         count = l->filelen / sizeof(*in);
2570         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2571
2572         loadmodel->brush.data_leafs = out;
2573         loadmodel->brush.num_leafs = count;
2574         // get visleafs from the submodel data
2575         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2576         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2577         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2578         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2579
2580         for ( i=0 ; i<count ; i++, in++, out++)
2581         {
2582                 for (j=0 ; j<3 ; j++)
2583                 {
2584                         out->mins[j] = LittleShort(in->mins[j]);
2585                         out->maxs[j] = LittleShort(in->maxs[j]);
2586                 }
2587
2588                 // FIXME: this function could really benefit from some error checking
2589
2590                 out->contents = LittleLong(in->contents);
2591
2592                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2593                 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2594                 if (out->firstleafsurface < 0 || (unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2595                 {
2596                         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);
2597                         out->firstleafsurface = NULL;
2598                         out->numleafsurfaces = 0;
2599                 }
2600
2601                 out->clusterindex = i - 1;
2602                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2603                         out->clusterindex = -1;
2604
2605                 p = LittleLong(in->visofs);
2606                 // ignore visofs errors on leaf 0 (solid)
2607                 if (p >= 0 && out->clusterindex >= 0)
2608                 {
2609                         if (p >= loadmodel->brushq1.num_compressedpvs)
2610                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2611                         else
2612                                 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);
2613                 }
2614
2615                 for (j = 0;j < 4;j++)
2616                         out->ambient_sound_level[j] = in->ambient_level[j];
2617
2618                 // FIXME: Insert caustics here
2619         }
2620 }
2621
2622 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2623 {
2624         int i, j;
2625         mleaf_t *leaf;
2626         const unsigned char *pvs;
2627         // check all liquid leafs to see if they can see into empty leafs, if any
2628         // can we can assume this map supports r_wateralpha
2629         for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2630         {
2631                 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && (leaf->clusterindex >= 0 && loadmodel->brush.data_pvsclusters))
2632                 {
2633                         pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2634                         for (j = 0;j < loadmodel->brush.num_leafs;j++)
2635                                 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2636                                         return true;
2637                 }
2638         }
2639         return false;
2640 }
2641
2642 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2643 {
2644         dclipnode_t *in;
2645         mclipnode_t *out;
2646         int                     i, count;
2647         hull_t          *hull;
2648
2649         in = (dclipnode_t *)(mod_base + l->fileofs);
2650         if (l->filelen % sizeof(*in))
2651                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2652         count = l->filelen / sizeof(*in);
2653         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2654
2655         loadmodel->brushq1.clipnodes = out;
2656         loadmodel->brushq1.numclipnodes = count;
2657
2658         for (i = 1; i < MAX_MAP_HULLS; i++)
2659         {
2660                 hull = &loadmodel->brushq1.hulls[i];
2661                 hull->clipnodes = out;
2662                 hull->firstclipnode = 0;
2663                 hull->lastclipnode = count-1;
2664                 hull->planes = loadmodel->brush.data_planes;
2665                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2666                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2667                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2668                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2669                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2670                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2671                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2672         }
2673
2674         for (i=0 ; i<count ; i++, out++, in++)
2675         {
2676                 out->planenum = LittleLong(in->planenum);
2677                 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2678                 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2679                 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2680                 if (out->children[0] >= count)
2681                         out->children[0] -= 65536;
2682                 if (out->children[1] >= count)
2683                         out->children[1] -= 65536;
2684                 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2685                         Host_Error("Corrupt clipping hull(out of range planenum)");
2686         }
2687 }
2688
2689 //Duplicate the drawing hull structure as a clipping hull
2690 static void Mod_Q1BSP_MakeHull0(void)
2691 {
2692         mnode_t         *in;
2693         mclipnode_t *out;
2694         int                     i;
2695         hull_t          *hull;
2696
2697         hull = &loadmodel->brushq1.hulls[0];
2698
2699         in = loadmodel->brush.data_nodes;
2700         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2701
2702         hull->clipnodes = out;
2703         hull->firstclipnode = 0;
2704         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2705         hull->planes = loadmodel->brush.data_planes;
2706
2707         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2708         {
2709                 out->planenum = in->plane - loadmodel->brush.data_planes;
2710                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2711                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2712         }
2713 }
2714
2715 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2716 {
2717         int i, j;
2718         short *in;
2719
2720         in = (short *)(mod_base + l->fileofs);
2721         if (l->filelen % sizeof(*in))
2722                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2723         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2724         loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2725
2726         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2727         {
2728                 j = (unsigned short) LittleShort(in[i]);
2729                 if (j >= loadmodel->num_surfaces)
2730                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2731                 loadmodel->brush.data_leafsurfaces[i] = j;
2732         }
2733 }
2734
2735 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2736 {
2737         int             i;
2738         int             *in;
2739
2740         in = (int *)(mod_base + l->fileofs);
2741         if (l->filelen % sizeof(*in))
2742                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2743         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2744         loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2745
2746         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2747                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2748 }
2749
2750
2751 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2752 {
2753         int                     i;
2754         mplane_t        *out;
2755         dplane_t        *in;
2756
2757         in = (dplane_t *)(mod_base + l->fileofs);
2758         if (l->filelen % sizeof(*in))
2759                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2760
2761         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2762         loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2763
2764         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2765         {
2766                 out->normal[0] = LittleFloat(in->normal[0]);
2767                 out->normal[1] = LittleFloat(in->normal[1]);
2768                 out->normal[2] = LittleFloat(in->normal[2]);
2769                 out->dist = LittleFloat(in->dist);
2770
2771                 PlaneClassify(out);
2772         }
2773 }
2774
2775 static void Mod_Q1BSP_LoadMapBrushes(void)
2776 {
2777 #if 0
2778 // unfinished
2779         int submodel, numbrushes;
2780         qboolean firstbrush;
2781         char *text, *maptext;
2782         char mapfilename[MAX_QPATH];
2783         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2784         strlcat (mapfilename, ".map", sizeof (mapfilename));
2785         maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2786         if (!maptext)
2787                 return;
2788         text = maptext;
2789         if (!COM_ParseToken_Simple(&data, false, false))
2790                 return; // error
2791         submodel = 0;
2792         for (;;)
2793         {
2794                 if (!COM_ParseToken_Simple(&data, false, false))
2795                         break;
2796                 if (com_token[0] != '{')
2797                         return; // error
2798                 // entity
2799                 firstbrush = true;
2800                 numbrushes = 0;
2801                 maxbrushes = 256;
2802                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2803                 for (;;)
2804                 {
2805                         if (!COM_ParseToken_Simple(&data, false, false))
2806                                 return; // error
2807                         if (com_token[0] == '}')
2808                                 break; // end of entity
2809                         if (com_token[0] == '{')
2810                         {
2811                                 // brush
2812                                 if (firstbrush)
2813                                 {
2814                                         if (submodel)
2815                                         {
2816                                                 if (submodel > loadmodel->brush.numsubmodels)
2817                                                 {
2818                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2819                                                         model = NULL;
2820                                                 }
2821                                                 else
2822                                                         model = loadmodel->brush.submodels[submodel];
2823                                         }
2824                                         else
2825                                                 model = loadmodel;
2826                                 }
2827                                 for (;;)
2828                                 {
2829                                         if (!COM_ParseToken_Simple(&data, false, false))
2830                                                 return; // error
2831                                         if (com_token[0] == '}')
2832                                                 break; // end of brush
2833                                         // each brush face should be this format:
2834                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2835                                         // FIXME: support hl .map format
2836                                         for (pointnum = 0;pointnum < 3;pointnum++)
2837                                         {
2838                                                 COM_ParseToken_Simple(&data, false, false);
2839                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2840                                                 {
2841                                                         COM_ParseToken_Simple(&data, false, false);
2842                                                         point[pointnum][componentnum] = atof(com_token);
2843                                                 }
2844                                                 COM_ParseToken_Simple(&data, false, false);
2845                                         }
2846                                         COM_ParseToken_Simple(&data, false, false);
2847                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2848                                         COM_ParseToken_Simple(&data, false, false);
2849                                         //scroll_s = atof(com_token);
2850                                         COM_ParseToken_Simple(&data, false, false);
2851                                         //scroll_t = atof(com_token);
2852                                         COM_ParseToken_Simple(&data, false, false);
2853                                         //rotate = atof(com_token);
2854                                         COM_ParseToken_Simple(&data, false, false);
2855                                         //scale_s = atof(com_token);
2856                                         COM_ParseToken_Simple(&data, false, false);
2857                                         //scale_t = atof(com_token);
2858                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2859                                         VectorNormalizeDouble(planenormal);
2860                                         planedist = DotProduct(point[0], planenormal);
2861                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2862                                 }
2863                                 continue;
2864                         }
2865                 }
2866         }
2867 #endif
2868 }
2869
2870
2871 #define MAX_PORTALPOINTS 64
2872
2873 typedef struct portal_s
2874 {
2875         mplane_t plane;
2876         mnode_t *nodes[2];              // [0] = front side of plane
2877         struct portal_s *next[2];
2878         int numpoints;
2879         double points[3*MAX_PORTALPOINTS];
2880         struct portal_s *chain; // all portals are linked into a list
2881 }
2882 portal_t;
2883
2884 static portal_t *portalchain;
2885
2886 /*
2887 ===========
2888 AllocPortal
2889 ===========
2890 */
2891 static portal_t *AllocPortal(void)
2892 {
2893         portal_t *p;
2894         p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2895         p->chain = portalchain;
2896         portalchain = p;
2897         return p;
2898 }
2899
2900 static void FreePortal(portal_t *p)
2901 {
2902         Mem_Free(p);
2903 }
2904
2905 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2906 {
2907         // process only nodes (leafs already had their box calculated)
2908         if (!node->plane)
2909                 return;
2910
2911         // calculate children first
2912         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2913         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2914
2915         // make combined bounding box from children
2916         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2917         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2918         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2919         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2920         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2921         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2922 }
2923
2924 static void Mod_Q1BSP_FinalizePortals(void)
2925 {
2926         int i, j, numportals, numpoints;
2927         portal_t *p, *pnext;
2928         mportal_t *portal;
2929         mvertex_t *point;
2930         mleaf_t *leaf, *endleaf;
2931
2932         // tally up portal and point counts and recalculate bounding boxes for all
2933         // leafs (because qbsp is very sloppy)
2934         leaf = loadmodel->brush.data_leafs;
2935         endleaf = leaf + loadmodel->brush.num_leafs;
2936         for (;leaf < endleaf;leaf++)
2937         {
2938                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
2939                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2940         }
2941         p = portalchain;
2942         numportals = 0;
2943         numpoints = 0;
2944         while (p)
2945         {
2946                 // note: this check must match the one below or it will usually corrupt memory
2947                 // 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
2948                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2949                 {
2950                         numportals += 2;
2951                         numpoints += p->numpoints * 2;
2952                 }
2953                 p = p->chain;
2954         }
2955         loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2956         loadmodel->brush.num_portals = numportals;
2957         loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2958         loadmodel->brush.num_portalpoints = numpoints;
2959         // clear all leaf portal chains
2960         for (i = 0;i < loadmodel->brush.num_leafs;i++)
2961                 loadmodel->brush.data_leafs[i].portals = NULL;
2962         // process all portals in the global portal chain, while freeing them
2963         portal = loadmodel->brush.data_portals;
2964         point = loadmodel->brush.data_portalpoints;
2965         p = portalchain;
2966         portalchain = NULL;
2967         while (p)
2968         {
2969                 pnext = p->chain;
2970
2971                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2972                 {
2973                         // note: this check must match the one above or it will usually corrupt memory
2974                         // the nodes[0] != nodes[1] check is because leaf 0 is the shared solid leaf, it can have many portals inside with leaf 0 on both sides
2975                         if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2976                         {
2977                                 // first make the back to front portal(forward portal)
2978                                 portal->points = point;
2979                                 portal->numpoints = p->numpoints;
2980                                 portal->plane.dist = p->plane.dist;
2981                                 VectorCopy(p->plane.normal, portal->plane.normal);
2982                                 portal->here = (mleaf_t *)p->nodes[1];
2983                                 portal->past = (mleaf_t *)p->nodes[0];
2984                                 // copy points
2985                                 for (j = 0;j < portal->numpoints;j++)
2986                                 {
2987                                         VectorCopy(p->points + j*3, point->position);
2988                                         point++;
2989                                 }
2990                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2991                                 PlaneClassify(&portal->plane);
2992
2993                                 // link into leaf's portal chain
2994                                 portal->next = portal->here->portals;
2995                                 portal->here->portals = portal;
2996
2997                                 // advance to next portal
2998                                 portal++;
2999
3000                                 // then make the front to back portal(backward portal)
3001                                 portal->points = point;
3002                                 portal->numpoints = p->numpoints;
3003                                 portal->plane.dist = -p->plane.dist;
3004                                 VectorNegate(p->plane.normal, portal->plane.normal);
3005                                 portal->here = (mleaf_t *)p->nodes[0];
3006                                 portal->past = (mleaf_t *)p->nodes[1];
3007                                 // copy points
3008                                 for (j = portal->numpoints - 1;j >= 0;j--)
3009                                 {
3010                                         VectorCopy(p->points + j*3, point->position);
3011                                         point++;
3012                                 }
3013                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3014                                 PlaneClassify(&portal->plane);
3015
3016                                 // link into leaf's portal chain
3017                                 portal->next = portal->here->portals;
3018                                 portal->here->portals = portal;
3019
3020                                 // advance to next portal
3021                                 portal++;
3022                         }
3023                         // add the portal's polygon points to the leaf bounding boxes
3024                         for (i = 0;i < 2;i++)
3025                         {
3026                                 leaf = (mleaf_t *)p->nodes[i];
3027                                 for (j = 0;j < p->numpoints;j++)
3028                                 {
3029                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3030                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3031                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3032                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3033                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3034                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3035                                 }
3036                         }
3037                 }
3038                 FreePortal(p);
3039                 p = pnext;
3040         }
3041         // now recalculate the node bounding boxes from the leafs
3042         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
3043 }
3044
3045 /*
3046 =============
3047 AddPortalToNodes
3048 =============
3049 */
3050 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3051 {
3052         if (!front)
3053                 Host_Error("AddPortalToNodes: NULL front node");
3054         if (!back)
3055                 Host_Error("AddPortalToNodes: NULL back node");
3056         if (p->nodes[0] || p->nodes[1])
3057                 Host_Error("AddPortalToNodes: already included");
3058         // 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
3059
3060         p->nodes[0] = front;
3061         p->next[0] = (portal_t *)front->portals;
3062         front->portals = (mportal_t *)p;
3063
3064         p->nodes[1] = back;
3065         p->next[1] = (portal_t *)back->portals;
3066         back->portals = (mportal_t *)p;
3067 }
3068
3069 /*
3070 =============
3071 RemovePortalFromNode
3072 =============
3073 */
3074 static void RemovePortalFromNodes(portal_t *portal)
3075 {
3076         int i;
3077         mnode_t *node;
3078         void **portalpointer;
3079         portal_t *t;
3080         for (i = 0;i < 2;i++)
3081         {
3082                 node = portal->nodes[i];
3083
3084                 portalpointer = (void **) &node->portals;
3085                 while (1)
3086                 {
3087                         t = (portal_t *)*portalpointer;
3088                         if (!t)
3089                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
3090
3091                         if (t == portal)
3092                         {
3093                                 if (portal->nodes[0] == node)
3094                                 {
3095                                         *portalpointer = portal->next[0];
3096                                         portal->nodes[0] = NULL;
3097                                 }
3098                                 else if (portal->nodes[1] == node)
3099                                 {
3100                                         *portalpointer = portal->next[1];
3101                                         portal->nodes[1] = NULL;
3102                                 }
3103                                 else
3104                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3105                                 break;
3106                         }
3107
3108                         if (t->nodes[0] == node)
3109                                 portalpointer = (void **) &t->next[0];
3110                         else if (t->nodes[1] == node)
3111                                 portalpointer = (void **) &t->next[1];
3112                         else
3113                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3114                 }
3115         }
3116 }
3117
3118 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3119 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3120 {
3121         int i, side;
3122         mnode_t *front, *back, *other_node;
3123         mplane_t clipplane, *plane;
3124         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3125         int numfrontpoints, numbackpoints;
3126         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3127
3128         // if a leaf, we're done
3129         if (!node->plane)
3130                 return;
3131
3132         plane = node->plane;
3133
3134         front = node->children[0];
3135         back = node->children[1];
3136         if (front == back)
3137                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3138
3139         // create the new portal by generating a polygon for the node plane,
3140         // and clipping it by all of the other portals(which came from nodes above this one)
3141         nodeportal = AllocPortal();
3142         nodeportal->plane = *plane;
3143
3144         // 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)
3145         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);
3146         nodeportal->numpoints = 4;
3147         side = 0;       // shut up compiler warning
3148         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3149         {
3150                 clipplane = portal->plane;
3151                 if (portal->nodes[0] == portal->nodes[1])
3152                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3153                 if (portal->nodes[0] == node)
3154                         side = 0;
3155                 else if (portal->nodes[1] == node)
3156                 {
3157                         clipplane.dist = -clipplane.dist;
3158                         VectorNegate(clipplane.normal, clipplane.normal);
3159                         side = 1;
3160                 }
3161                 else
3162                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3163
3164                 for (i = 0;i < nodeportal->numpoints*3;i++)
3165                         frontpoints[i] = nodeportal->points[i];
3166                 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);
3167                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3168                         break;
3169         }
3170
3171         if (nodeportal->numpoints < 3)
3172         {
3173                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3174                 nodeportal->numpoints = 0;
3175         }
3176         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3177         {
3178                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3179                 nodeportal->numpoints = 0;
3180         }
3181
3182         AddPortalToNodes(nodeportal, front, back);
3183
3184         // split the portals of this node along this node's plane and assign them to the children of this node
3185         // (migrating the portals downward through the tree)
3186         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3187         {
3188                 if (portal->nodes[0] == portal->nodes[1])
3189                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3190                 if (portal->nodes[0] == node)
3191                         side = 0;
3192                 else if (portal->nodes[1] == node)
3193                         side = 1;
3194                 else
3195                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3196                 nextportal = portal->next[side];
3197                 if (!portal->numpoints)
3198                         continue;
3199
3200                 other_node = portal->nodes[!side];
3201                 RemovePortalFromNodes(portal);
3202
3203                 // cut the portal into two portals, one on each side of the node plane
3204                 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);
3205
3206                 if (!numfrontpoints)
3207                 {
3208                         if (side == 0)
3209                                 AddPortalToNodes(portal, back, other_node);
3210                         else
3211                                 AddPortalToNodes(portal, other_node, back);
3212                         continue;
3213                 }
3214                 if (!numbackpoints)
3215                 {
3216                         if (side == 0)
3217                                 AddPortalToNodes(portal, front, other_node);
3218                         else
3219                                 AddPortalToNodes(portal, other_node, front);
3220                         continue;
3221                 }
3222
3223                 // the portal is split
3224                 splitportal = AllocPortal();
3225                 temp = splitportal->chain;
3226                 *splitportal = *portal;
3227                 splitportal->chain = temp;
3228                 for (i = 0;i < numbackpoints*3;i++)
3229                         splitportal->points[i] = backpoints[i];
3230                 splitportal->numpoints = numbackpoints;
3231                 for (i = 0;i < numfrontpoints*3;i++)
3232                         portal->points[i] = frontpoints[i];
3233                 portal->numpoints = numfrontpoints;
3234
3235                 if (side == 0)
3236                 {
3237                         AddPortalToNodes(portal, front, other_node);
3238                         AddPortalToNodes(splitportal, back, other_node);
3239                 }
3240                 else
3241                 {
3242                         AddPortalToNodes(portal, other_node, front);
3243                         AddPortalToNodes(splitportal, other_node, back);
3244                 }
3245         }
3246
3247         Mod_Q1BSP_RecursiveNodePortals(front);
3248         Mod_Q1BSP_RecursiveNodePortals(back);
3249 }
3250
3251 static void Mod_Q1BSP_MakePortals(void)
3252 {
3253         portalchain = NULL;
3254         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3255         Mod_Q1BSP_FinalizePortals();
3256 }
3257
3258 //Returns PVS data for a given point
3259 //(note: can return NULL)
3260 static unsigned char *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
3261 {
3262         mnode_t *node;
3263         node = model->brush.data_nodes;
3264         while (node->plane)
3265                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3266         if (((mleaf_t *)node)->clusterindex >= 0)
3267                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3268         else
3269                 return NULL;
3270 }
3271
3272 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbytes, mnode_t *node)
3273 {
3274         while (node->plane)
3275         {
3276                 float d = PlaneDiff(org, node->plane);
3277                 if (d > radius)
3278                         node = node->children[0];
3279                 else if (d < -radius)
3280                         node = node->children[1];
3281                 else
3282                 {
3283                         // go down both sides
3284                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3285                         node = node->children[1];
3286                 }
3287         }
3288         // if this leaf is in a cluster, accumulate the pvs bits
3289         if (((mleaf_t *)node)->clusterindex >= 0)
3290         {
3291                 int i;
3292                 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3293                 for (i = 0;i < pvsbytes;i++)
3294                         pvsbuffer[i] |= pvs[i];
3295         }
3296 }
3297
3298 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3299 //of the given point.
3300 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3301 {
3302         int bytes = model->brush.num_pvsclusterbytes;
3303         bytes = min(bytes, pvsbufferlength);
3304         if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3305         {
3306                 memset(pvsbuffer, 0xFF, bytes);
3307                 return bytes;
3308         }
3309         if (!merge)
3310                 memset(pvsbuffer, 0, bytes);
3311         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3312         return bytes;
3313 }
3314
3315 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3316 {
3317         vec3_t size;
3318         const hull_t *hull;
3319
3320         VectorSubtract(inmaxs, inmins, size);
3321         if (cmodel->brush.ishlbsp)
3322         {
3323                 if (size[0] < 3)
3324                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3325                 else if (size[0] <= 32)
3326                 {
3327                         if (size[2] < 54) // pick the nearest of 36 or 72
3328                                 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3329                         else
3330                                 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3331                 }
3332                 else
3333                         hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3334         }
3335         else
3336         {
3337                 if (size[0] < 3)
3338                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3339                 else if (size[0] <= 32)
3340                         hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3341                 else
3342                         hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3343         }
3344         VectorCopy(inmins, outmins);
3345         VectorAdd(inmins, hull->clip_size, outmaxs);
3346 }
3347
3348 void Mod_Q1BSP_Load(model_t *mod, void *buffer, void *bufferend)
3349 {
3350         int i, j, k;
3351         dheader_t *header;
3352         dmodel_t *bm;
3353         mempool_t *mainmempool;
3354         float dist, modelyawradius, modelradius, *vec;
3355         msurface_t *surface;
3356         int numshadowmeshtriangles;
3357         hullinfo_t hullinfo;
3358         int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3359         model_brush_lightstyleinfo_t styleinfo[256];
3360         unsigned char *datapointer;
3361
3362         mod->modeldatatypestring = "Q1BSP";
3363
3364         mod->type = mod_brushq1;
3365
3366         header = (dheader_t *)buffer;
3367
3368         i = LittleLong(header->version);
3369         if (i != BSPVERSION && i != 30)
3370                 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3371         mod->brush.ishlbsp = i == 30;
3372
3373 // fill in hull info
3374         VectorClear (hullinfo.hullsizes[0][0]);
3375         VectorClear (hullinfo.hullsizes[0][1]);
3376         if (mod->brush.ishlbsp)
3377         {
3378                 mod->modeldatatypestring = "HLBSP";
3379
3380                 hullinfo.filehulls = 4;
3381                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3382                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3383                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3384                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3385                 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3386                 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3387         }
3388         else
3389         {
3390                 hullinfo.filehulls = 4;
3391                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3392                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3393                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3394                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3395         }
3396
3397 // read lumps
3398         mod_base = (unsigned char*)buffer;
3399         for (i = 0; i < HEADER_LUMPS; i++)
3400         {
3401                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3402                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3403         }
3404
3405         mod->soundfromcenter = true;
3406         mod->TraceBox = Mod_Q1BSP_TraceBox;
3407         mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3408         mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3409         mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3410         mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3411         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3412         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3413         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3414         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3415         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3416         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3417         mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3418         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3419         mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3420         mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3421         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3422
3423         if (loadmodel->isworldmodel)
3424                 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3425
3426 // load into heap
3427
3428         mod->brush.qw_md4sum = 0;
3429         mod->brush.qw_md4sum2 = 0;
3430         for (i = 0;i < HEADER_LUMPS;i++)
3431         {
3432                 if (i == LUMP_ENTITIES)
3433                         continue;
3434                 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3435                 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3436                         continue;
3437                 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3438         }
3439
3440         Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3441         Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3442         Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3443         Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3444         Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3445         Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3446         Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3447         Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3448         Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3449         Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3450         Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3451         // load submodels before leafs because they contain the number of vis leafs
3452         Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3453         Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3454         Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3455         Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3456
3457         // check if the map supports transparent water rendering
3458         loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3459
3460         if (mod->brushq1.data_compressedpvs)
3461                 Mem_Free(mod->brushq1.data_compressedpvs);
3462         mod->brushq1.data_compressedpvs = NULL;
3463         mod->brushq1.num_compressedpvs = 0;
3464
3465         Mod_Q1BSP_MakeHull0();
3466         Mod_Q1BSP_MakePortals();
3467
3468         mod->numframes = 2;             // regular and alternate animation
3469         mod->numskins = 1;
3470
3471         mainmempool = mod->mempool;
3472
3473         // make a single combined shadow mesh to allow optimized shadow volume creation
3474         numshadowmeshtriangles = 0;
3475         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3476         {
3477                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3478                 numshadowmeshtriangles += surface->num_triangles;
3479         }
3480         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3481         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3482                 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));
3483         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3484         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3485
3486         if (loadmodel->brush.numsubmodels)
3487                 loadmodel->brush.submodels = (model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(model_t *));
3488
3489         // LordHavoc: to clear the fog around the original quake submodel code, I
3490         // will explain:
3491         // first of all, some background info on the submodels:
3492         // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3493         // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3494         // now the weird for loop itself:
3495         // the loop functions in an odd way, on each iteration it sets up the
3496         // current 'mod' model (which despite the confusing code IS the model of
3497         // the number i), at the end of the loop it duplicates the model to become
3498         // the next submodel, and loops back to set up the new submodel.
3499
3500         // LordHavoc: now the explanation of my sane way (which works identically):
3501         // set up the world model, then on each submodel copy from the world model
3502         // and set up the submodel with the respective model info.
3503         totalstylesurfaces = 0;
3504         totalstyles = 0;
3505         for (i = 0;i < mod->brush.numsubmodels;i++)
3506         {
3507                 memset(stylecounts, 0, sizeof(stylecounts));
3508                 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3509                 {
3510                         surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3511                         for (j = 0;j < MAXLIGHTMAPS;j++)
3512                                 stylecounts[surface->lightmapinfo->styles[j]]++;
3513                 }
3514                 for (k = 0;k < 255;k++)
3515                 {
3516                         totalstyles++;
3517                         if (stylecounts[k])
3518                                 totalstylesurfaces += stylecounts[k];
3519                 }
3520         }
3521         datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3522         for (i = 0;i < mod->brush.numsubmodels;i++)
3523         {
3524                 // LordHavoc: this code was originally at the end of this loop, but
3525                 // has been transformed to something more readable at the start here.
3526
3527                 if (i > 0)
3528                 {
3529                         char name[10];
3530                         // LordHavoc: only register submodels if it is the world
3531                         // (prevents external bsp models from replacing world submodels with
3532                         //  their own)
3533                         if (!loadmodel->isworldmodel)
3534                                 continue;
3535                         // duplicate the basic information
3536                         sprintf(name, "*%i", i);
3537                         mod = Mod_FindName(name);
3538                         // copy the base model to this one
3539                         *mod = *loadmodel;
3540                         // rename the clone back to its proper name
3541                         strlcpy(mod->name, name, sizeof(mod->name));
3542                         // textures and memory belong to the main model
3543                         mod->texturepool = NULL;
3544                         mod->mempool = NULL;
3545                 }
3546
3547                 mod->brush.submodel = i;
3548
3549                 if (loadmodel->brush.submodels)
3550                         loadmodel->brush.submodels[i] = mod;
3551
3552                 bm = &mod->brushq1.submodels[i];
3553
3554                 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3555                 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3556                 {
3557                         mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3558                         mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3559                 }
3560
3561                 mod->firstmodelsurface = bm->firstface;
3562                 mod->nummodelsurfaces = bm->numfaces;
3563
3564                 // make the model surface list (used by shadowing/lighting)
3565                 mod->surfacelist = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3566                 for (j = 0;j < mod->nummodelsurfaces;j++)
3567                         mod->surfacelist[j] = mod->firstmodelsurface + j;
3568
3569                 // this gets altered below if sky or water is used
3570                 mod->DrawSky = NULL;
3571                 mod->DrawAddWaterPlanes = NULL;
3572                 mod->Draw = R_Q1BSP_Draw;
3573                 mod->DrawDepth = R_Q1BSP_DrawDepth;
3574                 mod->DrawDebug = R_Q1BSP_DrawDebug;
3575                 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3576                 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3577                 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3578                 mod->DrawLight = R_Q1BSP_DrawLight;
3579                 if (i != 0)
3580                 {
3581                         mod->brush.TraceLineOfSight = NULL;
3582                         mod->brush.GetPVS = NULL;
3583                         mod->brush.FatPVS = NULL;
3584                         mod->brush.BoxTouchingPVS = NULL;
3585                         mod->brush.BoxTouchingLeafPVS = NULL;
3586                         mod->brush.BoxTouchingVisibleLeafs = NULL;
3587                         mod->brush.FindBoxClusters = NULL;
3588                         mod->brush.LightPoint = NULL;
3589                         mod->brush.AmbientSoundLevelsForPoint = NULL;
3590                 }
3591                 if (mod->nummodelsurfaces)
3592                 {
3593                         // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3594                         mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3595                         mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3596                         modelyawradius = 0;
3597                         modelradius = 0;
3598                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3599                         {
3600                                 // we only need to have a drawsky function if it is used(usually only on world model)
3601                                 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3602                                         mod->DrawSky = R_Q1BSP_DrawSky;
3603                                 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3604                                         mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3605                                 // calculate bounding shapes
3606                                 for (k = 0, vec = (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex);k < surface->num_vertices;k++, vec += 3)
3607                                 {
3608                                         if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3609                                         if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3610                                         if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3611                                         if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3612                                         if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3613                                         if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3614                                         dist = vec[0]*vec[0]+vec[1]*vec[1];
3615                                         if (modelyawradius < dist)
3616                                                 modelyawradius = dist;
3617                                         dist += vec[2]*vec[2];
3618                                         if (modelradius < dist)
3619                                                 modelradius = dist;
3620                                 }
3621                         }
3622                         modelyawradius = sqrt(modelyawradius);
3623                         modelradius = sqrt(modelradius);
3624                         mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3625                         mod->yawmins[2] = mod->normalmins[2];
3626                         mod->yawmaxs[2] = mod->normalmaxs[2];
3627                         mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3628                         mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3629                         mod->radius = modelradius;
3630                         mod->radius2 = modelradius * modelradius;
3631
3632                         // build lightstyle update chains
3633                         // (used to rapidly mark surface->cached_dlight on many surfaces
3634                         // when d_lightstylevalue changes)
3635                         memset(stylecounts, 0, sizeof(stylecounts));
3636                         for (k = 0;k < mod->nummodelsurfaces;k++)
3637                         {
3638                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3639                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3640                                         stylecounts[surface->lightmapinfo->styles[j]]++;
3641                         }
3642                         mod->brushq1.num_lightstyles = 0;
3643                         for (k = 0;k < 255;k++)
3644                         {
3645                                 if (stylecounts[k])
3646                                 {
3647                                         styleinfo[mod->brushq1.num_lightstyles].style = k;
3648                                         styleinfo[mod->brushq1.num_lightstyles].value = 0;
3649                                         styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3650                                         styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3651                                         remapstyles[k] = mod->brushq1.num_lightstyles;
3652                                         mod->brushq1.num_lightstyles++;
3653                                 }
3654                         }
3655                         for (k = 0;k < mod->nummodelsurfaces;k++)
3656                         {
3657                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3658                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3659                                 {
3660                                         if (surface->lightmapinfo->styles[j] != 255)
3661                                         {
3662                                                 int r = remapstyles[surface->lightmapinfo->styles[j]];
3663                                                 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3664                                         }
3665                                 }
3666                         }
3667                         mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3668                         memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3669                 }
3670                 else
3671                 {
3672                         // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3673                         Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3674                 }
3675                 //mod->brushq1.num_visleafs = bm->visleafs;
3676         }
3677
3678         Mod_Q1BSP_LoadMapBrushes();
3679
3680         //Mod_Q1BSP_ProcessLightList();
3681
3682         if (developer.integer >= 10)
3683                 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);
3684 }
3685
3686 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3687 {
3688 }
3689
3690 static void Mod_Q2BSP_LoadPlanes(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_LoadPlanes: 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_LoadVertices(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_LoadVertices: 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_LoadVisibility(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_LoadVisibility: 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_LoadNodes(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_LoadNodes: 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_LoadTexInfo(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_LoadTexInfo: 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_LoadFaces(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_LoadFaces: 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_LoadLighting(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_LoadLighting: 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_LoadLeafs(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_LoadLeafs: 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_LoadLeafFaces(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_LoadLeafFaces: 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_LoadLeafBrushes(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_LoadLeafBrushes: 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_LoadEdges(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_LoadEdges: 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_LoadSurfEdges(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_LoadSurfEdges: 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_LoadBrushes(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_LoadBrushes: 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_LoadBrushSides(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_LoadBrushSides: 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_LoadAreas(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_LoadAreas: 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_LoadAreaPortals(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_LoadAreaPortals: 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 static void Mod_Q2BSP_LoadModels(lump_t *l)
4043 {
4044 /*
4045         d_t *in;
4046         m_t *out;
4047         int i, count;
4048
4049         in = (void *)(mod_base + l->fileofs);
4050         if (l->filelen % sizeof(*in))
4051                 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4052         count = l->filelen / sizeof(*in);
4053         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4054
4055         loadmodel-> = out;
4056         loadmodel->num = count;
4057
4058         for (i = 0;i < count;i++, in++, out++)
4059         {
4060         }
4061 */
4062 }
4063
4064 void static Mod_Q2BSP_Load(model_t *mod, void *buffer, void *bufferend)
4065 {
4066         int i;
4067         q2dheader_t *header;
4068
4069         Host_Error("Mod_Q2BSP_Load: not yet implemented");
4070
4071         mod->modeldatatypestring = "Q2BSP";
4072
4073         mod->type = mod_brushq2;
4074
4075         header = (q2dheader_t *)buffer;
4076
4077         i = LittleLong(header->version);
4078         if (i != Q2BSPVERSION)
4079                 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4080         mod->brush.ishlbsp = false;
4081         if (loadmodel->isworldmodel)
4082                 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
4083
4084         mod_base = (unsigned char *)header;
4085
4086         // swap all the lumps
4087         for (i = 0;i < (int) sizeof(*header) / 4;i++)
4088                 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4089
4090         mod->brush.qw_md4sum = 0;
4091         mod->brush.qw_md4sum2 = 0;
4092         for (i = 0;i < Q2HEADER_LUMPS;i++)
4093         {
4094                 if (i == Q2LUMP_ENTITIES)
4095                         continue;
4096                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4097                 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4098                         continue;
4099                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4100         }
4101
4102         Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4103         Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4104         Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4105         Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4106         Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4107         Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4108         Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4109         Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4110         Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4111         Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4112         Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4113         Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4114         Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4115         Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4116         Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4117         Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4118         Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4119         // LordHavoc: must go last because this makes the submodels
4120         Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4121 }
4122
4123 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents);
4124 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents);
4125
4126 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4127 {
4128         const char *data;
4129         char key[128], value[MAX_INPUTLINE];
4130         float v[3];
4131         loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4132         loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4133         loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4134         if (!l->filelen)
4135                 return;
4136         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
4137         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4138         data = loadmodel->brush.entities;
4139         // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4140         if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4141         {
4142                 while (1)
4143                 {
4144                         if (!COM_ParseToken_Simple(&data, false, false))
4145                                 break; // error
4146                         if (com_token[0] == '}')
4147                                 break; // end of worldspawn
4148                         if (com_token[0] == '_')
4149                                 strlcpy(key, com_token + 1, sizeof(key));
4150                         else
4151                                 strlcpy(key, com_token, sizeof(key));
4152                         while (key[strlen(key)-1] == ' ') // remove trailing spaces
4153                                 key[strlen(key)-1] = 0;
4154                         if (!COM_ParseToken_Simple(&data, false, false))
4155                                 break; // error
4156                         strlcpy(value, com_token, sizeof(value));
4157                         if (!strcmp("gridsize", key))
4158                         {
4159                                 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4160                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4161                         }
4162                 }
4163         }
4164 }
4165
4166 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4167 {
4168         q3dtexture_t *in;
4169         texture_t *out;
4170         int i, count;
4171
4172         in = (q3dtexture_t *)(mod_base + l->fileofs);
4173         if (l->filelen % sizeof(*in))
4174                 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4175         count = l->filelen / sizeof(*in);
4176         out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4177
4178         loadmodel->data_textures = out;
4179         loadmodel->num_textures = count;
4180         loadmodel->num_texturesperskin = loadmodel->num_textures;
4181
4182         for (i = 0;i < count;i++)
4183         {
4184                 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4185                 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4186                 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4187         }
4188
4189         if (cls.state == ca_dedicated)
4190                 return;
4191
4192         for (i = 0;i < count;i++, in++, out++)
4193                 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4194 }
4195
4196 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4197 {
4198         q3dplane_t *in;
4199         mplane_t *out;
4200         int i, count;
4201
4202         in = (q3dplane_t *)(mod_base + l->fileofs);
4203         if (l->filelen % sizeof(*in))
4204                 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4205         count = l->filelen / sizeof(*in);
4206         out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4207
4208         loadmodel->brush.data_planes = out;
4209         loadmodel->brush.num_planes = count;
4210
4211         for (i = 0;i < count;i++, in++, out++)
4212         {
4213                 out->normal[0] = LittleFloat(in->normal[0]);
4214                 out->normal[1] = LittleFloat(in->normal[1]);
4215                 out->normal[2] = LittleFloat(in->normal[2]);
4216                 out->dist = LittleFloat(in->dist);
4217                 PlaneClassify(out);
4218         }
4219 }
4220
4221 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4222 {
4223         q3dbrushside_t *in;
4224         q3mbrushside_t *out;
4225         int i, n, count;
4226
4227         in = (q3dbrushside_t *)(mod_base + l->fileofs);
4228         if (l->filelen % sizeof(*in))
4229                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4230         count = l->filelen / sizeof(*in);
4231         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4232
4233         loadmodel->brush.data_brushsides = out;
4234         loadmodel->brush.num_brushsides = count;
4235
4236         for (i = 0;i < count;i++, in++, out++)
4237         {
4238                 n = LittleLong(in->planeindex);
4239                 if (n < 0 || n >= loadmodel->brush.num_planes)
4240                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4241                 out->plane = loadmodel->brush.data_planes + n;
4242                 n = LittleLong(in->textureindex);
4243                 if (n < 0 || n >= loadmodel->num_textures)
4244                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4245                 out->texture = loadmodel->data_textures + n;
4246         }
4247 }
4248
4249 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4250 {
4251         q3dbrush_t *in;
4252         q3mbrush_t *out;
4253         int i, j, n, c, count, maxplanes;
4254         colplanef_t *planes;
4255
4256         in = (q3dbrush_t *)(mod_base + l->fileofs);
4257         if (l->filelen % sizeof(*in))
4258                 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4259         count = l->filelen / sizeof(*in);
4260         out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4261
4262         loadmodel->brush.data_brushes = out;
4263         loadmodel->brush.num_brushes = count;
4264
4265         maxplanes = 0;
4266         planes = NULL;
4267
4268         for (i = 0;i < count;i++, in++, out++)
4269         {
4270                 n = LittleLong(in->firstbrushside);
4271                 c = LittleLong(in->numbrushsides);
4272                 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4273                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4274                 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4275                 out->numbrushsides = c;
4276                 n = LittleLong(in->textureindex);
4277                 if (n < 0 || n >= loadmodel->num_textures)
4278                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4279                 out->texture = loadmodel->data_textures + n;
4280
4281                 // make a list of mplane_t structs to construct a colbrush from
4282                 if (maxplanes < out->numbrushsides)
4283                 {
4284                         maxplanes = out->numbrushsides;
4285                         if (planes)
4286                                 Mem_Free(planes);
4287                         planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4288                 }
4289                 for (j = 0;j < out->numbrushsides;j++)
4290                 {
4291                         VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4292                         planes[j].dist = out->firstbrushside[j].plane->dist;
4293                         planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4294                         planes[j].texture = out->firstbrushside[j].texture;
4295                 }
4296                 // make the colbrush from the planes
4297                 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4298         }
4299         if (planes)
4300                 Mem_Free(planes);
4301 }
4302
4303 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4304 {
4305         q3deffect_t *in;
4306         q3deffect_t *out;
4307         int i, n, count;
4308
4309         in = (q3deffect_t *)(mod_base + l->fileofs);
4310         if (l->filelen % sizeof(*in))
4311                 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4312         count = l->filelen / sizeof(*in);
4313         out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4314
4315         loadmodel->brushq3.data_effects = out;
4316         loadmodel->brushq3.num_effects = count;
4317
4318         for (i = 0;i < count;i++, in++, out++)
4319         {
4320                 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4321                 n = LittleLong(in->brushindex);
4322                 if (n >= loadmodel->brush.num_brushes)
4323                 {
4324                         Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4325                         n = -1;
4326                 }
4327                 out->brushindex = n;
4328                 out->unknown = LittleLong(in->unknown);
4329         }
4330 }
4331
4332 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4333 {
4334         q3dvertex_t *in;
4335         int i, count;
4336
4337         in = (q3dvertex_t *)(mod_base + l->fileofs);
4338         if (l->filelen % sizeof(*in))
4339                 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4340         loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4341         loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4342         loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4343         loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4344         loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4345         loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4346
4347         for (i = 0;i < count;i++, in++)
4348         {
4349                 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4350                 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4351                 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4352                 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4353                 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4354                 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4355                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4356                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4357                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4358                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4359                 // svector/tvector are calculated later in face loading
4360                 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4361                 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4362                 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4363                 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4364         }
4365 }
4366
4367 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4368 {
4369         int *in;
4370         int *out;
4371         int i, count;
4372
4373         in = (int *)(mod_base + l->fileofs);
4374         if (l->filelen % sizeof(int[3]))
4375                 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4376         count = l->filelen / sizeof(*in);
4377         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4378
4379         loadmodel->brushq3.num_triangles = count / 3;
4380         loadmodel->brushq3.data_element3i = out;
4381
4382         for (i = 0;i < count;i++, in++, out++)
4383         {
4384                 *out = LittleLong(*in);
4385                 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4386                 {
4387                         Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4388                         *out = 0;
4389                 }
4390         }
4391 }
4392
4393 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4394 {
4395         q3dlightmap_t *in;
4396         int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4397         unsigned char *c;
4398         unsigned char convertedpixels[128*128*4];
4399
4400         if (!l->filelen)
4401                 return;
4402         if (cls.state == ca_dedicated)
4403                 return;
4404         in = (q3dlightmap_t *)(mod_base + l->fileofs);
4405         if (l->filelen % sizeof(*in))
4406                 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4407         count = l->filelen / sizeof(*in);
4408         loadmodel->brushq3.num_originallightmaps = count;
4409
4410         // now check the surfaces to see if any of them index an odd numbered
4411         // lightmap, if so this is not a deluxemapped bsp file
4412         //
4413         // also check what lightmaps are actually used, because q3map2 sometimes
4414         // (always?) makes an unused one at the end, which
4415         // q3map2 sometimes (or always?) makes a second blank lightmap for no
4416         // reason when only one lightmap is used, which can throw off the
4417         // deluxemapping detection method, so check 2-lightmap bsp's specifically
4418         // to see if the second lightmap is blank, if so it is not deluxemapped.
4419         loadmodel->brushq3.deluxemapping = !(count & 1);
4420         loadmodel->brushq3.deluxemapping_modelspace = true;
4421         endlightmap = 0;
4422         if (loadmodel->brushq3.deluxemapping)
4423         {
4424                 int facecount = faceslump->filelen / sizeof(q3dface_t);
4425                 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4426                 for (i = 0;i < facecount;i++)
4427                 {
4428                         j = LittleLong(faces[i].lightmapindex);
4429                         if (j >= 0)
4430                         {
4431                                 endlightmap = max(endlightmap, j + 1);
4432                                 if ((j & 1) || j + 1 >= count)
4433                                 {
4434                                         loadmodel->brushq3.deluxemapping = false;
4435                                         break;
4436                                 }
4437                         }
4438                 }
4439         }
4440
4441         // q3map2 sometimes (or always?) makes a second blank lightmap for no
4442         // reason when only one lightmap is used, which can throw off the
4443         // deluxemapping detection method, so check 2-lightmap bsp's specifically
4444         // to see if the second lightmap is blank, if so it is not deluxemapped.
4445         //
4446         // further research has shown q3map2 sometimes creates a deluxemap and two
4447         // blank lightmaps, which must be handled properly as well
4448         if (endlightmap == 1 && count > 1)
4449         {
4450                 c = in[1].rgb;
4451                 for (i = 0;i < 128*128*3;i++)
4452                         if (c[i])
4453                                 break;
4454                 if (i == 128*128*3)
4455                 {
4456                         // all pixels in the unused lightmap were black...
4457                         loadmodel->brushq3.deluxemapping = false;
4458                 }
4459         }
4460
4461         Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4462
4463         // figure out what the most reasonable merge power is within limits
4464         loadmodel->brushq3.num_lightmapmergepower = 0;
4465         for (power = 1;power <= mod_q3bsp_lightmapmergepower.integer && (128 << power) <= gl_max_texture_size && (1 << (power * 2)) < 4 * (count >> loadmodel->brushq3.deluxemapping);power++)
4466                 loadmodel->brushq3.num_lightmapmergepower = power;
4467         loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4468
4469         loadmodel->brushq3.num_mergedlightmaps = ((count >> loadmodel->brushq3.deluxemapping) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4470         loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4471         if (loadmodel->brushq3.deluxemapping)
4472                 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4473
4474         // allocate a texture pool if we need it
4475         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4476                 loadmodel->texturepool = R_AllocTexturePool();
4477
4478         power = loadmodel->brushq3.num_lightmapmergepower;
4479         power2 = power * 2;
4480         mask = (1 << power) - 1;
4481         for (i = 0;i < count;i++)
4482         {
4483                 // figure out which merged lightmap texture this fits into
4484                 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4485                 for (k = 0;k < 128*128;k++)
4486                 {
4487                         convertedpixels[k*4+2] = in[i].rgb[k*3+0];
4488                         convertedpixels[k*4+1] = in[i].rgb[k*3+1];
4489                         convertedpixels[k*4+0] = in[i].rgb[k*3+2];
4490                         convertedpixels[k*4+3] = 255;
4491                 }
4492                 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4493                 {
4494                         // if the lightmap has not been allocated yet, create it
4495                         if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4496                         {
4497                                 // create a lightmap only as large as necessary to hold the
4498                                 // remaining 128x128 blocks
4499                                 // if there are multiple merged lightmap textures then they will
4500                                 // all be full size except the last one which may be smaller
4501                                 // because it only needs to the remaining blocks, and it will often
4502                                 // be odd sizes like 2048x512 due to only being 25% full or so.
4503                                 j = (count >> loadmodel->brushq3.deluxemapping) - (lightmapindex << power2);
4504                                 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4505                                         ;
4506                                 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4507                                         ;
4508                                 if (developer_loading.integer)
4509                                         Con_Printf("lightmap merge texture #%i is %ix%i (%i of %i used)\n", lightmapindex, mergewidth*128, mergeheight*128, min(j, mergewidth*mergeheight), mergewidth*mergeheight);
4510                                 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);
4511                                 if (loadmodel->brushq3.data_deluxemaps)
4512                                         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);
4513                         }
4514                         mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / 128;
4515                         mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / 128;
4516                         j = (i >> loadmodel->brushq3.deluxemapping) & ((1 << power2) - 1);
4517                         if (loadmodel->brushq3.deluxemapping && (i & 1))
4518                                 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * 128, (j / mergewidth) * 128, 128, 128);
4519                         else
4520                                 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * 128, (j / mergewidth) * 128, 128, 128);
4521                 }
4522                 else
4523                 {
4524                         // figure out which merged lightmap texture this fits into
4525                         if (loadmodel->brushq3.deluxemapping && (i & 1))
4526                                 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);
4527                         else
4528                                 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);
4529                 }
4530         }
4531 }
4532
4533 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4534 {
4535         q3dface_t *in, *oldin;
4536         msurface_t *out, *oldout;
4537         int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, numvertices, numtriangles;
4538         float lightmaptcbase[2], lightmaptcscale[2];
4539         //int *originalelement3i;
4540         //int *originalneighbor3i;
4541         float *originalvertex3f;
4542         //float *originalsvector3f;
4543         //float *originaltvector3f;
4544         float *originalnormal3f;
4545         float *originalcolor4f;
4546         float *originaltexcoordtexture2f;
4547         float *originaltexcoordlightmap2f;
4548         float *v;
4549
4550         in = (q3dface_t *)(mod_base + l->fileofs);
4551         if (l->filelen % sizeof(*in))
4552                 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4553         count = l->filelen / sizeof(*in);
4554         out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4555
4556         loadmodel->data_surfaces = out;
4557         loadmodel->num_surfaces = count;
4558
4559         i = 0;
4560         oldi = i;
4561         oldin = in;
4562         oldout = out;
4563         meshvertices = 0;
4564         meshtriangles = 0;
4565         for (;i < count;i++, in++, out++)
4566         {
4567                 // check face type first
4568                 type = LittleLong(in->type);
4569                 if (type != Q3FACETYPE_POLYGON
4570                  && type != Q3FACETYPE_PATCH
4571                  && type != Q3FACETYPE_MESH
4572                  && type != Q3FACETYPE_FLARE)
4573                 {
4574                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4575                         continue;
4576                 }
4577
4578                 n = LittleLong(in->textureindex);
4579                 if (n < 0 || n >= loadmodel->num_textures)
4580                 {
4581                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4582                         continue;
4583                 }
4584                 out->texture = loadmodel->data_textures + n;
4585                 n = LittleLong(in->effectindex);
4586                 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4587                 {
4588                         if (developer.integer >= 100)
4589                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4590                         n = -1;
4591                 }
4592                 if (n == -1)
4593                         out->effect = NULL;
4594                 else
4595                         out->effect = loadmodel->brushq3.data_effects + n;
4596
4597                 if (cls.state != ca_dedicated)
4598                 {
4599                         out->lightmaptexture = NULL;
4600                         out->deluxemaptexture = r_texture_blanknormalmap;
4601                         n = LittleLong(in->lightmapindex);
4602                         if (n < 0)
4603                                 n = -1;
4604                         else if (n >= loadmodel->brushq3.num_originallightmaps)
4605                         {
4606                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4607                                 n = -1;
4608                         }
4609                         else
4610                         {
4611                                 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4612                                 if (loadmodel->brushq3.deluxemapping)
4613                                         out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4614                         }
4615                 }
4616
4617                 firstvertex = LittleLong(in->firstvertex);
4618                 numvertices = LittleLong(in->numvertices);
4619                 firstelement = LittleLong(in->firstelement);
4620                 numtriangles = LittleLong(in->numelements) / 3;
4621                 if (numtriangles * 3 != LittleLong(in->numelements))
4622                 {
4623                         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));
4624                         continue;
4625                 }
4626                 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4627                 {
4628                         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);
4629                         continue;
4630                 }
4631                 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4632                 {
4633                         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);
4634                         continue;
4635                 }
4636                 switch(type)
4637                 {
4638                 case Q3FACETYPE_POLYGON:
4639                 case Q3FACETYPE_MESH:
4640                         // no processing necessary
4641                         break;
4642                 case Q3FACETYPE_PATCH:
4643                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4644                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4645                         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))
4646                         {
4647                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4648                                 continue;
4649                         }
4650                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4651                         // convert patch to Q3FACETYPE_MESH
4652                         xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4653                         ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4654                         // bound to user settings
4655                         xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4656                         ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4657                         // bound to sanity settings
4658                         xtess = bound(1, xtess, 1024);
4659                         ytess = bound(1, ytess, 1024);
4660                         // bound to user limit on vertices
4661                         while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4662                         {
4663                                 if (xtess > ytess)
4664                                         xtess--;
4665                                 else
4666                                         ytess--;
4667                         }
4668                         finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4669                         finalheight = ((patchsize[1] - 1) * ytess) + 1;
4670                         numvertices = finalwidth * finalheight;
4671                         numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4672                         break;
4673                 case Q3FACETYPE_FLARE:
4674                         if (developer.integer >= 100)
4675                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4676                         // don't render it
4677                         continue;
4678                 }
4679                 out->num_vertices = numvertices;
4680                 out->num_triangles = numtriangles;
4681                 meshvertices += out->num_vertices;
4682                 meshtriangles += out->num_triangles;
4683         }
4684
4685         i = oldi;
4686         in = oldin;
4687         out = oldout;
4688         Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4689         meshvertices = 0;
4690         meshtriangles = 0;
4691         for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
4692         {
4693                 if (out->num_vertices < 3 || out->num_triangles < 1)
4694                         continue;
4695
4696                 type = LittleLong(in->type);
4697                 firstvertex = LittleLong(in->firstvertex);
4698                 firstelement = LittleLong(in->firstelement);
4699                 out->num_firstvertex = meshvertices;
4700                 out->num_firsttriangle = meshtriangles;
4701                 switch(type)
4702                 {
4703                 case Q3FACETYPE_POLYGON:
4704                 case Q3FACETYPE_MESH:
4705                         // no processing necessary, except for lightmap merging
4706                         for (j = 0;j < out->num_vertices;j++)
4707                         {
4708                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4709                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4710                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4711                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
4712                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
4713                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
4714                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4715                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4716                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4717                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4718                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4719                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4720                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4721                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4722                         }
4723                         for (j = 0;j < out->num_triangles*3;j++)
4724                                 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
4725                         break;
4726                 case Q3FACETYPE_PATCH:
4727                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4728                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4729                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4730                         originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
4731                         originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4732                         originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4733                         originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4734                         // convert patch to Q3FACETYPE_MESH
4735                         xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4736                         ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4737                         // bound to user settings
4738                         xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4739                         ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4740                         // bound to sanity settings
4741                         xtess = bound(1, xtess, 1024);
4742                         ytess = bound(1, ytess, 1024);
4743                         // bound to user limit on vertices
4744                         while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4745                         {
4746                                 if (xtess > ytess)
4747                                         xtess--;
4748                                 else
4749                                         ytess--;
4750                         }
4751                         finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4752                         finalheight = ((patchsize[1] - 1) * ytess) + 1;
4753                         finalvertices = finalwidth * finalheight;
4754                         finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4755                         type = Q3FACETYPE_MESH;
4756                         // generate geometry
4757                         // (note: normals are skipped because they get recalculated)
4758                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4759                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
4760                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
4761                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
4762                         Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
4763                         Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
4764                         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);
4765                         if (developer.integer >= 100)
4766                         {
4767                                 if (out->num_triangles < finaltriangles)
4768                                         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);
4769                                 else
4770                                         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);
4771                         }
4772                         // q3map does not put in collision brushes for curves... ugh
4773                         // build the lower quality collision geometry
4774                         xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4775                         ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4776                         // bound to user settings
4777                         xtess = bound(r_subdivisions_collision_mintess.integer, xtess, r_subdivisions_collision_maxtess.integer);
4778                         ytess = bound(r_subdivisions_collision_mintess.integer, ytess, r_subdivisions_collision_maxtess.integer);
4779                         // bound to sanity settings
4780                         xtess = bound(1, xtess, 1024);
4781                         ytess = bound(1, ytess, 1024);
4782                         // bound to user limit on vertices
4783                         while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4784                         {
4785                                 if (xtess > ytess)
4786                                         xtess--;
4787                                 else
4788                                         ytess--;
4789                         }
4790                         finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4791                         finalheight = ((patchsize[1] - 1) * ytess) + 1;
4792                         finalvertices = finalwidth * finalheight;
4793                         finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4794
4795                         out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4796                         out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4797                         out->num_collisionvertices = finalvertices;
4798                         out->num_collisiontriangles = finaltriangles;
4799                         Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4800                         Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
4801
4802                         //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
4803                         Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
4804
4805                         oldnumtriangles = out->num_triangles;
4806                         oldnumtriangles2 = out->num_collisiontriangles;
4807                         out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
4808                         if (developer.integer >= 100)
4809                                 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);
4810                         break;
4811                 default:
4812                         break;
4813                 }
4814                 meshvertices += out->num_vertices;
4815                 meshtriangles += out->num_triangles;
4816                 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
4817                         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)
4818                                 invalidelements++;
4819                 if (invalidelements)
4820                 {
4821                         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);
4822                         for (j = 0;j < out->num_triangles * 3;j++)
4823                         {
4824                                 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
4825                                 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)
4826                                         (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
4827                         }
4828                         Con_Print("\n");
4829                 }
4830                 // calculate a bounding box
4831                 VectorClear(out->mins);
4832                 VectorClear(out->maxs);
4833                 if (out->num_vertices)
4834                 {
4835                         if (cls.state != ca_dedicated && out->lightmaptexture)
4836                         {
4837                                 // figure out which part of the merged lightmap this fits into
4838                                 int lightmapindex = LittleLong(in->lightmapindex) >> loadmodel->brushq3.deluxemapping;
4839                                 int mergewidth = R_TextureWidth(out->lightmaptexture) / 128;
4840                                 int mergeheight = R_TextureHeight(out->lightmaptexture) / 128;
4841                                 lightmapindex &= mergewidth * mergeheight - 1;
4842                                 lightmaptcscale[0] = 1.0f / mergewidth;
4843                                 lightmaptcscale[1] = 1.0f / mergeheight;
4844                                 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
4845                                 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
4846                                 // modify the lightmap texcoords to match this region of the merged lightmap
4847                                 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
4848                                 {
4849                                         v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
4850                                         v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
4851                                 }
4852                         }
4853                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
4854                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
4855                         for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
4856                         {
4857                                 out->mins[0] = min(out->mins[0], v[0]);
4858                                 out->maxs[0] = max(out->maxs[0], v[0]);
4859                                 out->mins[1] = min(out->mins[1], v[1]);
4860                                 out->maxs[1] = max(out->maxs[1], v[1]);
4861                                 out->mins[2] = min(out->mins[2], v[2]);
4862                                 out->maxs[2] = max(out->maxs[2], v[2]);
4863                         }
4864                         out->mins[0] -= 1.0f;
4865                         out->mins[1] -= 1.0f;
4866                         out->mins[2] -= 1.0f;
4867                         out->maxs[0] += 1.0f;
4868                         out->maxs[1] += 1.0f;
4869                         out->maxs[2] += 1.0f;
4870                 }
4871                 // set lightmap styles for consistency with q1bsp
4872                 //out->lightmapinfo->styles[0] = 0;
4873                 //out->lightmapinfo->styles[1] = 255;
4874                 //out->lightmapinfo->styles[2] = 255;
4875                 //out->lightmapinfo->styles[3] = 255;
4876         }
4877
4878         // for per pixel lighting
4879         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);
4880
4881         // free the no longer needed vertex data
4882         loadmodel->brushq3.num_vertices = 0;
4883         if (loadmodel->brushq3.data_vertex3f)
4884                 Mem_Free(loadmodel->brushq3.data_vertex3f);
4885         loadmodel->brushq3.data_vertex3f = NULL;
4886         loadmodel->brushq3.data_normal3f = NULL;
4887         loadmodel->brushq3.data_texcoordtexture2f = NULL;
4888         loadmodel->brushq3.data_texcoordlightmap2f = NULL;
4889         loadmodel->brushq3.data_color4f = NULL;
4890         // free the no longer needed triangle data
4891         loadmodel->brushq3.num_triangles = 0;
4892         if (loadmodel->brushq3.data_element3i)
4893                 Mem_Free(loadmodel->brushq3.data_element3i);
4894         loadmodel->brushq3.data_element3i = NULL;
4895 }
4896
4897 static void Mod_Q3BSP_LoadModels(lump_t *l)
4898 {
4899         q3dmodel_t *in;
4900         q3dmodel_t *out;
4901         int i, j, n, c, count;
4902
4903         in = (q3dmodel_t *)(mod_base + l->fileofs);
4904         if (l->filelen % sizeof(*in))
4905                 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4906         count = l->filelen / sizeof(*in);
4907         out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4908
4909         loadmodel->brushq3.data_models = out;
4910         loadmodel->brushq3.num_models = count;
4911
4912         for (i = 0;i < count;i++, in++, out++)
4913         {
4914                 for (j = 0;j < 3;j++)
4915                 {
4916                         out->mins[j] = LittleFloat(in->mins[j]);
4917                         out->maxs[j] = LittleFloat(in->maxs[j]);
4918                 }
4919                 n = LittleLong(in->firstface);
4920                 c = LittleLong(in->numfaces);
4921                 if (n < 0 || n + c > loadmodel->num_surfaces)
4922                         Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
4923                 out->firstface = n;
4924                 out->numfaces = c;
4925                 n = LittleLong(in->firstbrush);
4926                 c = LittleLong(in->numbrushes);
4927                 if (n < 0 || n + c > loadmodel->brush.num_brushes)
4928                         Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
4929                 out->firstbrush = n;
4930                 out->numbrushes = c;
4931         }
4932 }
4933
4934 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
4935 {
4936         int *in;
4937         int *out;
4938         int i, n, count;
4939
4940         in = (int *)(mod_base + l->fileofs);
4941         if (l->filelen % sizeof(*in))
4942                 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4943         count = l->filelen / sizeof(*in);
4944         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4945
4946         loadmodel->brush.data_leafbrushes = out;
4947         loadmodel->brush.num_leafbrushes = count;
4948
4949         for (i = 0;i < count;i++, in++, out++)
4950         {
4951                 n = LittleLong(*in);
4952                 if (n < 0 || n >= loadmodel->brush.num_brushes)
4953                         Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
4954                 *out = n;
4955         }
4956 }
4957
4958 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
4959 {
4960         int *in;
4961         int *out;
4962         int i, n, count;
4963
4964         in = (int *)(mod_base + l->fileofs);
4965         if (l->filelen % sizeof(*in))
4966                 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4967         count = l->filelen / sizeof(*in);
4968         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4969
4970         loadmodel->brush.data_leafsurfaces = out;
4971         loadmodel->brush.num_leafsurfaces = count;
4972
4973         for (i = 0;i < count;i++, in++, out++)
4974         {
4975                 n = LittleLong(*in);
4976                 if (n < 0 || n >= loadmodel->num_surfaces)
4977                         Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
4978                 *out = n;
4979         }
4980 }
4981
4982 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
4983 {
4984         q3dleaf_t *in;
4985         mleaf_t *out;
4986         int i, j, n, c, count;
4987
4988         in = (q3dleaf_t *)(mod_base + l->fileofs);
4989         if (l->filelen % sizeof(*in))
4990                 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4991         count = l->filelen / sizeof(*in);
4992         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4993
4994         loadmodel->brush.data_leafs = out;
4995         loadmodel->brush.num_leafs = count;
4996
4997         for (i = 0;i < count;i++, in++, out++)
4998         {
4999                 out->parent = NULL;
5000                 out->plane = NULL;
5001                 out->clusterindex = LittleLong(in->clusterindex);
5002                 out->areaindex = LittleLong(in->areaindex);
5003                 for (j = 0;j < 3;j++)
5004                 {
5005                         // yes the mins/maxs are ints
5006                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5007                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5008                 }
5009                 n = LittleLong(in->firstleafface);
5010                 c = LittleLong(in->numleaffaces);
5011                 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5012                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5013                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5014                 out->numleafsurfaces = c;
5015                 n = LittleLong(in->firstleafbrush);
5016                 c = LittleLong(in->numleafbrushes);
5017                 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5018                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5019                 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5020                 out->numleafbrushes = c;
5021         }
5022 }
5023
5024 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5025 {
5026         q3dnode_t *in;
5027         mnode_t *out;
5028         int i, j, n, count;
5029
5030         in = (q3dnode_t *)(mod_base + l->fileofs);
5031         if (l->filelen % sizeof(*in))
5032                 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5033         count = l->filelen / sizeof(*in);
5034         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5035
5036         loadmodel->brush.data_nodes = out;
5037         loadmodel->brush.num_nodes = count;
5038
5039         for (i = 0;i < count;i++, in++, out++)
5040         {
5041                 out->parent = NULL;
5042                 n = LittleLong(in->planeindex);
5043                 if (n < 0 || n >= loadmodel->brush.num_planes)
5044                         Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5045                 out->plane = loadmodel->brush.data_planes + n;
5046                 for (j = 0;j < 2;j++)
5047                 {
5048                         n = LittleLong(in->childrenindex[j]);
5049                         if (n >= 0)
5050                         {
5051                                 if (n >= loadmodel->brush.num_nodes)
5052                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5053                                 out->children[j] = loadmodel->brush.data_nodes + n;
5054                         }
5055                         else
5056                         {
5057                                 n = -1 - n;
5058                                 if (n >= loadmodel->brush.num_leafs)
5059                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5060                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5061                         }
5062                 }
5063                 for (j = 0;j < 3;j++)
5064                 {
5065                         // yes the mins/maxs are ints
5066                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5067                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5068                 }
5069         }
5070
5071         // set the parent pointers
5072         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5073 }
5074
5075 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5076 {
5077         q3dlightgrid_t *in;
5078         q3dlightgrid_t *out;
5079         int count;
5080
5081         in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5082         if (l->filelen % sizeof(*in))
5083                 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5084         loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5085         loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5086         loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5087         loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5088         loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5089         loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5090         loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5091         loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5092         loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5093         loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5094         loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5095         loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5096         count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5097         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]);
5098         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]);
5099
5100         // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5101         if (l->filelen)
5102         {
5103                 if (l->filelen < count * (int)sizeof(*in))
5104                         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]);
5105                 if (l->filelen != count * (int)sizeof(*in))
5106                         Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5107                 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5108                 loadmodel->brushq3.data_lightgrid = out;
5109                 loadmodel->brushq3.num_lightgrid = count;
5110                 // no swapping or validation necessary
5111                 memcpy(out, in, count * (int)sizeof(*out));
5112         }
5113 }
5114
5115 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5116 {
5117         q3dpvs_t *in;
5118         int totalchains;
5119
5120         if (l->filelen == 0)
5121         {
5122                 int i;
5123                 // unvised maps often have cluster indices even without pvs, so check
5124                 // leafs to find real number of clusters
5125                 loadmodel->brush.num_pvsclusters = 1;
5126                 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5127                         loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5128
5129                 // create clusters
5130                 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5131                 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5132                 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5133                 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5134                 return;
5135         }
5136
5137         in = (q3dpvs_t *)(mod_base + l->fileofs);
5138         if (l->filelen < 9)
5139                 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5140
5141         loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5142         loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5143         if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5144                 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5145         totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5146         if (l->filelen < totalchains + (int)sizeof(*in))
5147                 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);
5148
5149         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5150         memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5151 }
5152
5153 static void Mod_Q3BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5154 {
5155         int i, j, k, index[3];
5156         float transformed[3], blend1, blend2, blend, stylescale;
5157         q3dlightgrid_t *a, *s;
5158
5159         // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5160         stylescale = r_refdef.scene.rtlightstylevalue[0];
5161
5162         if (!model->brushq3.num_lightgrid)
5163         {
5164                 ambientcolor[0] = stylescale;
5165                 ambientcolor[1] = stylescale;
5166                 ambientcolor[2] = stylescale;
5167                 return;
5168         }
5169
5170         Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5171         //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5172         //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5173         transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5174         transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5175         transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5176         index[0] = (int)floor(transformed[0]);
5177         index[1] = (int)floor(transformed[1]);
5178         index[2] = (int)floor(transformed[2]);
5179         //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5180
5181         // now lerp the values
5182         VectorClear(diffusenormal);
5183         a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5184         for (k = 0;k < 2;k++)
5185         {
5186                 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5187                 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5188                         continue;
5189                 for (j = 0;j < 2;j++)
5190                 {
5191                         blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5192                         if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5193                                 continue;
5194                         for (i = 0;i < 2;i++)
5195                         {
5196                                 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5197                                 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5198                                         continue;
5199                                 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5200                                 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5201                                 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5202                                 // this uses the mod_md3_sin table because the values are
5203                                 // already in the 0-255 range, the 64+ bias fetches a cosine
5204                                 // instead of a sine value
5205                                 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5206                                 diffusenormal[1] += blend * (mod_md3_sin[     s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5207                                 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5208                                 //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)));
5209                         }
5210                 }
5211         }
5212
5213         // normalize the light direction before turning
5214         VectorNormalize(diffusenormal);
5215         //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]);
5216 }
5217
5218 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const vec3_t point, int markframe)
5219 {
5220         int i;
5221         mleaf_t *leaf;
5222         colbrushf_t *brush;
5223         // find which leaf the point is in
5224         while (node->plane)
5225                 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5226         // point trace the brushes
5227         leaf = (mleaf_t *)node;
5228         for (i = 0;i < leaf->numleafbrushes;i++)
5229         {
5230                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5231                 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5232                 {
5233                         brush->markframe = markframe;
5234                         Collision_TracePointBrushFloat(trace, point, brush);
5235                 }
5236         }
5237         // can't do point traces on curves (they have no thickness)
5238 }
5239
5240 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)
5241 {
5242         int i, startside, endside;
5243         float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5244         mleaf_t *leaf;
5245         msurface_t *surface;
5246         mplane_t *plane;
5247         colbrushf_t *brush;
5248         // walk the tree until we hit a leaf, recursing for any split cases
5249         while (node->plane)
5250         {
5251                 // abort if this part of the bsp tree can not be hit by this trace
5252 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5253 //                      return;
5254                 plane = node->plane;
5255                 // axial planes are much more common than non-axial, so an optimized
5256                 // axial case pays off here
5257                 if (plane->type < 3)
5258                 {
5259                         dist1 = start[plane->type] - plane->dist;
5260                         dist2 = end[plane->type] - plane->dist;
5261                 }
5262                 else
5263                 {
5264                         dist1 = DotProduct(start, plane->normal) - plane->dist;
5265                         dist2 = DotProduct(end, plane->normal) - plane->dist;
5266                 }
5267                 startside = dist1 < 0;
5268                 endside = dist2 < 0;
5269                 if (startside == endside)
5270                 {
5271                         // most of the time the line fragment is on one side of the plane
5272                         node = node->children[startside];
5273                 }
5274                 else
5275                 {
5276                         // line crosses node plane, split the line
5277                         dist1 = PlaneDiff(linestart, plane);
5278                         dist2 = PlaneDiff(lineend, plane);
5279                         midfrac = dist1 / (dist1 - dist2);
5280                         VectorLerp(linestart, midfrac, lineend, mid);
5281                         // take the near side first
5282                         Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5283                         // if we found an impact on the front side, don't waste time
5284                         // exploring the far side
5285                         if (midfrac <= trace->realfraction)
5286                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5287                         return;
5288                 }
5289         }
5290         // abort if this part of the bsp tree can not be hit by this trace
5291 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5292 //              return;
5293         // hit a leaf
5294         nodesegmentmins[0] = min(start[0], end[0]) - 1;
5295         nodesegmentmins[1] = min(start[1], end[1]) - 1;
5296         nodesegmentmins[2] = min(start[2], end[2]) - 1;
5297         nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5298         nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5299         nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5300         // line trace the brushes
5301         leaf = (mleaf_t *)node;
5302         for (i = 0;i < leaf->numleafbrushes;i++)
5303         {
5304                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5305                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5306                 {
5307                         brush->markframe = markframe;
5308                         Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5309                 }
5310         }
5311         // can't do point traces on curves (they have no thickness)
5312         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5313         {
5314                 // line trace the curves
5315                 for (i = 0;i < leaf->numleafsurfaces;i++)
5316                 {
5317                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5318                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5319                         {
5320                                 surface->collisionmarkframe = markframe;
5321                                 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5322                         }
5323                 }
5324         }
5325 }
5326
5327 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)
5328 {
5329         int i;
5330         int sides;
5331         mleaf_t *leaf;
5332         colbrushf_t *brush;
5333         msurface_t *surface;
5334         mplane_t *plane;
5335         float nodesegmentmins[3], nodesegmentmaxs[3];
5336         // walk the tree until we hit a leaf, recursing for any split cases
5337         while (node->plane)
5338         {
5339                 // abort if this part of the bsp tree can not be hit by this trace
5340 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5341 //                      return;
5342                 plane = node->plane;
5343                 // axial planes are much more common than non-axial, so an optimized
5344                 // axial case pays off here
5345                 if (plane->type < 3)
5346                 {
5347                         // this is an axial plane, compare bounding box directly to it and
5348                         // recurse sides accordingly
5349                         // recurse down node sides
5350                         // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5351                         //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5352                         //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5353                         sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5354                 }
5355                 else
5356                 {
5357                         // this is a non-axial plane, so check if the start and end boxes
5358                         // are both on one side of the plane to handle 'diagonal' cases
5359                         sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5360                 }
5361                 if (sides == 3)
5362                 {
5363                         // segment crosses plane
5364                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5365                         sides = 2;
5366                 }
5367                 // if sides == 0 then the trace itself is bogus (Not A Number values),
5368                 // in this case we simply pretend the trace hit nothing
5369                 if (sides == 0)
5370                         return; // ERROR: NAN bounding box!
5371                 // take whichever side the segment box is on
5372                 node = node->children[sides - 1];
5373         }
5374         // abort if this part of the bsp tree can not be hit by this trace
5375 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5376 //              return;
5377         nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5378         nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5379         nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5380         nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5381         nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5382         nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5383         // hit a leaf
5384         leaf = (mleaf_t *)node;
5385         for (i = 0;i < leaf->numleafbrushes;i++)
5386         {
5387                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5388                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5389                 {
5390                         brush->markframe = markframe;
5391                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5392                 }
5393         }
5394         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5395         {
5396                 for (i = 0;i < leaf->numleafsurfaces;i++)
5397                 {
5398                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5399                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5400                         {
5401                                 surface->collisionmarkframe = markframe;
5402                                 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);
5403                         }
5404                 }
5405         }
5406 }
5407
5408 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)
5409 {
5410         int i;
5411         float segmentmins[3], segmentmaxs[3];
5412         static int markframe = 0;
5413         msurface_t *surface;
5414         q3mbrush_t *brush;
5415         memset(trace, 0, sizeof(*trace));
5416         trace->fraction = 1;
5417         trace->realfraction = 1;
5418         trace->hitsupercontentsmask = hitsupercontentsmask;
5419         if (mod_q3bsp_optimizedtraceline.integer && VectorLength2(boxmins) + VectorLength2(boxmaxs) == 0)
5420         {
5421                 if (VectorCompare(start, end))
5422                 {
5423                         // point trace
5424                         if (model->brush.submodel)
5425                         {
5426                                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5427                                         if (brush->colbrushf)
5428                                                 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5429                         }
5430                         else
5431                                 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5432                 }
5433                 else
5434                 {
5435                         // line trace
5436                         segmentmins[0] = min(start[0], end[0]) - 1;
5437                         segmentmins[1] = min(start[1], end[1]) - 1;
5438                         segmentmins[2] = min(start[2], end[2]) - 1;
5439                         segmentmaxs[0] = max(start[0], end[0]) + 1;
5440                         segmentmaxs[1] = max(start[1], end[1]) + 1;
5441                         segmentmaxs[2] = max(start[2], end[2]) + 1;
5442                         if (model->brush.submodel)
5443                         {
5444                                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5445                                         if (brush->colbrushf)
5446                                                 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5447                                 if (mod_q3bsp_curves_collisions.integer)
5448                                         for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5449                                                 if (surface->num_collisiontriangles)
5450                                                         Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5451                         }
5452                         else
5453                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5454                 }
5455         }
5456         else
5457         {
5458                 // box trace, performed as brush trace
5459                 colbrushf_t *thisbrush_start, *thisbrush_end;
5460                 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5461                 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5462                 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5463                 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5464                 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5465                 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5466                 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5467                 VectorAdd(start, boxmins, boxstartmins);
5468                 VectorAdd(start, boxmaxs, boxstartmaxs);
5469                 VectorAdd(end, boxmins, boxendmins);
5470                 VectorAdd(end, boxmaxs, boxendmaxs);
5471                 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5472                 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5473                 if (model->brush.submodel)
5474                 {
5475                         for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5476                                 if (brush->colbrushf)
5477                                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5478                         if (mod_q3bsp_curves_collisions.integer)
5479                                 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5480                                         if (surface->num_collisiontriangles)
5481                                                 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);
5482                 }
5483                 else
5484                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5485         }
5486 }
5487
5488 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5489 {
5490         int i;
5491         int supercontents = 0;
5492         q3mbrush_t *brush;
5493         // test if the point is inside each brush
5494         if (model->brush.submodel)
5495         {
5496                 // submodels are effectively one leaf
5497                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5498                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5499                                 supercontents |= brush->colbrushf->supercontents;
5500         }
5501         else
5502         {
5503                 mnode_t *node = model->brush.data_nodes;
5504                 mleaf_t *leaf;
5505                 // find which leaf the point is in
5506                 while (node->plane)
5507                         node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5508                 leaf = (mleaf_t *)node;
5509                 // now check the brushes in the leaf
5510                 for (i = 0;i < leaf->numleafbrushes;i++)
5511                 {
5512                         brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5513                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5514                                 supercontents |= brush->colbrushf->supercontents;
5515                 }
5516         }
5517         return supercontents;
5518 }
5519
5520 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
5521 {
5522         int supercontents = 0;
5523         if (nativecontents & CONTENTSQ3_SOLID)
5524                 supercontents |= SUPERCONTENTS_SOLID;
5525         if (nativecontents & CONTENTSQ3_WATER)
5526                 supercontents |= SUPERCONTENTS_WATER;
5527         if (nativecontents & CONTENTSQ3_SLIME)
5528                 supercontents |= SUPERCONTENTS_SLIME;
5529         if (nativecontents & CONTENTSQ3_LAVA)
5530                 supercontents |= SUPERCONTENTS_LAVA;
5531         if (nativecontents & CONTENTSQ3_BODY)
5532                 supercontents |= SUPERCONTENTS_BODY;
5533         if (nativecontents & CONTENTSQ3_CORPSE)
5534                 supercontents |= SUPERCONTENTS_CORPSE;
5535         if (nativecontents & CONTENTSQ3_NODROP)
5536                 supercontents |= SUPERCONTENTS_NODROP;
5537         if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5538                 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5539         if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5540                 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5541         if (nativecontents & CONTENTSQ3_DONOTENTER)
5542                 supercontents |= SUPERCONTENTS_DONOTENTER;
5543         return supercontents;
5544 }
5545
5546 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
5547 {
5548         int nativecontents = 0;
5549         if (supercontents & SUPERCONTENTS_SOLID)
5550                 nativecontents |= CONTENTSQ3_SOLID;
5551         if (supercontents & SUPERCONTENTS_WATER)
5552                 nativecontents |= CONTENTSQ3_WATER;
5553         if (supercontents & SUPERCONTENTS_SLIME)
5554                 nativecontents |= CONTENTSQ3_SLIME;
5555         if (supercontents & SUPERCONTENTS_LAVA)
5556                 nativecontents |= CONTENTSQ3_LAVA;
5557         if (supercontents & SUPERCONTENTS_BODY)
5558                 nativecontents |= CONTENTSQ3_BODY;
5559         if (supercontents & SUPERCONTENTS_CORPSE)
5560                 nativecontents |= CONTENTSQ3_CORPSE;
5561         if (supercontents & SUPERCONTENTS_NODROP)
5562                 nativecontents |= CONTENTSQ3_NODROP;
5563         if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5564                 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5565         if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5566                 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5567         if (supercontents & SUPERCONTENTS_DONOTENTER)
5568                 nativecontents |= CONTENTSQ3_DONOTENTER;
5569         return nativecontents;
5570 }
5571
5572 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5573 {
5574         int numleafs;
5575         while (node->plane)
5576         {
5577                 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5578                 node = node->children[1];
5579         }
5580         numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5581         if (loadmodel->brush.num_leafs < numleafs)
5582                 loadmodel->brush.num_leafs = numleafs;
5583 }
5584
5585 void Mod_Q3BSP_Load(model_t *mod, void *buffer, void *bufferend)
5586 {
5587         int i, j, numshadowmeshtriangles;
5588         q3dheader_t *header;
5589         float corner[3], yawradius, modelradius;
5590         msurface_t *surface;
5591
5592         mod->modeldatatypestring = "Q3BSP";
5593
5594         mod->type = mod_brushq3;
5595         mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5596         mod->numskins = 1;
5597
5598         header = (q3dheader_t *)buffer;
5599
5600         i = LittleLong(header->version);
5601         if (i != Q3BSPVERSION)
5602                 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5603         mod->brush.ishlbsp = false;
5604         if (loadmodel->isworldmodel)
5605                 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
5606
5607         mod->soundfromcenter = true;
5608         mod->TraceBox = Mod_Q3BSP_TraceBox;
5609         mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
5610         mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
5611         mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5612         mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5613         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5614         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5615         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5616         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5617         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5618         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
5619         mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5620         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5621         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5622         mod->Draw = R_Q1BSP_Draw;
5623         mod->DrawDepth = R_Q1BSP_DrawDepth;
5624         mod->DrawDebug = R_Q1BSP_DrawDebug;
5625         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5626         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5627         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5628         mod->DrawLight = R_Q1BSP_DrawLight;
5629         mod->DrawAddWaterPlanes = NULL;
5630
5631         mod_base = (unsigned char *)header;
5632
5633         // swap all the lumps
5634         header->ident = LittleLong(header->ident);
5635         header->version = LittleLong(header->version);
5636         for (i = 0;i < Q3HEADER_LUMPS;i++)
5637         {
5638                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
5639                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
5640         }
5641
5642         mod->brush.qw_md4sum = 0;
5643         mod->brush.qw_md4sum2 = 0;
5644         for (i = 0;i < Q3HEADER_LUMPS;i++)
5645         {
5646                 if (i == Q3LUMP_ENTITIES)
5647                         continue;
5648                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5649                 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
5650                         continue;
5651                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5652         }
5653
5654         Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5655         Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5656         Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5657         Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5658         Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5659         Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5660         Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5661         Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5662         Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
5663         Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5664         Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5665         Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5666         Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5667         Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5668         Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5669         Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5670         Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5671         loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5672
5673         // the MakePortals code works fine on the q3bsp data as well
5674         Mod_Q1BSP_MakePortals();
5675
5676         // FIXME: shader alpha should replace r_wateralpha support in q3bsp
5677         loadmodel->brush.supportwateralpha = true;
5678
5679         // make a single combined shadow mesh to allow optimized shadow volume creation
5680         numshadowmeshtriangles = 0;
5681         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5682         {
5683                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5684                 numshadowmeshtriangles += surface->num_triangles;
5685         }
5686         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5687         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5688                 if (surface->num_triangles > 0)
5689                         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));
5690         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
5691         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5692
5693         loadmodel->brush.num_leafs = 0;
5694         Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
5695
5696         mod = loadmodel;
5697         for (i = 0;i < loadmodel->brush.numsubmodels;i++)
5698         {
5699                 if (i > 0)
5700                 {
5701                         char name[10];
5702                         // LordHavoc: only register submodels if it is the world
5703                         // (prevents external bsp models from replacing world submodels with
5704                         //  their own)
5705                         if (!loadmodel->isworldmodel)
5706                                 continue;
5707                         // duplicate the basic information
5708                         sprintf(name, "*%i", i);
5709                         mod = Mod_FindName(name);
5710                         *mod = *loadmodel;
5711                         strlcpy(mod->name, name, sizeof(mod->name));
5712                         // textures and memory belong to the main model
5713                         mod->texturepool = NULL;
5714                         mod->mempool = NULL;
5715                         mod->brush.TraceLineOfSight = NULL;
5716                         mod->brush.GetPVS = NULL;
5717                         mod->brush.FatPVS = NULL;
5718                         mod->brush.BoxTouchingPVS = NULL;
5719                         mod->brush.BoxTouchingLeafPVS = NULL;
5720                         mod->brush.BoxTouchingVisibleLeafs = NULL;
5721                         mod->brush.FindBoxClusters = NULL;
5722                         mod->brush.LightPoint = NULL;
5723                         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5724                 }
5725                 mod->brush.submodel = i;
5726
5727                 // make the model surface list (used by shadowing/lighting)
5728                 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
5729                 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
5730                 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
5731                 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
5732                 mod->surfacelist = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
5733                 for (j = 0;j < mod->nummodelsurfaces;j++)
5734                         mod->surfacelist[j] = mod->firstmodelsurface + j;
5735
5736                 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
5737                 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
5738                 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5739                 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5740                 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5741                 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5742                 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5743                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5744                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5745                 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5746                 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5747                 mod->yawmins[2] = mod->normalmins[2];
5748                 mod->yawmaxs[2] = mod->normalmaxs[2];
5749                 mod->radius = modelradius;
5750                 mod->radius2 = modelradius * modelradius;
5751
5752                 for (j = 0;j < mod->nummodelsurfaces;j++)
5753                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
5754                                 break;
5755                 if (j < mod->nummodelsurfaces)
5756                         mod->DrawSky = R_Q1BSP_DrawSky;
5757                 else
5758                         mod->DrawSky = NULL;
5759
5760                 for (j = 0;j < mod->nummodelsurfaces;j++)
5761                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
5762                                 break;
5763                 if (j < mod->nummodelsurfaces)
5764                         mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
5765                 else
5766                         mod->DrawAddWaterPlanes = NULL;
5767         }
5768 }
5769
5770 void Mod_IBSP_Load(model_t *mod, void *buffer, void *bufferend)
5771 {
5772         int i = LittleLong(((int *)buffer)[1]);
5773         if (i == Q3BSPVERSION)
5774                 Mod_Q3BSP_Load(mod,buffer, bufferend);
5775         else if (i == Q2BSPVERSION)
5776                 Mod_Q2BSP_Load(mod,buffer, bufferend);
5777         else
5778                 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
5779 }
5780
5781 void Mod_MAP_Load(model_t *mod, void *buffer, void *bufferend)
5782 {
5783         Host_Error("Mod_MAP_Load: not yet implemented");
5784 }
5785
5786 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
5787 {
5788         // we already have done PVS culling at this point...
5789         // so we don't need to do it again.
5790
5791         int i;
5792         vec3_t testorigin, mins, maxs;
5793
5794         testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
5795         testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
5796         testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
5797
5798         if(model->brush.TraceLineOfSight(model, eye, testorigin))
5799                 return 1;
5800
5801         // expand the box a little
5802         mins[0] = (t+1) * minsX[0] - t * maxsX[0];
5803         maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
5804         mins[1] = (t+1) * minsX[1] - t * maxsX[1];
5805         maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
5806         mins[2] = (t+1) * minsX[2] - t * maxsX[2];
5807         maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
5808
5809         for(i = 0; i != numsamples; ++i)
5810         {
5811                 testorigin[0] = lhrandom(mins[0], maxs[0]);
5812                 testorigin[1] = lhrandom(mins[1], maxs[1]);
5813                 testorigin[2] = lhrandom(mins[2], maxs[2]);
5814
5815                 if(model->brush.TraceLineOfSight(model, eye, testorigin))
5816                         return 1;
5817         }
5818
5819         return 0;
5820 }
5821