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 (-1 avoids any box tests)"};
  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 (-1 avoids any box tests)"};
  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 > 0)
 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, const frameblend_t *frameblend, const skeleton_t *skeleton, 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, const frameblend_t *frameblend, const skeleton_t *skeleton, 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, frameblend, skeleton, 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, const frameblend_t *frameblend, const skeleton_t *skeleton, 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, frameblend, skeleton, trace, start, hitsupercontentsmask);
 934                 else
 935                         Mod_Q1BSP_TraceLine(model, frameblend, skeleton, 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, NULL, NULL, &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 x, y;
1327         int w = width/2;
1328         int h = height;
1329         unsigned *solidpixels = Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1330         unsigned *alphapixels = Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1331
1332         // allocate a texture pool if we need it
1333         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1334                 loadmodel->texturepool = R_AllocTexturePool();
1335
1336         if (bytesperpixel == 4)
1337         {
1338                 for (y = 0;y < h;y++)
1339                 {
1340                         for (x = 0;x < w;x++)
1341                         {
1342                                 solidpixels[y*w+x] = ((unsigned *)src)[y*width+x+w];
1343                                 alphapixels[y*w+x] = ((unsigned *)src)[y*width+x];
1344                         }
1345                 }
1346         }
1347         else
1348         {
1349                 // make an average value for the back to avoid
1350                 // a fringe on the top level
1351                 int p, r, g, b;
1352                 union
1353                 {
1354                         unsigned int i;
1355                         unsigned char b[4];
1356                 }
1357                 bgra;
1358                 r = g = b = 0;
1359                 for (y = 0;y < h;y++)
1360                 {
1361                         for (x = 0;x < w;x++)
1362                         {
1363                                 p = src[x*width+y+w];
1364                                 r += palette_rgb[p][0];
1365                                 g += palette_rgb[p][1];
1366                                 b += palette_rgb[p][2];
1367                         }
1368                 }
1369                 bgra.b[2] = r/(w*h);
1370                 bgra.b[1] = g/(w*h);
1371                 bgra.b[0] = b/(w*h);
1372                 bgra.b[3] = 0;
1373                 for (y = 0;y < h;y++)
1374                 {
1375                         for (x = 0;x < w;x++)
1376                         {
1377                                 solidpixels[y*w+x] = palette_bgra_complete[src[y*width+x+w]];
1378                                 p = src[y*width+x];
1379                                 alphapixels[y*w+x] = p ? palette_bgra_complete[p] : bgra.i;
1380                         }
1381                 }
1382         }
1383
1384         loadmodel->brush.solidskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_solidtexture",              TEXF_PRECACHE, (unsigned char *) solidpixels, w, h);
1385         loadmodel->brush.alphaskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_alphatexture", TEXF_ALPHA | TEXF_PRECACHE, (unsigned char *) alphapixels, w, h);
1386         Mem_Free(solidpixels);
1387         Mem_Free(alphapixels);
1388 }
1389
1390 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1391 {
1392         int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1393         skinframe_t *skinframe;
1394         miptex_t *dmiptex;
1395         texture_t *tx, *tx2, *anims[10], *altanims[10];
1396         dmiptexlump_t *m;
1397         unsigned char *data, *mtdata;
1398         const char *s;
1399         char mapname[MAX_QPATH], name[MAX_QPATH];
1400         unsigned char zero[4];
1401
1402         memset(zero, 0, sizeof(zero));
1403
1404         loadmodel->data_textures = NULL;
1405
1406         // add two slots for notexture walls and notexture liquids
1407         if (l->filelen)
1408         {
1409                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1410                 m->nummiptex = LittleLong (m->nummiptex);
1411                 loadmodel->num_textures = m->nummiptex + 2;
1412                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1413         }
1414         else
1415         {
1416                 m = NULL;
1417                 loadmodel->num_textures = 2;
1418                 loadmodel->num_texturesperskin = loadmodel->num_textures;
1419         }
1420
1421         loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1422
1423         // fill out all slots with notexture
1424         if (cls.state != ca_dedicated)
1425                 skinframe = R_SkinFrame_LoadMissing();
1426         else
1427                 skinframe = NULL;
1428         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1429         {
1430                 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1431                 tx->width = 16;
1432                 tx->height = 16;
1433                 if (cls.state != ca_dedicated)
1434                 {
1435                         tx->numskinframes = 1;
1436                         tx->skinframerate = 1;
1437                         tx->skinframes[0] = skinframe;
1438                         tx->currentskinframe = tx->skinframes[0];
1439                 }
1440                 tx->basematerialflags = MATERIALFLAG_WALL;
1441                 if (i == loadmodel->num_textures - 1)
1442                 {
1443                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1444                         tx->supercontents = mod_q1bsp_texture_water.supercontents;
1445                         tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1446                 }
1447                 else
1448                 {
1449                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1450                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1451                 }
1452                 tx->currentframe = tx;
1453
1454                 // clear water settings
1455                 tx->reflectmin = 0;
1456                 tx->reflectmax = 1;
1457                 tx->refractfactor = 1;
1458                 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1459                 tx->reflectfactor = 1;
1460                 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1461                 tx->r_water_wateralpha = 1;
1462         }
1463
1464         if (!m)
1465         {
1466                 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1467                 return;
1468         }
1469
1470         s = loadmodel->name;
1471         if (!strncasecmp(s, "maps/", 5))
1472                 s += 5;
1473         FS_StripExtension(s, mapname, sizeof(mapname));
1474
1475         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1476         dofs = m->dataofs;
1477         // LordHavoc: mostly rewritten map texture loader
1478         for (i = 0;i < m->nummiptex;i++)
1479         {
1480                 dofs[i] = LittleLong(dofs[i]);
1481                 if (r_nosurftextures.integer)
1482                         continue;
1483                 if (dofs[i] == -1)
1484                 {
1485                         Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1486                         continue;
1487                 }
1488                 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1489
1490                 // copy name, but only up to 16 characters
1491                 // (the output buffer can hold more than this, but the input buffer is
1492                 //  only 16)
1493                 for (j = 0;j < 16 && dmiptex->name[j];j++)
1494                         name[j] = dmiptex->name[j];
1495                 name[j] = 0;
1496
1497                 if (!name[0])
1498                 {
1499                         dpsnprintf(name, sizeof(name), "unnamed%i", i);
1500                         Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1501                 }
1502
1503                 mtwidth = LittleLong(dmiptex->width);
1504                 mtheight = LittleLong(dmiptex->height);
1505                 mtdata = NULL;
1506                 j = LittleLong(dmiptex->offsets[0]);
1507                 if (j)
1508                 {
1509                         // texture included
1510                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1511                         {
1512                                 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1513                                 continue;
1514                         }
1515                         mtdata = (unsigned char *)dmiptex + j;
1516                 }
1517
1518                 if ((mtwidth & 15) || (mtheight & 15))
1519                         Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1520
1521                 // LordHavoc: force all names to lowercase
1522                 for (j = 0;name[j];j++)
1523                         if (name[j] >= 'A' && name[j] <= 'Z')
1524                                 name[j] += 'a' - 'A';
1525
1526                 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1527                         continue;
1528
1529                 tx = loadmodel->data_textures + i;
1530                 strlcpy(tx->name, name, sizeof(tx->name));
1531                 tx->width = mtwidth;
1532                 tx->height = mtheight;
1533
1534                 if (tx->name[0] == '*')
1535                 {
1536                         if (!strncmp(tx->name, "*lava", 5))
1537                         {
1538                                 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1539                                 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1540                         }
1541                         else if (!strncmp(tx->name, "*slime", 6))
1542                         {
1543                                 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1544                                 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1545                         }
1546                         else
1547                         {
1548                                 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1549                                 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1550                         }
1551                 }
1552                 else if (!strncmp(tx->name, "sky", 3))
1553                 {
1554                         tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1555                         tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1556                 }
1557                 else
1558                 {
1559                         tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1560                         tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1561                 }
1562
1563                 if (cls.state != ca_dedicated)
1564                 {
1565                         // LordHavoc: HL sky textures are entirely different than quake
1566                         if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == mtheight * 2)
1567                         {
1568                                 data = loadimagepixelsbgra(tx->name, false, false);
1569                                 if (data && image_width == image_height * 2)
1570                                 {
1571                                         R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1572                                         Mem_Free(data);
1573                                 }
1574                                 else if (mtdata != NULL)
1575                                         R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1576                         }
1577                         else
1578                         {
1579                                 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);
1580                                 if (!skinframe)
1581                                         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);
1582                                 if (!skinframe)
1583                                 {
1584                                         // did not find external texture, load it from the bsp or wad3
1585                                         if (loadmodel->brush.ishlbsp)
1586                                         {
1587                                                 // internal texture overrides wad
1588                                                 unsigned char *pixels, *freepixels;
1589                                                 pixels = freepixels = NULL;
1590                                                 if (mtdata)
1591                                                         pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1592                                                 if (pixels == NULL)
1593                                                         pixels = freepixels = W_GetTextureBGRA(tx->name);
1594                                                 if (pixels != NULL)
1595                                                 {
1596                                                         tx->width = image_width;
1597                                                         tx->height = image_height;
1598                                                         skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1599                                                 }
1600                                                 if (freepixels)
1601                                                         Mem_Free(freepixels);
1602                                         }
1603                                         else if (mtdata) // texture included
1604                                                 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_PRECACHE | TEXF_MIPMAP | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1605                                 }
1606                                 // if skinframe is still NULL the "missing" texture will be used
1607                                 if (skinframe)
1608                                         tx->skinframes[0] = skinframe;
1609                         }
1610
1611                         tx->basematerialflags = MATERIALFLAG_WALL;
1612                         if (tx->name[0] == '*')
1613                         {
1614                                 // LordHavoc: some turbulent textures should not be affected by wateralpha
1615                                 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1616                                 {
1617                                         // replace the texture with transparent black
1618                                         Vector4Set(zero, 128, 128, 128, 128);
1619                                         tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1620                                         tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1621                                 }
1622                                 else if (!strncmp(tx->name,"*lava",5)
1623                                  || !strncmp(tx->name,"*teleport",9)
1624                                  || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1625                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1626                                 else
1627                                         tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1628                                 if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1629                                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1630                         }
1631                         else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1632                         {
1633                                 // replace the texture with black
1634                                 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1635                                 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1636                         }
1637                         else if (!strncmp(tx->name, "sky", 3))
1638                                 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1639                         else if (!strcmp(tx->name, "caulk"))
1640                                 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1641                         else if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1642                                 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1643
1644                         // start out with no animation
1645                         tx->currentframe = tx;
1646                         tx->currentskinframe = tx->skinframes[0];
1647                 }
1648         }
1649
1650         // sequence the animations
1651         for (i = 0;i < m->nummiptex;i++)
1652         {
1653                 tx = loadmodel->data_textures + i;
1654                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1655                         continue;
1656                 if (tx->anim_total[0] || tx->anim_total[1])
1657                         continue;       // already sequenced
1658
1659                 // find the number of frames in the animation
1660                 memset(anims, 0, sizeof(anims));
1661                 memset(altanims, 0, sizeof(altanims));
1662
1663                 for (j = i;j < m->nummiptex;j++)
1664                 {
1665                         tx2 = loadmodel->data_textures + j;
1666                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1667                                 continue;
1668
1669                         num = tx2->name[1];
1670                         if (num >= '0' && num <= '9')
1671                                 anims[num - '0'] = tx2;
1672                         else if (num >= 'a' && num <= 'j')
1673                                 altanims[num - 'a'] = tx2;
1674                         else
1675                                 Con_Printf("Bad animating texture %s\n", tx->name);
1676                 }
1677
1678                 max = altmax = 0;
1679                 for (j = 0;j < 10;j++)
1680                 {
1681                         if (anims[j])
1682                                 max = j + 1;
1683                         if (altanims[j])
1684                                 altmax = j + 1;
1685                 }
1686                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1687
1688                 incomplete = false;
1689                 for (j = 0;j < max;j++)
1690                 {
1691                         if (!anims[j])
1692                         {
1693                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1694                                 incomplete = true;
1695                         }
1696                 }
1697                 for (j = 0;j < altmax;j++)
1698                 {
1699                         if (!altanims[j])
1700                         {
1701                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1702                                 incomplete = true;
1703                         }
1704                 }
1705                 if (incomplete)
1706                         continue;
1707
1708                 if (altmax < 1)
1709                 {
1710                         // if there is no alternate animation, duplicate the primary
1711                         // animation into the alternate
1712                         altmax = max;
1713                         for (k = 0;k < 10;k++)
1714                                 altanims[k] = anims[k];
1715                 }
1716
1717                 // link together the primary animation
1718                 for (j = 0;j < max;j++)
1719                 {
1720                         tx2 = anims[j];
1721                         tx2->animated = true;
1722                         tx2->anim_total[0] = max;
1723                         tx2->anim_total[1] = altmax;
1724                         for (k = 0;k < 10;k++)
1725                         {
1726                                 tx2->anim_frames[0][k] = anims[k];
1727                                 tx2->anim_frames[1][k] = altanims[k];
1728                         }
1729                 }
1730
1731                 // if there really is an alternate anim...
1732                 if (anims[0] != altanims[0])
1733                 {
1734                         // link together the alternate animation
1735                         for (j = 0;j < altmax;j++)
1736                         {
1737                                 tx2 = altanims[j];
1738                                 tx2->animated = true;
1739                                 // the primary/alternate are reversed here
1740                                 tx2->anim_total[0] = altmax;
1741                                 tx2->anim_total[1] = max;
1742                                 for (k = 0;k < 10;k++)
1743                                 {
1744                                         tx2->anim_frames[0][k] = altanims[k];
1745                                         tx2->anim_frames[1][k] = anims[k];
1746                                 }
1747                         }
1748                 }
1749         }
1750 }
1751
1752 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1753 {
1754         int i;
1755         unsigned char *in, *out, *data, d;
1756         char litfilename[MAX_QPATH];
1757         char dlitfilename[MAX_QPATH];
1758         fs_offset_t filesize;
1759         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1760         {
1761                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1762                 for (i=0; i<l->filelen; i++)
1763                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1764         }
1765         else // LordHavoc: bsp version 29 (normal white lighting)
1766         {
1767                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1768                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1769                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1770                 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1771                 strlcat (litfilename, ".lit", sizeof (litfilename));
1772                 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1773                 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1774                 if (data)
1775                 {
1776                         if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1777                         {
1778                                 i = LittleLong(((int *)data)[1]);
1779                                 if (i == 1)
1780                                 {
1781                                         if (developer_loading.integer)
1782                                                 Con_Printf("loaded %s\n", litfilename);
1783                                         loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1784                                         memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1785                                         Mem_Free(data);
1786                                         data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1787                                         if (data)
1788                                         {
1789                                                 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1790                                                 {
1791                                                         i = LittleLong(((int *)data)[1]);
1792                                                         if (i == 1)
1793                                                         {
1794                                                                 if (developer_loading.integer)
1795                                                                         Con_Printf("loaded %s\n", dlitfilename);
1796                                                                 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1797                                                                 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1798                                                                 loadmodel->brushq3.deluxemapping_modelspace = false;
1799                                                                 loadmodel->brushq3.deluxemapping = true;
1800                                                         }
1801                                                 }
1802                                                 Mem_Free(data);
1803                                                 data = NULL;
1804                                         }
1805                                         return;
1806                                 }
1807                                 else
1808                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1809                         }
1810                         else if (filesize == 8)
1811                                 Con_Print("Empty .lit file, ignoring\n");
1812                         else
1813                                 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1814                         if (data)
1815                         {
1816                                 Mem_Free(data);
1817                                 data = NULL;
1818                         }
1819                 }
1820                 // LordHavoc: oh well, expand the white lighting data
1821                 if (!l->filelen)
1822                         return;
1823                 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1824                 in = mod_base + l->fileofs;
1825                 out = loadmodel->brushq1.lightdata;
1826                 for (i = 0;i < l->filelen;i++)
1827                 {
1828                         d = *in++;
1829                         *out++ = d;
1830                         *out++ = d;
1831                         *out++ = d;
1832                 }
1833         }
1834 }
1835
1836 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1837 {
1838         loadmodel->brushq1.num_compressedpvs = 0;
1839         loadmodel->brushq1.data_compressedpvs = NULL;
1840         if (!l->filelen)
1841                 return;
1842         loadmodel->brushq1.num_compressedpvs = l->filelen;
1843         loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1844         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1845 }
1846
1847 // used only for HalfLife maps
1848 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1849 {
1850         char key[128], value[4096];
1851         int i, j, k;
1852         if (!data)
1853                 return;
1854         if (!COM_ParseToken_Simple(&data, false, false))
1855                 return; // error
1856         if (com_token[0] != '{')
1857                 return; // error
1858         while (1)
1859         {
1860                 if (!COM_ParseToken_Simple(&data, false, false))
1861                         return; // error
1862                 if (com_token[0] == '}')
1863                         break; // end of worldspawn
1864                 if (com_token[0] == '_')
1865                         strlcpy(key, com_token + 1, sizeof(key));
1866                 else
1867                         strlcpy(key, com_token, sizeof(key));
1868                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1869                         key[strlen(key)-1] = 0;
1870                 if (!COM_ParseToken_Simple(&data, false, false))
1871                         return; // error
1872                 dpsnprintf(value, sizeof(value), "%s", com_token);
1873                 if (!strcmp("wad", key)) // for HalfLife maps
1874                 {
1875                         if (loadmodel->brush.ishlbsp)
1876                         {
1877                                 j = 0;
1878                                 for (i = 0;i < (int)sizeof(value);i++)
1879                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1880                                                 break;
1881                                 if (value[i])
1882                                 {
1883                                         for (;i < (int)sizeof(value);i++)
1884                                         {
1885                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1886                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1887                                                         j = i+1;
1888                                                 else if (value[i] == ';' || value[i] == 0)
1889                                                 {
1890                                                         k = value[i];
1891                                                         value[i] = 0;
1892                                                         W_LoadTextureWadFile(&value[j], false);
1893                                                         j = i+1;
1894                                                         if (!k)
1895                                                                 break;
1896                                                 }
1897                                         }
1898                                 }
1899                         }
1900                 }
1901         }
1902 }
1903
1904 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1905 {
1906         loadmodel->brush.entities = NULL;
1907         if (!l->filelen)
1908                 return;
1909         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
1910         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1911         loadmodel->brush.entities[l->filelen] = 0;
1912         if (loadmodel->brush.ishlbsp)
1913                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1914 }
1915
1916
1917 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1918 {
1919         dvertex_t       *in;
1920         mvertex_t       *out;
1921         int                     i, count;
1922
1923         in = (dvertex_t *)(mod_base + l->fileofs);
1924         if (l->filelen % sizeof(*in))
1925                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1926         count = l->filelen / sizeof(*in);
1927         out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1928
1929         loadmodel->brushq1.vertexes = out;
1930         loadmodel->brushq1.numvertexes = count;
1931
1932         for ( i=0 ; i<count ; i++, in++, out++)
1933         {
1934                 out->position[0] = LittleFloat(in->point[0]);
1935                 out->position[1] = LittleFloat(in->point[1]);
1936                 out->position[2] = LittleFloat(in->point[2]);
1937         }
1938 }
1939
1940 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1941 // can be used for this
1942 // REMOVEME
1943 int SB_ReadInt (unsigned char **buffer)
1944 {
1945         int     i;
1946         i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1947         (*buffer) += 4;
1948         return i;
1949 }
1950
1951 // REMOVEME
1952 float SB_ReadFloat (unsigned char **buffer)
1953 {
1954         union
1955         {
1956                 int             i;
1957                 float   f;
1958         } u;
1959
1960         u.i = SB_ReadInt (buffer);
1961         return u.f;
1962 }
1963
1964 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1965 {
1966         unsigned char           *index;
1967         dmodel_t        *out;
1968         int                     i, j, count;
1969
1970         index = (unsigned char *)(mod_base + l->fileofs);
1971         if (l->filelen % (48+4*hullinfo->filehulls))
1972                 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1973
1974         count = l->filelen / (48+4*hullinfo->filehulls);
1975         out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1976
1977         loadmodel->brushq1.submodels = out;
1978         loadmodel->brush.numsubmodels = count;
1979
1980         for (i = 0; i < count; i++, out++)
1981         {
1982         // spread out the mins / maxs by a pixel
1983                 out->mins[0] = SB_ReadFloat (&index) - 1;
1984                 out->mins[1] = SB_ReadFloat (&index) - 1;
1985                 out->mins[2] = SB_ReadFloat (&index) - 1;
1986                 out->maxs[0] = SB_ReadFloat (&index) + 1;
1987                 out->maxs[1] = SB_ReadFloat (&index) + 1;
1988                 out->maxs[2] = SB_ReadFloat (&index) + 1;
1989                 out->origin[0] = SB_ReadFloat (&index);
1990                 out->origin[1] = SB_ReadFloat (&index);
1991                 out->origin[2] = SB_ReadFloat (&index);
1992                 for (j = 0; j < hullinfo->filehulls; j++)
1993                         out->headnode[j] = SB_ReadInt (&index);
1994                 out->visleafs = SB_ReadInt (&index);
1995                 out->firstface = SB_ReadInt (&index);
1996                 out->numfaces = SB_ReadInt (&index);
1997         }
1998 }
1999
2000 static void Mod_Q1BSP_LoadEdges(lump_t *l)
2001 {
2002         dedge_t *in;
2003         medge_t *out;
2004         int     i, count;
2005
2006         in = (dedge_t *)(mod_base + l->fileofs);
2007         if (l->filelen % sizeof(*in))
2008                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2009         count = l->filelen / sizeof(*in);
2010         out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2011
2012         loadmodel->brushq1.edges = out;
2013         loadmodel->brushq1.numedges = count;
2014
2015         for ( i=0 ; i<count ; i++, in++, out++)
2016         {
2017                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2018                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2019                 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2020                 {
2021                         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);
2022                         if(!loadmodel->brushq1.numvertexes)
2023                                 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2024
2025                         out->v[0] = 0;
2026                         out->v[1] = 0;
2027                 }
2028         }
2029 }
2030
2031 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2032 {
2033         texinfo_t *in;
2034         mtexinfo_t *out;
2035         int i, j, k, count, miptex;
2036
2037         in = (texinfo_t *)(mod_base + l->fileofs);
2038         if (l->filelen % sizeof(*in))
2039                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2040         count = l->filelen / sizeof(*in);
2041         out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2042
2043         loadmodel->brushq1.texinfo = out;
2044         loadmodel->brushq1.numtexinfo = count;
2045
2046         for (i = 0;i < count;i++, in++, out++)
2047         {
2048                 for (k = 0;k < 2;k++)
2049                         for (j = 0;j < 4;j++)
2050                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2051
2052                 miptex = LittleLong(in->miptex);
2053                 out->flags = LittleLong(in->flags);
2054
2055                 out->texture = NULL;
2056                 if (loadmodel->data_textures)
2057                 {
2058                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2059                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2060                         else
2061                                 out->texture = loadmodel->data_textures + miptex;
2062                 }
2063                 if (out->flags & TEX_SPECIAL)
2064                 {
2065                         // if texture chosen is NULL or the shader needs a lightmap,
2066                         // force to notexture water shader
2067                         if (out->texture == NULL)
2068                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2069                 }
2070                 else
2071                 {
2072                         // if texture chosen is NULL, force to notexture
2073                         if (out->texture == NULL)
2074                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2075                 }
2076         }
2077 }
2078
2079 #if 0
2080 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2081 {
2082         int             i, j;
2083         float   *v;
2084
2085         mins[0] = mins[1] = mins[2] = 9999;
2086         maxs[0] = maxs[1] = maxs[2] = -9999;
2087         v = verts;
2088         for (i = 0;i < numverts;i++)
2089         {
2090                 for (j = 0;j < 3;j++, v++)
2091                 {
2092                         if (*v < mins[j])
2093                                 mins[j] = *v;
2094                         if (*v > maxs[j])
2095                                 maxs[j] = *v;
2096                 }
2097         }
2098 }
2099
2100 #define MAX_SUBDIVPOLYTRIANGLES 4096
2101 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2102
2103 static int subdivpolyverts, subdivpolytriangles;
2104 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2105 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2106
2107 static int subdivpolylookupvert(vec3_t v)
2108 {
2109         int i;
2110         for (i = 0;i < subdivpolyverts;i++)
2111                 if (subdivpolyvert[i][0] == v[0]
2112                  && subdivpolyvert[i][1] == v[1]
2113                  && subdivpolyvert[i][2] == v[2])
2114                         return i;
2115         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2116                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2117         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2118         return subdivpolyverts++;
2119 }
2120
2121 static void SubdividePolygon(int numverts, float *verts)
2122 {
2123         int             i, i1, i2, i3, f, b, c, p;
2124         vec3_t  mins, maxs, front[256], back[256];
2125         float   m, *pv, *cv, dist[256], frac;
2126
2127         if (numverts > 250)
2128                 Host_Error("SubdividePolygon: ran out of verts in buffer");
2129
2130         BoundPoly(numverts, verts, mins, maxs);
2131
2132         for (i = 0;i < 3;i++)
2133         {
2134                 m = (mins[i] + maxs[i]) * 0.5;
2135                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2136                 if (maxs[i] - m < 8)
2137                         continue;
2138                 if (m - mins[i] < 8)
2139                         continue;
2140
2141                 // cut it
2142                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2143                         dist[c] = cv[i] - m;
2144
2145                 f = b = 0;
2146                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2147                 {
2148                         if (dist[p] >= 0)
2149                         {
2150                                 VectorCopy(pv, front[f]);
2151                                 f++;
2152                         }
2153                         if (dist[p] <= 0)
2154                         {
2155                                 VectorCopy(pv, back[b]);
2156                                 b++;
2157                         }
2158                         if (dist[p] == 0 || dist[c] == 0)
2159                                 continue;
2160                         if ((dist[p] > 0) != (dist[c] > 0) )
2161                         {
2162                                 // clip point
2163                                 frac = dist[p] / (dist[p] - dist[c]);
2164                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2165                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2166                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2167                                 f++;
2168                                 b++;
2169                         }
2170                 }
2171
2172                 SubdividePolygon(f, front[0]);
2173                 SubdividePolygon(b, back[0]);
2174                 return;
2175         }
2176
2177         i1 = subdivpolylookupvert(verts);
2178         i2 = subdivpolylookupvert(verts + 3);
2179         for (i = 2;i < numverts;i++)
2180         {
2181                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2182                 {
2183                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2184                         return;
2185                 }
2186
2187                 i3 = subdivpolylookupvert(verts + i * 3);
2188                 subdivpolyindex[subdivpolytriangles][0] = i1;
2189                 subdivpolyindex[subdivpolytriangles][1] = i2;
2190                 subdivpolyindex[subdivpolytriangles][2] = i3;
2191                 i2 = i3;
2192                 subdivpolytriangles++;
2193         }
2194 }
2195
2196 //Breaks a polygon up along axial 64 unit
2197 //boundaries so that turbulent and sky warps
2198 //can be done reasonably.
2199 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2200 {
2201         int i, j;
2202         surfvertex_t *v;
2203         surfmesh_t *mesh;
2204
2205         subdivpolytriangles = 0;
2206         subdivpolyverts = 0;
2207         SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2208         if (subdivpolytriangles < 1)
2209                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2210
2211         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2212         mesh->num_vertices = subdivpolyverts;
2213         mesh->num_triangles = subdivpolytriangles;
2214         mesh->vertex = (surfvertex_t *)(mesh + 1);
2215         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2216         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2217
2218         for (i = 0;i < mesh->num_triangles;i++)
2219                 for (j = 0;j < 3;j++)
2220                         mesh->index[i*3+j] = subdivpolyindex[i][j];
2221
2222         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2223         {
2224                 VectorCopy(subdivpolyvert[i], v->v);
2225                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2226                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2227         }
2228 }
2229 #endif
2230
2231 extern cvar_t gl_max_lightmapsize;
2232 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2233 {
2234         dface_t *in;
2235         msurface_t *surface;
2236         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2237         float texmins[2], texmaxs[2], val;
2238         rtexture_t *lightmaptexture, *deluxemaptexture;
2239
2240         in = (dface_t *)(mod_base + l->fileofs);
2241         if (l->filelen % sizeof(*in))
2242                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2243         count = l->filelen / sizeof(*in);
2244         loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2245         loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2246
2247         loadmodel->num_surfaces = count;
2248
2249         loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2250
2251         totalverts = 0;
2252         totaltris = 0;
2253         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2254         {
2255                 numedges = (unsigned short)LittleShort(in->numedges);
2256                 totalverts += numedges;
2257                 totaltris += numedges - 2;
2258         }
2259
2260         Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2261
2262         lightmaptexture = NULL;
2263         deluxemaptexture = r_texture_blanknormalmap;
2264         lightmapnumber = 1;
2265         lightmapsize = bound(256, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d);
2266         totallightmapsamples = 0;
2267
2268         totalverts = 0;
2269         totaltris = 0;
2270         for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2271         {
2272                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2273
2274                 // FIXME: validate edges, texinfo, etc?
2275                 firstedge = LittleLong(in->firstedge);
2276                 numedges = (unsigned short)LittleShort(in->numedges);
2277                 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)
2278                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2279                 i = (unsigned short)LittleShort(in->texinfo);
2280                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2281                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2282                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2283                 surface->texture = surface->lightmapinfo->texinfo->texture;
2284
2285                 planenum = (unsigned short)LittleShort(in->planenum);
2286                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2287                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2288
2289                 //surface->flags = surface->texture->flags;
2290                 //if (LittleShort(in->side))
2291                 //      surface->flags |= SURF_PLANEBACK;
2292                 //surface->plane = loadmodel->brush.data_planes + planenum;
2293
2294                 surface->num_firstvertex = totalverts;
2295                 surface->num_vertices = numedges;
2296                 surface->num_firsttriangle = totaltris;
2297                 surface->num_triangles = numedges - 2;
2298                 totalverts += numedges;
2299                 totaltris += numedges - 2;
2300
2301                 // convert edges back to a normal polygon
2302                 for (i = 0;i < surface->num_vertices;i++)
2303                 {
2304                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2305                         float s, t;
2306                         // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2307                         if (lindex >= 0)
2308                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2309                         else
2310                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2311                         s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2312                         t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2313                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2314                         (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2315                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2316                         (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2317                         (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2318                 }
2319
2320                 for (i = 0;i < surface->num_triangles;i++)
2321                 {
2322                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2323                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2324                         (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2325                 }
2326
2327                 // compile additional data about the surface geometry
2328                 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);
2329                 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);
2330                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2331
2332                 // generate surface extents information
2333                 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2334                 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2335                 for (i = 1;i < surface->num_vertices;i++)
2336                 {
2337                         for (j = 0;j < 2;j++)
2338                         {
2339                                 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2340                                 texmins[j] = min(texmins[j], val);
2341                                 texmaxs[j] = max(texmaxs[j], val);
2342                         }
2343                 }
2344                 for (i = 0;i < 2;i++)
2345                 {
2346                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2347                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2348                 }
2349
2350                 smax = surface->lightmapinfo->extents[0] >> 4;
2351                 tmax = surface->lightmapinfo->extents[1] >> 4;
2352                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2353                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2354
2355                 // lighting info
2356                 for (i = 0;i < MAXLIGHTMAPS;i++)
2357                         surface->lightmapinfo->styles[i] = in->styles[i];
2358                 surface->lightmaptexture = NULL;
2359                 surface->deluxemaptexture = r_texture_blanknormalmap;
2360                 i = LittleLong(in->lightofs);
2361                 if (i == -1)
2362                 {
2363                         surface->lightmapinfo->samples = NULL;
2364 #if 1
2365                         // give non-lightmapped water a 1x white lightmap
2366                         if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2367                         {
2368                                 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2369                                 surface->lightmapinfo->styles[0] = 0;
2370                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2371                         }
2372 #endif
2373                 }
2374                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2375                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2376                 else // LordHavoc: white lighting (bsp version 29)
2377                 {
2378                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2379                         if (loadmodel->brushq1.nmaplightdata)
2380                                 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2381                 }
2382
2383                 // check if we should apply a lightmap to this
2384                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2385                 {
2386                         if (ssize > 256 || tsize > 256)
2387                                 Host_Error("Bad surface extents");
2388
2389                         if (lightmapsize < ssize)
2390                                 lightmapsize = ssize;
2391                         if (lightmapsize < tsize)
2392                                 lightmapsize = tsize;
2393
2394                         totallightmapsamples += ssize*tsize;
2395
2396                         // force lightmap upload on first time seeing the surface
2397                         //
2398                         // additionally this is used by the later code to see if a
2399                         // lightmap is needed on this surface (rather than duplicating the
2400                         // logic above)
2401                         loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2402                 }
2403         }
2404
2405         // small maps (such as ammo boxes especially) don't need big lightmap
2406         // textures, so this code tries to guess a good size based on
2407         // totallightmapsamples (size of the lightmaps lump basically), as well as
2408         // trying to max out the size if there is a lot of lightmap data to store
2409         // additionally, never choose a lightmapsize that is smaller than the
2410         // largest surface encountered (as it would fail)
2411         i = lightmapsize;
2412         for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < bound(128, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d)) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2413                 ;
2414
2415         // now that we've decided the lightmap texture size, we can do the rest
2416         if (cls.state != ca_dedicated)
2417         {
2418                 int stainmapsize = 0;
2419                 mod_alloclightmap_state_t allocState;
2420
2421                 Mod_AllocLightmap_Init(&allocState, lightmapsize, lightmapsize);
2422                 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2423                 {
2424                         int i, iu, iv, lightmapx = 0, lightmapy = 0;
2425                         float u, v, ubase, vbase, uscale, vscale;
2426
2427                         if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2428                                 continue;
2429
2430                         smax = surface->lightmapinfo->extents[0] >> 4;
2431                         tmax = surface->lightmapinfo->extents[1] >> 4;
2432                         ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2433                         tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2434                         stainmapsize += ssize * tsize * 3;
2435
2436                         if (!lightmaptexture || !Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy))
2437                         {
2438                                 // allocate a texture pool if we need it
2439                                 if (loadmodel->texturepool == NULL)
2440                                         loadmodel->texturepool = R_AllocTexturePool();
2441                                 // could not find room, make a new lightmap
2442                                 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2443                                 if (loadmodel->brushq1.nmaplightdata)
2444                                         deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2445                                 lightmapnumber++;
2446                                 Mod_AllocLightmap_Reset(&allocState);
2447                                 Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy);
2448                         }
2449                         surface->lightmaptexture = lightmaptexture;
2450                         surface->deluxemaptexture = deluxemaptexture;
2451                         surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2452                         surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2453
2454                         uscale = 1.0f / (float)lightmapsize;
2455                         vscale = 1.0f / (float)lightmapsize;
2456                         ubase = lightmapx * uscale;
2457                         vbase = lightmapy * vscale;
2458
2459                         for (i = 0;i < surface->num_vertices;i++)
2460                         {
2461                                 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);
2462                                 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);
2463                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2464                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2465                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2466                                 iu = (int) u;
2467                                 iv = (int) v;
2468                                 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2469                         }
2470                 }
2471
2472                 if (cl_stainmaps.integer)
2473                 {
2474                         // allocate stainmaps for permanent marks on walls and clear white
2475                         unsigned char *stainsamples = NULL;
2476                         stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2477                         memset(stainsamples, 255, stainmapsize);
2478                         // assign pointers
2479                         for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2480                         {
2481                                 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2482                                         continue;
2483                                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2484                                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2485                                 surface->lightmapinfo->stainsamples = stainsamples;
2486                                 stainsamples += ssize * tsize * 3;
2487                         }
2488                 }
2489         }
2490
2491         // generate ushort elements array if possible
2492         if (loadmodel->surfmesh.data_element3s)
2493                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2494                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2495 }
2496
2497 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2498 {
2499         //if (node->parent)
2500         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2501         node->parent = parent;
2502         if (node->plane)
2503         {
2504                 // this is a node, recurse to children
2505                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2506                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2507                 // combine supercontents of children
2508                 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2509         }
2510         else
2511         {
2512                 int j;
2513                 mleaf_t *leaf = (mleaf_t *)node;
2514                 // if this is a leaf, calculate supercontents mask from all collidable
2515                 // primitives in the leaf (brushes and collision surfaces)
2516                 // also flag if the leaf contains any collision surfaces
2517                 leaf->combinedsupercontents = 0;
2518                 // combine the supercontents values of all brushes in this leaf
2519                 for (j = 0;j < leaf->numleafbrushes;j++)
2520                         leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2521                 // check if this leaf contains any collision surfaces (q3 patches)
2522                 for (j = 0;j < leaf->numleafsurfaces;j++)
2523                 {
2524                         msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2525                         if (surface->num_collisiontriangles)
2526                         {
2527                                 leaf->containscollisionsurfaces = true;
2528                                 leaf->combinedsupercontents |= surface->texture->supercontents;
2529                         }
2530                 }
2531         }
2532 }
2533
2534 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2535 {
2536         int                     i, j, count, p;
2537         dnode_t         *in;
2538         mnode_t         *out;
2539
2540         in = (dnode_t *)(mod_base + l->fileofs);
2541         if (l->filelen % sizeof(*in))
2542                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2543         count = l->filelen / sizeof(*in);
2544         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2545
2546         loadmodel->brush.data_nodes = out;
2547         loadmodel->brush.num_nodes = count;
2548
2549         for ( i=0 ; i<count ; i++, in++, out++)
2550         {
2551                 for (j=0 ; j<3 ; j++)
2552                 {
2553                         out->mins[j] = LittleShort(in->mins[j]);
2554                         out->maxs[j] = LittleShort(in->maxs[j]);
2555                 }
2556
2557                 p = LittleLong(in->planenum);
2558                 out->plane = loadmodel->brush.data_planes + p;
2559
2560                 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2561                 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2562
2563                 for (j=0 ; j<2 ; j++)
2564                 {
2565                         // LordHavoc: this code supports broken bsp files produced by
2566                         // arguire qbsp which can produce more than 32768 nodes, any value
2567                         // below count is assumed to be a node number, any other value is
2568                         // assumed to be a leaf number
2569                         p = (unsigned short)LittleShort(in->children[j]);
2570                         if (p < count)
2571                         {
2572                                 if (p < loadmodel->brush.num_nodes)
2573                                         out->children[j] = loadmodel->brush.data_nodes + p;
2574                                 else
2575                                 {
2576                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2577                                         // map it to the solid leaf
2578                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2579                                 }
2580                         }
2581                         else
2582                         {
2583                                 // note this uses 65535 intentionally, -1 is leaf 0
2584                                 p = 65535 - p;
2585                                 if (p < loadmodel->brush.num_leafs)
2586                                         out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2587                                 else
2588                                 {
2589                                         Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2590                                         // map it to the solid leaf
2591                                         out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2592                                 }
2593                         }
2594                 }
2595         }
2596
2597         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2598 }
2599
2600 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2601 {
2602         dleaf_t *in;
2603         mleaf_t *out;
2604         int i, j, count, p;
2605
2606         in = (dleaf_t *)(mod_base + l->fileofs);
2607         if (l->filelen % sizeof(*in))
2608                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2609         count = l->filelen / sizeof(*in);
2610         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2611
2612         loadmodel->brush.data_leafs = out;
2613         loadmodel->brush.num_leafs = count;
2614         // get visleafs from the submodel data
2615         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2616         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2617         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2618         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2619
2620         for ( i=0 ; i<count ; i++, in++, out++)
2621         {
2622                 for (j=0 ; j<3 ; j++)
2623                 {
2624                         out->mins[j] = LittleShort(in->mins[j]);
2625                         out->maxs[j] = LittleShort(in->maxs[j]);
2626                 }
2627
2628                 // FIXME: this function could really benefit from some error checking
2629
2630                 out->contents = LittleLong(in->contents);
2631
2632                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2633                 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2634                 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2635                 {
2636                         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);
2637                         out->firstleafsurface = NULL;
2638                         out->numleafsurfaces = 0;
2639                 }
2640
2641                 out->clusterindex = i - 1;
2642                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2643                         out->clusterindex = -1;
2644
2645                 p = LittleLong(in->visofs);
2646                 // ignore visofs errors on leaf 0 (solid)
2647                 if (p >= 0 && out->clusterindex >= 0)
2648                 {
2649                         if (p >= loadmodel->brushq1.num_compressedpvs)
2650                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2651                         else
2652                                 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);
2653                 }
2654
2655                 for (j = 0;j < 4;j++)
2656                         out->ambient_sound_level[j] = in->ambient_level[j];
2657
2658                 // FIXME: Insert caustics here
2659         }
2660 }
2661
2662 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2663 {
2664         int i, j;
2665         mleaf_t *leaf;
2666         const unsigned char *pvs;
2667         // if there's no vis data, assume supported (because everything is visible all the time)
2668         if (!loadmodel->brush.data_pvsclusters)
2669                 return true;
2670         // check all liquid leafs to see if they can see into empty leafs, if any
2671         // can we can assume this map supports r_wateralpha
2672         for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2673         {
2674                 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2675                 {
2676                         pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2677                         for (j = 0;j < loadmodel->brush.num_leafs;j++)
2678                                 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2679                                         return true;
2680                 }
2681         }
2682         return false;
2683 }
2684
2685 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2686 {
2687         dclipnode_t *in;
2688         mclipnode_t *out;
2689         int                     i, count;
2690         hull_t          *hull;
2691
2692         in = (dclipnode_t *)(mod_base + l->fileofs);
2693         if (l->filelen % sizeof(*in))
2694                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2695         count = l->filelen / sizeof(*in);
2696         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2697
2698         loadmodel->brushq1.clipnodes = out;
2699         loadmodel->brushq1.numclipnodes = count;
2700
2701         for (i = 1; i < MAX_MAP_HULLS; i++)
2702         {
2703                 hull = &loadmodel->brushq1.hulls[i];
2704                 hull->clipnodes = out;
2705                 hull->firstclipnode = 0;
2706                 hull->lastclipnode = count-1;
2707                 hull->planes = loadmodel->brush.data_planes;
2708                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2709                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2710                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2711                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2712                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2713                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2714                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2715         }
2716
2717         for (i=0 ; i<count ; i++, out++, in++)
2718         {
2719                 out->planenum = LittleLong(in->planenum);
2720                 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2721                 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2722                 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2723                 if (out->children[0] >= count)
2724                         out->children[0] -= 65536;
2725                 if (out->children[1] >= count)
2726                         out->children[1] -= 65536;
2727                 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2728                         Host_Error("Corrupt clipping hull(out of range planenum)");
2729         }
2730 }
2731
2732 //Duplicate the drawing hull structure as a clipping hull
2733 static void Mod_Q1BSP_MakeHull0(void)
2734 {
2735         mnode_t         *in;
2736         mclipnode_t *out;
2737         int                     i;
2738         hull_t          *hull;
2739
2740         hull = &loadmodel->brushq1.hulls[0];
2741
2742         in = loadmodel->brush.data_nodes;
2743         out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2744
2745         hull->clipnodes = out;
2746         hull->firstclipnode = 0;
2747         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2748         hull->planes = loadmodel->brush.data_planes;
2749
2750         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2751         {
2752                 out->planenum = in->plane - loadmodel->brush.data_planes;
2753                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2754                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2755         }
2756 }
2757
2758 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2759 {
2760         int i, j;
2761         short *in;
2762
2763         in = (short *)(mod_base + l->fileofs);
2764         if (l->filelen % sizeof(*in))
2765                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2766         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2767         loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2768
2769         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2770         {
2771                 j = (unsigned short) LittleShort(in[i]);
2772                 if (j >= loadmodel->num_surfaces)
2773                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2774                 loadmodel->brush.data_leafsurfaces[i] = j;
2775         }
2776 }
2777
2778 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2779 {
2780         int             i;
2781         int             *in;
2782
2783         in = (int *)(mod_base + l->fileofs);
2784         if (l->filelen % sizeof(*in))
2785                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2786         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2787         loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2788
2789         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2790                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2791 }
2792
2793
2794 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2795 {
2796         int                     i;
2797         mplane_t        *out;
2798         dplane_t        *in;
2799
2800         in = (dplane_t *)(mod_base + l->fileofs);
2801         if (l->filelen % sizeof(*in))
2802                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2803
2804         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2805         loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2806
2807         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2808         {
2809                 out->normal[0] = LittleFloat(in->normal[0]);
2810                 out->normal[1] = LittleFloat(in->normal[1]);
2811                 out->normal[2] = LittleFloat(in->normal[2]);
2812                 out->dist = LittleFloat(in->dist);
2813
2814                 PlaneClassify(out);
2815         }
2816 }
2817
2818 static void Mod_Q1BSP_LoadMapBrushes(void)
2819 {
2820 #if 0
2821 // unfinished
2822         int submodel, numbrushes;
2823         qboolean firstbrush;
2824         char *text, *maptext;
2825         char mapfilename[MAX_QPATH];
2826         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2827         strlcat (mapfilename, ".map", sizeof (mapfilename));
2828         maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2829         if (!maptext)
2830                 return;
2831         text = maptext;
2832         if (!COM_ParseToken_Simple(&data, false, false))
2833                 return; // error
2834         submodel = 0;
2835         for (;;)
2836         {
2837                 if (!COM_ParseToken_Simple(&data, false, false))
2838                         break;
2839                 if (com_token[0] != '{')
2840                         return; // error
2841                 // entity
2842                 firstbrush = true;
2843                 numbrushes = 0;
2844                 maxbrushes = 256;
2845                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2846                 for (;;)
2847                 {
2848                         if (!COM_ParseToken_Simple(&data, false, false))
2849                                 return; // error
2850                         if (com_token[0] == '}')
2851                                 break; // end of entity
2852                         if (com_token[0] == '{')
2853                         {
2854                                 // brush
2855                                 if (firstbrush)
2856                                 {
2857                                         if (submodel)
2858                                         {
2859                                                 if (submodel > loadmodel->brush.numsubmodels)
2860                                                 {
2861                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2862                                                         model = NULL;
2863                                                 }
2864                                                 else
2865                                                         model = loadmodel->brush.submodels[submodel];
2866                                         }
2867                                         else
2868                                                 model = loadmodel;
2869                                 }
2870                                 for (;;)
2871                                 {
2872                                         if (!COM_ParseToken_Simple(&data, false, false))
2873                                                 return; // error
2874                                         if (com_token[0] == '}')
2875                                                 break; // end of brush
2876                                         // each brush face should be this format:
2877                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2878                                         // FIXME: support hl .map format
2879                                         for (pointnum = 0;pointnum < 3;pointnum++)
2880                                         {
2881                                                 COM_ParseToken_Simple(&data, false, false);
2882                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2883                                                 {
2884                                                         COM_ParseToken_Simple(&data, false, false);
2885                                                         point[pointnum][componentnum] = atof(com_token);
2886                                                 }
2887                                                 COM_ParseToken_Simple(&data, false, false);
2888                                         }
2889                                         COM_ParseToken_Simple(&data, false, false);
2890                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2891                                         COM_ParseToken_Simple(&data, false, false);
2892                                         //scroll_s = atof(com_token);
2893                                         COM_ParseToken_Simple(&data, false, false);
2894                                         //scroll_t = atof(com_token);
2895                                         COM_ParseToken_Simple(&data, false, false);
2896                                         //rotate = atof(com_token);
2897                                         COM_ParseToken_Simple(&data, false, false);
2898                                         //scale_s = atof(com_token);
2899                                         COM_ParseToken_Simple(&data, false, false);
2900                                         //scale_t = atof(com_token);
2901                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2902                                         VectorNormalizeDouble(planenormal);
2903                                         planedist = DotProduct(point[0], planenormal);
2904                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2905                                 }
2906                                 continue;
2907                         }
2908                 }
2909         }
2910 #endif
2911 }
2912
2913
2914 #define MAX_PORTALPOINTS 64
2915
2916 typedef struct portal_s
2917 {
2918         mplane_t plane;
2919         mnode_t *nodes[2];              // [0] = front side of plane
2920         struct portal_s *next[2];
2921         int numpoints;
2922         double points[3*MAX_PORTALPOINTS];
2923         struct portal_s *chain; // all portals are linked into a list
2924 }
2925 portal_t;
2926
2927 static memexpandablearray_t portalarray;
2928
2929 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2930 {
2931         // process only nodes (leafs already had their box calculated)
2932         if (!node->plane)
2933                 return;
2934
2935         // calculate children first
2936         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2937         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2938
2939         // make combined bounding box from children
2940         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2941         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2942         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2943         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2944         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2945         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2946 }
2947
2948 static void Mod_Q1BSP_FinalizePortals(void)
2949 {
2950         int i, j, numportals, numpoints, portalindex, portalrange = Mem_ExpandableArray_IndexRange(&portalarray);
2951         portal_t *p;
2952         mportal_t *portal;
2953         mvertex_t *point;
2954         mleaf_t *leaf, *endleaf;
2955
2956         // tally up portal and point counts and recalculate bounding boxes for all
2957         // leafs (because qbsp is very sloppy)
2958         leaf = loadmodel->brush.data_leafs;
2959         endleaf = leaf + loadmodel->brush.num_leafs;
2960         for (;leaf < endleaf;leaf++)
2961         {
2962                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
2963                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2964         }
2965         numportals = 0;
2966         numpoints = 0;
2967         for (portalindex = 0;portalindex < portalrange;portalindex++)
2968         {
2969                 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
2970                 if (!p)
2971                         continue;
2972                 // note: this check must match the one below or it will usually corrupt memory
2973                 // 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
2974                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2975                 {
2976                         numportals += 2;
2977                         numpoints += p->numpoints * 2;
2978                 }
2979         }
2980         loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2981         loadmodel->brush.num_portals = numportals;
2982         loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2983         loadmodel->brush.num_portalpoints = numpoints;
2984         // clear all leaf portal chains
2985         for (i = 0;i < loadmodel->brush.num_leafs;i++)
2986                 loadmodel->brush.data_leafs[i].portals = NULL;
2987         // process all portals in the global portal chain, while freeing them
2988         portal = loadmodel->brush.data_portals;
2989         point = loadmodel->brush.data_portalpoints;
2990         for (portalindex = 0;portalindex < portalrange;portalindex++)
2991         {
2992                 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
2993                 if (!p)
2994                         continue;
2995                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2996                 {
2997                         // note: this check must match the one above or it will usually corrupt memory
2998                         // 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
2999                         if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3000                         {
3001                                 // first make the back to front portal(forward portal)
3002                                 portal->points = point;
3003                                 portal->numpoints = p->numpoints;
3004                                 portal->plane.dist = p->plane.dist;
3005                                 VectorCopy(p->plane.normal, portal->plane.normal);
3006                                 portal->here = (mleaf_t *)p->nodes[1];
3007                                 portal->past = (mleaf_t *)p->nodes[0];
3008                                 // copy points
3009                                 for (j = 0;j < portal->numpoints;j++)
3010                                 {
3011                                         VectorCopy(p->points + j*3, point->position);
3012                                         point++;
3013                                 }
3014                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3015                                 PlaneClassify(&portal->plane);
3016
3017                                 // link into leaf's portal chain
3018                                 portal->next = portal->here->portals;
3019                                 portal->here->portals = portal;
3020
3021                                 // advance to next portal
3022                                 portal++;
3023
3024                                 // then make the front to back portal(backward portal)
3025                                 portal->points = point;
3026                                 portal->numpoints = p->numpoints;
3027                                 portal->plane.dist = -p->plane.dist;
3028                                 VectorNegate(p->plane.normal, portal->plane.normal);
3029                                 portal->here = (mleaf_t *)p->nodes[0];
3030                                 portal->past = (mleaf_t *)p->nodes[1];
3031                                 // copy points
3032                                 for (j = portal->numpoints - 1;j >= 0;j--)
3033                                 {
3034                                         VectorCopy(p->points + j*3, point->position);
3035                                         point++;
3036                                 }
3037                                 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3038                                 PlaneClassify(&portal->plane);
3039
3040                                 // link into leaf's portal chain
3041                                 portal->next = portal->here->portals;
3042                                 portal->here->portals = portal;
3043
3044                                 // advance to next portal
3045                                 portal++;
3046                         }
3047                         // add the portal's polygon points to the leaf bounding boxes
3048                         for (i = 0;i < 2;i++)
3049                         {
3050                                 leaf = (mleaf_t *)p->nodes[i];
3051                                 for (j = 0;j < p->numpoints;j++)
3052                                 {
3053                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3054                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3055                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3056                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3057                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3058                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3059                                 }
3060                         }
3061                 }
3062         }
3063         // now recalculate the node bounding boxes from the leafs
3064         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3065 }
3066
3067 /*
3068 =============
3069 AddPortalToNodes
3070 =============
3071 */
3072 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3073 {
3074         if (!front)
3075                 Host_Error("AddPortalToNodes: NULL front node");
3076         if (!back)
3077                 Host_Error("AddPortalToNodes: NULL back node");
3078         if (p->nodes[0] || p->nodes[1])
3079                 Host_Error("AddPortalToNodes: already included");
3080         // 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
3081
3082         p->nodes[0] = front;
3083         p->next[0] = (portal_t *)front->portals;
3084         front->portals = (mportal_t *)p;
3085
3086         p->nodes[1] = back;
3087         p->next[1] = (portal_t *)back->portals;
3088         back->portals = (mportal_t *)p;
3089 }
3090
3091 /*
3092 =============
3093 RemovePortalFromNode
3094 =============
3095 */
3096 static void RemovePortalFromNodes(portal_t *portal)
3097 {
3098         int i;
3099         mnode_t *node;
3100         void **portalpointer;
3101         portal_t *t;
3102         for (i = 0;i < 2;i++)
3103         {
3104                 node = portal->nodes[i];
3105
3106                 portalpointer = (void **) &node->portals;
3107                 while (1)
3108                 {
3109                         t = (portal_t *)*portalpointer;
3110                         if (!t)
3111                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
3112
3113                         if (t == portal)
3114                         {
3115                                 if (portal->nodes[0] == node)
3116                                 {
3117                                         *portalpointer = portal->next[0];
3118                                         portal->nodes[0] = NULL;
3119                                 }
3120                                 else if (portal->nodes[1] == node)
3121                                 {
3122                                         *portalpointer = portal->next[1];
3123                                         portal->nodes[1] = NULL;
3124                                 }
3125                                 else
3126                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3127                                 break;
3128                         }
3129
3130                         if (t->nodes[0] == node)
3131                                 portalpointer = (void **) &t->next[0];
3132                         else if (t->nodes[1] == node)
3133                                 portalpointer = (void **) &t->next[1];
3134                         else
3135                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3136                 }
3137         }
3138 }
3139
3140 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3141 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3142 {
3143         int i, side;
3144         mnode_t *front, *back, *other_node;
3145         mplane_t clipplane, *plane;
3146         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3147         int numfrontpoints, numbackpoints;
3148         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3149
3150         // if a leaf, we're done
3151         if (!node->plane)
3152                 return;
3153
3154         plane = node->plane;
3155
3156         front = node->children[0];
3157         back = node->children[1];
3158         if (front == back)
3159                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3160
3161         // create the new portal by generating a polygon for the node plane,
3162         // and clipping it by all of the other portals(which came from nodes above this one)
3163         nodeportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3164         nodeportal->plane = *plane;
3165
3166         // 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)
3167         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);
3168         nodeportal->numpoints = 4;
3169         side = 0;       // shut up compiler warning
3170         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3171         {
3172                 clipplane = portal->plane;
3173                 if (portal->nodes[0] == portal->nodes[1])
3174                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3175                 if (portal->nodes[0] == node)
3176                         side = 0;
3177                 else if (portal->nodes[1] == node)
3178                 {
3179                         clipplane.dist = -clipplane.dist;
3180                         VectorNegate(clipplane.normal, clipplane.normal);
3181                         side = 1;
3182                 }
3183                 else
3184                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3185
3186                 for (i = 0;i < nodeportal->numpoints*3;i++)
3187                         frontpoints[i] = nodeportal->points[i];
3188                 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);
3189                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3190                         break;
3191         }
3192
3193         if (nodeportal->numpoints < 3)
3194         {
3195                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3196                 nodeportal->numpoints = 0;
3197         }
3198         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3199         {
3200                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3201                 nodeportal->numpoints = 0;
3202         }
3203
3204         AddPortalToNodes(nodeportal, front, back);
3205
3206         // split the portals of this node along this node's plane and assign them to the children of this node
3207         // (migrating the portals downward through the tree)
3208         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3209         {
3210                 if (portal->nodes[0] == portal->nodes[1])
3211                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3212                 if (portal->nodes[0] == node)
3213                         side = 0;
3214                 else if (portal->nodes[1] == node)
3215                         side = 1;
3216                 else
3217                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3218                 nextportal = portal->next[side];
3219                 if (!portal->numpoints)
3220                         continue;
3221
3222                 other_node = portal->nodes[!side];
3223                 RemovePortalFromNodes(portal);
3224
3225                 // cut the portal into two portals, one on each side of the node plane
3226                 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);
3227
3228                 if (!numfrontpoints)
3229                 {
3230                         if (side == 0)
3231                                 AddPortalToNodes(portal, back, other_node);
3232                         else
3233                                 AddPortalToNodes(portal, other_node, back);
3234                         continue;
3235                 }
3236                 if (!numbackpoints)
3237                 {
3238                         if (side == 0)
3239                                 AddPortalToNodes(portal, front, other_node);
3240                         else
3241                                 AddPortalToNodes(portal, other_node, front);
3242                         continue;
3243                 }
3244
3245                 // the portal is split
3246                 splitportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3247                 temp = splitportal->chain;
3248                 *splitportal = *portal;
3249                 splitportal->chain = temp;
3250                 for (i = 0;i < numbackpoints*3;i++)
3251                         splitportal->points[i] = backpoints[i];
3252                 splitportal->numpoints = numbackpoints;
3253                 for (i = 0;i < numfrontpoints*3;i++)
3254                         portal->points[i] = frontpoints[i];
3255                 portal->numpoints = numfrontpoints;
3256
3257                 if (side == 0)
3258                 {
3259                         AddPortalToNodes(portal, front, other_node);
3260                         AddPortalToNodes(splitportal, back, other_node);
3261                 }
3262                 else
3263                 {
3264                         AddPortalToNodes(portal, other_node, front);
3265                         AddPortalToNodes(splitportal, other_node, back);
3266                 }
3267         }
3268
3269         Mod_Q1BSP_RecursiveNodePortals(front);
3270         Mod_Q1BSP_RecursiveNodePortals(back);
3271 }
3272
3273 static void Mod_Q1BSP_MakePortals(void)
3274 {
3275         Mem_ExpandableArray_NewArray(&portalarray, loadmodel->mempool, sizeof(portal_t), 1020*1024/sizeof(portal_t));
3276         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3277         Mod_Q1BSP_FinalizePortals();
3278         Mem_ExpandableArray_FreeArray(&portalarray);
3279 }
3280
3281 //Returns PVS data for a given point
3282 //(note: can return NULL)
3283 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3284 {
3285         mnode_t *node;
3286         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3287         while (node->plane)
3288                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3289         if (((mleaf_t *)node)->clusterindex >= 0)
3290                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3291         else
3292                 return NULL;
3293 }
3294
3295 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)
3296 {
3297         while (node->plane)
3298         {
3299                 float d = PlaneDiff(org, node->plane);
3300                 if (d > radius)
3301                         node = node->children[0];
3302                 else if (d < -radius)
3303                         node = node->children[1];
3304                 else
3305                 {
3306                         // go down both sides
3307                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3308                         node = node->children[1];
3309                 }
3310         }
3311         // if this leaf is in a cluster, accumulate the pvs bits
3312         if (((mleaf_t *)node)->clusterindex >= 0)
3313         {
3314                 int i;
3315                 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3316                 for (i = 0;i < pvsbytes;i++)
3317                         pvsbuffer[i] |= pvs[i];
3318         }
3319 }
3320
3321 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3322 //of the given point.
3323 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3324 {
3325         int bytes = model->brush.num_pvsclusterbytes;
3326         bytes = min(bytes, pvsbufferlength);
3327         if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3328         {
3329                 memset(pvsbuffer, 0xFF, bytes);
3330                 return bytes;
3331         }
3332         if (!merge)
3333                 memset(pvsbuffer, 0, bytes);
3334         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3335         return bytes;
3336 }
3337
3338 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3339 {
3340         vec3_t size;
3341         const hull_t *hull;
3342
3343         VectorSubtract(inmaxs, inmins, size);
3344         if (cmodel->brush.ishlbsp)
3345         {
3346                 if (size[0] < 3)
3347                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3348                 else if (size[0] <= 32)
3349                 {
3350                         if (size[2] < 54) // pick the nearest of 36 or 72
3351                                 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3352                         else
3353                                 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3354                 }
3355                 else
3356                         hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3357         }
3358         else
3359         {
3360                 if (size[0] < 3)
3361                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3362                 else if (size[0] <= 32)
3363                         hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3364                 else
3365                         hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3366         }
3367         VectorCopy(inmins, outmins);
3368         VectorAdd(inmins, hull->clip_size, outmaxs);
3369 }
3370
3371 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3372 {
3373         int i, j, k;
3374         dheader_t *header;
3375         dmodel_t *bm;
3376         mempool_t *mainmempool;
3377         float dist, modelyawradius, modelradius;
3378         msurface_t *surface;
3379         int numshadowmeshtriangles;
3380         hullinfo_t hullinfo;
3381         int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3382         model_brush_lightstyleinfo_t styleinfo[256];
3383         unsigned char *datapointer;
3384
3385         mod->modeldatatypestring = "Q1BSP";
3386
3387         mod->type = mod_brushq1;
3388
3389         header = (dheader_t *)buffer;
3390
3391         i = LittleLong(header->version);
3392         if (i != BSPVERSION && i != 30)
3393                 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3394         mod->brush.ishlbsp = i == 30;
3395
3396 // fill in hull info
3397         VectorClear (hullinfo.hullsizes[0][0]);
3398         VectorClear (hullinfo.hullsizes[0][1]);
3399         if (mod->brush.ishlbsp)
3400         {
3401                 mod->modeldatatypestring = "HLBSP";
3402
3403                 hullinfo.filehulls = 4;
3404                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3405                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3406                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3407                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3408                 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3409                 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3410         }
3411         else
3412         {
3413                 hullinfo.filehulls = 4;
3414                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3415                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3416                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3417                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3418         }
3419
3420 // read lumps
3421         mod_base = (unsigned char*)buffer;
3422         for (i = 0; i < HEADER_LUMPS; i++)
3423         {
3424                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3425                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3426         }
3427
3428         mod->soundfromcenter = true;
3429         mod->TraceBox = Mod_Q1BSP_TraceBox;
3430         mod->TraceLine = Mod_Q1BSP_TraceLine;
3431         mod->TracePoint = Mod_Q1BSP_TracePoint;
3432         mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3433         mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3434         mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3435         mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3436         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3437         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3438         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3439         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3440         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3441         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3442         mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3443         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3444         mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3445         mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3446         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3447         mod->Draw = R_Q1BSP_Draw;
3448         mod->DrawDepth = R_Q1BSP_DrawDepth;
3449         mod->DrawDebug = R_Q1BSP_DrawDebug;
3450         mod->DrawPrepass = R_Q1BSP_DrawPrepass;
3451         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3452         mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3453         mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3454         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3455         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3456         mod->DrawLight = R_Q1BSP_DrawLight;
3457
3458 // load into heap
3459
3460         mod->brush.qw_md4sum = 0;
3461         mod->brush.qw_md4sum2 = 0;
3462         for (i = 0;i < HEADER_LUMPS;i++)
3463         {
3464                 if (i == LUMP_ENTITIES)
3465                         continue;
3466                 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3467                 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3468                         continue;
3469                 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3470         }
3471
3472         Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3473         Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3474         Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3475         Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3476         Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3477         Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3478         Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3479         Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3480         Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3481         Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3482         Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3483         // load submodels before leafs because they contain the number of vis leafs
3484         Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3485         Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3486         Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3487         Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3488
3489         // check if the map supports transparent water rendering
3490         loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3491
3492         if (mod->brushq1.data_compressedpvs)
3493                 Mem_Free(mod->brushq1.data_compressedpvs);
3494         mod->brushq1.data_compressedpvs = NULL;
3495         mod->brushq1.num_compressedpvs = 0;
3496
3497         Mod_Q1BSP_MakeHull0();
3498         Mod_Q1BSP_MakePortals();
3499
3500         mod->numframes = 2;             // regular and alternate animation
3501         mod->numskins = 1;
3502
3503         mainmempool = mod->mempool;
3504
3505         // make a single combined shadow mesh to allow optimized shadow volume creation
3506         numshadowmeshtriangles = 0;
3507         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3508         {
3509                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3510                 numshadowmeshtriangles += surface->num_triangles;
3511         }
3512         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3513         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3514                 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));
3515         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3516         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3517
3518         if (loadmodel->brush.numsubmodels)
3519                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3520
3521         // LordHavoc: to clear the fog around the original quake submodel code, I
3522         // will explain:
3523         // first of all, some background info on the submodels:
3524         // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3525         // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3526         // now the weird for loop itself:
3527         // the loop functions in an odd way, on each iteration it sets up the
3528         // current 'mod' model (which despite the confusing code IS the model of
3529         // the number i), at the end of the loop it duplicates the model to become
3530         // the next submodel, and loops back to set up the new submodel.
3531
3532         // LordHavoc: now the explanation of my sane way (which works identically):
3533         // set up the world model, then on each submodel copy from the world model
3534         // and set up the submodel with the respective model info.
3535         totalstylesurfaces = 0;
3536         totalstyles = 0;
3537         for (i = 0;i < mod->brush.numsubmodels;i++)
3538         {
3539                 memset(stylecounts, 0, sizeof(stylecounts));
3540                 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3541                 {
3542                         surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3543                         for (j = 0;j < MAXLIGHTMAPS;j++)
3544                                 stylecounts[surface->lightmapinfo->styles[j]]++;
3545                 }
3546                 for (k = 0;k < 255;k++)
3547                 {
3548                         totalstyles++;
3549                         if (stylecounts[k])
3550                                 totalstylesurfaces += stylecounts[k];
3551                 }
3552         }
3553         datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3554         for (i = 0;i < mod->brush.numsubmodels;i++)
3555         {
3556                 // LordHavoc: this code was originally at the end of this loop, but
3557                 // has been transformed to something more readable at the start here.
3558
3559                 if (i > 0)
3560                 {
3561                         char name[10];
3562                         // duplicate the basic information
3563                         dpsnprintf(name, sizeof(name), "*%i", i);
3564                         mod = Mod_FindName(name, loadmodel->name);
3565                         // copy the base model to this one
3566                         *mod = *loadmodel;
3567                         // rename the clone back to its proper name
3568                         strlcpy(mod->name, name, sizeof(mod->name));
3569                         mod->brush.parentmodel = loadmodel;
3570                         // textures and memory belong to the main model
3571                         mod->texturepool = NULL;
3572                         mod->mempool = NULL;
3573                         mod->brush.GetPVS = NULL;
3574                         mod->brush.FatPVS = NULL;
3575                         mod->brush.BoxTouchingPVS = NULL;
3576                         mod->brush.BoxTouchingLeafPVS = NULL;
3577                         mod->brush.BoxTouchingVisibleLeafs = NULL;
3578                         mod->brush.FindBoxClusters = NULL;
3579                         mod->brush.LightPoint = NULL;
3580                         mod->brush.AmbientSoundLevelsForPoint = NULL;
3581                 }
3582
3583                 mod->brush.submodel = i;
3584
3585                 if (loadmodel->brush.submodels)
3586                         loadmodel->brush.submodels[i] = mod;
3587
3588                 bm = &mod->brushq1.submodels[i];
3589
3590                 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3591                 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3592                 {
3593                         mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3594                         mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3595                 }
3596
3597                 mod->firstmodelsurface = bm->firstface;
3598                 mod->nummodelsurfaces = bm->numfaces;
3599
3600                 // set node/leaf parents for this submodel
3601                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
3602
3603                 // make the model surface list (used by shadowing/lighting)
3604                 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3605                 Mod_MakeSortedSurfaces(mod);
3606
3607                 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3608                 // (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)
3609                 VectorCopy(bm->mins, mod->normalmins);
3610                 VectorCopy(bm->maxs, mod->normalmaxs);
3611                 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3612                 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3613                 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3614                 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3615                 modelradius = modelyawradius + modelradius * modelradius;
3616                 modelyawradius = sqrt(modelyawradius);
3617                 modelradius = sqrt(modelradius);
3618                 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3619                 mod->yawmins[2] = mod->normalmins[2];
3620                 mod->yawmaxs[0] = mod->yawmaxs[1] =  modelyawradius;
3621                 mod->yawmaxs[2] = mod->normalmaxs[2];
3622                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3623                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] =  modelradius;
3624                 mod->radius = modelradius;
3625                 mod->radius2 = modelradius * modelradius;
3626
3627                 // this gets altered below if sky or water is used
3628                 mod->DrawSky = NULL;
3629                 mod->DrawAddWaterPlanes = NULL;
3630
3631                 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3632                 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3633                 if (mod->nummodelsurfaces)
3634                 {
3635                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3636                                 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3637                                         break;
3638                         if (j < mod->nummodelsurfaces)
3639                                 mod->DrawSky = R_Q1BSP_DrawSky;
3640
3641                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3642                                 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3643                                         break;
3644                         if (j < mod->nummodelsurfaces)
3645                                 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3646
3647                         // build lightstyle update chains
3648                         // (used to rapidly mark lightmapupdateflags on many surfaces
3649                         // when d_lightstylevalue changes)
3650                         memset(stylecounts, 0, sizeof(stylecounts));
3651                         for (k = 0;k < mod->nummodelsurfaces;k++)
3652                         {
3653                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3654                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3655                                         stylecounts[surface->lightmapinfo->styles[j]]++;
3656                         }
3657                         mod->brushq1.num_lightstyles = 0;
3658                         for (k = 0;k < 255;k++)
3659                         {
3660                                 if (stylecounts[k])
3661                                 {
3662                                         styleinfo[mod->brushq1.num_lightstyles].style = k;
3663                                         styleinfo[mod->brushq1.num_lightstyles].value = 0;
3664                                         styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3665                                         styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3666                                         remapstyles[k] = mod->brushq1.num_lightstyles;
3667                                         mod->brushq1.num_lightstyles++;
3668                                 }
3669                         }
3670                         for (k = 0;k < mod->nummodelsurfaces;k++)
3671                         {
3672                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3673                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3674                                 {
3675                                         if (surface->lightmapinfo->styles[j] != 255)
3676                                         {
3677                                                 int r = remapstyles[surface->lightmapinfo->styles[j]];
3678                                                 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3679                                         }
3680                                 }
3681                         }
3682                         mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3683                         memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3684                 }
3685                 else
3686                 {
3687                         // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3688                         Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3689                 }
3690                 //mod->brushq1.num_visleafs = bm->visleafs;
3691         }
3692
3693         Mod_Q1BSP_LoadMapBrushes();
3694
3695         //Mod_Q1BSP_ProcessLightList();
3696
3697         if (developer.integer >= 10)
3698                 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);
3699 }
3700
3701 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3702 {
3703 }
3704
3705 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3706 {
3707 /*
3708         d_t *in;
3709         m_t *out;
3710         int i, count;
3711
3712         in = (void *)(mod_base + l->fileofs);
3713         if (l->filelen % sizeof(*in))
3714                 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3715         count = l->filelen / sizeof(*in);
3716         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3717
3718         loadmodel-> = out;
3719         loadmodel->num = count;
3720
3721         for (i = 0;i < count;i++, in++, out++)
3722         {
3723         }
3724 */
3725 }
3726
3727 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3728 {
3729 /*
3730         d_t *in;
3731         m_t *out;
3732         int i, count;
3733
3734         in = (void *)(mod_base + l->fileofs);
3735         if (l->filelen % sizeof(*in))
3736                 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3737         count = l->filelen / sizeof(*in);
3738         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3739
3740         loadmodel-> = out;
3741         loadmodel->num = count;
3742
3743         for (i = 0;i < count;i++, in++, out++)
3744         {
3745         }
3746 */
3747 }
3748
3749 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3750 {
3751 /*
3752         d_t *in;
3753         m_t *out;
3754         int i, count;
3755
3756         in = (void *)(mod_base + l->fileofs);
3757         if (l->filelen % sizeof(*in))
3758                 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3759         count = l->filelen / sizeof(*in);
3760         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3761
3762         loadmodel-> = out;
3763         loadmodel->num = count;
3764
3765         for (i = 0;i < count;i++, in++, out++)
3766         {
3767         }
3768 */
3769 }
3770
3771 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3772 {
3773 /*
3774         d_t *in;
3775         m_t *out;
3776         int i, count;
3777
3778         in = (void *)(mod_base + l->fileofs);
3779         if (l->filelen % sizeof(*in))
3780                 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3781         count = l->filelen / sizeof(*in);
3782         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3783
3784         loadmodel-> = out;
3785         loadmodel->num = count;
3786
3787         for (i = 0;i < count;i++, in++, out++)
3788         {
3789         }
3790 */
3791 }
3792
3793 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3794 {
3795 /*
3796         d_t *in;
3797         m_t *out;
3798         int i, count;
3799
3800         in = (void *)(mod_base + l->fileofs);
3801         if (l->filelen % sizeof(*in))
3802                 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3803         count = l->filelen / sizeof(*in);
3804         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3805
3806         loadmodel-> = out;
3807         loadmodel->num = count;
3808
3809         for (i = 0;i < count;i++, in++, out++)
3810         {
3811         }
3812 */
3813 }
3814
3815 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3816 {
3817 /*
3818         d_t *in;
3819         m_t *out;
3820         int i, count;
3821
3822         in = (void *)(mod_base + l->fileofs);
3823         if (l->filelen % sizeof(*in))
3824                 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3825         count = l->filelen / sizeof(*in);
3826         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3827
3828         loadmodel-> = out;
3829         loadmodel->num = count;
3830
3831         for (i = 0;i < count;i++, in++, out++)
3832         {
3833         }
3834 */
3835 }
3836
3837 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3838 {
3839 /*
3840         d_t *in;
3841         m_t *out;
3842         int i, count;
3843
3844         in = (void *)(mod_base + l->fileofs);
3845         if (l->filelen % sizeof(*in))
3846                 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3847         count = l->filelen / sizeof(*in);
3848         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3849
3850         loadmodel-> = out;
3851         loadmodel->num = count;
3852
3853         for (i = 0;i < count;i++, in++, out++)
3854         {
3855         }
3856 */
3857 }
3858
3859 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3860 {
3861 /*
3862         d_t *in;
3863         m_t *out;
3864         int i, count;
3865
3866         in = (void *)(mod_base + l->fileofs);
3867         if (l->filelen % sizeof(*in))
3868                 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3869         count = l->filelen / sizeof(*in);
3870         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3871
3872         loadmodel-> = out;
3873         loadmodel->num = count;
3874
3875         for (i = 0;i < count;i++, in++, out++)
3876         {
3877         }
3878 */
3879 }
3880
3881 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3882 {
3883 /*
3884         d_t *in;
3885         m_t *out;
3886         int i, count;
3887
3888         in = (void *)(mod_base + l->fileofs);
3889         if (l->filelen % sizeof(*in))
3890                 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3891         count = l->filelen / sizeof(*in);
3892         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3893
3894         loadmodel-> = out;
3895         loadmodel->num = count;
3896
3897         for (i = 0;i < count;i++, in++, out++)
3898         {
3899         }
3900 */
3901 }
3902
3903 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3904 {
3905 /*
3906         d_t *in;
3907         m_t *out;
3908         int i, count;
3909
3910         in = (void *)(mod_base + l->fileofs);
3911         if (l->filelen % sizeof(*in))
3912                 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3913         count = l->filelen / sizeof(*in);
3914         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3915
3916         loadmodel-> = out;
3917         loadmodel->num = count;
3918
3919         for (i = 0;i < count;i++, in++, out++)
3920         {
3921         }
3922 */
3923 }
3924
3925 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3926 {
3927 /*
3928         d_t *in;
3929         m_t *out;
3930         int i, count;
3931
3932         in = (void *)(mod_base + l->fileofs);
3933         if (l->filelen % sizeof(*in))
3934                 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3935         count = l->filelen / sizeof(*in);
3936         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3937
3938         loadmodel-> = out;
3939         loadmodel->num = count;
3940
3941         for (i = 0;i < count;i++, in++, out++)
3942         {
3943         }
3944 */
3945 }
3946
3947 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3948 {
3949 /*
3950         d_t *in;
3951         m_t *out;
3952         int i, count;
3953
3954         in = (void *)(mod_base + l->fileofs);
3955         if (l->filelen % sizeof(*in))
3956                 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3957         count = l->filelen / sizeof(*in);
3958         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3959
3960         loadmodel-> = out;
3961         loadmodel->num = count;
3962
3963         for (i = 0;i < count;i++, in++, out++)
3964         {
3965         }
3966 */
3967 }
3968
3969 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3970 {
3971 /*
3972         d_t *in;
3973         m_t *out;
3974         int i, count;
3975
3976         in = (void *)(mod_base + l->fileofs);
3977         if (l->filelen % sizeof(*in))
3978                 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3979         count = l->filelen / sizeof(*in);
3980         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3981
3982         loadmodel-> = out;
3983         loadmodel->num = count;
3984
3985         for (i = 0;i < count;i++, in++, out++)
3986         {
3987         }
3988 */
3989 }
3990
3991 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
3992 {
3993 /*
3994         d_t *in;
3995         m_t *out;
3996         int i, count;
3997
3998         in = (void *)(mod_base + l->fileofs);
3999         if (l->filelen % sizeof(*in))
4000                 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4001         count = l->filelen / sizeof(*in);
4002         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4003
4004         loadmodel-> = out;
4005         loadmodel->num = count;
4006
4007         for (i = 0;i < count;i++, in++, out++)
4008         {
4009         }
4010 */
4011 }
4012
4013 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4014 {
4015 /*
4016         d_t *in;
4017         m_t *out;
4018         int i, count;
4019
4020         in = (void *)(mod_base + l->fileofs);
4021         if (l->filelen % sizeof(*in))
4022                 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4023         count = l->filelen / sizeof(*in);
4024         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4025
4026         loadmodel-> = out;
4027         loadmodel->num = count;
4028
4029         for (i = 0;i < count;i++, in++, out++)
4030         {
4031         }
4032 */
4033 }
4034
4035 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4036 {
4037 /*
4038         d_t *in;
4039         m_t *out;
4040         int i, count;
4041
4042         in = (void *)(mod_base + l->fileofs);
4043         if (l->filelen % sizeof(*in))
4044                 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4045         count = l->filelen / sizeof(*in);
4046         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4047
4048         loadmodel-> = out;
4049         loadmodel->num = count;
4050
4051         for (i = 0;i < count;i++, in++, out++)
4052         {
4053         }
4054 */
4055 }
4056
4057 static void Mod_Q2BSP_LoadModels(lump_t *l)
4058 {
4059 /*
4060         d_t *in;
4061         m_t *out;
4062         int i, count;
4063
4064         in = (void *)(mod_base + l->fileofs);
4065         if (l->filelen % sizeof(*in))
4066                 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4067         count = l->filelen / sizeof(*in);
4068         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4069
4070         loadmodel-> = out;
4071         loadmodel->num = count;
4072
4073         for (i = 0;i < count;i++, in++, out++)
4074         {
4075         }
4076 */
4077 }
4078
4079 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4080 {
4081         int i;
4082         q2dheader_t *header;
4083
4084         Host_Error("Mod_Q2BSP_Load: not yet implemented");
4085
4086         mod->modeldatatypestring = "Q2BSP";
4087
4088         mod->type = mod_brushq2;
4089
4090         header = (q2dheader_t *)buffer;
4091
4092         i = LittleLong(header->version);
4093         if (i != Q2BSPVERSION)
4094                 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4095
4096         mod_base = (unsigned char *)header;
4097
4098         // swap all the lumps
4099         for (i = 0;i < (int) sizeof(*header) / 4;i++)
4100                 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4101
4102         mod->brush.qw_md4sum = 0;
4103         mod->brush.qw_md4sum2 = 0;
4104         for (i = 0;i < Q2HEADER_LUMPS;i++)
4105         {
4106                 if (i == Q2LUMP_ENTITIES)
4107                         continue;
4108                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4109                 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4110                         continue;
4111                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4112         }
4113
4114         Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4115         Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4116         Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4117         Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4118         Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4119         Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4120         Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4121         Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4122         Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4123         Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4124         Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4125         Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4126         Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4127         Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4128         Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4129         Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4130         Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4131         // LordHavoc: must go last because this makes the submodels
4132         Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4133 }
4134
4135 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4136 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4137
4138 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4139 {
4140         const char *data;
4141         char key[128], value[MAX_INPUTLINE];
4142         float v[3];
4143         loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4144         loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4145         loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4146         if (!l->filelen)
4147                 return;
4148         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4149         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4150         loadmodel->brush.entities[l->filelen] = 0;
4151         data = loadmodel->brush.entities;
4152         // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4153         // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
4154         loadmodel->brushq3.deluxemapping = false;
4155         if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4156         {
4157                 while (1)
4158                 {
4159                         if (!COM_ParseToken_Simple(&data, false, false))
4160                                 break; // error
4161                         if (com_token[0] == '}')
4162                                 break; // end of worldspawn
4163                         if (com_token[0] == '_')
4164                                 strlcpy(key, com_token + 1, sizeof(key));
4165                         else
4166                                 strlcpy(key, com_token, sizeof(key));
4167                         while (key[strlen(key)-1] == ' ') // remove trailing spaces
4168                                 key[strlen(key)-1] = 0;
4169                         if (!COM_ParseToken_Simple(&data, false, false))
4170                                 break; // error
4171                         strlcpy(value, com_token, sizeof(value));
4172                         if (!strcasecmp("gridsize", key)) // this one is case insensitive to 100% match q3map2
4173                         {
4174 #if _MSC_VER >= 1400
4175 #define sscanf sscanf_s
4176 #endif
4177 #if 0
4178                                 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4179                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4180 #else
4181                                 VectorSet(v, 64, 64, 128);
4182                                 if(sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) != 3)
4183                                         Con_Printf("Mod_Q3BSP_LoadEntities: funny gridsize \"%s\" in %s, interpreting as \"%f %f %f\" to match q3map2's parsing\n", value, loadmodel->name, v[0], v[1], v[2]);
4184                                 if (v[0] != 0 && v[1] != 0 && v[2] != 0)
4185                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4186 #endif
4187                         }
4188                         else if (!strcmp("deluxeMaps", key))
4189                         {
4190                                 if (!strcmp(com_token, "1"))
4191                                 {
4192                                         loadmodel->brushq3.deluxemapping = true;
4193                                         loadmodel->brushq3.deluxemapping_modelspace = true;
4194                                 }
4195                                 else if (!strcmp(com_token, "2"))
4196                                 {
4197                                         loadmodel->brushq3.deluxemapping = true;
4198                                         loadmodel->brushq3.deluxemapping_modelspace = false;
4199                                 }
4200                         }
4201                 }
4202         }
4203 }
4204
4205 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4206 {
4207         q3dtexture_t *in;
4208         texture_t *out;
4209         int i, count;
4210
4211         in = (q3dtexture_t *)(mod_base + l->fileofs);
4212         if (l->filelen % sizeof(*in))
4213                 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4214         count = l->filelen / sizeof(*in);
4215         out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4216
4217         loadmodel->data_textures = out;
4218         loadmodel->num_textures = count;
4219         loadmodel->num_texturesperskin = loadmodel->num_textures;
4220
4221         for (i = 0;i < count;i++)
4222         {
4223                 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4224                 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4225                 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4226         }
4227
4228         if (cls.state == ca_dedicated)
4229                 return;
4230
4231         for (i = 0;i < count;i++, in++, out++)
4232                 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4233 }
4234
4235 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4236 {
4237         q3dplane_t *in;
4238         mplane_t *out;
4239         int i, count;
4240
4241         in = (q3dplane_t *)(mod_base + l->fileofs);
4242         if (l->filelen % sizeof(*in))
4243                 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4244         count = l->filelen / sizeof(*in);
4245         out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4246
4247         loadmodel->brush.data_planes = out;
4248         loadmodel->brush.num_planes = count;
4249
4250         for (i = 0;i < count;i++, in++, out++)
4251         {
4252                 out->normal[0] = LittleFloat(in->normal[0]);
4253                 out->normal[1] = LittleFloat(in->normal[1]);
4254                 out->normal[2] = LittleFloat(in->normal[2]);
4255                 out->dist = LittleFloat(in->dist);
4256                 PlaneClassify(out);
4257         }
4258 }
4259
4260 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4261 {
4262         q3dbrushside_t *in;
4263         q3mbrushside_t *out;
4264         int i, n, count;
4265
4266         in = (q3dbrushside_t *)(mod_base + l->fileofs);
4267         if (l->filelen % sizeof(*in))
4268                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4269         count = l->filelen / sizeof(*in);
4270         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4271
4272         loadmodel->brush.data_brushsides = out;
4273         loadmodel->brush.num_brushsides = count;
4274
4275         for (i = 0;i < count;i++, in++, out++)
4276         {
4277                 n = LittleLong(in->planeindex);
4278                 if (n < 0 || n >= loadmodel->brush.num_planes)
4279                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4280                 out->plane = loadmodel->brush.data_planes + n;
4281                 n = LittleLong(in->textureindex);
4282                 if (n < 0 || n >= loadmodel->num_textures)
4283                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4284                 out->texture = loadmodel->data_textures + n;
4285         }
4286 }
4287
4288 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4289 {
4290         q3dbrushside_ig_t *in;
4291         q3mbrushside_t *out;
4292         int i, n, count;
4293
4294         in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4295         if (l->filelen % sizeof(*in))
4296                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4297         count = l->filelen / sizeof(*in);
4298         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4299
4300         loadmodel->brush.data_brushsides = out;
4301         loadmodel->brush.num_brushsides = count;
4302
4303         for (i = 0;i < count;i++, in++, out++)
4304         {
4305                 n = LittleLong(in->planeindex);
4306                 if (n < 0 || n >= loadmodel->brush.num_planes)
4307                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4308                 out->plane = loadmodel->brush.data_planes + n;
4309                 n = LittleLong(in->textureindex);
4310                 if (n < 0 || n >= loadmodel->num_textures)
4311                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4312                 out->texture = loadmodel->data_textures + n;
4313         }
4314 }
4315
4316 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4317 {
4318         q3dbrush_t *in;
4319         q3mbrush_t *out;
4320         int i, j, n, c, count, maxplanes, q3surfaceflags;
4321         colplanef_t *planes;
4322
4323         in = (q3dbrush_t *)(mod_base + l->fileofs);
4324         if (l->filelen % sizeof(*in))
4325                 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4326         count = l->filelen / sizeof(*in);
4327         out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4328
4329         loadmodel->brush.data_brushes = out;
4330         loadmodel->brush.num_brushes = count;
4331
4332         maxplanes = 0;
4333         planes = NULL;
4334
4335         for (i = 0;i < count;i++, in++, out++)
4336         {
4337                 n = LittleLong(in->firstbrushside);
4338                 c = LittleLong(in->numbrushsides);
4339                 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4340                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4341                 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4342                 out->numbrushsides = c;
4343                 n = LittleLong(in->textureindex);
4344                 if (n < 0 || n >= loadmodel->num_textures)
4345                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4346                 out->texture = loadmodel->data_textures + n;
4347
4348                 // make a list of mplane_t structs to construct a colbrush from
4349                 if (maxplanes < out->numbrushsides)
4350                 {
4351                         maxplanes = out->numbrushsides;
4352                         if (planes)
4353                                 Mem_Free(planes);
4354                         planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4355                 }
4356                 q3surfaceflags = 0;
4357                 for (j = 0;j < out->numbrushsides;j++)
4358                 {
4359                         VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4360                         planes[j].dist = out->firstbrushside[j].plane->dist;
4361                         planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4362                         planes[j].texture = out->firstbrushside[j].texture;
4363                         q3surfaceflags |= planes[j].q3surfaceflags;
4364                 }
4365                 // make the colbrush from the planes
4366                 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4367
4368                 // this whole loop can take a while (e.g. on redstarrepublic4)
4369                 CL_KeepaliveMessage(false);
4370         }
4371         if (planes)
4372                 Mem_Free(planes);
4373 }
4374
4375 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4376 {
4377         q3deffect_t *in;
4378         q3deffect_t *out;
4379         int i, n, count;
4380
4381         in = (q3deffect_t *)(mod_base + l->fileofs);
4382         if (l->filelen % sizeof(*in))
4383                 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4384         count = l->filelen / sizeof(*in);
4385         out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4386
4387         loadmodel->brushq3.data_effects = out;
4388         loadmodel->brushq3.num_effects = count;
4389
4390         for (i = 0;i < count;i++, in++, out++)
4391         {
4392                 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4393                 n = LittleLong(in->brushindex);
4394                 if (n >= loadmodel->brush.num_brushes)
4395                 {
4396                         Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4397                         n = -1;
4398                 }
4399                 out->brushindex = n;
4400                 out->unknown = LittleLong(in->unknown);
4401         }
4402 }
4403
4404 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4405 {
4406         q3dvertex_t *in;
4407         int i, count;
4408
4409         in = (q3dvertex_t *)(mod_base + l->fileofs);
4410         if (l->filelen % sizeof(*in))
4411                 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4412         loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4413         loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4414         loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4415         loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4416         loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4417         loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4418
4419         for (i = 0;i < count;i++, in++)
4420         {
4421                 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4422                 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4423                 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4424                 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4425                 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4426                 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4427                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4428                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4429                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4430                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4431                 // svector/tvector are calculated later in face loading
4432                 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4433                 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4434                 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4435                 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4436         }
4437 }
4438
4439 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4440 {
4441         int *in;
4442         int *out;
4443         int i, count;
4444
4445         in = (int *)(mod_base + l->fileofs);
4446         if (l->filelen % sizeof(int[3]))
4447                 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4448         count = l->filelen / sizeof(*in);
4449         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4450
4451         loadmodel->brushq3.num_triangles = count / 3;
4452         loadmodel->brushq3.data_element3i = out;
4453
4454         for (i = 0;i < count;i++, in++, out++)
4455         {
4456                 *out = LittleLong(*in);
4457                 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4458                 {
4459                         Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4460                         if(!loadmodel->brushq3.num_vertices)
4461                                 Host_Error("Mod_Q1BSP_LoadTrianglles: %s has triangles but no vertexes, cannot fix\n", loadmodel->name);
4462                         *out = 0;
4463                 }
4464         }
4465 }
4466
4467 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4468 {
4469         q3dlightmap_t *input_pointer;
4470         int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4471         unsigned char *c;
4472
4473         unsigned char *convertedpixels;
4474         char mapname[MAX_QPATH];
4475         int size, bytesperpixel, rgbmap[3];
4476         qboolean external;
4477         unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4478
4479         // defaults for q3bsp
4480         size = 128;
4481         bytesperpixel = 3;
4482         rgbmap[0] = 2;
4483         rgbmap[1] = 1;
4484         rgbmap[2] = 0;
4485         external = false;
4486         loadmodel->brushq3.lightmapsize = 128;
4487
4488         if (cls.state == ca_dedicated)
4489                 return;
4490
4491         if(mod_q3bsp_nolightmaps.integer)
4492         {
4493                 return;
4494         }
4495         else if(l->filelen)
4496         {
4497                 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4498                 if (developer_loading.integer)
4499                         Con_Printf("Using internal lightmaps\n");
4500                 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4501                 if (l->filelen % sizeof(*input_pointer))
4502                         Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4503                 count = l->filelen / sizeof(*input_pointer);
4504                 for(i = 0; i < count; ++i)
4505                         inpixels[i] = input_pointer[i].rgb;
4506         }
4507         else
4508         {
4509                 // no internal lightmaps
4510                 // try external lightmaps
4511                 if (developer_loading.integer)
4512                         Con_Printf("Using external lightmaps\n");
4513                 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4514                 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false);
4515                 if(!inpixels[0])
4516                         return;
4517
4518                 // using EXTERNAL lightmaps instead
4519                 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4520                 {
4521                         Mem_Free(inpixels[0]);
4522                         Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4523                 }
4524
4525                 size = image_width;
4526                 bytesperpixel = 4;
4527                 rgbmap[0] = 0;
4528                 rgbmap[1] = 1;
4529                 rgbmap[2] = 2;
4530                 external = true;
4531
4532                 for(count = 1; ; ++count)
4533                 {
4534                         inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false);
4535                         if(!inpixels[count])
4536                                 break; // we got all of them
4537                         if(image_width != size || image_height != size)
4538                         {
4539                                 for(i = 0; i <= count; ++i)
4540                                         Mem_Free(inpixels[i]);
4541                                 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4542                         }
4543                 }
4544         }
4545
4546         convertedpixels = (unsigned char *) Mem_Alloc(tempmempool, size*size*4);
4547         loadmodel->brushq3.lightmapsize = size;
4548         loadmodel->brushq3.num_originallightmaps = count;
4549
4550         // now check the surfaces to see if any of them index an odd numbered
4551         // lightmap, if so this is not a deluxemapped bsp file
4552         //
4553         // also check what lightmaps are actually used, because q3map2 sometimes
4554         // (always?) makes an unused one at the end, which
4555         // q3map2 sometimes (or always?) makes a second blank lightmap for no
4556         // reason when only one lightmap is used, which can throw off the
4557         // deluxemapping detection method, so check 2-lightmap bsp's specifically
4558         // to see if the second lightmap is blank, if so it is not deluxemapped.
4559         // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
4560         // in Mod_Q3BSP_LoadEntities was failed
4561         if (!loadmodel->brushq3.deluxemapping)
4562         {
4563                 loadmodel->brushq3.deluxemapping = !(count & 1);
4564                 loadmodel->brushq3.deluxemapping_modelspace = true;
4565                 endlightmap = 0;
4566                 if (loadmodel->brushq3.deluxemapping)
4567                 {
4568                         int facecount = faceslump->filelen / sizeof(q3dface_t);
4569                         q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4570                         for (i = 0;i < facecount;i++)
4571                         {
4572                                 j = LittleLong(faces[i].lightmapindex);
4573                                 if (j >= 0)
4574                                 {
4575                                         endlightmap = max(endlightmap, j + 1);
4576                                         if ((j & 1) || j + 1 >= count)
4577                                         {
4578                                                 loadmodel->brushq3.deluxemapping = false;
4579                                                 break;
4580                                         }
4581                                 }
4582                         }
4583                 }
4584
4585                 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4586                 // reason when only one lightmap is used, which can throw off the
4587                 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4588                 // to see if the second lightmap is blank, if so it is not deluxemapped.
4589                 //
4590                 // further research has shown q3map2 sometimes creates a deluxemap and two
4591                 // blank lightmaps, which must be handled properly as well
4592                 if (endlightmap == 1 && count > 1)
4593                 {
4594                         c = inpixels[1];
4595                         for (i = 0;i < size*size;i++)
4596                         {
4597                                 if (c[bytesperpixel*i + rgbmap[0]])
4598                                         break;
4599                                 if (c[bytesperpixel*i + rgbmap[1]])
4600                                         break;
4601                                 if (c[bytesperpixel*i + rgbmap[2]])
4602                                         break;
4603                         }
4604                         if (i == size*size)
4605                         {
4606                                 // all pixels in the unused lightmap were black...
4607                                 loadmodel->brushq3.deluxemapping = false;
4608                         }
4609                 }
4610         }
4611
4612         Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4613
4614         // figure out what the most reasonable merge power is within limits
4615
4616         loadmodel->brushq3.num_lightmapmergepower = 0;
4617
4618         for(i = 0; (128 << i) < size; ++i)
4619                 ;
4620         // i is now 0 for 128, 1 for 256, etc
4621
4622         for (power = 1;power + i <= mod_q3bsp_lightmapmergepower.integer && (size << power) <= (int)vid.maxtexturesize_2d && (1 << (power * 2)) < 4 * (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)); power++)
4623                 loadmodel->brushq3.num_lightmapmergepower = power;
4624
4625         loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4626
4627         loadmodel->brushq3.num_mergedlightmaps = ((count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4628         loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4629         if (loadmodel->brushq3.deluxemapping)
4630                 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4631
4632         // allocate a texture pool if we need it
4633         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4634                 loadmodel->texturepool = R_AllocTexturePool();
4635
4636         power = loadmodel->brushq3.num_lightmapmergepower;
4637         power2 = power * 2;
4638         mask = (1 << power) - 1;
4639         for (i = 0;i < count;i++)
4640         {
4641                 // figure out which merged lightmap texture this fits into
4642                 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4643                 for (k = 0;k < size*size;k++)
4644                 {
4645                         convertedpixels[k*4+0] = inpixels[i][k*bytesperpixel+rgbmap[0]];
4646                         convertedpixels[k*4+1] = inpixels[i][k*bytesperpixel+rgbmap[1]];
4647                         convertedpixels[k*4+2] = inpixels[i][k*bytesperpixel+rgbmap[2]];
4648                         convertedpixels[k*4+3] = 255;
4649                 }
4650                 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4651                 {
4652                         // if the lightmap has not been allocated yet, create it
4653                         if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4654                         {
4655                                 // create a lightmap only as large as necessary to hold the
4656                                 // remaining size*size blocks
4657                                 // if there are multiple merged lightmap textures then they will
4658                                 // all be full size except the last one which may be smaller
4659                                 // because it only needs to the remaining blocks, and it will often
4660                                 // be odd sizes like 2048x512 due to only being 25% full or so.
4661                                 j = (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) - (lightmapindex << power2);
4662                                 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4663                                         ;
4664                                 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4665                                         ;
4666                                 if (developer_loading.integer)
4667                                         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);
4668                                 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);
4669                                 if (loadmodel->brushq3.data_deluxemaps)
4670                                         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);
4671                         }
4672                         mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4673                         mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4674                         j = (i >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) & ((1 << power2) - 1);
4675                         if (loadmodel->brushq3.deluxemapping && (i & 1))
4676                                 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4677                         else
4678                                 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4679                 }
4680                 else
4681                 {
4682                         // figure out which merged lightmap texture this fits into
4683                         if (loadmodel->brushq3.deluxemapping && (i & 1))
4684                                 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);
4685                         else
4686                                 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);
4687                 }
4688         }
4689
4690         Mem_Free(convertedpixels);
4691         if(external)
4692         {
4693                 for(i = 0; i < count; ++i)
4694                         Mem_Free(inpixels[i]);
4695         }
4696 }
4697
4698 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
4699 {
4700         int j, k, cnt, tri;
4701         float *mins, *maxs;
4702         const float *vert;
4703         *collisionstride = stride;
4704         if(stride > 0)
4705         {
4706                 cnt = (num_triangles + stride - 1) / stride;
4707                 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
4708                 for(j = 0; j < cnt; ++j)
4709                 {
4710                         mins = &((*collisionbbox6f)[6 * j + 0]);
4711                         maxs = &((*collisionbbox6f)[6 * j + 3]);
4712                         for(k = 0; k < stride; ++k)
4713                         {
4714                                 tri = j * stride + k;
4715                                 if(tri >= num_triangles)
4716                                         break;
4717                                 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
4718                                 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
4719                                 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
4720                                 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
4721                                 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
4722                                 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
4723                                 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
4724                                 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
4725                                 if(vert[0] < mins[0]) mins[0] = vert[0];
4726                                 if(vert[1] < mins[1]) mins[1] = vert[1];
4727                                 if(vert[2] < mins[2]) mins[2] = vert[2];
4728                                 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4729                                 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4730                                 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4731                                 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
4732                                 if(vert[0] < mins[0]) mins[0] = vert[0];
4733                                 if(vert[1] < mins[1]) mins[1] = vert[1];
4734                                 if(vert[2] < mins[2]) mins[2] = vert[2];
4735                                 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4736                                 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4737                                 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4738                         }
4739                 }
4740         }
4741         else
4742                 *collisionbbox6f = NULL;
4743 }
4744
4745 typedef struct patchtess_s
4746 {
4747         patchinfo_t info;
4748
4749         // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
4750         int surface_id;
4751         float lodgroup[6];
4752         float *originalvertex3f;
4753 } patchtess_t;
4754
4755 #define PATCHTESS_SAME_LODGROUP(a,b) \
4756         ( \
4757                 (a).lodgroup[0] == (b).lodgroup[0] && \
4758                 (a).lodgroup[1] == (b).lodgroup[1] && \
4759                 (a).lodgroup[2] == (b).lodgroup[2] && \
4760                 (a).lodgroup[3] == (b).lodgroup[3] && \
4761                 (a).lodgroup[4] == (b).lodgroup[4] && \
4762                 (a).lodgroup[5] == (b).lodgroup[5] \
4763         )
4764
4765 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4766 {
4767         q3dface_t *in, *oldin;
4768         msurface_t *out, *oldout;
4769         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;
4770         float lightmaptcbase[2], lightmaptcscale[2];
4771         //int *originalelement3i;
4772         //int *originalneighbor3i;
4773         float *originalvertex3f;
4774         //float *originalsvector3f;
4775         //float *originaltvector3f;
4776         float *originalnormal3f;
4777         float *originalcolor4f;
4778         float *originaltexcoordtexture2f;
4779         float *originaltexcoordlightmap2f;
4780         float *v;
4781         patchtess_t *patchtess = NULL;
4782         int patchtesscount = 0;
4783         qboolean again;
4784
4785         in = (q3dface_t *)(mod_base + l->fileofs);
4786         if (l->filelen % sizeof(*in))
4787                 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4788         count = l->filelen / sizeof(*in);
4789         out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4790
4791         loadmodel->data_surfaces = out;
4792         loadmodel->num_surfaces = count;
4793
4794         if(count > 0)
4795                 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
4796
4797         i = 0;
4798         oldi = i;
4799         oldin = in;
4800         oldout = out;
4801         meshvertices = 0;
4802         meshtriangles = 0;
4803         for (;i < count;i++, in++, out++)
4804         {
4805                 // check face type first
4806                 type = LittleLong(in->type);
4807                 if (type != Q3FACETYPE_FLAT
4808                  && type != Q3FACETYPE_PATCH
4809                  && type != Q3FACETYPE_MESH
4810                  && type != Q3FACETYPE_FLARE)
4811                 {
4812                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4813                         continue;
4814                 }
4815
4816                 n = LittleLong(in->textureindex);
4817                 if (n < 0 || n >= loadmodel->num_textures)
4818                 {
4819                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4820                         continue;
4821                 }
4822                 out->texture = loadmodel->data_textures + n;
4823                 n = LittleLong(in->effectindex);
4824                 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4825                 {
4826                         if (developer.integer >= 100)
4827                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4828                         n = -1;
4829                 }
4830                 if (n == -1)
4831                         out->effect = NULL;
4832                 else
4833                         out->effect = loadmodel->brushq3.data_effects + n;
4834
4835                 if (cls.state != ca_dedicated)
4836                 {
4837                         out->lightmaptexture = NULL;
4838                         out->deluxemaptexture = r_texture_blanknormalmap;
4839                         n = LittleLong(in->lightmapindex);
4840                         if (n < 0)
4841                                 n = -1;
4842                         else if (n >= loadmodel->brushq3.num_originallightmaps)
4843                         {
4844                                 if(loadmodel->brushq3.num_originallightmaps != 0)
4845                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4846                                 n = -1;
4847                         }
4848                         else
4849                         {
4850                                 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4851                                 if (loadmodel->brushq3.deluxemapping)
4852                                         out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4853                         }
4854                 }
4855
4856                 firstvertex = LittleLong(in->firstvertex);
4857                 numvertices = LittleLong(in->numvertices);
4858                 firstelement = LittleLong(in->firstelement);
4859                 numtriangles = LittleLong(in->numelements) / 3;
4860                 if (numtriangles * 3 != LittleLong(in->numelements))
4861                 {
4862                         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));
4863                         continue;
4864                 }
4865                 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4866                 {
4867                         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);
4868                         continue;
4869                 }
4870                 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4871                 {
4872                         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);
4873                         continue;
4874                 }
4875                 switch(type)
4876                 {
4877                 case Q3FACETYPE_FLAT:
4878                 case Q3FACETYPE_MESH:
4879                         // no processing necessary
4880                         break;
4881                 case Q3FACETYPE_PATCH:
4882                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4883                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4884                         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))
4885                         {
4886                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4887                                 continue;
4888                         }
4889                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4890
4891                         // convert patch to Q3FACETYPE_MESH
4892                         xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4893                         ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4894                         // bound to user settings
4895                         xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4896                         ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4897                         // bound to sanity settings
4898                         xtess = bound(0, xtess, 1024);
4899                         ytess = bound(0, ytess, 1024);
4900
4901                         // lower quality collision patches! Same procedure as before, but different cvars
4902                         // convert patch to Q3FACETYPE_MESH
4903                         cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4904                         cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4905                         // bound to user settings
4906                         cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
4907                         cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
4908                         // bound to sanity settings
4909                         cxtess = bound(0, cxtess, 1024);
4910                         cytess = bound(0, cytess, 1024);
4911
4912                         // store it for the LOD grouping step
4913                         patchtess[patchtesscount].info.xsize = patchsize[0];
4914                         patchtess[patchtesscount].info.ysize = patchsize[1];
4915                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
4916                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
4917                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
4918                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
4919
4920                         patchtess[patchtesscount].surface_id = i;
4921                         patchtess[patchtesscount].lodgroup[0] = in->specific.patch.mins[0];
4922                         patchtess[patchtesscount].lodgroup[1] = in->specific.patch.mins[1];
4923                         patchtess[patchtesscount].lodgroup[2] = in->specific.patch.mins[2];
4924                         patchtess[patchtesscount].lodgroup[3] = in->specific.patch.maxs[0];
4925                         patchtess[patchtesscount].lodgroup[4] = in->specific.patch.maxs[1];
4926                         patchtess[patchtesscount].lodgroup[5] = in->specific.patch.maxs[2];
4927                         patchtess[patchtesscount].originalvertex3f = originalvertex3f;
4928                         ++patchtesscount;
4929                         break;
4930                 case Q3FACETYPE_FLARE:
4931                         if (developer.integer >= 100)
4932                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4933                         // don't render it
4934                         continue;
4935                 }
4936                 out->num_vertices = numvertices;
4937                 out->num_triangles = numtriangles;
4938                 meshvertices += out->num_vertices;
4939                 meshtriangles += out->num_triangles;
4940         }
4941
4942         // Fix patches tesselations so that they make no seams
4943         do
4944         {
4945                 again = false;
4946                 for(i = 0; i < patchtesscount; ++i)
4947                 {
4948                         for(j = i+1; j < patchtesscount; ++j)
4949                         {
4950                                 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
4951                                         continue;
4952
4953                                 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
4954                                         again = true;
4955                         }
4956                 }
4957         }
4958         while (again);
4959
4960         // Calculate resulting number of triangles
4961         for(i = 0; i < patchtesscount; ++i)
4962         {
4963                 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
4964                 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
4965                 numvertices = finalwidth * finalheight;
4966                 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4967
4968                 oldout[patchtess[i].surface_id].num_vertices = numvertices;
4969                 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
4970                 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
4971                 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
4972         }
4973
4974         i = oldi;
4975         in = oldin;
4976         out = oldout;
4977         Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4978         meshvertices = 0;
4979         meshtriangles = 0;
4980         for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
4981         {
4982                 if (out->num_vertices < 3 || out->num_triangles < 1)
4983                         continue;
4984
4985                 type = LittleLong(in->type);
4986                 firstvertex = LittleLong(in->firstvertex);
4987                 firstelement = LittleLong(in->firstelement);
4988                 out->num_firstvertex = meshvertices;
4989                 out->num_firsttriangle = meshtriangles;
4990                 switch(type)
4991                 {
4992                 case Q3FACETYPE_FLAT:
4993                 case Q3FACETYPE_MESH:
4994                         // no processing necessary, except for lightmap merging
4995                         for (j = 0;j < out->num_vertices;j++)
4996                         {
4997                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4998                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4999                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5000                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5001                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5002                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5003                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5004                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5005                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5006                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5007                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5008                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5009                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5010                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5011                         }
5012                         for (j = 0;j < out->num_triangles*3;j++)
5013                                 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5014                         break;
5015                 case Q3FACETYPE_PATCH:
5016                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5017                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5018                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5019                         originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5020                         originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5021                         originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5022                         originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5023
5024                         xtess = ytess = cxtess = cytess = -1;
5025                         for(j = 0; j < patchtesscount; ++j)
5026                                 if(patchtess[j].surface_id == i)
5027                                 {
5028                                         xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5029                                         ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5030                                         cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5031                                         cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5032                                         break;
5033                                 }
5034                         if(xtess == -1)
5035                         {
5036                                 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5037                                 xtess = ytess = cxtess = cytess = 0;
5038                         }
5039
5040                         finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5041                         finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5042                         finalvertices = finalwidth * finalheight;
5043                         finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5044                         type = Q3FACETYPE_MESH;
5045                         // generate geometry
5046                         // (note: normals are skipped because they get recalculated)
5047                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5048                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5049                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5050                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5051                         Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5052                         Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5053
5054                         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);
5055
5056                         if (developer.integer >= 100)
5057                         {
5058                                 if (out->num_triangles < finaltriangles)
5059                                         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);
5060                                 else
5061                                         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);
5062                         }
5063                         // q3map does not put in collision brushes for curves... ugh
5064                         // build the lower quality collision geometry
5065                         finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5066                         finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5067                         finalvertices = finalwidth * finalheight;
5068                         finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5069
5070                         out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5071                         out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5072                         out->num_collisionvertices = finalvertices;
5073                         out->num_collisiontriangles = finaltriangles;
5074                         Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5075                         Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
5076
5077                         //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5078                         Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
5079
5080                         oldnumtriangles = out->num_triangles;
5081                         oldnumtriangles2 = out->num_collisiontriangles;
5082                         out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
5083
5084                         // now optimize the collision mesh by finding triangle bboxes...
5085                         Mod_Q3BSP_BuildBBoxes(out->data_collisionelement3i, out->num_collisiontriangles, out->data_collisionvertex3f, &out->data_collisionbbox6f, &out->num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5086                         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);
5087
5088                         if (developer.integer >= 100)
5089                                 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);
5090                         break;
5091                 default:
5092                         break;
5093                 }
5094                 meshvertices += out->num_vertices;
5095                 meshtriangles += out->num_triangles;
5096                 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5097                         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)
5098                                 invalidelements++;
5099                 if (invalidelements)
5100                 {
5101                         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);
5102                         for (j = 0;j < out->num_triangles * 3;j++)
5103                         {
5104                                 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5105                                 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)
5106                                         (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5107                         }
5108                         Con_Print("\n");
5109                 }
5110                 // calculate a bounding box
5111                 VectorClear(out->mins);
5112                 VectorClear(out->maxs);
5113                 if (out->num_vertices)
5114                 {
5115                         if (cls.state != ca_dedicated && out->lightmaptexture)
5116                         {
5117                                 // figure out which part of the merged lightmap this fits into
5118                                 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5119                                 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5120                                 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5121                                 lightmapindex &= mergewidth * mergeheight - 1;
5122                                 lightmaptcscale[0] = 1.0f / mergewidth;
5123                                 lightmaptcscale[1] = 1.0f / mergeheight;
5124                                 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5125                                 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5126                                 // modify the lightmap texcoords to match this region of the merged lightmap
5127                                 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5128                                 {
5129                                         v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5130                                         v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5131                                 }
5132                         }
5133                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5134                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5135                         for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5136                         {
5137                                 out->mins[0] = min(out->mins[0], v[0]);
5138                                 out->maxs[0] = max(out->maxs[0], v[0]);
5139                                 out->mins[1] = min(out->mins[1], v[1]);
5140                                 out->maxs[1] = max(out->maxs[1], v[1]);
5141                                 out->mins[2] = min(out->mins[2], v[2]);
5142                                 out->maxs[2] = max(out->maxs[2], v[2]);
5143                         }
5144                         out->mins[0] -= 1.0f;
5145                         out->mins[1] -= 1.0f;
5146                         out->mins[2] -= 1.0f;
5147                         out->maxs[0] += 1.0f;
5148                         out->maxs[1] += 1.0f;
5149                         out->maxs[2] += 1.0f;
5150                 }
5151                 // set lightmap styles for consistency with q1bsp
5152                 //out->lightmapinfo->styles[0] = 0;
5153                 //out->lightmapinfo->styles[1] = 255;
5154                 //out->lightmapinfo->styles[2] = 255;
5155                 //out->lightmapinfo->styles[3] = 255;
5156         }
5157
5158         i = oldi;
5159         out = oldout;
5160         for (;i < count;i++, out++)
5161         {
5162                 if(out->num_vertices && out->num_triangles)
5163                         continue;
5164                 if(out->num_vertices == 0)
5165                         Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no vertices, ignoring\n", i);
5166                 if(out->num_triangles == 0)
5167                         Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no triangles, ignoring\n", i);
5168         }
5169
5170         // for per pixel lighting
5171         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);
5172
5173         // generate ushort elements array if possible
5174         if (loadmodel->surfmesh.data_element3s)
5175                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5176                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5177
5178         // free the no longer needed vertex data
5179         loadmodel->brushq3.num_vertices = 0;
5180         if (loadmodel->brushq3.data_vertex3f)
5181                 Mem_Free(loadmodel->brushq3.data_vertex3f);
5182         loadmodel->brushq3.data_vertex3f = NULL;
5183         loadmodel->brushq3.data_normal3f = NULL;
5184         loadmodel->brushq3.data_texcoordtexture2f = NULL;
5185         loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5186         loadmodel->brushq3.data_color4f = NULL;
5187         // free the no longer needed triangle data
5188         loadmodel->brushq3.num_triangles = 0;
5189         if (loadmodel->brushq3.data_element3i)
5190                 Mem_Free(loadmodel->brushq3.data_element3i);
5191         loadmodel->brushq3.data_element3i = NULL;
5192
5193         if(patchtess)
5194                 Mem_Free(patchtess);
5195 }
5196
5197 static void Mod_Q3BSP_LoadModels(lump_t *l)
5198 {
5199         q3dmodel_t *in;
5200         q3dmodel_t *out;
5201         int i, j, n, c, count;
5202
5203         in = (q3dmodel_t *)(mod_base + l->fileofs);
5204         if (l->filelen % sizeof(*in))
5205                 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5206         count = l->filelen / sizeof(*in);
5207         out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5208
5209         loadmodel->brushq3.data_models = out;
5210         loadmodel->brushq3.num_models = count;
5211
5212         for (i = 0;i < count;i++, in++, out++)
5213         {
5214                 for (j = 0;j < 3;j++)
5215                 {
5216                         out->mins[j] = LittleFloat(in->mins[j]);
5217                         out->maxs[j] = LittleFloat(in->maxs[j]);
5218                 }
5219                 n = LittleLong(in->firstface);
5220                 c = LittleLong(in->numfaces);
5221                 if (n < 0 || n + c > loadmodel->num_surfaces)
5222                         Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5223                 out->firstface = n;
5224                 out->numfaces = c;
5225                 n = LittleLong(in->firstbrush);
5226                 c = LittleLong(in->numbrushes);
5227                 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5228                         Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5229                 out->firstbrush = n;
5230                 out->numbrushes = c;
5231         }
5232 }
5233
5234 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5235 {
5236         int *in;
5237         int *out;
5238         int i, n, count;
5239
5240         in = (int *)(mod_base + l->fileofs);
5241         if (l->filelen % sizeof(*in))
5242                 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5243         count = l->filelen / sizeof(*in);
5244         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5245
5246         loadmodel->brush.data_leafbrushes = out;
5247         loadmodel->brush.num_leafbrushes = count;
5248
5249         for (i = 0;i < count;i++, in++, out++)
5250         {
5251                 n = LittleLong(*in);
5252                 if (n < 0 || n >= loadmodel->brush.num_brushes)
5253                         Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5254                 *out = n;
5255         }
5256 }
5257
5258 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5259 {
5260         int *in;
5261         int *out;
5262         int i, n, count;
5263
5264         in = (int *)(mod_base + l->fileofs);
5265         if (l->filelen % sizeof(*in))
5266                 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5267         count = l->filelen / sizeof(*in);
5268         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5269
5270         loadmodel->brush.data_leafsurfaces = out;
5271         loadmodel->brush.num_leafsurfaces = count;
5272
5273         for (i = 0;i < count;i++, in++, out++)
5274         {
5275                 n = LittleLong(*in);
5276                 if (n < 0 || n >= loadmodel->num_surfaces)
5277                         Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5278                 *out = n;
5279         }
5280 }
5281
5282 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5283 {
5284         q3dleaf_t *in;
5285         mleaf_t *out;
5286         int i, j, n, c, count;
5287
5288         in = (q3dleaf_t *)(mod_base + l->fileofs);
5289         if (l->filelen % sizeof(*in))
5290                 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5291         count = l->filelen / sizeof(*in);
5292         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5293
5294         loadmodel->brush.data_leafs = out;
5295         loadmodel->brush.num_leafs = count;
5296
5297         for (i = 0;i < count;i++, in++, out++)
5298         {
5299                 out->parent = NULL;
5300                 out->plane = NULL;
5301                 out->clusterindex = LittleLong(in->clusterindex);
5302                 out->areaindex = LittleLong(in->areaindex);
5303                 for (j = 0;j < 3;j++)
5304                 {
5305                         // yes the mins/maxs are ints
5306                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5307                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5308                 }
5309                 n = LittleLong(in->firstleafface);
5310                 c = LittleLong(in->numleaffaces);
5311                 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5312                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5313                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5314                 out->numleafsurfaces = c;
5315                 n = LittleLong(in->firstleafbrush);
5316                 c = LittleLong(in->numleafbrushes);
5317                 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5318                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5319                 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5320                 out->numleafbrushes = c;
5321         }
5322 }
5323
5324 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5325 {
5326         q3dnode_t *in;
5327         mnode_t *out;
5328         int i, j, n, count;
5329
5330         in = (q3dnode_t *)(mod_base + l->fileofs);
5331         if (l->filelen % sizeof(*in))
5332                 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5333         count = l->filelen / sizeof(*in);
5334         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5335
5336         loadmodel->brush.data_nodes = out;
5337         loadmodel->brush.num_nodes = count;
5338
5339         for (i = 0;i < count;i++, in++, out++)
5340         {
5341                 out->parent = NULL;
5342                 n = LittleLong(in->planeindex);
5343                 if (n < 0 || n >= loadmodel->brush.num_planes)
5344                         Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5345                 out->plane = loadmodel->brush.data_planes + n;
5346                 for (j = 0;j < 2;j++)
5347                 {
5348                         n = LittleLong(in->childrenindex[j]);
5349                         if (n >= 0)
5350                         {
5351                                 if (n >= loadmodel->brush.num_nodes)
5352                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5353                                 out->children[j] = loadmodel->brush.data_nodes + n;
5354                         }
5355                         else
5356                         {
5357                                 n = -1 - n;
5358                                 if (n >= loadmodel->brush.num_leafs)
5359                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5360                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5361                         }
5362                 }
5363                 for (j = 0;j < 3;j++)
5364                 {
5365                         // yes the mins/maxs are ints
5366                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5367                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5368                 }
5369         }
5370
5371         // set the parent pointers
5372         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5373 }
5374
5375 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5376 {
5377         q3dlightgrid_t *in;
5378         q3dlightgrid_t *out;
5379         int count;
5380
5381         in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5382         if (l->filelen % sizeof(*in))
5383                 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5384         loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5385         loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5386         loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5387         loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5388         loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5389         loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5390         loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5391         loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5392         loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5393         loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5394         loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5395         loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5396         count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5397         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]);
5398         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]);
5399
5400         // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5401         if (l->filelen)
5402         {
5403                 if (l->filelen < count * (int)sizeof(*in))
5404                 {
5405                         Con_Printf("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]);
5406                         return; // ignore the grid if we cannot understand it
5407                 }
5408                 if (l->filelen != count * (int)sizeof(*in))
5409                         Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5410                 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5411                 loadmodel->brushq3.data_lightgrid = out;
5412                 loadmodel->brushq3.num_lightgrid = count;
5413                 // no swapping or validation necessary
5414                 memcpy(out, in, count * (int)sizeof(*out));
5415         }
5416 }
5417
5418 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5419 {
5420         q3dpvs_t *in;
5421         int totalchains;
5422
5423         if (l->filelen == 0)
5424         {
5425                 int i;
5426                 // unvised maps often have cluster indices even without pvs, so check
5427                 // leafs to find real number of clusters
5428                 loadmodel->brush.num_pvsclusters = 1;
5429                 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5430                         loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5431
5432                 // create clusters
5433                 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5434                 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5435                 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5436                 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5437                 return;
5438         }
5439
5440         in = (q3dpvs_t *)(mod_base + l->fileofs);
5441         if (l->filelen < 9)
5442                 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5443
5444         loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5445         loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5446         if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5447                 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5448         totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5449         if (l->filelen < totalchains + (int)sizeof(*in))
5450                 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);
5451
5452         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5453         memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5454 }
5455
5456 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5457 {
5458         int i, j, k, index[3];
5459         float transformed[3], blend1, blend2, blend, stylescale;
5460         q3dlightgrid_t *a, *s;
5461
5462         // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5463         stylescale = r_refdef.scene.rtlightstylevalue[0];
5464
5465         if (!model->brushq3.num_lightgrid)
5466         {
5467                 ambientcolor[0] = stylescale;
5468                 ambientcolor[1] = stylescale;
5469                 ambientcolor[2] = stylescale;
5470                 return;
5471         }
5472
5473         Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5474         //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5475         //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5476         transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5477         transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5478         transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5479         index[0] = (int)floor(transformed[0]);
5480         index[1] = (int)floor(transformed[1]);
5481         index[2] = (int)floor(transformed[2]);
5482         //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5483
5484         // now lerp the values
5485         VectorClear(diffusenormal);
5486         a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5487         for (k = 0;k < 2;k++)
5488         {
5489                 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5490                 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5491                         continue;
5492                 for (j = 0;j < 2;j++)
5493                 {
5494                         blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5495                         if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5496                                 continue;
5497                         for (i = 0;i < 2;i++)
5498                         {
5499                                 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5500                                 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5501                                         continue;
5502                                 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5503                                 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5504                                 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5505                                 // this uses the mod_md3_sin table because the values are
5506                                 // already in the 0-255 range, the 64+ bias fetches a cosine
5507                                 // instead of a sine value
5508                                 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5509                                 diffusenormal[1] += blend * (mod_md3_sin[     s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5510                                 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5511                                 //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)));
5512                         }
5513                 }
5514         }
5515
5516         // normalize the light direction before turning
5517         VectorNormalize(diffusenormal);
5518         //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]);
5519 }
5520
5521 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
5522 {
5523         double t1, t2;
5524         double midf, mid[3];
5525         int ret, side;
5526
5527         // check for empty
5528         while (node->plane)
5529         {
5530                 // find the point distances
5531                 mplane_t *plane = node->plane;
5532                 if (plane->type < 3)
5533                 {
5534                         t1 = p1[plane->type] - plane->dist;
5535                         t2 = p2[plane->type] - plane->dist;
5536                 }
5537                 else
5538                 {
5539                         t1 = DotProduct (plane->normal, p1) - plane->dist;
5540                         t2 = DotProduct (plane->normal, p2) - plane->dist;
5541                 }
5542
5543                 if (t1 < 0)
5544                 {
5545                         if (t2 < 0)
5546                         {
5547                                 node = node->children[1];
5548                                 continue;
5549                         }
5550                         side = 1;
5551                 }
5552                 else
5553                 {
5554                         if (t2 >= 0)
5555                         {
5556                                 node = node->children[0];
5557                                 continue;
5558                         }
5559                         side = 0;
5560                 }
5561
5562                 midf = t1 / (t1 - t2);
5563                 VectorLerp(p1, midf, p2, mid);
5564
5565                 // recurse both sides, front side first
5566                 // return 2 if empty is followed by solid (hit something)
5567                 // do not return 2 if both are solid or both empty,
5568                 // or if start is solid and end is empty
5569                 // as these degenerate cases usually indicate the eye is in solid and
5570                 // should see the target point anyway
5571                 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side    ], p1, mid);
5572                 if (ret != 0)
5573                         return ret;
5574                 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
5575                 if (ret != 1)
5576                         return ret;
5577                 return 2;
5578         }
5579         return ((mleaf_t *)node)->clusterindex < 0;
5580 }
5581
5582 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
5583 {
5584         if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
5585         {
5586                 trace_t trace;
5587                 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
5588                 return trace.fraction == 1;
5589         }
5590         else
5591         {
5592                 double tracestart[3], traceend[3];
5593                 VectorCopy(start, tracestart);
5594                 VectorCopy(end, traceend);
5595                 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
5596         }
5597 }
5598
5599 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
5600 {
5601         int i;
5602         mleaf_t *leaf;
5603         colbrushf_t *brush;
5604         // find which leaf the point is in
5605         while (node->plane)
5606                 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5607         // point trace the brushes
5608         leaf = (mleaf_t *)node;
5609         for (i = 0;i < leaf->numleafbrushes;i++)
5610         {
5611                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5612                 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5613                 {
5614                         brush->markframe = markframe;
5615                         Collision_TracePointBrushFloat(trace, point, brush);
5616                 }
5617         }
5618         // can't do point traces on curves (they have no thickness)
5619 }
5620
5621 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)
5622 {
5623         int i, startside, endside;
5624         float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5625         mleaf_t *leaf;
5626         msurface_t *surface;
5627         mplane_t *plane;
5628         colbrushf_t *brush;
5629         // walk the tree until we hit a leaf, recursing for any split cases
5630         while (node->plane)
5631         {
5632                 // abort if this part of the bsp tree can not be hit by this trace
5633 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5634 //                      return;
5635                 plane = node->plane;
5636                 // axial planes are much more common than non-axial, so an optimized
5637                 // axial case pays off here
5638                 if (plane->type < 3)
5639                 {
5640                         dist1 = start[plane->type] - plane->dist;
5641                         dist2 = end[plane->type] - plane->dist;
5642                 }
5643                 else
5644                 {
5645                         dist1 = DotProduct(start, plane->normal) - plane->dist;
5646                         dist2 = DotProduct(end, plane->normal) - plane->dist;
5647                 }
5648                 startside = dist1 < 0;
5649                 endside = dist2 < 0;
5650                 if (startside == endside)
5651                 {
5652                         // most of the time the line fragment is on one side of the plane
5653                         node = node->children[startside];
5654                 }
5655                 else
5656                 {
5657                         // line crosses node plane, split the line
5658                         dist1 = PlaneDiff(linestart, plane);
5659                         dist2 = PlaneDiff(lineend, plane);
5660                         midfrac = dist1 / (dist1 - dist2);
5661                         VectorLerp(linestart, midfrac, lineend, mid);
5662                         // take the near side first
5663                         Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5664                         // if we found an impact on the front side, don't waste time
5665                         // exploring the far side
5666                         if (midfrac <= trace->realfraction)
5667                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5668                         return;
5669                 }
5670         }
5671         // abort if this part of the bsp tree can not be hit by this trace
5672 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5673 //              return;
5674         // hit a leaf
5675         nodesegmentmins[0] = min(start[0], end[0]) - 1;
5676         nodesegmentmins[1] = min(start[1], end[1]) - 1;
5677         nodesegmentmins[2] = min(start[2], end[2]) - 1;
5678         nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5679         nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5680         nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5681         // line trace the brushes
5682         leaf = (mleaf_t *)node;
5683         for (i = 0;i < leaf->numleafbrushes;i++)
5684         {
5685                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5686                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5687                 {
5688                         brush->markframe = markframe;
5689                         Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5690                 }
5691         }
5692         // can't do point traces on curves (they have no thickness)
5693         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5694         {
5695                 // line trace the curves
5696                 for (i = 0;i < leaf->numleafsurfaces;i++)
5697                 {
5698                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5699                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5700                         {
5701                                 surface->collisionmarkframe = markframe;
5702                                 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);
5703                         }
5704                 }
5705         }
5706 }
5707
5708 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)
5709 {
5710         int i;
5711         int sides;
5712         mleaf_t *leaf;
5713         colbrushf_t *brush;
5714         msurface_t *surface;
5715         mplane_t *plane;
5716         float nodesegmentmins[3], nodesegmentmaxs[3];
5717         // walk the tree until we hit a leaf, recursing for any split cases
5718         while (node->plane)
5719         {
5720                 // abort if this part of the bsp tree can not be hit by this trace
5721 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5722 //                      return;
5723                 plane = node->plane;
5724                 // axial planes are much more common than non-axial, so an optimized
5725                 // axial case pays off here
5726                 if (plane->type < 3)
5727                 {
5728                         // this is an axial plane, compare bounding box directly to it and
5729                         // recurse sides accordingly
5730                         // recurse down node sides
5731                         // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5732                         //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5733                         //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5734                         sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5735                 }
5736                 else
5737                 {
5738                         // this is a non-axial plane, so check if the start and end boxes
5739                         // are both on one side of the plane to handle 'diagonal' cases
5740                         sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5741                 }
5742                 if (sides == 3)
5743                 {
5744                         // segment crosses plane
5745                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5746                         sides = 2;
5747                 }
5748                 // if sides == 0 then the trace itself is bogus (Not A Number values),
5749                 // in this case we simply pretend the trace hit nothing
5750                 if (sides == 0)
5751                         return; // ERROR: NAN bounding box!
5752                 // take whichever side the segment box is on
5753                 node = node->children[sides - 1];
5754         }
5755         // abort if this part of the bsp tree can not be hit by this trace
5756 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5757 //              return;
5758         nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5759         nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5760         nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5761         nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5762         nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5763         nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5764         // hit a leaf
5765         leaf = (mleaf_t *)node;
5766         for (i = 0;i < leaf->numleafbrushes;i++)
5767         {
5768                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5769                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5770                 {
5771                         brush->markframe = markframe;
5772                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5773                 }
5774         }
5775         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5776         {
5777                 for (i = 0;i < leaf->numleafsurfaces;i++)
5778                 {
5779                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5780                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5781                         {
5782                                 surface->collisionmarkframe = markframe;
5783                                 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);
5784                         }
5785                 }
5786         }
5787 }
5788
5789 static int markframe = 0;
5790
5791 static void Mod_Q3BSP_TracePoint(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
5792 {
5793         int i;
5794         q3mbrush_t *brush;
5795         memset(trace, 0, sizeof(*trace));
5796         trace->fraction = 1;
5797         trace->realfraction = 1;
5798         trace->hitsupercontentsmask = hitsupercontentsmask;
5799         if (model->brush.submodel)
5800         {
5801                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5802                         if (brush->colbrushf)
5803                                 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5804         }
5805         else
5806                 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5807 }
5808
5809 static void Mod_Q3BSP_TraceLine(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
5810 {
5811         int i;
5812         float segmentmins[3], segmentmaxs[3];
5813         msurface_t *surface;
5814         q3mbrush_t *brush;
5815
5816         if (VectorCompare(start, end))
5817         {
5818                 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
5819                 return;
5820         }
5821
5822         memset(trace, 0, sizeof(*trace));
5823         trace->fraction = 1;
5824         trace->realfraction = 1;
5825         trace->hitsupercontentsmask = hitsupercontentsmask;
5826         segmentmins[0] = min(start[0], end[0]) - 1;
5827         segmentmins[1] = min(start[1], end[1]) - 1;
5828         segmentmins[2] = min(start[2], end[2]) - 1;
5829         segmentmaxs[0] = max(start[0], end[0]) + 1;
5830         segmentmaxs[1] = max(start[1], end[1]) + 1;
5831         segmentmaxs[2] = max(start[2], end[2]) + 1;
5832         if (model->brush.submodel)
5833         {
5834                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5835                         if (brush->colbrushf)
5836                                 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5837                 if (mod_q3bsp_curves_collisions.integer)
5838                         for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5839                                 if (surface->num_collisiontriangles)
5840                                         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);
5841         }
5842         else
5843                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5844 }
5845
5846 static void Mod_Q3BSP_TraceBox(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
5847 {
5848         int i;
5849         float segmentmins[3], segmentmaxs[3];
5850         msurface_t *surface;
5851         q3mbrush_t *brush;
5852         colboxbrushf_t thisbrush_start, thisbrush_end;
5853         vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5854
5855         if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
5856         {
5857                 vec3_t shiftstart, shiftend;
5858                 VectorAdd(start, boxmins, shiftstart);
5859                 VectorAdd(end, boxmins, shiftend);
5860                 if (VectorCompare(start, end))
5861                         Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, shiftstart, hitsupercontentsmask);
5862                 else
5863                 {
5864                         Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, shiftstart, shiftend, hitsupercontentsmask);
5865                         VectorSubtract(trace->endpos, boxmins, trace->endpos);
5866                 }
5867                 return;
5868         }
5869
5870         // box trace, performed as brush trace
5871         memset(trace, 0, sizeof(*trace));
5872         trace->fraction = 1;
5873         trace->realfraction = 1;
5874         trace->hitsupercontentsmask = hitsupercontentsmask;
5875         segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5876         segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5877         segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5878         segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5879         segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5880         segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5881         VectorAdd(start, boxmins, boxstartmins);
5882         VectorAdd(start, boxmaxs, boxstartmaxs);
5883         VectorAdd(end, boxmins, boxendmins);
5884         VectorAdd(end, boxmaxs, boxendmaxs);
5885         Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
5886         Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
5887         if (model->brush.submodel)
5888         {
5889                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5890                         if (brush->colbrushf)
5891                                 Collision_TraceBrushBrushFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, brush->colbrushf, brush->colbrushf);
5892                 if (mod_q3bsp_curves_collisions.integer)
5893                         for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5894                                 if (surface->num_collisiontriangles)
5895                                         Collision_TraceBrushTriangleMeshFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, 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);
5896         }
5897         else
5898                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, &thisbrush_start.brush, &thisbrush_end.brush, ++markframe, segmentmins, segmentmaxs);
5899 }
5900
5901 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5902 {
5903         int i;
5904         int supercontents = 0;
5905         q3mbrush_t *brush;
5906         // test if the point is inside each brush
5907         if (model->brush.submodel)
5908         {
5909                 // submodels are effectively one leaf
5910                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5911                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5912                                 supercontents |= brush->colbrushf->supercontents;
5913         }
5914         else
5915         {
5916                 mnode_t *node = model->brush.data_nodes;
5917                 mleaf_t *leaf;
5918                 // find which leaf the point is in
5919                 while (node->plane)
5920                         node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5921                 leaf = (mleaf_t *)node;
5922                 // now check the brushes in the leaf
5923                 for (i = 0;i < leaf->numleafbrushes;i++)
5924                 {
5925                         brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5926                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5927                                 supercontents |= brush->colbrushf->supercontents;
5928                 }
5929         }
5930         return supercontents;
5931 }
5932
5933 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
5934 {
5935         int supercontents = 0;
5936         if (nativecontents & CONTENTSQ3_SOLID)
5937                 supercontents |= SUPERCONTENTS_SOLID;
5938         if (nativecontents & CONTENTSQ3_WATER)
5939                 supercontents |= SUPERCONTENTS_WATER;
5940         if (nativecontents & CONTENTSQ3_SLIME)
5941                 supercontents |= SUPERCONTENTS_SLIME;
5942         if (nativecontents & CONTENTSQ3_LAVA)
5943                 supercontents |= SUPERCONTENTS_LAVA;
5944         if (nativecontents & CONTENTSQ3_BODY)
5945                 supercontents |= SUPERCONTENTS_BODY;
5946         if (nativecontents & CONTENTSQ3_CORPSE)
5947                 supercontents |= SUPERCONTENTS_CORPSE;
5948         if (nativecontents & CONTENTSQ3_NODROP)
5949                 supercontents |= SUPERCONTENTS_NODROP;
5950         if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5951                 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5952         if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5953                 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5954         if (nativecontents & CONTENTSQ3_DONOTENTER)
5955                 supercontents |= SUPERCONTENTS_DONOTENTER;
5956         if (nativecontents & CONTENTSQ3_BOTCLIP)
5957                 supercontents |= SUPERCONTENTS_BOTCLIP;
5958         if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
5959                 supercontents |= SUPERCONTENTS_OPAQUE;
5960         return supercontents;
5961 }
5962
5963 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
5964 {
5965         int nativecontents = 0;
5966         if (supercontents & SUPERCONTENTS_SOLID)
5967                 nativecontents |= CONTENTSQ3_SOLID;
5968         if (supercontents & SUPERCONTENTS_WATER)
5969                 nativecontents |= CONTENTSQ3_WATER;
5970         if (supercontents & SUPERCONTENTS_SLIME)
5971                 nativecontents |= CONTENTSQ3_SLIME;
5972         if (supercontents & SUPERCONTENTS_LAVA)
5973                 nativecontents |= CONTENTSQ3_LAVA;
5974         if (supercontents & SUPERCONTENTS_BODY)
5975                 nativecontents |= CONTENTSQ3_BODY;
5976         if (supercontents & SUPERCONTENTS_CORPSE)
5977                 nativecontents |= CONTENTSQ3_CORPSE;
5978         if (supercontents & SUPERCONTENTS_NODROP)
5979                 nativecontents |= CONTENTSQ3_NODROP;
5980         if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5981                 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5982         if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5983                 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5984         if (supercontents & SUPERCONTENTS_DONOTENTER)
5985                 nativecontents |= CONTENTSQ3_DONOTENTER;
5986         if (supercontents & SUPERCONTENTS_BOTCLIP)
5987                 nativecontents |= CONTENTSQ3_BOTCLIP;
5988         if (!(supercontents & SUPERCONTENTS_OPAQUE))
5989                 nativecontents |= CONTENTSQ3_TRANSLUCENT;
5990         return nativecontents;
5991 }
5992
5993 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5994 {
5995         int numleafs;
5996         while (node->plane)
5997         {
5998                 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5999                 node = node->children[1];
6000         }
6001         numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
6002         if (loadmodel->brush.num_leafs < numleafs)
6003                 loadmodel->brush.num_leafs = numleafs;
6004 }
6005
6006 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6007 {
6008         int i, j, numshadowmeshtriangles, lumps;
6009         q3dheader_t *header;
6010         float corner[3], yawradius, modelradius;
6011         msurface_t *surface;
6012
6013         mod->modeldatatypestring = "Q3BSP";
6014
6015         mod->type = mod_brushq3;
6016         mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
6017         mod->numskins = 1;
6018
6019         header = (q3dheader_t *)buffer;
6020         if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
6021                 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
6022
6023         i = LittleLong(header->version);
6024         if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
6025                 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
6026
6027         mod->soundfromcenter = true;
6028         mod->TraceBox = Mod_Q3BSP_TraceBox;
6029         mod->TraceLine = Mod_Q3BSP_TraceLine;
6030         mod->TracePoint = Mod_Q3BSP_TracePoint;
6031         mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
6032         mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
6033         mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
6034         mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
6035         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
6036         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
6037         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
6038         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
6039         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
6040         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
6041         mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
6042         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
6043         mod->brush.AmbientSoundLevelsForPoint = NULL;
6044         mod->brush.RoundUpToHullSize = NULL;
6045         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
6046         mod->Draw = R_Q1BSP_Draw;
6047         mod->DrawDepth = R_Q1BSP_DrawDepth;
6048         mod->DrawDebug = R_Q1BSP_DrawDebug;
6049         mod->DrawPrepass = R_Q1BSP_DrawPrepass;
6050         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
6051         mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6052         mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6053         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6054         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6055         mod->DrawLight = R_Q1BSP_DrawLight;
6056
6057         mod_base = (unsigned char *)header;
6058
6059         // swap all the lumps
6060         header->ident = LittleLong(header->ident);
6061         header->version = LittleLong(header->version);
6062         lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
6063         for (i = 0;i < lumps;i++)
6064         {
6065                 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
6066                 if((char *) bufferend < (char *) buffer + j)
6067                         Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
6068                 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
6069                 if((char *) bufferend < (char *) buffer + j)
6070                         Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
6071         }
6072         /*
6073          * NO, do NOT clear them!
6074          * they contain actual data referenced by other stuff.
6075          * Instead, before using the advertisements lump, check header->versio
6076          * again!
6077          * Sorry, but otherwise it breaks memory of the first lump.
6078         for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
6079         {
6080                 header->lumps[i].fileofs = 0;
6081                 header->lumps[i].filelen = 0;
6082         }
6083         */
6084
6085         mod->brush.qw_md4sum = 0;
6086         mod->brush.qw_md4sum2 = 0;
6087         for (i = 0;i < lumps;i++)
6088         {
6089                 if (i == Q3LUMP_ENTITIES)
6090                         continue;
6091                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6092                 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
6093                         continue;
6094                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6095
6096                 // all this checksumming can take a while, so let's send keepalives here too
6097                 CL_KeepaliveMessage(false);
6098         }
6099
6100         Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
6101         Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
6102         Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
6103         if (header->version == Q3BSPVERSION_IG)
6104                 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
6105         else
6106                 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
6107         Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
6108         Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
6109         Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
6110         Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
6111         Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
6112         Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
6113         Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
6114         Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
6115         Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
6116         Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
6117         Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
6118         Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
6119         Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
6120         loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
6121
6122         // the MakePortals code works fine on the q3bsp data as well
6123         Mod_Q1BSP_MakePortals();
6124
6125         // FIXME: shader alpha should replace r_wateralpha support in q3bsp
6126         loadmodel->brush.supportwateralpha = true;
6127
6128         // make a single combined shadow mesh to allow optimized shadow volume creation
6129         numshadowmeshtriangles = 0;
6130         if (cls.state != ca_dedicated)
6131         {
6132                 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6133                 {
6134                         surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
6135                         numshadowmeshtriangles += surface->num_triangles;
6136                 }
6137                 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
6138                 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6139                         if (surface->num_triangles > 0)
6140                                 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));
6141                 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
6142                 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
6143         }
6144
6145         loadmodel->brush.num_leafs = 0;
6146         Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
6147
6148         if (loadmodel->brush.numsubmodels)
6149                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
6150
6151         mod = loadmodel;
6152         for (i = 0;i < loadmodel->brush.numsubmodels;i++)
6153         {
6154                 if (i > 0)
6155                 {
6156                         char name[10];
6157                         // duplicate the basic information
6158                         dpsnprintf(name, sizeof(name), "*%i", i);
6159                         mod = Mod_FindName(name, loadmodel->name);
6160                         // copy the base model to this one
6161                         *mod = *loadmodel;
6162                         // rename the clone back to its proper name
6163                         strlcpy(mod->name, name, sizeof(mod->name));
6164                         mod->brush.parentmodel = loadmodel;
6165                         // textures and memory belong to the main model
6166                         mod->texturepool = NULL;
6167                         mod->mempool = NULL;
6168                         mod->brush.GetPVS = NULL;
6169                         mod->brush.FatPVS = NULL;
6170                         mod->brush.BoxTouchingPVS = NULL;
6171                         mod->brush.BoxTouchingLeafPVS = NULL;
6172                         mod->brush.BoxTouchingVisibleLeafs = NULL;
6173                         mod->brush.FindBoxClusters = NULL;
6174                         mod->brush.LightPoint = NULL;
6175                         mod->brush.AmbientSoundLevelsForPoint = NULL;
6176                 }
6177                 mod->brush.submodel = i;
6178                 if (loadmodel->brush.submodels)
6179                         loadmodel->brush.submodels[i] = mod;
6180
6181                 // make the model surface list (used by shadowing/lighting)
6182                 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
6183                 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
6184                 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
6185                 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
6186                 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
6187                 Mod_MakeSortedSurfaces(mod);
6188
6189                 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
6190                 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
6191                 // enlarge the bounding box to enclose all geometry of this model,
6192                 // because q3map2 sometimes lies (mostly to affect the lightgrid),
6193                 // which can in turn mess up the farclip (as well as culling when
6194                 // outside the level - an unimportant concern)
6195
6196                 //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]);
6197                 for (j = 0;j < mod->nummodelsurfaces;j++)
6198                 {
6199                         const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
6200                         const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
6201                         int k;
6202                         if (!surface->num_vertices)
6203                                 continue;
6204                         for (k = 0;k < surface->num_vertices;k++, v += 3)
6205                         {
6206                                 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
6207                                 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
6208                                 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
6209                                 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
6210                                 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
6211                                 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
6212                         }
6213                 }
6214                 //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]);
6215                 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
6216                 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
6217                 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
6218                 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
6219                 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
6220                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
6221                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
6222                 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
6223                 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
6224                 mod->yawmins[2] = mod->normalmins[2];
6225                 mod->yawmaxs[2] = mod->normalmaxs[2];
6226                 mod->radius = modelradius;
6227                 mod->radius2 = modelradius * modelradius;
6228
6229                 // this gets altered below if sky or water is used
6230                 mod->DrawSky = NULL;
6231                 mod->DrawAddWaterPlanes = NULL;
6232
6233                 for (j = 0;j < mod->nummodelsurfaces;j++)
6234                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
6235                                 break;
6236                 if (j < mod->nummodelsurfaces)
6237                         mod->DrawSky = R_Q1BSP_DrawSky;
6238
6239                 for (j = 0;j < mod->nummodelsurfaces;j++)
6240                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
6241                                 break;
6242                 if (j < mod->nummodelsurfaces)
6243                         mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
6244         }
6245 }
6246
6247 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6248 {
6249         int i = LittleLong(((int *)buffer)[1]);
6250         if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
6251                 Mod_Q3BSP_Load(mod,buffer, bufferend);
6252         else if (i == Q2BSPVERSION)
6253                 Mod_Q2BSP_Load(mod,buffer, bufferend);
6254         else
6255                 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
6256 }
6257
6258 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6259 {
6260         Host_Error("Mod_MAP_Load: not yet implemented");
6261 }
6262
6263 #ifdef OBJWORKS
6264 typedef struct objvertex_s
6265 {
6266         float v[3];
6267         float vt[2];
6268         float vn[3];
6269 }
6270 objvertex_t;
6271
6272 typedef struct objtriangle_s
6273 {
6274         objvertex_t vertex[3];
6275         int textureindex;
6276         // these fields are used only in conversion to surfaces
6277         int axis;
6278         int surfaceindex;
6279         int surfacevertexindex[3];
6280         float edgeplane[3][4];
6281 }
6282 objtriangle_t;
6283
6284 typedef objnode_s
6285 {
6286         struct objnode_s *children[2];
6287         struct objnode_s *parent;
6288         objtriangle_t *triangles;
6289         float normal[3];
6290         float dist;
6291         float mins[3];
6292         float maxs[3];
6293         int numtriangles;
6294 }
6295 objnode_t;
6296
6297 objnode_t *Mod_OBJ_BSPNodeForTriangles(objnode_t *parent, objtriangle_t *triangles, int numtriangles, const float *mins, const float *maxs, mem_expandablearray_t *nodesarray, int maxclippedtriangles, objtriangle_t *clippedfronttriangles, objtriangle_t *clippedbacktriangles)
6298 {
6299         int i, j;
6300         float normal[3];
6301         float dist;
6302         int score;
6303         float bestnormal[3];
6304         float bestdist;
6305         int bestscore;
6306         float mins[3];
6307         float maxs[3];
6308         int numfronttriangles;
6309         int numbacktriangles;
6310         int count_front;
6311         int count_back;
6312         int count_both;
6313         int count_on;
6314         float outfrontpoints[5][3];
6315         float outbackpoints[5][3];
6316         int neededfrontpoints;
6317         int neededbackpoints;
6318         int countonpoints;
6319         objnode_t *node;
6320
6321         node = (objnode_t *)Mem_ExpandableArray_AllocRecord(array);
6322         node->parent = parent;
6323         if (numtriangles)
6324         {
6325                 VectorCopy(triangles[0].vertex[0].v, mins);
6326                 VectorCopy(triangles[0].vertex[0].v, maxs);
6327         }
6328         else if (parent && parent->children[0] == node)
6329         {
6330                 VectorCopy(parent->mins, mins);
6331                 Vectorcopy(parent->maxs, maxs);
6332         }
6333         else if (parent && parent->children[1] == node)
6334         {
6335                 VectorCopy(parent->mins, mins);
6336                 Vectorcopy(parent->maxs, maxs);
6337         }
6338         else
6339         {
6340                 VectorClear(mins);
6341                 VectorClear(maxs);
6342         }
6343         for (i = 0;i < numtriangles;i++)
6344         {
6345                 for (j = 0;j < 3;j++)
6346                 {
6347                         mins[0] = min(mins[0], triangles[i].vertex[j].v[0]);
6348                         mins[1] = min(mins[1], triangles[i].vertex[j].v[1]);
6349                         mins[2] = min(mins[2], triangles[i].vertex[j].v[2]);
6350                         maxs[0] = max(maxs[0], triangles[i].vertex[j].v[0]);
6351                         maxs[1] = max(maxs[1], triangles[i].vertex[j].v[1]);
6352                         maxs[2] = max(maxs[2], triangles[i].vertex[j].v[2]);
6353                 }
6354         }
6355         VectorCopy(mins, node->mins);
6356         VectorCopy(maxs, node->maxs);
6357         if (numtriangles <= mod_obj_leaftriangles.integer)
6358         {
6359                 // create a leaf
6360                 loadmodel->brush.num_leafs++;
6361                 node->triangles = triangles;
6362                 node->numtriangles = numtriangles;
6363                 return node;
6364         }
6365
6366         // create a node
6367         loadmodel->brush.num_nodes++;
6368         // pick a splitting plane from the various choices available to us...
6369         // early splits simply halve the interval
6370         bestscore = 0;
6371         VectorClear(bestnormal);
6372         bestdist = 0;
6373         if (numtriangles <= mod_obj_splitterlimit.integer)
6374                 limit = numtriangles;
6375         else
6376                 limit = 0;
6377         for (i = -3;i < limit;i++)
6378         {
6379                 if (i < 0)
6380                 {
6381                         // first we try 3 axial splits (kdtree-like)
6382                         j = i + 3;
6383                         VectorClear(normal);
6384                         normal[j] = 1;
6385                         dist = (mins[j] + maxs[j]) * 0.5f;
6386                 }
6387                 else
6388                 {
6389                         // then we try each triangle plane
6390                         TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
6391                         VectorNormalize(normal);
6392                         dist = DotProduct(normal, triangles[i].vertex[0].v);
6393                         // use positive axial values whenever possible
6394                         if (normal[0] == -1)
6395                                 normal[0] = 1;
6396                         if (normal[1] == -1)
6397                                 normal[1] = 1;
6398                         if (normal[2] == -1)
6399                                 normal[2] = 1;
6400                         // skip planes that match the current best
6401                         if (VectorCompare(normal, bestnormal) && dist == bestdist)
6402                                 continue;
6403                 }
6404                 count_on = 0;
6405                 count_front = 0;
6406                 count_back = 0;
6407                 count_both = 0;
6408                 for (j = 0;j < numtriangles;j++)
6409                 {
6410                         dists[0] = DotProduct(normal, triangles[j].vertex[0].v) - dist;
6411                         dists[1] = DotProduct(normal, triangles[j].vertex[1].v) - dist;
6412                         dists[2] = DotProduct(normal, triangles[j].vertex[2].v) - dist;
6413                         if (dists[0] < -DIST_EPSILON || dists[1] < -DIST_EPSILON || dists[2] < -DIST_EPSILON)
6414                         {
6415                                 if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
6416                                         count_both++;
6417                                 else
6418                                         count_back++;
6419                         }
6420                         else if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
6421                                 count_front++;
6422                         else
6423                                 count_on++;
6424                 }
6425                 // score is supposed to:
6426                 // prefer axial splits
6427                 // prefer evenly dividing the input triangles
6428                 // prefer triangles on the plane
6429                 // avoid triangles crossing the plane
6430                 score = count_on*count_on - count_both*count_both + min(count_front, count_back)*(count_front+count_back);
6431                 if (normal[0] == 1 || normal[1] == 1 || normal[2] == 1)
6432                         score *= 2;
6433                 if (i == -3 || bestscore < score)
6434                 {
6435                         VectorCopy(normal, bestnormal);
6436                         bestdist = dist;
6437                         bestscore = score;
6438                 }
6439         }
6440
6441         // now we have chosen an optimal split plane...
6442
6443         // divide triangles by the splitting plane
6444         numfronttriangles = 0;
6445         numbacktriangles = 0;
6446         for (i = 0;i < numtriangles;i++)
6447         {
6448                 neededfrontpoints = 0;
6449                 neededbackpoints = 0;
6450                 countonpoints = 0;
6451                 PolygonF_Divide(3, triangles[i].vertex[0].v, bestnormal[0], bestnormal[1], bestnormal[2], bestdist, DIST_EPSILON, 5, outfrontpoints[0], &neededfrontpoints, 5, outbackpoints[0], &neededbackpoints, &countonpoints);
6452                 if (countonpoints > 1)
6453                 {
6454                         // triangle lies on plane, assign it to one child only
6455                         TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
6456                         if (DotProduct(bestnormal, normal) >= 0)
6457                         {
6458                                 // assign to front side child
6459                                 obj_fronttriangles[numfronttriangles++] = triangles[i];
6460                         }
6461                         else
6462                         {
6463                                 // assign to back side child
6464                                 obj_backtriangles[numbacktriangles++] = triangles[i];
6465                         }
6466                 }
6467                 else
6468                 {
6469                         // convert clipped polygons to triangles
6470                         for (j = 0;j < neededfrontpoints-2;j++)
6471                         {
6472                                 obj_fronttriangles[numfronttriangles] = triangles[i];
6473                                 VectorCopy(outfrontpoints[0], obj_fronttriangles[numfronttriangles].vertex[0].v);
6474                                 VectorCopy(outfrontpoints[j+1], obj_fronttriangles[numfronttriangles].vertex[1].v);
6475                                 VectorCopy(outfrontpoints[j+2], obj_fronttriangles[numfronttriangles].vertex[2].v);
6476                                 numfronttriangles++;
6477                         }
6478                         for (j = 0;j < neededbackpoints-2;j++)
6479                         {
6480                                 obj_backtriangles[numbacktriangles] = triangles[i];
6481                                 VectorCopy(outbackpoints[0], obj_backtriangles[numbacktriangles].vertex[0].v);
6482                                 VectorCopy(outbackpoints[j+1], obj_backtriangles[numbacktriangles].vertex[1].v);
6483                                 VectorCopy(outbackpoints[j+2], obj_backtriangles[numbacktriangles].vertex[2].v);
6484                                 numbacktriangles++;
6485                         }
6486                 }
6487         }
6488
6489         // now copy the triangles out of the big buffer
6490         if (numfronttriangles)
6491         {
6492                 fronttriangles = Mem_Alloc(loadmodel->mempool, fronttriangles * sizeof(*fronttriangles));
6493                 memcpy(fronttriangles, obj_fronttriangles, numfronttriangles * sizeof(*fronttriangles));
6494         }
6495         else
6496                 fronttriangles = NULL;
6497         if (numbacktriangles)
6498         {
6499                 backtriangles = Mem_Alloc(loadmodel->mempool, backtriangles * sizeof(*backtriangles));
6500                 memcpy(backtriangles, obj_backtriangles, numbacktriangles * sizeof(*backtriangles));
6501         }
6502         else
6503                 backtriangles = NULL;
6504
6505         // free the original triangles we were given
6506         if (triangles)
6507                 Mem_Free(triangles);
6508         triangles = NULL;
6509         numtriangles = 0;
6510
6511         // now create the children...
6512         node->children[0] = Mod_OBJ_BSPNodeForTriangles(node, fronttriangles, numfronttriangles, frontmins, frontmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
6513         node->children[1] = Mod_OBJ_BSPNodeForTriangles(node, backtriangles, numbacktriangles, backmins, backmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
6514         return node;
6515 }
6516
6517 void Mod_OBJ_SnapVertex(float *v)
6518 {
6519         int i;
6520         float a = mod_obj_vertexprecision.value;
6521         float b = 1.0f / a;
6522         v[0] -= floor(v[0] * a + 0.5f) * b;
6523         v[1] -= floor(v[1] * a + 0.5f) * b;
6524         v[2] -= floor(v[2] * a + 0.5f) * b;
6525 }
6526
6527 void Mod_OBJ_ConvertBSPNode(objnode_t *objnode, mnode_t *mnodeparent)
6528 {
6529         if (objnode->children[0])
6530         {
6531                 // convert to mnode_t
6532                 mnode_t *mnode = loadmodel->brush.data_nodes + loadmodel->brush.num_nodes++;
6533                 mnode->parent = mnodeparent;
6534                 mnode->plane = loadmodel->brush.data_planes + loadmodel->brush.num_planes++;
6535                 VectorCopy(objnode->normal, mnode->plane->normal);
6536                 mnode->plane->dist = objnode->dist;
6537                 PlaneClassify(mnode->plane);
6538                 VectorCopy(objnode->mins, mnode->mins);
6539                 VectorCopy(objnode->maxs, mnode->maxs);
6540                 // push combinedsupercontents up to the parent
6541                 if (mnodeparent)
6542                         mnodeparent->combinedsupercontents |= mnode->combinedsupercontents;
6543                 mnode->children[0] = Mod_OBJ_ConvertBSPNode(objnode->children[0], mnode);
6544                 mnode->children[1] = Mod_OBJ_ConvertBSPNode(objnode->children[1], mnode);
6545         }
6546         else
6547         {
6548                 // convert to mleaf_t
6549                 mleaf_t *mleaf = loadmodel->brush.data_leafs + loadmodel->brush.num_leafs++;
6550                 mleaf->parent = mnodeparent;
6551                 VectorCopy(objnode->mins, mleaf->mins);
6552                 VectorCopy(objnode->maxs, mleaf->maxs);
6553                 mleaf->clusterindex = loadmodel->brush.num_leafs - 1;
6554                 if (objnode->numtriangles)
6555                 {
6556                         objtriangle_t *triangles = objnode->triangles;
6557                         int numtriangles = objnode->numtriangles;
6558                         texture_t *texture;
6559                         float edge[3][3];
6560                         float normal[3];
6561                         objvertex_t vertex[3];
6562                         numsurfaces = 0;
6563                         maxsurfaces = numtriangles;
6564                         surfaces = NULL;
6565                         // calculate some more data on each triangle for surface gathering
6566                         for (i = 0;i < numtriangles;i++)
6567                         {
6568                                 triangle = triangles + i;
6569                                 texture = loadmodel->data_textures + triangle->textureindex;
6570                                 Mod_OBJ_SnapVertex(triangle->vertex[0].v);
6571                                 Mod_OBJ_SnapVertex(triangle->vertex[1].v);
6572                                 Mod_OBJ_SnapVertex(triangle->vertex[2].v);
6573                                 TriangleNormal(triangle->vertex[0].v, triangle->vertex[1].v, triangle->vertex[2].v, normal);
6574                                 axis = 0;
6575                                 if (fabs(normal[axis]) < fabs(normal[1]))
6576                                         axis = 1;
6577                                 if (fabs(normal[axis]) < fabs(normal[2]))
6578                                         axis = 2;
6579                                 VectorClear(normal);
6580                                 normal[axis] = 1;
6581                                 triangle->axis = axis;
6582                                 VectorSubtract(triangle->vertex[1].v, triangle->vertex[0].v, edge[0]);
6583                                 VectorSubtract(triangle->vertex[2].v, triangle->vertex[1].v, edge[1]);
6584                                 VectorSubtract(triangle->vertex[0].v, triangle->vertex[2].v, edge[2]);
6585                                 CrossProduct(edge[0], normal, triangle->edgeplane[0]);
6586                                 CrossProduct(edge[1], normal, triangle->edgeplane[1]);
6587                                 CrossProduct(edge[2], normal, triangle->edgeplane[2]);
6588                                 VectorNormalize(triangle->edgeplane[0]);
6589                                 VectorNormalize(triangle->edgeplane[1]);
6590                                 VectorNormalize(triangle->edgeplane[2]);
6591                                 triangle->edgeplane[0][3] = DotProduct(triangle->edgeplane[0], triangle->vertex[0].v);
6592                                 triangle->edgeplane[1][3] = DotProduct(triangle->edgeplane[1], triangle->vertex[1].v);
6593                                 triangle->edgeplane[2][3] = DotProduct(triangle->edgeplane[2], triangle->vertex[2].v);
6594                                 triangle->surfaceindex = 0;
6595                                 // add to the combined supercontents while we're here...
6596                                 mleaf->combinedsupercontents |= texture->supercontents;
6597                         }
6598                         surfaceindex = 1;
6599                         for (i = 0;i < numtriangles;i++)
6600                         {
6601                                 // skip already-assigned triangles
6602                                 if (triangles[i].surfaceindex)
6603                                         continue;
6604                                 texture = loadmodel->data_textures + triangles[i].textureindex;
6605                                 // assign a new surface to this triangle
6606                                 triangles[i].surfaceindex = surfaceindex++;
6607                                 axis = triangles[i].axis;
6608                                 numvertices = 3;
6609                                 // find the triangle's neighbors, this can take multiple passes
6610                                 retry = true;
6611                                 while (retry)
6612                                 {
6613                                         retry = false;
6614                                         for (j = i+1;j < numtriangles;j++)
6615                                         {
6616                                                 if (triangles[j].surfaceindex || triangles[j].axis != axis || triangles[j].texture != texture)
6617                                                         continue;
6618                                                 triangle = triangles + j;
6619                                                 for (k = i;k < j;k++)
6620                                                 {
6621                                                         if (triangles[k].surfaceindex != surfaceindex)
6622                                                                 continue;
6623                                                         if (VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[0].v)
6624                                                          || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[1].v)
6625                                                          || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[2].v)
6626                                                          || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[0].v)
6627                                                          || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[1].v)
6628                                                          || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[2].v)
6629                                                          || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[0].v)
6630                                                          || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[1].v)
6631                                                          || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[2].v))
6632                                                         {
6633                                                                 // shares a vertex position
6634                                                                 --- FIXME ---
6635                                                         }
6636                                                 }
6637                                                 for (k = 0;k < numvertices;k++)
6638                                                         if (!VectorCompare(vertex[k].v, triangles[j].vertex[0].v) || !VectorCompare(vertex[k].v, triangles[j].vertex[1].v) || !VectorCompare(vertex[k].v, triangles[j].vertex[2].v))
6639                                                                 break;
6640                                                 if (k == numvertices)
6641                                                         break; // not a neighbor
6642                                                 // this triangle is a neighbor and has the same axis and texture
6643                                                 // check now if it overlaps in lightmap projection space
6644                                                 triangles[j].surfaceindex;
6645                                                 if (triangles[j].
6646                                         }
6647                                 }
6648                                 //triangles[i].surfaceindex = surfaceindex++;
6649                                 for (surfaceindex = 0;surfaceindex < numsurfaces;surfaceindex++)
6650                                 {
6651                                         if (surfaces[surfaceindex].texture != texture)
6652                                                 continue;
6653                                         // check if any triangles already in this surface overlap in lightmap projection space
6654
6655                                         {
6656                                         }
6657                                         break;
6658                                 }
6659                         }
6660                         // let the collision code simply use the surfaces
6661                         mleaf->containscollisionsurfaces = mleaf->combinedsupercontents != 0;
6662                         mleaf->numleafsurfaces = ?;
6663                         mleaf->firstleafsurface = ?;
6664                 }
6665                 // push combinedsupercontents up to the parent
6666                 if (mnodeparent)
6667                         mnodeparent->combinedsupercontents |= mleaf->combinedsupercontents;
6668         }
6669 }
6670 #endif
6671
6672 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
6673 {
6674 #ifdef OBJWORKS
6675         const char *textbase = (char *)buffer, *text = textbase;
6676         char *s;
6677         char *argv[512];
6678         char line[1024];
6679         char materialname[MAX_QPATH];
6680         int j, index1, index2, index3, first, prev, index;
6681         int argc;
6682         int linelen;
6683         int numtriangles = 0;
6684         int maxtriangles = 131072;
6685         objtriangle_t *triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
6686         int linenumber = 0;
6687         int maxtextures = 256, numtextures = 0, textureindex = 0;
6688         int maxv = 1024, numv = 0;
6689         int maxvt = 1024, numvt = 0;
6690         int maxvn = 1024, numvn = 0;
6691         char **texturenames;
6692         float *v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
6693         float *vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
6694         float *vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
6695         objvertex_t vfirst, vprev, vcurrent;
6696         float mins[3];
6697         float maxs[3];
6698 #if 0
6699         int hashindex;
6700         int maxverthash = 65536, numverthash = 0;
6701         int numhashindex = 65536;
6702         struct objverthash_s
6703         {
6704                 struct objverthash_s *next;
6705                 int s;
6706                 int v;
6707                 int vt;
6708                 int vn;
6709         }
6710         *hash, **verthash = Mem_Alloc(tempmempool, numhashindex * sizeof(*verthash)), *verthashdata = Mem_Alloc(tempmempool, maxverthash * sizeof(*verthashdata)), *oldverthashdata;
6711 #endif
6712
6713         dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
6714
6715         loadmodel->modeldatatypestring = "OBJ";
6716
6717         loadmodel->type = mod_obj;
6718         loadmodel->soundfromcenter = true;
6719         loadmodel->TraceBox = Mod_OBJ_TraceBox;
6720         loadmodel->TraceLine = Mod_OBJ_TraceLine;
6721         loadmodel->TracePoint = Mod_OBJ_TracePoint;
6722         loadmodel->PointSuperContents = Mod_OBJ_PointSuperContents;
6723         loadmodel->brush.TraceLineOfSight = Mod_OBJ_TraceLineOfSight;
6724         loadmodel->brush.SuperContentsFromNativeContents = Mod_OBJ_SuperContentsFromNativeContents;
6725         loadmodel->brush.NativeContentsFromSuperContents = Mod_OBJ_NativeContentsFromSuperContents;
6726         loadmodel->brush.GetPVS = Mod_OBJ_GetPVS;
6727         loadmodel->brush.FatPVS = Mod_OBJ_FatPVS;
6728         loadmodel->brush.BoxTouchingPVS = Mod_OBJ_BoxTouchingPVS;
6729         loadmodel->brush.BoxTouchingLeafPVS = Mod_OBJ_BoxTouchingLeafPVS;
6730         loadmodel->brush.BoxTouchingVisibleLeafs = Mod_OBJ_BoxTouchingVisibleLeafs;
6731         loadmodel->brush.FindBoxClusters = Mod_OBJ_FindBoxClusters;
6732         loadmodel->brush.LightPoint = Mod_OBJ_LightPoint;
6733         loadmodel->brush.FindNonSolidLocation = Mod_OBJ_FindNonSolidLocation;
6734         loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
6735         loadmodel->brush.RoundUpToHullSize = NULL;
6736         loadmodel->brush.PointInLeaf = Mod_OBJ_PointInLeaf;
6737         loadmodel->Draw = R_Q1BSP_Draw;
6738         loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
6739         loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
6740         loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
6741         loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
6742         loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6743         loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6744         loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6745         loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6746         loadmodel->DrawLight = R_Q1BSP_DrawLight;
6747
6748         VectorClear(mins);
6749         VectorClear(maxs);
6750
6751         // parse the OBJ text now
6752         for(;;)
6753         {
6754                 if (!*text)
6755                         break;
6756                 linenumber++;
6757                 linelen = 0;
6758                 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
6759                         line[linelen] = text[linelen];
6760                 line[linelen] = 0;
6761                 for (argc = 0;argc < (int)(sizeof(argv)/sizeof(argv[0]));argc++)
6762                         argv[argc] = "";
6763                 argc = 0;
6764                 s = line;
6765                 while (*s == ' ' || *s == '\t')
6766                         s++;
6767                 while (*s)
6768                 {
6769                         argv[argc++] = s;
6770                         while (*s > ' ')
6771                                 s++;
6772                         if (!*s)
6773                                 break;
6774                         *s++ = 0;
6775                         while (*s == ' ' || *s == '\t')
6776                                 s++;
6777                 }
6778                 if (!argc)
6779                         continue;
6780                 if (argv[0][0] == '#')
6781                         continue;
6782                 if (!strcmp(argv[0], "v"))
6783                 {
6784                         if (maxv <= numv)
6785                         {
6786                                 float *oldv = v;
6787                                 maxv *= 2;
6788                                 v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
6789                                 if (oldv)
6790                                 {
6791                                         memcpy(v, oldv, numv * sizeof(float[3]));
6792                                         Mem_Free(oldv);
6793                                 }
6794                         }
6795                         v[numv*3+0] = atof(argv[1]);
6796                         v[numv*3+1] = atof(argv[2]);
6797                         v[numv*3+2] = atof(argv[3]);
6798                         numv++;
6799                 }
6800                 else if (!strcmp(argv[0], "vt"))
6801                 {
6802                         if (maxvt <= numvt)
6803                         {
6804                                 float *oldvt = vt;
6805                                 maxvt *= 2;
6806                                 vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
6807                                 if (oldvt)
6808                                 {
6809                                         memcpy(vt, oldvt, numvt * sizeof(float[2]));
6810                                         Mem_Free(oldvt);
6811                                 }
6812                         }
6813                         vt[numvt*2+0] = atof(argv[1]);
6814                         vt[numvt*2+1] = atof(argv[2]);
6815                         numvt++;
6816                 }
6817                 else if (!strcmp(argv[0], "vn"))
6818                 {
6819                         if (maxvn <= numvn)
6820                         {
6821                                 float *oldvn = vn;
6822                                 maxvn *= 2;
6823                                 vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
6824                                 if (oldvn)
6825                                 {
6826                                         memcpy(vn, oldvn, numvn * sizeof(float[3]));
6827                                         Mem_Free(oldvn);
6828                                 }
6829                         }
6830                         vn[numvn*3+0] = atof(argv[1]);
6831                         vn[numvn*3+1] = atof(argv[2]);
6832                         vn[numvn*3+2] = atof(argv[3]);
6833                         numvn++;
6834                 }
6835                 else if (!strcmp(argv[0], "f"))
6836                 {
6837                         for (j = 1;j < argc;j++)
6838                         {
6839                                 index1 = atoi(argv[j]);
6840                                 while(argv[j][0] && argv[j][0] != '/')
6841                                         argv[j]++;
6842                                 if (argv[j][0])
6843                                         argv[j]++;
6844                                 index2 = atoi(argv[j]);
6845                                 while(argv[j][0] && argv[j][0] != '/')
6846                                         argv[j]++;
6847                                 if (argv[j][0])
6848                                         argv[j]++;
6849                                 index3 = atoi(argv[j]);
6850                                 // negative refers to a recent vertex
6851                                 // zero means not specified
6852                                 // positive means an absolute vertex index
6853                                 if (index1 < 0)
6854                                         index1 = numv - index1;
6855                                 if (index2 < 0)
6856                                         index2 = numvt - index2;
6857                                 if (index3 < 0)
6858                                         index3 = numvn - index3;
6859                                 VectorCopy(v + 3*index1, vcurrent.v);
6860                                 Vector2Copy(vt + 2*index2, vcurrent.vt);
6861                                 VectorCopy(vn + 3*index3, vcurrent.vn);
6862                                 if (numtriangles == 0)
6863                                 {
6864                                         VectorCopy(vcurrent.v, mins);
6865                                         VectorCopy(vcurrent.v, maxs);
6866                                 }
6867                                 else
6868                                 {
6869                                         mins[0] = min(mins[0], vcurrent.v[0]);
6870                                         mins[1] = min(mins[1], vcurrent.v[1]);
6871                                         mins[2] = min(mins[2], vcurrent.v[2]);
6872                                         maxs[0] = max(maxs[0], vcurrent.v[0]);
6873                                         maxs[1] = max(maxs[1], vcurrent.v[1]);
6874                                         maxs[2] = max(maxs[2], vcurrent.v[2]);
6875                                 }
6876                                 if (j == 1)
6877                                         vfirst = vcurrent;
6878                                 else if (j >= 3)
6879                                 {
6880                                         if (maxtriangles <= numtriangles)
6881                                         {
6882                                                 objtriangle_t *oldtriangles = triangles;
6883                                                 maxtriangles *= 2;
6884                                                 triangles = Mem_Alloc(tempmempool, numtriangles * sizeof(*triangles));
6885                                                 if (oldtriangles)
6886                                                 {
6887                                                         memcpy(triangles, oldtriangles, numtriangles * sizeof(*triangles));
6888                                                         Mem_Free(oldtriangles);
6889                                                 }
6890                                         }
6891                                         triangles[numtriangles].textureindex = textureindex;
6892                                         triangles[numtriangles].vertex[0] = vfirst;
6893                                         triangles[numtriangles].vertex[1] = vprev;
6894                                         triangles[numtriangles].vertex[2] = vcurrent;
6895                                         numtriangles++;
6896                                 }
6897                                 vprev = vcurrent;
6898                                 prev = index;
6899                         }
6900                 }
6901                 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
6902                         ;
6903                 else if (!!strcmp(argv[0], "usemtl"))
6904                 {
6905                         for (i = 0;i < numtextures;i++)
6906                                 if (!strcmp(texturenames[numtextures], argv[1]))
6907                                         break;
6908                         if (i < numtextures)
6909                                 texture = textures + i;
6910                         else
6911                         {
6912                                 if (maxtextures <= numtextures)
6913                                 {
6914                                         texture_t *oldtextures = textures;
6915                                         maxtextures *= 2;
6916                                         textures = Mem_Alloc(tempmempool, maxtextures * sizeof(*textures));
6917                                         if (oldtextures)
6918                                         {
6919                                                 memcpy(textures, oldtextures, numtexutres * sizeof(*textures));
6920                                                 Mem_Free(oldtextures);
6921                                         }
6922                                 }
6923                                 textureindex = numtextures++;
6924                                 texturenames[textureindex] = Mem_Alloc(tempmempool, strlen(argv[1]) + 1);
6925                                 memcpy(texturenames[textureindex], argv[1], strlen(argv[1]) + 1);
6926                         }
6927                 }
6928                 text += linelen;
6929                 if (*text == '\r')
6930                         text++;
6931                 if (*text == '\n')
6932                         text++;
6933         }
6934
6935         // now that we have the OBJ data loaded as-is, we can convert it
6936
6937         // load the textures
6938         loadmodel->num_textures = numtextures;
6939         loadmodel->data_textures = Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
6940         for (i = 0;i < numtextures;i++)
6941                 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, texturenames[i], true, true, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
6942
6943         // free the texturenames array since we are now done with it
6944         for (i = 0;i < numtextures;i++)
6945         {
6946                 Mem_Free(texturenames[i]);
6947                 texturenames[i] = NULL;
6948         }
6949         Mem_Free(texturenames);
6950         texturenames = NULL;
6951
6952         // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
6953         VectorCopy(mins, loadmodel->normalmins);
6954         VectorCopy(maxs, loadmodel->normalmaxs);
6955         dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
6956         modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
6957         modelyawradius = dist*dist+modelyawradius*modelyawradius;
6958         modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
6959         modelradius = modelyawradius + modelradius * modelradius;
6960         modelyawradius = sqrt(modelyawradius);
6961         modelradius = sqrt(modelradius);
6962         loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
6963         loadmodel->yawmins[2] = loadmodel->normalmins[2];
6964         loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] =  modelyawradius;
6965         loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
6966         loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
6967         loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] =  modelradius;
6968         loadmodel->radius = modelradius;
6969         loadmodel->radius2 = modelradius * modelradius;
6970
6971         // make sure the temp triangle buffer is big enough for BSP building
6972         maxclippedtriangles = numtriangles*4;
6973         if (numtriangles > 0)
6974         {
6975                 clippedfronttriangles = Mem_Alloc(loadmodel->mempool, maxclippedtriangles * 2 * sizeof(objtriangle_t));
6976                 clippedbacktriangles = clippedfronttriangles + maxclippedtriangles;
6977         }
6978
6979         // 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
6980         loadmodel->brush.num_leafs = 0;
6981         loadmodel->brush.num_nodes = 0;
6982         Mem_ExpandableArray_NewArray(&nodesarray, loadmodel->mempool, sizeof(objnode_t), 1024);
6983         rootnode = Mod_OBJ_BSPNodeForTriangles(triangles, numtriangles, mins, maxs, &nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
6984
6985         // convert the BSP tree to mnode_t and mleaf_t structures and convert the triangles to msurface_t...
6986         loadmodel->brush.data_leafs = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
6987         loadmodel->brush.data_nodes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mnode_t));
6988         loadmodel->brush.data_planes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mplane_t));
6989         loadmodel->brush.num_leafs = 0;
6990         loadmodel->brush.num_nodes = 0;
6991         loadmodel->brush.num_planes = 0;
6992         Mod_OBJ_ConvertAndFreeBSPNode(rootnode);
6993
6994         if (clippedfronttriangles)
6995                 Mem_Free(clippedfronttriangles);
6996         maxclippedtriangles = 0;
6997         clippedfronttriangles = NULL;
6998         clippedbacktriangles = NULL;
6999
7000 --- NOTHING DONE PAST THIS POINT ---
7001
7002         loadmodel->numskins = LittleLong(pinmodel->num_skins);
7003         numxyz = LittleLong(pinmodel->num_xyz);
7004         numst = LittleLong(pinmodel->num_st);
7005         loadmodel->surfmesh.num_triangles = LittleLong(pinmodel->num_tris);
7006         loadmodel->numframes = LittleLong(pinmodel->num_frames);
7007         loadmodel->surfmesh.num_morphframes = loadmodel->numframes;
7008         loadmodel->num_poses = loadmodel->surfmesh.num_morphframes;
7009         skinwidth = LittleLong(pinmodel->skinwidth);
7010         skinheight = LittleLong(pinmodel->skinheight);
7011         iskinwidth = 1.0f / skinwidth;
7012         iskinheight = 1.0f / skinheight;
7013
7014         loadmodel->num_surfaces = 1;
7015         loadmodel->nummodelsurfaces = loadmodel->num_surfaces;
7016         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]));
7017         loadmodel->data_surfaces = (msurface_t *)data;data += loadmodel->num_surfaces * sizeof(msurface_t);
7018         loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
7019         loadmodel->sortedmodelsurfaces[0] = 0;
7020         loadmodel->animscenes = (animscene_t *)data;data += loadmodel->numframes * sizeof(animscene_t);
7021         loadmodel->surfmesh.data_morphmd2framesize6f = (float *)data;data += loadmodel->numframes * sizeof(float[6]);
7022         loadmodel->surfmesh.data_element3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
7023         loadmodel->surfmesh.data_neighbor3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
7024
7025         loadmodel->synctype = ST_RAND;
7026
7027         // load the skins
7028         inskin = (char *)(base + LittleLong(pinmodel->ofs_skins));
7029         skinfiles = Mod_LoadSkinFiles();
7030         if (skinfiles)
7031         {
7032                 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
7033                 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
7034                 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
7035                 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures, skinfiles, "default", "");
7036                 Mod_FreeSkinFiles(skinfiles);
7037         }
7038         else if (loadmodel->numskins)
7039         {
7040                 // skins found (most likely not a player model)
7041                 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
7042                 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
7043                 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
7044                 for (i = 0;i < loadmodel->numskins;i++, inskin += MD2_SKINNAME)
7045                         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);
7046         }
7047         else
7048         {
7049                 // no skins (most likely a player model)
7050                 loadmodel->numskins = 1;
7051                 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
7052                 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
7053                 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
7054                 Mod_BuildAliasSkinFromSkinFrame(loadmodel->data_textures, NULL);
7055         }
7056
7057         loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
7058         for (i = 0;i < loadmodel->numskins;i++)
7059         {
7060                 loadmodel->skinscenes[i].firstframe = i;
7061                 loadmodel->skinscenes[i].framecount = 1;
7062                 loadmodel->skinscenes[i].loop = true;
7063                 loadmodel->skinscenes[i].framerate = 10;
7064         }
7065
7066         // load the triangles and stvert data
7067         inst = (unsigned short *)(base + LittleLong(pinmodel->ofs_st));
7068         intri = (md2triangle_t *)(base + LittleLong(pinmodel->ofs_tris));
7069         md2verthash = (struct md2verthash_s **)Mem_Alloc(tempmempool, 65536 * sizeof(hash));
7070         md2verthashdata = (struct md2verthash_s *)Mem_Alloc(tempmempool, loadmodel->surfmesh.num_triangles * 3 * sizeof(*hash));
7071         // swap the triangle list
7072         loadmodel->surfmesh.num_vertices = 0;
7073         for (i = 0;i < loadmodel->surfmesh.num_triangles;i++)
7074         {
7075                 for (j = 0;j < 3;j++)
7076                 {
7077                         xyz = (unsigned short) LittleShort (intri[i].index_xyz[j]);
7078                         st = (unsigned short) LittleShort (intri[i].index_st[j]);
7079                         if (xyz >= numxyz)
7080                         {
7081                                 Con_Printf("%s has an invalid xyz index (%i) on triangle %i, resetting to 0\n", loadmodel->name, xyz, i);
7082                                 xyz = 0;
7083                         }
7084                         if (st >= numst)
7085                         {
7086                                 Con_Printf("%s has an invalid st index (%i) on triangle %i, resetting to 0\n", loadmodel->name, st, i);
7087                                 st = 0;
7088                         }
7089                         hashindex = (xyz * 256 + st) & 65535;
7090                         for (hash = md2verthash[hashindex];hash;hash = hash->next)
7091                                 if (hash->xyz == xyz && hash->st == st)
7092                                         break;
7093                         if (hash == NULL)
7094                         {
7095                                 hash = md2verthashdata + loadmodel->surfmesh.num_vertices++;
7096                                 hash->xyz = xyz;
7097                                 hash->st = st;
7098                                 hash->next = md2verthash[hashindex];
7099                                 md2verthash[hashindex] = hash;
7100                         }
7101                         loadmodel->surfmesh.data_element3i[i*3+j] = (hash - md2verthashdata);
7102                 }
7103         }
7104
7105         vertremap = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(int));
7106         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));
7107         loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += loadmodel->surfmesh.num_vertices * sizeof(float[2]);
7108         loadmodel->surfmesh.data_morphmdlvertex = (trivertx_t *)data;data += loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t);
7109         for (i = 0;i < loadmodel->surfmesh.num_vertices;i++)
7110         {
7111                 int sts, stt;
7112                 hash = md2verthashdata + i;
7113                 vertremap[i] = hash->xyz;
7114                 sts = LittleShort(inst[hash->st*2+0]);
7115                 stt = LittleShort(inst[hash->st*2+1]);
7116                 if (sts < 0 || sts >= skinwidth || stt < 0 || stt >= skinheight)
7117                 {
7118                         Con_Printf("%s has an invalid skin coordinate (%i %i) on vert %i, changing to 0 0\n", loadmodel->name, sts, stt, i);
7119                         sts = 0;
7120                         stt = 0;
7121                 }
7122                 loadmodel->surfmesh.data_texcoordtexture2f[i*2+0] = sts * iskinwidth;
7123                 loadmodel->surfmesh.data_texcoordtexture2f[i*2+1] = stt * iskinheight;
7124         }
7125
7126         Mem_Free(md2verthash);
7127         Mem_Free(md2verthashdata);
7128
7129         // generate ushort elements array if possible
7130         if (loadmodel->surfmesh.num_vertices <= 65536)
7131                 loadmodel->surfmesh.data_element3s = (unsigned short *)Mem_Alloc(loadmodel->mempool, sizeof(unsigned short[3]) * loadmodel->surfmesh.num_triangles);
7132
7133         // load the frames
7134         datapointer = (base + LittleLong(pinmodel->ofs_frames));
7135         for (i = 0;i < loadmodel->surfmesh.num_morphframes;i++)
7136         {
7137                 int k;
7138                 trivertx_t *v;
7139                 trivertx_t *out;
7140                 pinframe = (md2frame_t *)datapointer;
7141                 datapointer += sizeof(md2frame_t);
7142                 // store the frame scale/translate into the appropriate array
7143                 for (j = 0;j < 3;j++)
7144                 {
7145                         loadmodel->surfmesh.data_morphmd2framesize6f[i*6+j] = LittleFloat(pinframe->scale[j]);
7146                         loadmodel->surfmesh.data_morphmd2framesize6f[i*6+3+j] = LittleFloat(pinframe->translate[j]);
7147                 }
7148                 // convert the vertices
7149                 v = (trivertx_t *)datapointer;
7150                 out = loadmodel->surfmesh.data_morphmdlvertex + i * loadmodel->surfmesh.num_vertices;
7151                 for (k = 0;k < loadmodel->surfmesh.num_vertices;k++)
7152                         out[k] = v[vertremap[k]];
7153                 datapointer += numxyz * sizeof(trivertx_t);
7154
7155                 strlcpy(loadmodel->animscenes[i].name, pinframe->name, sizeof(loadmodel->animscenes[i].name));
7156                 loadmodel->animscenes[i].firstframe = i;
7157                 loadmodel->animscenes[i].framecount = 1;
7158                 loadmodel->animscenes[i].framerate = 10;
7159                 loadmodel->animscenes[i].loop = true;
7160         }
7161
7162         Mem_Free(vertremap);
7163
7164         Mod_MakeSortedSurfaces(loadmodel);
7165         Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
7166         Mod_Alias_CalculateBoundingBox();
7167         Mod_Alias_MorphMesh_CompileFrames();
7168
7169         surface = loadmodel->data_surfaces;
7170         surface->texture = loadmodel->data_textures;
7171         surface->num_firsttriangle = 0;
7172         surface->num_triangles = loadmodel->surfmesh.num_triangles;
7173         surface->num_firstvertex = 0;
7174         surface->num_vertices = loadmodel->surfmesh.num_vertices;
7175
7176         loadmodel->surfmesh.isanimated = false;
7177
7178         if (loadmodel->surfmesh.data_element3s)
7179                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
7180                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
7181 #endif
7182 }
7183
7184 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
7185 {
7186         // we already have done PVS culling at this point...
7187         // so we don't need to do it again.
7188
7189         int i;
7190         vec3_t testorigin, mins, maxs;
7191
7192         testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
7193         testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
7194         testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
7195
7196         if(model->brush.TraceLineOfSight(model, eye, testorigin))
7197                 return 1;
7198
7199         // expand the box a little
7200         mins[0] = (t+1) * minsX[0] - t * maxsX[0];
7201         maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
7202         mins[1] = (t+1) * minsX[1] - t * maxsX[1];
7203         maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
7204         mins[2] = (t+1) * minsX[2] - t * maxsX[2];
7205         maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
7206
7207         for(i = 0; i != numsamples; ++i)
7208         {
7209                 testorigin[0] = lhrandom(mins[0], maxs[0]);
7210                 testorigin[1] = lhrandom(mins[1], maxs[1]);
7211                 testorigin[2] = lhrandom(mins[2], maxs[2]);
7212
7213                 if(model->brush.TraceLineOfSight(model, eye, testorigin))
7214                         return 1;
7215         }
7216
7217         return 0;
7218 }
7219