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