model_brush.c

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