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->deprecatedq3num_bboxstride > 0)
 526                         {
 527                                 int i, cnt, tri;
 528                                 cnt = (surface->num_triangles + surface->deprecatedq3num_bboxstride - 1) / surface->deprecatedq3num_bboxstride;
 529                                 for(i = 0; i < cnt; ++i)
 530                                 {
 531                                         if(BoxesOverlap(surface->deprecatedq3data_bbox6f + i * 6, surface->deprecatedq3data_bbox6f + i * 6 + 3, info->absmin, info->absmax))
 532                                         {
 533                                                 for(k = 0; k < surface->deprecatedq3num_bboxstride; ++k)
 534                                                 {
 535                                                         tri = i * surface->deprecatedq3num_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 || !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, r_texture_convertsRGB_skin.integer);
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         float dist, modelyawradius, modelradius;
3406         msurface_t *surface;
3407         int numshadowmeshtriangles;
3408         hullinfo_t hullinfo;
3409         int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3410         model_brush_lightstyleinfo_t styleinfo[256];
3411         unsigned char *datapointer;
3412
3413         mod->modeldatatypestring = "Q1BSP";
3414
3415         mod->type = mod_brushq1;
3416
3417         header = (dheader_t *)buffer;
3418
3419         i = LittleLong(header->version);
3420         if (i != BSPVERSION && i != 30)
3421                 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3422         mod->brush.ishlbsp = i == 30;
3423
3424 // fill in hull info
3425         VectorClear (hullinfo.hullsizes[0][0]);
3426         VectorClear (hullinfo.hullsizes[0][1]);
3427         if (mod->brush.ishlbsp)
3428         {
3429                 mod->modeldatatypestring = "HLBSP";
3430
3431                 hullinfo.filehulls = 4;
3432                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3433                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3434                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3435                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3436                 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3437                 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3438         }
3439         else
3440         {
3441                 hullinfo.filehulls = 4;
3442                 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3443                 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3444                 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3445                 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3446         }
3447
3448 // read lumps
3449         mod_base = (unsigned char*)buffer;
3450         for (i = 0; i < HEADER_LUMPS; i++)
3451         {
3452                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3453                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3454         }
3455
3456         mod->soundfromcenter = true;
3457         mod->TraceBox = Mod_Q1BSP_TraceBox;
3458         mod->TraceLine = Mod_Q1BSP_TraceLine;
3459         mod->TracePoint = Mod_Q1BSP_TracePoint;
3460         mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3461         mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3462         mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3463         mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3464         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3465         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3466         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3467         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3468         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3469         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3470         mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3471         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3472         mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3473         mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3474         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3475         mod->Draw = R_Q1BSP_Draw;
3476         mod->DrawDepth = R_Q1BSP_DrawDepth;
3477         mod->DrawDebug = R_Q1BSP_DrawDebug;
3478         mod->DrawPrepass = R_Q1BSP_DrawPrepass;
3479         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3480         mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3481         mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3482         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3483         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3484         mod->DrawLight = R_Q1BSP_DrawLight;
3485
3486 // load into heap
3487
3488         mod->brush.qw_md4sum = 0;
3489         mod->brush.qw_md4sum2 = 0;
3490         for (i = 0;i < HEADER_LUMPS;i++)
3491         {
3492                 int temp;
3493                 if (i == LUMP_ENTITIES)
3494                         continue;
3495                 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3496                 mod->brush.qw_md4sum ^= LittleLong(temp);
3497                 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3498                         continue;
3499                 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3500                 mod->brush.qw_md4sum2 ^= LittleLong(temp);
3501         }
3502
3503         Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3504         Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3505         Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3506         Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3507         Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3508         Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3509         Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3510         Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3511         Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3512         Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3513         Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3514         // load submodels before leafs because they contain the number of vis leafs
3515         Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3516         Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3517         Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3518         Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3519
3520         // check if the map supports transparent water rendering
3521         loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3522
3523         if (mod->brushq1.data_compressedpvs)
3524                 Mem_Free(mod->brushq1.data_compressedpvs);
3525         mod->brushq1.data_compressedpvs = NULL;
3526         mod->brushq1.num_compressedpvs = 0;
3527
3528         Mod_Q1BSP_MakeHull0();
3529         Mod_Q1BSP_MakePortals();
3530
3531         mod->numframes = 2;             // regular and alternate animation
3532         mod->numskins = 1;
3533
3534         // make a single combined shadow mesh to allow optimized shadow volume creation
3535         numshadowmeshtriangles = 0;
3536         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3537         {
3538                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3539                 numshadowmeshtriangles += surface->num_triangles;
3540         }
3541         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3542         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3543                 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));
3544         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3545         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3546
3547         if (loadmodel->brush.numsubmodels)
3548                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3549
3550         // LordHavoc: to clear the fog around the original quake submodel code, I
3551         // will explain:
3552         // first of all, some background info on the submodels:
3553         // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3554         // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3555         // now the weird for loop itself:
3556         // the loop functions in an odd way, on each iteration it sets up the
3557         // current 'mod' model (which despite the confusing code IS the model of
3558         // the number i), at the end of the loop it duplicates the model to become
3559         // the next submodel, and loops back to set up the new submodel.
3560
3561         // LordHavoc: now the explanation of my sane way (which works identically):
3562         // set up the world model, then on each submodel copy from the world model
3563         // and set up the submodel with the respective model info.
3564         totalstylesurfaces = 0;
3565         totalstyles = 0;
3566         for (i = 0;i < mod->brush.numsubmodels;i++)
3567         {
3568                 memset(stylecounts, 0, sizeof(stylecounts));
3569                 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3570                 {
3571                         surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3572                         for (j = 0;j < MAXLIGHTMAPS;j++)
3573                                 stylecounts[surface->lightmapinfo->styles[j]]++;
3574                 }
3575                 for (k = 0;k < 255;k++)
3576                 {
3577                         totalstyles++;
3578                         if (stylecounts[k])
3579                                 totalstylesurfaces += stylecounts[k];
3580                 }
3581         }
3582         datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3583         for (i = 0;i < mod->brush.numsubmodels;i++)
3584         {
3585                 // LordHavoc: this code was originally at the end of this loop, but
3586                 // has been transformed to something more readable at the start here.
3587
3588                 if (i > 0)
3589                 {
3590                         char name[10];
3591                         // duplicate the basic information
3592                         dpsnprintf(name, sizeof(name), "*%i", i);
3593                         mod = Mod_FindName(name, loadmodel->name);
3594                         // copy the base model to this one
3595                         *mod = *loadmodel;
3596                         // rename the clone back to its proper name
3597                         strlcpy(mod->name, name, sizeof(mod->name));
3598                         mod->brush.parentmodel = loadmodel;
3599                         // textures and memory belong to the main model
3600                         mod->texturepool = NULL;
3601                         mod->mempool = NULL;
3602                         mod->brush.GetPVS = NULL;
3603                         mod->brush.FatPVS = NULL;
3604                         mod->brush.BoxTouchingPVS = NULL;
3605                         mod->brush.BoxTouchingLeafPVS = NULL;
3606                         mod->brush.BoxTouchingVisibleLeafs = NULL;
3607                         mod->brush.FindBoxClusters = NULL;
3608                         mod->brush.LightPoint = NULL;
3609                         mod->brush.AmbientSoundLevelsForPoint = NULL;
3610                 }
3611
3612                 mod->brush.submodel = i;
3613
3614                 if (loadmodel->brush.submodels)
3615                         loadmodel->brush.submodels[i] = mod;
3616
3617                 bm = &mod->brushq1.submodels[i];
3618
3619                 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3620                 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3621                 {
3622                         mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3623                         mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3624                 }
3625
3626                 mod->firstmodelsurface = bm->firstface;
3627                 mod->nummodelsurfaces = bm->numfaces;
3628
3629                 // set node/leaf parents for this submodel
3630                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
3631
3632                 // make the model surface list (used by shadowing/lighting)
3633                 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3634                 Mod_MakeSortedSurfaces(mod);
3635
3636                 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3637                 // (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)
3638                 VectorCopy(bm->mins, mod->normalmins);
3639                 VectorCopy(bm->maxs, mod->normalmaxs);
3640                 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3641                 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3642                 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3643                 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3644                 modelradius = modelyawradius + modelradius * modelradius;
3645                 modelyawradius = sqrt(modelyawradius);
3646                 modelradius = sqrt(modelradius);
3647                 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3648                 mod->yawmins[2] = mod->normalmins[2];
3649                 mod->yawmaxs[0] = mod->yawmaxs[1] =  modelyawradius;
3650                 mod->yawmaxs[2] = mod->normalmaxs[2];
3651                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3652                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] =  modelradius;
3653                 mod->radius = modelradius;
3654                 mod->radius2 = modelradius * modelradius;
3655
3656                 // this gets altered below if sky or water is used
3657                 mod->DrawSky = NULL;
3658                 mod->DrawAddWaterPlanes = NULL;
3659
3660                 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3661                 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3662                 if (mod->nummodelsurfaces)
3663                 {
3664                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3665                                 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3666                                         break;
3667                         if (j < mod->nummodelsurfaces)
3668                                 mod->DrawSky = R_Q1BSP_DrawSky;
3669
3670                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3671                                 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3672                                         break;
3673                         if (j < mod->nummodelsurfaces)
3674                                 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3675
3676                         // build lightstyle update chains
3677                         // (used to rapidly mark lightmapupdateflags on many surfaces
3678                         // when d_lightstylevalue changes)
3679                         memset(stylecounts, 0, sizeof(stylecounts));
3680                         for (k = 0;k < mod->nummodelsurfaces;k++)
3681                         {
3682                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3683                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3684                                         stylecounts[surface->lightmapinfo->styles[j]]++;
3685                         }
3686                         mod->brushq1.num_lightstyles = 0;
3687                         for (k = 0;k < 255;k++)
3688                         {
3689                                 if (stylecounts[k])
3690                                 {
3691                                         styleinfo[mod->brushq1.num_lightstyles].style = k;
3692                                         styleinfo[mod->brushq1.num_lightstyles].value = 0;
3693                                         styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3694                                         styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3695                                         remapstyles[k] = mod->brushq1.num_lightstyles;
3696                                         mod->brushq1.num_lightstyles++;
3697                                 }
3698                         }
3699                         for (k = 0;k < mod->nummodelsurfaces;k++)
3700                         {
3701                                 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3702                                 for (j = 0;j < MAXLIGHTMAPS;j++)
3703                                 {
3704                                         if (surface->lightmapinfo->styles[j] != 255)
3705                                         {
3706                                                 int r = remapstyles[surface->lightmapinfo->styles[j]];
3707                                                 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3708                                         }
3709                                 }
3710                         }
3711                         mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3712                         memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3713                 }
3714                 else
3715                 {
3716                         // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3717                         Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3718                 }
3719                 //mod->brushq1.num_visleafs = bm->visleafs;
3720
3721                 // generate VBOs and other shared data before cloning submodels
3722                 if (i == 0)
3723                 {
3724                         Mod_BuildVBOs();
3725                         Mod_Q1BSP_LoadMapBrushes();
3726                         //Mod_Q1BSP_ProcessLightList();
3727                 }
3728         }
3729
3730         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);
3731 }
3732
3733 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3734 {
3735 }
3736
3737 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3738 {
3739 /*
3740         d_t *in;
3741         m_t *out;
3742         int i, count;
3743
3744         in = (void *)(mod_base + l->fileofs);
3745         if (l->filelen % sizeof(*in))
3746                 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3747         count = l->filelen / sizeof(*in);
3748         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3749
3750         loadmodel-> = out;
3751         loadmodel->num = count;
3752
3753         for (i = 0;i < count;i++, in++, out++)
3754         {
3755         }
3756 */
3757 }
3758
3759 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3760 {
3761 /*
3762         d_t *in;
3763         m_t *out;
3764         int i, count;
3765
3766         in = (void *)(mod_base + l->fileofs);
3767         if (l->filelen % sizeof(*in))
3768                 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3769         count = l->filelen / sizeof(*in);
3770         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3771
3772         loadmodel-> = out;
3773         loadmodel->num = count;
3774
3775         for (i = 0;i < count;i++, in++, out++)
3776         {
3777         }
3778 */
3779 }
3780
3781 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3782 {
3783 /*
3784         d_t *in;
3785         m_t *out;
3786         int i, count;
3787
3788         in = (void *)(mod_base + l->fileofs);
3789         if (l->filelen % sizeof(*in))
3790                 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3791         count = l->filelen / sizeof(*in);
3792         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3793
3794         loadmodel-> = out;
3795         loadmodel->num = count;
3796
3797         for (i = 0;i < count;i++, in++, out++)
3798         {
3799         }
3800 */
3801 }
3802
3803 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3804 {
3805 /*
3806         d_t *in;
3807         m_t *out;
3808         int i, count;
3809
3810         in = (void *)(mod_base + l->fileofs);
3811         if (l->filelen % sizeof(*in))
3812                 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3813         count = l->filelen / sizeof(*in);
3814         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3815
3816         loadmodel-> = out;
3817         loadmodel->num = count;
3818
3819         for (i = 0;i < count;i++, in++, out++)
3820         {
3821         }
3822 */
3823 }
3824
3825 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3826 {
3827 /*
3828         d_t *in;
3829         m_t *out;
3830         int i, count;
3831
3832         in = (void *)(mod_base + l->fileofs);
3833         if (l->filelen % sizeof(*in))
3834                 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3835         count = l->filelen / sizeof(*in);
3836         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3837
3838         loadmodel-> = out;
3839         loadmodel->num = count;
3840
3841         for (i = 0;i < count;i++, in++, out++)
3842         {
3843         }
3844 */
3845 }
3846
3847 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3848 {
3849 /*
3850         d_t *in;
3851         m_t *out;
3852         int i, count;
3853
3854         in = (void *)(mod_base + l->fileofs);
3855         if (l->filelen % sizeof(*in))
3856                 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3857         count = l->filelen / sizeof(*in);
3858         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3859
3860         loadmodel-> = out;
3861         loadmodel->num = count;
3862
3863         for (i = 0;i < count;i++, in++, out++)
3864         {
3865         }
3866 */
3867 }
3868
3869 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3870 {
3871 /*
3872         d_t *in;
3873         m_t *out;
3874         int i, count;
3875
3876         in = (void *)(mod_base + l->fileofs);
3877         if (l->filelen % sizeof(*in))
3878                 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3879         count = l->filelen / sizeof(*in);
3880         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3881
3882         loadmodel-> = out;
3883         loadmodel->num = count;
3884
3885         for (i = 0;i < count;i++, in++, out++)
3886         {
3887         }
3888 */
3889 }
3890
3891 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3892 {
3893 /*
3894         d_t *in;
3895         m_t *out;
3896         int i, count;
3897
3898         in = (void *)(mod_base + l->fileofs);
3899         if (l->filelen % sizeof(*in))
3900                 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3901         count = l->filelen / sizeof(*in);
3902         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3903
3904         loadmodel-> = out;
3905         loadmodel->num = count;
3906
3907         for (i = 0;i < count;i++, in++, out++)
3908         {
3909         }
3910 */
3911 }
3912
3913 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3914 {
3915 /*
3916         d_t *in;
3917         m_t *out;
3918         int i, count;
3919
3920         in = (void *)(mod_base + l->fileofs);
3921         if (l->filelen % sizeof(*in))
3922                 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3923         count = l->filelen / sizeof(*in);
3924         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3925
3926         loadmodel-> = out;
3927         loadmodel->num = count;
3928
3929         for (i = 0;i < count;i++, in++, out++)
3930         {
3931         }
3932 */
3933 }
3934
3935 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3936 {
3937 /*
3938         d_t *in;
3939         m_t *out;
3940         int i, count;
3941
3942         in = (void *)(mod_base + l->fileofs);
3943         if (l->filelen % sizeof(*in))
3944                 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3945         count = l->filelen / sizeof(*in);
3946         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3947
3948         loadmodel-> = out;
3949         loadmodel->num = count;
3950
3951         for (i = 0;i < count;i++, in++, out++)
3952         {
3953         }
3954 */
3955 }
3956
3957 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3958 {
3959 /*
3960         d_t *in;
3961         m_t *out;
3962         int i, count;
3963
3964         in = (void *)(mod_base + l->fileofs);
3965         if (l->filelen % sizeof(*in))
3966                 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3967         count = l->filelen / sizeof(*in);
3968         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3969
3970         loadmodel-> = out;
3971         loadmodel->num = count;
3972
3973         for (i = 0;i < count;i++, in++, out++)
3974         {
3975         }
3976 */
3977 }
3978
3979 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3980 {
3981 /*
3982         d_t *in;
3983         m_t *out;
3984         int i, count;
3985
3986         in = (void *)(mod_base + l->fileofs);
3987         if (l->filelen % sizeof(*in))
3988                 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3989         count = l->filelen / sizeof(*in);
3990         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3991
3992         loadmodel-> = out;
3993         loadmodel->num = count;
3994
3995         for (i = 0;i < count;i++, in++, out++)
3996         {
3997         }
3998 */
3999 }
4000
4001 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4002 {
4003 /*
4004         d_t *in;
4005         m_t *out;
4006         int i, count;
4007
4008         in = (void *)(mod_base + l->fileofs);
4009         if (l->filelen % sizeof(*in))
4010                 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4011         count = l->filelen / sizeof(*in);
4012         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4013
4014         loadmodel-> = out;
4015         loadmodel->num = count;
4016
4017         for (i = 0;i < count;i++, in++, out++)
4018         {
4019         }
4020 */
4021 }
4022
4023 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4024 {
4025 /*
4026         d_t *in;
4027         m_t *out;
4028         int i, count;
4029
4030         in = (void *)(mod_base + l->fileofs);
4031         if (l->filelen % sizeof(*in))
4032                 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4033         count = l->filelen / sizeof(*in);
4034         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4035
4036         loadmodel-> = out;
4037         loadmodel->num = count;
4038
4039         for (i = 0;i < count;i++, in++, out++)
4040         {
4041         }
4042 */
4043 }
4044
4045 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4046 {
4047 /*
4048         d_t *in;
4049         m_t *out;
4050         int i, count;
4051
4052         in = (void *)(mod_base + l->fileofs);
4053         if (l->filelen % sizeof(*in))
4054                 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4055         count = l->filelen / sizeof(*in);
4056         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4057
4058         loadmodel-> = out;
4059         loadmodel->num = count;
4060
4061         for (i = 0;i < count;i++, in++, out++)
4062         {
4063         }
4064 */
4065 }
4066
4067 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4068 {
4069 /*
4070         d_t *in;
4071         m_t *out;
4072         int i, count;
4073
4074         in = (void *)(mod_base + l->fileofs);
4075         if (l->filelen % sizeof(*in))
4076                 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4077         count = l->filelen / sizeof(*in);
4078         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4079
4080         loadmodel-> = out;
4081         loadmodel->num = count;
4082
4083         for (i = 0;i < count;i++, in++, out++)
4084         {
4085         }
4086 */
4087 }
4088
4089 static void Mod_Q2BSP_LoadModels(lump_t *l)
4090 {
4091 /*
4092         d_t *in;
4093         m_t *out;
4094         int i, count;
4095
4096         in = (void *)(mod_base + l->fileofs);
4097         if (l->filelen % sizeof(*in))
4098                 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4099         count = l->filelen / sizeof(*in);
4100         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4101
4102         loadmodel-> = out;
4103         loadmodel->num = count;
4104
4105         for (i = 0;i < count;i++, in++, out++)
4106         {
4107         }
4108 */
4109 }
4110
4111 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4112 {
4113         int i;
4114         q2dheader_t *header;
4115
4116         Host_Error("Mod_Q2BSP_Load: not yet implemented");
4117
4118         mod->modeldatatypestring = "Q2BSP";
4119
4120         mod->type = mod_brushq2;
4121
4122         header = (q2dheader_t *)buffer;
4123
4124         i = LittleLong(header->version);
4125         if (i != Q2BSPVERSION)
4126                 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4127
4128         mod_base = (unsigned char *)header;
4129
4130         // swap all the lumps
4131         for (i = 0;i < (int) sizeof(*header) / 4;i++)
4132                 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4133
4134         mod->brush.qw_md4sum = 0;
4135         mod->brush.qw_md4sum2 = 0;
4136         for (i = 0;i < Q2HEADER_LUMPS;i++)
4137         {
4138                 if (i == Q2LUMP_ENTITIES)
4139                         continue;
4140                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4141                 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4142                         continue;
4143                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4144         }
4145
4146         Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4147         Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4148         Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4149         Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4150         Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4151         Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4152         Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4153         Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4154         Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4155         Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4156         Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4157         Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4158         Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4159         Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4160         Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4161         Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4162         Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4163         // LordHavoc: must go last because this makes the submodels
4164         Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4165 }
4166
4167 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4168 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4169
4170 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4171 {
4172         const char *data;
4173         char key[128], value[MAX_INPUTLINE];
4174         float v[3];
4175         loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4176         loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4177         loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4178         if (!l->filelen)
4179                 return;
4180         loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4181         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4182         loadmodel->brush.entities[l->filelen] = 0;
4183         data = loadmodel->brush.entities;
4184         // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4185         // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
4186         loadmodel->brushq3.deluxemapping = false;
4187         if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4188         {
4189                 while (1)
4190                 {
4191                         if (!COM_ParseToken_Simple(&data, false, false))
4192                                 break; // error
4193                         if (com_token[0] == '}')
4194                                 break; // end of worldspawn
4195                         if (com_token[0] == '_')
4196                                 strlcpy(key, com_token + 1, sizeof(key));
4197                         else
4198                                 strlcpy(key, com_token, sizeof(key));
4199                         while (key[strlen(key)-1] == ' ') // remove trailing spaces
4200                                 key[strlen(key)-1] = 0;
4201                         if (!COM_ParseToken_Simple(&data, false, false))
4202                                 break; // error
4203                         strlcpy(value, com_token, sizeof(value));
4204                         if (!strcasecmp("gridsize", key)) // this one is case insensitive to 100% match q3map2
4205                         {
4206 #if _MSC_VER >= 1400
4207 #define sscanf sscanf_s
4208 #endif
4209 #if 0
4210                                 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4211                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4212 #else
4213                                 VectorSet(v, 64, 64, 128);
4214                                 if(sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) != 3)
4215                                         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]);
4216                                 if (v[0] != 0 && v[1] != 0 && v[2] != 0)
4217                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4218 #endif
4219                         }
4220                         else if (!strcmp("deluxeMaps", key))
4221                         {
4222                                 if (!strcmp(com_token, "1"))
4223                                 {
4224                                         loadmodel->brushq3.deluxemapping = true;
4225                                         loadmodel->brushq3.deluxemapping_modelspace = true;
4226                                 }
4227                                 else if (!strcmp(com_token, "2"))
4228                                 {
4229                                         loadmodel->brushq3.deluxemapping = true;
4230                                         loadmodel->brushq3.deluxemapping_modelspace = false;
4231                                 }
4232                         }
4233                 }
4234         }
4235 }
4236
4237 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4238 {
4239         q3dtexture_t *in;
4240         texture_t *out;
4241         int i, count;
4242
4243         in = (q3dtexture_t *)(mod_base + l->fileofs);
4244         if (l->filelen % sizeof(*in))
4245                 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4246         count = l->filelen / sizeof(*in);
4247         out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4248
4249         loadmodel->data_textures = out;
4250         loadmodel->num_textures = count;
4251         loadmodel->num_texturesperskin = loadmodel->num_textures;
4252
4253         for (i = 0;i < count;i++)
4254         {
4255                 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4256                 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4257                 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4258         }
4259
4260         if (cls.state == ca_dedicated)
4261                 return;
4262
4263         for (i = 0;i < count;i++, in++, out++)
4264                 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4265 }
4266
4267 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4268 {
4269         q3dplane_t *in;
4270         mplane_t *out;
4271         int i, count;
4272
4273         in = (q3dplane_t *)(mod_base + l->fileofs);
4274         if (l->filelen % sizeof(*in))
4275                 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4276         count = l->filelen / sizeof(*in);
4277         out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4278
4279         loadmodel->brush.data_planes = out;
4280         loadmodel->brush.num_planes = count;
4281
4282         for (i = 0;i < count;i++, in++, out++)
4283         {
4284                 out->normal[0] = LittleFloat(in->normal[0]);
4285                 out->normal[1] = LittleFloat(in->normal[1]);
4286                 out->normal[2] = LittleFloat(in->normal[2]);
4287                 out->dist = LittleFloat(in->dist);
4288                 PlaneClassify(out);
4289         }
4290 }
4291
4292 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4293 {
4294         q3dbrushside_t *in;
4295         q3mbrushside_t *out;
4296         int i, n, count;
4297
4298         in = (q3dbrushside_t *)(mod_base + l->fileofs);
4299         if (l->filelen % sizeof(*in))
4300                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4301         count = l->filelen / sizeof(*in);
4302         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4303
4304         loadmodel->brush.data_brushsides = out;
4305         loadmodel->brush.num_brushsides = count;
4306
4307         for (i = 0;i < count;i++, in++, out++)
4308         {
4309                 n = LittleLong(in->planeindex);
4310                 if (n < 0 || n >= loadmodel->brush.num_planes)
4311                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4312                 out->plane = loadmodel->brush.data_planes + n;
4313                 n = LittleLong(in->textureindex);
4314                 if (n < 0 || n >= loadmodel->num_textures)
4315                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4316                 out->texture = loadmodel->data_textures + n;
4317         }
4318 }
4319
4320 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4321 {
4322         q3dbrushside_ig_t *in;
4323         q3mbrushside_t *out;
4324         int i, n, count;
4325
4326         in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4327         if (l->filelen % sizeof(*in))
4328                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4329         count = l->filelen / sizeof(*in);
4330         out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4331
4332         loadmodel->brush.data_brushsides = out;
4333         loadmodel->brush.num_brushsides = count;
4334
4335         for (i = 0;i < count;i++, in++, out++)
4336         {
4337                 n = LittleLong(in->planeindex);
4338                 if (n < 0 || n >= loadmodel->brush.num_planes)
4339                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4340                 out->plane = loadmodel->brush.data_planes + n;
4341                 n = LittleLong(in->textureindex);
4342                 if (n < 0 || n >= loadmodel->num_textures)
4343                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4344                 out->texture = loadmodel->data_textures + n;
4345         }
4346 }
4347
4348 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4349 {
4350         q3dbrush_t *in;
4351         q3mbrush_t *out;
4352         int i, j, n, c, count, maxplanes, q3surfaceflags;
4353         colplanef_t *planes;
4354
4355         in = (q3dbrush_t *)(mod_base + l->fileofs);
4356         if (l->filelen % sizeof(*in))
4357                 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4358         count = l->filelen / sizeof(*in);
4359         out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4360
4361         loadmodel->brush.data_brushes = out;
4362         loadmodel->brush.num_brushes = count;
4363
4364         maxplanes = 0;
4365         planes = NULL;
4366
4367         for (i = 0;i < count;i++, in++, out++)
4368         {
4369                 n = LittleLong(in->firstbrushside);
4370                 c = LittleLong(in->numbrushsides);
4371                 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4372                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4373                 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4374                 out->numbrushsides = c;
4375                 n = LittleLong(in->textureindex);
4376                 if (n < 0 || n >= loadmodel->num_textures)
4377                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4378                 out->texture = loadmodel->data_textures + n;
4379
4380                 // make a list of mplane_t structs to construct a colbrush from
4381                 if (maxplanes < out->numbrushsides)
4382                 {
4383                         maxplanes = out->numbrushsides;
4384                         if (planes)
4385                                 Mem_Free(planes);
4386                         planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4387                 }
4388                 q3surfaceflags = 0;
4389                 for (j = 0;j < out->numbrushsides;j++)
4390                 {
4391                         VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4392                         planes[j].dist = out->firstbrushside[j].plane->dist;
4393                         planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4394                         planes[j].texture = out->firstbrushside[j].texture;
4395                         q3surfaceflags |= planes[j].q3surfaceflags;
4396                 }
4397                 // make the colbrush from the planes
4398                 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4399
4400                 // this whole loop can take a while (e.g. on redstarrepublic4)
4401                 CL_KeepaliveMessage(false);
4402         }
4403         if (planes)
4404                 Mem_Free(planes);
4405 }
4406
4407 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4408 {
4409         q3deffect_t *in;
4410         q3deffect_t *out;
4411         int i, n, count;
4412
4413         in = (q3deffect_t *)(mod_base + l->fileofs);
4414         if (l->filelen % sizeof(*in))
4415                 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4416         count = l->filelen / sizeof(*in);
4417         out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4418
4419         loadmodel->brushq3.data_effects = out;
4420         loadmodel->brushq3.num_effects = count;
4421
4422         for (i = 0;i < count;i++, in++, out++)
4423         {
4424                 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4425                 n = LittleLong(in->brushindex);
4426                 if (n >= loadmodel->brush.num_brushes)
4427                 {
4428                         Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4429                         n = -1;
4430                 }
4431                 out->brushindex = n;
4432                 out->unknown = LittleLong(in->unknown);
4433         }
4434 }
4435
4436 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4437 {
4438         q3dvertex_t *in;
4439         int i, count;
4440
4441         in = (q3dvertex_t *)(mod_base + l->fileofs);
4442         if (l->filelen % sizeof(*in))
4443                 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4444         loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4445         loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4446         loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4447         loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4448         loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4449         loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4450
4451         for (i = 0;i < count;i++, in++)
4452         {
4453                 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4454                 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4455                 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4456                 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4457                 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4458                 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4459                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4460                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4461                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4462                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4463                 // svector/tvector are calculated later in face loading
4464                 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4465                 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4466                 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4467                 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4468         }
4469 }
4470
4471 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4472 {
4473         int *in;
4474         int *out;
4475         int i, count;
4476
4477         in = (int *)(mod_base + l->fileofs);
4478         if (l->filelen % sizeof(int[3]))
4479                 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4480         count = l->filelen / sizeof(*in);
4481
4482         if(!loadmodel->brushq3.num_vertices)
4483         {
4484                 if (count)
4485                         Con_Printf("Mod_Q3BSP_LoadTriangles: %s has triangles but no vertexes, broken compiler, ignoring problem\n", loadmodel->name);
4486                 loadmodel->brushq3.num_triangles = 0;
4487                 return;
4488         }
4489
4490         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4491         loadmodel->brushq3.num_triangles = count / 3;
4492         loadmodel->brushq3.data_element3i = out;
4493
4494         for (i = 0;i < count;i++, in++, out++)
4495         {
4496                 *out = LittleLong(*in);
4497                 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4498                 {
4499                         Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4500                         *out = 0;
4501                 }
4502         }
4503 }
4504
4505 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4506 {
4507         q3dlightmap_t *input_pointer;
4508         int i, j, k, count, power, power2, endlightmap, mergewidth, mergeheight;
4509         unsigned char *c;
4510
4511         unsigned char *convertedpixels;
4512         char mapname[MAX_QPATH];
4513         int size, bytesperpixel, rgbmap[3];
4514         qboolean external;
4515         unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4516
4517         // defaults for q3bsp
4518         size = 128;
4519         bytesperpixel = 3;
4520         rgbmap[0] = 2;
4521         rgbmap[1] = 1;
4522         rgbmap[2] = 0;
4523         external = false;
4524         loadmodel->brushq3.lightmapsize = 128;
4525
4526         if (cls.state == ca_dedicated)
4527                 return;
4528
4529         if(mod_q3bsp_nolightmaps.integer)
4530         {
4531                 return;
4532         }
4533         else if(l->filelen)
4534         {
4535                 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4536                 if (developer_loading.integer)
4537                         Con_Printf("Using internal lightmaps\n");
4538                 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4539                 if (l->filelen % sizeof(*input_pointer))
4540                         Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4541                 count = l->filelen / sizeof(*input_pointer);
4542                 for(i = 0; i < count; ++i)
4543                         inpixels[i] = input_pointer[i].rgb;
4544         }
4545         else
4546         {
4547                 // no internal lightmaps
4548                 // try external lightmaps
4549                 if (developer_loading.integer)
4550                         Con_Printf("Using external lightmaps\n");
4551                 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4552                 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false, false);
4553                 if(!inpixels[0])
4554                         return;
4555
4556                 // using EXTERNAL lightmaps instead
4557                 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4558                 {
4559                         Mem_Free(inpixels[0]);
4560                         Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4561                 }
4562
4563                 size = image_width;
4564                 bytesperpixel = 4;
4565                 rgbmap[0] = 0;
4566                 rgbmap[1] = 1;
4567                 rgbmap[2] = 2;
4568                 external = true;
4569
4570                 for(count = 1; ; ++count)
4571                 {
4572                         inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false, false);
4573                         if(!inpixels[count])
4574                                 break; // we got all of them
4575                         if(image_width != size || image_height != size)
4576                         {
4577                                 for(i = 0; i <= count; ++i)
4578                                         Mem_Free(inpixels[i]);
4579                                 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4580                         }
4581                 }
4582         }
4583
4584         convertedpixels = (unsigned char *) Mem_Alloc(tempmempool, size*size*4);
4585         loadmodel->brushq3.lightmapsize = size;
4586         loadmodel->brushq3.num_originallightmaps = count;
4587
4588         // now check the surfaces to see if any of them index an odd numbered
4589         // lightmap, if so this is not a deluxemapped bsp file
4590         //
4591         // also check what lightmaps are actually used, because q3map2 sometimes
4592         // (always?) makes an unused one at the end, which
4593         // q3map2 sometimes (or always?) makes a second blank lightmap for no
4594         // reason when only one lightmap is used, which can throw off the
4595         // deluxemapping detection method, so check 2-lightmap bsp's specifically
4596         // to see if the second lightmap is blank, if so it is not deluxemapped.
4597         // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
4598         // in Mod_Q3BSP_LoadEntities was failed
4599         if (!loadmodel->brushq3.deluxemapping)
4600         {
4601                 loadmodel->brushq3.deluxemapping = !(count & 1);
4602                 loadmodel->brushq3.deluxemapping_modelspace = true;
4603                 endlightmap = 0;
4604                 if (loadmodel->brushq3.deluxemapping)
4605                 {
4606                         int facecount = faceslump->filelen / sizeof(q3dface_t);
4607                         q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4608                         for (i = 0;i < facecount;i++)
4609                         {
4610                                 j = LittleLong(faces[i].lightmapindex);
4611                                 if (j >= 0)
4612                                 {
4613                                         endlightmap = max(endlightmap, j + 1);
4614                                         if ((j & 1) || j + 1 >= count)
4615                                         {
4616                                                 loadmodel->brushq3.deluxemapping = false;
4617                                                 break;
4618                                         }
4619                                 }
4620                         }
4621                 }
4622
4623                 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4624                 // reason when only one lightmap is used, which can throw off the
4625                 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4626                 // to see if the second lightmap is blank, if so it is not deluxemapped.
4627                 //
4628                 // further research has shown q3map2 sometimes creates a deluxemap and two
4629                 // blank lightmaps, which must be handled properly as well
4630                 if (endlightmap == 1 && count > 1)
4631                 {
4632                         c = inpixels[1];
4633                         for (i = 0;i < size*size;i++)
4634                         {
4635                                 if (c[bytesperpixel*i + rgbmap[0]])
4636                                         break;
4637                                 if (c[bytesperpixel*i + rgbmap[1]])
4638                                         break;
4639                                 if (c[bytesperpixel*i + rgbmap[2]])
4640                                         break;
4641                         }
4642                         if (i == size*size)
4643                         {
4644                                 // all pixels in the unused lightmap were black...
4645                                 loadmodel->brushq3.deluxemapping = false;
4646                         }
4647                 }
4648         }
4649
4650         Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4651
4652         // figure out what the most reasonable merge power is within limits
4653
4654         loadmodel->brushq3.num_lightmapmergepower = 0;
4655
4656         for(i = 0; (128 << i) < size; ++i)
4657                 ;
4658         // i is now 0 for 128, 1 for 256, etc
4659
4660         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++)
4661                 loadmodel->brushq3.num_lightmapmergepower = power;
4662
4663         loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4664
4665         loadmodel->brushq3.num_mergedlightmaps = ((count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4666         loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4667         if (loadmodel->brushq3.deluxemapping)
4668                 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4669
4670         // allocate a texture pool if we need it
4671         if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4672                 loadmodel->texturepool = R_AllocTexturePool();
4673
4674         power = loadmodel->brushq3.num_lightmapmergepower;
4675         power2 = power * 2;
4676         for (i = 0;i < count;i++)
4677         {
4678                 // figure out which merged lightmap texture this fits into
4679                 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4680                 for (k = 0;k < size*size;k++)
4681                 {
4682                         convertedpixels[k*4+0] = inpixels[i][k*bytesperpixel+rgbmap[0]];
4683                         convertedpixels[k*4+1] = inpixels[i][k*bytesperpixel+rgbmap[1]];
4684                         convertedpixels[k*4+2] = inpixels[i][k*bytesperpixel+rgbmap[2]];
4685                         convertedpixels[k*4+3] = 255;
4686                 }
4687                 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4688                 {
4689                         // if the lightmap has not been allocated yet, create it
4690                         if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4691                         {
4692                                 // create a lightmap only as large as necessary to hold the
4693                                 // remaining size*size blocks
4694                                 // if there are multiple merged lightmap textures then they will
4695                                 // all be full size except the last one which may be smaller
4696                                 // because it only needs to the remaining blocks, and it will often
4697                                 // be odd sizes like 2048x512 due to only being 25% full or so.
4698                                 j = (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) - (lightmapindex << power2);
4699                                 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4700                                         ;
4701                                 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4702                                         ;
4703                                 if (developer_loading.integer)
4704                                         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);
4705                                 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);
4706                                 if (loadmodel->brushq3.data_deluxemaps)
4707                                         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);
4708                         }
4709                         mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4710                         mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4711                         j = (i >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) & ((1 << power2) - 1);
4712                         if (loadmodel->brushq3.deluxemapping && (i & 1))
4713                                 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4714                         else
4715                                 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4716                 }
4717                 else
4718                 {
4719                         // figure out which merged lightmap texture this fits into
4720                         if (loadmodel->brushq3.deluxemapping && (i & 1))
4721                                 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);
4722                         else
4723                                 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);
4724                 }
4725         }
4726
4727         Mem_Free(convertedpixels);
4728         if(external)
4729         {
4730                 for(i = 0; i < count; ++i)
4731                         Mem_Free(inpixels[i]);
4732         }
4733 }
4734
4735 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
4736 {
4737         int j, k, cnt, tri;
4738         float *mins, *maxs;
4739         const float *vert;
4740         *collisionstride = stride;
4741         if(stride > 0)
4742         {
4743                 cnt = (num_triangles + stride - 1) / stride;
4744                 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
4745                 for(j = 0; j < cnt; ++j)
4746                 {
4747                         mins = &((*collisionbbox6f)[6 * j + 0]);
4748                         maxs = &((*collisionbbox6f)[6 * j + 3]);
4749                         for(k = 0; k < stride; ++k)
4750                         {
4751                                 tri = j * stride + k;
4752                                 if(tri >= num_triangles)
4753                                         break;
4754                                 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
4755                                 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
4756                                 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
4757                                 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
4758                                 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
4759                                 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
4760                                 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
4761                                 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
4762                                 if(vert[0] < mins[0]) mins[0] = vert[0];
4763                                 if(vert[1] < mins[1]) mins[1] = vert[1];
4764                                 if(vert[2] < mins[2]) mins[2] = vert[2];
4765                                 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4766                                 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4767                                 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4768                                 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
4769                                 if(vert[0] < mins[0]) mins[0] = vert[0];
4770                                 if(vert[1] < mins[1]) mins[1] = vert[1];
4771                                 if(vert[2] < mins[2]) mins[2] = vert[2];
4772                                 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4773                                 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4774                                 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4775                         }
4776                 }
4777         }
4778         else
4779                 *collisionbbox6f = NULL;
4780 }
4781
4782 typedef struct patchtess_s
4783 {
4784         patchinfo_t info;
4785
4786         // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
4787         int surface_id;
4788         float lodgroup[6];
4789         float *originalvertex3f;
4790 } patchtess_t;
4791
4792 #define PATCHTESS_SAME_LODGROUP(a,b) \
4793         ( \
4794                 (a).lodgroup[0] == (b).lodgroup[0] && \
4795                 (a).lodgroup[1] == (b).lodgroup[1] && \
4796                 (a).lodgroup[2] == (b).lodgroup[2] && \
4797                 (a).lodgroup[3] == (b).lodgroup[3] && \
4798                 (a).lodgroup[4] == (b).lodgroup[4] && \
4799                 (a).lodgroup[5] == (b).lodgroup[5] \
4800         )
4801
4802 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4803 {
4804         q3dface_t *in, *oldin;
4805         msurface_t *out, *oldout;
4806         int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, collisionvertices, collisiontriangles, numvertices, numtriangles, cxtess, cytess;
4807         float lightmaptcbase[2], lightmaptcscale[2];
4808         //int *originalelement3i;
4809         //int *originalneighbor3i;
4810         float *originalvertex3f;
4811         //float *originalsvector3f;
4812         //float *originaltvector3f;
4813         float *originalnormal3f;
4814         float *originalcolor4f;
4815         float *originaltexcoordtexture2f;
4816         float *originaltexcoordlightmap2f;
4817         float *surfacecollisionvertex3f;
4818         int *surfacecollisionelement3i;
4819         float *v;
4820         patchtess_t *patchtess = NULL;
4821         int patchtesscount = 0;
4822         qboolean again;
4823
4824         in = (q3dface_t *)(mod_base + l->fileofs);
4825         if (l->filelen % sizeof(*in))
4826                 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4827         count = l->filelen / sizeof(*in);
4828         out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4829
4830         loadmodel->data_surfaces = out;
4831         loadmodel->num_surfaces = count;
4832
4833         if(count > 0)
4834                 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
4835
4836         i = 0;
4837         oldi = i;
4838         oldin = in;
4839         oldout = out;
4840         meshvertices = 0;
4841         meshtriangles = 0;
4842         for (;i < count;i++, in++, out++)
4843         {
4844                 // check face type first
4845                 type = LittleLong(in->type);
4846                 if (type != Q3FACETYPE_FLAT
4847                  && type != Q3FACETYPE_PATCH
4848                  && type != Q3FACETYPE_MESH
4849                  && type != Q3FACETYPE_FLARE)
4850                 {
4851                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4852                         continue;
4853                 }
4854
4855                 n = LittleLong(in->textureindex);
4856                 if (n < 0 || n >= loadmodel->num_textures)
4857                 {
4858                         Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4859                         continue;
4860                 }
4861                 out->texture = loadmodel->data_textures + n;
4862                 n = LittleLong(in->effectindex);
4863                 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4864                 {
4865                         if (developer_extra.integer)
4866                                 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4867                         n = -1;
4868                 }
4869                 if (n == -1)
4870                         out->effect = NULL;
4871                 else
4872                         out->effect = loadmodel->brushq3.data_effects + n;
4873
4874                 if (cls.state != ca_dedicated)
4875                 {
4876                         out->lightmaptexture = NULL;
4877                         out->deluxemaptexture = r_texture_blanknormalmap;
4878                         n = LittleLong(in->lightmapindex);
4879                         if (n < 0)
4880                                 n = -1;
4881                         else if (n >= loadmodel->brushq3.num_originallightmaps)
4882                         {
4883                                 if(loadmodel->brushq3.num_originallightmaps != 0)
4884                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4885                                 n = -1;
4886                         }
4887                         else
4888                         {
4889                                 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4890                                 if (loadmodel->brushq3.deluxemapping)
4891                                         out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4892                         }
4893                 }
4894
4895                 firstvertex = LittleLong(in->firstvertex);
4896                 numvertices = LittleLong(in->numvertices);
4897                 firstelement = LittleLong(in->firstelement);
4898                 numtriangles = LittleLong(in->numelements) / 3;
4899                 if (numtriangles * 3 != LittleLong(in->numelements))
4900                 {
4901                         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));
4902                         continue;
4903                 }
4904                 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4905                 {
4906                         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);
4907                         continue;
4908                 }
4909                 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4910                 {
4911                         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);
4912                         continue;
4913                 }
4914                 switch(type)
4915                 {
4916                 case Q3FACETYPE_FLAT:
4917                 case Q3FACETYPE_MESH:
4918                         // no processing necessary
4919                         break;
4920                 case Q3FACETYPE_PATCH:
4921                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4922                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4923                         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))
4924                         {
4925                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4926                                 continue;
4927                         }
4928                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4929
4930                         // convert patch to Q3FACETYPE_MESH
4931                         xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4932                         ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4933                         // bound to user settings
4934                         xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4935                         ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4936                         // bound to sanity settings
4937                         xtess = bound(0, xtess, 1024);
4938                         ytess = bound(0, ytess, 1024);
4939
4940                         // lower quality collision patches! Same procedure as before, but different cvars
4941                         // convert patch to Q3FACETYPE_MESH
4942                         cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4943                         cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4944                         // bound to user settings
4945                         cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
4946                         cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
4947                         // bound to sanity settings
4948                         cxtess = bound(0, cxtess, 1024);
4949                         cytess = bound(0, cytess, 1024);
4950
4951                         // store it for the LOD grouping step
4952                         patchtess[patchtesscount].info.xsize = patchsize[0];
4953                         patchtess[patchtesscount].info.ysize = patchsize[1];
4954                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
4955                         patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
4956                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
4957                         patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
4958
4959                         patchtess[patchtesscount].surface_id = i;
4960                         patchtess[patchtesscount].lodgroup[0] = LittleFloat(in->specific.patch.mins[0]);
4961                         patchtess[patchtesscount].lodgroup[1] = LittleFloat(in->specific.patch.mins[1]);
4962                         patchtess[patchtesscount].lodgroup[2] = LittleFloat(in->specific.patch.mins[2]);
4963                         patchtess[patchtesscount].lodgroup[3] = LittleFloat(in->specific.patch.maxs[0]);
4964                         patchtess[patchtesscount].lodgroup[4] = LittleFloat(in->specific.patch.maxs[1]);
4965                         patchtess[patchtesscount].lodgroup[5] = LittleFloat(in->specific.patch.maxs[2]);
4966                         patchtess[patchtesscount].originalvertex3f = originalvertex3f;
4967                         ++patchtesscount;
4968                         break;
4969                 case Q3FACETYPE_FLARE:
4970                         if (developer_extra.integer)
4971                                 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4972                         // don't render it
4973                         continue;
4974                 }
4975                 out->num_vertices = numvertices;
4976                 out->num_triangles = numtriangles;
4977                 meshvertices += out->num_vertices;
4978                 meshtriangles += out->num_triangles;
4979         }
4980
4981         // Fix patches tesselations so that they make no seams
4982         do
4983         {
4984                 again = false;
4985                 for(i = 0; i < patchtesscount; ++i)
4986                 {
4987                         for(j = i+1; j < patchtesscount; ++j)
4988                         {
4989                                 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
4990                                         continue;
4991
4992                                 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
4993                                         again = true;
4994                         }
4995                 }
4996         }
4997         while (again);
4998
4999         // Calculate resulting number of triangles
5000         collisionvertices = 0;
5001         collisiontriangles = 0;
5002         for(i = 0; i < patchtesscount; ++i)
5003         {
5004                 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
5005                 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
5006                 numvertices = finalwidth * finalheight;
5007                 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5008
5009                 oldout[patchtess[i].surface_id].num_vertices = numvertices;
5010                 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
5011                 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
5012                 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
5013
5014                 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_COLLISION].xtess);
5015                 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_COLLISION].ytess);
5016                 numvertices = finalwidth * finalheight;
5017                 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5018
5019                 oldout[patchtess[i].surface_id].num_collisionvertices = numvertices;
5020                 oldout[patchtess[i].surface_id].num_collisiontriangles = numtriangles;
5021                 collisionvertices += oldout[patchtess[i].surface_id].num_collisionvertices;
5022                 collisiontriangles += oldout[patchtess[i].surface_id].num_collisiontriangles;
5023         }
5024
5025         i = oldi;
5026         in = oldin;
5027         out = oldout;
5028         Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
5029         if (collisiontriangles)
5030         {
5031                 loadmodel->brush.data_collisionvertex3f = Mem_Alloc(loadmodel->mempool, collisionvertices * sizeof(float[3]));
5032                 loadmodel->brush.data_collisionelement3i = Mem_Alloc(loadmodel->mempool, collisiontriangles * sizeof(int[3]));
5033         }
5034         meshvertices = 0;
5035         meshtriangles = 0;
5036         collisionvertices = 0;
5037         collisiontriangles = 0;
5038         for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
5039         {
5040                 if (out->num_vertices < 3 || out->num_triangles < 1)
5041                         continue;
5042
5043                 type = LittleLong(in->type);
5044                 firstvertex = LittleLong(in->firstvertex);
5045                 firstelement = LittleLong(in->firstelement);
5046                 out->num_firstvertex = meshvertices;
5047                 out->num_firsttriangle = meshtriangles;
5048                 out->num_firstcollisiontriangle = collisiontriangles;
5049                 switch(type)
5050                 {
5051                 case Q3FACETYPE_FLAT:
5052                 case Q3FACETYPE_MESH:
5053                         // no processing necessary, except for lightmap merging
5054                         for (j = 0;j < out->num_vertices;j++)
5055                         {
5056                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5057                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5058                                 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5059                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5060                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5061                                 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5062                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5063                                 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5064                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5065                                 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5066                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5067                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5068                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5069                                 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5070                         }
5071                         for (j = 0;j < out->num_triangles*3;j++)
5072                                 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5073                         break;
5074                 case Q3FACETYPE_PATCH:
5075                         patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5076                         patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5077                         originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5078                         originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5079                         originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5080                         originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5081                         originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5082
5083                         xtess = ytess = cxtess = cytess = -1;
5084                         for(j = 0; j < patchtesscount; ++j)
5085                                 if(patchtess[j].surface_id == i)
5086                                 {
5087                                         xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5088                                         ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5089                                         cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5090                                         cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5091                                         break;
5092                                 }
5093                         if(xtess == -1)
5094                         {
5095                                 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5096                                 xtess = ytess = cxtess = cytess = 0;
5097                         }
5098
5099                         finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5100                         finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5101                         finalvertices = finalwidth * finalheight;
5102                         finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5103                         type = Q3FACETYPE_MESH;
5104                         // generate geometry
5105                         // (note: normals are skipped because they get recalculated)
5106                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5107                         Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5108                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5109                         Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5110                         Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5111                         Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5112
5113                         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);
5114
5115                         if (developer_extra.integer)
5116                         {
5117                                 if (out->num_triangles < finaltriangles)
5118                                         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);
5119                                 else
5120                                         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);
5121                         }
5122                         // q3map does not put in collision brushes for curves... ugh
5123                         // build the lower quality collision geometry
5124                         finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5125                         finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5126                         finalvertices = finalwidth * finalheight;
5127                         finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5128
5129                         // legacy collision geometry implementation
5130                         out->deprecatedq3data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5131                         out->deprecatedq3data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5132                         out->num_collisionvertices = finalvertices;
5133                         out->num_collisiontriangles = finaltriangles;
5134                         Q3PatchTesselateFloat(3, sizeof(float[3]), out->deprecatedq3data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5135                         Q3PatchTriangleElements(out->deprecatedq3data_collisionelement3i, finalwidth, finalheight, 0);
5136
5137                         //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5138                         Mod_SnapVertices(3, out->num_collisionvertices, out->deprecatedq3data_collisionvertex3f, 1);
5139
5140                         oldnumtriangles = out->num_triangles;
5141                         oldnumtriangles2 = out->num_collisiontriangles;
5142                         out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionvertex3f);
5143
5144                         // now optimize the collision mesh by finding triangle bboxes...
5145                         Mod_Q3BSP_BuildBBoxes(out->deprecatedq3data_collisionelement3i, out->num_collisiontriangles, out->deprecatedq3data_collisionvertex3f, &out->deprecatedq3data_collisionbbox6f, &out->deprecatedq3num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5146                         Mod_Q3BSP_BuildBBoxes(loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle, out->num_triangles, loadmodel->surfmesh.data_vertex3f, &out->deprecatedq3data_bbox6f, &out->deprecatedq3num_bboxstride, mod_q3bsp_curves_stride.integer);
5147
5148                         // store collision geometry for BIH collision tree
5149                         surfacecollisionvertex3f = loadmodel->brush.data_collisionvertex3f + collisionvertices * 3;
5150                         surfacecollisionelement3i = loadmodel->brush.data_collisionelement3i + collisiontriangles * 3;
5151                         Q3PatchTesselateFloat(3, sizeof(float[3]), surfacecollisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5152                         Q3PatchTriangleElements(surfacecollisionelement3i, finalwidth, finalheight, collisionvertices);
5153                         Mod_SnapVertices(3, finalvertices, surfacecollisionvertex3f, 1);
5154                         oldnumtriangles = out->num_triangles;
5155                         oldnumtriangles2 = out->num_collisiontriangles;
5156                         out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, surfacecollisionelement3i, surfacecollisionelement3i, loadmodel->brush.data_collisionvertex3f);
5157
5158                         if (developer_extra.integer)
5159                                 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);
5160
5161                         collisionvertices += finalvertices;
5162                         collisiontriangles += out->num_collisiontriangles;
5163                         break;
5164                 default:
5165                         break;
5166                 }
5167                 meshvertices += out->num_vertices;
5168                 meshtriangles += out->num_triangles;
5169                 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5170                         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)
5171                                 invalidelements++;
5172                 if (invalidelements)
5173                 {
5174                         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);
5175                         for (j = 0;j < out->num_triangles * 3;j++)
5176                         {
5177                                 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5178                                 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)
5179                                         (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5180                         }
5181                         Con_Print("\n");
5182                 }
5183                 // calculate a bounding box
5184                 VectorClear(out->mins);
5185                 VectorClear(out->maxs);
5186                 if (out->num_vertices)
5187                 {
5188                         if (cls.state != ca_dedicated && out->lightmaptexture)
5189                         {
5190                                 // figure out which part of the merged lightmap this fits into
5191                                 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5192                                 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5193                                 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5194                                 lightmapindex &= mergewidth * mergeheight - 1;
5195                                 lightmaptcscale[0] = 1.0f / mergewidth;
5196                                 lightmaptcscale[1] = 1.0f / mergeheight;
5197                                 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5198                                 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5199                                 // modify the lightmap texcoords to match this region of the merged lightmap
5200                                 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5201                                 {
5202                                         v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5203                                         v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5204                                 }
5205                         }
5206                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5207                         VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5208                         for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5209                         {
5210                                 out->mins[0] = min(out->mins[0], v[0]);
5211                                 out->maxs[0] = max(out->maxs[0], v[0]);
5212                                 out->mins[1] = min(out->mins[1], v[1]);
5213                                 out->maxs[1] = max(out->maxs[1], v[1]);
5214                                 out->mins[2] = min(out->mins[2], v[2]);
5215                                 out->maxs[2] = max(out->maxs[2], v[2]);
5216                         }
5217                         out->mins[0] -= 1.0f;
5218                         out->mins[1] -= 1.0f;
5219                         out->mins[2] -= 1.0f;
5220                         out->maxs[0] += 1.0f;
5221                         out->maxs[1] += 1.0f;
5222                         out->maxs[2] += 1.0f;
5223                 }
5224                 // set lightmap styles for consistency with q1bsp
5225                 //out->lightmapinfo->styles[0] = 0;
5226                 //out->lightmapinfo->styles[1] = 255;
5227                 //out->lightmapinfo->styles[2] = 255;
5228                 //out->lightmapinfo->styles[3] = 255;
5229         }
5230
5231         i = oldi;
5232         out = oldout;
5233         for (;i < count;i++, out++)
5234         {
5235                 if(out->num_vertices && out->num_triangles)
5236                         continue;
5237                 if(out->num_vertices == 0)
5238                         Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no vertices, ignoring\n", i);
5239                 if(out->num_triangles == 0)
5240                         Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no triangles, ignoring\n", i);
5241         }
5242
5243         // for per pixel lighting
5244         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);
5245
5246         // generate ushort elements array if possible
5247         if (loadmodel->surfmesh.data_element3s)
5248                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5249                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5250
5251         // free the no longer needed vertex data
5252         loadmodel->brushq3.num_vertices = 0;
5253         if (loadmodel->brushq3.data_vertex3f)
5254                 Mem_Free(loadmodel->brushq3.data_vertex3f);
5255         loadmodel->brushq3.data_vertex3f = NULL;
5256         loadmodel->brushq3.data_normal3f = NULL;
5257         loadmodel->brushq3.data_texcoordtexture2f = NULL;
5258         loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5259         loadmodel->brushq3.data_color4f = NULL;
5260         // free the no longer needed triangle data
5261         loadmodel->brushq3.num_triangles = 0;
5262         if (loadmodel->brushq3.data_element3i)
5263                 Mem_Free(loadmodel->brushq3.data_element3i);
5264         loadmodel->brushq3.data_element3i = NULL;
5265
5266         if(patchtess)
5267                 Mem_Free(patchtess);
5268 }
5269
5270 static void Mod_Q3BSP_LoadModels(lump_t *l)
5271 {
5272         q3dmodel_t *in;
5273         q3dmodel_t *out;
5274         int i, j, n, c, count;
5275
5276         in = (q3dmodel_t *)(mod_base + l->fileofs);
5277         if (l->filelen % sizeof(*in))
5278                 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5279         count = l->filelen / sizeof(*in);
5280         out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5281
5282         loadmodel->brushq3.data_models = out;
5283         loadmodel->brushq3.num_models = count;
5284
5285         for (i = 0;i < count;i++, in++, out++)
5286         {
5287                 for (j = 0;j < 3;j++)
5288                 {
5289                         out->mins[j] = LittleFloat(in->mins[j]);
5290                         out->maxs[j] = LittleFloat(in->maxs[j]);
5291                 }
5292                 n = LittleLong(in->firstface);
5293                 c = LittleLong(in->numfaces);
5294                 if (n < 0 || n + c > loadmodel->num_surfaces)
5295                         Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5296                 out->firstface = n;
5297                 out->numfaces = c;
5298                 n = LittleLong(in->firstbrush);
5299                 c = LittleLong(in->numbrushes);
5300                 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5301                         Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5302                 out->firstbrush = n;
5303                 out->numbrushes = c;
5304         }
5305 }
5306
5307 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5308 {
5309         int *in;
5310         int *out;
5311         int i, n, count;
5312
5313         in = (int *)(mod_base + l->fileofs);
5314         if (l->filelen % sizeof(*in))
5315                 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5316         count = l->filelen / sizeof(*in);
5317         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5318
5319         loadmodel->brush.data_leafbrushes = out;
5320         loadmodel->brush.num_leafbrushes = count;
5321
5322         for (i = 0;i < count;i++, in++, out++)
5323         {
5324                 n = LittleLong(*in);
5325                 if (n < 0 || n >= loadmodel->brush.num_brushes)
5326                         Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5327                 *out = n;
5328         }
5329 }
5330
5331 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5332 {
5333         int *in;
5334         int *out;
5335         int i, n, count;
5336
5337         in = (int *)(mod_base + l->fileofs);
5338         if (l->filelen % sizeof(*in))
5339                 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5340         count = l->filelen / sizeof(*in);
5341         out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5342
5343         loadmodel->brush.data_leafsurfaces = out;
5344         loadmodel->brush.num_leafsurfaces = count;
5345
5346         for (i = 0;i < count;i++, in++, out++)
5347         {
5348                 n = LittleLong(*in);
5349                 if (n < 0 || n >= loadmodel->num_surfaces)
5350                         Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5351                 *out = n;
5352         }
5353 }
5354
5355 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5356 {
5357         q3dleaf_t *in;
5358         mleaf_t *out;
5359         int i, j, n, c, count;
5360
5361         in = (q3dleaf_t *)(mod_base + l->fileofs);
5362         if (l->filelen % sizeof(*in))
5363                 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5364         count = l->filelen / sizeof(*in);
5365         out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5366
5367         loadmodel->brush.data_leafs = out;
5368         loadmodel->brush.num_leafs = count;
5369
5370         for (i = 0;i < count;i++, in++, out++)
5371         {
5372                 out->parent = NULL;
5373                 out->plane = NULL;
5374                 out->clusterindex = LittleLong(in->clusterindex);
5375                 out->areaindex = LittleLong(in->areaindex);
5376                 for (j = 0;j < 3;j++)
5377                 {
5378                         // yes the mins/maxs are ints
5379                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5380                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5381                 }
5382                 n = LittleLong(in->firstleafface);
5383                 c = LittleLong(in->numleaffaces);
5384                 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5385                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5386                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5387                 out->numleafsurfaces = c;
5388                 n = LittleLong(in->firstleafbrush);
5389                 c = LittleLong(in->numleafbrushes);
5390                 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5391                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5392                 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5393                 out->numleafbrushes = c;
5394         }
5395 }
5396
5397 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5398 {
5399         q3dnode_t *in;
5400         mnode_t *out;
5401         int i, j, n, count;
5402
5403         in = (q3dnode_t *)(mod_base + l->fileofs);
5404         if (l->filelen % sizeof(*in))
5405                 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5406         count = l->filelen / sizeof(*in);
5407         out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5408
5409         loadmodel->brush.data_nodes = out;
5410         loadmodel->brush.num_nodes = count;
5411
5412         for (i = 0;i < count;i++, in++, out++)
5413         {
5414                 out->parent = NULL;
5415                 n = LittleLong(in->planeindex);
5416                 if (n < 0 || n >= loadmodel->brush.num_planes)
5417                         Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5418                 out->plane = loadmodel->brush.data_planes + n;
5419                 for (j = 0;j < 2;j++)
5420                 {
5421                         n = LittleLong(in->childrenindex[j]);
5422                         if (n >= 0)
5423                         {
5424                                 if (n >= loadmodel->brush.num_nodes)
5425                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5426                                 out->children[j] = loadmodel->brush.data_nodes + n;
5427                         }
5428                         else
5429                         {
5430                                 n = -1 - n;
5431                                 if (n >= loadmodel->brush.num_leafs)
5432                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5433                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5434                         }
5435                 }
5436                 for (j = 0;j < 3;j++)
5437                 {
5438                         // yes the mins/maxs are ints
5439                         out->mins[j] = LittleLong(in->mins[j]) - 1;
5440                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5441                 }
5442         }
5443
5444         // set the parent pointers
5445         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5446 }
5447
5448 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5449 {
5450         q3dlightgrid_t *in;
5451         q3dlightgrid_t *out;
5452         int count;
5453
5454         in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5455         if (l->filelen % sizeof(*in))
5456                 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5457         loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5458         loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5459         loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5460         loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5461         loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5462         loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5463         loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5464         loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5465         loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5466         loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5467         loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5468         loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5469         count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5470         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]);
5471         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]);
5472
5473         // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5474         if (l->filelen)
5475         {
5476                 if (l->filelen < count * (int)sizeof(*in))
5477                 {
5478                         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]);
5479                         return; // ignore the grid if we cannot understand it
5480                 }
5481                 if (l->filelen != count * (int)sizeof(*in))
5482                         Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5483                 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5484                 loadmodel->brushq3.data_lightgrid = out;
5485                 loadmodel->brushq3.num_lightgrid = count;
5486                 // no swapping or validation necessary
5487                 memcpy(out, in, count * (int)sizeof(*out));
5488         }
5489 }
5490
5491 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5492 {
5493         q3dpvs_t *in;
5494         int totalchains;
5495
5496         if (l->filelen == 0)
5497         {
5498                 int i;
5499                 // unvised maps often have cluster indices even without pvs, so check
5500                 // leafs to find real number of clusters
5501                 loadmodel->brush.num_pvsclusters = 1;
5502                 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5503                         loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5504
5505                 // create clusters
5506                 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5507                 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5508                 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5509                 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5510                 return;
5511         }
5512
5513         in = (q3dpvs_t *)(mod_base + l->fileofs);
5514         if (l->filelen < 9)
5515                 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5516
5517         loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5518         loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5519         if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5520                 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5521         totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5522         if (l->filelen < totalchains + (int)sizeof(*in))
5523                 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);
5524
5525         loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5526         memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5527 }
5528
5529 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5530 {
5531         int i, j, k, index[3];
5532         float transformed[3], blend1, blend2, blend, stylescale;
5533         q3dlightgrid_t *a, *s;
5534
5535         // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5536         stylescale = r_refdef.scene.rtlightstylevalue[0];
5537
5538         if (!model->brushq3.num_lightgrid)
5539         {
5540                 ambientcolor[0] = stylescale;
5541                 ambientcolor[1] = stylescale;
5542                 ambientcolor[2] = stylescale;
5543                 return;
5544         }
5545
5546         Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5547         //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5548         //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5549         transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5550         transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5551         transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5552         index[0] = (int)floor(transformed[0]);
5553         index[1] = (int)floor(transformed[1]);
5554         index[2] = (int)floor(transformed[2]);
5555         //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5556
5557         // now lerp the values
5558         VectorClear(diffusenormal);
5559         a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5560         for (k = 0;k < 2;k++)
5561         {
5562                 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5563                 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5564                         continue;
5565                 for (j = 0;j < 2;j++)
5566                 {
5567                         blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5568                         if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5569                                 continue;
5570                         for (i = 0;i < 2;i++)
5571                         {
5572                                 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5573                                 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5574                                         continue;
5575                                 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5576                                 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5577                                 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5578                                 // this uses the mod_md3_sin table because the values are
5579                                 // already in the 0-255 range, the 64+ bias fetches a cosine
5580                                 // instead of a sine value
5581                                 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5582                                 diffusenormal[1] += blend * (mod_md3_sin[     s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5583                                 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5584                                 //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)));
5585                         }
5586                 }
5587         }
5588
5589         // normalize the light direction before turning
5590         VectorNormalize(diffusenormal);
5591         //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]);
5592 }
5593
5594 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
5595 {
5596         double t1, t2;
5597         double midf, mid[3];
5598         int ret, side;
5599
5600         // check for empty
5601         while (node->plane)
5602         {
5603                 // find the point distances
5604                 mplane_t *plane = node->plane;
5605                 if (plane->type < 3)
5606                 {
5607                         t1 = p1[plane->type] - plane->dist;
5608                         t2 = p2[plane->type] - plane->dist;
5609                 }
5610                 else
5611                 {
5612                         t1 = DotProduct (plane->normal, p1) - plane->dist;
5613                         t2 = DotProduct (plane->normal, p2) - plane->dist;
5614                 }
5615
5616                 if (t1 < 0)
5617                 {
5618                         if (t2 < 0)
5619                         {
5620                                 node = node->children[1];
5621                                 continue;
5622                         }
5623                         side = 1;
5624                 }
5625                 else
5626                 {
5627                         if (t2 >= 0)
5628                         {
5629                                 node = node->children[0];
5630                                 continue;
5631                         }
5632                         side = 0;
5633                 }
5634
5635                 midf = t1 / (t1 - t2);
5636                 VectorLerp(p1, midf, p2, mid);
5637
5638                 // recurse both sides, front side first
5639                 // return 2 if empty is followed by solid (hit something)
5640                 // do not return 2 if both are solid or both empty,
5641                 // or if start is solid and end is empty
5642                 // as these degenerate cases usually indicate the eye is in solid and
5643                 // should see the target point anyway
5644                 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side    ], p1, mid);
5645                 if (ret != 0)
5646                         return ret;
5647                 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
5648                 if (ret != 1)
5649                         return ret;
5650                 return 2;
5651         }
5652         return ((mleaf_t *)node)->clusterindex < 0;
5653 }
5654
5655 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
5656 {
5657         if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
5658         {
5659                 trace_t trace;
5660                 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
5661                 return trace.fraction == 1;
5662         }
5663         else
5664         {
5665                 double tracestart[3], traceend[3];
5666                 VectorCopy(start, tracestart);
5667                 VectorCopy(end, traceend);
5668                 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
5669         }
5670 }
5671
5672 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
5673 {
5674         int i;
5675         mleaf_t *leaf;
5676         colbrushf_t *brush;
5677         // find which leaf the point is in
5678         while (node->plane)
5679                 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5680         // point trace the brushes
5681         leaf = (mleaf_t *)node;
5682         for (i = 0;i < leaf->numleafbrushes;i++)
5683         {
5684                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5685                 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5686                 {
5687                         brush->markframe = markframe;
5688                         Collision_TracePointBrushFloat(trace, point, brush);
5689                 }
5690         }
5691         // can't do point traces on curves (they have no thickness)
5692 }
5693
5694 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)
5695 {
5696         int i, startside, endside;
5697         float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5698         mleaf_t *leaf;
5699         msurface_t *surface;
5700         mplane_t *plane;
5701         colbrushf_t *brush;
5702         // walk the tree until we hit a leaf, recursing for any split cases
5703         while (node->plane)
5704         {
5705                 // abort if this part of the bsp tree can not be hit by this trace
5706 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5707 //                      return;
5708                 plane = node->plane;
5709                 // axial planes are much more common than non-axial, so an optimized
5710                 // axial case pays off here
5711                 if (plane->type < 3)
5712                 {
5713                         dist1 = start[plane->type] - plane->dist;
5714                         dist2 = end[plane->type] - plane->dist;
5715                 }
5716                 else
5717                 {
5718                         dist1 = DotProduct(start, plane->normal) - plane->dist;
5719                         dist2 = DotProduct(end, plane->normal) - plane->dist;
5720                 }
5721                 startside = dist1 < 0;
5722                 endside = dist2 < 0;
5723                 if (startside == endside)
5724                 {
5725                         // most of the time the line fragment is on one side of the plane
5726                         node = node->children[startside];
5727                 }
5728                 else
5729                 {
5730                         // line crosses node plane, split the line
5731                         dist1 = PlaneDiff(linestart, plane);
5732                         dist2 = PlaneDiff(lineend, plane);
5733                         midfrac = dist1 / (dist1 - dist2);
5734                         VectorLerp(linestart, midfrac, lineend, mid);
5735                         // take the near side first
5736                         Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5737                         // if we found an impact on the front side, don't waste time
5738                         // exploring the far side
5739                         if (midfrac <= trace->realfraction)
5740                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5741                         return;
5742                 }
5743         }
5744         // abort if this part of the bsp tree can not be hit by this trace
5745 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5746 //              return;
5747         // hit a leaf
5748         nodesegmentmins[0] = min(start[0], end[0]) - 1;
5749         nodesegmentmins[1] = min(start[1], end[1]) - 1;
5750         nodesegmentmins[2] = min(start[2], end[2]) - 1;
5751         nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5752         nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5753         nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5754         // line trace the brushes
5755         leaf = (mleaf_t *)node;
5756         for (i = 0;i < leaf->numleafbrushes;i++)
5757         {
5758                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5759                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5760                 {
5761                         brush->markframe = markframe;
5762                         Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5763                 }
5764         }
5765         // can't do point traces on curves (they have no thickness)
5766         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5767         {
5768                 // line trace the curves
5769                 for (i = 0;i < leaf->numleafsurfaces;i++)
5770                 {
5771                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5772                         if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5773                         {
5774                                 surface->deprecatedq3collisionmarkframe = markframe;
5775                                 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->deprecatedq3data_collisionelement3i, surface->deprecatedq3data_collisionvertex3f, surface->deprecatedq3num_collisionbboxstride, surface->deprecatedq3data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5776                         }
5777                 }
5778         }
5779 }
5780
5781 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)
5782 {
5783         int i;
5784         int sides;
5785         mleaf_t *leaf;
5786         colbrushf_t *brush;
5787         msurface_t *surface;
5788         mplane_t *plane;
5789         float nodesegmentmins[3], nodesegmentmaxs[3];
5790         // walk the tree until we hit a leaf, recursing for any split cases
5791         while (node->plane)
5792         {
5793                 // abort if this part of the bsp tree can not be hit by this trace
5794 //              if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5795 //                      return;
5796                 plane = node->plane;
5797                 // axial planes are much more common than non-axial, so an optimized
5798                 // axial case pays off here
5799                 if (plane->type < 3)
5800                 {
5801                         // this is an axial plane, compare bounding box directly to it and
5802                         // recurse sides accordingly
5803                         // recurse down node sides
5804                         // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5805                         //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5806                         //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5807                         sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5808                 }
5809                 else
5810                 {
5811                         // this is a non-axial plane, so check if the start and end boxes
5812                         // are both on one side of the plane to handle 'diagonal' cases
5813                         sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5814                 }
5815                 if (sides == 3)
5816                 {
5817                         // segment crosses plane
5818                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5819                         sides = 2;
5820                 }
5821                 // if sides == 0 then the trace itself is bogus (Not A Number values),
5822                 // in this case we simply pretend the trace hit nothing
5823                 if (sides == 0)
5824                         return; // ERROR: NAN bounding box!
5825                 // take whichever side the segment box is on
5826                 node = node->children[sides - 1];
5827         }
5828         // abort if this part of the bsp tree can not be hit by this trace
5829 //      if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5830 //              return;
5831         nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5832         nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5833         nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5834         nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5835         nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5836         nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5837         // hit a leaf
5838         leaf = (mleaf_t *)node;
5839         for (i = 0;i < leaf->numleafbrushes;i++)
5840         {
5841                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5842                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5843                 {
5844                         brush->markframe = markframe;
5845                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5846                 }
5847         }
5848         if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5849         {
5850                 for (i = 0;i < leaf->numleafsurfaces;i++)
5851                 {
5852                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5853                         if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5854                         {
5855                                 surface->deprecatedq3collisionmarkframe = markframe;
5856                                 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->deprecatedq3data_collisionelement3i, surface->deprecatedq3data_collisionvertex3f, surface->deprecatedq3num_collisionbboxstride, surface->deprecatedq3data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5857                         }
5858                 }
5859         }
5860 }
5861
5862 static int markframe = 0;
5863
5864 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)
5865 {
5866         int i;
5867         q3mbrush_t *brush;
5868         memset(trace, 0, sizeof(*trace));
5869         trace->fraction = 1;
5870         trace->realfraction = 1;
5871         trace->hitsupercontentsmask = hitsupercontentsmask;
5872         if (model->brush.submodel)
5873         {
5874                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5875                         if (brush->colbrushf)
5876                                 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5877         }
5878         else
5879                 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5880 }
5881
5882 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)
5883 {
5884         int i;
5885         float segmentmins[3], segmentmaxs[3];
5886         msurface_t *surface;
5887         q3mbrush_t *brush;
5888
5889         if (VectorCompare(start, end))
5890         {
5891                 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
5892                 return;
5893         }
5894
5895         memset(trace, 0, sizeof(*trace));
5896         trace->fraction = 1;
5897         trace->realfraction = 1;
5898         trace->hitsupercontentsmask = hitsupercontentsmask;
5899         segmentmins[0] = min(start[0], end[0]) - 1;
5900         segmentmins[1] = min(start[1], end[1]) - 1;
5901         segmentmins[2] = min(start[2], end[2]) - 1;
5902         segmentmaxs[0] = max(start[0], end[0]) + 1;
5903         segmentmaxs[1] = max(start[1], end[1]) + 1;
5904         segmentmaxs[2] = max(start[2], end[2]) + 1;
5905         if (model->brush.submodel)
5906         {
5907                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5908                         if (brush->colbrushf)
5909                                 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5910                 if (mod_q3bsp_curves_collisions.integer)
5911                         for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5912                                 if (surface->num_collisiontriangles)
5913                                         Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->deprecatedq3data_collisionelement3i, surface->deprecatedq3data_collisionvertex3f, surface->deprecatedq3num_collisionbboxstride, surface->deprecatedq3data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5914         }
5915         else
5916                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5917 }
5918
5919 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)
5920 {
5921         int i;
5922         float segmentmins[3], segmentmaxs[3];
5923         msurface_t *surface;
5924         q3mbrush_t *brush;
5925         colboxbrushf_t thisbrush_start, thisbrush_end;
5926         vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5927
5928         if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
5929         {
5930                 vec3_t shiftstart, shiftend;
5931                 VectorAdd(start, boxmins, shiftstart);
5932                 VectorAdd(end, boxmins, shiftend);
5933                 if (VectorCompare(start, end))
5934                         Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, shiftstart, hitsupercontentsmask);
5935                 else
5936                 {
5937                         Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, shiftstart, shiftend, hitsupercontentsmask);
5938                         VectorSubtract(trace->endpos, boxmins, trace->endpos);
5939                 }
5940                 return;
5941         }
5942
5943         // box trace, performed as brush trace
5944         memset(trace, 0, sizeof(*trace));
5945         trace->fraction = 1;
5946         trace->realfraction = 1;
5947         trace->hitsupercontentsmask = hitsupercontentsmask;
5948         segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5949         segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5950         segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5951         segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5952         segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5953         segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5954         VectorAdd(start, boxmins, boxstartmins);
5955         VectorAdd(start, boxmaxs, boxstartmaxs);
5956         VectorAdd(end, boxmins, boxendmins);
5957         VectorAdd(end, boxmaxs, boxendmaxs);
5958         Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
5959         Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
5960         if (model->brush.submodel)
5961         {
5962                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5963                         if (brush->colbrushf)
5964                                 Collision_TraceBrushBrushFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, brush->colbrushf, brush->colbrushf);
5965                 if (mod_q3bsp_curves_collisions.integer)
5966                         for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5967                                 if (surface->num_collisiontriangles)
5968                                         Collision_TraceBrushTriangleMeshFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, surface->num_collisiontriangles, surface->deprecatedq3data_collisionelement3i, surface->deprecatedq3data_collisionvertex3f, surface->deprecatedq3num_collisionbboxstride, surface->deprecatedq3data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5969         }
5970         else
5971                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, &thisbrush_start.brush, &thisbrush_end.brush, ++markframe, segmentmins, segmentmaxs);
5972 }
5973
5974 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5975 {
5976         int i;
5977         int supercontents = 0;
5978         q3mbrush_t *brush;
5979         // test if the point is inside each brush
5980         if (model->brush.submodel)
5981         {
5982                 // submodels are effectively one leaf
5983                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5984                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5985                                 supercontents |= brush->colbrushf->supercontents;
5986         }
5987         else
5988         {
5989                 mnode_t *node = model->brush.data_nodes;
5990                 mleaf_t *leaf;
5991                 // find which leaf the point is in
5992                 while (node->plane)
5993                         node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5994                 leaf = (mleaf_t *)node;
5995                 // now check the brushes in the leaf
5996                 for (i = 0;i < leaf->numleafbrushes;i++)
5997                 {
5998                         brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5999                         if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6000                                 supercontents |= brush->colbrushf->supercontents;
6001                 }
6002         }
6003         return supercontents;
6004 }
6005
6006 void Mod_MakeCollisionData(dp_model_t *model)
6007 {
6008         int j;
6009         int bihnumleafs;
6010         int bihmaxnodes;
6011         int brushindex;
6012         int triangleindex;
6013         int bihleafindex;
6014         int nummodelbrushes = model->nummodelbrushes;
6015         int nummodelsurfaces = model->nummodelsurfaces;
6016         const int *e;
6017         const int *collisionelement3i;
6018         const float *collisionvertex3f;
6019         bih_leaf_t *bihleafs;
6020         bih_node_t *bihnodes;
6021         int *temp_leafsort;
6022         int *temp_leafsortscratch;
6023         const msurface_t *surface;
6024         const q3mbrush_t *brush;
6025
6026         // find out how many BIH leaf nodes we need
6027         bihnumleafs = model->nummodelbrushes;
6028         surface = model->data_surfaces + model->firstmodelsurface;
6029         for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6030                 bihnumleafs += surface->num_collisiontriangles;
6031         bihmaxnodes = bihnumleafs >> 1;
6032
6033         // allocate the memory for the BIH leaf nodes
6034         bihleafs = Mem_Alloc(loadmodel->mempool, sizeof(bih_leaf_t) * bihnumleafs);
6035
6036         // add BIH leaf nodes for all the collision brushes
6037         bihleafindex = 0;
6038         for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
6039         {
6040                 bihleafs[bihleafindex].type = BIH_LEAF;
6041                 bihleafs[bihleafindex].textureindex = brush->texture - model->data_textures;
6042                 bihleafs[bihleafindex].itemindex = brushindex+model->firstmodelbrush;
6043                 VectorCopy(brush->colbrushf->mins, bihleafs[bihleafindex].mins);
6044                 VectorCopy(brush->colbrushf->mins, bihleafs[bihleafindex].maxs);
6045                 bihleafindex++;
6046         }
6047
6048         // add BIH leaf nodes for all the collision surfaces
6049         collisionelement3i = model->brush.data_collisionelement3i;
6050         collisionvertex3f = model->brush.data_collisionvertex3f;
6051         for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6052         {
6053                 e = collisionelement3i + surface->num_firstcollisiontriangle;
6054                 for (triangleindex = 0;triangleindex < surface->num_collisiontriangles;triangleindex++)
6055                 {
6056                         bihleafs[bihleafindex].type = BIH_LEAF + 1;
6057                         bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
6058                         bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firstcollisiontriangle;
6059                         bihleafs[bihleafindex].mins[0] = min(collisionvertex3f[3*e[0]+0], min(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0]));
6060                         bihleafs[bihleafindex].mins[1] = min(collisionvertex3f[3*e[0]+1], min(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1]));
6061                         bihleafs[bihleafindex].mins[2] = min(collisionvertex3f[3*e[0]+2], min(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2]));
6062                         bihleafs[bihleafindex].maxs[0] = max(collisionvertex3f[3*e[0]+0], max(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0]));
6063                         bihleafs[bihleafindex].maxs[1] = max(collisionvertex3f[3*e[0]+1], max(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1]));
6064                         bihleafs[bihleafindex].maxs[2] = max(collisionvertex3f[3*e[0]+2], max(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2]));
6065                         bihleafindex++;
6066                 }
6067         }
6068
6069         // allocate buffers for the produced and temporary data
6070         bihnodes = Mem_Alloc(loadmodel->mempool, sizeof(bih_node_t) * bihmaxnodes);
6071         temp_leafsort = Mem_Alloc(loadmodel->mempool, sizeof(int) * bihnumleafs * 2);
6072         temp_leafsortscratch = temp_leafsort + bihnumleafs;
6073
6074         // now build it
6075         BIH_Build(&model->collision_bih, bihnumleafs, bihleafs, bihmaxnodes, bihnodes, temp_leafsort, temp_leafsortscratch);
6076
6077         // we're done with the temporary data
6078         Mem_Free(temp_leafsort);
6079
6080         // resize the BIH nodes array if it over-allocated
6081         if (model->collision_bih.maxnodes > model->collision_bih.numnodes)
6082         {
6083                 model->collision_bih.maxnodes = model->collision_bih.numnodes;
6084                 model->collision_bih.nodes = Mem_Realloc(loadmodel->mempool, model->collision_bih.nodes, model->collision_bih.numnodes * sizeof(bih_node_t));
6085         }
6086 }
6087
6088 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
6089 {
6090         int supercontents = 0;
6091         if (nativecontents & CONTENTSQ3_SOLID)
6092                 supercontents |= SUPERCONTENTS_SOLID;
6093         if (nativecontents & CONTENTSQ3_WATER)
6094                 supercontents |= SUPERCONTENTS_WATER;
6095         if (nativecontents & CONTENTSQ3_SLIME)
6096                 supercontents |= SUPERCONTENTS_SLIME;
6097         if (nativecontents & CONTENTSQ3_LAVA)
6098                 supercontents |= SUPERCONTENTS_LAVA;
6099         if (nativecontents & CONTENTSQ3_BODY)
6100                 supercontents |= SUPERCONTENTS_BODY;
6101         if (nativecontents & CONTENTSQ3_CORPSE)
6102                 supercontents |= SUPERCONTENTS_CORPSE;
6103         if (nativecontents & CONTENTSQ3_NODROP)
6104                 supercontents |= SUPERCONTENTS_NODROP;
6105         if (nativecontents & CONTENTSQ3_PLAYERCLIP)
6106                 supercontents |= SUPERCONTENTS_PLAYERCLIP;
6107         if (nativecontents & CONTENTSQ3_MONSTERCLIP)
6108                 supercontents |= SUPERCONTENTS_MONSTERCLIP;
6109         if (nativecontents & CONTENTSQ3_DONOTENTER)
6110                 supercontents |= SUPERCONTENTS_DONOTENTER;
6111         if (nativecontents & CONTENTSQ3_BOTCLIP)
6112                 supercontents |= SUPERCONTENTS_BOTCLIP;
6113         if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
6114                 supercontents |= SUPERCONTENTS_OPAQUE;
6115         return supercontents;
6116 }
6117
6118 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
6119 {
6120         int nativecontents = 0;
6121         if (supercontents & SUPERCONTENTS_SOLID)
6122                 nativecontents |= CONTENTSQ3_SOLID;
6123         if (supercontents & SUPERCONTENTS_WATER)
6124                 nativecontents |= CONTENTSQ3_WATER;
6125         if (supercontents & SUPERCONTENTS_SLIME)
6126                 nativecontents |= CONTENTSQ3_SLIME;
6127         if (supercontents & SUPERCONTENTS_LAVA)
6128                 nativecontents |= CONTENTSQ3_LAVA;
6129         if (supercontents & SUPERCONTENTS_BODY)
6130                 nativecontents |= CONTENTSQ3_BODY;
6131         if (supercontents & SUPERCONTENTS_CORPSE)
6132                 nativecontents |= CONTENTSQ3_CORPSE;
6133         if (supercontents & SUPERCONTENTS_NODROP)
6134                 nativecontents |= CONTENTSQ3_NODROP;
6135         if (supercontents & SUPERCONTENTS_PLAYERCLIP)
6136                 nativecontents |= CONTENTSQ3_PLAYERCLIP;
6137         if (supercontents & SUPERCONTENTS_MONSTERCLIP)
6138                 nativecontents |= CONTENTSQ3_MONSTERCLIP;
6139         if (supercontents & SUPERCONTENTS_DONOTENTER)
6140                 nativecontents |= CONTENTSQ3_DONOTENTER;
6141         if (supercontents & SUPERCONTENTS_BOTCLIP)
6142                 nativecontents |= CONTENTSQ3_BOTCLIP;
6143         if (!(supercontents & SUPERCONTENTS_OPAQUE))
6144                 nativecontents |= CONTENTSQ3_TRANSLUCENT;
6145         return nativecontents;
6146 }
6147
6148 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
6149 {
6150         int numleafs;
6151         while (node->plane)
6152         {
6153                 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
6154                 node = node->children[1];
6155         }
6156         numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
6157         if (loadmodel->brush.num_leafs < numleafs)
6158                 loadmodel->brush.num_leafs = numleafs;
6159 }
6160
6161 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6162 {
6163         int i, j, numshadowmeshtriangles, lumps;
6164         q3dheader_t *header;
6165         float corner[3], yawradius, modelradius;
6166         msurface_t *surface;
6167
6168         mod->modeldatatypestring = "Q3BSP";
6169
6170         mod->type = mod_brushq3;
6171         mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
6172         mod->numskins = 1;
6173
6174         header = (q3dheader_t *)buffer;
6175         if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
6176                 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
6177
6178         i = LittleLong(header->version);
6179         if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
6180                 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
6181
6182         mod->soundfromcenter = true;
6183         mod->TraceBox = Mod_Q3BSP_TraceBox;
6184         mod->TraceLine = Mod_Q3BSP_TraceLine;
6185         mod->TracePoint = Mod_Q3BSP_TracePoint;
6186         mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
6187         mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
6188         mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
6189         mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
6190         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
6191         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
6192         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
6193         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
6194         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
6195         mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
6196         mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
6197         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
6198         mod->brush.AmbientSoundLevelsForPoint = NULL;
6199         mod->brush.RoundUpToHullSize = NULL;
6200         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
6201         mod->Draw = R_Q1BSP_Draw;
6202         mod->DrawDepth = R_Q1BSP_DrawDepth;
6203         mod->DrawDebug = R_Q1BSP_DrawDebug;
6204         mod->DrawPrepass = R_Q1BSP_DrawPrepass;
6205         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
6206         mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6207         mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6208         mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6209         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6210         mod->DrawLight = R_Q1BSP_DrawLight;
6211
6212         mod_base = (unsigned char *)header;
6213
6214         // swap all the lumps
6215         header->ident = LittleLong(header->ident);
6216         header->version = LittleLong(header->version);
6217         lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
6218         for (i = 0;i < lumps;i++)
6219         {
6220                 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
6221                 if((char *) bufferend < (char *) buffer + j)
6222                         Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
6223                 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
6224                 if((char *) bufferend < (char *) buffer + j)
6225                         Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
6226         }
6227         /*
6228          * NO, do NOT clear them!
6229          * they contain actual data referenced by other stuff.
6230          * Instead, before using the advertisements lump, check header->versio
6231          * again!
6232          * Sorry, but otherwise it breaks memory of the first lump.
6233         for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
6234         {
6235                 header->lumps[i].fileofs = 0;
6236                 header->lumps[i].filelen = 0;
6237         }
6238         */
6239
6240         mod->brush.qw_md4sum = 0;
6241         mod->brush.qw_md4sum2 = 0;
6242         for (i = 0;i < lumps;i++)
6243         {
6244                 if (i == Q3LUMP_ENTITIES)
6245                         continue;
6246                 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6247                 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
6248                         continue;
6249                 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6250
6251                 // all this checksumming can take a while, so let's send keepalives here too
6252                 CL_KeepaliveMessage(false);
6253         }
6254
6255         Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
6256         Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
6257         Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
6258         if (header->version == Q3BSPVERSION_IG)
6259                 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
6260         else
6261                 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
6262         Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
6263         Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
6264         Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
6265         Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
6266         Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
6267         Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
6268         Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
6269         Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
6270         Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
6271         Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
6272         Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
6273         Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
6274         Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
6275         loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
6276
6277         // the MakePortals code works fine on the q3bsp data as well
6278         Mod_Q1BSP_MakePortals();
6279
6280         // FIXME: shader alpha should replace r_wateralpha support in q3bsp
6281         loadmodel->brush.supportwateralpha = true;
6282
6283         // make a single combined shadow mesh to allow optimized shadow volume creation
6284         numshadowmeshtriangles = 0;
6285         if (cls.state != ca_dedicated)
6286         {
6287                 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6288                 {
6289                         surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
6290                         numshadowmeshtriangles += surface->num_triangles;
6291                 }
6292                 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
6293                 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6294                         if (surface->num_triangles > 0)
6295                                 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));
6296                 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
6297                 if (loadmodel->brush.shadowmesh)
6298                         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
6299         }
6300
6301         loadmodel->brush.num_leafs = 0;
6302         Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
6303
6304         if (loadmodel->brush.numsubmodels)
6305                 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
6306
6307         mod = loadmodel;
6308         for (i = 0;i < loadmodel->brush.numsubmodels;i++)
6309         {
6310                 if (i > 0)
6311                 {
6312                         char name[10];
6313                         // duplicate the basic information
6314                         dpsnprintf(name, sizeof(name), "*%i", i);
6315                         mod = Mod_FindName(name, loadmodel->name);
6316                         // copy the base model to this one
6317                         *mod = *loadmodel;
6318                         // rename the clone back to its proper name
6319                         strlcpy(mod->name, name, sizeof(mod->name));
6320                         mod->brush.parentmodel = loadmodel;
6321                         // textures and memory belong to the main model
6322                         mod->texturepool = NULL;
6323                         mod->mempool = NULL;
6324                         mod->brush.GetPVS = NULL;
6325                         mod->brush.FatPVS = NULL;
6326                         mod->brush.BoxTouchingPVS = NULL;
6327                         mod->brush.BoxTouchingLeafPVS = NULL;
6328                         mod->brush.BoxTouchingVisibleLeafs = NULL;
6329                         mod->brush.FindBoxClusters = NULL;
6330                         mod->brush.LightPoint = NULL;
6331                         mod->brush.AmbientSoundLevelsForPoint = NULL;
6332                 }
6333                 mod->brush.submodel = i;
6334                 if (loadmodel->brush.submodels)
6335                         loadmodel->brush.submodels[i] = mod;
6336
6337                 // make the model surface list (used by shadowing/lighting)
6338                 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
6339                 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
6340                 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
6341                 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
6342                 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
6343                 Mod_MakeSortedSurfaces(mod);
6344
6345                 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
6346                 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
6347                 // enlarge the bounding box to enclose all geometry of this model,
6348                 // because q3map2 sometimes lies (mostly to affect the lightgrid),
6349                 // which can in turn mess up the farclip (as well as culling when
6350                 // outside the level - an unimportant concern)
6351
6352                 //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]);
6353                 for (j = 0;j < mod->nummodelsurfaces;j++)
6354                 {
6355                         const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
6356                         const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
6357                         int k;
6358                         if (!surface->num_vertices)
6359                                 continue;
6360                         for (k = 0;k < surface->num_vertices;k++, v += 3)
6361                         {
6362                                 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
6363                                 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
6364                                 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
6365                                 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
6366                                 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
6367                                 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
6368                         }
6369                 }
6370                 //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]);
6371                 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
6372                 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
6373                 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
6374                 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
6375                 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
6376                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
6377                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
6378                 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
6379                 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
6380                 mod->yawmins[2] = mod->normalmins[2];
6381                 mod->yawmaxs[2] = mod->normalmaxs[2];
6382                 mod->radius = modelradius;
6383                 mod->radius2 = modelradius * modelradius;
6384
6385                 // this gets altered below if sky or water is used
6386                 mod->DrawSky = NULL;
6387                 mod->DrawAddWaterPlanes = NULL;
6388
6389                 for (j = 0;j < mod->nummodelsurfaces;j++)
6390                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
6391                                 break;
6392                 if (j < mod->nummodelsurfaces)
6393                         mod->DrawSky = R_Q1BSP_DrawSky;
6394
6395                 for (j = 0;j < mod->nummodelsurfaces;j++)
6396                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
6397                                 break;
6398                 if (j < mod->nummodelsurfaces)
6399                         mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
6400
6401                 Mod_MakeCollisionData(mod);
6402
6403                 // generate VBOs and other shared data before cloning submodels
6404                 if (i == 0)
6405                         Mod_BuildVBOs();
6406         }
6407
6408         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);
6409 }
6410
6411 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6412 {
6413         int i = LittleLong(((int *)buffer)[1]);
6414         if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
6415                 Mod_Q3BSP_Load(mod,buffer, bufferend);
6416         else if (i == Q2BSPVERSION)
6417                 Mod_Q2BSP_Load(mod,buffer, bufferend);
6418         else
6419                 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
6420 }
6421
6422 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6423 {
6424         Host_Error("Mod_MAP_Load: not yet implemented");
6425 }
6426
6427 #define OBJASMODEL
6428
6429 #ifdef OBJASMODEL
6430 typedef struct objvertex_s
6431 {
6432         int nextindex;
6433         int textureindex;
6434         float v[3];
6435         float vt[2];
6436         float vn[3];
6437 }
6438 objvertex_t;
6439
6440 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
6441 {
6442         const char *textbase = (char *)buffer, *text = textbase;
6443         char *s;
6444         char *argv[512];
6445         char line[1024];
6446         char materialname[MAX_QPATH];
6447         int i, j, numvertices, firstvertex, firsttriangle, elementindex, vertexindex, numsurfaces, surfacevertices, surfacetriangles, surfaceelements;
6448         int index1, index2, index3;
6449         objvertex_t vfirst, vprev, vcurrent;
6450         int argc;
6451         int linelen;
6452         int numtriangles = 0;
6453         int maxtriangles = 0;
6454         objvertex_t *vertices = NULL;
6455         int linenumber = 0;
6456         int maxtextures = 0, numtextures = 0, textureindex = 0;
6457         int maxv = 0, numv = 1;
6458         int maxvt = 0, numvt = 1;
6459         int maxvn = 0, numvn = 1;
6460         char *texturenames = NULL;
6461         float dist, modelradius, modelyawradius;
6462         float *v = NULL;
6463         float *vt = NULL;
6464         float *vn = NULL;
6465         float mins[3];
6466         float maxs[3];
6467         objvertex_t *thisvertex = NULL;
6468         int vertexhashindex;
6469         int *vertexhashtable = NULL;
6470         objvertex_t *vertexhashdata = NULL;
6471         objvertex_t *vdata = NULL;
6472         int vertexhashsize = 0;
6473         int vertexhashcount = 0;
6474         skinfile_t *skinfiles = NULL;
6475         unsigned char *data = NULL;
6476
6477         memset(&vfirst, 0, sizeof(vfirst));
6478         memset(&vprev, 0, sizeof(vprev));
6479         memset(&vcurrent, 0, sizeof(vcurrent));
6480
6481         dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
6482
6483         loadmodel->modeldatatypestring = "OBJ";
6484
6485         loadmodel->type = mod_obj;
6486         loadmodel->soundfromcenter = true;
6487         loadmodel->TraceBox = NULL;
6488         loadmodel->TraceLine = NULL;
6489         loadmodel->TracePoint = NULL;
6490         loadmodel->PointSuperContents = NULL;
6491         loadmodel->brush.TraceLineOfSight = NULL;
6492         loadmodel->brush.SuperContentsFromNativeContents = NULL;
6493         loadmodel->brush.NativeContentsFromSuperContents = NULL;
6494         loadmodel->brush.GetPVS = NULL;
6495         loadmodel->brush.FatPVS = NULL;
6496         loadmodel->brush.BoxTouchingPVS = NULL;
6497         loadmodel->brush.BoxTouchingLeafPVS = NULL;
6498         loadmodel->brush.BoxTouchingVisibleLeafs = NULL;
6499         loadmodel->brush.FindBoxClusters = NULL;
6500         loadmodel->brush.LightPoint = NULL;
6501         loadmodel->brush.FindNonSolidLocation = NULL;
6502         loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
6503         loadmodel->brush.RoundUpToHullSize = NULL;
6504         loadmodel->brush.PointInLeaf = NULL;
6505         loadmodel->Draw = R_Q1BSP_Draw;
6506         loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
6507         loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
6508         loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
6509         loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
6510         loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6511         loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6512         loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6513         loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6514         loadmodel->DrawLight = R_Q1BSP_DrawLight;
6515
6516         skinfiles = Mod_LoadSkinFiles();
6517         if (loadmodel->numskins < 1)
6518                 loadmodel->numskins = 1;
6519
6520         // make skinscenes for the skins (no groups)
6521         loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
6522         for (i = 0;i < loadmodel->numskins;i++)
6523         {
6524                 loadmodel->skinscenes[i].firstframe = i;
6525                 loadmodel->skinscenes[i].framecount = 1;
6526                 loadmodel->skinscenes[i].loop = true;
6527                 loadmodel->skinscenes[i].framerate = 10;
6528         }
6529
6530         VectorClear(mins);
6531         VectorClear(maxs);
6532
6533         // parse the OBJ text now
6534         for(;;)
6535         {
6536                 if (!*text)
6537                         break;
6538                 linenumber++;
6539                 linelen = 0;
6540                 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
6541                         line[linelen] = text[linelen];
6542                 line[linelen] = 0;
6543                 for (argc = 0;argc < 4;argc++)
6544                         argv[argc] = "";
6545                 argc = 0;
6546                 s = line;
6547                 while (*s == ' ' || *s == '\t')
6548                         s++;
6549                 while (*s)
6550                 {
6551                         argv[argc++] = s;
6552                         while (*s > ' ')
6553                                 s++;
6554                         if (!*s)
6555                                 break;
6556                         *s++ = 0;
6557                         while (*s == ' ' || *s == '\t')
6558                                 s++;
6559                 }
6560                 text += linelen;
6561                 if (*text == '\r')
6562                         text++;
6563                 if (*text == '\n')
6564                         text++;
6565                 if (!argc)
6566                         continue;
6567                 if (argv[0][0] == '#')
6568                         continue;
6569                 if (!strcmp(argv[0], "v"))
6570                 {
6571                         if (maxv <= numv)
6572                         {
6573                                 maxv = max(maxv * 2, 1024);
6574                                 v = (float *)Mem_Realloc(tempmempool, v, maxv * sizeof(float[3]));
6575                         }
6576                         v[numv*3+0] = atof(argv[1]);
6577                         v[numv*3+2] = atof(argv[2]);
6578                         v[numv*3+1] = atof(argv[3]);
6579                         numv++;
6580                 }
6581                 else if (!strcmp(argv[0], "vt"))
6582                 {
6583                         if (maxvt <= numvt)
6584                         {
6585                                 maxvt = max(maxvt * 2, 1024);
6586                                 vt = (float *)Mem_Realloc(tempmempool, vt, maxvt * sizeof(float[2]));
6587                         }
6588                         vt[numvt*2+0] = atof(argv[1]);
6589                         vt[numvt*2+1] = 1-atof(argv[2]);
6590                         numvt++;
6591                 }
6592                 else if (!strcmp(argv[0], "vn"))
6593                 {
6594                         if (maxvn <= numvn)
6595                         {
6596                                 maxvn = max(maxvn * 2, 1024);
6597                                 vn = (float *)Mem_Realloc(tempmempool, vn, maxvn * sizeof(float[3]));
6598                         }
6599                         vn[numvn*3+0] = atof(argv[1]);
6600                         vn[numvn*3+2] = atof(argv[2]);
6601                         vn[numvn*3+1] = atof(argv[3]);
6602                         numvn++;
6603                 }
6604                 else if (!strcmp(argv[0], "f"))
6605                 {
6606                         if (!numtextures)
6607                         {
6608                                 if (maxtextures <= numtextures)
6609                                 {
6610                                         maxtextures = max(maxtextures * 2, 256);
6611                                         texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
6612                                 }
6613                                 textureindex = numtextures++;
6614                                 strlcpy(texturenames + textureindex*MAX_QPATH, loadmodel->name, MAX_QPATH);
6615                         }
6616                         for (j = 1;j < argc;j++)
6617                         {
6618                                 index1 = atoi(argv[j]);
6619                                 while(argv[j][0] && argv[j][0] != '/')
6620                                         argv[j]++;
6621                                 if (argv[j][0])
6622                                         argv[j]++;
6623                                 index2 = atoi(argv[j]);
6624                                 while(argv[j][0] && argv[j][0] != '/')
6625                                         argv[j]++;
6626                                 if (argv[j][0])
6627                                         argv[j]++;
6628                                 index3 = atoi(argv[j]);
6629                                 // negative refers to a recent vertex
6630                                 // zero means not specified
6631                                 // positive means an absolute vertex index
6632                                 if (index1 < 0)
6633                                         index1 = numv - index1;
6634                                 if (index2 < 0)
6635                                         index2 = numvt - index2;
6636                                 if (index3 < 0)
6637                                         index3 = numvn - index3;
6638                                 vcurrent.nextindex = -1;
6639                                 vcurrent.textureindex = textureindex;
6640                                 VectorCopy(v + 3*index1, vcurrent.v);
6641                                 Vector2Copy(vt + 2*index2, vcurrent.vt);
6642                                 VectorCopy(vn + 3*index3, vcurrent.vn);
6643                                 if (numtriangles == 0)
6644                                 {
6645                                         VectorCopy(vcurrent.v, mins);
6646                                         VectorCopy(vcurrent.v, maxs);
6647                                 }
6648                                 else
6649                                 {
6650                                         mins[0] = min(mins[0], vcurrent.v[0]);
6651                                         mins[1] = min(mins[1], vcurrent.v[1]);
6652                                         mins[2] = min(mins[2], vcurrent.v[2]);
6653                                         maxs[0] = max(maxs[0], vcurrent.v[0]);
6654                                         maxs[1] = max(maxs[1], vcurrent.v[1]);
6655                                         maxs[2] = max(maxs[2], vcurrent.v[2]);
6656                                 }
6657                                 if (j == 1)
6658                                         vfirst = vcurrent;
6659                                 else if (j >= 3)
6660                                 {
6661                                         if (maxtriangles <= numtriangles)
6662                                         {
6663                                                 maxtriangles = max(maxtriangles * 2, 32768);
6664                                                 vertices = (objvertex_t*)Mem_Realloc(loadmodel->mempool, vertices, maxtriangles * sizeof(objvertex_t[3]));
6665                                         }
6666                                         vertices[numtriangles*3+0] = vfirst;
6667                                         vertices[numtriangles*3+1] = vprev;
6668                                         vertices[numtriangles*3+2] = vcurrent;
6669                                         numtriangles++;
6670                                 }
6671                                 vprev = vcurrent;
6672                         }
6673                 }
6674                 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
6675                         ;
6676                 else if (!strcmp(argv[0], "usemtl"))
6677                 {
6678                         for (i = 0;i < numtextures;i++)
6679                                 if (!strcmp(texturenames+i*MAX_QPATH, argv[1]))
6680                                         break;
6681                         if (i < numtextures)
6682                                 textureindex = i;
6683                         else
6684                         {
6685                                 if (maxtextures <= numtextures)
6686                                 {
6687                                         maxtextures = max(maxtextures * 2, 256);
6688                                         texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
6689                                 }
6690                                 textureindex = numtextures++;
6691                                 strlcpy(texturenames + textureindex*MAX_QPATH, argv[1], MAX_QPATH);
6692                         }
6693                 }
6694         }
6695
6696         // now that we have the OBJ data loaded as-is, we can convert it
6697
6698         // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
6699         VectorCopy(mins, loadmodel->normalmins);
6700         VectorCopy(maxs, loadmodel->normalmaxs);
6701         dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
6702         modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
6703         modelyawradius = dist*dist+modelyawradius*modelyawradius;
6704         modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
6705         modelradius = modelyawradius + modelradius * modelradius;
6706         modelyawradius = sqrt(modelyawradius);
6707         modelradius = sqrt(modelradius);
6708         loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
6709         loadmodel->yawmins[2] = loadmodel->normalmins[2];
6710         loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] =  modelyawradius;
6711         loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
6712         loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
6713         loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] =  modelradius;
6714         loadmodel->radius = modelradius;
6715         loadmodel->radius2 = modelradius * modelradius;
6716
6717         // allocate storage for triangles
6718         loadmodel->num_surfaces = loadmodel->nummodelsurfaces = numsurfaces = numtextures;
6719         loadmodel->surfmesh.data_element3i = Mem_Alloc(loadmodel->mempool, numtriangles * sizeof(int[3]));
6720         loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * sizeof(msurface_t));
6721         // allocate vertex hash structures to build an optimal vertex subset
6722         vertexhashsize = numtriangles*2;
6723         vertexhashtable = Mem_Alloc(loadmodel->mempool, sizeof(int) * vertexhashsize);
6724         memset(vertexhashtable, 0xFF, sizeof(int) * vertexhashsize);
6725         vertexhashdata = Mem_Alloc(loadmodel->mempool, sizeof(*vertexhashdata) * numtriangles*3);
6726         vertexhashcount = 0;
6727
6728         // gather surface stats for assigning vertex/triangle ranges
6729         firstvertex = 0;
6730         firsttriangle = 0;
6731         elementindex = 0;
6732         for (textureindex = 0;textureindex < numtextures;textureindex++)
6733         {
6734                 msurface_t *surface = loadmodel->data_surfaces + textureindex;
6735                 // copy the mins/maxs of the model backwards so that the first vertex
6736                 // added will set the surface bounds to a point
6737                 VectorCopy(loadmodel->normalmaxs, surface->mins);
6738                 VectorCopy(loadmodel->normalmins, surface->maxs);
6739                 surfacevertices = 0;
6740                 surfaceelements = 0;
6741                 for (vertexindex = 0;vertexindex < numtriangles*3;vertexindex++)
6742                 {
6743                         thisvertex = vertices + vertexindex;
6744                         if (thisvertex->textureindex != textureindex)
6745                                 continue;
6746                         surface->mins[0] = min(surface->mins[0], thisvertex->v[0]);
6747                         surface->mins[1] = min(surface->mins[1], thisvertex->v[1]);
6748                         surface->mins[2] = min(surface->mins[2], thisvertex->v[2]);
6749                         surface->maxs[0] = max(surface->maxs[0], thisvertex->v[0]);
6750                         surface->maxs[1] = max(surface->maxs[1], thisvertex->v[1]);
6751                         surface->maxs[2] = max(surface->maxs[2], thisvertex->v[2]);
6752                         vertexhashindex = (unsigned int)(thisvertex->v[0] * 3571 + thisvertex->v[0] * 1777 + thisvertex->v[0] * 457) % (unsigned int)vertexhashsize;
6753                         for (i = vertexhashtable[vertexhashindex];i >= 0;i = vertexhashdata[i].nextindex)
6754                         {
6755                                 vdata = vertexhashdata + i;
6756                                 if (vdata->textureindex == thisvertex->textureindex && VectorCompare(thisvertex->v, vdata->v) && VectorCompare(thisvertex->vn, vdata->vn) && Vector2Compare(thisvertex->vt, vdata->vt))
6757                                         break;
6758                         }
6759                         if (i < 0)
6760                         {
6761                                 i = vertexhashcount++;
6762                                 vdata = vertexhashdata + i;
6763                                 *vdata = *thisvertex;
6764                                 vdata->nextindex = vertexhashtable[vertexhashindex];
6765                                 vertexhashtable[vertexhashindex] = i;
6766                                 surfacevertices++;
6767                         }
6768                         loadmodel->surfmesh.data_element3i[elementindex++] = i;
6769                         surfaceelements++;
6770                 }
6771                 surfacetriangles = surfaceelements / 3;
6772                 surface->num_vertices = surfacevertices;
6773                 surface->num_triangles = surfacetriangles;
6774                 surface->num_firstvertex = firstvertex;
6775                 surface->num_firsttriangle = firsttriangle;
6776                 firstvertex += surface->num_vertices;
6777                 firsttriangle += surface->num_triangles;
6778         }
6779         numvertices = firstvertex;
6780
6781         // allocate storage for final mesh data
6782         loadmodel->num_textures = numtextures * loadmodel->numskins;
6783         loadmodel->num_texturesperskin = numtextures;
6784         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]));
6785         loadmodel->sortedmodelsurfaces = (int *)data;data += numsurfaces * sizeof(int);
6786         loadmodel->data_textures = (texture_t *)data;data += numsurfaces * loadmodel->numskins * sizeof(texture_t);
6787         loadmodel->surfmesh.num_vertices = numvertices;
6788         loadmodel->surfmesh.num_triangles = numtriangles;
6789         loadmodel->surfmesh.data_neighbor3i = (int *)data;data += numtriangles * sizeof(int[3]);
6790         loadmodel->surfmesh.data_vertex3f = (float *)data;data += numvertices * sizeof(float[3]);
6791         loadmodel->surfmesh.data_svector3f = (float *)data;data += numvertices * sizeof(float[3]);
6792         loadmodel->surfmesh.data_tvector3f = (float *)data;data += numvertices * sizeof(float[3]);
6793         loadmodel->surfmesh.data_normal3f = (float *)data;data += numvertices * sizeof(float[3]);
6794         loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += numvertices * sizeof(float[2]);
6795         if (loadmodel->surfmesh.num_vertices <= 65536)
6796                 loadmodel->surfmesh.data_element3s = (unsigned short *)data;data += loadmodel->surfmesh.num_triangles * sizeof(unsigned short[3]);
6797
6798         for (j = 0;j < loadmodel->surfmesh.num_vertices;j++)
6799         {
6800                 VectorCopy(vertexhashdata[j].v, loadmodel->surfmesh.data_vertex3f + 3*j);
6801                 VectorCopy(vertexhashdata[j].vn, loadmodel->surfmesh.data_normal3f + 3*j);
6802                 Vector2Copy(vertexhashdata[j].vt, loadmodel->surfmesh.data_texcoordtexture2f + 2*j);
6803         }
6804
6805         // load the textures
6806         for (textureindex = 0;textureindex < numtextures;textureindex++)
6807                 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures + textureindex, skinfiles, texturenames + textureindex*MAX_QPATH, texturenames + textureindex*MAX_QPATH);
6808         Mod_FreeSkinFiles(skinfiles);
6809
6810         // set the surface textures
6811         for (textureindex = 0;textureindex < numtextures;textureindex++)
6812         {
6813                 msurface_t *surface = loadmodel->data_surfaces + textureindex;
6814                 surface->texture = loadmodel->data_textures + textureindex;
6815         }
6816
6817         // free data
6818         Mem_Free(vertices);
6819         Mem_Free(texturenames);
6820         Mem_Free(v);
6821         Mem_Free(vt);
6822         Mem_Free(vn);
6823         Mem_Free(vertexhashtable);
6824         Mem_Free(vertexhashdata);
6825
6826         // compute all the mesh information that was not loaded from the file
6827         Mod_MakeSortedSurfaces(loadmodel);
6828         if (loadmodel->surfmesh.data_element3s)
6829                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
6830                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
6831         Mod_ValidateElements(loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles, 0, loadmodel->surfmesh.num_vertices, __FILE__, __LINE__);
6832         // generate normals if the file did not have them
6833         if (!VectorLength2(loadmodel->surfmesh.data_normal3f))
6834                 Mod_BuildNormals(0, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.data_normal3f, true);
6835         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);
6836         Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
6837 }
6838
6839
6840
6841
6842
6843
6844
6845
6846
6847
6848 #else // OBJASMODEL
6849
6850 #ifdef OBJWORKS
6851 typedef struct objvertex_s
6852 {
6853         float v[3];
6854         float vt[2];
6855         float vn[3];
6856 }
6857 objvertex_t;
6858
6859 typedef struct objtriangle_s
6860 {
6861         objvertex_t vertex[3];
6862         int textureindex;
6863         // these fields are used only in conversion to surfaces
6864         int axis;
6865         int surfaceindex;
6866         int surfacevertexindex[3];
6867         float edgeplane[3][4];
6868 }
6869 objtriangle_t;
6870
6871 typedef objnode_s
6872 {
6873         struct objnode_s *children[2];
6874         struct objnode_s *parent;
6875         objtriangle_t *triangles;
6876         float normal[3];
6877         float dist;
6878         float mins[3];
6879         float maxs[3];
6880         int numtriangles;
6881 }
6882 objnode_t;
6883
6884 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)
6885 {
6886         int i, j;
6887         float normal[3];
6888         float dist;
6889         int score;
6890         float bestnormal[3];
6891         float bestdist;
6892         int bestscore;
6893         float mins[3];
6894         float maxs[3];
6895         int numfronttriangles;
6896         int numbacktriangles;
6897         int count_front;
6898         int count_back;
6899         int count_both;
6900         int count_on;
6901         float outfrontpoints[5][3];
6902         float outbackpoints[5][3];
6903         int neededfrontpoints;
6904         int neededbackpoints;
6905         int countonpoints;
6906         objnode_t *node;
6907
6908         node = (objnode_t *)Mem_ExpandableArray_AllocRecord(array);
6909         node->parent = parent;
6910         if (numtriangles)
6911         {
6912                 VectorCopy(triangles[0].vertex[0].v, mins);
6913                 VectorCopy(triangles[0].vertex[0].v, maxs);
6914         }
6915         else if (parent && parent->children[0] == node)
6916         {
6917                 VectorCopy(parent->mins, mins);
6918                 Vectorcopy(parent->maxs, maxs);
6919         }
6920         else if (parent && parent->children[1] == node)
6921         {
6922                 VectorCopy(parent->mins, mins);
6923                 Vectorcopy(parent->maxs, maxs);
6924         }
6925         else
6926         {
6927                 VectorClear(mins);
6928                 VectorClear(maxs);
6929         }
6930         for (i = 0;i < numtriangles;i++)
6931         {
6932                 for (j = 0;j < 3;j++)
6933                 {
6934                         mins[0] = min(mins[0], triangles[i].vertex[j].v[0]);
6935                         mins[1] = min(mins[1], triangles[i].vertex[j].v[1]);
6936                         mins[2] = min(mins[2], triangles[i].vertex[j].v[2]);
6937                         maxs[0] = max(maxs[0], triangles[i].vertex[j].v[0]);
6938                         maxs[1] = max(maxs[1], triangles[i].vertex[j].v[1]);
6939                         maxs[2] = max(maxs[2], triangles[i].vertex[j].v[2]);
6940                 }
6941         }
6942         VectorCopy(mins, node->mins);
6943         VectorCopy(maxs, node->maxs);
6944         if (numtriangles <= mod_obj_leaftriangles.integer)
6945         {
6946                 // create a leaf
6947                 loadmodel->brush.num_leafs++;
6948                 node->triangles = triangles;
6949                 node->numtriangles = numtriangles;
6950                 return node;
6951         }
6952
6953         // create a node
6954         loadmodel->brush.num_nodes++;
6955         // pick a splitting plane from the various choices available to us...
6956         // early splits simply halve the interval
6957         bestscore = 0;
6958         VectorClear(bestnormal);
6959         bestdist = 0;
6960         if (numtriangles <= mod_obj_splitterlimit.integer)
6961                 limit = numtriangles;
6962         else
6963                 limit = 0;
6964         for (i = -3;i < limit;i++)
6965         {
6966                 if (i < 0)
6967                 {
6968                         // first we try 3 axial splits (kdtree-like)
6969                         j = i + 3;
6970                         VectorClear(normal);
6971                         normal[j] = 1;
6972                         dist = (mins[j] + maxs[j]) * 0.5f;
6973                 }
6974                 else
6975                 {
6976                         // then we try each triangle plane
6977                         TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
6978                         VectorNormalize(normal);
6979                         dist = DotProduct(normal, triangles[i].vertex[0].v);
6980                         // use positive axial values whenever possible
6981                         if (normal[0] == -1)
6982                                 normal[0] = 1;
6983                         if (normal[1] == -1)
6984                                 normal[1] = 1;
6985                         if (normal[2] == -1)
6986                                 normal[2] = 1;
6987                         // skip planes that match the current best
6988                         if (VectorCompare(normal, bestnormal) && dist == bestdist)
6989                                 continue;
6990                 }
6991                 count_on = 0;
6992                 count_front = 0;
6993                 count_back = 0;
6994                 count_both = 0;
6995                 for (j = 0;j < numtriangles;j++)
6996                 {
6997                         dists[0] = DotProduct(normal, triangles[j].vertex[0].v) - dist;
6998                         dists[1] = DotProduct(normal, triangles[j].vertex[1].v) - dist;
6999                         dists[2] = DotProduct(normal, triangles[j].vertex[2].v) - dist;
7000                         if (dists[0] < -DIST_EPSILON || dists[1] < -DIST_EPSILON || dists[2] < -DIST_EPSILON)
7001                         {
7002                                 if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
7003                                         count_both++;
7004                                 else
7005                                         count_back++;
7006                         }
7007                         else if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
7008                                 count_front++;
7009                         else
7010                                 count_on++;
7011                 }
7012                 // score is supposed to:
7013                 // prefer axial splits
7014                 // prefer evenly dividing the input triangles
7015                 // prefer triangles on the plane
7016                 // avoid triangles crossing the plane
7017                 score = count_on*count_on - count_both*count_both + min(count_front, count_back)*(count_front+count_back);
7018                 if (normal[0] == 1 || normal[1] == 1 || normal[2] == 1)
7019                         score *= 2;
7020                 if (i == -3 || bestscore < score)
7021                 {
7022                         VectorCopy(normal, bestnormal);
7023                         bestdist = dist;
7024                         bestscore = score;
7025                 }
7026         }
7027
7028         // now we have chosen an optimal split plane...
7029
7030         // divide triangles by the splitting plane
7031         numfronttriangles = 0;
7032         numbacktriangles = 0;
7033         for (i = 0;i < numtriangles;i++)
7034         {
7035                 neededfrontpoints = 0;
7036                 neededbackpoints = 0;
7037                 countonpoints = 0;
7038                 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);
7039                 if (countonpoints > 1)
7040                 {
7041                         // triangle lies on plane, assign it to one child only
7042                         TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
7043                         if (DotProduct(bestnormal, normal) >= 0)
7044                         {
7045                                 // assign to front side child
7046                                 obj_fronttriangles[numfronttriangles++] = triangles[i];
7047                         }
7048                         else
7049                         {
7050                                 // assign to back side child
7051                                 obj_backtriangles[numbacktriangles++] = triangles[i];
7052                         }
7053                 }
7054                 else
7055                 {
7056                         // convert clipped polygons to triangles
7057                         for (j = 0;j < neededfrontpoints-2;j++)
7058                         {
7059                                 obj_fronttriangles[numfronttriangles] = triangles[i];
7060                                 VectorCopy(outfrontpoints[0], obj_fronttriangles[numfronttriangles].vertex[0].v);
7061                                 VectorCopy(outfrontpoints[j+1], obj_fronttriangles[numfronttriangles].vertex[1].v);
7062                                 VectorCopy(outfrontpoints[j+2], obj_fronttriangles[numfronttriangles].vertex[2].v);
7063                                 numfronttriangles++;
7064                         }
7065                         for (j = 0;j < neededbackpoints-2;j++)
7066                         {
7067                                 obj_backtriangles[numbacktriangles] = triangles[i];
7068                                 VectorCopy(outbackpoints[0], obj_backtriangles[numbacktriangles].vertex[0].v);
7069                                 VectorCopy(outbackpoints[j+1], obj_backtriangles[numbacktriangles].vertex[1].v);
7070                                 VectorCopy(outbackpoints[j+2], obj_backtriangles[numbacktriangles].vertex[2].v);
7071                                 numbacktriangles++;
7072                         }
7073                 }
7074         }
7075
7076         // now copy the triangles out of the big buffer
7077         if (numfronttriangles)
7078         {
7079                 fronttriangles = Mem_Alloc(loadmodel->mempool, fronttriangles * sizeof(*fronttriangles));
7080                 memcpy(fronttriangles, obj_fronttriangles, numfronttriangles * sizeof(*fronttriangles));
7081         }
7082         else
7083                 fronttriangles = NULL;
7084         if (numbacktriangles)
7085         {
7086                 backtriangles = Mem_Alloc(loadmodel->mempool, backtriangles * sizeof(*backtriangles));
7087                 memcpy(backtriangles, obj_backtriangles, numbacktriangles * sizeof(*backtriangles));
7088         }
7089         else
7090                 backtriangles = NULL;
7091
7092         // free the original triangles we were given
7093         if (triangles)
7094                 Mem_Free(triangles);
7095         triangles = NULL;
7096         numtriangles = 0;
7097
7098         // now create the children...
7099         node->children[0] = Mod_OBJ_BSPNodeForTriangles(node, fronttriangles, numfronttriangles, frontmins, frontmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
7100         node->children[1] = Mod_OBJ_BSPNodeForTriangles(node, backtriangles, numbacktriangles, backmins, backmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
7101         return node;
7102 }
7103
7104 void Mod_OBJ_SnapVertex(float *v)
7105 {
7106         int i;
7107         float a = mod_obj_vertexprecision.value;
7108         float b = 1.0f / a;
7109         v[0] -= floor(v[0] * a + 0.5f) * b;
7110         v[1] -= floor(v[1] * a + 0.5f) * b;
7111         v[2] -= floor(v[2] * a + 0.5f) * b;
7112 }
7113
7114 void Mod_OBJ_ConvertBSPNode(objnode_t *objnode, mnode_t *mnodeparent)
7115 {
7116         if (objnode->children[0])
7117         {
7118                 // convert to mnode_t
7119                 mnode_t *mnode = loadmodel->brush.data_nodes + loadmodel->brush.num_nodes++;
7120                 mnode->parent = mnodeparent;
7121                 mnode->plane = loadmodel->brush.data_planes + loadmodel->brush.num_planes++;
7122                 VectorCopy(objnode->normal, mnode->plane->normal);
7123                 mnode->plane->dist = objnode->dist;
7124                 PlaneClassify(mnode->plane);
7125                 VectorCopy(objnode->mins, mnode->mins);
7126                 VectorCopy(objnode->maxs, mnode->maxs);
7127                 // push combinedsupercontents up to the parent
7128                 if (mnodeparent)
7129                         mnodeparent->combinedsupercontents |= mnode->combinedsupercontents;
7130                 mnode->children[0] = Mod_OBJ_ConvertBSPNode(objnode->children[0], mnode);
7131                 mnode->children[1] = Mod_OBJ_ConvertBSPNode(objnode->children[1], mnode);
7132         }
7133         else
7134         {
7135                 // convert to mleaf_t
7136                 mleaf_t *mleaf = loadmodel->brush.data_leafs + loadmodel->brush.num_leafs++;
7137                 mleaf->parent = mnodeparent;
7138                 VectorCopy(objnode->mins, mleaf->mins);
7139                 VectorCopy(objnode->maxs, mleaf->maxs);
7140                 mleaf->clusterindex = loadmodel->brush.num_leafs - 1;
7141                 if (objnode->numtriangles)
7142                 {
7143                         objtriangle_t *triangles = objnode->triangles;
7144                         int numtriangles = objnode->numtriangles;
7145                         texture_t *texture;
7146                         float edge[3][3];
7147                         float normal[3];
7148                         objvertex_t vertex[3];
7149                         numsurfaces = 0;
7150                         maxsurfaces = numtriangles;
7151                         surfaces = NULL;
7152                         // calculate some more data on each triangle for surface gathering
7153                         for (i = 0;i < numtriangles;i++)
7154                         {
7155                                 triangle = triangles + i;
7156                                 texture = loadmodel->data_textures + triangle->textureindex;
7157                                 Mod_OBJ_SnapVertex(triangle->vertex[0].v);
7158                                 Mod_OBJ_SnapVertex(triangle->vertex[1].v);
7159                                 Mod_OBJ_SnapVertex(triangle->vertex[2].v);
7160                                 TriangleNormal(triangle->vertex[0].v, triangle->vertex[1].v, triangle->vertex[2].v, normal);
7161                                 axis = 0;
7162                                 if (fabs(normal[axis]) < fabs(normal[1]))
7163                                         axis = 1;
7164                                 if (fabs(normal[axis]) < fabs(normal[2]))
7165                                         axis = 2;
7166                                 VectorClear(normal);
7167                                 normal[axis] = 1;
7168                                 triangle->axis = axis;
7169                                 VectorSubtract(triangle->vertex[1].v, triangle->vertex[0].v, edge[0]);
7170                                 VectorSubtract(triangle->vertex[2].v, triangle->vertex[1].v, edge[1]);
7171                                 VectorSubtract(triangle->vertex[0].v, triangle->vertex[2].v, edge[2]);
7172                                 CrossProduct(edge[0], normal, triangle->edgeplane[0]);
7173                                 CrossProduct(edge[1], normal, triangle->edgeplane[1]);
7174                                 CrossProduct(edge[2], normal, triangle->edgeplane[2]);
7175                                 VectorNormalize(triangle->edgeplane[0]);
7176                                 VectorNormalize(triangle->edgeplane[1]);
7177                                 VectorNormalize(triangle->edgeplane[2]);
7178                                 triangle->edgeplane[0][3] = DotProduct(triangle->edgeplane[0], triangle->vertex[0].v);
7179                                 triangle->edgeplane[1][3] = DotProduct(triangle->edgeplane[1], triangle->vertex[1].v);
7180                                 triangle->edgeplane[2][3] = DotProduct(triangle->edgeplane[2], triangle->vertex[2].v);
7181                                 triangle->surfaceindex = 0;
7182                                 // add to the combined supercontents while we're here...
7183                                 mleaf->combinedsupercontents |= texture->supercontents;
7184                         }
7185                         surfaceindex = 1;
7186                         for (i = 0;i < numtriangles;i++)
7187                         {
7188                                 // skip already-assigned triangles
7189                                 if (triangles[i].surfaceindex)
7190                                         continue;
7191                                 texture = loadmodel->data_textures + triangles[i].textureindex;
7192                                 // assign a new surface to this triangle
7193                                 triangles[i].surfaceindex = surfaceindex++;
7194                                 axis = triangles[i].axis;
7195                                 numvertices = 3;
7196                                 // find the triangle's neighbors, this can take multiple passes
7197                                 retry = true;
7198                                 while (retry)
7199                                 {
7200                                         retry = false;
7201                                         for (j = i+1;j < numtriangles;j++)
7202                                         {
7203                                                 if (triangles[j].surfaceindex || triangles[j].axis != axis || triangles[j].texture != texture)
7204                                                         continue;
7205                                                 triangle = triangles + j;
7206                                                 for (k = i;k < j;k++)
7207                                                 {
7208                                                         if (triangles[k].surfaceindex != surfaceindex)
7209                                                                 continue;
7210                                                         if (VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[0].v)
7211                                                          || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[1].v)
7212                                                          || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[2].v)
7213                                                          || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[0].v)
7214                                                          || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[1].v)
7215                                                          || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[2].v)
7216                                                          || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[0].v)
7217                                                          || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[1].v)
7218                                                          || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[2].v))
7219                                                         {
7220                                                                 // shares a vertex position
7221                                                                 --- FIXME ---
7222                                                         }
7223                                                 }
7224                                                 for (k = 0;k < numvertices;k++)
7225                                                         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))
7226                                                                 break;
7227                                                 if (k == numvertices)
7228                                                         break; // not a neighbor
7229                                                 // this triangle is a neighbor and has the same axis and texture
7230                                                 // check now if it overlaps in lightmap projection space
7231                                                 triangles[j].surfaceindex;
7232                                                 if (triangles[j].
7233                                         }
7234                                 }
7235                                 //triangles[i].surfaceindex = surfaceindex++;
7236                                 for (surfaceindex = 0;surfaceindex < numsurfaces;surfaceindex++)
7237                                 {
7238                                         if (surfaces[surfaceindex].texture != texture)
7239                                                 continue;
7240                                         // check if any triangles already in this surface overlap in lightmap projection space
7241
7242                                         {
7243                                         }
7244                                         break;
7245                                 }
7246                         }
7247                         // let the collision code simply use the surfaces
7248                         mleaf->containscollisionsurfaces = mleaf->combinedsupercontents != 0;
7249                         mleaf->numleafsurfaces = ?;
7250                         mleaf->firstleafsurface = ?;
7251                 }
7252                 // push combinedsupercontents up to the parent
7253                 if (mnodeparent)
7254                         mnodeparent->combinedsupercontents |= mleaf->combinedsupercontents;
7255         }
7256 }
7257 #endif
7258
7259 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
7260 {
7261 #ifdef OBJWORKS
7262         const char *textbase = (char *)buffer, *text = textbase;
7263         char *s;
7264         char *argv[512];
7265         char line[1024];
7266         char materialname[MAX_QPATH];
7267         int j, index1, index2, index3, first, prev, index;
7268         int argc;
7269         int linelen;
7270         int numtriangles = 0;
7271         int maxtriangles = 131072;
7272         objtriangle_t *triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
7273         int linenumber = 0;
7274         int maxtextures = 256, numtextures = 0, textureindex = 0;
7275         int maxv = 1024, numv = 0;
7276         int maxvt = 1024, numvt = 0;
7277         int maxvn = 1024, numvn = 0;
7278         char **texturenames;
7279         float *v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
7280         float *vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
7281         float *vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
7282         objvertex_t vfirst, vprev, vcurrent;
7283         float mins[3];
7284         float maxs[3];
7285 #if 0
7286         int hashindex;
7287         int maxverthash = 65536, numverthash = 0;
7288         int numhashindex = 65536;
7289         struct objverthash_s
7290         {
7291                 struct objverthash_s *next;
7292                 int s;
7293                 int v;
7294                 int vt;
7295                 int vn;
7296         }
7297         *hash, **verthash = Mem_Alloc(tempmempool, numhashindex * sizeof(*verthash)), *verthashdata = Mem_Alloc(tempmempool, maxverthash * sizeof(*verthashdata)), *oldverthashdata;
7298 #endif
7299
7300         dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
7301
7302         loadmodel->modeldatatypestring = "OBJ";
7303
7304         loadmodel->type = mod_obj;
7305         loadmodel->soundfromcenter = true;
7306         loadmodel->TraceBox = Mod_OBJ_TraceBox;
7307         loadmodel->TraceLine = Mod_OBJ_TraceLine;
7308         loadmodel->TracePoint = Mod_OBJ_TracePoint;
7309         loadmodel->PointSuperContents = Mod_OBJ_PointSuperContents;
7310         loadmodel->brush.TraceLineOfSight = Mod_OBJ_TraceLineOfSight;
7311         loadmodel->brush.SuperContentsFromNativeContents = Mod_OBJ_SuperContentsFromNativeContents;
7312         loadmodel->brush.NativeContentsFromSuperContents = Mod_OBJ_NativeContentsFromSuperContents;
7313         loadmodel->brush.GetPVS = Mod_OBJ_GetPVS;
7314         loadmodel->brush.FatPVS = Mod_OBJ_FatPVS;
7315         loadmodel->brush.BoxTouchingPVS = Mod_OBJ_BoxTouchingPVS;
7316         loadmodel->brush.BoxTouchingLeafPVS = Mod_OBJ_BoxTouchingLeafPVS;
7317         loadmodel->brush.BoxTouchingVisibleLeafs = Mod_OBJ_BoxTouchingVisibleLeafs;
7318         loadmodel->brush.FindBoxClusters = Mod_OBJ_FindBoxClusters;
7319         loadmodel->brush.LightPoint = Mod_OBJ_LightPoint;
7320         loadmodel->brush.FindNonSolidLocation = Mod_OBJ_FindNonSolidLocation;
7321         loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
7322         loadmodel->brush.RoundUpToHullSize = NULL;
7323         loadmodel->brush.PointInLeaf = Mod_OBJ_PointInLeaf;
7324         loadmodel->Draw = R_Q1BSP_Draw;
7325         loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
7326         loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
7327         loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
7328         loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
7329         loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7330         loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7331         loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7332         loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7333         loadmodel->DrawLight = R_Q1BSP_DrawLight;
7334
7335         VectorClear(mins);
7336         VectorClear(maxs);
7337
7338         // parse the OBJ text now
7339         for(;;)
7340         {
7341                 if (!*text)
7342                         break;
7343                 linenumber++;
7344                 linelen = 0;
7345                 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
7346                         line[linelen] = text[linelen];
7347                 line[linelen] = 0;
7348                 for (argc = 0;argc < (int)(sizeof(argv)/sizeof(argv[0]));argc++)
7349                         argv[argc] = "";
7350                 argc = 0;
7351                 s = line;
7352                 while (*s == ' ' || *s == '\t')
7353                         s++;
7354                 while (*s)
7355                 {
7356                         argv[argc++] = s;
7357                         while (*s > ' ')
7358                                 s++;
7359                         if (!*s)
7360                                 break;
7361                         *s++ = 0;
7362                         while (*s == ' ' || *s == '\t')
7363                                 s++;
7364                 }
7365                 if (!argc)
7366                         continue;
7367                 if (argv[0][0] == '#')
7368                         continue;
7369                 if (!strcmp(argv[0], "v"))
7370                 {
7371                         if (maxv <= numv)
7372                         {
7373                                 float *oldv = v;
7374                                 maxv *= 2;
7375                                 v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
7376                                 if (oldv)
7377                                 {
7378                                         memcpy(v, oldv, numv * sizeof(float[3]));
7379                                         Mem_Free(oldv);
7380                                 }
7381                         }
7382                         v[numv*3+0] = atof(argv[1]);
7383                         v[numv*3+1] = atof(argv[2]);
7384                         v[numv*3+2] = atof(argv[3]);
7385                         numv++;
7386                 }
7387                 else if (!strcmp(argv[0], "vt"))
7388                 {
7389                         if (maxvt <= numvt)
7390                         {
7391                                 float *oldvt = vt;
7392                                 maxvt *= 2;
7393                                 vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
7394                                 if (oldvt)
7395                                 {
7396                                         memcpy(vt, oldvt, numvt * sizeof(float[2]));
7397                                         Mem_Free(oldvt);
7398                                 }
7399                         }
7400                         vt[numvt*2+0] = atof(argv[1]);
7401                         vt[numvt*2+1] = atof(argv[2]);
7402                         numvt++;
7403                 }
7404                 else if (!strcmp(argv[0], "vn"))
7405                 {
7406                         if (maxvn <= numvn)
7407                         {
7408                                 float *oldvn = vn;
7409                                 maxvn *= 2;
7410                                 vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
7411                                 if (oldvn)
7412                                 {
7413                                         memcpy(vn, oldvn, numvn * sizeof(float[3]));
7414                                         Mem_Free(oldvn);
7415                                 }
7416                         }
7417                         vn[numvn*3+0] = atof(argv[1]);
7418                         vn[numvn*3+1] = atof(argv[2]);
7419                         vn[numvn*3+2] = atof(argv[3]);
7420                         numvn++;
7421                 }
7422                 else if (!strcmp(argv[0], "f"))
7423                 {
7424                         for (j = 1;j < argc;j++)
7425                         {
7426                                 index1 = atoi(argv[j]);
7427                                 while(argv[j][0] && argv[j][0] != '/')
7428                                         argv[j]++;
7429                                 if (argv[j][0])
7430                                         argv[j]++;
7431                                 index2 = atoi(argv[j]);
7432                                 while(argv[j][0] && argv[j][0] != '/')
7433                                         argv[j]++;
7434                                 if (argv[j][0])
7435                                         argv[j]++;
7436                                 index3 = atoi(argv[j]);
7437                                 // negative refers to a recent vertex
7438                                 // zero means not specified
7439                                 // positive means an absolute vertex index
7440                                 if (index1 < 0)
7441                                         index1 = numv - index1;
7442                                 if (index2 < 0)
7443                                         index2 = numvt - index2;
7444                                 if (index3 < 0)
7445                                         index3 = numvn - index3;
7446                                 VectorCopy(v + 3*index1, vcurrent.v);
7447                                 Vector2Copy(vt + 2*index2, vcurrent.vt);
7448                                 VectorCopy(vn + 3*index3, vcurrent.vn);
7449                                 if (numtriangles == 0)
7450                                 {
7451                                         VectorCopy(vcurrent.v, mins);
7452                                         VectorCopy(vcurrent.v, maxs);
7453                                 }
7454                                 else
7455                                 {
7456                                         mins[0] = min(mins[0], vcurrent.v[0]);
7457                                         mins[1] = min(mins[1], vcurrent.v[1]);
7458                                         mins[2] = min(mins[2], vcurrent.v[2]);
7459                                         maxs[0] = max(maxs[0], vcurrent.v[0]);
7460                                         maxs[1] = max(maxs[1], vcurrent.v[1]);
7461                                         maxs[2] = max(maxs[2], vcurrent.v[2]);
7462                                 }
7463                                 if (j == 1)
7464                                         vfirst = vcurrent;
7465                                 else if (j >= 3)
7466                                 {
7467                                         if (maxtriangles <= numtriangles)
7468                                         {
7469                                                 objtriangle_t *oldtriangles = triangles;
7470                                                 maxtriangles *= 2;
7471                                                 triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
7472                                                 if (oldtriangles)
7473                                                 {
7474                                                         memcpy(triangles, oldtriangles, maxtriangles * sizeof(*triangles));
7475                                                         Mem_Free(oldtriangles);
7476                                                 }
7477                                         }
7478                                         triangles[numtriangles].textureindex = textureindex;
7479                                         triangles[numtriangles].vertex[0] = vfirst;
7480                                         triangles[numtriangles].vertex[1] = vprev;
7481                                         triangles[numtriangles].vertex[2] = vcurrent;
7482                                         numtriangles++;
7483                                 }
7484                                 vprev = vcurrent;
7485                                 prev = index;
7486                         }
7487                 }
7488                 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
7489                         ;
7490                 else if (!!strcmp(argv[0], "usemtl"))
7491                 {
7492                         for (i = 0;i < numtextures;i++)
7493                                 if (!strcmp(texturenames[numtextures], argv[1]))
7494                                         break;
7495                         if (i < numtextures)
7496                                 texture = textures + i;
7497                         else
7498                         {
7499                                 if (maxtextures <= numtextures)
7500                                 {
7501                                         texture_t *oldtextures = textures;
7502                                         maxtextures *= 2;
7503                                         textures = Mem_Alloc(tempmempool, maxtextures * sizeof(*textures));
7504                                         if (oldtextures)
7505                                         {
7506                                                 memcpy(textures, oldtextures, numtextures * sizeof(*textures));
7507                                                 Mem_Free(oldtextures);
7508                                         }
7509                                 }
7510                                 textureindex = numtextures++;
7511                                 texturenames[textureindex] = Mem_Alloc(tempmempool, strlen(argv[1]) + 1);
7512                                 memcpy(texturenames[textureindex], argv[1], strlen(argv[1]) + 1);
7513                         }
7514                 }
7515                 text += linelen;
7516                 if (*text == '\r')
7517                         text++;
7518                 if (*text == '\n')
7519                         text++;
7520         }
7521
7522         // now that we have the OBJ data loaded as-is, we can convert it
7523
7524         // load the textures
7525         loadmodel->num_textures = numtextures;
7526         loadmodel->data_textures = Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
7527         for (i = 0;i < numtextures;i++)
7528                 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, texturenames[i], true, true, TEXF_MIPMAP | TEXF_ALPHA | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
7529
7530         // free the texturenames array since we are now done with it
7531         for (i = 0;i < numtextures;i++)
7532         {
7533                 Mem_Free(texturenames[i]);
7534                 texturenames[i] = NULL;
7535         }
7536         Mem_Free(texturenames);
7537         texturenames = NULL;
7538
7539         // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
7540         VectorCopy(mins, loadmodel->normalmins);
7541         VectorCopy(maxs, loadmodel->normalmaxs);
7542         dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
7543         modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
7544         modelyawradius = dist*dist+modelyawradius*modelyawradius;
7545         modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
7546         modelradius = modelyawradius + modelradius * modelradius;
7547         modelyawradius = sqrt(modelyawradius);
7548         modelradius = sqrt(modelradius);
7549         loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
7550         loadmodel->yawmins[2] = loadmodel->normalmins[2];
7551         loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] =  modelyawradius;
7552         loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
7553         loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
7554         loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] =  modelradius;
7555         loadmodel->radius = modelradius;
7556         loadmodel->radius2 = modelradius * modelradius;
7557
7558         // make sure the temp triangle buffer is big enough for BSP building
7559         maxclippedtriangles = numtriangles*4;
7560         if (numtriangles > 0)
7561         {
7562                 clippedfronttriangles = Mem_Alloc(loadmodel->mempool, maxclippedtriangles * 2 * sizeof(objtriangle_t));
7563                 clippedbacktriangles = clippedfronttriangles + maxclippedtriangles;
7564         }
7565
7566         // 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
7567         loadmodel->brush.num_leafs = 0;
7568         loadmodel->brush.num_nodes = 0;
7569         Mem_ExpandableArray_NewArray(&nodesarray, loadmodel->mempool, sizeof(objnode_t), 1024);
7570         rootnode = Mod_OBJ_BSPNodeForTriangles(triangles, numtriangles, mins, maxs, &nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
7571
7572         // convert the BSP tree to mnode_t and mleaf_t structures and convert the triangles to msurface_t...
7573         loadmodel->brush.data_leafs = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
7574         loadmodel->brush.data_nodes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mnode_t));
7575         loadmodel->brush.data_planes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mplane_t));
7576         loadmodel->brush.num_leafs = 0;
7577         loadmodel->brush.num_nodes = 0;
7578         loadmodel->brush.num_planes = 0;
7579         Mod_OBJ_ConvertAndFreeBSPNode(rootnode);
7580
7581         if (clippedfronttriangles)
7582                 Mem_Free(clippedfronttriangles);
7583         maxclippedtriangles = 0;
7584         clippedfronttriangles = NULL;
7585         clippedbacktriangles = NULL;
7586
7587 --- NOTHING DONE PAST THIS POINT ---
7588
7589         loadmodel->numskins = LittleLong(pinmodel->num_skins);
7590         numxyz = LittleLong(pinmodel->num_xyz);
7591         numst = LittleLong(pinmodel->num_st);
7592         loadmodel->surfmesh.num_triangles = LittleLong(pinmodel->num_tris);
7593         loadmodel->numframes = LittleLong(pinmodel->num_frames);
7594         loadmodel->surfmesh.num_morphframes = loadmodel->numframes;
7595         loadmodel->num_poses = loadmodel->surfmesh.num_morphframes;
7596         skinwidth = LittleLong(pinmodel->skinwidth);
7597         skinheight = LittleLong(pinmodel->skinheight);
7598         iskinwidth = 1.0f / skinwidth;
7599         iskinheight = 1.0f / skinheight;
7600
7601         loadmodel->num_surfaces = 1;
7602         loadmodel->nummodelsurfaces = loadmodel->num_surfaces;
7603         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]));
7604         loadmodel->data_surfaces = (msurface_t *)data;data += loadmodel->num_surfaces * sizeof(msurface_t);
7605         loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
7606         loadmodel->sortedmodelsurfaces[0] = 0;
7607         loadmodel->animscenes = (animscene_t *)data;data += loadmodel->numframes * sizeof(animscene_t);
7608         loadmodel->surfmesh.data_morphmd2framesize6f = (float *)data;data += loadmodel->numframes * sizeof(float[6]);
7609         loadmodel->surfmesh.data_element3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
7610         loadmodel->surfmesh.data_neighbor3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
7611
7612         loadmodel->synctype = ST_RAND;
7613
7614         // load the skins
7615         inskin = (char *)(base + LittleLong(pinmodel->ofs_skins));
7616         skinfiles = Mod_LoadSkinFiles();
7617         if (skinfiles)
7618         {
7619                 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
7620                 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
7621                 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
7622                 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures, skinfiles, "default", "");
7623                 Mod_FreeSkinFiles(skinfiles);
7624         }
7625         else if (loadmodel->numskins)
7626         {
7627                 // skins found (most likely not a player model)
7628                 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
7629                 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
7630                 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
7631                 for (i = 0;i < loadmodel->numskins;i++, inskin += MD2_SKINNAME)
7632                         Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i * loadmodel->num_surfaces, inskin, true, true, (r_mipskins.integer ? TEXF_MIPMAP : 0) | TEXF_ALPHA | TEXF_PICMIP | TEXF_COMPRESS);
7633         }
7634         else
7635         {
7636                 // no skins (most likely a player model)
7637                 loadmodel->numskins = 1;
7638                 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
7639                 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
7640                 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
7641                 Mod_BuildAliasSkinFromSkinFrame(loadmodel->data_textures, NULL);
7642         }
7643
7644         loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
7645         for (i = 0;i < loadmodel->numskins;i++)
7646         {
7647                 loadmodel->skinscenes[i].firstframe = i;
7648                 loadmodel->skinscenes[i].framecount = 1;
7649                 loadmodel->skinscenes[i].loop = true;
7650                 loadmodel->skinscenes[i].framerate = 10;
7651         }
7652
7653         // load the triangles and stvert data
7654         inst = (unsigned short *)(base + LittleLong(pinmodel->ofs_st));
7655         intri = (md2triangle_t *)(base + LittleLong(pinmodel->ofs_tris));
7656         md2verthash = (struct md2verthash_s **)Mem_Alloc(tempmempool, 65536 * sizeof(hash));
7657         md2verthashdata = (struct md2verthash_s *)Mem_Alloc(tempmempool, loadmodel->surfmesh.num_triangles * 3 * sizeof(*hash));
7658         // swap the triangle list
7659         loadmodel->surfmesh.num_vertices = 0;
7660         for (i = 0;i < loadmodel->surfmesh.num_triangles;i++)
7661         {
7662                 for (j = 0;j < 3;j++)
7663                 {
7664                         xyz = (unsigned short) LittleShort (intri[i].index_xyz[j]);
7665                         st = (unsigned short) LittleShort (intri[i].index_st[j]);
7666                         if (xyz >= numxyz)
7667                         {
7668                                 Con_Printf("%s has an invalid xyz index (%i) on triangle %i, resetting to 0\n", loadmodel->name, xyz, i);
7669                                 xyz = 0;
7670                         }
7671                         if (st >= numst)
7672                         {
7673                                 Con_Printf("%s has an invalid st index (%i) on triangle %i, resetting to 0\n", loadmodel->name, st, i);
7674                                 st = 0;
7675                         }
7676                         hashindex = (xyz * 256 + st) & 65535;
7677                         for (hash = md2verthash[hashindex];hash;hash = hash->next)
7678                                 if (hash->xyz == xyz && hash->st == st)
7679                                         break;
7680                         if (hash == NULL)
7681                         {
7682                                 hash = md2verthashdata + loadmodel->surfmesh.num_vertices++;
7683                                 hash->xyz = xyz;
7684                                 hash->st = st;
7685                                 hash->next = md2verthash[hashindex];
7686                                 md2verthash[hashindex] = hash;
7687                         }
7688                         loadmodel->surfmesh.data_element3i[i*3+j] = (hash - md2verthashdata);
7689                 }
7690         }
7691
7692         vertremap = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(int));
7693         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));
7694         loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += loadmodel->surfmesh.num_vertices * sizeof(float[2]);
7695         loadmodel->surfmesh.data_morphmdlvertex = (trivertx_t *)data;data += loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t);
7696         for (i = 0;i < loadmodel->surfmesh.num_vertices;i++)
7697         {
7698                 int sts, stt;
7699                 hash = md2verthashdata + i;
7700                 vertremap[i] = hash->xyz;
7701                 sts = LittleShort(inst[hash->st*2+0]);
7702                 stt = LittleShort(inst[hash->st*2+1]);
7703                 if (sts < 0 || sts >= skinwidth || stt < 0 || stt >= skinheight)
7704                 {
7705                         Con_Printf("%s has an invalid skin coordinate (%i %i) on vert %i, changing to 0 0\n", loadmodel->name, sts, stt, i);
7706                         sts = 0;
7707                         stt = 0;
7708                 }
7709                 loadmodel->surfmesh.data_texcoordtexture2f[i*2+0] = sts * iskinwidth;
7710                 loadmodel->surfmesh.data_texcoordtexture2f[i*2+1] = stt * iskinheight;
7711         }
7712
7713         Mem_Free(md2verthash);
7714         Mem_Free(md2verthashdata);
7715
7716         // generate ushort elements array if possible
7717         if (loadmodel->surfmesh.num_vertices <= 65536)
7718                 loadmodel->surfmesh.data_element3s = (unsigned short *)Mem_Alloc(loadmodel->mempool, sizeof(unsigned short[3]) * loadmodel->surfmesh.num_triangles);
7719
7720         // load the frames
7721         datapointer = (base + LittleLong(pinmodel->ofs_frames));
7722         for (i = 0;i < loadmodel->surfmesh.num_morphframes;i++)
7723         {
7724                 int k;
7725                 trivertx_t *v;
7726                 trivertx_t *out;
7727                 pinframe = (md2frame_t *)datapointer;
7728                 datapointer += sizeof(md2frame_t);
7729                 // store the frame scale/translate into the appropriate array
7730                 for (j = 0;j < 3;j++)
7731                 {
7732                         loadmodel->surfmesh.data_morphmd2framesize6f[i*6+j] = LittleFloat(pinframe->scale[j]);
7733                         loadmodel->surfmesh.data_morphmd2framesize6f[i*6+3+j] = LittleFloat(pinframe->translate[j]);
7734                 }
7735                 // convert the vertices
7736                 v = (trivertx_t *)datapointer;
7737                 out = loadmodel->surfmesh.data_morphmdlvertex + i * loadmodel->surfmesh.num_vertices;
7738                 for (k = 0;k < loadmodel->surfmesh.num_vertices;k++)
7739                         out[k] = v[vertremap[k]];
7740                 datapointer += numxyz * sizeof(trivertx_t);
7741
7742                 strlcpy(loadmodel->animscenes[i].name, pinframe->name, sizeof(loadmodel->animscenes[i].name));
7743                 loadmodel->animscenes[i].firstframe = i;
7744                 loadmodel->animscenes[i].framecount = 1;
7745                 loadmodel->animscenes[i].framerate = 10;
7746                 loadmodel->animscenes[i].loop = true;
7747         }
7748
7749         Mem_Free(vertremap);
7750
7751         Mod_MakeSortedSurfaces(loadmodel);
7752         Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
7753         Mod_Alias_CalculateBoundingBox();
7754         Mod_Alias_MorphMesh_CompileFrames();
7755
7756         surface = loadmodel->data_surfaces;
7757         surface->texture = loadmodel->data_textures;
7758         surface->num_firsttriangle = 0;
7759         surface->num_triangles = loadmodel->surfmesh.num_triangles;
7760         surface->num_firstvertex = 0;
7761         surface->num_vertices = loadmodel->surfmesh.num_vertices;
7762
7763         loadmodel->surfmesh.isanimated = false;
7764
7765         if (loadmodel->surfmesh.data_element3s)
7766                 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
7767                         loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
7768 #endif
7769 }
7770 #endif // !OBJASMODEL
7771
7772 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
7773 {
7774         // we already have done PVS culling at this point...
7775         // so we don't need to do it again.
7776
7777         int i;
7778         vec3_t testorigin, mins, maxs;
7779
7780         testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
7781         testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
7782         testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
7783
7784         if(model->brush.TraceLineOfSight(model, eye, testorigin))
7785                 return 1;
7786
7787         // expand the box a little
7788         mins[0] = (t+1) * minsX[0] - t * maxsX[0];
7789         maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
7790         mins[1] = (t+1) * minsX[1] - t * maxsX[1];
7791         maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
7792         mins[2] = (t+1) * minsX[2] - t * maxsX[2];
7793         maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
7794
7795         for(i = 0; i != numsamples; ++i)
7796         {
7797                 testorigin[0] = lhrandom(mins[0], maxs[0]);
7798                 testorigin[1] = lhrandom(mins[1], maxs[1]);
7799                 testorigin[2] = lhrandom(mins[2], maxs[2]);
7800
7801                 if(model->brush.TraceLineOfSight(model, eye, testorigin))
7802                         return 1;
7803         }
7804
7805         return 0;
7806 }
7807