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