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