model_brush.c

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