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