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 r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
  31 cvar_t r_picmipworld = {CVAR_SAVE, "r_picmipworld", "1", "whether gl_picmip shall apply to world textures too"};
  32 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)"};
  33 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)"};
  34 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
  35 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
  36 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
  37 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)"};
  38 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
  39 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)"};
  40 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
  41 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
  42 cvar_t mod_q3bsp_curves_collisions_stride = {0, "mod_q3bsp_curves_collisions_stride", "16", "collisions against curves: optimize performance by doing a combined collision check for this triangle amount first"};
  43 cvar_t mod_q3bsp_curves_stride = {0, "mod_q3bsp_curves_stride", "16", "particle effect collisions against curves: optimize performance by doing a combined collision check for this triangle amount first"};
  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 cvar_t mod_q3bsp_lightmapmergepower = {CVAR_SAVE, "mod_q3bsp_lightmapmergepower", "4", "merges the quake3 128x128 lightmap textures into larger lightmap group textures to speed up rendering, 1 = 256x256, 2 = 512x512, 3 = 1024x1024, 4 = 2048x2048, 5 = 4096x4096, ..."};
  47 cvar_t mod_q3bsp_nolightmaps = {CVAR_SAVE, "mod_q3bsp_nolightmaps", "0", "do not load lightmaps in Q3BSP maps (to save video RAM, but be warned: it looks ugly)"};
  48 cvar_t mod_q3bsp_tracelineofsight_brushes = {0, "mod_q3bsp_tracelineofsight_brushes", "0", "enables culling of entities behind detail brushes, curves, etc"};
  49
  50 static texture_t mod_q1bsp_texture_solid;
  51 static texture_t mod_q1bsp_texture_sky;
  52 static texture_t mod_q1bsp_texture_lava;
  53 static texture_t mod_q1bsp_texture_slime;
  54 static texture_t mod_q1bsp_texture_water;
  55
  56 void Mod_BrushInit(void)
  57 {
  58 //      Cvar_RegisterVariable(&r_subdivide_size);
  59         Cvar_RegisterVariable(&r_novis);
  60         Cvar_RegisterVariable(&r_picmipworld);
  61         Cvar_RegisterVariable(&r_nosurftextures);
  62         Cvar_RegisterVariable(&r_subdivisions_tolerance);
  63         Cvar_RegisterVariable(&r_subdivisions_mintess);
  64         Cvar_RegisterVariable(&r_subdivisions_maxtess);
  65         Cvar_RegisterVariable(&r_subdivisions_maxvertices);
  66         Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
  67         Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
  68         Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
  69         Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
  70         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
  71         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
  72         Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
  73         Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
  74         Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
  75         Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
  76         Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
  77         Cvar_RegisterVariable(&mod_q3bsp_tracelineofsight_brushes);
  78
  79         memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
  80         strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
  81         mod_q1bsp_texture_solid.surfaceflags = 0;
  82         mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
  83
  84         mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
  85         strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
  86         mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
  87         mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
  88
  89         mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
  90         strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
  91         mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
  92         mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
  93
  94         mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
  95         strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
  96         mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
  97         mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
  98
  99         mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
 100         strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
 101         mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
 102         mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
 103 }
 104
 105 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
 106 {
 107         mnode_t *node;
 108
 109         if (model == NULL)
 110                 return NULL;
 111
 112         // LordHavoc: modified to start at first clip node,
 113         // in other words: first node of the (sub)model
 114         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 115         while (node->plane)
 116                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
 117
 118         return (mleaf_t *)node;
 119 }
 120
 121 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
 122 {
 123         int i;
 124         mleaf_t *leaf;
 125         leaf = Mod_Q1BSP_PointInLeaf(model, p);
 126         if (leaf)
 127         {
 128                 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
 129                 if (i)
 130                 {
 131                         memcpy(out, leaf->ambient_sound_level, i);
 132                         out += i;
 133                         outsize -= i;
 134                 }
 135         }
 136         if (outsize)
 137                 memset(out, 0, outsize);
 138 }
 139
 140 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
 141 {
 142         int numclusters = 0;
 143         int nodestackindex = 0;
 144         mnode_t *node, *nodestack[1024];
 145         if (!model->brush.num_pvsclusters)
 146                 return -1;
 147         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 148         for (;;)
 149         {
 150 #if 1
 151                 if (node->plane)
 152                 {
 153                         // node - recurse down the BSP tree
 154                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 155                         if (sides < 3)
 156                         {
 157                                 if (sides == 0)
 158                                         return -1; // ERROR: NAN bounding box!
 159                                 // box is on one side of plane, take that path
 160                                 node = node->children[sides-1];
 161                         }
 162                         else
 163                         {
 164                                 // box crosses plane, take one path and remember the other
 165                                 if (nodestackindex < 1024)
 166                                         nodestack[nodestackindex++] = node->children[0];
 167                                 node = node->children[1];
 168                         }
 169                         continue;
 170                 }
 171                 else
 172                 {
 173                         // leaf - add clusterindex to list
 174                         if (numclusters < maxclusters)
 175                                 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
 176                         numclusters++;
 177                 }
 178 #else
 179                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 180                 {
 181                         if (node->plane)
 182                         {
 183                                 if (nodestackindex < 1024)
 184                                         nodestack[nodestackindex++] = node->children[0];
 185                                 node = node->children[1];
 186                                 continue;
 187                         }
 188                         else
 189                         {
 190                                 // leaf - add clusterindex to list
 191                                 if (numclusters < maxclusters)
 192                                         clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
 193                                 numclusters++;
 194                         }
 195                 }
 196 #endif
 197                 // try another path we didn't take earlier
 198                 if (nodestackindex == 0)
 199                         break;
 200                 node = nodestack[--nodestackindex];
 201         }
 202         // return number of clusters found (even if more than the maxclusters)
 203         return numclusters;
 204 }
 205
 206 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
 207 {
 208         int nodestackindex = 0;
 209         mnode_t *node, *nodestack[1024];
 210         if (!model->brush.num_pvsclusters)
 211                 return true;
 212         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 213         for (;;)
 214         {
 215 #if 1
 216                 if (node->plane)
 217                 {
 218                         // node - recurse down the BSP tree
 219                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 220                         if (sides < 3)
 221                         {
 222                                 if (sides == 0)
 223                                         return -1; // ERROR: NAN bounding box!
 224                                 // box is on one side of plane, take that path
 225                                 node = node->children[sides-1];
 226                         }
 227                         else
 228                         {
 229                                 // box crosses plane, take one path and remember the other
 230                                 if (nodestackindex < 1024)
 231                                         nodestack[nodestackindex++] = node->children[0];
 232                                 node = node->children[1];
 233                         }
 234                         continue;
 235                 }
 236                 else
 237                 {
 238                         // leaf - check cluster bit
 239                         int clusterindex = ((mleaf_t *)node)->clusterindex;
 240                         if (CHECKPVSBIT(pvs, clusterindex))
 241                         {
 242                                 // it is visible, return immediately with the news
 243                                 return true;
 244                         }
 245                 }
 246 #else
 247                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 248                 {
 249                         if (node->plane)
 250                         {
 251                                 if (nodestackindex < 1024)
 252                                         nodestack[nodestackindex++] = node->children[0];
 253                                 node = node->children[1];
 254                                 continue;
 255                         }
 256                         else
 257                         {
 258                                 // leaf - check cluster bit
 259                                 int clusterindex = ((mleaf_t *)node)->clusterindex;
 260                                 if (CHECKPVSBIT(pvs, clusterindex))
 261                                 {
 262                                         // it is visible, return immediately with the news
 263                                         return true;
 264                                 }
 265                         }
 266                 }
 267 #endif
 268                 // nothing to see here, try another path we didn't take earlier
 269                 if (nodestackindex == 0)
 270                         break;
 271                 node = nodestack[--nodestackindex];
 272         }
 273         // it is not visible
 274         return false;
 275 }
 276
 277 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
 278 {
 279         int nodestackindex = 0;
 280         mnode_t *node, *nodestack[1024];
 281         if (!model->brush.num_leafs)
 282                 return true;
 283         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 284         for (;;)
 285         {
 286 #if 1
 287                 if (node->plane)
 288                 {
 289                         // node - recurse down the BSP tree
 290                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 291                         if (sides < 3)
 292                         {
 293                                 if (sides == 0)
 294                                         return -1; // ERROR: NAN bounding box!
 295                                 // box is on one side of plane, take that path
 296                                 node = node->children[sides-1];
 297                         }
 298                         else
 299                         {
 300                                 // box crosses plane, take one path and remember the other
 301                                 if (nodestackindex < 1024)
 302                                         nodestack[nodestackindex++] = node->children[0];
 303                                 node = node->children[1];
 304                         }
 305                         continue;
 306                 }
 307                 else
 308                 {
 309                         // leaf - check cluster bit
 310                         int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
 311                         if (CHECKPVSBIT(pvs, clusterindex))
 312                         {
 313                                 // it is visible, return immediately with the news
 314                                 return true;
 315                         }
 316                 }
 317 #else
 318                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 319                 {
 320                         if (node->plane)
 321                         {
 322                                 if (nodestackindex < 1024)
 323                                         nodestack[nodestackindex++] = node->children[0];
 324                                 node = node->children[1];
 325                                 continue;
 326                         }
 327                         else
 328                         {
 329                                 // leaf - check cluster bit
 330                                 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
 331                                 if (CHECKPVSBIT(pvs, clusterindex))
 332                                 {
 333                                         // it is visible, return immediately with the news
 334                                         return true;
 335                                 }
 336                         }
 337                 }
 338 #endif
 339                 // nothing to see here, try another path we didn't take earlier
 340                 if (nodestackindex == 0)
 341                         break;
 342                 node = nodestack[--nodestackindex];
 343         }
 344         // it is not visible
 345         return false;
 346 }
 347
 348 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
 349 {
 350         int nodestackindex = 0;
 351         mnode_t *node, *nodestack[1024];
 352         if (!model->brush.num_leafs)
 353                 return true;
 354         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
 355         for (;;)
 356         {
 357 #if 1
 358                 if (node->plane)
 359                 {
 360                         // node - recurse down the BSP tree
 361                         int sides = BoxOnPlaneSide(mins, maxs, node->plane);
 362                         if (sides < 3)
 363                         {
 364                                 if (sides == 0)
 365                                         return -1; // ERROR: NAN bounding box!
 366                                 // box is on one side of plane, take that path
 367                                 node = node->children[sides-1];
 368                         }
 369                         else
 370                         {
 371                                 // box crosses plane, take one path and remember the other
 372                                 if (nodestackindex < 1024)
 373                                         nodestack[nodestackindex++] = node->children[0];
 374                                 node = node->children[1];
 375                         }
 376                         continue;
 377                 }
 378                 else
 379                 {
 380                         // leaf - check if it is visible
 381                         if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
 382                         {
 383                                 // it is visible, return immediately with the news
 384                                 return true;
 385                         }
 386                 }
 387 #else
 388                 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
 389                 {
 390                         if (node->plane)
 391                         {
 392                                 if (nodestackindex < 1024)
 393                                         nodestack[nodestackindex++] = node->children[0];
 394                                 node = node->children[1];
 395                                 continue;
 396                         }
 397                         else
 398                         {
 399                                 // leaf - check if it is visible
 400                                 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
 401                                 {
 402                                         // it is visible, return immediately with the news
 403                                         return true;
 404                                 }
 405                         }
 406                 }
 407 #endif
 408                 // nothing to see here, try another path we didn't take earlier
 409                 if (nodestackindex == 0)
 410                         break;
 411                 node = nodestack[--nodestackindex];
 412         }
 413         // it is not visible
 414         return false;
 415 }
 416
 417 typedef struct findnonsolidlocationinfo_s
 418 {
 419         vec3_t center;
 420         vec3_t absmin, absmax;
 421         vec_t radius;
 422         vec3_t nudge;
 423         vec_t bestdist;
 424         dp_model_t *model;
 425 }
 426 findnonsolidlocationinfo_t;
 427
 428 static void Mod_Q1BSP_FindNonSolidLocation_r_Triangle(findnonsolidlocationinfo_t *info, msurface_t *surface, int k)
 429 {
 430         int i, *tri;
 431         float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
 432
 433         tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
 434         VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
 435         VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
 436         VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
 437         VectorSubtract(vert[1], vert[0], edge[0]);
 438         VectorSubtract(vert[2], vert[1], edge[1]);
 439         CrossProduct(edge[1], edge[0], facenormal);
 440         if (facenormal[0] || facenormal[1] || facenormal[2])
 441         {
 442                 VectorNormalize(facenormal);
 443                 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 444                 if (f <= info->bestdist && f >= -info->bestdist)
 445                 {
 446                         VectorSubtract(vert[0], vert[2], edge[2]);
 447                         VectorNormalize(edge[0]);
 448                         VectorNormalize(edge[1]);
 449                         VectorNormalize(edge[2]);
 450                         CrossProduct(facenormal, edge[0], edgenormal[0]);
 451                         CrossProduct(facenormal, edge[1], edgenormal[1]);
 452                         CrossProduct(facenormal, edge[2], edgenormal[2]);
 453                         // face distance
 454                         if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
 455                                         && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
 456                                         && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
 457                         {
 458                                 // we got lucky, the center is within the face
 459                                 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 460                                 if (dist < 0)
 461                                 {
 462                                         dist = -dist;
 463                                         if (info->bestdist > dist)
 464                                         {
 465                                                 info->bestdist = dist;
 466                                                 VectorScale(facenormal, (info->radius - -dist), info->nudge);
 467                                         }
 468                                 }
 469                                 else
 470                                 {
 471                                         if (info->bestdist > dist)
 472                                         {
 473                                                 info->bestdist = dist;
 474                                                 VectorScale(facenormal, (info->radius - dist), info->nudge);
 475                                         }
 476                                 }
 477                         }
 478                         else
 479                         {
 480                                 // check which edge or vertex the center is nearest
 481                                 for (i = 0;i < 3;i++)
 482                                 {
 483                                         f = DotProduct(info->center, edge[i]);
 484                                         if (f >= DotProduct(vert[0], edge[i])
 485                                                         && f <= DotProduct(vert[1], edge[i]))
 486                                         {
 487                                                 // on edge
 488                                                 VectorMA(info->center, -f, edge[i], point);
 489                                                 dist = sqrt(DotProduct(point, point));
 490                                                 if (info->bestdist > dist)
 491                                                 {
 492                                                         info->bestdist = dist;
 493                                                         VectorScale(point, (info->radius / dist), info->nudge);
 494                                                 }
 495                                                 // skip both vertex checks
 496                                                 // (both are further away than this edge)
 497                                                 i++;
 498                                         }
 499                                         else
 500                                         {
 501                                                 // not on edge, check first vertex of edge
 502                                                 VectorSubtract(info->center, vert[i], point);
 503                                                 dist = sqrt(DotProduct(point, point));
 504                                                 if (info->bestdist > dist)
 505                                                 {
 506                                                         info->bestdist = dist;
 507                                                         VectorScale(point, (info->radius / dist), info->nudge);
 508                                                 }
 509                                         }
 510                                 }
 511                         }
 512                 }
 513         }
 514 }
 515
 516 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
 517 {
 518         int surfacenum, k, *mark;
 519         msurface_t *surface;
 520         for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
 521         {
 522                 surface = info->model->data_surfaces + *mark;
 523                 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
 524                 {
 525                         if(surface->num_bboxstride)
 526                         {
 527                                 int i, cnt, tri;
 528                                 cnt = (surface->num_triangles + surface->num_bboxstride - 1) / surface->num_bboxstride;
 529                                 for(i = 0; i < cnt; ++i)
 530                                 {
 531                                         if(BoxesOverlap(surface->data_bbox6f + i * 6, surface->data_bbox6f + i * 6 + 3, info->absmin, info->absmax))
 532                                         {
 533                                                 for(k = 0; k < surface->num_bboxstride; ++k)
 534                                                 {
 535                                                         tri = i * surface->num_bboxstride + k;
 536                                                         if(tri >= surface->num_triangles)
 537                                                                 break;
 538                                                         Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, tri);
 539                                                 }
 540                                         }
 541                                 }
 542                         }
 543                         else
 544                         {
 545                                 for (k = 0;k < surface->num_triangles;k++)
 546                                 {
 547                                         Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, k);
 548                                 }
 549                         }
 550                 }
 551         }
 552 }
 553
 554 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
 555 {
 556         if (node->plane)
 557         {
 558                 float f = PlaneDiff(info->center, node->plane);
 559                 if (f >= -info->bestdist)
 560                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
 561                 if (f <= info->bestdist)
 562                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
 563         }
 564         else
 565         {
 566                 if (((mleaf_t *)node)->numleafsurfaces)
 567                         Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
 568         }
 569 }
 570
 571 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
 572 {
 573         int i;
 574         findnonsolidlocationinfo_t info;
 575         if (model == NULL)
 576         {
 577                 VectorCopy(in, out);
 578                 return;
 579         }
 580         VectorCopy(in, info.center);
 581         info.radius = radius;
 582         info.model = model;
 583         i = 0;
 584         do
 585         {
 586                 VectorClear(info.nudge);
 587                 info.bestdist = radius;
 588                 VectorCopy(info.center, info.absmin);
 589                 VectorCopy(info.center, info.absmax);
 590                 info.absmin[0] -= info.radius + 1;
 591                 info.absmin[1] -= info.radius + 1;
 592                 info.absmin[2] -= info.radius + 1;
 593                 info.absmax[0] += info.radius + 1;
 594                 info.absmax[1] += info.radius + 1;
 595                 info.absmax[2] += info.radius + 1;
 596                 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
 597                 VectorAdd(info.center, info.nudge, info.center);
 598         }
 599         while (info.bestdist < radius && ++i < 10);
 600         VectorCopy(info.center, out);
 601 }
 602
 603 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
 604 {
 605         switch(nativecontents)
 606         {
 607                 case CONTENTS_EMPTY:
 608                         return 0;
 609                 case CONTENTS_SOLID:
 610                         return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
 611                 case CONTENTS_WATER:
 612                         return SUPERCONTENTS_WATER;
 613                 case CONTENTS_SLIME:
 614                         return SUPERCONTENTS_SLIME;
 615                 case CONTENTS_LAVA:
 616                         return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
 617                 case CONTENTS_SKY:
 618                         return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
 619         }
 620         return 0;
 621 }
 622
 623 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
 624 {
 625         if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
 626                 return CONTENTS_SOLID;
 627         if (supercontents & SUPERCONTENTS_SKY)
 628                 return CONTENTS_SKY;
 629         if (supercontents & SUPERCONTENTS_LAVA)
 630                 return CONTENTS_LAVA;
 631         if (supercontents & SUPERCONTENTS_SLIME)
 632                 return CONTENTS_SLIME;
 633         if (supercontents & SUPERCONTENTS_WATER)
 634                 return CONTENTS_WATER;
 635         return CONTENTS_EMPTY;
 636 }
 637
 638 typedef struct RecursiveHullCheckTraceInfo_s
 639 {
 640         // the hull we're tracing through
 641         const hull_t *hull;
 642
 643         // the trace structure to fill in
 644         trace_t *trace;
 645
 646         // start, end, and end - start (in model space)
 647         double start[3];
 648         double end[3];
 649         double dist[3];
 650 }
 651 RecursiveHullCheckTraceInfo_t;
 652
 653 // 1/32 epsilon to keep floating point happy
 654 #define DIST_EPSILON (0.03125)
 655
 656 #define HULLCHECKSTATE_EMPTY 0
 657 #define HULLCHECKSTATE_SOLID 1
 658 #define HULLCHECKSTATE_DONE 2
 659
 660 extern cvar_t collision_prefernudgedfraction;
 661 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
 662 {
 663         // status variables, these don't need to be saved on the stack when
 664         // recursing...  but are because this should be thread-safe
 665         // (note: tracing against a bbox is not thread-safe, yet)
 666         int ret;
 667         mplane_t *plane;
 668         double t1, t2;
 669
 670         // variables that need to be stored on the stack when recursing
 671         mclipnode_t *node;
 672         int side;
 673         double midf, mid[3];
 674
 675         // LordHavoc: a goto!  everyone flee in terror... :)
 676 loc0:
 677         // check for empty
 678         if (num < 0)
 679         {
 680                 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
 681                 if (!t->trace->startfound)
 682                 {
 683                         t->trace->startfound = true;
 684                         t->trace->startsupercontents |= num;
 685                 }
 686                 if (num & SUPERCONTENTS_LIQUIDSMASK)
 687                         t->trace->inwater = true;
 688                 if (num == 0)
 689                         t->trace->inopen = true;
 690                 if (num & SUPERCONTENTS_SOLID)
 691                         t->trace->hittexture = &mod_q1bsp_texture_solid;
 692                 else if (num & SUPERCONTENTS_SKY)
 693                         t->trace->hittexture = &mod_q1bsp_texture_sky;
 694                 else if (num & SUPERCONTENTS_LAVA)
 695                         t->trace->hittexture = &mod_q1bsp_texture_lava;
 696                 else if (num & SUPERCONTENTS_SLIME)
 697                         t->trace->hittexture = &mod_q1bsp_texture_slime;
 698                 else
 699                         t->trace->hittexture = &mod_q1bsp_texture_water;
 700                 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
 701                 t->trace->hitsupercontents = num;
 702                 if (num & t->trace->hitsupercontentsmask)
 703                 {
 704                         // if the first leaf is solid, set startsolid
 705                         if (t->trace->allsolid)
 706                                 t->trace->startsolid = true;
 707 #if COLLISIONPARANOID >= 3
 708                         Con_Print("S");
 709 #endif
 710                         return HULLCHECKSTATE_SOLID;
 711                 }
 712                 else
 713                 {
 714                         t->trace->allsolid = false;
 715 #if COLLISIONPARANOID >= 3
 716                         Con_Print("E");
 717 #endif
 718                         return HULLCHECKSTATE_EMPTY;
 719                 }
 720         }
 721
 722         // find the point distances
 723         node = t->hull->clipnodes + num;
 724
 725         plane = t->hull->planes + node->planenum;
 726         if (plane->type < 3)
 727         {
 728                 t1 = p1[plane->type] - plane->dist;
 729                 t2 = p2[plane->type] - plane->dist;
 730         }
 731         else
 732         {
 733                 t1 = DotProduct (plane->normal, p1) - plane->dist;
 734                 t2 = DotProduct (plane->normal, p2) - plane->dist;
 735         }
 736
 737         if (t1 < 0)
 738         {
 739                 if (t2 < 0)
 740                 {
 741 #if COLLISIONPARANOID >= 3
 742                         Con_Print("<");
 743 #endif
 744                         num = node->children[1];
 745                         goto loc0;
 746                 }
 747                 side = 1;
 748         }
 749         else
 750         {
 751                 if (t2 >= 0)
 752                 {
 753 #if COLLISIONPARANOID >= 3
 754                         Con_Print(">");
 755 #endif
 756                         num = node->children[0];
 757                         goto loc0;
 758                 }
 759                 side = 0;
 760         }
 761
 762         // the line intersects, find intersection point
 763         // LordHavoc: this uses the original trace for maximum accuracy
 764 #if COLLISIONPARANOID >= 3
 765         Con_Print("M");
 766 #endif
 767         if (plane->type < 3)
 768         {
 769                 t1 = t->start[plane->type] - plane->dist;
 770                 t2 = t->end[plane->type] - plane->dist;
 771         }
 772         else
 773         {
 774                 t1 = DotProduct (plane->normal, t->start) - plane->dist;
 775                 t2 = DotProduct (plane->normal, t->end) - plane->dist;
 776         }
 777
 778         midf = t1 / (t1 - t2);
 779         midf = bound(p1f, midf, p2f);
 780         VectorMA(t->start, midf, t->dist, mid);
 781
 782         // recurse both sides, front side first
 783         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
 784         // if this side is not empty, return what it is (solid or done)
 785         if (ret != HULLCHECKSTATE_EMPTY)
 786                 return ret;
 787
 788         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
 789         // if other side is not solid, return what it is (empty or done)
 790         if (ret != HULLCHECKSTATE_SOLID)
 791                 return ret;
 792
 793         // front is air and back is solid, this is the impact point...
 794         if (side)
 795         {
 796                 t->trace->plane.dist = -plane->dist;
 797                 VectorNegate (plane->normal, t->trace->plane.normal);
 798         }
 799         else
 800         {
 801                 t->trace->plane.dist = plane->dist;
 802                 VectorCopy (plane->normal, t->trace->plane.normal);
 803         }
 804
 805         // calculate the true fraction
 806         t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
 807         t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
 808         midf = t1 / (t1 - t2);
 809         t->trace->realfraction = bound(0, midf, 1);
 810
 811         // calculate the return fraction which is nudged off the surface a bit
 812         midf = (t1 - DIST_EPSILON) / (t1 - t2);
 813         t->trace->fraction = bound(0, midf, 1);
 814
 815         if (collision_prefernudgedfraction.integer)
 816                 t->trace->realfraction = t->trace->fraction;
 817
 818 #if COLLISIONPARANOID >= 3
 819         Con_Print("D");
 820 #endif
 821         return HULLCHECKSTATE_DONE;
 822 }
 823
 824 //#if COLLISIONPARANOID < 2
 825 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
 826 {
 827         mplane_t *plane;
 828         mclipnode_t *nodes = t->hull->clipnodes;
 829         mplane_t *planes = t->hull->planes;
 830         vec3_t point;
 831         VectorCopy(t->start, point);
 832         while (num >= 0)
 833         {
 834                 plane = planes + nodes[num].planenum;
 835                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
 836         }
 837         num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
 838         t->trace->startsupercontents |= num;
 839         if (num & SUPERCONTENTS_LIQUIDSMASK)
 840                 t->trace->inwater = true;
 841         if (num == 0)
 842                 t->trace->inopen = true;
 843         if (num & t->trace->hitsupercontentsmask)
 844         {
 845                 t->trace->allsolid = t->trace->startsolid = true;
 846                 return HULLCHECKSTATE_SOLID;
 847         }
 848         else
 849         {
 850                 t->trace->allsolid = t->trace->startsolid = false;
 851                 return HULLCHECKSTATE_EMPTY;
 852         }
 853 }
 854 //#endif
 855
 856 static void Mod_Q1BSP_TracePoint(struct model_s *model, int frame, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
 857 {
 858         RecursiveHullCheckTraceInfo_t rhc;
 859
 860         memset(&rhc, 0, sizeof(rhc));
 861         memset(trace, 0, sizeof(trace_t));
 862         rhc.trace = trace;
 863         rhc.trace->fraction = 1;
 864         rhc.trace->realfraction = 1;
 865         rhc.trace->allsolid = true;
 866         rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
 867         VectorCopy(start, rhc.start);
 868         VectorCopy(start, rhc.end);
 869         Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 870 }
 871
 872 static void Mod_Q1BSP_TraceLine(struct model_s *model, int frame, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
 873 {
 874         RecursiveHullCheckTraceInfo_t rhc;
 875
 876         if (VectorCompare(start, end))
 877         {
 878                 Mod_Q1BSP_TracePoint(model, frame, trace, start, hitsupercontentsmask);
 879                 return;
 880         }
 881
 882         memset(&rhc, 0, sizeof(rhc));
 883         memset(trace, 0, sizeof(trace_t));
 884         rhc.trace = trace;
 885         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 886         rhc.trace->fraction = 1;
 887         rhc.trace->realfraction = 1;
 888         rhc.trace->allsolid = true;
 889         rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
 890         VectorCopy(start, rhc.start);
 891         VectorCopy(end, rhc.end);
 892         VectorSubtract(rhc.end, rhc.start, rhc.dist);
 893 #if COLLISIONPARANOID >= 2
 894         Con_Printf("t(%f %f %f,%f %f %f)", rhc.start[0], rhc.start[1], rhc.start[2], rhc.end[0], rhc.end[1], rhc.end[2]);
 895         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 896         {
 897
 898                 double test[3];
 899                 trace_t testtrace;
 900                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
 901                 memset(&testtrace, 0, sizeof(trace_t));
 902                 rhc.trace = &testtrace;
 903                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 904                 rhc.trace->fraction = 1;
 905                 rhc.trace->realfraction = 1;
 906                 rhc.trace->allsolid = true;
 907                 VectorCopy(test, rhc.start);
 908                 VectorCopy(test, rhc.end);
 909                 VectorClear(rhc.dist);
 910                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 911                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
 912                 if (!trace->startsolid && testtrace.startsolid)
 913                         Con_Printf(" - ended in solid!\n");
 914         }
 915         Con_Print("\n");
 916 #else
 917         if (VectorLength2(rhc.dist))
 918                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 919         else
 920                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 921 #endif
 922 }
 923
 924 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)
 925 {
 926         // this function currently only supports same size start and end
 927         double boxsize[3];
 928         RecursiveHullCheckTraceInfo_t rhc;
 929
 930         if (VectorCompare(boxmins, boxmaxs))
 931         {
 932                 if (VectorCompare(start, end))
 933                         Mod_Q1BSP_TracePoint(model, frame, trace, start, hitsupercontentsmask);
 934                 else
 935                         Mod_Q1BSP_TraceLine(model, frame, trace, start, end, hitsupercontentsmask);
 936                 return;
 937         }
 938
 939         memset(&rhc, 0, sizeof(rhc));
 940         memset(trace, 0, sizeof(trace_t));
 941         rhc.trace = trace;
 942         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 943         rhc.trace->fraction = 1;
 944         rhc.trace->realfraction = 1;
 945         rhc.trace->allsolid = true;
 946         VectorSubtract(boxmaxs, boxmins, boxsize);
 947         if (boxsize[0] < 3)
 948                 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
 949         else if (model->brush.ishlbsp)
 950         {
 951                 // LordHavoc: this has to have a minor tolerance (the .1) because of
 952                 // minor float precision errors from the box being transformed around
 953                 if (boxsize[0] < 32.1)
 954                 {
 955                         if (boxsize[2] < 54) // pick the nearest of 36 or 72
 956                                 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
 957                         else
 958                                 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
 959                 }
 960                 else
 961                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
 962         }
 963         else
 964         {
 965                 // LordHavoc: this has to have a minor tolerance (the .1) because of
 966                 // minor float precision errors from the box being transformed around
 967                 if (boxsize[0] < 32.1)
 968                         rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
 969                 else
 970                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
 971         }
 972         VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
 973         VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
 974         VectorSubtract(rhc.end, rhc.start, rhc.dist);
 975 #if COLLISIONPARANOID >= 2
 976         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]);
 977         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 978         {
 979
 980                 double test[3];
 981                 trace_t testtrace;
 982                 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
 983                 memset(&testtrace, 0, sizeof(trace_t));
 984                 rhc.trace = &testtrace;
 985                 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 986                 rhc.trace->fraction = 1;
 987                 rhc.trace->realfraction = 1;
 988                 rhc.trace->allsolid = true;
 989                 VectorCopy(test, rhc.start);
 990                 VectorCopy(test, rhc.end);
 991                 VectorClear(rhc.dist);
 992                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 993                 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
 994                 if (!trace->startsolid && testtrace.startsolid)
 995                         Con_Printf(" - ended in solid!\n");
 996         }
 997         Con_Print("\n");
 998 #else
 999         if (VectorLength2(rhc.dist))
1000                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1001         else
1002                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1003 #endif
1004 }
1005
1006 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
1007 {
1008         int num = model->brushq1.hulls[0].firstclipnode;
1009         mplane_t *plane;
1010         mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
1011         mplane_t *planes = model->brushq1.hulls[0].planes;
1012         while (num >= 0)
1013         {
1014                 plane = planes + nodes[num].planenum;
1015                 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
1016         }
1017         return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
1018 }
1019
1020 void Collision_ClipTrace_Box(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, const vec3_t mins, const vec3_t maxs, const vec3_t end, int hitsupercontentsmask, int boxsupercontents, int boxq3surfaceflags, texture_t *boxtexture)
1021 {
1022 #if 1
1023         colbrushf_t cbox;
1024         colplanef_t cbox_planes[6];
1025         cbox.isaabb = true;
1026         cbox.hasaabbplanes = true;
1027         cbox.supercontents = boxsupercontents;
1028         cbox.numplanes = 6;
1029         cbox.numpoints = 0;
1030         cbox.numtriangles = 0;
1031         cbox.planes = cbox_planes;
1032         cbox.points = NULL;
1033         cbox.elements = NULL;
1034         cbox.markframe = 0;
1035         cbox.mins[0] = 0;
1036         cbox.mins[1] = 0;
1037         cbox.mins[2] = 0;
1038         cbox.maxs[0] = 0;
1039         cbox.maxs[1] = 0;
1040         cbox.maxs[2] = 0;
1041         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];
1042         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];
1043         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];
1044         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];
1045         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];
1046         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];
1047         cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1048         cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1049         cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1050         cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1051         cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1052         cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1053         memset(trace, 0, sizeof(trace_t));
1054         trace->hitsupercontentsmask = hitsupercontentsmask;
1055         trace->fraction = 1;
1056         trace->realfraction = 1;
1057         Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1058 #else
1059         RecursiveHullCheckTraceInfo_t rhc;
1060         static hull_t box_hull;
1061         static mclipnode_t box_clipnodes[6];
1062         static mplane_t box_planes[6];
1063         // fill in a default trace
1064         memset(&rhc, 0, sizeof(rhc));
1065         memset(trace, 0, sizeof(trace_t));
1066         //To keep everything totally uniform, bounding boxes are turned into small
1067         //BSP trees instead of being compared directly.
1068         // create a temp hull from bounding box sizes
1069         box_planes[0].dist = cmaxs[0] - mins[0];
1070         box_planes[1].dist = cmins[0] - maxs[0];
1071         box_planes[2].dist = cmaxs[1] - mins[1];
1072         box_planes[3].dist = cmins[1] - maxs[1];
1073         box_planes[4].dist = cmaxs[2] - mins[2];
1074         box_planes[5].dist = cmins[2] - maxs[2];
1075 #if COLLISIONPARANOID >= 3
1076         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]);
1077 #endif
1078
1079         if (box_hull.clipnodes == NULL)
1080         {
1081                 int i, side;
1082
1083                 //Set up the planes and clipnodes so that the six floats of a bounding box
1084                 //can just be stored out and get a proper hull_t structure.
1085
1086                 box_hull.clipnodes = box_clipnodes;
1087                 box_hull.planes = box_planes;
1088                 box_hull.firstclipnode = 0;
1089                 box_hull.lastclipnode = 5;
1090
1091                 for (i = 0;i < 6;i++)
1092                 {
1093                         box_clipnodes[i].planenum = i;
1094
1095                         side = i&1;
1096
1097                         box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1098                         if (i != 5)
1099                                 box_clipnodes[i].children[side^1] = i + 1;
1100                         else
1101                                 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1102
1103                         box_planes[i].type = i>>1;
1104                         box_planes[i].normal[i>>1] = 1;
1105                 }
1106         }
1107
1108         // trace a line through the generated clipping hull
1109         //rhc.boxsupercontents = boxsupercontents;
1110         rhc.hull = &box_hull;
1111         rhc.trace = trace;
1112         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1113         rhc.trace->fraction = 1;
1114         rhc.trace->realfraction = 1;
1115         rhc.trace->allsolid = true;
1116         VectorCopy(start, rhc.start);
1117         VectorCopy(end, rhc.end);
1118         VectorSubtract(rhc.end, rhc.start, rhc.dist);
1119         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1120         //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1121         if (rhc.trace->startsupercontents)
1122                 rhc.trace->startsupercontents = boxsupercontents;
1123 #endif
1124 }
1125
1126 void Collision_ClipTrace_Point(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, int hitsupercontentsmask, int boxsupercontents, int boxq3surfaceflags, texture_t *boxtexture)
1127 {
1128         memset(trace, 0, sizeof(trace_t));
1129         trace->fraction = 1;
1130         trace->realfraction = 1;
1131         if (BoxesOverlap(start, start, cmins, cmaxs))
1132         {
1133                 trace->startsupercontents |= boxsupercontents;
1134                 if (hitsupercontentsmask & boxsupercontents)
1135                 {
1136                         trace->startsolid = true;
1137                         trace->allsolid = true;
1138                 }
1139         }
1140 }
1141
1142 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1143 {
1144         trace_t trace;
1145         model->TraceLine(model, 0, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
1146         return trace.fraction == 1;
1147 }
1148
1149 static int Mod_Q1BSP_LightPoint_RecursiveBSPNode(dp_model_t *model, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal, const mnode_t *node, float x, float y, float startz, float endz)
1150 {
1151         int side;
1152         float front, back;
1153         float mid, distz = endz - startz;
1154
1155 loc0:
1156         if (!node->plane)
1157                 return false;           // didn't hit anything
1158
1159         switch (node->plane->type)
1160         {
1161         case PLANE_X:
1162                 node = node->children[x < node->plane->dist];
1163                 goto loc0;
1164         case PLANE_Y:
1165                 node = node->children[y < node->plane->dist];
1166                 goto loc0;
1167         case PLANE_Z:
1168                 side = startz < node->plane->dist;
1169                 if ((endz < node->plane->dist) == side)
1170                 {
1171                         node = node->children[side];
1172                         goto loc0;
1173                 }
1174                 // found an intersection
1175                 mid = node->plane->dist;
1176                 break;
1177         default:
1178                 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1179                 front += startz * node->plane->normal[2];
1180                 back += endz * node->plane->normal[2];
1181                 side = front < node->plane->dist;
1182                 if ((back < node->plane->dist) == side)
1183                 {
1184                         node = node->children[side];
1185                         goto loc0;
1186                 }
1187                 // found an intersection
1188                 mid = startz + distz * (front - node->plane->dist) / (front - back);
1189                 break;
1190         }
1191
1192         // go down front side
1193         if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1194                 return true;    // hit something
1195         else
1196         {
1197                 // check for impact on this node
1198                 if (node->numsurfaces)
1199                 {
1200                         int i, dsi, dti, lmwidth, lmheight;
1201                         float ds, dt;
1202                         msurface_t *surface;
1203                         unsigned char *lightmap;
1204                         int maps, line3, size3;
1205                         float dsfrac;
1206                         float dtfrac;
1207                         float scale, w, w00, w01, w10, w11;
1208
1209                         surface = model->data_surfaces + node->firstsurface;
1210                         for (i = 0;i < node->numsurfaces;i++, surface++)
1211                         {
1212                                 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1213                                         continue;       // no lightmaps
1214
1215                                 // location we want to sample in the lightmap
1216                                 ds = ((x * surface->lightmapinfo->texinfo->vecs[0][0] + y * surface->lightmapinfo->texinfo->vecs[0][1] + mid * surface->lightmapinfo->texinfo->vecs[0][2] + surface->lightmapinfo->texinfo->vecs[0][3]) - surface->lightmapinfo->texturemins[0]) * 0.0625f;
1217                                 dt = ((x * surface->lightmapinfo->texinfo->vecs[1][0] + y * surface->lightmapinfo->texinfo->vecs[1][1] + mid * surface->lightmapinfo->texinfo->vecs[1][2] + surface->lightmapinfo->texinfo->vecs[1][3]) - surface->lightmapinfo->texturemins[1]) * 0.0625f;
1218
1219                                 // check the bounds
1220                                 dsi = (int)ds;
1221                                 dti = (int)dt;
1222                                 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1223                                 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1224
1225                                 // is it in bounds?
1226                                 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1227                                 {
1228                                         // calculate bilinear interpolation factors
1229                                         // and also multiply by fixedpoint conversion factors
1230                                         dsfrac = ds - dsi;
1231                                         dtfrac = dt - dti;
1232                                         w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1233                                         w01 = (    dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1234                                         w10 = (1 - dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1235                                         w11 = (    dsfrac) * (    dtfrac) * (1.0f / 32768.0f);
1236
1237                                         // values for pointer math
1238                                         line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1239                                         size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1240
1241                                         // look up the pixel
1242                                         lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1243
1244                                         // bilinear filter each lightmap style, and sum them
1245                                         for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1246                                         {
1247                                                 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1248                                                 w = w00 * scale;VectorMA(ambientcolor, w, lightmap            , ambientcolor);
1249                                                 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3        , ambientcolor);
1250                                                 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3    , ambientcolor);
1251                                                 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1252                                                 lightmap += size3;
1253                                         }
1254
1255                                         return true; // success
1256                                 }
1257                         }
1258                 }
1259
1260                 // go down back side
1261                 node = node->children[side ^ 1];
1262                 startz = mid;
1263                 distz = endz - startz;
1264                 goto loc0;
1265         }
1266 }
1267
1268 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1269 {
1270         // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1271         VectorSet(diffusenormal, 0, 0, 1);
1272
1273         if (!model->brushq1.lightdata)
1274         {
1275                 VectorSet(ambientcolor, 1, 1, 1);
1276                 VectorSet(diffusecolor, 0, 0, 0);
1277                 return;
1278         }
1279
1280         Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode, p[0], p[1], p[2] + 0.125, p[2] - 65536);
1281 }
1282
1283 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1284 {
1285         int c;
1286         unsigned char *outstart = out;
1287         while (out < outend)
1288         {
1289                 if (in == inend)
1290                 {
1291                         Con_Printf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1292                         return;
1293                 }
1294                 c = *in++;
1295                 if (c)
1296                         *out++ = c;
1297                 else
1298                 {
1299                         if (in == inend)
1300                         {
1301                                 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun (during zero-run) on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1302                                 return;
1303                         }
1304                         for (c = *in++;c > 0;c--)
1305                         {
1306                                 if (out == outend)
1307                                 {
1308                                         Con_Printf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1309                                         return;
1310                                 }
1311                                 *out++ = 0;
1312                         }
1313                 }
1314         }
1315 }
1316
1317 /*
1318 =============
1319 R_Q1BSP_LoadSplitSky
1320
1321 A sky texture is 256*128, with the right side being a masked overlay
1322 ==============
1323 */
1324 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1325 {
1326         int i, j;
1327         unsigned solidpixels[128*128], alphapixels[128*128];
1328
1329         // allocate a texture pool if we need it
1330         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1331                 loadmodel->texturepool = R_AllocTexturePool();
1332
1333         if (bytesperpixel == 4)
1334         {
1335                 for (i = 0;i < 128;i++)
1336                 {
1337                         for (j = 0;j < 128;j++)
1338                         {
1339                                 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1340                                 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1341                         }
1342                 }
1343         }
1344         else
1345         {
1346                 // make an average value for the back to avoid
1347                 // a fringe on the top level
1348                 int p, r, g, b;
1349                 union
1350                 {
1351                         unsigned int i;
1352                         unsigned char b[4];
1353                 }
1354                 bgra;
1355                 r = g = b = 0;
1356                 for (i = 0;i < 128;i++)
1357                 {
1358                         for (j = 0;j < 128;j++)
1359                         {
1360                                 p = src[i*256 + j + 128];
1361                                 r += palette_rgb[p][0];
1362                                 g += palette_rgb[p][1];
1363                                 b += palette_rgb[p][2];
1364                         }
1365                 }
1366                 bgra.b[2] = r/(128*128);
1367                 bgra.b[1] = g/(128*128);
1368                 bgra.b[0] = b/(128*128);
1369                 bgra.b[3] = 0;
1370                 for (i = 0;i < 128;i++)
1371                 {
1372                         for (j = 0;j < 128;j++)
1373                         {
1374                                 solidpixels[(i*128) + j] = palette_bgra_complete[src[i*256 + j + 128]];
1375                                 p = src[i*256 + j];
1376                                 alphapixels[(i*128) + j] = p ? palette_bgra_complete[p] : bgra.i;
1377                         }
1378                 }
1379         }
1380
1381         loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1382         loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1383 }
1384
1385 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1386 {
1387         int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1388         skinframe_t *skinframe;
1389         miptex_t *dmiptex;
1390         texture_t *tx, *tx2, *anims[10], *altanims[10];
1391         dmiptexlump_t *m;
1392         unsigned char *data, *mtdata;
1393         const char *s;
1394         char mapname[MAX_QPATH], name[MAX_QPATH];
1395         unsigned char zero[4];
1396
1397         memset(zero, 0, sizeof(zero));
1398
1399         loadmodel->data_textures = NULL;
1400
1401         // add two slots for notexture walls and notexture liquids
1402         if (l->filelen)
1403         {
1404                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1405                 m->nummiptex = LittleLong (m->nummiptex);
1406                 loadmodel->num_textures = m->nummiptex + 2;
1407                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1408         }
1409         else
1410         {
1411                 m = NULL;
1412                 loadmodel->num_textures = 2;
1413                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1414         }
1415
1416         loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1417
1418         // fill out all slots with notexture
1419         if (cls.state != ca_dedicated)
1420                 skinframe = R_SkinFrame_LoadMissing();
1421         else
1422                 skinframe = NULL;
1423         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1424         {
1425                 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1426                 tx->width = 16;
1427                 tx->height = 16;
1428                 if (cls.state != ca_dedicated)
1429                 {
1430                         tx->numskinframes = 1;
1431                         tx->skinframerate = 1;
1432                         tx->skinframes[0] = skinframe;
1433                         tx->currentskinframe = tx->skinframes[0];
1434                 }
1435                 tx->basematerialflags = MATERIALFLAG_WALL;
1436                 if (i == loadmodel->num_textures - 1)
1437                 {
1438                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1439                         tx->supercontents = mod_q1bsp_texture_water.supercontents;
1440                         tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1441                 }
1442                 else
1443                 {
1444                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1445                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1446                 }
1447                 tx->currentframe = tx;
1448
1449                 // clear water settings
1450                 tx->reflectmin = 0;
1451                 tx->reflectmax = 1;
1452                 tx->refractfactor = 1;
1453                 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1454                 tx->reflectfactor = 1;
1455                 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1456                 tx->r_water_wateralpha = 1;
1457         }
1458
1459         if (!m)
1460         {
1461                 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1462                 return;
1463         }
1464
1465         s = loadmodel->name;
1466         if (!strncasecmp(s, "maps/", 5))
1467                 s += 5;
1468         FS_StripExtension(s, mapname, sizeof(mapname));
1469
1470         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1471         dofs = m->dataofs;
1472         // LordHavoc: mostly rewritten map texture loader
1473         for (i = 0;i < m->nummiptex;i++)
1474         {
1475                 dofs[i] = LittleLong(dofs[i]);
1476                 if (r_nosurftextures.integer)
1477                         continue;
1478                 if (dofs[i] == -1)
1479                 {
1480                         Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1481                         continue;
1482                 }
1483                 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1484
1485                 // copy name, but only up to 16 characters
1486                 // (the output buffer can hold more than this, but the input buffer is
1487                 //  only 16)
1488                 for (j = 0;j < 16 && dmiptex->name[j];j++)
1489                         name[j] = dmiptex->name[j];
1490                 name[j] = 0;
1491
1492                 if (!name[0])
1493                 {
1494                         dpsnprintf(name, sizeof(name), "unnamed%i", i);
1495                         Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1496                 }
1497
1498                 mtwidth = LittleLong(dmiptex->width);
1499                 mtheight = LittleLong(dmiptex->height);
1500                 mtdata = NULL;
1501                 j = LittleLong(dmiptex->offsets[0]);
1502                 if (j)
1503                 {
1504                         // texture included
1505                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1506                         {
1507                                 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1508                                 continue;
1509                         }
1510                         mtdata = (unsigned char *)dmiptex + j;
1511                 }
1512
1513                 if ((mtwidth & 15) || (mtheight & 15))
1514                         Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1515
1516                 // LordHavoc: force all names to lowercase
1517                 for (j = 0;name[j];j++)
1518                         if (name[j] >= 'A' && name[j] <= 'Z')
1519                                 name[j] += 'a' - 'A';
1520
1521                 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1522                         continue;
1523
1524                 tx = loadmodel->data_textures + i;
1525                 strlcpy(tx->name, name, sizeof(tx->name));
1526                 tx->width = mtwidth;
1527                 tx->height = mtheight;
1528
1529                 if (tx->name[0] == '*')
1530                 {
1531                         if (!strncmp(tx->name, "*lava", 5))
1532                         {
1533                                 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1534                                 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1535                         }
1536                         else if (!strncmp(tx->name, "*slime", 6))
1537                         {
1538                                 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1539                                 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1540                         }
1541                         else
1542                         {
1543                                 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1544                                 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1545                         }
1546                 }
1547                 else if (!strncmp(tx->name, "sky", 3))
1548                 {
1549                         tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1550                         tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1551                 }
1552                 else
1553                 {
1554                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1555                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1556                 }
1557
1558                 if (cls.state != ca_dedicated)
1559                 {
1560                         // LordHavoc: HL sky textures are entirely different than quake
1561                         if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1562                         {
1563                                 data = loadimagepixelsbgra(tx->name, false, false);
1564                                 if (data && image_width == 256 && image_height == 128)
1565                                 {
1566                                         R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1567                                         Mem_Free(data);
1568                                 }
1569                                 else if (mtdata != NULL)
1570                                         R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1571                         }
1572                         else
1573                         {
1574                                 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1575                                 if (!skinframe)
1576                                         skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1577                                 if (!skinframe)
1578                                 {
1579                                         // did not find external texture, load it from the bsp or wad3
1580                                         if (loadmodel->brush.ishlbsp)
1581                                         {
1582                                                 // internal texture overrides wad
1583                                                 unsigned char *pixels, *freepixels;
1584                                                 pixels = freepixels = NULL;
1585                                                 if (mtdata)
1586                                                         pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1587                                                 if (pixels == NULL)
1588                                                         pixels = freepixels = W_GetTextureBGRA(tx->name);
1589                                                 if (pixels != NULL)
1590                                                 {
1591                                                         tx->width = image_width;
1592                                                         tx->height = image_height;
1593                                                         skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1594                                                 }
1595                                                 if (freepixels)
1596                                                         Mem_Free(freepixels);
1597                                         }
1598                                         else if (mtdata) // texture included
1599                                                 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1600                                 }
1601                                 // if skinframe is still NULL the "missing" texture will be used
1602                                 if (skinframe)
1603                                         tx->skinframes[0] = skinframe;
1604                         }
1605
1606                         tx->basematerialflags = MATERIALFLAG_WALL;
1607                         if (tx->name[0] == '*')
1608                         {
1609                                 // LordHavoc: some turbulent textures should not be affected by wateralpha
1610                                 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1611                                 {
1612                                         // replace the texture with transparent black
1613                                         Vector4Set(zero, 128, 128, 128, 128);
1614                                         tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1615                                         tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1616                                 }
1617                                 else if (!strncmp(tx->name,"*lava",5)
1618                                  || !strncmp(tx->name,"*teleport",9)
1619                                  || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1620                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1621                                 else
1622                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1623                                 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1624                                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1625                         }
1626                         else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1627                         {
1628                                 // replace the texture with black
1629                                 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1630                                 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1631                         }
1632                         else if (!strncmp(tx->name, "sky", 3))
1633                                 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1634                         else if (!strcmp(tx->name, "caulk"))
1635                                 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1636                         else if (tx->skinframes[0] && tx->skinframes[0]->fog)
1637                                 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1638
1639                         // start out with no animation
1640                         tx->currentframe = tx;
1641                         tx->currentskinframe = tx->skinframes[0];
1642                 }
1643         }
1644
1645         // sequence the animations
1646         for (i = 0;i < m->nummiptex;i++)
1647         {
1648                 tx = loadmodel->data_textures + i;
1649                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1650                         continue;
1651                 if (tx->anim_total[0] || tx->anim_total[1])
1652                         continue;       // already sequenced
1653
1654                 // find the number of frames in the animation
1655                 memset(anims, 0, sizeof(anims));
1656                 memset(altanims, 0, sizeof(altanims));
1657
1658                 for (j = i;j < m->nummiptex;j++)
1659                 {
1660                         tx2 = loadmodel->data_textures + j;
1661                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1662                                 continue;
1663
1664                         num = tx2->name[1];
1665                         if (num >= '0' && num <= '9')
1666                                 anims[num - '0'] = tx2;
1667                         else if (num >= 'a' && num <= 'j')
1668                                 altanims[num - 'a'] = tx2;
1669                         else
1670                                 Con_Printf("Bad animating texture %s\n", tx->name);
1671                 }
1672
1673                 max = altmax = 0;
1674                 for (j = 0;j < 10;j++)
1675                 {
1676                         if (anims[j])
1677                                 max = j + 1;
1678                         if (altanims[j])
1679                                 altmax = j + 1;
1680                 }
1681                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1682
1683                 incomplete = false;
1684                 for (j = 0;j < max;j++)
1685                 {
1686                         if (!anims[j])
1687                         {
1688                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1689                                 incomplete = true;
1690                         }
1691                 }
1692                 for (j = 0;j < altmax;j++)
1693                 {
1694                         if (!altanims[j])
1695                         {
1696                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1697                                 incomplete = true;
1698                         }
1699                 }
1700                 if (incomplete)
1701                         continue;
1702
1703                 if (altmax < 1)
1704                 {
1705                         // if there is no alternate animation, duplicate the primary
1706                         // animation into the alternate
1707                         altmax = max;
1708                         for (k = 0;k < 10;k++)
1709                                 altanims[k] = anims[k];
1710                 }
1711
1712                 // link together the primary animation
1713                 for (j = 0;j < max;j++)
1714                 {
1715                         tx2 = anims[j];
1716                         tx2->animated = true;
1717                         tx2->anim_total[0] = max;
1718                         tx2->anim_total[1] = altmax;
1719                         for (k = 0;k < 10;k++)
1720                         {
1721                                 tx2->anim_frames[0][k] = anims[k];
1722                                 tx2->anim_frames[1][k] = altanims[k];
1723                         }
1724                 }
1725
1726                 // if there really is an alternate anim...
1727                 if (anims[0] != altanims[0])
1728                 {
1729                         // link together the alternate animation
1730                         for (j = 0;j < altmax;j++)
1731                         {
1732                                 tx2 = altanims[j];
1733                                 tx2->animated = true;
1734                                 // the primary/alternate are reversed here
1735                                 tx2->anim_total[0] = altmax;
1736                                 tx2->anim_total[1] = max;
1737                                 for (k = 0;k < 10;k++)
1738                                 {
1739                                         tx2->anim_frames[0][k] = altanims[k];
1740                                         tx2->anim_frames[1][k] = anims[k];
1741                                 }
1742                         }
1743                 }
1744         }
1745 }
1746
1747 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1748 {
1749         int i;
1750         unsigned char *in, *out, *data, d;
1751         char litfilename[MAX_QPATH];
1752         char dlitfilename[MAX_QPATH];
1753         fs_offset_t filesize;
1754         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1755         {
1756                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1757                 for (i=0; i<l->filelen; i++)
1758                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1759         }
1760         else // LordHavoc: bsp version 29 (normal white lighting)
1761         {
1762                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1763                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1764                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1765                 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1766                 strlcat (litfilename, ".lit", sizeof (litfilename));
1767                 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1768                 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1769                 if (data)
1770                 {
1771                         if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1772                         {
1773                                 i = LittleLong(((int *)data)[1]);
1774                                 if (i == 1)
1775                                 {
1776                                         if (developer_loading.integer)
1777                                                 Con_Printf("loaded %s\n", litfilename);
1778                                         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1779                                         memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1780                                         Mem_Free(data);
1781                                         data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1782                                         if (data)
1783                                         {
1784                                                 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1785                                                 {
1786                                                         i = LittleLong(((int *)data)[1]);
1787                                                         if (i == 1)
1788                                                         {
1789                                                                 if (developer_loading.integer)
1790                                                                         Con_Printf("loaded %s\n", dlitfilename);
1791                                                                 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1792                                                                 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1793                                                                 loadmodel->brushq3.deluxemapping_modelspace = false;
1794                                                                 loadmodel->brushq3.deluxemapping = true;
1795                                                         }
1796                                                 }
1797                                                 Mem_Free(data);
1798                                                 data = NULL;
1799                                         }
1800                                         return;
1801                                 }
1802                                 else
1803                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1804                         }
1805                         else if (filesize == 8)
1806                                 Con_Print("Empty .lit file, ignoring\n");
1807                         else
1808                                 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1809                         if (data)
1810                         {
1811                                 Mem_Free(data);
1812                                 data = NULL;
1813                         }
1814                 }
1815                 // LordHavoc: oh well, expand the white lighting data
1816                 if (!l->filelen)
1817                         return;
1818                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1819                 in = mod_base + l->fileofs;
1820                 out = loadmodel->brushq1.lightdata;
1821                 for (i = 0;i < l->filelen;i++)
1822                 {
1823                         d = *in++;
1824                         *out++ = d;
1825                         *out++ = d;
1826                         *out++ = d;
1827                 }
1828         }
1829 }
1830
1831 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1832 {
1833         loadmodel->brushq1.num_compressedpvs = 0;
1834         loadmodel->brushq1.data_compressedpvs = NULL;
1835         if (!l->filelen)
1836                 return;
1837         loadmodel->brushq1.num_compressedpvs = l->filelen;
1838         loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1839         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1840 }
1841
1842 // used only for HalfLife maps
1843 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1844 {
1845         char key[128], value[4096];
1846         int i, j, k;
1847         if (!data)
1848                 return;
1849         if (!COM_ParseToken_Simple(&data, false, false))
1850                 return; // error
1851         if (com_token[0] != '{')
1852                 return; // error
1853         while (1)
1854         {
1855                 if (!COM_ParseToken_Simple(&data, false, false))
1856                         return; // error
1857                 if (com_token[0] == '}')
1858                         break; // end of worldspawn
1859                 if (com_token[0] == '_')
1860                         strlcpy(key, com_token + 1, sizeof(key));
1861                 else
1862                         strlcpy(key, com_token, sizeof(key));
1863                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1864                         key[strlen(key)-1] = 0;
1865                 if (!COM_ParseToken_Simple(&data, false, false))
1866                         return; // error
1867                 dpsnprintf(value, sizeof(value), "%s", com_token);
1868                 if (!strcmp("wad", key)) // for HalfLife maps
1869                 {
1870                         if (loadmodel->brush.ishlbsp)
1871                         {
1872                                 j = 0;
1873                                 for (i = 0;i < (int)sizeof(value);i++)
1874                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1875                                                 break;
1876                                 if (value[i])
1877                                 {
1878                                         for (;i < (int)sizeof(value);i++)
1879                                         {
1880                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1881                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1882                                                         j = i+1;
1883                                                 else if (value[i] == ';' || value[i] == 0)
1884                                                 {
1885                                                         k = value[i];
1886                                                         value[i] = 0;
1887                                                         W_LoadTextureWadFile(&value[j], false);
1888                                                         j = i+1;
1889                                                         if (!k)
1890                                                                 break;
1891                                                 }
1892                                         }
1893                                 }
1894                         }
1895                 }
1896         }
1897 }
1898
1899 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1900 {
1901         loadmodel->brush.entities = NULL;
1902         if (!l->filelen)
1903                 return;
1904         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
1905         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1906         loadmodel->brush.entities[l->filelen] = 0;
1907         if (loadmodel->brush.ishlbsp)
1908                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1909 }
1910
1911
1912 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1913 {
1914         dvertex_t       *in;
1915         mvertex_t       *out;
1916         int                     i, count;
1917
1918         in = (dvertex_t *)(mod_base + l->fileofs);
1919         if (l->filelen % sizeof(*in))
1920                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1921         count = l->filelen / sizeof(*in);
1922         out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1923
1924         loadmodel->brushq1.vertexes = out;
1925         loadmodel->brushq1.numvertexes = count;
1926
1927         for ( i=0 ; i<count ; i++, in++, out++)
1928         {
1929                 out->position[0] = LittleFloat(in->point[0]);
1930                 out->position[1] = LittleFloat(in->point[1]);
1931                 out->position[2] = LittleFloat(in->point[2]);
1932         }
1933 }
1934
1935 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1936 // can be used for this
1937 // REMOVEME
1938 int SB_ReadInt (unsigned char **buffer)
1939 {
1940         int     i;
1941         i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1942         (*buffer) += 4;
1943         return i;
1944 }
1945
1946 // REMOVEME
1947 float SB_ReadFloat (unsigned char **buffer)
1948 {
1949         union
1950         {
1951                 int             i;
1952                 float   f;
1953         } u;
1954
1955         u.i = SB_ReadInt (buffer);
1956         return u.f;
1957 }
1958
1959 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1960 {
1961         unsigned char           *index;
1962         dmodel_t        *out;
1963         int                     i, j, count;
1964
1965         index = (unsigned char *)(mod_base + l->fileofs);
1966         if (l->filelen % (48+4*hullinfo->filehulls))
1967                 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1968
1969         count = l->filelen / (48+4*hullinfo->filehulls);
1970         out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1971
1972         loadmodel->brushq1.submodels = out;
1973         loadmodel->brush.numsubmodels = count;
1974
1975         for (i = 0; i < count; i++, out++)
1976         {
1977         // spread out the mins / maxs by a pixel
1978                 out->mins[0] = SB_ReadFloat (&index) - 1;
1979                 out->mins[1] = SB_ReadFloat (&index) - 1;
1980                 out->mins[2] = SB_ReadFloat (&index) - 1;
1981                 out->maxs[0] = SB_ReadFloat (&index) + 1;
1982                 out->maxs[1] = SB_ReadFloat (&index) + 1;
1983                 out->maxs[2] = SB_ReadFloat (&index) + 1;
1984                 out->origin[0] = SB_ReadFloat (&index);
1985                 out->origin[1] = SB_ReadFloat (&index);
1986                 out->origin[2] = SB_ReadFloat (&index);
1987                 for (j = 0; j < hullinfo->filehulls; j++)
1988                         out->headnode[j] = SB_ReadInt (&index);
1989                 out->visleafs = SB_ReadInt (&index);
1990                 out->firstface = SB_ReadInt (&index);
1991                 out->numfaces = SB_ReadInt (&index);
1992         }
1993 }
1994
1995 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1996 {
1997         dedge_t *in;
1998         medge_t *out;
1999         int     i, count;
2000
2001         in = (dedge_t *)(mod_base + l->fileofs);
2002         if (l->filelen % sizeof(*in))
2003                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2004         count = l->filelen / sizeof(*in);
2005         out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2006
2007         loadmodel->brushq1.edges = out;
2008         loadmodel->brushq1.numedges = count;
2009
2010         for ( i=0 ; i<count ; i++, in++, out++)
2011         {
2012                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2013                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2014                 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2015                 {
2016                         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);
2017                         if(!loadmodel->brushq1.numvertexes)
2018                                 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2019
2020                         out->v[0] = 0;
2021                         out->v[1] = 0;
2022                 }
2023         }
2024 }
2025
2026 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2027 {
2028         texinfo_t *in;
2029         mtexinfo_t *out;
2030         int i, j, k, count, miptex;
2031
2032         in = (texinfo_t *)(mod_base + l->fileofs);
2033         if (l->filelen % sizeof(*in))
2034                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2035         count = l->filelen / sizeof(*in);
2036         out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2037
2038         loadmodel->brushq1.texinfo = out;
2039         loadmodel->brushq1.numtexinfo = count;
2040
2041         for (i = 0;i < count;i++, in++, out++)
2042         {
2043                 for (k = 0;k < 2;k++)
2044                         for (j = 0;j < 4;j++)
2045                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2046
2047                 miptex = LittleLong(in->miptex);
2048                 out->flags = LittleLong(in->flags);
2049
2050                 out->texture = NULL;
2051                 if (loadmodel->data_textures)
2052                 {
2053                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2054                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2055                         else
2056                                 out->texture = loadmodel->data_textures + miptex;
2057                 }
2058                 if (out->flags & TEX_SPECIAL)
2059                 {
2060                         // if texture chosen is NULL or the shader needs a lightmap,
2061                         // force to notexture water shader
2062                         if (out->texture == NULL)
2063                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2064                 }
2065                 else
2066                 {
2067                         // if texture chosen is NULL, force to notexture
2068                         if (out->texture == NULL)
2069                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2070                 }
2071         }
2072 }
2073
2074 #if 0
2075 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2076 {
2077         int             i, j;
2078         float   *v;
2079
2080         mins[0] = mins[1] = mins[2] = 9999;
2081         maxs[0] = maxs[1] = maxs[2] = -9999;
2082         v = verts;
2083         for (i = 0;i < numverts;i++)
2084         {
2085                 for (j = 0;j < 3;j++, v++)
2086                 {
2087                         if (*v < mins[j])
2088                                 mins[j] = *v;
2089                         if (*v > maxs[j])
2090                                 maxs[j] = *v;
2091                 }
2092         }
2093 }
2094
2095 #define MAX_SUBDIVPOLYTRIANGLES 4096
2096 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2097
2098 static int subdivpolyverts, subdivpolytriangles;
2099 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2100 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2101
2102 static int subdivpolylookupvert(vec3_t v)
2103 {
2104         int i;
2105         for (i = 0;i < subdivpolyverts;i++)
2106                 if (subdivpolyvert[i][0] == v[0]
2107                  && subdivpolyvert[i][1] == v[1]
2108                  && subdivpolyvert[i][2] == v[2])
2109                         return i;
2110         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2111                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2112         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2113         return subdivpolyverts++;
2114 }
2115
2116 static void SubdividePolygon(int numverts, float *verts)
2117 {
2118         int             i, i1, i2, i3, f, b, c, p;
2119         vec3_t  mins, maxs, front[256], back[256];
2120         float   m, *pv, *cv, dist[256], frac;
2121
2122         if (numverts > 250)
2123                 Host_Error("SubdividePolygon: ran out of verts in buffer");
2124
2125         BoundPoly(numverts, verts, mins, maxs);
2126
2127         for (i = 0;i < 3;i++)
2128         {
2129                 m = (mins[i] + maxs[i]) * 0.5;
2130                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2131                 if (maxs[i] - m < 8)
2132                         continue;
2133                 if (m - mins[i] < 8)
2134                         continue;
2135
2136                 // cut it
2137                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2138                         dist[c] = cv[i] - m;
2139
2140                 f = b = 0;
2141                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2142                 {
2143                         if (dist[p] >= 0)
2144                         {
2145                                 VectorCopy(pv, front[f]);
2146                                 f++;
2147                         }
2148                         if (dist[p] <= 0)
2149                         {
2150                                 VectorCopy(pv, back[b]);
2151                                 b++;
2152                         }
2153                         if (dist[p] == 0 || dist[c] == 0)
2154                                 continue;
2155                         if ((dist[p] > 0) != (dist[c] > 0) )
2156                         {
2157                                 // clip point
2158                                 frac = dist[p] / (dist[p] - dist[c]);
2159                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2160                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2161                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2162                                 f++;
2163                                 b++;
2164                         }
2165                 }
2166
2167                 SubdividePolygon(f, front[0]);
2168                 SubdividePolygon(b, back[0]);
2169                 return;
2170         }
2171
2172         i1 = subdivpolylookupvert(verts);
2173         i2 = subdivpolylookupvert(verts + 3);
2174         for (i = 2;i < numverts;i++)
2175         {
2176                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2177                 {
2178                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2179                         return;
2180                 }
2181
2182                 i3 = subdivpolylookupvert(verts + i * 3);
2183                 subdivpolyindex[subdivpolytriangles][0] = i1;
2184                 subdivpolyindex[subdivpolytriangles][1] = i2;
2185                 subdivpolyindex[subdivpolytriangles][2] = i3;
2186                 i2 = i3;
2187                 subdivpolytriangles++;
2188         }
2189 }
2190
2191 //Breaks a polygon up along axial 64 unit
2192 //boundaries so that turbulent and sky warps
2193 //can be done reasonably.
2194 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2195 {
2196         int i, j;
2197         surfvertex_t *v;
2198         surfmesh_t *mesh;
2199
2200         subdivpolytriangles = 0;
2201         subdivpolyverts = 0;
2202         SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2203         if (subdivpolytriangles < 1)
2204                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2205
2206         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2207         mesh->num_vertices = subdivpolyverts;
2208         mesh->num_triangles = subdivpolytriangles;
2209         mesh->vertex = (surfvertex_t *)(mesh + 1);
2210         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2211         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2212
2213         for (i = 0;i < mesh->num_triangles;i++)
2214                 for (j = 0;j < 3;j++)
2215                         mesh->index[i*3+j] = subdivpolyindex[i][j];
2216
2217         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2218         {
2219                 VectorCopy(subdivpolyvert[i], v->v);
2220                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2221                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2222         }
2223 }
2224 #endif
2225
2226 /* Maximum size of a single LM */
2227 #define MAX_SINGLE_LM_SIZE    256
2228
2229 struct alloc_lm_row
2230 {
2231         int rowY;
2232         int currentX;
2233 };
2234
2235 struct alloc_lm_state
2236 {
2237         int currentY;
2238         struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2239 };
2240
2241 static void init_alloc_lm_state (struct alloc_lm_state* state)
2242 {
2243         int r;
2244
2245         state->currentY = 0;
2246         for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2247         {
2248           state->rows[r].currentX = 0;
2249           state->rows[r].rowY = -1;
2250         }
2251 }
2252
2253 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2254 {
2255         struct alloc_lm_row* row;
2256         int r;
2257
2258         row = &(state->rows[blockheight]);
2259         if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2260         {
2261                 if (state->currentY + blockheight <= totalheight)
2262                 {
2263                         row->rowY = state->currentY;
2264                         row->currentX = 0;
2265                         state->currentY += blockheight;
2266                 }
2267                 else
2268                 {
2269                         /* See if we can stuff the block into a higher row */
2270                         row = NULL;
2271                         for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2272                         {
2273                                 if ((state->rows[r].rowY >= 0)
2274                                   && (state->rows[r].currentX + blockwidth <= totalwidth))
2275                                 {
2276                                         row = &(state->rows[r]);
2277                                         break;
2278                                 }
2279                         }
2280                         if (row == NULL) return false;
2281                 }
2282         }
2283         *outy = row->rowY;
2284         *outx = row->currentX;
2285         row->currentX += blockwidth;
2286
2287         return true;
2288 }
2289
2290 extern cvar_t gl_max_size;
2291 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2292 {
2293         dface_t *in;
2294         msurface_t *surface;
2295         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2296         float texmins[2], texmaxs[2], val;
2297         rtexture_t *lightmaptexture, *deluxemaptexture;
2298
2299         in = (dface_t *)(mod_base + l->fileofs);
2300         if (l->filelen % sizeof(*in))
2301                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2302         count = l->filelen / sizeof(*in);
2303         loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2304         loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2305
2306         loadmodel->num_surfaces = count;
2307
2308         loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2309
2310         totalverts = 0;
2311         totaltris = 0;
2312         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2313         {
2314                 numedges = (unsigned short)LittleShort(in->numedges);
2315                 totalverts += numedges;
2316                 totaltris += numedges - 2;
2317         }
2318
2319         Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2320
2321         lightmaptexture = NULL;
2322         deluxemaptexture = r_texture_blanknormalmap;
2323         lightmapnumber = 1;
2324         lightmapsize = max(256, gl_max_size.integer);
2325         totallightmapsamples = 0;
2326
2327         totalverts = 0;
2328         totaltris = 0;
2329         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2330         {
2331                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2332
2333                 // FIXME: validate edges, texinfo, etc?
2334                 firstedge = LittleLong(in->firstedge);
2335                 numedges = (unsigned short)LittleShort(in->numedges);
2336                 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)
2337                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2338                 i = (unsigned short)LittleShort(in->texinfo);
2339                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2340                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2341                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2342                 surface->texture = surface->lightmapinfo->texinfo->texture;
2343
2344                 planenum = (unsigned short)LittleShort(in->planenum);
2345                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2346                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2347
2348                 //surface->flags = surface->texture->flags;
2349                 //if (LittleShort(in->side))
2350                 //      surface->flags |= SURF_PLANEBACK;
2351                 //surface->plane = loadmodel->brush.data_planes + planenum;
2352
2353                 surface->num_firstvertex = totalverts;
2354                 surface->num_vertices = numedges;
2355                 surface->num_firsttriangle = totaltris;
2356                 surface->num_triangles = numedges - 2;
2357                 totalverts += numedges;
2358                 totaltris += numedges - 2;
2359
2360                 // convert edges back to a normal polygon
2361                 for (i = 0;i < surface->num_vertices;i++)
2362                 {
2363                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2364                         float s, t;
2365                         // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2366                         if (lindex >= 0)
2367                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2368                         else
2369                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2370                         s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2371                         t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2372                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2373                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2374                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2375                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2376                         (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2377                 }
2378
2379                 for (i = 0;i < surface->num_triangles;i++)
2380                 {
2381                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2382                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2383                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2384                 }
2385
2386                 // compile additional data about the surface geometry
2387                 Mod_BuildNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_normal3f, true);
2388                 Mod_BuildTextureVectorsFromNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_texcoordtexture2f, loadmodel->surfmesh.data_normal3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_svector3f, loadmodel->surfmesh.data_tvector3f, true);
2389                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2390
2391                 // generate surface extents information
2392                 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2393                 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2394                 for (i = 1;i < surface->num_vertices;i++)
2395                 {
2396                         for (j = 0;j < 2;j++)
2397                         {
2398                                 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2399                                 texmins[j] = min(texmins[j], val);
2400                                 texmaxs[j] = max(texmaxs[j], val);
2401                         }
2402                 }
2403                 for (i = 0;i < 2;i++)
2404                 {
2405                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2406                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2407                 }
2408
2409                 smax = surface->lightmapinfo->extents[0] >> 4;
2410                 tmax = surface->lightmapinfo->extents[1] >> 4;
2411                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2412                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2413
2414                 // lighting info
2415                 for (i = 0;i < MAXLIGHTMAPS;i++)
2416                         surface->lightmapinfo->styles[i] = in->styles[i];
2417                 surface->lightmaptexture = NULL;
2418                 surface->deluxemaptexture = r_texture_blanknormalmap;
2419                 i = LittleLong(in->lightofs);
2420                 if (i == -1)
2421                 {
2422                         surface->lightmapinfo->samples = NULL;
2423 #if 0
2424                         // give non-lightmapped water a 1x white lightmap
2425                         if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2426                         {
2427                                 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2428                                 surface->lightmapinfo->styles[0] = 0;
2429                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2430                         }
2431 #endif
2432                 }
2433                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2434                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2435                 else // LordHavoc: white lighting (bsp version 29)
2436                 {
2437                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2438                         if (loadmodel->brushq1.nmaplightdata)
2439                                 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2440                 }
2441
2442                 // check if we should apply a lightmap to this
2443                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2444                 {
2445                         if (ssize > 256 || tsize > 256)
2446                                 Host_Error("Bad surface extents");
2447
2448                         if (lightmapsize < ssize)
2449                                 lightmapsize = ssize;
2450                         if (lightmapsize < tsize)
2451                                 lightmapsize = tsize;
2452
2453                         totallightmapsamples += ssize*tsize;
2454
2455                         // force lightmap upload on first time seeing the surface
2456                         //
2457                         // additionally this is used by the later code to see if a
2458                         // lightmap is needed on this surface (rather than duplicating the
2459                         // logic above)
2460                         loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2461                 }
2462         }
2463
2464         // small maps (such as ammo boxes especially) don't need big lightmap
2465         // textures, so this code tries to guess a good size based on
2466         // totallightmapsamples (size of the lightmaps lump basically), as well as
2467         // trying to max out the gl_max_size if there is a lot of lightmap data to
2468         // store
2469         // additionally, never choose a lightmapsize that is smaller than the
2470         // largest surface encountered (as it would fail)
2471         i = lightmapsize;
2472         for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2473                 ;
2474
2475         // now that we've decided the lightmap texture size, we can do the rest
2476         if (cls.state != ca_dedicated)
2477         {
2478                 int stainmapsize = 0;
2479                 struct alloc_lm_state allocState;
2480
2481                 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2482                 {
2483                         int i, iu, iv, lightmapx = 0, lightmapy = 0;
2484                         float u, v, ubase, vbase, uscale, vscale;
2485
2486                         if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2487                                 continue;
2488
2489                         smax = surface->lightmapinfo->extents[0] >> 4;
2490                         tmax = surface->lightmapinfo->extents[1] >> 4;
2491                         ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2492                         tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2493                         stainmapsize += ssize * tsize * 3;
2494
2495                         if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2496                         {
2497                                 // allocate a texture pool if we need it
2498                                 if (loadmodel->texturepool == NULL)
2499                                         loadmodel->texturepool = R_AllocTexturePool();
2500                                 // could not find room, make a new lightmap
2501                                 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2502                                 if (loadmodel->brushq1.nmaplightdata)
2503                                         deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2504                                 lightmapnumber++;
2505                                 init_alloc_lm_state (&allocState);
2506                                 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2507                         }
2508                         surface->lightmaptexture = lightmaptexture;
2509                         surface->deluxemaptexture = deluxemaptexture;
2510                         surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2511                         surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2512
2513                         uscale = 1.0f / (float)lightmapsize;
2514                         vscale = 1.0f / (float)lightmapsize;
2515                         ubase = lightmapx * uscale;
2516                         vbase = lightmapy * vscale;
2517
2518                         for (i = 0;i < surface->num_vertices;i++)
2519                         {
2520                                 u = ((DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3]) + 8 - surface->lightmapinfo->texturemins[0]) * (1.0 / 16.0);
2521                                 v = ((DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3]) + 8 - surface->lightmapinfo->texturemins[1]) * (1.0 / 16.0);
2522                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2523                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2524                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2525                                 iu = (int) u;
2526                                 iv = (int) v;
2527                                 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2528                         }
2529                 }
2530
2531                 if (cl_stainmaps.integer)
2532                 {
2533                         // allocate stainmaps for permanent marks on walls and clear white
2534                         unsigned char *stainsamples = NULL;
2535                         stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2536                         memset(stainsamples, 255, stainmapsize);
2537                         // assign pointers
2538                         for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2539                         {
2540                                 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2541                                         continue;
2542                                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2543                                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2544                                 surface->lightmapinfo->stainsamples = stainsamples;
2545                                 stainsamples += ssize * tsize * 3;
2546                         }
2547                 }
2548         }
2549
2550         // generate ushort elements array if possible
2551         if (loadmodel->surfmesh.data_element3s)
2552                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2553                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2554 }
2555
2556 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2557 {
2558         //if (node->parent)
2559         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2560         node->parent = parent;
2561         if (node->plane)
2562         {
2563                 // this is a node, recurse to children
2564                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2565                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2566                 // combine supercontents of children
2567                 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2568         }
2569         else
2570         {
2571                 int j;
2572                 mleaf_t *leaf = (mleaf_t *)node;
2573                 // if this is a leaf, calculate supercontents mask from all collidable
2574                 // primitives in the leaf (brushes and collision surfaces)
2575                 // also flag if the leaf contains any collision surfaces
2576                 leaf->combinedsupercontents = 0;
2577                 // combine the supercontents values of all brushes in this leaf
2578                 for (j = 0;j < leaf->numleafbrushes;j++)
2579                         leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2580                 // check if this leaf contains any collision surfaces (q3 patches)
2581                 for (j = 0;j < leaf->numleafsurfaces;j++)
2582                 {
2583                         msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2584                         if (surface->num_collisiontriangles)
2585                         {
2586                                 leaf->containscollisionsurfaces = true;
2587                                 leaf->combinedsupercontents |= surface->texture->supercontents;
2588                         }
2589                 }
2590         }
2591 }
2592
2593 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2594 {
2595         int                     i, j, count, p;
2596         dnode_t         *in;
2597         mnode_t         *out;
2598
2599         in = (dnode_t *)(mod_base + l->fileofs);
2600         if (l->filelen % sizeof(*in))
2601                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2602         count = l->filelen / sizeof(*in);
2603         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2604
2605         loadmodel->brush.data_nodes = out;
2606         loadmodel->brush.num_nodes = count;
2607
2608         for ( i=0 ; i<count ; i++, in++, out++)
2609         {
2610                 for (j=0 ; j<3 ; j++)
2611                 {
2612                         out->mins[j] = LittleShort(in->mins[j]);
2613                         out->maxs[j] = LittleShort(in->maxs[j]);
2614                 }
2615
2616                 p = LittleLong(in->planenum);
2617                 out->plane = loadmodel->brush.data_planes + p;
2618
2619                 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2620                 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2621
2622                 for (j=0 ; j<2 ; j++)
2623                 {
2624                         // LordHavoc: this code supports broken bsp files produced by
2625                         // arguire qbsp which can produce more than 32768 nodes, any value
2626                         // below count is assumed to be a node number, any other value is
2627                         // assumed to be a leaf number
2628                         p = (unsigned short)LittleShort(in->children[j]);
2629                         if (p < count)
2630                         {
2631                                 if (p < loadmodel->brush.num_nodes)
2632                                         out->children[j] = loadmodel->brush.data_nodes + p;
2633                                 else
2634                                 {
2635                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2636                                         // map it to the solid leaf
2637                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2638                                 }
2639                         }
2640                         else
2641                         {
2642                                 // note this uses 65535 intentionally, -1 is leaf 0
2643                                 p = 65535 - p;
2644                                 if (p < loadmodel->brush.num_leafs)
2645                                         out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2646                                 else
2647                                 {
2648                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2649                                         // map it to the solid leaf
2650                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2651                                 }
2652                         }
2653                 }
2654         }
2655
2656         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2657 }
2658
2659 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2660 {
2661         dleaf_t *in;
2662         mleaf_t *out;
2663         int i, j, count, p;
2664
2665         in = (dleaf_t *)(mod_base + l->fileofs);
2666         if (l->filelen % sizeof(*in))
2667                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2668         count = l->filelen / sizeof(*in);
2669         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2670
2671         loadmodel->brush.data_leafs = out;
2672         loadmodel->brush.num_leafs = count;
2673         // get visleafs from the submodel data
2674         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2675         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2676         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2677         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2678
2679         for ( i=0 ; i<count ; i++, in++, out++)
2680         {
2681                 for (j=0 ; j<3 ; j++)
2682                 {
2683                         out->mins[j] = LittleShort(in->mins[j]);
2684                         out->maxs[j] = LittleShort(in->maxs[j]);
2685                 }
2686
2687                 // FIXME: this function could really benefit from some error checking
2688
2689                 out->contents = LittleLong(in->contents);
2690
2691                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2692                 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2693                 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2694                 {
2695                         Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", (int)(out->firstleafsurface - loadmodel->brush.data_leafsurfaces), (int)(out->firstleafsurface + out->numleafsurfaces - loadmodel->brush.data_leafsurfaces), 0, loadmodel->brush.num_leafsurfaces);
2696                         out->firstleafsurface = NULL;
2697                         out->numleafsurfaces = 0;
2698                 }
2699
2700                 out->clusterindex = i - 1;
2701                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2702                         out->clusterindex = -1;
2703
2704                 p = LittleLong(in->visofs);
2705                 // ignore visofs errors on leaf 0 (solid)
2706                 if (p >= 0 && out->clusterindex >= 0)
2707                 {
2708                         if (p >= loadmodel->brushq1.num_compressedpvs)
2709                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2710                         else
2711                                 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);
2712                 }
2713
2714                 for (j = 0;j < 4;j++)
2715                         out->ambient_sound_level[j] = in->ambient_level[j];
2716
2717                 // FIXME: Insert caustics here
2718         }
2719 }
2720
2721 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2722 {
2723         int i, j;
2724         mleaf_t *leaf;
2725         const unsigned char *pvs;
2726         // if there's no vis data, assume supported (because everything is visible all the time)
2727         if (!loadmodel->brush.data_pvsclusters)
2728                 return true;
2729         // check all liquid leafs to see if they can see into empty leafs, if any
2730         // can we can assume this map supports r_wateralpha
2731         for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2732         {
2733                 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2734                 {
2735                         pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2736                         for (j = 0;j < loadmodel->brush.num_leafs;j++)
2737                                 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2738                                         return true;
2739                 }
2740         }
2741         return false;
2742 }
2743
2744 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2745 {
2746         dclipnode_t *in;
2747         mclipnode_t *out;
2748         int                     i, count;
2749         hull_t          *hull;
2750
2751         in = (dclipnode_t *)(mod_base + l->fileofs);
2752         if (l->filelen % sizeof(*in))
2753                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2754         count = l->filelen / sizeof(*in);
2755         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2756
2757         loadmodel->brushq1.clipnodes = out;
2758         loadmodel->brushq1.numclipnodes = count;
2759
2760         for (i = 1; i < MAX_MAP_HULLS; i++)
2761         {
2762                 hull = &loadmodel->brushq1.hulls[i];
2763                 hull->clipnodes = out;
2764                 hull->firstclipnode = 0;
2765                 hull->lastclipnode = count-1;
2766                 hull->planes = loadmodel->brush.data_planes;
2767                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2768                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2769                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2770                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2771                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2772                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2773                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2774         }
2775
2776         for (i=0 ; i<count ; i++, out++, in++)
2777         {
2778                 out->planenum = LittleLong(in->planenum);
2779                 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2780                 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2781                 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2782                 if (out->children[0] >= count)
2783                         out->children[0] -= 65536;
2784                 if (out->children[1] >= count)
2785                         out->children[1] -= 65536;
2786                 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2787                         Host_Error("Corrupt clipping hull(out of range planenum)");
2788         }
2789 }
2790
2791 //Duplicate the drawing hull structure as a clipping hull
2792 static void Mod_Q1BSP_MakeHull0(void)
2793 {
2794         mnode_t         *in;
2795         mclipnode_t *out;
2796         int                     i;
2797         hull_t          *hull;
2798
2799         hull = &loadmodel->brushq1.hulls[0];
2800
2801         in = loadmodel->brush.data_nodes;
2802         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2803
2804         hull->clipnodes = out;
2805         hull->firstclipnode = 0;
2806         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2807         hull->planes = loadmodel->brush.data_planes;
2808
2809         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2810         {
2811                 out->planenum = in->plane - loadmodel->brush.data_planes;
2812                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2813                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2814         }
2815 }
2816
2817 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2818 {
2819         int i, j;
2820         short *in;
2821
2822         in = (short *)(mod_base + l->fileofs);
2823         if (l->filelen % sizeof(*in))
2824                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2825         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2826         loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2827
2828         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2829         {
2830                 j = (unsigned short) LittleShort(in[i]);
2831                 if (j >= loadmodel->num_surfaces)
2832                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2833                 loadmodel->brush.data_leafsurfaces[i] = j;
2834         }
2835 }
2836
2837 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2838 {
2839         int             i;
2840         int             *in;
2841
2842         in = (int *)(mod_base + l->fileofs);
2843         if (l->filelen % sizeof(*in))
2844                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2845         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2846         loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2847
2848         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2849                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2850 }
2851
2852
2853 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2854 {
2855         int                     i;
2856         mplane_t        *out;
2857         dplane_t        *in;
2858
2859         in = (dplane_t *)(mod_base + l->fileofs);
2860         if (l->filelen % sizeof(*in))
2861                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2862
2863         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2864         loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2865
2866         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2867         {
2868                 out->normal[0] = LittleFloat(in->normal[0]);
2869                 out->normal[1] = LittleFloat(in->normal[1]);
2870                 out->normal[2] = LittleFloat(in->normal[2]);
2871                 out->dist = LittleFloat(in->dist);
2872
2873                 PlaneClassify(out);
2874         }
2875 }
2876
2877 static void Mod_Q1BSP_LoadMapBrushes(void)
2878 {
2879 #if 0
2880 // unfinished
2881         int submodel, numbrushes;
2882         qboolean firstbrush;
2883         char *text, *maptext;
2884         char mapfilename[MAX_QPATH];
2885         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2886         strlcat (mapfilename, ".map", sizeof (mapfilename));
2887         maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2888         if (!maptext)
2889                 return;
2890         text = maptext;
2891         if (!COM_ParseToken_Simple(&data, false, false))
2892                 return; // error
2893         submodel = 0;
2894         for (;;)
2895         {
2896                 if (!COM_ParseToken_Simple(&data, false, false))
2897                         break;
2898                 if (com_token[0] != '{')
2899                         return; // error
2900                 // entity
2901                 firstbrush = true;
2902                 numbrushes = 0;
2903                 maxbrushes = 256;
2904                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2905                 for (;;)
2906                 {
2907                         if (!COM_ParseToken_Simple(&data, false, false))
2908                                 return; // error
2909                         if (com_token[0] == '}')
2910                                 break; // end of entity
2911                         if (com_token[0] == '{')
2912                         {
2913                                 // brush
2914                                 if (firstbrush)
2915                                 {
2916                                         if (submodel)
2917                                         {
2918                                                 if (submodel > loadmodel->brush.numsubmodels)
2919                                                 {
2920                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2921                                                         model = NULL;
2922                                                 }
2923                                                 else
2924                                                         model = loadmodel->brush.submodels[submodel];
2925                                         }
2926                                         else
2927                                                 model = loadmodel;
2928                                 }
2929                                 for (;;)
2930                                 {
2931                                         if (!COM_ParseToken_Simple(&data, false, false))
2932                                                 return; // error
2933                                         if (com_token[0] == '}')
2934                                                 break; // end of brush
2935                                         // each brush face should be this format:
2936                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2937                                         // FIXME: support hl .map format
2938                                         for (pointnum = 0;pointnum < 3;pointnum++)
2939                                         {
2940                                                 COM_ParseToken_Simple(&data, false, false);
2941                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2942                                                 {
2943                                                         COM_ParseToken_Simple(&data, false, false);
2944                                                         point[pointnum][componentnum] = atof(com_token);
2945                                                 }
2946                                                 COM_ParseToken_Simple(&data, false, false);
2947                                         }
2948                                         COM_ParseToken_Simple(&data, false, false);
2949                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2950                                         COM_ParseToken_Simple(&data, false, false);
2951                                         //scroll_s = atof(com_token);
2952                                         COM_ParseToken_Simple(&data, false, false);
2953                                         //scroll_t = atof(com_token);
2954                                         COM_ParseToken_Simple(&data, false, false);
2955                                         //rotate = atof(com_token);
2956                                         COM_ParseToken_Simple(&data, false, false);
2957                                         //scale_s = atof(com_token);
2958                                         COM_ParseToken_Simple(&data, false, false);
2959                                         //scale_t = atof(com_token);
2960                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2961                                         VectorNormalizeDouble(planenormal);
2962                                         planedist = DotProduct(point[0], planenormal);
2963                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2964                                 }
2965                                 continue;
2966                         }
2967                 }
2968         }
2969 #endif
2970 }
2971
2972
2973 #define MAX_PORTALPOINTS 64
2974
2975 typedef struct portal_s
2976 {
2977         mplane_t plane;
2978         mnode_t *nodes[2];              // [0] = front side of plane
2979         struct portal_s *next[2];
2980         int numpoints;
2981         double points[3*MAX_PORTALPOINTS];
2982         struct portal_s *chain; // all portals are linked into a list
2983 }
2984 portal_t;
2985
2986 static portal_t *portalchain;
2987
2988 /*
2989 ===========
2990 AllocPortal
2991 ===========
2992 */
2993 static portal_t *AllocPortal(void)
2994 {
2995         portal_t *p;
2996         p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2997         p->chain = portalchain;
2998         portalchain = p;
2999         return p;
3000 }
3001
3002 static void FreePortal(portal_t *p)
3003 {
3004         Mem_Free(p);
3005 }
3006
3007 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
3008 {
3009         // process only nodes (leafs already had their box calculated)
3010         if (!node->plane)
3011                 return;
3012
3013         // calculate children first
3014         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
3015         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
3016
3017         // make combined bounding box from children
3018         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
3019         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
3020         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
3021         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
3022         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
3023         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
3024 }
3025
3026 static void Mod_Q1BSP_FinalizePortals(void)
3027 {
3028         int i, j, numportals, numpoints;
3029         portal_t *p, *pnext;
3030         mportal_t *portal;
3031         mvertex_t *point;
3032         mleaf_t *leaf, *endleaf;
3033
3034         // tally up portal and point counts and recalculate bounding boxes for all
3035         // leafs (because qbsp is very sloppy)
3036         leaf = loadmodel->brush.data_leafs;
3037         endleaf = leaf + loadmodel->brush.num_leafs;
3038         for (;leaf < endleaf;leaf++)
3039         {
3040                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
3041                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3042         }
3043         p = portalchain;
3044         numportals = 0;
3045         numpoints = 0;
3046         while (p)
3047         {
3048                 // note: this check must match the one below or it will usually corrupt memory
3049                 // 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
3050                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3051                 {
3052                         numportals += 2;
3053                         numpoints += p->numpoints * 2;
3054                 }
3055                 p = p->chain;
3056         }
3057         loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3058         loadmodel->brush.num_portals = numportals;
3059         loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3060         loadmodel->brush.num_portalpoints = numpoints;
3061         // clear all leaf portal chains
3062         for (i = 0;i < loadmodel->brush.num_leafs;i++)
3063                 loadmodel->brush.data_leafs[i].portals = NULL;
3064         // process all portals in the global portal chain, while freeing them
3065         portal = loadmodel->brush.data_portals;
3066         point = loadmodel->brush.data_portalpoints;
3067         p = portalchain;
3068         portalchain = NULL;
3069         while (p)
3070         {
3071                 pnext = p->chain;
3072
3073                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3074                 {
3075                         // note: this check must match the one above or it will usually corrupt memory
3076                         // 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
3077                         if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3078                         {
3079                                 // first make the back to front portal(forward portal)
3080                                 portal->points = point;
3081                                 portal->numpoints = p->numpoints;
3082                                 portal->plane.dist = p->plane.dist;
3083                                 VectorCopy(p->plane.normal, portal->plane.normal);
3084                                 portal->here = (mleaf_t *)p->nodes[1];
3085                                 portal->past = (mleaf_t *)p->nodes[0];
3086                                 // copy points
3087                                 for (j = 0;j < portal->numpoints;j++)
3088                                 {
3089                                         VectorCopy(p->points + j*3, point->position);
3090                                         point++;
3091                                 }
3092                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3093                                 PlaneClassify(&portal->plane);
3094
3095                                 // link into leaf's portal chain
3096                                 portal->next = portal->here->portals;
3097                                 portal->here->portals = portal;
3098
3099                                 // advance to next portal
3100                                 portal++;
3101
3102                                 // then make the front to back portal(backward portal)
3103                                 portal->points = point;
3104                                 portal->numpoints = p->numpoints;
3105                                 portal->plane.dist = -p->plane.dist;
3106                                 VectorNegate(p->plane.normal, portal->plane.normal);
3107                                 portal->here = (mleaf_t *)p->nodes[0];
3108                                 portal->past = (mleaf_t *)p->nodes[1];
3109                                 // copy points
3110                                 for (j = portal->numpoints - 1;j >= 0;j--)
3111                                 {
3112                                         VectorCopy(p->points + j*3, point->position);
3113                                         point++;
3114                                 }
3115                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3116                                 PlaneClassify(&portal->plane);
3117
3118                                 // link into leaf's portal chain
3119                                 portal->next = portal->here->portals;
3120                                 portal->here->portals = portal;
3121
3122                                 // advance to next portal
3123                                 portal++;
3124                         }
3125                         // add the portal's polygon points to the leaf bounding boxes
3126                         for (i = 0;i < 2;i++)
3127                         {
3128                                 leaf = (mleaf_t *)p->nodes[i];
3129                                 for (j = 0;j < p->numpoints;j++)
3130                                 {
3131                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3132                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3133                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3134                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3135                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3136                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3137                                 }
3138                         }
3139                 }
3140                 FreePortal(p);
3141                 p = pnext;
3142         }
3143         // now recalculate the node bounding boxes from the leafs
3144         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3145 }
3146
3147 /*
3148 =============
3149 AddPortalToNodes
3150 =============
3151 */
3152 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3153 {
3154         if (!front)
3155                 Host_Error("AddPortalToNodes: NULL front node");
3156         if (!back)
3157                 Host_Error("AddPortalToNodes: NULL back node");
3158         if (p->nodes[0] || p->nodes[1])
3159                 Host_Error("AddPortalToNodes: already included");
3160         // 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
3161
3162         p->nodes[0] = front;
3163         p->next[0] = (portal_t *)front->portals;
3164         front->portals = (mportal_t *)p;
3165
3166         p->nodes[1] = back;
3167         p->next[1] = (portal_t *)back->portals;
3168         back->portals = (mportal_t *)p;
3169 }
3170
3171 /*
3172 =============
3173 RemovePortalFromNode
3174 =============
3175 */
3176 static void RemovePortalFromNodes(portal_t *portal)
3177 {
3178         int i;
3179         mnode_t *node;
3180         void **portalpointer;
3181         portal_t *t;
3182         for (i = 0;i < 2;i++)
3183         {
3184                 node = portal->nodes[i];
3185
3186                 portalpointer = (void **) &node->portals;
3187                 while (1)
3188                 {
3189                         t = (portal_t *)*portalpointer;
3190                         if (!t)
3191                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
3192
3193                         if (t == portal)
3194                         {
3195                                 if (portal->nodes[0] == node)
3196                                 {
3197                                         *portalpointer = portal->next[0];
3198                                         portal->nodes[0] = NULL;
3199                                 }
3200                                 else if (portal->nodes[1] == node)
3201                                 {
3202                                         *portalpointer = portal->next[1];
3203                                         portal->nodes[1] = NULL;
3204                                 }
3205                                 else
3206                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3207                                 break;
3208                         }
3209
3210                         if (t->nodes[0] == node)
3211                                 portalpointer = (void **) &t->next[0];
3212                         else if (t->nodes[1] == node)
3213                                 portalpointer = (void **) &t->next[1];
3214                         else
3215                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3216                 }
3217         }
3218 }
3219
3220 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3221 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3222 {
3223         int i, side;
3224         mnode_t *front, *back, *other_node;
3225         mplane_t clipplane, *plane;
3226         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3227         int numfrontpoints, numbackpoints;
3228         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3229
3230         // if a leaf, we're done
3231         if (!node->plane)
3232                 return;
3233
3234         plane = node->plane;
3235
3236         front = node->children[0];
3237         back = node->children[1];
3238         if (front == back)
3239                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3240
3241         // create the new portal by generating a polygon for the node plane,
3242         // and clipping it by all of the other portals(which came from nodes above this one)
3243         nodeportal = AllocPortal();
3244         nodeportal->plane = *plane;
3245
3246         // TODO: calculate node bounding boxes during recursion and calculate a maximum plane size accordingly to improve precision (as most maps do not need 1 billion unit plane polygons)
3247         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);
3248         nodeportal->numpoints = 4;
3249         side = 0;       // shut up compiler warning
3250         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3251         {
3252                 clipplane = portal->plane;
3253                 if (portal->nodes[0] == portal->nodes[1])
3254                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3255                 if (portal->nodes[0] == node)
3256                         side = 0;
3257                 else if (portal->nodes[1] == node)
3258                 {
3259                         clipplane.dist = -clipplane.dist;
3260                         VectorNegate(clipplane.normal, clipplane.normal);
3261                         side = 1;
3262                 }
3263                 else
3264                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3265
3266                 for (i = 0;i < nodeportal->numpoints*3;i++)
3267                         frontpoints[i] = nodeportal->points[i];
3268                 PolygonD_Divide(nodeportal->numpoints, frontpoints, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, nodeportal->points, &nodeportal->numpoints, 0, NULL, NULL, NULL);
3269                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3270                         break;
3271         }
3272
3273         if (nodeportal->numpoints < 3)
3274         {
3275                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3276                 nodeportal->numpoints = 0;
3277         }
3278         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3279         {
3280                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3281                 nodeportal->numpoints = 0;
3282         }
3283
3284         AddPortalToNodes(nodeportal, front, back);
3285
3286         // split the portals of this node along this node's plane and assign them to the children of this node
3287         // (migrating the portals downward through the tree)
3288         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3289         {
3290                 if (portal->nodes[0] == portal->nodes[1])
3291                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3292                 if (portal->nodes[0] == node)
3293                         side = 0;
3294                 else if (portal->nodes[1] == node)
3295                         side = 1;
3296                 else
3297                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3298                 nextportal = portal->next[side];
3299                 if (!portal->numpoints)
3300                         continue;
3301
3302                 other_node = portal->nodes[!side];
3303                 RemovePortalFromNodes(portal);
3304
3305                 // cut the portal into two portals, one on each side of the node plane
3306                 PolygonD_Divide(portal->numpoints, portal->points, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, frontpoints, &numfrontpoints, MAX_PORTALPOINTS, backpoints, &numbackpoints, NULL);
3307
3308                 if (!numfrontpoints)
3309                 {
3310                         if (side == 0)
3311                                 AddPortalToNodes(portal, back, other_node);
3312                         else
3313                                 AddPortalToNodes(portal, other_node, back);
3314                         continue;
3315                 }
3316                 if (!numbackpoints)
3317                 {
3318                         if (side == 0)
3319                                 AddPortalToNodes(portal, front, other_node);
3320                         else
3321                                 AddPortalToNodes(portal, other_node, front);
3322                         continue;
3323                 }
3324
3325                 // the portal is split
3326                 splitportal = AllocPortal();
3327                 temp = splitportal->chain;
3328                 *splitportal = *portal;
3329                 splitportal->chain = temp;
3330                 for (i = 0;i < numbackpoints*3;i++)
3331                         splitportal->points[i] = backpoints[i];
3332                 splitportal->numpoints = numbackpoints;
3333                 for (i = 0;i < numfrontpoints*3;i++)
3334                         portal->points[i] = frontpoints[i];
3335                 portal->numpoints = numfrontpoints;
3336
3337                 if (side == 0)
3338                 {
3339                         AddPortalToNodes(portal, front, other_node);
3340                         AddPortalToNodes(splitportal, back, other_node);
3341                 }
3342                 else
3343                 {
3344                         AddPortalToNodes(portal, other_node, front);
3345                         AddPortalToNodes(splitportal, other_node, back);
3346                 }