model_brush.c

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