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