model_brush.c

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