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