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