model_brush.c

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