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