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                 }
3347         }
3348
3349         Mod_Q1BSP_RecursiveNodePortals(front);
3350         Mod_Q1BSP_RecursiveNodePortals(back);
3351 }
3352
3353 static void Mod_Q1BSP_MakePortals(void)
3354 {
3355         portalchain = NULL;
3356         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3357         Mod_Q1BSP_FinalizePortals();
3358 }
3359
3360 //Returns PVS data for a given point
3361 //(note: can return NULL)
3362 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3363 {
3364         mnode_t *node;
3365         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3366         while (node->plane)
3367                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3368         if (((mleaf_t *)node)->clusterindex >= 0)
3369                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3370         else
3371                 return NULL;
3372 }
3373
3374 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbytes, mnode_t *node)
3375 {
3376         while (node->plane)
3377         {
3378                 float d = PlaneDiff(org, node->plane);
3379                 if (d > radius)
3380                         node = node->children[0];
3381                 else if (d < -radius)
3382                         node = node->children[1];
3383                 else
3384                 {
3385                         // go down both sides
3386                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3387                         node = node->children[1];
3388                 }
3389         }
3390         // if this leaf is in a cluster, accumulate the pvs bits
3391         if (((mleaf_t *)node)->clusterindex >= 0)
3392         {
3393                 int i;
3394                 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3395                 for (i = 0;i < pvsbytes;i++)
3396                         pvsbuffer[i] |= pvs[i];
3397         }
3398 }
3399
3400 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3401 //of the given point.
3402 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3403 {
3404         int bytes = model->brush.num_pvsclusterbytes;
3405         bytes = min(bytes, pvsbufferlength);
3406         if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3407         {
3408                 memset(pvsbuffer, 0xFF, bytes);
3409                 return bytes;
3410         }
3411         if (!merge)
3412                 memset(pvsbuffer, 0, bytes);
3413         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3414         return bytes;
3415 }
3416
3417 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3418 {
3419         vec3_t size;
3420         const hull_t *hull;
3421
3422         VectorSubtract(inmaxs, inmins, size);
3423         if (cmodel->brush.ishlbsp)
3424         {
3425                 if (size[0] < 3)
3426                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3427                 else if (size[0] <= 32)
3428                 {
3429                         if (size[2] < 54) // pick the nearest of 36 or 72
3430                                 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3431                         else
3432                                 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3433                 }
3434                 else
3435                         hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3436         }
3437         else
3438         {
3439                 if (size[0] < 3)
3440                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3441                 else if (size[0] <= 32)
3442                         hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3443                 else
3444                         hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3445         }
3446         VectorCopy(inmins, outmins);
3447         VectorAdd(inmins, hull->clip_size, outmaxs);
3448 }
3449
3450 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3451 {
3452         int i, j, k;
3453         dheader_t *header;
3454         dmodel_t *bm;
3455         mempool_t *mainmempool;
3456         float dist, modelyawradius, modelradius;
3457         msurface_t *surface;
3458         int numshadowmeshtriangles;
3459         hullinfo_t hullinfo;
3460         int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3461         model_brush_lightstyleinfo_t styleinfo[256];
3462         unsigned char *datapointer;
3463
3464         mod->modeldatatypestring = "Q1BSP";
3465
3466         mod->type = mod_brushq1;
3467
3468         header = (dheader_t *)buffer;
3469
3470         i = LittleLong(header->version);
3471         if (i != BSPVERSION && i != 30)
3472                 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3473         mod->brush.ishlbsp = i == 30;
3474
3475 // fill in hull info
3476         VectorClear (hullinfo.hullsizes[0][0]);
3477         VectorClear (hullinfo.hullsizes[0][1]);
3478         if (mod->brush.ishlbsp)
3479         {
3480                 mod->modeldatatypestring = "HLBSP";
3481
3482                 hullinfo.filehulls = 4;
3483                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3484                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3485                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3486                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3487                 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3488                 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3489         }
3490         else
3491         {
3492                 hullinfo.filehulls = 4;
3493                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3494                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3495                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3496                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3497         }
3498
3499 // read lumps
3500         mod_base = (unsigned char*)buffer;
3501         for (i = 0; i < HEADER_LUMPS; i++)
3502         {
3503                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3504                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3505         }
3506
3507         mod->soundfromcenter = true;
3508         mod->TraceBox = Mod_Q1BSP_TraceBox;
3509         mod->TraceLine = Mod_Q1BSP_TraceLine;
3510         mod->TracePoint = Mod_Q1BSP_TracePoint;
3511         mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3512         mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3513         mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3514         mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3515         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3516         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3517         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3518         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3519         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3520         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3521         mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3522         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3523         mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3524         mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3525         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3526         mod->Draw = R_Q1BSP_Draw;
3527         mod->DrawDepth = R_Q1BSP_DrawDepth;
3528         mod->DrawDebug = R_Q1BSP_DrawDebug;
3529         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3530         mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3531         mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3532         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3533         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3534         mod->DrawLight = R_Q1BSP_DrawLight;
3535
3536 // load into heap
3537
3538         mod->brush.qw_md4sum = 0;
3539         mod->brush.qw_md4sum2 = 0;
3540         for (i = 0;i < HEADER_LUMPS;i++)
3541         {
3542                 if (i == LUMP_ENTITIES)
3543                         continue;
3544                 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3545                 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3546                         continue;
3547                 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3548         }
3549
3550         Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3551         Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3552         Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3553         Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3554         Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3555         Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3556         Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3557         Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3558         Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3559         Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3560         Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3561         // load submodels before leafs because they contain the number of vis leafs
3562         Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3563         Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3564         Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3565         Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3566
3567         // check if the map supports transparent water rendering
3568         loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3569
3570         if (mod->brushq1.data_compressedpvs)
3571                 Mem_Free(mod->brushq1.data_compressedpvs);
3572         mod->brushq1.data_compressedpvs = NULL;
3573         mod->brushq1.num_compressedpvs = 0;
3574
3575         Mod_Q1BSP_MakeHull0();
3576         Mod_Q1BSP_MakePortals();
3577
3578         mod->numframes = 2;             // regular and alternate animation
3579         mod->numskins = 1;
3580
3581         mainmempool = mod->mempool;
3582
3583         // make a single combined shadow mesh to allow optimized shadow volume creation
3584         numshadowmeshtriangles = 0;
3585         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3586         {
3587                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3588                 numshadowmeshtriangles += surface->num_triangles;
3589         }
3590         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3591         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3592                 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, loadmodel->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
3593         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3594         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3595
3596         if (loadmodel->brush.numsubmodels)
3597                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3598
3599         // LordHavoc: to clear the fog around the original quake submodel code, I
3600         // will explain:
3601         // first of all, some background info on the submodels:
3602         // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3603         // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3604         // now the weird for loop itself:
3605         // the loop functions in an odd way, on each iteration it sets up the
3606         // current 'mod' model (which despite the confusing code IS the model of
3607         // the number i), at the end of the loop it duplicates the model to become
3608         // the next submodel, and loops back to set up the new submodel.
3609
3610         // LordHavoc: now the explanation of my sane way (which works identically):
3611         // set up the world model, then on each submodel copy from the world model
3612         // and set up the submodel with the respective model info.
3613         totalstylesurfaces = 0;
3614         totalstyles = 0;
3615         for (i = 0;i < mod->brush.numsubmodels;i++)
3616         {
3617                 memset(stylecounts, 0, sizeof(stylecounts));
3618                 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3619                 {
3620                         surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3621                         for (j = 0;j < MAXLIGHTMAPS;j++)
3622                                 stylecounts[surface->lightmapinfo->styles[j]]++;
3623                 }
3624                 for (k = 0;k < 255;k++)
3625                 {
3626                         totalstyles++;
3627                         if (stylecounts[k])
3628                                 totalstylesurfaces += stylecounts[k];
3629                 }
3630         }
3631         datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3632         for (i = 0;i < mod->brush.numsubmodels;i++)
3633         {
3634                 // LordHavoc: this code was originally at the end of this loop, but
3635                 // has been transformed to something more readable at the start here.
3636
3637                 if (i > 0)
3638                 {
3639                         char name[10];
3640                         // duplicate the basic information
3641                         dpsnprintf(name, sizeof(name), "*%i", i);
3642                         mod = Mod_FindName(name, loadmodel->name);
3643                         // copy the base model to this one
3644                         *mod = *loadmodel;
3645                         // rename the clone back to its proper name
3646                         strlcpy(mod->name, name, sizeof(mod->name));
3647                         mod->brush.parentmodel = loadmodel;
3648                         // textures and memory belong to the main model
3649                         mod->texturepool = NULL;
3650                         mod->mempool = NULL;
3651                         mod->brush.GetPVS = NULL;
3652                         mod->brush.FatPVS = NULL;
3653                         mod->brush.BoxTouchingPVS = NULL;
3654                         mod->brush.BoxTouchingLeafPVS = NULL;
3655                         mod->brush.BoxTouchingVisibleLeafs = NULL;
3656                         mod->brush.FindBoxClusters = NULL;
3657                         mod->brush.LightPoint = NULL;
3658                         mod->brush.AmbientSoundLevelsForPoint = NULL;
3659                 }
3660
3661                 mod->brush.submodel = i;
3662
3663                 if (loadmodel->brush.submodels)
3664                         loadmodel->brush.submodels[i] = mod;
3665
3666                 bm = &mod->brushq1.submodels[i];
3667
3668                 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3669                 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3670                 {
3671                         mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3672                         mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3673                 }
3674
3675                 mod->firstmodelsurface = bm->firstface;
3676                 mod->nummodelsurfaces = bm->numfaces;
3677
3678                 // set node/leaf parents for this submodel
3679                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
3680
3681                 // make the model surface list (used by shadowing/lighting)
3682                 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3683                 Mod_MakeSortedSurfaces(mod);
3684
3685                 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3686                 // (previously this code measured the radius of the vertices of surfaces in the submodel, but that broke submodels that contain only CLIP brushes, which do not produce surfaces)
3687                 VectorCopy(bm->mins, mod->normalmins);
3688                 VectorCopy(bm->maxs, mod->normalmaxs);
3689                 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3690                 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3691                 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3692                 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3693                 modelradius = modelyawradius + modelradius * modelradius;
3694                 modelyawradius = sqrt(modelyawradius);
3695                 modelradius = sqrt(modelradius);
3696                 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3697                 mod->yawmins[2] = mod->normalmins[2];
3698                 mod->yawmaxs[0] = mod->yawmaxs[1] =  modelyawradius;
3699                 mod->yawmaxs[2] = mod->normalmaxs[2];
3700                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3701                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] =  modelradius;
3702                 mod->radius = modelradius;
3703                 mod->radius2 = modelradius * modelradius;
3704
3705                 // this gets altered below if sky or water is used
3706                 mod->DrawSky = NULL;
3707                 mod->DrawAddWaterPlanes = NULL;
3708
3709                 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3710                 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3711                 if (mod->nummodelsurfaces)
3712                 {
3713                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3714                                 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3715                                         break;
3716                         if (j < mod->nummodelsurfaces)
3717                                 mod->DrawSky = R_Q1BSP_DrawSky;
3718
3719                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3720                                 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3721                                         break;
3722                         if (j < mod->nummodelsurfaces)
3723                                 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3724
3725                         // build lightstyle update chains
3726                         // (used to rapidly mark lightmapupdateflags on many surfaces
3727                         // when d_lightstylevalue changes)
3728                         memset(stylecounts, 0, sizeof(stylecounts));
3729                         for (k = 0;k < mod->nummodelsurfaces;k++)
3730                         {
3731                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3732                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3733                                         stylecounts[surface->lightmapinfo->styles[j]]++;
3734                         }
3735                         mod->brushq1.num_lightstyles = 0;
3736                         for (k = 0;k < 255;k++)
3737                         {
3738                                 if (stylecounts[k])
3739                                 {
3740                                         styleinfo[mod->brushq1.num_lightstyles].style = k;
3741                                         styleinfo[mod->brushq1.num_lightstyles].value = 0;
3742                                         styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3743                                         styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3744                                         remapstyles[k] = mod->brushq1.num_lightstyles;
3745                                         mod->brushq1.num_lightstyles++;
3746                                 }
3747                         }
3748                         for (k = 0;k < mod->nummodelsurfaces;k++)
3749                         {
3750                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3751                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3752                                 {
3753                                         if (surface->lightmapinfo->styles[j] != 255)
3754                                         {
3755                                                 int r = remapstyles[surface->lightmapinfo->styles[j]];
3756                                                 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3757                                         }
3758                                 }
3759                         }
3760                         mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3761                         memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3762                 }
3763                 else
3764                 {
3765                         // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3766                         Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3767                 }
3768                 //mod->brushq1.num_visleafs = bm->visleafs;
3769         }
3770
3771         Mod_Q1BSP_LoadMapBrushes();
3772
3773         //Mod_Q1BSP_ProcessLightList();
3774
3775         if (developer.integer >= 10)
3776                 Con_Printf("Some stats for q1bsp model \"%s\": %i faces, %i nodes, %i leafs, %i visleafs, %i visleafportals\n", loadmodel->name, loadmodel->num_surfaces, loadmodel->brush.num_nodes, loadmodel->brush.num_leafs, mod->brush.num_pvsclusters, loadmodel->brush.num_portals);
3777 }
3778
3779 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3780 {
3781 }
3782
3783 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3784 {
3785 /*
3786         d_t *in;
3787         m_t *out;
3788         int i, count;
3789
3790         in = (void *)(mod_base + l->fileofs);
3791         if (l->filelen % sizeof(*in))
3792                 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3793         count = l->filelen / sizeof(*in);
3794         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3795
3796         loadmodel-> = out;
3797         loadmodel->num = count;
3798
3799         for (i = 0;i < count;i++, in++, out++)
3800         {
3801         }
3802 */
3803 }
3804
3805 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3806 {
3807 /*
3808         d_t *in;
3809         m_t *out;
3810         int i, count;
3811
3812         in = (void *)(mod_base + l->fileofs);
3813         if (l->filelen % sizeof(*in))
3814                 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3815         count = l->filelen / sizeof(*in);
3816         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3817
3818         loadmodel-> = out;
3819         loadmodel->num = count;
3820
3821         for (i = 0;i < count;i++, in++, out++)
3822         {
3823         }
3824 */
3825 }
3826
3827 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3828 {
3829 /*
3830         d_t *in;
3831         m_t *out;
3832         int i, count;
3833
3834         in = (void *)(mod_base + l->fileofs);
3835         if (l->filelen % sizeof(*in))
3836                 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3837         count = l->filelen / sizeof(*in);
3838         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3839
3840         loadmodel-> = out;
3841         loadmodel->num = count;
3842
3843         for (i = 0;i < count;i++, in++, out++)
3844         {
3845         }
3846 */
3847 }
3848
3849 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3850 {
3851 /*
3852         d_t *in;
3853         m_t *out;
3854         int i, count;
3855
3856         in = (void *)(mod_base + l->fileofs);
3857         if (l->filelen % sizeof(*in))
3858                 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3859         count = l->filelen / sizeof(*in);
3860         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3861
3862         loadmodel-> = out;
3863         loadmodel->num = count;
3864
3865         for (i = 0;i < count;i++, in++, out++)
3866         {
3867         }
3868 */
3869 }
3870
3871 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3872 {
3873 /*
3874         d_t *in;
3875         m_t *out;
3876         int i, count;
3877
3878         in = (void *)(mod_base + l->fileofs);
3879         if (l->filelen % sizeof(*in))
3880                 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3881         count = l->filelen / sizeof(*in);
3882         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3883
3884         loadmodel-> = out;
3885         loadmodel->num = count;
3886
3887         for (i = 0;i < count;i++, in++, out++)
3888         {
3889         }
3890 */
3891 }
3892
3893 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3894 {
3895 /*
3896         d_t *in;
3897         m_t *out;
3898         int i, count;
3899
3900         in = (void *)(mod_base + l->fileofs);
3901         if (l->filelen % sizeof(*in))
3902                 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3903         count = l->filelen / sizeof(*in);
3904         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3905
3906         loadmodel-> = out;
3907         loadmodel->num = count;
3908
3909         for (i = 0;i < count;i++, in++, out++)
3910         {
3911         }
3912 */
3913 }
3914
3915 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3916 {
3917 /*
3918         d_t *in;
3919         m_t *out;
3920         int i, count;
3921
3922         in = (void *)(mod_base + l->fileofs);
3923         if (l->filelen % sizeof(*in))
3924                 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3925         count = l->filelen / sizeof(*in);
3926         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3927
3928         loadmodel-> = out;
3929         loadmodel->num = count;
3930
3931         for (i = 0;i < count;i++, in++, out++)
3932         {
3933         }
3934 */
3935 }
3936
3937 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3938 {
3939 /*
3940         d_t *in;
3941         m_t *out;
3942         int i, count;
3943
3944         in = (void *)(mod_base + l->fileofs);
3945         if (l->filelen % sizeof(*in))
3946                 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3947         count = l->filelen / sizeof(*in);
3948         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3949
3950         loadmodel-> = out;
3951         loadmodel->num = count;
3952
3953         for (i = 0;i < count;i++, in++, out++)
3954         {
3955         }
3956 */
3957 }
3958
3959 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3960 {
3961 /*
3962         d_t *in;
3963         m_t *out;
3964         int i, count;
3965
3966         in = (void *)(mod_base + l->fileofs);
3967         if (l->filelen % sizeof(*in))
3968                 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3969         count = l->filelen / sizeof(*in);
3970         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3971
3972         loadmodel-> = out;
3973         loadmodel->num = count;
3974
3975         for (i = 0;i < count;i++, in++, out++)
3976         {
3977         }
3978 */
3979 }
3980
3981 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3982 {
3983 /*
3984         d_t *in;
3985         m_t *out;
3986         int i, count;
3987
3988         in = (void *)(mod_base + l->fileofs);
3989         if (l->filelen % sizeof(*in))
3990                 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3991         count = l->filelen / sizeof(*in);
3992         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3993
3994         loadmodel-> = out;
3995         loadmodel->num = count;
3996
3997         for (i = 0;i < count;i++, in++, out++)
3998         {
3999         }
4000 */
4001 }
4002
4003 static void Mod_Q2BSP_LoadEdges(lump_t *l)
4004 {
4005 /*
4006         d_t *in;
4007         m_t *out;
4008         int i, count;
4009
4010         in = (void *)(mod_base + l->fileofs);
4011         if (l->filelen % sizeof(*in))
4012                 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
4013         count = l->filelen / sizeof(*in);
4014         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4015
4016         loadmodel-> = out;
4017         loadmodel->num = count;
4018
4019         for (i = 0;i < count;i++, in++, out++)
4020         {
4021         }
4022 */
4023 }
4024
4025 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
4026 {
4027 /*
4028         d_t *in;
4029         m_t *out;
4030         int i, count;
4031
4032         in = (void *)(mod_base + l->fileofs);
4033         if (l->filelen % sizeof(*in))
4034                 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
4035         count = l->filelen / sizeof(*in);
4036         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4037
4038         loadmodel-> = out;
4039         loadmodel->num = count;
4040
4041         for (i = 0;i < count;i++, in++, out++)
4042         {
4043         }
4044 */
4045 }
4046
4047 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4048 {
4049 /*
4050         d_t *in;
4051         m_t *out;
4052         int i, count;
4053
4054         in = (void *)(mod_base + l->fileofs);
4055         if (l->filelen % sizeof(*in))
4056                 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4057         count = l->filelen / sizeof(*in);
4058         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4059
4060         loadmodel-> = out;
4061         loadmodel->num = count;
4062
4063         for (i = 0;i < count;i++, in++, out++)
4064         {
4065         }
4066 */
4067 }
4068
4069 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4070 {
4071 /*
4072         d_t *in;
4073         m_t *out;
4074         int i, count;
4075
4076         in = (void *)(mod_base + l->fileofs);
4077         if (l->filelen % sizeof(*in))
4078                 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4079         count = l->filelen / sizeof(*in);
4080         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4081
4082         loadmodel-> = out;
4083         loadmodel->num = count;
4084
4085         for (i = 0;i < count;i++, in++, out++)
4086         {
4087         }
4088 */
4089 }
4090
4091 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4092 {
4093 /*
4094         d_t *in;
4095         m_t *out;
4096         int i, count;
4097
4098         in = (void *)(mod_base + l->fileofs);
4099         if (l->filelen % sizeof(*in))
4100                 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4101         count = l->filelen / sizeof(*in);
4102         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4103
4104         loadmodel-> = out;
4105         loadmodel->num = count;
4106
4107         for (i = 0;i < count;i++, in++, out++)
4108         {
4109         }
4110 */
4111 }
4112
4113 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4114 {
4115 /*
4116         d_t *in;
4117         m_t *out;
4118         int i, count;
4119
4120         in = (void *)(mod_base + l->fileofs);
4121         if (l->filelen % sizeof(*in))
4122                 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4123         count = l->filelen / sizeof(*in);
4124         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4125
4126         loadmodel-> = out;
4127         loadmodel->num = count;
4128
4129         for (i = 0;i < count;i++, in++, out++)
4130         {
4131         }
4132 */
4133 }
4134
4135 static void Mod_Q2BSP_LoadModels(lump_t *l)
4136 {
4137 /*
4138         d_t *in;
4139         m_t *out;
4140         int i, count;
4141
4142         in = (void *)(mod_base + l->fileofs);
4143         if (l->filelen % sizeof(*in))
4144                 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4145         count = l->filelen / sizeof(*in);
4146         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4147
4148         loadmodel-> = out;
4149         loadmodel->num = count;
4150
4151         for (i = 0;i < count;i++, in++, out++)
4152         {
4153         }
4154 */
4155 }
4156
4157 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4158 {
4159         int i;
4160         q2dheader_t *header;
4161
4162         Host_Error("Mod_Q2BSP_Load: not yet implemented");
4163
4164         mod->modeldatatypestring = "Q2BSP";
4165
4166         mod->type = mod_brushq2;
4167
4168         header = (q2dheader_t *)buffer;
4169
4170         i = LittleLong(header->version);
4171         if (i != Q2BSPVERSION)
4172                 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4173
4174         mod_base = (unsigned char *)header;
4175
4176         // swap all the lumps
4177         for (i = 0;i < (int) sizeof(*header) / 4;i++)
4178                 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4179
4180         mod->brush.qw_md4sum = 0;
4181         mod->brush.qw_md4sum2 = 0;
4182         for (i = 0;i < Q2HEADER_LUMPS;i++)
4183         {
4184                 if (i == Q2LUMP_ENTITIES)
4185                         continue;
4186                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4187                 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4188                         continue;
4189                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4190         }
4191
4192         Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4193         Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4194         Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4195         Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4196         Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4197         Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4198         Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4199         Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4200         Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4201         Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4202         Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4203         Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4204         Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4205         Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4206         Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4207         Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4208         Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4209         // LordHavoc: must go last because this makes the submodels
4210         Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4211 }
4212
4213 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4214 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4215
4216 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4217 {
4218         const char *data;
4219         char key[128], value[MAX_INPUTLINE];
4220         float v[3];
4221         loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4222         loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4223         loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4224         if (!l->filelen)
4225                 return;
4226         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4227         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4228         loadmodel->brush.entities[l->filelen] = 0;
4229         data = loadmodel->brush.entities;
4230         // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4231         // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
4232         loadmodel->brushq3.deluxemapping = false;
4233         if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4234         {
4235                 while (1)
4236                 {
4237                         if (!COM_ParseToken_Simple(&data, false, false))
4238                                 break; // error
4239                         if (com_token[0] == '}')
4240                                 break; // end of worldspawn
4241                         if (com_token[0] == '_')
4242                                 strlcpy(key, com_token + 1, sizeof(key));
4243                         else
4244                                 strlcpy(key, com_token, sizeof(key));
4245                         while (key[strlen(key)-1] == ' ') // remove trailing spaces
4246                                 key[strlen(key)-1] = 0;
4247                         if (!COM_ParseToken_Simple(&data, false, false))
4248                                 break; // error
4249                         strlcpy(value, com_token, sizeof(value));
4250                         if (!strcmp("gridsize", key))
4251                         {
4252 #if _MSC_VER >= 1400
4253 #define sscanf sscanf_s
4254 #endif
4255                                 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4256                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4257                         }
4258                         else if (!strcmp("deluxeMaps", key))
4259                         {
4260                                 if (!strcmp(com_token, "1"))
4261                                 {
4262                                         loadmodel->brushq3.deluxemapping = true;
4263                                         loadmodel->brushq3.deluxemapping_modelspace = true;
4264                                 }
4265                                 else if (!strcmp(com_token, "2"))
4266                                 {
4267                                         loadmodel->brushq3.deluxemapping = true;
4268                                         loadmodel->brushq3.deluxemapping_modelspace = false;
4269                                 }
4270                         }
4271                 }
4272         }
4273 }
4274
4275 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4276 {
4277         q3dtexture_t *in;
4278         texture_t *out;
4279         int i, count;
4280
4281         in = (q3dtexture_t *)(mod_base + l->fileofs);
4282         if (l->filelen % sizeof(*in))
4283                 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4284         count = l->filelen / sizeof(*in);
4285         out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4286
4287         loadmodel->data_textures = out;
4288         loadmodel->num_textures = count;
4289         loadmodel->num_texturesperskin = loadmodel->num_textures;
4290
4291         for (i = 0;i < count;i++)
4292         {
4293                 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4294                 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4295                 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4296         }
4297
4298         if (cls.state == ca_dedicated)
4299                 return;
4300
4301         for (i = 0;i < count;i++, in++, out++)
4302                 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4303 }
4304
4305 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4306 {
4307         q3dplane_t *in;
4308         mplane_t *out;
4309         int i, count;
4310
4311         in = (q3dplane_t *)(mod_base + l->fileofs);
4312         if (l->filelen % sizeof(*in))
4313                 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4314         count = l->filelen / sizeof(*in);
4315         out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4316
4317         loadmodel->brush.data_planes = out;
4318         loadmodel->brush.num_planes = count;
4319
4320         for (i = 0;i < count;i++, in++, out++)
4321         {
4322                 out->normal[0] = LittleFloat(in->normal[0]);
4323                 out->normal[1] = LittleFloat(in->normal[1]);
4324                 out->normal[2] = LittleFloat(in->normal[2]);
4325                 out->dist = LittleFloat(in->dist);
4326                 PlaneClassify(out);
4327         }
4328 }
4329
4330 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4331 {
4332         q3dbrushside_t *in;
4333         q3mbrushside_t *out;
4334         int i, n, count;
4335
4336         in = (q3dbrushside_t *)(mod_base + l->fileofs);
4337         if (l->filelen % sizeof(*in))
4338                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4339         count = l->filelen / sizeof(*in);
4340         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4341
4342         loadmodel->brush.data_brushsides = out;
4343         loadmodel->brush.num_brushsides = count;
4344
4345         for (i = 0;i < count;i++, in++, out++)
4346         {
4347                 n = LittleLong(in->planeindex);
4348                 if (n < 0 || n >= loadmodel->brush.num_planes)
4349                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4350                 out->plane = loadmodel->brush.data_planes + n;
4351                 n = LittleLong(in->textureindex);
4352                 if (n < 0 || n >= loadmodel->num_textures)
4353                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4354                 out->texture = loadmodel->data_textures + n;
4355         }
4356 }
4357
4358 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4359 {
4360         q3dbrushside_ig_t *in;
4361         q3mbrushside_t *out;
4362         int i, n, count;
4363
4364         in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4365         if (l->filelen % sizeof(*in))
4366                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4367         count = l->filelen / sizeof(*in);
4368         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4369
4370         loadmodel->brush.data_brushsides = out;
4371         loadmodel->brush.num_brushsides = count;
4372
4373         for (i = 0;i < count;i++, in++, out++)
4374         {
4375                 n = LittleLong(in->planeindex);
4376                 if (n < 0 || n >= loadmodel->brush.num_planes)
4377                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4378                 out->plane = loadmodel->brush.data_planes + n;
4379                 n = LittleLong(in->textureindex);
4380                 if (n < 0 || n >= loadmodel->num_textures)
4381                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4382                 out->texture = loadmodel->data_textures + n;
4383         }
4384 }
4385
4386 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4387 {
4388         q3dbrush_t *in;
4389         q3mbrush_t *out;
4390         int i, j, n, c, count, maxplanes, q3surfaceflags;
4391         colplanef_t *planes;
4392
4393         in = (q3dbrush_t *)(mod_base + l->fileofs);
4394         if (l->filelen % sizeof(*in))
4395                 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4396         count = l->filelen / sizeof(*in);
4397         out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4398
4399         loadmodel->brush.data_brushes = out;
4400         loadmodel->brush.num_brushes = count;
4401
4402         maxplanes = 0;
4403         planes = NULL;
4404
4405         for (i = 0;i < count;i++, in++, out++)
4406         {
4407                 n = LittleLong(in->firstbrushside);
4408                 c = LittleLong(in->numbrushsides);
4409                 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4410                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4411                 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4412                 out->numbrushsides = c;
4413                 n = LittleLong(in->textureindex);
4414                 if (n < 0 || n >= loadmodel->num_textures)
4415                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4416                 out->texture = loadmodel->data_textures + n;
4417
4418                 // make a list of mplane_t structs to construct a colbrush from
4419                 if (maxplanes < out->numbrushsides)
4420                 {
4421                         maxplanes = out->numbrushsides;
4422                         if (planes)
4423                                 Mem_Free(planes);
4424                         planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4425                 }
4426                 q3surfaceflags = 0;
4427                 for (j = 0;j < out->numbrushsides;j++)
4428                 {
4429                         VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4430                         planes[j].dist = out->firstbrushside[j].plane->dist;
4431                         planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4432                         planes[j].texture = out->firstbrushside[j].texture;
4433                         q3surfaceflags |= planes[j].q3surfaceflags;
4434                 }
4435                 // make the colbrush from the planes
4436                 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4437
4438                 // this whole loop can take a while (e.g. on redstarrepublic4)
4439                 CL_KeepaliveMessage(false);
4440         }
4441         if (planes)
4442                 Mem_Free(planes);
4443 }
4444
4445 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4446 {
4447         q3deffect_t *in;
4448         q3deffect_t *out;
4449         int i, n, count;
4450
4451         in = (q3deffect_t *)(mod_base + l->fileofs);
4452         if (l->filelen % sizeof(*in))
4453                 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4454         count = l->filelen / sizeof(*in);
4455         out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4456
4457         loadmodel->brushq3.data_effects = out;
4458         loadmodel->brushq3.num_effects = count;
4459
4460         for (i = 0;i < count;i++, in++, out++)
4461         {
4462                 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4463                 n = LittleLong(in->brushindex);
4464                 if (n >= loadmodel->brush.num_brushes)
4465                 {
4466                         Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4467                         n = -1;
4468                 }
4469                 out->brushindex = n;
4470                 out->unknown = LittleLong(in->unknown);
4471         }
4472 }
4473
4474 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4475 {
4476         q3dvertex_t *in;
4477         int i, count;
4478
4479         in = (q3dvertex_t *)(mod_base + l->fileofs);
4480         if (l->filelen % sizeof(*in))
4481                 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4482         loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4483         loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4484         loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4485         loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4486         loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4487         loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4488
4489         for (i = 0;i < count;i++, in++)
4490         {
4491                 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4492                 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4493                 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4494                 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4495                 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4496                 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4497                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4498                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4499                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4500                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4501                 // svector/tvector are calculated later in face loading
4502                 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4503                 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4504                 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4505                 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4506         }
4507 }
4508
4509 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4510 {
4511         int *in;
4512         int *out;
4513         int i, count;
4514
4515         in = (int *)(mod_base + l->fileofs);
4516         if (l->filelen % sizeof(int[3]))
4517                 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4518         count = l->filelen / sizeof(*in);
4519         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4520
4521         loadmodel->brushq3.num_triangles = count / 3;
4522         loadmodel->brushq3.data_element3i = out;
4523
4524         for (i = 0;i < count;i++, in++, out++)
4525         {
4526                 *out = LittleLong(*in);
4527                 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4528                 {
4529                         Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4530                         if(!loadmodel->brushq3.num_vertices)
4531                                 Host_Error("Mod_Q1BSP_LoadTrianglles: %s has triangles but no vertexes, cannot fix\n", loadmodel->name);
4532                         *out = 0;
4533                 }
4534         }
4535 }
4536
4537 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4538 {
4539         q3dlightmap_t *input_pointer;
4540         int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4541         unsigned char *c;
4542
4543         unsigned char *convertedpixels;
4544         char mapname[MAX_QPATH];
4545         int size, bytesperpixel, rgbmap[3];
4546         qboolean external;
4547         unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4548
4549         // defaults for q3bsp
4550         size = 128;
4551         bytesperpixel = 3;
4552         rgbmap[0] = 2;
4553         rgbmap[1] = 1;
4554         rgbmap[2] = 0;
4555         external = false;
4556         loadmodel->brushq3.lightmapsize = 128;
4557
4558         if (cls.state == ca_dedicated)
4559                 return;
4560
4561         if(mod_q3bsp_nolightmaps.integer)
4562         {
4563                 return;
4564         }
4565         else if(l->filelen)
4566         {
4567                 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4568                 if (developer_loading.integer)
4569                         Con_Printf("Using internal lightmaps\n");
4570                 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4571                 if (l->filelen % sizeof(*input_pointer))
4572                         Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4573                 count = l->filelen / sizeof(*input_pointer);
4574                 for(i = 0; i < count; ++i)
4575                         inpixels[i] = input_pointer[i].rgb;
4576         }
4577         else
4578         {
4579                 // no internal lightmaps
4580                 // try external lightmaps
4581                 if (developer_loading.integer)
4582                         Con_Printf("Using external lightmaps\n");
4583                 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4584                 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false);
4585                 if(!inpixels[0])
4586                         return;
4587
4588                 // using EXTERNAL lightmaps instead
4589                 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4590                 {
4591                         Mem_Free(inpixels[0]);
4592                         Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4593                 }
4594
4595                 size = image_width;
4596                 bytesperpixel = 4;
4597                 rgbmap[0] = 0;
4598                 rgbmap[1] = 1;
4599                 rgbmap[2] = 2;
4600                 external = true;
4601
4602                 for(count = 1; ; ++count)
4603                 {
4604                         inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false);
4605                         if(!inpixels[count])
4606                                 break; // we got all of them
4607                         if(image_width != size || image_height != size)
4608                         {
4609                                 for(i = 0; i <= count; ++i)
4610                                         Mem_Free(inpixels[i]);
4611                                 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4612                         }
4613                 }
4614         }
4615
4616         convertedpixels = (unsigned char *) Mem_Alloc(tempmempool, size*size*4);
4617         loadmodel->brushq3.lightmapsize = size;
4618         loadmodel->brushq3.num_originallightmaps = count;
4619
4620         // now check the surfaces to see if any of them index an odd numbered
4621         // lightmap, if so this is not a deluxemapped bsp file
4622         //
4623         // also check what lightmaps are actually used, because q3map2 sometimes
4624         // (always?) makes an unused one at the end, which
4625         // q3map2 sometimes (or always?) makes a second blank lightmap for no
4626         // reason when only one lightmap is used, which can throw off the
4627         // deluxemapping detection method, so check 2-lightmap bsp's specifically
4628         // to see if the second lightmap is blank, if so it is not deluxemapped.
4629         // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
4630         // in Mod_Q3BSP_LoadEntities was failed
4631         if (!loadmodel->brushq3.deluxemapping)
4632         {
4633                 loadmodel->brushq3.deluxemapping = !(count & 1);
4634                 loadmodel->brushq3.deluxemapping_modelspace = true;
4635                 endlightmap = 0;
4636                 if (loadmodel->brushq3.deluxemapping)
4637                 {
4638                         int facecount = faceslump->filelen / sizeof(q3dface_t);
4639                         q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4640                         for (i = 0;i < facecount;i++)
4641                         {
4642                                 j = LittleLong(faces[i].lightmapindex);
4643                                 if (j >= 0)
4644                                 {
4645                                         endlightmap = max(endlightmap, j + 1);
4646                                         if ((j & 1) || j + 1 >= count)
4647                                         {
4648                                                 loadmodel->brushq3.deluxemapping = false;
4649                                                 break;
4650                                         }
4651                                 }
4652                         }
4653                 }
4654
4655                 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4656                 // reason when only one lightmap is used, which can throw off the
4657                 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4658                 // to see if the second lightmap is blank, if so it is not deluxemapped.
4659                 //
4660                 // further research has shown q3map2 sometimes creates a deluxemap and two
4661                 // blank lightmaps, which must be handled properly as well
4662                 if (endlightmap == 1 && count > 1)
4663                 {
4664                         c = inpixels[1];
4665                         for (i = 0;i < size*size;i++)
4666                         {
4667                                 if (c[bytesperpixel*i + rgbmap[0]])
4668                                         break;
4669                                 if (c[bytesperpixel*i + rgbmap[1]])
4670                                         break;
4671                                 if (c[bytesperpixel*i + rgbmap[2]])
4672                                         break;
4673                         }
4674                         if (i == size*size)
4675                         {
4676                                 // all pixels in the unused lightmap were black...
4677                                 loadmodel->brushq3.deluxemapping = false;
4678                         }
4679                 }
4680         }
4681
4682         Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4683
4684         // figure out what the most reasonable merge power is within limits
4685
4686         loadmodel->brushq3.num_lightmapmergepower = 0;
4687
4688         for(i = 0; (128 << i) < size; ++i)
4689                 ;
4690         // i is now 0 for 128, 1 for 256, etc
4691
4692         for (power = 1;power + i <= mod_q3bsp_lightmapmergepower.integer && (size << power) <= gl_max_texture_size && (1 << (power * 2)) < 4 * (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)); power++)
4693                 loadmodel->brushq3.num_lightmapmergepower = power;
4694
4695         loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4696
4697         loadmodel->brushq3.num_mergedlightmaps = ((count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4698         loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4699         if (loadmodel->brushq3.deluxemapping)
4700                 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4701
4702         // allocate a texture pool if we need it
4703         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4704                 loadmodel->texturepool = R_AllocTexturePool();
4705
4706         power = loadmodel->brushq3.num_lightmapmergepower;
4707         power2 = power * 2;
4708         mask = (1 << power) - 1;
4709         for (i = 0;i < count;i++)
4710         {
4711                 // figure out which merged lightmap texture this fits into
4712                 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4713                 for (k = 0;k < size*size;k++)
4714                 {
4715                         convertedpixels[k*4+0] = inpixels[i][k*bytesperpixel+rgbmap[0]];
4716                         convertedpixels[k*4+1] = inpixels[i][k*bytesperpixel+rgbmap[1]];
4717                         convertedpixels[k*4+2] = inpixels[i][k*bytesperpixel+rgbmap[2]];
4718                         convertedpixels[k*4+3] = 255;
4719                 }
4720                 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4721                 {
4722                         // if the lightmap has not been allocated yet, create it
4723                         if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4724                         {
4725                                 // create a lightmap only as large as necessary to hold the
4726                                 // remaining size*size blocks
4727                                 // if there are multiple merged lightmap textures then they will
4728                                 // all be full size except the last one which may be smaller
4729                                 // because it only needs to the remaining blocks, and it will often
4730                                 // be odd sizes like 2048x512 due to only being 25% full or so.
4731                                 j = (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) - (lightmapindex << power2);
4732                                 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4733                                         ;
4734                                 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4735                                         ;
4736                                 if (developer_loading.integer)
4737                                         Con_Printf("lightmap merge texture #%i is %ix%i (%i of %i used)\n", lightmapindex, mergewidth*size, mergeheight*size, min(j, mergewidth*mergeheight), mergewidth*mergeheight);
4738                                 loadmodel->brushq3.data_lightmaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), mergewidth * size, mergeheight * size, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), NULL);
4739                                 if (loadmodel->brushq3.data_deluxemaps)
4740                                         loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), mergewidth * size, mergeheight * size, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), NULL);
4741                         }
4742                         mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4743                         mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4744                         j = (i >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) & ((1 << power2) - 1);
4745                         if (loadmodel->brushq3.deluxemapping && (i & 1))
4746                                 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4747                         else
4748                                 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4749                 }
4750                 else
4751                 {
4752                         // figure out which merged lightmap texture this fits into
4753                         if (loadmodel->brushq3.deluxemapping && (i & 1))
4754                                 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), size, size, convertedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), NULL);
4755                         else
4756                                 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), size, size, convertedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), NULL);
4757                 }
4758         }
4759
4760         Mem_Free(convertedpixels);
4761         if(external)
4762         {
4763                 for(i = 0; i < count; ++i)
4764                         Mem_Free(inpixels[i]);
4765         }
4766 }
4767
4768 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
4769 {
4770         int j, k, cnt, tri;
4771         float *mins, *maxs;
4772         const float *vert;
4773         if(stride > 0)
4774         {
4775                 *collisionstride = stride;
4776                 cnt = (num_triangles + stride - 1) / stride;
4777                 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
4778                 for(j = 0; j < cnt; ++j)
4779                 {
4780                         mins = &((*collisionbbox6f)[6 * j + 0]);
4781                         maxs = &((*collisionbbox6f)[6 * j + 3]);
4782                         for(k = 0; k < stride; ++k)
4783                         {
4784                                 tri = j * stride + k;
4785                                 if(tri >= num_triangles)
4786                                         break;
4787                                 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
4788                                 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
4789                                 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
4790                                 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
4791                                 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
4792                                 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
4793                                 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
4794                                 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
4795                                 if(vert[0] < mins[0]) mins[0] = vert[0];
4796                                 if(vert[1] < mins[1]) mins[1] = vert[1];
4797                                 if(vert[2] < mins[2]) mins[2] = vert[2];
4798                                 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4799                                 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4800                                 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4801                                 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
4802                                 if(vert[0] < mins[0]) mins[0] = vert[0];
4803                                 if(vert[1] < mins[1]) mins[1] = vert[1];
4804                                 if(vert[2] < mins[2]) mins[2] = vert[2];
4805                                 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4806                                 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4807                                 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4808                         }
4809                 }
4810         }
4811         else
4812         {
4813                 *collisionstride = 0;
4814                 *collisionbbox6f = NULL;
4815         }
4816 }
4817
4818 typedef struct patchtess_s
4819 {
4820         patchinfo_t info;
4821
4822         // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
4823         int surface_id;
4824         float lodgroup[6];
4825         float *originalvertex3f;
4826 } patchtess_t;
4827
4828 #define PATCHTESS_SAME_LODGROUP(a,b) \
4829         ( \
4830                 (a).lodgroup[0] == (b).lodgroup[0] && \
4831                 (a).lodgroup[1] == (b).lodgroup[1] && \
4832                 (a).lodgroup[2] == (b).lodgroup[2] && \
4833                 (a).lodgroup[3] == (b).lodgroup[3] && \
4834                 (a).lodgroup[4] == (b).lodgroup[4] && \
4835                 (a).lodgroup[5] == (b).lodgroup[5] \
4836         )
4837
4838 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4839 {
4840         q3dface_t *in, *oldin;
4841         msurface_t *out, *oldout;
4842         int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, numvertices, numtriangles, cxtess, cytess;
4843         float lightmaptcbase[2], lightmaptcscale[2];
4844         //int *originalelement3i;
4845         //int *originalneighbor3i;
4846         float *originalvertex3f;
4847         //float *originalsvector3f;
4848         //float *originaltvector3f;
4849         float *originalnormal3f;
4850         float *originalcolor4f;
4851         float *originaltexcoordtexture2f;
4852         float *originaltexcoordlightmap2f;
4853         float *v;
4854         patchtess_t *patchtess = NULL;
4855         int patchtesscount = 0;
4856         qboolean again;
4857
4858         in = (q3dface_t *)(mod_base + l->fileofs);
4859         if (l->filelen % sizeof(*in))
4860                 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4861         count = l->filelen / sizeof(*in);
4862         out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4863
4864         loadmodel->data_surfaces = out;
4865         loadmodel->num_surfaces = count;
4866
4867         if(count > 0)
4868                 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
4869
4870         i = 0;
4871         oldi = i;
4872         oldin = in;
4873         oldout = out;
4874         meshvertices = 0;
4875         meshtriangles = 0;
4876         for (;i < count;i++, in++, out++)
4877         {
4878                 // check face type first
4879                 type = LittleLong(in->type);
4880                 if (type != Q3FACETYPE_FLAT
4881                  && type != Q3FACETYPE_PATCH
4882                  && type != Q3FACETYPE_MESH
4883                  && type != Q3FACETYPE_FLARE)
4884                 {
4885                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4886                         continue;
4887                 }
4888
4889                 n = LittleLong(in->textureindex);
4890                 if (n < 0 || n >= loadmodel->num_textures)
4891                 {
4892                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4893                         continue;
4894                 }
4895                 out->texture = loadmodel->data_textures + n;
4896                 n = LittleLong(in->effectindex);
4897                 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4898                 {
4899                         if (developer.integer >= 100)
4900                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4901                         n = -1;
4902                 }
4903                 if (n == -1)
4904                         out->effect = NULL;
4905                 else
4906                         out->effect = loadmodel->brushq3.data_effects + n;
4907
4908                 if (cls.state != ca_dedicated)
4909                 {
4910                         out->lightmaptexture = NULL;
4911                         out->deluxemaptexture = r_texture_blanknormalmap;
4912                         n = LittleLong(in->lightmapindex);
4913                         if (n < 0)
4914                                 n = -1;
4915                         else if (n >= loadmodel->brushq3.num_originallightmaps)
4916                         {
4917                                 if(loadmodel->brushq3.num_originallightmaps != 0)
4918                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4919                                 n = -1;
4920                         }
4921                         else
4922                         {
4923                                 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4924                                 if (loadmodel->brushq3.deluxemapping)
4925                                         out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4926                         }
4927                 }
4928
4929                 firstvertex = LittleLong(in->firstvertex);
4930                 numvertices = LittleLong(in->numvertices);
4931                 firstelement = LittleLong(in->firstelement);
4932                 numtriangles = LittleLong(in->numelements) / 3;
4933                 if (numtriangles * 3 != LittleLong(in->numelements))
4934                 {
4935                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): numelements %i is not a multiple of 3\n", i, out->texture->name, LittleLong(in->numelements));
4936                         continue;
4937                 }
4938                 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4939                 {
4940                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid vertex range %i : %i (%i vertices)\n", i, out->texture->name, firstvertex, firstvertex + numvertices, loadmodel->brushq3.num_vertices);
4941                         continue;
4942                 }
4943                 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4944                 {
4945                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid element range %i : %i (%i elements)\n", i, out->texture->name, firstelement, firstelement + numtriangles * 3, loadmodel->brushq3.num_triangles * 3);
4946                         continue;
4947                 }
4948                 switch(type)
4949                 {
4950                 case Q3FACETYPE_FLAT:
4951                 case Q3FACETYPE_MESH:
4952                         // no processing necessary
4953                         break;
4954                 case Q3FACETYPE_PATCH:
4955                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4956                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4957                         if (numvertices != (patchsize[0] * patchsize[1]) || patchsize[0] < 3 || patchsize[1] < 3 || !(patchsize[0] & 1) || !(patchsize[1] & 1) || patchsize[0] * patchsize[1] >= min(r_subdivisions_maxvertices.integer, r_subdivisions_collision_maxvertices.integer))
4958                         {
4959                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4960                                 continue;
4961                         }
4962                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4963
4964                         // convert patch to Q3FACETYPE_MESH
4965                         xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4966                         ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4967                         // bound to user settings
4968                         xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4969                         ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4970                         // bound to sanity settings
4971                         xtess = bound(0, xtess, 1024);
4972                         ytess = bound(0, ytess, 1024);
4973
4974                         // lower quality collision patches! Same procedure as before, but different cvars
4975                         // convert patch to Q3FACETYPE_MESH
4976                         cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4977                         cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4978                         // bound to user settings
4979                         cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
4980                         cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
4981                         // bound to sanity settings
4982                         cxtess = bound(0, cxtess, 1024);
4983                         cytess = bound(0, cytess, 1024);
4984
4985                         // store it for the LOD grouping step
4986                         patchtess[patchtesscount].info.xsize = patchsize[0];
4987                         patchtess[patchtesscount].info.ysize = patchsize[1];
4988                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
4989                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
4990                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
4991                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
4992
4993                         patchtess[patchtesscount].surface_id = i;
4994                         patchtess[patchtesscount].lodgroup[0] = in->specific.patch.mins[0];
4995                         patchtess[patchtesscount].lodgroup[1] = in->specific.patch.mins[1];
4996                         patchtess[patchtesscount].lodgroup[2] = in->specific.patch.mins[2];
4997                         patchtess[patchtesscount].lodgroup[3] = in->specific.patch.maxs[0];
4998                         patchtess[patchtesscount].lodgroup[4] = in->specific.patch.maxs[1];
4999                         patchtess[patchtesscount].lodgroup[5] = in->specific.patch.maxs[2];
5000                         patchtess[patchtesscount].originalvertex3f = originalvertex3f;
5001                         ++patchtesscount;
5002                         break;
5003                 case Q3FACETYPE_FLARE:
5004                         if (developer.integer >= 100)
5005                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
5006                         // don't render it
5007                         continue;
5008                 }
5009                 out->num_vertices = numvertices;
5010                 out->num_triangles = numtriangles;
5011                 meshvertices += out->num_vertices;
5012                 meshtriangles += out->num_triangles;
5013         }
5014
5015         // Fix patches tesselations so that they make no seams
5016         do
5017         {
5018                 again = false;
5019                 for(i = 0; i < patchtesscount; ++i)
5020                 {
5021                         for(j = i+1; j < patchtesscount; ++j)
5022                         {
5023                                 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
5024                                         continue;
5025
5026                                 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
5027                                         again = true;
5028                         }
5029                 }
5030         }
5031         while (again);
5032
5033         // Calculate resulting number of triangles
5034         for(i = 0; i < patchtesscount; ++i)
5035         {
5036                 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
5037                 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
5038                 numvertices = finalwidth * finalheight;
5039                 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5040
5041                 oldout[patchtess[i].surface_id].num_vertices = numvertices;
5042                 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
5043                 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
5044                 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
5045         }
5046
5047         i = oldi;
5048         in = oldin;
5049         out = oldout;
5050         Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
5051         meshvertices = 0;
5052         meshtriangles = 0;
5053         for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
5054         {
5055                 if (out->num_vertices < 3 || out->num_triangles < 1)
5056                         continue;
5057
5058                 type = LittleLong(in->type);
5059                 firstvertex = LittleLong(in->firstvertex);
5060                 firstelement = LittleLong(in->firstelement);
5061                 out->num_firstvertex = meshvertices;
5062                 out->num_firsttriangle = meshtriangles;
5063                 switch(type)
5064                 {
5065                 case Q3FACETYPE_FLAT:
5066                 case Q3FACETYPE_MESH:
5067                         // no processing necessary, except for lightmap merging
5068                         for (j = 0;j < out->num_vertices;j++)
5069                         {
5070                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5071                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5072                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5073                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5074                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5075                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5076                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5077                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5078                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5079                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5080                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5081                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5082                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5083                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5084                         }
5085                         for (j = 0;j < out->num_triangles*3;j++)
5086                                 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5087                         break;
5088                 case Q3FACETYPE_PATCH:
5089                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5090                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5091                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5092                         originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5093                         originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5094                         originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5095                         originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5096
5097                         xtess = ytess = cxtess = cytess = -1;
5098                         for(j = 0; j < patchtesscount; ++j)
5099                                 if(patchtess[j].surface_id == i)
5100                                 {
5101                                         xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5102                                         ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5103                                         cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5104                                         cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5105                                         break;
5106                                 }
5107                         if(xtess == -1)
5108                         {
5109                                 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5110                                 xtess = ytess = cxtess = cytess = 0;
5111                         }
5112
5113                         finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5114                         finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5115                         finalvertices = finalwidth * finalheight;
5116                         finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5117                         type = Q3FACETYPE_MESH;
5118                         // generate geometry
5119                         // (note: normals are skipped because they get recalculated)
5120                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5121                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5122                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5123                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5124                         Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5125                         Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5126
5127                         out->num_triangles = Mod_RemoveDegenerateTriangles(out->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), loadmodel->surfmesh.data_vertex3f);
5128
5129                         if (developer.integer >= 100)
5130                         {
5131                                 if (out->num_triangles < finaltriangles)
5132                                         Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles, %i degenerate triangles removed (leaving %i)\n", patchsize[0], patchsize[1], out->num_vertices, finaltriangles, finaltriangles - out->num_triangles, out->num_triangles);
5133                                 else
5134                                         Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles\n", patchsize[0], patchsize[1], out->num_vertices, out->num_triangles);
5135                         }
5136                         // q3map does not put in collision brushes for curves... ugh
5137                         // build the lower quality collision geometry
5138                         finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5139                         finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5140                         finalvertices = finalwidth * finalheight;
5141                         finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5142
5143                         out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5144                         out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5145                         out->num_collisionvertices = finalvertices;
5146                         out->num_collisiontriangles = finaltriangles;
5147                         Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5148                         Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
5149
5150                         //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5151                         Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
5152
5153                         oldnumtriangles = out->num_triangles;
5154                         oldnumtriangles2 = out->num_collisiontriangles;
5155                         out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
5156
5157                         // now optimize the collision mesh by finding triangle bboxes...
5158                         Mod_Q3BSP_BuildBBoxes(out->data_collisionelement3i, out->num_collisiontriangles, out->data_collisionvertex3f, &out->data_collisionbbox6f, &out->num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5159                         Mod_Q3BSP_BuildBBoxes(loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle, out->num_triangles, loadmodel->surfmesh.data_vertex3f, &out->data_bbox6f, &out->num_bboxstride, mod_q3bsp_curves_stride.integer);
5160
5161                         if (developer.integer >= 100)
5162                                 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve became %i:%i vertices / %i:%i triangles (%i:%i degenerate)\n", patchsize[0], patchsize[1], out->num_vertices, out->num_collisionvertices, oldnumtriangles, oldnumtriangles2, oldnumtriangles - out->num_triangles, oldnumtriangles2 - out->num_collisiontriangles);
5163                         break;
5164                 default:
5165                         break;
5166                 }
5167                 meshvertices += out->num_vertices;
5168                 meshtriangles += out->num_triangles;
5169                 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5170                         if ((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
5171                                 invalidelements++;
5172                 if (invalidelements)
5173                 {
5174                         Con_Printf("Mod_Q3BSP_LoadFaces: Warning: face #%i has %i invalid elements, type = %i, texture->name = \"%s\", texture->surfaceflags = %i, firstvertex = %i, numvertices = %i, firstelement = %i, numelements = %i, elements list:\n", i, invalidelements, type, out->texture->name, out->texture->surfaceflags, firstvertex, out->num_vertices, firstelement, out->num_triangles * 3);
5175                         for (j = 0;j < out->num_triangles * 3;j++)
5176                         {
5177                                 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5178                                 if ((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
5179                                         (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5180                         }
5181                         Con_Print("\n");
5182                 }
5183                 // calculate a bounding box
5184                 VectorClear(out->mins);
5185                 VectorClear(out->maxs);
5186                 if (out->num_vertices)
5187                 {
5188                         if (cls.state != ca_dedicated && out->lightmaptexture)
5189                         {
5190                                 // figure out which part of the merged lightmap this fits into
5191                                 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5192                                 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5193                                 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5194                                 lightmapindex &= mergewidth * mergeheight - 1;
5195                                 lightmaptcscale[0] = 1.0f / mergewidth;
5196                                 lightmaptcscale[1] = 1.0f / mergeheight;
5197                                 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5198                                 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5199                                 // modify the lightmap texcoords to match this region of the merged lightmap
5200                                 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5201                                 {
5202                                         v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5203                                         v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5204                                 }
5205                         }
5206                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5207                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5208                         for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5209                         {
5210                                 out->mins[0] = min(out->mins[0], v[0]);
5211                                 out->maxs[0] = max(out->maxs[0], v[0]);
5212                                 out->mins[1] = min(out->mins[1], v[1]);
5213                                 out->maxs[1] = max(out->maxs[1], v[1]);
5214                                 out->mins[2] = min(out->mins[2], v[2]);
5215                                 out->maxs[2] = max(out->maxs[2], v[2]);
5216                         }
5217                         out->mins[0] -= 1.0f;
5218                         out->mins[1] -= 1.0f;
5219                         out->mins[2] -= 1.0f;
5220                         out->maxs[0] += 1.0f;
5221                         out->maxs[1] += 1.0f;
5222                         out->maxs[2] += 1.0f;
5223                 }
5224                 // set lightmap styles for consistency with q1bsp
5225                 //out->lightmapinfo->styles[0] = 0;
5226                 //out->lightmapinfo->styles[1] = 255;
5227                 //out->lightmapinfo->styles[2] = 255;
5228                 //out->lightmapinfo->styles[3] = 255;
5229         }
5230
5231         i = oldi;
5232         out = oldout;
5233         for (;i < count;i++, out++)
5234         {
5235                 if(out->num_vertices && out->num_triangles)
5236                         continue;
5237                 if(out->num_vertices == 0)
5238                         Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no vertices, ignoring\n", i);
5239                 if(out->num_triangles == 0)
5240                         Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no triangles, ignoring\n", i);
5241         }
5242
5243         // for per pixel lighting
5244         Mod_BuildTextureVectorsFromNormals(0, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_texcoordtexture2f, loadmodel->surfmesh.data_normal3f, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.data_svector3f, loadmodel->surfmesh.data_tvector3f, true);
5245
5246         // generate ushort elements array if possible
5247         if (loadmodel->surfmesh.data_element3s)
5248                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5249                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5250
5251         // free the no longer needed vertex data
5252         loadmodel->brushq3.num_vertices = 0;
5253         if (loadmodel->brushq3.data_vertex3f)
5254                 Mem_Free(loadmodel->brushq3.data_vertex3f);
5255         loadmodel->brushq3.data_vertex3f = NULL;
5256         loadmodel->brushq3.data_normal3f = NULL;
5257         loadmodel->brushq3.data_texcoordtexture2f = NULL;
5258         loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5259         loadmodel->brushq3.data_color4f = NULL;
5260         // free the no longer needed triangle data
5261         loadmodel->brushq3.num_triangles = 0;
5262         if (loadmodel->brushq3.data_element3i)
5263                 Mem_Free(loadmodel->brushq3.data_element3i);
5264         loadmodel->brushq3.data_element3i = NULL;
5265
5266         if(patchtess)
5267                 Mem_Free(patchtess);
5268 }
5269
5270 static void Mod_Q3BSP_LoadModels(lump_t *l)
5271 {
5272         q3dmodel_t *in;
5273         q3dmodel_t *out;
5274         int i, j, n, c, count;
5275
5276         in = (q3dmodel_t *)(mod_base + l->fileofs);
5277         if (l->filelen % sizeof(*in))
5278                 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5279         count = l->filelen / sizeof(*in);
5280         out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5281
5282         loadmodel->brushq3.data_models = out;
5283         loadmodel->brushq3.num_models = count;
5284
5285         for (i = 0;i < count;i++, in++, out++)
5286         {
5287                 for (j = 0;j < 3;j++)
5288                 {
5289                         out->mins[j] = LittleFloat(in->mins[j]);
5290                         out->maxs[j] = LittleFloat(in->maxs[j]);
5291                 }
5292                 n = LittleLong(in->firstface);
5293                 c = LittleLong(in->numfaces);
5294                 if (n < 0 || n + c > loadmodel->num_surfaces)
5295                         Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5296                 out->firstface = n;
5297                 out->numfaces = c;
5298                 n = LittleLong(in->firstbrush);
5299                 c = LittleLong(in->numbrushes);
5300                 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5301                         Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5302                 out->firstbrush = n;
5303                 out->numbrushes = c;
5304         }
5305 }
5306
5307 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5308 {
5309         int *in;
5310         int *out;
5311         int i, n, count;
5312
5313         in = (int *)(mod_base + l->fileofs);
5314         if (l->filelen % sizeof(*in))
5315                 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5316         count = l->filelen / sizeof(*in);
5317         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5318
5319         loadmodel->brush.data_leafbrushes = out;
5320         loadmodel->brush.num_leafbrushes = count;
5321
5322         for (i = 0;i < count;i++, in++, out++)
5323         {
5324                 n = LittleLong(*in);
5325                 if (n < 0 || n >= loadmodel->brush.num_brushes)
5326                         Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5327                 *out = n;
5328         }
5329 }
5330
5331 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5332 {
5333         int *in;
5334         int *out;
5335         int i, n, count;
5336
5337         in = (int *)(mod_base + l->fileofs);
5338         if (l->filelen % sizeof(*in))
5339                 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5340         count = l->filelen / sizeof(*in);
5341         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5342
5343         loadmodel->brush.data_leafsurfaces = out;
5344         loadmodel->brush.num_leafsurfaces = count;
5345
5346         for (i = 0;i < count;i++, in++, out++)
5347         {
5348                 n = LittleLong(*in);
5349                 if (n < 0 || n >= loadmodel->num_surfaces)
5350                         Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5351                 *out = n;
5352         }
5353 }
5354
5355 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5356 {
5357         q3dleaf_t *in;
5358         mleaf_t *out;
5359         int i, j, n, c, count;
5360
5361         in = (q3dleaf_t *)(mod_base + l->fileofs);
5362         if (l->filelen % sizeof(*in))
5363                 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5364         count = l->filelen / sizeof(*in);
5365         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5366
5367         loadmodel->brush.data_leafs = out;
5368         loadmodel->brush.num_leafs = count;
5369
5370         for (i = 0;i < count;i++, in++, out++)
5371         {
5372                 out->parent = NULL;
5373                 out->plane = NULL;
5374                 out->clusterindex = LittleLong(in->clusterindex);
5375                 out->areaindex = LittleLong(in->areaindex);
5376                 for (j = 0;j < 3;j++)
5377                 {
5378                         // yes the mins/maxs are ints
5379                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5380                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5381                 }
5382                 n = LittleLong(in->firstleafface);
5383                 c = LittleLong(in->numleaffaces);
5384                 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5385                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5386                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5387                 out->numleafsurfaces = c;
5388                 n = LittleLong(in->firstleafbrush);
5389                 c = LittleLong(in->numleafbrushes);
5390                 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5391                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5392                 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5393                 out->numleafbrushes = c;
5394         }
5395 }
5396
5397 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5398 {
5399         q3dnode_t *in;
5400         mnode_t *out;
5401         int i, j, n, count;
5402
5403         in = (q3dnode_t *)(mod_base + l->fileofs);
5404         if (l->filelen % sizeof(*in))
5405                 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5406         count = l->filelen / sizeof(*in);
5407         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5408
5409         loadmodel->brush.data_nodes = out;
5410         loadmodel->brush.num_nodes = count;
5411
5412         for (i = 0;i < count;i++, in++, out++)
5413         {
5414                 out->parent = NULL;
5415                 n = LittleLong(in->planeindex);
5416                 if (n < 0 || n >= loadmodel->brush.num_planes)
5417                         Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5418                 out->plane = loadmodel->brush.data_planes + n;
5419                 for (j = 0;j < 2;j++)
5420                 {
5421                         n = LittleLong(in->childrenindex[j]);
5422                         if (n >= 0)
5423                         {
5424                                 if (n >= loadmodel->brush.num_nodes)
5425                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5426                                 out->children[j] = loadmodel->brush.data_nodes + n;
5427                         }
5428                         else
5429                         {
5430                                 n = -1 - n;
5431                                 if (n >= loadmodel->brush.num_leafs)
5432                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5433                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5434                         }
5435                 }
5436                 for (j = 0;j < 3;j++)
5437                 {
5438                         // yes the mins/maxs are ints
5439                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5440                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5441                 }
5442         }
5443
5444         // set the parent pointers
5445         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5446 }
5447
5448 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5449 {
5450         q3dlightgrid_t *in;
5451         q3dlightgrid_t *out;
5452         int count;
5453
5454         in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5455         if (l->filelen % sizeof(*in))
5456                 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5457         loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5458         loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5459         loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5460         loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5461         loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5462         loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5463         loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5464         loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5465         loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5466         loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5467         loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5468         loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5469         count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5470         Matrix4x4_CreateScale3(&loadmodel->brushq3.num_lightgrid_indexfromworld, loadmodel->brushq3.num_lightgrid_scale[0], loadmodel->brushq3.num_lightgrid_scale[1], loadmodel->brushq3.num_lightgrid_scale[2]);
5471         Matrix4x4_ConcatTranslate(&loadmodel->brushq3.num_lightgrid_indexfromworld, -loadmodel->brushq3.num_lightgrid_imins[0] * loadmodel->brushq3.num_lightgrid_cellsize[0], -loadmodel->brushq3.num_lightgrid_imins[1] * loadmodel->brushq3.num_lightgrid_cellsize[1], -loadmodel->brushq3.num_lightgrid_imins[2] * loadmodel->brushq3.num_lightgrid_cellsize[2]);
5472
5473         // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5474         if (l->filelen)
5475         {
5476                 if (l->filelen < count * (int)sizeof(*in))
5477                         Host_Error("Mod_Q3BSP_LoadLightGrid: invalid lightgrid lump size %i bytes, should be %i bytes (%ix%ix%i)", l->filelen, (int)(count * sizeof(*in)), loadmodel->brushq3.num_lightgrid_isize[0], loadmodel->brushq3.num_lightgrid_isize[1], loadmodel->brushq3.num_lightgrid_isize[2]);
5478                 if (l->filelen != count * (int)sizeof(*in))
5479                         Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5480                 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5481                 loadmodel->brushq3.data_lightgrid = out;
5482                 loadmodel->brushq3.num_lightgrid = count;
5483                 // no swapping or validation necessary
5484                 memcpy(out, in, count * (int)sizeof(*out));
5485         }
5486 }
5487
5488 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5489 {
5490         q3dpvs_t *in;
5491         int totalchains;
5492
5493         if (l->filelen == 0)
5494         {
5495                 int i;
5496                 // unvised maps often have cluster indices even without pvs, so check
5497                 // leafs to find real number of clusters
5498                 loadmodel->brush.num_pvsclusters = 1;
5499                 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5500                         loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5501
5502                 // create clusters
5503                 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5504                 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5505                 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5506                 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5507                 return;
5508         }
5509
5510         in = (q3dpvs_t *)(mod_base + l->fileofs);
5511         if (l->filelen < 9)
5512                 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5513
5514         loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5515         loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5516         if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5517                 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5518         totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5519         if (l->filelen < totalchains + (int)sizeof(*in))
5520                 Host_Error("Mod_Q3BSP_LoadPVS: lump too small ((numclusters = %i) * (chainlength = %i) + sizeof(q3dpvs_t) == %i bytes, lump is %i bytes)", loadmodel->brush.num_pvsclusters, loadmodel->brush.num_pvsclusterbytes, (int)(totalchains + sizeof(*in)), l->filelen);
5521
5522         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5523         memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5524 }
5525
5526 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5527 {
5528         int i, j, k, index[3];
5529         float transformed[3], blend1, blend2, blend, stylescale;
5530         q3dlightgrid_t *a, *s;
5531
5532         // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5533         stylescale = r_refdef.scene.rtlightstylevalue[0];
5534
5535         if (!model->brushq3.num_lightgrid)
5536         {
5537                 ambientcolor[0] = stylescale;
5538                 ambientcolor[1] = stylescale;
5539                 ambientcolor[2] = stylescale;
5540                 return;
5541         }
5542
5543         Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5544         //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5545         //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5546         transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5547         transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5548         transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5549         index[0] = (int)floor(transformed[0]);
5550         index[1] = (int)floor(transformed[1]);
5551         index[2] = (int)floor(transformed[2]);
5552         //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5553
5554         // now lerp the values
5555         VectorClear(diffusenormal);
5556         a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5557         for (k = 0;k < 2;k++)
5558         {
5559                 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5560                 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5561                         continue;
5562                 for (j = 0;j < 2;j++)
5563                 {
5564                         blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5565                         if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5566                                 continue;
5567                         for (i = 0;i < 2;i++)
5568                         {
5569                                 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5570                                 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5571                                         continue;
5572                                 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5573                                 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5574                                 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5575                                 // this uses the mod_md3_sin table because the values are
5576                                 // already in the 0-255 range, the 64+ bias fetches a cosine
5577                                 // instead of a sine value
5578                                 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5579                                 diffusenormal[1] += blend * (mod_md3_sin[     s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5580                                 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5581                                 //Con_Printf("blend %f: ambient %i %i %i, diffuse %i %i %i, diffusepitch %i diffuseyaw %i (%f %f, normal %f %f %f)\n", blend, s->ambientrgb[0], s->ambientrgb[1], s->ambientrgb[2], s->diffusergb[0], s->diffusergb[1], s->diffusergb[2], s->diffusepitch, s->diffuseyaw, pitch, yaw, (cos(yaw) * cospitch), (sin(yaw) * cospitch), (-sin(pitch)));
5582                         }
5583                 }
5584         }
5585
5586         // normalize the light direction before turning
5587         VectorNormalize(diffusenormal);
5588         //Con_Printf("result: ambient %f %f %f diffuse %f %f %f diffusenormal %f %f %f\n", ambientcolor[0], ambientcolor[1], ambientcolor[2], diffusecolor[0], diffusecolor[1], diffusecolor[2], diffusenormal[0], diffusenormal[1], diffusenormal[2]);
5589 }
5590
5591 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
5592 {
5593         double t1, t2;
5594         double midf, mid[3];
5595         int ret, side;
5596
5597         // check for empty
5598         while (node->plane)
5599         {
5600                 // find the point distances
5601                 mplane_t *plane = node->plane;
5602                 if (plane->type < 3)
5603                 {
5604                         t1 = p1[plane->type] - plane->dist;
5605                         t2 = p2[plane->type] - plane->dist;
5606                 }
5607                 else
5608                 {
5609                         t1 = DotProduct (plane->normal, p1) - plane->dist;
5610                         t2 = DotProduct (plane->normal, p2) - plane->dist;
5611                 }
5612
5613                 if (t1 < 0)
5614                 {
5615                         if (t2 < 0)
5616                         {
5617                                 node = node->children[1];
5618                                 continue;
5619                         }
5620                         side = 1;
5621                 }
5622                 else
5623                 {
5624                         if (t2 >= 0)
5625                         {
5626                                 node = node->children[0];
5627                                 continue;
5628                         }
5629                         side = 0;
5630                 }
5631
5632                 midf = t1 / (t1 - t2);
5633                 VectorLerp(p1, midf, p2, mid);
5634
5635                 // recurse both sides, front side first
5636                 // return 2 if empty is followed by solid (hit something)
5637                 // do not return 2 if both are solid or both empty,
5638                 // or if start is solid and end is empty
5639                 // as these degenerate cases usually indicate the eye is in solid and
5640                 // should see the target point anyway
5641                 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side    ], p1, mid);
5642                 if (ret != 0)
5643                         return ret;
5644                 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
5645                 if (ret != 1)
5646                         return ret;
5647                 return 2;
5648         }
5649         return ((mleaf_t *)node)->clusterindex < 0;
5650 }
5651
5652 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
5653 {
5654         if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
5655         {
5656                 trace_t trace;
5657                 model->TraceLine(model, 0, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
5658                 return trace.fraction == 1;
5659         }
5660         else
5661         {
5662                 double tracestart[3], traceend[3];
5663                 VectorCopy(start, tracestart);
5664                 VectorCopy(end, traceend);
5665                 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
5666         }
5667 }
5668
5669 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
5670 {
5671         int i;
5672         mleaf_t *leaf;
5673         colbrushf_t *brush;
5674         // find which leaf the point is in
5675         while (node->plane)
5676                 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5677         // point trace the brushes
5678         leaf = (mleaf_t *)node;
5679         for (i = 0;i < leaf->numleafbrushes;i++)
5680         {
5681                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5682                 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5683                 {
5684                         brush->markframe = markframe;
5685                         Collision_TracePointBrushFloat(trace, point, brush);
5686                 }
5687         }
5688         // can't do point traces on curves (they have no thickness)
5689 }
5690
5691 static void Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t start, const vec3_t end, vec_t startfrac, vec_t endfrac, const vec3_t linestart, const vec3_t lineend, int markframe, const vec3_t segmentmins, const vec3_t segmentmaxs)
5692 {
5693         int i, startside, endside;
5694         float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5695         mleaf_t *leaf;
5696         msurface_t *surface;
5697         mplane_t *plane;
5698         colbrushf_t *brush;
5699         // walk the tree until we hit a leaf, recursing for any split cases
5700         while (node->plane)
5701         {
5702                 // abort if this part of the bsp tree can not be hit by this trace
5703 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5704 //                      return;
5705                 plane = node->plane;
5706                 // axial planes are much more common than non-axial, so an optimized
5707                 // axial case pays off here
5708                 if (plane->type < 3)
5709                 {
5710                         dist1 = start[plane->type] - plane->dist;
5711                         dist2 = end[plane->type] - plane->dist;
5712                 }
5713                 else
5714                 {
5715                         dist1 = DotProduct(start, plane->normal) - plane->dist;
5716                         dist2 = DotProduct(end, plane->normal) - plane->dist;
5717                 }
5718                 startside = dist1 < 0;
5719                 endside = dist2 < 0;
5720                 if (startside == endside)
5721                 {
5722                         // most of the time the line fragment is on one side of the plane
5723                         node = node->children[startside];
5724                 }
5725                 else
5726                 {
5727                         // line crosses node plane, split the line
5728                         dist1 = PlaneDiff(linestart, plane);
5729                         dist2 = PlaneDiff(lineend, plane);
5730                         midfrac = dist1 / (dist1 - dist2);
5731                         VectorLerp(linestart, midfrac, lineend, mid);
5732                         // take the near side first
5733                         Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5734                         // if we found an impact on the front side, don't waste time
5735                         // exploring the far side
5736                         if (midfrac <= trace->realfraction)
5737                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5738                         return;
5739                 }
5740         }
5741         // abort if this part of the bsp tree can not be hit by this trace
5742 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5743 //              return;
5744         // hit a leaf
5745         nodesegmentmins[0] = min(start[0], end[0]) - 1;
5746         nodesegmentmins[1] = min(start[1], end[1]) - 1;
5747         nodesegmentmins[2] = min(start[2], end[2]) - 1;
5748         nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5749         nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5750         nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5751         // line trace the brushes
5752         leaf = (mleaf_t *)node;
5753         for (i = 0;i < leaf->numleafbrushes;i++)
5754         {
5755                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5756                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5757                 {
5758                         brush->markframe = markframe;
5759                         Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5760                 }
5761         }
5762         // can't do point traces on curves (they have no thickness)
5763         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5764         {
5765                 // line trace the curves
5766                 for (i = 0;i < leaf->numleafsurfaces;i++)
5767                 {
5768                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5769                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5770                         {
5771                                 surface->collisionmarkframe = markframe;
5772                                 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5773                         }
5774                 }
5775         }
5776 }
5777
5778 static void Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const colbrushf_t *thisbrush_start, const colbrushf_t *thisbrush_end, int markframe, const vec3_t segmentmins, const vec3_t segmentmaxs)
5779 {
5780         int i;
5781         int sides;
5782         mleaf_t *leaf;
5783         colbrushf_t *brush;
5784         msurface_t *surface;
5785         mplane_t *plane;
5786         float nodesegmentmins[3], nodesegmentmaxs[3];
5787         // walk the tree until we hit a leaf, recursing for any split cases
5788         while (node->plane)
5789         {
5790                 // abort if this part of the bsp tree can not be hit by this trace
5791 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5792 //                      return;
5793                 plane = node->plane;
5794                 // axial planes are much more common than non-axial, so an optimized
5795                 // axial case pays off here
5796                 if (plane->type < 3)
5797                 {
5798                         // this is an axial plane, compare bounding box directly to it and
5799                         // recurse sides accordingly
5800                         // recurse down node sides
5801                         // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5802                         //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5803                         //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5804                         sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5805                 }
5806                 else
5807                 {
5808                         // this is a non-axial plane, so check if the start and end boxes
5809                         // are both on one side of the plane to handle 'diagonal' cases
5810                         sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5811                 }
5812                 if (sides == 3)
5813                 {
5814                         // segment crosses plane
5815                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5816                         sides = 2;
5817                 }
5818                 // if sides == 0 then the trace itself is bogus (Not A Number values),
5819                 // in this case we simply pretend the trace hit nothing
5820                 if (sides == 0)
5821                         return; // ERROR: NAN bounding box!
5822                 // take whichever side the segment box is on
5823                 node = node->children[sides - 1];
5824         }
5825         // abort if this part of the bsp tree can not be hit by this trace
5826 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5827 //              return;
5828         nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5829         nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5830         nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5831         nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5832         nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5833         nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5834         // hit a leaf
5835         leaf = (mleaf_t *)node;
5836         for (i = 0;i < leaf->numleafbrushes;i++)
5837         {
5838                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5839                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5840                 {
5841                         brush->markframe = markframe;
5842                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5843                 }
5844         }
5845         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5846         {
5847                 for (i = 0;i < leaf->numleafsurfaces;i++)
5848                 {
5849                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5850                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5851                         {
5852                                 surface->collisionmarkframe = markframe;
5853                                 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5854                         }
5855                 }
5856         }
5857 }
5858
5859 static int markframe = 0;
5860
5861 static void Mod_Q3BSP_TracePoint(dp_model_t *model, int frame, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
5862 {
5863         int i;
5864         q3mbrush_t *brush;
5865         memset(trace, 0, sizeof(*trace));
5866         trace->fraction = 1;
5867         trace->realfraction = 1;
5868         trace->hitsupercontentsmask = hitsupercontentsmask;
5869         if (model->brush.submodel)
5870         {
5871                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5872                         if (brush->colbrushf)
5873                                 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5874         }
5875         else
5876                 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5877 }
5878
5879 static void Mod_Q3BSP_TraceLine(dp_model_t *model, int frame, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
5880 {
5881         int i;
5882         float segmentmins[3], segmentmaxs[3];
5883         msurface_t *surface;
5884         q3mbrush_t *brush;
5885
5886         if (VectorCompare(start, end))
5887         {
5888                 Mod_Q3BSP_TracePoint(model, frame, trace, start, hitsupercontentsmask);
5889                 return;
5890         }
5891
5892         memset(trace, 0, sizeof(*trace));
5893         trace->fraction = 1;
5894         trace->realfraction = 1;
5895         trace->hitsupercontentsmask = hitsupercontentsmask;
5896         segmentmins[0] = min(start[0], end[0]) - 1;
5897         segmentmins[1] = min(start[1], end[1]) - 1;
5898         segmentmins[2] = min(start[2], end[2]) - 1;
5899         segmentmaxs[0] = max(start[0], end[0]) + 1;
5900         segmentmaxs[1] = max(start[1], end[1]) + 1;
5901         segmentmaxs[2] = max(start[2], end[2]) + 1;
5902         if (model->brush.submodel)
5903         {
5904                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5905                         if (brush->colbrushf)
5906                                 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5907                 if (mod_q3bsp_curves_collisions.integer)
5908                         for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5909                                 if (surface->num_collisiontriangles)
5910                                         Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5911         }
5912         else
5913                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5914 }
5915
5916 static void Mod_Q3BSP_TraceBox(dp_model_t *model, int frame, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
5917 {
5918         int i;
5919         float segmentmins[3], segmentmaxs[3];
5920         msurface_t *surface;
5921         q3mbrush_t *brush;
5922         colbrushf_t *thisbrush_start, *thisbrush_end;
5923         vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5924
5925         if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
5926         {
5927                 vec3_t shiftstart, shiftend;
5928                 VectorAdd(start, boxmins, shiftstart);
5929                 VectorAdd(end, boxmins, shiftend);
5930                 if (VectorCompare(start, end))
5931                         Mod_Q3BSP_TracePoint(model, frame, trace, shiftstart, hitsupercontentsmask);
5932                 else
5933                 {
5934                         Mod_Q3BSP_TraceLine(model, frame, trace, shiftstart, shiftend, hitsupercontentsmask);
5935                         VectorSubtract(trace->endpos, boxmins, trace->endpos);
5936                 }
5937                 return;
5938         }
5939
5940         // box trace, performed as brush trace
5941         memset(trace, 0, sizeof(*trace));
5942         trace->fraction = 1;
5943         trace->realfraction = 1;
5944         trace->hitsupercontentsmask = hitsupercontentsmask;
5945         segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5946         segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5947         segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5948         segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5949         segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5950         segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5951         VectorAdd(start, boxmins, boxstartmins);
5952         VectorAdd(start, boxmaxs, boxstartmaxs);
5953         VectorAdd(end, boxmins, boxendmins);
5954         VectorAdd(end, boxmaxs, boxendmaxs);
5955         thisbrush_start = Collision_BrushForBox(boxstartmins, boxstartmaxs, 0, 0, NULL);
5956         thisbrush_end = Collision_BrushForBox(boxendmins, boxendmaxs, 0, 0, NULL);
5957         if (model->brush.submodel)
5958         {
5959                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5960                         if (brush->colbrushf)
5961                                 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5962                 if (mod_q3bsp_curves_collisions.integer)
5963                         for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5964                                 if (surface->num_collisiontriangles)
5965                                         Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5966         }
5967         else
5968                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5969 }
5970
5971 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5972 {
5973         int i;
5974         int supercontents = 0;
5975         q3mbrush_t *brush;
5976         // test if the point is inside each brush
5977         if (model->brush.submodel)
5978         {
5979                 // submodels are effectively one leaf
5980                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5981                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5982                                 supercontents |= brush->colbrushf->supercontents;
5983         }
5984         else
5985         {
5986                 mnode_t *node = model->brush.data_nodes;
5987                 mleaf_t *leaf;
5988                 // find which leaf the point is in
5989                 while (node->plane)
5990                         node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5991                 leaf = (mleaf_t *)node;
5992                 // now check the brushes in the leaf
5993                 for (i = 0;i < leaf->numleafbrushes;i++)
5994                 {
5995                         brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5996                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5997                                 supercontents |= brush->colbrushf->supercontents;
5998                 }
5999         }
6000         return supercontents;
6001 }
6002
6003 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
6004 {
6005         int supercontents = 0;
6006         if (nativecontents & CONTENTSQ3_SOLID)
6007                 supercontents |= SUPERCONTENTS_SOLID;
6008         if (nativecontents & CONTENTSQ3_WATER)
6009                 supercontents |= SUPERCONTENTS_WATER;
6010         if (nativecontents & CONTENTSQ3_SLIME)
6011                 supercontents |= SUPERCONTENTS_SLIME;
6012         if (nativecontents & CONTENTSQ3_LAVA)
6013                 supercontents |= SUPERCONTENTS_LAVA;
6014         if (nativecontents & CONTENTSQ3_BODY)
6015                 supercontents |= SUPERCONTENTS_BODY;
6016         if (nativecontents & CONTENTSQ3_CORPSE)
6017                 supercontents |= SUPERCONTENTS_CORPSE;
6018         if (nativecontents & CONTENTSQ3_NODROP)
6019                 supercontents |= SUPERCONTENTS_NODROP;
6020         if (nativecontents & CONTENTSQ3_PLAYERCLIP)
6021                 supercontents |= SUPERCONTENTS_PLAYERCLIP;
6022         if (nativecontents & CONTENTSQ3_MONSTERCLIP)
6023                 supercontents |= SUPERCONTENTS_MONSTERCLIP;
6024         if (nativecontents & CONTENTSQ3_DONOTENTER)
6025                 supercontents |= SUPERCONTENTS_DONOTENTER;
6026         if (nativecontents & CONTENTSQ3_BOTCLIP)
6027                 supercontents |= SUPERCONTENTS_BOTCLIP;
6028         if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
6029                 supercontents |= SUPERCONTENTS_OPAQUE;
6030         return supercontents;
6031 }
6032
6033 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
6034 {
6035         int nativecontents = 0;
6036         if (supercontents & SUPERCONTENTS_SOLID)
6037                 nativecontents |= CONTENTSQ3_SOLID;
6038         if (supercontents & SUPERCONTENTS_WATER)
6039                 nativecontents |= CONTENTSQ3_WATER;
6040         if (supercontents & SUPERCONTENTS_SLIME)
6041                 nativecontents |= CONTENTSQ3_SLIME;
6042         if (supercontents & SUPERCONTENTS_LAVA)
6043                 nativecontents |= CONTENTSQ3_LAVA;
6044         if (supercontents & SUPERCONTENTS_BODY)
6045                 nativecontents |= CONTENTSQ3_BODY;
6046         if (supercontents & SUPERCONTENTS_CORPSE)
6047                 nativecontents |= CONTENTSQ3_CORPSE;
6048         if (supercontents & SUPERCONTENTS_NODROP)
6049                 nativecontents |= CONTENTSQ3_NODROP;
6050         if (supercontents & SUPERCONTENTS_PLAYERCLIP)
6051                 nativecontents |= CONTENTSQ3_PLAYERCLIP;
6052         if (supercontents & SUPERCONTENTS_MONSTERCLIP)
6053                 nativecontents |= CONTENTSQ3_MONSTERCLIP;
6054         if (supercontents & SUPERCONTENTS_DONOTENTER)
6055                 nativecontents |= CONTENTSQ3_DONOTENTER;
6056         if (supercontents & SUPERCONTENTS_BOTCLIP)
6057                 nativecontents |= CONTENTSQ3_BOTCLIP;
6058         if (!(supercontents & SUPERCONTENTS_OPAQUE))
6059                 nativecontents |= CONTENTSQ3_TRANSLUCENT;
6060         return nativecontents;
6061 }
6062
6063 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
6064 {
6065         int numleafs;
6066         while (node->plane)
6067         {
6068                 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
6069                 node = node->children[1];
6070         }
6071         numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
6072         if (loadmodel->brush.num_leafs < numleafs)
6073                 loadmodel->brush.num_leafs = numleafs;
6074 }
6075
6076 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6077 {
6078         int i, j, numshadowmeshtriangles, lumps;
6079         q3dheader_t *header;
6080         float corner[3], yawradius, modelradius;
6081         msurface_t *surface;
6082
6083         mod->modeldatatypestring = "Q3BSP";
6084
6085         mod->type = mod_brushq3;
6086         mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
6087         mod->numskins = 1;
6088
6089         header = (q3dheader_t *)buffer;
6090         if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
6091                 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
6092
6093         i = LittleLong(header->version);
6094         if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
6095                 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
6096
6097         mod->soundfromcenter = true;
6098         mod->TraceBox = Mod_Q3BSP_TraceBox;
6099         mod->TraceLine = Mod_Q3BSP_TraceLine;
6100         mod->TracePoint = Mod_Q3BSP_TracePoint;
6101         mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
6102         mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
6103         mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
6104         mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
6105         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
6106         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
6107         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
6108         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
6109         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
6110         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
6111         mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
6112         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
6113         mod->brush.AmbientSoundLevelsForPoint = NULL;
6114         mod->brush.RoundUpToHullSize = NULL;
6115         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
6116         mod->Draw = R_Q1BSP_Draw;
6117         mod->DrawDepth = R_Q1BSP_DrawDepth;
6118         mod->DrawDebug = R_Q1BSP_DrawDebug;
6119         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
6120         mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6121         mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6122         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6123         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6124         mod->DrawLight = R_Q1BSP_DrawLight;
6125
6126         mod_base = (unsigned char *)header;
6127
6128         // swap all the lumps
6129         header->ident = LittleLong(header->ident);
6130         header->version = LittleLong(header->version);
6131         lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
6132         for (i = 0;i < lumps;i++)
6133         {
6134                 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
6135                 if((char *) bufferend < (char *) buffer + j)
6136                         Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
6137                 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
6138                 if((char *) bufferend < (char *) buffer + j)
6139                         Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
6140         }
6141         /*
6142          * NO, do NOT clear them!
6143          * they contain actual data referenced by other stuff.
6144          * Instead, before using the advertisements lump, check header->versio
6145          * again!
6146          * Sorry, but otherwise it breaks memory of the first lump.
6147         for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
6148         {
6149                 header->lumps[i].fileofs = 0;
6150                 header->lumps[i].filelen = 0;
6151         }
6152         */
6153
6154         mod->brush.qw_md4sum = 0;
6155         mod->brush.qw_md4sum2 = 0;
6156         for (i = 0;i < lumps;i++)
6157         {
6158                 if (i == Q3LUMP_ENTITIES)
6159                         continue;
6160                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6161                 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
6162                         continue;
6163                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6164
6165                 // all this checksumming can take a while, so let's send keepalives here too
6166                 CL_KeepaliveMessage(false);
6167         }
6168
6169         Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
6170         Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
6171         Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
6172         if (header->version == Q3BSPVERSION_IG)
6173                 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
6174         else
6175                 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
6176         Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
6177         Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
6178         Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
6179         Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
6180         Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
6181         Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
6182         Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
6183         Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
6184         Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
6185         Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
6186         Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
6187         Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
6188         Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
6189         loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
6190
6191         // the MakePortals code works fine on the q3bsp data as well
6192         Mod_Q1BSP_MakePortals();
6193
6194         // FIXME: shader alpha should replace r_wateralpha support in q3bsp
6195         loadmodel->brush.supportwateralpha = true;
6196
6197         // make a single combined shadow mesh to allow optimized shadow volume creation
6198         numshadowmeshtriangles = 0;
6199         if (cls.state != ca_dedicated)
6200         {
6201                 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6202                 {
6203                         surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
6204                         numshadowmeshtriangles += surface->num_triangles;
6205                 }
6206                 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
6207                 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6208                         if (surface->num_triangles > 0)
6209                                 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, loadmodel->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
6210                 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
6211                 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
6212         }
6213
6214         loadmodel->brush.num_leafs = 0;
6215         Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
6216
6217         mod = loadmodel;
6218         for (i = 0;i < loadmodel->brush.numsubmodels;i++)
6219         {
6220                 if (i > 0)
6221                 {
6222                         char name[10];
6223                         // duplicate the basic information
6224                         dpsnprintf(name, sizeof(name), "*%i", i);
6225                         mod = Mod_FindName(name, loadmodel->name);
6226                         // copy the base model to this one
6227                         *mod = *loadmodel;
6228                         // rename the clone back to its proper name
6229                         strlcpy(mod->name, name, sizeof(mod->name));
6230                         mod->brush.parentmodel = loadmodel;
6231                         // textures and memory belong to the main model
6232                         mod->texturepool = NULL;
6233                         mod->mempool = NULL;
6234                         mod->brush.GetPVS = NULL;
6235                         mod->brush.FatPVS = NULL;
6236                         mod->brush.BoxTouchingPVS = NULL;
6237                         mod->brush.BoxTouchingLeafPVS = NULL;
6238                         mod->brush.BoxTouchingVisibleLeafs = NULL;
6239                         mod->brush.FindBoxClusters = NULL;
6240                         mod->brush.LightPoint = NULL;
6241                         mod->brush.AmbientSoundLevelsForPoint = NULL;
6242                 }
6243                 mod->brush.submodel = i;
6244
6245                 // make the model surface list (used by shadowing/lighting)
6246                 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
6247                 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
6248                 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
6249                 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
6250                 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
6251                 Mod_MakeSortedSurfaces(mod);
6252
6253                 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
6254                 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
6255                 // enlarge the bounding box to enclose all geometry of this model,
6256                 // because q3map2 sometimes lies (mostly to affect the lightgrid),
6257                 // which can in turn mess up the farclip (as well as culling when
6258                 // outside the level - an unimportant concern)
6259
6260                 //printf("Editing model %d... BEFORE re-bounding: %f %f %f - %f %f %f\n", i, mod->normalmins[0], mod->normalmins[1], mod->normalmins[2], mod->normalmaxs[0], mod->normalmaxs[1], mod->normalmaxs[2]);
6261                 for (j = 0;j < mod->nummodelsurfaces;j++)
6262                 {
6263                         const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
6264                         const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
6265                         int k;
6266                         if (!surface->num_vertices)
6267                                 continue;
6268                         for (k = 0;k < surface->num_vertices;k++, v += 3)
6269                         {
6270                                 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
6271                                 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
6272                                 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
6273                                 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
6274                                 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
6275                                 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
6276                         }
6277                 }
6278                 //printf("Editing model %d... AFTER re-bounding: %f %f %f - %f %f %f\n", i, mod->normalmins[0], mod->normalmins[1], mod->normalmins[2], mod->normalmaxs[0], mod->normalmaxs[1], mod->normalmaxs[2]);
6279                 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
6280                 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
6281                 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
6282                 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
6283                 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
6284                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
6285                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
6286                 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
6287                 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
6288                 mod->yawmins[2] = mod->normalmins[2];
6289                 mod->yawmaxs[2] = mod->normalmaxs[2];
6290                 mod->radius = modelradius;
6291                 mod->radius2 = modelradius * modelradius;
6292
6293                 // this gets altered below if sky or water is used
6294                 mod->DrawSky = NULL;
6295                 mod->DrawAddWaterPlanes = NULL;
6296
6297                 for (j = 0;j < mod->nummodelsurfaces;j++)
6298                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
6299                                 break;
6300                 if (j < mod->nummodelsurfaces)
6301                         mod->DrawSky = R_Q1BSP_DrawSky;
6302
6303                 for (j = 0;j < mod->nummodelsurfaces;j++)
6304                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
6305                                 break;
6306                 if (j < mod->nummodelsurfaces)
6307                         mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
6308         }
6309 }
6310
6311 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6312 {
6313         int i = LittleLong(((int *)buffer)[1]);
6314         if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
6315                 Mod_Q3BSP_Load(mod,buffer, bufferend);
6316         else if (i == Q2BSPVERSION)
6317                 Mod_Q2BSP_Load(mod,buffer, bufferend);
6318         else
6319                 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
6320 }
6321
6322 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6323 {
6324         Host_Error("Mod_MAP_Load: not yet implemented");
6325 }
6326
6327 typedef struct objvertex_s
6328 {
6329         float v[3];
6330         float vt[2];
6331         float vn[3];
6332 }
6333 objvertex_t;
6334
6335 typedef struct objtriangle_s
6336 {
6337         objvertex_t vertex[3];
6338         int textureindex;
6339 }
6340 objtriangle_t;
6341
6342 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
6343 {
6344 #if 0
6345         const char *textbase = (char *)buffer, *text = textbase;
6346         char *s;
6347         char *argv[512];
6348         char line[1024];
6349         char materialname[MAX_QPATH];
6350         int j, index1, index2, index3, first, prev, index;
6351         int argc;
6352         int linelen;
6353         int numtriangles = 0;
6354         int maxtriangles = 131072;
6355         objtriangle_t *triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
6356         int linenumber = 0;
6357         int maxtextures = 256, numtextures = 0, textureindex = 0;
6358         int maxv = 1024, numv = 0;
6359         int maxvt = 1024, numvt = 0;
6360         int maxvn = 1024, numvn = 0;
6361         char **texturenames;
6362         float *v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
6363         float *vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
6364         float *vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
6365         objvertex_t vfirst, vprev, vcurrent;
6366 #if 0
6367         int hashindex;
6368         int maxverthash = 65536, numverthash = 0;
6369         int numhashindex = 65536;
6370         struct objverthash_s
6371         {
6372                 struct objverthash_s *next;
6373                 int s;
6374                 int v;
6375                 int vt;
6376                 int vn;
6377         }
6378         *hash, **verthash = Mem_Alloc(tempmempool, numhashindex * sizeof(*verthash)), *verthashdata = Mem_Alloc(tempmempool, maxverthash * sizeof(*verthashdata)), *oldverthashdata;
6379 #endif
6380
6381         dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
6382
6383         loadmodel->modeldatatypestring = "OBJ";
6384
6385         loadmodel->type = mod_obj;
6386         loadmodel->soundfromcenter = true;
6387         loadmodel->TraceBox = Mod_OBJ_TraceBox;
6388         loadmodel->TraceLine = Mod_OBJ_TraceLine;
6389         loadmodel->TracePoint = Mod_OBJ_TracePoint;
6390         loadmodel->PointSuperContents = Mod_OBJ_PointSuperContents;
6391         loadmodel->brush.TraceLineOfSight = Mod_OBJ_TraceLineOfSight;
6392         loadmodel->brush.SuperContentsFromNativeContents = Mod_OBJ_SuperContentsFromNativeContents;
6393         loadmodel->brush.NativeContentsFromSuperContents = Mod_OBJ_NativeContentsFromSuperContents;
6394         loadmodel->brush.GetPVS = Mod_OBJ_GetPVS;
6395         loadmodel->brush.FatPVS = Mod_OBJ_FatPVS;
6396         loadmodel->brush.BoxTouchingPVS = Mod_OBJ_BoxTouchingPVS;
6397         loadmodel->brush.BoxTouchingLeafPVS = Mod_OBJ_BoxTouchingLeafPVS;
6398         loadmodel->brush.BoxTouchingVisibleLeafs = Mod_OBJ_BoxTouchingVisibleLeafs;
6399         loadmodel->brush.FindBoxClusters = Mod_OBJ_FindBoxClusters;
6400         loadmodel->brush.LightPoint = Mod_OBJ_LightPoint;
6401         loadmodel->brush.FindNonSolidLocation = Mod_OBJ_FindNonSolidLocation;
6402         loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
6403         loadmodel->brush.RoundUpToHullSize = NULL;
6404         loadmodel->brush.PointInLeaf = Mod_OBJ_PointInLeaf;
6405         loadmodel->Draw = R_Q1BSP_Draw;
6406         loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
6407         loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
6408         loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
6409         loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6410         loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6411         loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6412         loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6413         loadmodel->DrawLight = R_Q1BSP_DrawLight;
6414
6415         // parse the OBJ text now
6416         for(;;)
6417         {
6418                 if (!*text)
6419                         break;
6420                 linenumber++;
6421                 linelen = 0;
6422                 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
6423                         line[linelen] = text[linelen];
6424                 line[linelen] = 0;
6425                 for (argc = 0;argc < (int)(sizeof(argv)/sizeof(argv[0]));argc++)
6426                         argv[argc] = "";
6427                 argc = 0;
6428                 s = line;
6429                 while (*s == ' ' || *s == '\t')
6430                         s++;
6431                 while (*s)
6432                 {
6433                         argv[argc++] = s;
6434                         while (*s > ' ')
6435                                 s++;
6436                         if (!*s)
6437                                 break;
6438                         *s++ = 0;
6439                         while (*s == ' ' || *s == '\t')
6440                                 s++;
6441                 }
6442                 if (!argc)
6443                         continue;
6444                 if (argv[0][0] == '#')
6445                         continue;
6446                 if (!strcmp(argv[0], "v"))
6447                 {
6448                         if (maxv <= numv)
6449                         {
6450                                 float *oldv = v;
6451                                 maxv *= 2;
6452                                 v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
6453                                 if (oldv)
6454                                 {
6455                                         memcpy(v, oldv, numv * sizeof(float[3]));
6456                                         Mem_Free(oldv);
6457                                 }
6458                         }
6459                         v[numv*3+0] = atof(argv[1]);
6460                         v[numv*3+1] = atof(argv[2]);
6461                         v[numv*3+2] = atof(argv[3]);
6462                         numv++;
6463                 }
6464                 else if (!strcmp(argv[0], "vt"))
6465                 {
6466                         if (maxvt <= numvt)
6467                         {
6468                                 float *oldvt = vt;
6469                                 maxvt *= 2;
6470                                 vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
6471                                 if (oldvt)
6472                                 {
6473                                         memcpy(vt, oldvt, numvt * sizeof(float[2]));
6474                                         Mem_Free(oldvt);
6475                                 }
6476                         }
6477                         vt[numvt*2+0] = atof(argv[1]);
6478                         vt[numvt*2+1] = atof(argv[2]);
6479                         numvt++;
6480                 }
6481                 else if (!strcmp(argv[0], "vn"))
6482                 {
6483                         if (maxvn <= numvn)
6484                         {
6485                                 float *oldvn = vn;
6486                                 maxvn *= 2;
6487                                 vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
6488                                 if (oldvn)
6489                                 {
6490                                         memcpy(vn, oldvn, numvn * sizeof(float[3]));
6491                                         Mem_Free(oldvn);
6492                                 }
6493                         }
6494                         vn[numvn*3+0] = atof(argv[1]);
6495                         vn[numvn*3+1] = atof(argv[2]);
6496                         vn[numvn*3+2] = atof(argv[3]);
6497                         numvn++;
6498                 }
6499                 else if (!strcmp(argv[0], "f"))
6500                 {
6501                         for (j = 1;j < argc;j++)
6502                         {
6503                                 index1 = atoi(argv[j]);
6504                                 while(argv[j][0] && argv[j][0] != '/')
6505                                         argv[j]++;
6506                                 if (argv[j][0])
6507                                         argv[j]++;
6508                                 index2 = atoi(argv[j]);
6509                                 while(argv[j][0] && argv[j][0] != '/')
6510                                         argv[j]++;
6511                                 if (argv[j][0])
6512                                         argv[j]++;
6513                                 index3 = atoi(argv[j]);
6514                                 // negative refers to a recent vertex
6515                                 // zero means not specified
6516                                 // positive means an absolute vertex index
6517                                 if (index1 < 0)
6518                                         index1 = numv - index1;
6519                                 if (index2 < 0)
6520                                         index2 = numvt - index2;
6521                                 if (index3 < 0)
6522                                         index3 = numvn - index3;
6523                                 VectorCopy(v + 3*index1, vcurrent.v);
6524                                 Vector2Copy(vt + 2*index2, vcurrent.vt);
6525                                 VectorCopy(vn + 3*index3, vcurrent.vn);
6526                                 if (j == 1)
6527                                         vfirst = vcurrent;
6528                                 else if (j >= 3)
6529                                 {
6530                                         if (maxtriangles <= numtriangles)
6531                                         {
6532                                                 objtriangle_t *oldtriangles = triangles;
6533                                                 maxtriangles *= 2;
6534                                                 triangles = Mem_Alloc(tempmempool, numtriangles * sizeof(*triangles));
6535                                                 if (oldtriangles)
6536                                                 {
6537                                                         memcpy(triangles, oldtriangles, numtriangles * sizeof(*triangles));
6538                                                         Mem_Free(oldtriangles);
6539                                                 }
6540                                         }
6541                                         triangles[numtriangles].textureindex = textureindex;
6542                                         triangles[numtriangles].vertex[0] = vfirst;
6543                                         triangles[numtriangles].vertex[1] = vprev;
6544                                         triangles[numtriangles].vertex[2] = vcurrent;
6545                                         numtriangles++;
6546                                 }
6547                                 vprev = vcurrent;
6548                                 prev = index;
6549                         }
6550                 }
6551                 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
6552                         ;
6553                 else if (!!strcmp(argv[0], "usemtl"))
6554                 {
6555                         for (i = 0;i < numtextures;i++)
6556                                 if (!strcmp(texturenames[numtextures], argv[1]))
6557                                         break;
6558                         if (i < numtextures)
6559                                 texture = textures + i;
6560                         else
6561                         {
6562                                 if (maxtextures <= numtextures)
6563                                 {
6564                                         texture_t *oldtextures = textures;
6565                                         maxtextures *= 2;
6566                                         textures = Mem_Alloc(tempmempool, maxtextures * sizeof(*textures));
6567                                         if (oldtextures)
6568                                         {
6569                                                 memcpy(textures, oldtextures, numtexutres * sizeof(*textures));
6570                                                 Mem_Free(oldtextures);
6571                                         }
6572                                 }
6573                                 textureindex = numtextures++;
6574                                 texturenames[textureindex] = Mem_Alloc(tempmempool, strlen(argv[1]) + 1);
6575                                 memcpy(texturenames[textureindex], argv[1], strlen(argv[1]) + 1);
6576                         }
6577                 }
6578                 text += linelen;
6579                 if (*text == '\r')
6580                         text++;
6581                 if (*text == '\n')
6582                         text++;
6583         }
6584
6585         // now that we have the OBJ data loaded as-is, we can convert it
6586
6587         // load the textures
6588         loadmodel->num_textures = numtextures;
6589         loadmodel->data_textures = Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
6590         for (i = 0;i < numtextures;i++)
6591                 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, texturenames[i], true, true, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
6592
6593         // free the texturenames array since we are now done with it
6594         for (i = 0;i < numtextures;i++)
6595         {
6596                 Mem_Free(texturenames[i]);
6597                 texturenames[i] = NULL;
6598         }
6599         Mem_Free(texturenames);
6600         texturenames = NULL;
6601
6602         // generate a rough BSP tree from triangle data, we don't have to be too careful here, it only has to define the basic areas of the map
6603
6604         // generate surfaces by recursing triangles into BSP tree and ensuring they do not overlap in the lightmap projection axis
6605
6606         loadmodel->numskins = LittleLong(pinmodel->num_skins);
6607         numxyz = LittleLong(pinmodel->num_xyz);
6608         numst = LittleLong(pinmodel->num_st);
6609         loadmodel->surfmesh.num_triangles = LittleLong(pinmodel->num_tris);
6610         loadmodel->numframes = LittleLong(pinmodel->num_frames);
6611         loadmodel->surfmesh.num_morphframes = loadmodel->numframes;
6612         loadmodel->num_poses = loadmodel->surfmesh.num_morphframes;
6613         skinwidth = LittleLong(pinmodel->skinwidth);
6614         skinheight = LittleLong(pinmodel->skinheight);
6615         iskinwidth = 1.0f / skinwidth;
6616         iskinheight = 1.0f / skinheight;
6617
6618         loadmodel->num_surfaces = 1;
6619         loadmodel->nummodelsurfaces = loadmodel->num_surfaces;
6620         data = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * sizeof(msurface_t) + loadmodel->num_surfaces * sizeof(int) + loadmodel->numframes * sizeof(animscene_t) + loadmodel->numframes * sizeof(float[6]) + loadmodel->surfmesh.num_triangles * sizeof(int[3]) + loadmodel->surfmesh.num_triangles * sizeof(int[3]));
6621         loadmodel->data_surfaces = (msurface_t *)data;data += loadmodel->num_surfaces * sizeof(msurface_t);
6622         loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
6623         loadmodel->sortedmodelsurfaces[0] = 0;
6624         loadmodel->animscenes = (animscene_t *)data;data += loadmodel->numframes * sizeof(animscene_t);
6625         loadmodel->surfmesh.data_morphmd2framesize6f = (float *)data;data += loadmodel->numframes * sizeof(float[6]);
6626         loadmodel->surfmesh.data_element3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
6627         loadmodel->surfmesh.data_neighbor3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
6628
6629         loadmodel->synctype = ST_RAND;
6630
6631         // load the skins
6632         inskin = (char *)(base + LittleLong(pinmodel->ofs_skins));
6633         skinfiles = Mod_LoadSkinFiles();
6634         if (skinfiles)
6635         {
6636                 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
6637                 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
6638                 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
6639                 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures, skinfiles, "default", "");
6640                 Mod_FreeSkinFiles(skinfiles);
6641         }
6642         else if (loadmodel->numskins)
6643         {
6644                 // skins found (most likely not a player model)
6645                 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
6646                 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
6647                 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
6648                 for (i = 0;i < loadmodel->numskins;i++, inskin += MD2_SKINNAME)
6649                         Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i * loadmodel->num_surfaces, inskin, true, true, (r_mipskins.integer ? TEXF_MIPMAP : 0) | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP | TEXF_COMPRESS);
6650         }
6651         else
6652         {
6653                 // no skins (most likely a player model)
6654                 loadmodel->numskins = 1;
6655                 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
6656                 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
6657                 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
6658                 Mod_BuildAliasSkinFromSkinFrame(loadmodel->data_textures, NULL);
6659         }
6660
6661         loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
6662         for (i = 0;i < loadmodel->numskins;i++)
6663         {
6664                 loadmodel->skinscenes[i].firstframe = i;
6665                 loadmodel->skinscenes[i].framecount = 1;
6666                 loadmodel->skinscenes[i].loop = true;
6667                 loadmodel->skinscenes[i].framerate = 10;
6668         }
6669
6670         // load the triangles and stvert data
6671         inst = (unsigned short *)(base + LittleLong(pinmodel->ofs_st));
6672         intri = (md2triangle_t *)(base + LittleLong(pinmodel->ofs_tris));
6673         md2verthash = (struct md2verthash_s **)Mem_Alloc(tempmempool, 65536 * sizeof(hash));
6674         md2verthashdata = (struct md2verthash_s *)Mem_Alloc(tempmempool, loadmodel->surfmesh.num_triangles * 3 * sizeof(*hash));
6675         // swap the triangle list
6676         loadmodel->surfmesh.num_vertices = 0;
6677         for (i = 0;i < loadmodel->surfmesh.num_triangles;i++)
6678         {
6679                 for (j = 0;j < 3;j++)
6680                 {
6681                         xyz = (unsigned short) LittleShort (intri[i].index_xyz[j]);
6682                         st = (unsigned short) LittleShort (intri[i].index_st[j]);
6683                         if (xyz >= numxyz)
6684                         {
6685                                 Con_Printf("%s has an invalid xyz index (%i) on triangle %i, resetting to 0\n", loadmodel->name, xyz, i);
6686                                 xyz = 0;
6687                         }
6688                         if (st >= numst)
6689                         {
6690                                 Con_Printf("%s has an invalid st index (%i) on triangle %i, resetting to 0\n", loadmodel->name, st, i);
6691                                 st = 0;
6692                         }
6693                         hashindex = (xyz * 256 + st) & 65535;
6694                         for (hash = md2verthash[hashindex];hash;hash = hash->next)
6695                                 if (hash->xyz == xyz && hash->st == st)
6696                                         break;
6697                         if (hash == NULL)
6698                         {
6699                                 hash = md2verthashdata + loadmodel->surfmesh.num_vertices++;
6700                                 hash->xyz = xyz;
6701                                 hash->st = st;
6702                                 hash->next = md2verthash[hashindex];
6703                                 md2verthash[hashindex] = hash;
6704                         }
6705                         loadmodel->surfmesh.data_element3i[i*3+j] = (hash - md2verthashdata);
6706                 }
6707         }
6708
6709         vertremap = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(int));
6710         data = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(float[2]) + loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t));
6711         loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += loadmodel->surfmesh.num_vertices * sizeof(float[2]);
6712         loadmodel->surfmesh.data_morphmdlvertex = (trivertx_t *)data;data += loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t);
6713         for (i = 0;i < loadmodel->surfmesh.num_vertices;i++)
6714         {
6715                 int sts, stt;
6716                 hash = md2verthashdata + i;
6717                 vertremap[i] = hash->xyz;
6718                 sts = LittleShort(inst[hash->st*2+0]);
6719                 stt = LittleShort(inst[hash->st*2+1]);
6720                 if (sts < 0 || sts >= skinwidth || stt < 0 || stt >= skinheight)
6721                 {
6722                         Con_Printf("%s has an invalid skin coordinate (%i %i) on vert %i, changing to 0 0\n", loadmodel->name, sts, stt, i);
6723                         sts = 0;
6724                         stt = 0;
6725                 }
6726                 loadmodel->surfmesh.data_texcoordtexture2f[i*2+0] = sts * iskinwidth;
6727                 loadmodel->surfmesh.data_texcoordtexture2f[i*2+1] = stt * iskinheight;
6728         }
6729
6730         Mem_Free(md2verthash);
6731         Mem_Free(md2verthashdata);
6732
6733         // generate ushort elements array if possible
6734         if (loadmodel->surfmesh.num_vertices <= 65536)
6735                 loadmodel->surfmesh.data_element3s = (unsigned short *)Mem_Alloc(loadmodel->mempool, sizeof(unsigned short[3]) * loadmodel->surfmesh.num_triangles);
6736
6737         // load the frames
6738         datapointer = (base + LittleLong(pinmodel->ofs_frames));
6739         for (i = 0;i < loadmodel->surfmesh.num_morphframes;i++)
6740         {
6741                 int k;
6742                 trivertx_t *v;
6743                 trivertx_t *out;
6744                 pinframe = (md2frame_t *)datapointer;
6745                 datapointer += sizeof(md2frame_t);
6746                 // store the frame scale/translate into the appropriate array
6747                 for (j = 0;j < 3;j++)
6748                 {
6749                         loadmodel->surfmesh.data_morphmd2framesize6f[i*6+j] = LittleFloat(pinframe->scale[j]);
6750                         loadmodel->surfmesh.data_morphmd2framesize6f[i*6+3+j] = LittleFloat(pinframe->translate[j]);
6751                 }
6752                 // convert the vertices
6753                 v = (trivertx_t *)datapointer;
6754                 out = loadmodel->surfmesh.data_morphmdlvertex + i * loadmodel->surfmesh.num_vertices;
6755                 for (k = 0;k < loadmodel->surfmesh.num_vertices;k++)
6756                         out[k] = v[vertremap[k]];
6757                 datapointer += numxyz * sizeof(trivertx_t);
6758
6759                 strlcpy(loadmodel->animscenes[i].name, pinframe->name, sizeof(loadmodel->animscenes[i].name));
6760                 loadmodel->animscenes[i].firstframe = i;
6761                 loadmodel->animscenes[i].framecount = 1;
6762                 loadmodel->animscenes[i].framerate = 10;
6763                 loadmodel->animscenes[i].loop = true;
6764         }
6765
6766         Mem_Free(vertremap);
6767
6768         Mod_MakeSortedSurfaces(loadmodel);
6769         Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
6770         Mod_Alias_CalculateBoundingBox();
6771         Mod_Alias_MorphMesh_CompileFrames();
6772
6773         surface = loadmodel->data_surfaces;
6774         surface->texture = loadmodel->data_textures;
6775         surface->num_firsttriangle = 0;
6776         surface->num_triangles = loadmodel->surfmesh.num_triangles;
6777         surface->num_firstvertex = 0;
6778         surface->num_vertices = loadmodel->surfmesh.num_vertices;
6779
6780         loadmodel->surfmesh.isanimated = false;
6781
6782         if (loadmodel->surfmesh.data_element3s)
6783                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
6784                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
6785 #endif
6786 }
6787
6788 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
6789 {
6790         // we already have done PVS culling at this point...
6791         // so we don't need to do it again.
6792
6793         int i;
6794         vec3_t testorigin, mins, maxs;
6795
6796         testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
6797         testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
6798         testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
6799
6800         if(model->brush.TraceLineOfSight(model, eye, testorigin))
6801                 return 1;
6802
6803         // expand the box a little
6804         mins[0] = (t+1) * minsX[0] - t * maxsX[0];
6805         maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
6806         mins[1] = (t+1) * minsX[1] - t * maxsX[1];
6807         maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
6808         mins[2] = (t+1) * minsX[2] - t * maxsX[2];
6809         maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
6810
6811         for(i = 0; i != numsamples; ++i)
6812         {
6813                 testorigin[0] = lhrandom(mins[0], maxs[0]);
6814                 testorigin[1] = lhrandom(mins[1], maxs[1]);
6815                 testorigin[2] = lhrandom(mins[2], maxs[2]);
6816
6817                 if(model->brush.TraceLineOfSight(model, eye, testorigin))
6818                         return 1;
6819         }
6820
6821         return 0;
6822 }
6823