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