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 // note: model_shared.c sets up r_notexture, and r_surf_notexture
  30
  31 qbyte mod_q1bsp_novis[(MAX_MAP_LEAFS + 7)/ 8];
  32
  33 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128"};
  34 cvar_t halflifebsp = {0, "halflifebsp", "0"};
  35 cvar_t r_novis = {0, "r_novis", "0"};
  36 cvar_t r_miplightmaps = {CVAR_SAVE, "r_miplightmaps", "0"};
  37 cvar_t r_lightmaprgba = {0, "r_lightmaprgba", "1"};
  38 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0"};
  39 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4"};
  40 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "1"};
  41 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024"};
  42 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536"};
  43 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15"};
  44 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "1"};
  45 cvar_t r_subdivisions_collision_maxtess = {0, "r_subdivisions_collision_maxtess", "1024"};
  46 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225"};
  47 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1"};
  48 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1"};
  49 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0"};
  50
  51 static void Mod_Q1BSP_Collision_Init (void);
  52 void Mod_BrushInit(void)
  53 {
  54 //      Cvar_RegisterVariable(&r_subdivide_size);
  55         Cvar_RegisterVariable(&halflifebsp);
  56         Cvar_RegisterVariable(&r_novis);
  57         Cvar_RegisterVariable(&r_miplightmaps);
  58         Cvar_RegisterVariable(&r_lightmaprgba);
  59         Cvar_RegisterVariable(&r_nosurftextures);
  60         Cvar_RegisterVariable(&r_subdivisions_tolerance);
  61         Cvar_RegisterVariable(&r_subdivisions_mintess);
  62         Cvar_RegisterVariable(&r_subdivisions_maxtess);
  63         Cvar_RegisterVariable(&r_subdivisions_maxvertices);
  64         Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
  65         Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
  66         Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
  67         Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
  68         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
  69         Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
  70         Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
  71         memset(mod_q1bsp_novis, 0xff, sizeof(mod_q1bsp_novis));
  72         Mod_Q1BSP_Collision_Init();
  73 }
  74
  75 static mleaf_t *Mod_Q1BSP_PointInLeaf(model_t *model, const vec3_t p)
  76 {
  77         mnode_t *node;
  78
  79         if (model == NULL)
  80                 return NULL;
  81
  82         Mod_CheckLoaded(model);
  83
  84         // LordHavoc: modified to start at first clip node,
  85         // in other words: first node of the (sub)model
  86         node = model->brushq1.nodes + model->brushq1.hulls[0].firstclipnode;
  87         while (node->contents == 0)
  88                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
  89
  90         return (mleaf_t *)node;
  91 }
  92
  93 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(model_t *model, const vec3_t p, qbyte *out, int outsize)
  94 {
  95         int i;
  96         mleaf_t *leaf;
  97         leaf = Mod_Q1BSP_PointInLeaf(model, p);
  98         if (leaf)
  99         {
 100                 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
 101                 if (i)
 102                 {
 103                         memcpy(out, leaf->ambient_sound_level, i);
 104                         out += i;
 105                         outsize -= i;
 106                 }
 107         }
 108         if (outsize)
 109                 memset(out, 0, outsize);
 110 }
 111
 112 static int Mod_Q1BSP_BoxTouchingPVS(model_t *model, const qbyte *pvs, const vec3_t mins, const vec3_t maxs)
 113 {
 114         int clusterindex, side, nodestackindex = 0;
 115         mnode_t *node, *nodestack[1024];
 116         node = model->brushq1.nodes + model->brushq1.hulls[0].firstclipnode;
 117         for (;;)
 118         {
 119                 if (node->plane)
 120                 {
 121                         // node - recurse down the BSP tree
 122                         side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
 123                         if (side < 2)
 124                         {
 125                                 // box is on one side of plane, take that path
 126                                 node = node->children[side];
 127                         }
 128                         else
 129                         {
 130                                 // box crosses plane, take one path and remember the other
 131                                 if (nodestackindex < 1024)
 132                                         nodestack[nodestackindex++] = node->children[0];
 133                                 node = node->children[1];
 134                         }
 135                 }
 136                 else
 137                 {
 138                         // leaf - check cluster bit
 139                         clusterindex = ((mleaf_t *)node)->clusterindex;
 140                         if (CHECKPVSBIT(pvs, clusterindex))
 141                         {
 142                                 // it is visible, return immediately with the news
 143                                 return true;
 144                         }
 145                         else
 146                         {
 147                                 // nothing to see here, try another path we didn't take earlier
 148                                 if (nodestackindex == 0)
 149                                         break;
 150                                 node = nodestack[--nodestackindex];
 151                         }
 152                 }
 153         }
 154         // it is not visible
 155         return false;
 156 }
 157
 158 /*
 159 static int Mod_Q1BSP_PointContents(model_t *model, const vec3_t p)
 160 {
 161         mnode_t *node;
 162
 163         if (model == NULL)
 164                 return CONTENTS_EMPTY;
 165
 166         Mod_CheckLoaded(model);
 167
 168         // LordHavoc: modified to start at first clip node,
 169         // in other words: first node of the (sub)model
 170         node = model->brushq1.nodes + model->brushq1.hulls[0].firstclipnode;
 171         while (node->contents == 0)
 172                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
 173
 174         return ((mleaf_t *)node)->contents;
 175 }
 176 */
 177
 178 typedef struct findnonsolidlocationinfo_s
 179 {
 180         vec3_t center;
 181         vec_t radius;
 182         vec3_t nudge;
 183         vec_t bestdist;
 184         model_t *model;
 185 }
 186 findnonsolidlocationinfo_t;
 187
 188 #if 0
 189 extern cvar_t samelevel;
 190 #endif
 191 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
 192 {
 193         int i, surfnum, k, *tri, *mark;
 194         float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
 195 #if 0
 196         float surfnormal[3];
 197 #endif
 198         msurface_t *surf;
 199         for (surfnum = 0, mark = leaf->firstmarksurface;surfnum < leaf->nummarksurfaces;surfnum++, mark++)
 200         {
 201                 surf = info->model->brushq1.surfaces + *mark;
 202                 if (surf->flags & SURF_SOLIDCLIP)
 203                 {
 204 #if 0
 205                         VectorCopy(surf->plane->normal, surfnormal);
 206                         if (surf->flags & SURF_PLANEBACK)
 207                                 VectorNegate(surfnormal, surfnormal);
 208 #endif
 209                         for (k = 0;k < surf->mesh.num_triangles;k++)
 210                         {
 211                                 tri = surf->mesh.data_element3i + k * 3;
 212                                 VectorCopy((surf->mesh.data_vertex3f + tri[0] * 3), vert[0]);
 213                                 VectorCopy((surf->mesh.data_vertex3f + tri[1] * 3), vert[1]);
 214                                 VectorCopy((surf->mesh.data_vertex3f + tri[2] * 3), vert[2]);
 215                                 VectorSubtract(vert[1], vert[0], edge[0]);
 216                                 VectorSubtract(vert[2], vert[1], edge[1]);
 217                                 CrossProduct(edge[1], edge[0], facenormal);
 218                                 if (facenormal[0] || facenormal[1] || facenormal[2])
 219                                 {
 220                                         VectorNormalize(facenormal);
 221 #if 0
 222                                         if (VectorDistance(facenormal, surfnormal) > 0.01f)
 223                                                 Con_Printf("a2! %f %f %f != %f %f %f\n", facenormal[0], facenormal[1], facenormal[2], surfnormal[0], surfnormal[1], surfnormal[2]);
 224 #endif
 225                                         f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 226                                         if (f <= info->bestdist && f >= -info->bestdist)
 227                                         {
 228                                                 VectorSubtract(vert[0], vert[2], edge[2]);
 229                                                 VectorNormalize(edge[0]);
 230                                                 VectorNormalize(edge[1]);
 231                                                 VectorNormalize(edge[2]);
 232                                                 CrossProduct(facenormal, edge[0], edgenormal[0]);
 233                                                 CrossProduct(facenormal, edge[1], edgenormal[1]);
 234                                                 CrossProduct(facenormal, edge[2], edgenormal[2]);
 235 #if 0
 236                                                 if (samelevel.integer & 1)
 237                                                         VectorNegate(edgenormal[0], edgenormal[0]);
 238                                                 if (samelevel.integer & 2)
 239                                                         VectorNegate(edgenormal[1], edgenormal[1]);
 240                                                 if (samelevel.integer & 4)
 241                                                         VectorNegate(edgenormal[2], edgenormal[2]);
 242                                                 for (i = 0;i < 3;i++)
 243                                                         if (DotProduct(vert[0], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f
 244                                                          || DotProduct(vert[1], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f
 245                                                          || DotProduct(vert[2], edgenormal[i]) > DotProduct(vert[i], edgenormal[i]) + 0.1f)
 246                                                                 Con_Printf("a! %i : %f %f %f (%f %f %f)\n", i, edgenormal[i][0], edgenormal[i][1], edgenormal[i][2], facenormal[0], facenormal[1], facenormal[2]);
 247 #endif
 248                                                 // face distance
 249                                                 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
 250                                                  && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
 251                                                  && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
 252                                                 {
 253                                                         // we got lucky, the center is within the face
 254                                                         dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 255                                                         if (dist < 0)
 256                                                         {
 257                                                                 dist = -dist;
 258                                                                 if (info->bestdist > dist)
 259                                                                 {
 260                                                                         info->bestdist = dist;
 261                                                                         VectorScale(facenormal, (info->radius - -dist), info->nudge);
 262                                                                 }
 263                                                         }
 264                                                         else
 265                                                         {
 266                                                                 if (info->bestdist > dist)
 267                                                                 {
 268                                                                         info->bestdist = dist;
 269                                                                         VectorScale(facenormal, (info->radius - dist), info->nudge);
 270                                                                 }
 271                                                         }
 272                                                 }
 273                                                 else
 274                                                 {
 275                                                         // check which edge or vertex the center is nearest
 276                                                         for (i = 0;i < 3;i++)
 277                                                         {
 278                                                                 f = DotProduct(info->center, edge[i]);
 279                                                                 if (f >= DotProduct(vert[0], edge[i])
 280                                                                  && f <= DotProduct(vert[1], edge[i]))
 281                                                                 {
 282                                                                         // on edge
 283                                                                         VectorMA(info->center, -f, edge[i], point);
 284                                                                         dist = sqrt(DotProduct(point, point));
 285                                                                         if (info->bestdist > dist)
 286                                                                         {
 287                                                                                 info->bestdist = dist;
 288                                                                                 VectorScale(point, (info->radius / dist), info->nudge);
 289                                                                         }
 290                                                                         // skip both vertex checks
 291                                                                         // (both are further away than this edge)
 292                                                                         i++;
 293                                                                 }
 294                                                                 else
 295                                                                 {
 296                                                                         // not on edge, check first vertex of edge
 297                                                                         VectorSubtract(info->center, vert[i], point);
 298                                                                         dist = sqrt(DotProduct(point, point));
 299                                                                         if (info->bestdist > dist)
 300                                                                         {
 301                                                                                 info->bestdist = dist;
 302                                                                                 VectorScale(point, (info->radius / dist), info->nudge);
 303                                                                         }
 304                                                                 }
 305                                                         }
 306                                                 }
 307                                         }
 308                                 }
 309                         }
 310                 }
 311         }
 312 }
 313
 314 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
 315 {
 316         if (node->contents)
 317         {
 318                 if (((mleaf_t *)node)->nummarksurfaces)
 319                         Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
 320         }
 321         else
 322         {
 323                 float f = PlaneDiff(info->center, node->plane);
 324                 if (f >= -info->bestdist)
 325                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
 326                 if (f <= info->bestdist)
 327                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
 328         }
 329 }
 330
 331 static void Mod_Q1BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, float radius)
 332 {
 333         int i;
 334         findnonsolidlocationinfo_t info;
 335         if (model == NULL)
 336         {
 337                 VectorCopy(in, out);
 338                 return;
 339         }
 340         VectorCopy(in, info.center);
 341         info.radius = radius;
 342         info.model = model;
 343         i = 0;
 344         do
 345         {
 346                 VectorClear(info.nudge);
 347                 info.bestdist = radius;
 348                 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brushq1.nodes + model->brushq1.hulls[0].firstclipnode);
 349                 VectorAdd(info.center, info.nudge, info.center);
 350         }
 351         while (info.bestdist < radius && ++i < 10);
 352         VectorCopy(info.center, out);
 353 }
 354
 355 int Mod_Q1BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
 356 {
 357         switch(nativecontents)
 358         {
 359                 case CONTENTS_EMPTY:
 360                         return 0;
 361                 case CONTENTS_SOLID:
 362                         return SUPERCONTENTS_SOLID;
 363                 case CONTENTS_WATER:
 364                         return SUPERCONTENTS_WATER;
 365                 case CONTENTS_SLIME:
 366                         return SUPERCONTENTS_SLIME;
 367                 case CONTENTS_LAVA:
 368                         return SUPERCONTENTS_LAVA;
 369                 case CONTENTS_SKY:
 370                         return SUPERCONTENTS_SKY;
 371         }
 372         return 0;
 373 }
 374
 375 int Mod_Q1BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
 376 {
 377         if (supercontents & SUPERCONTENTS_SOLID)
 378                 return CONTENTS_SOLID;
 379         if (supercontents & SUPERCONTENTS_SKY)
 380                 return CONTENTS_SKY;
 381         if (supercontents & SUPERCONTENTS_LAVA)
 382                 return CONTENTS_LAVA;
 383         if (supercontents & SUPERCONTENTS_SLIME)
 384                 return CONTENTS_SLIME;
 385         if (supercontents & SUPERCONTENTS_WATER)
 386                 return CONTENTS_WATER;
 387         return CONTENTS_EMPTY;
 388 }
 389
 390 typedef struct
 391 {
 392         // the hull we're tracing through
 393         const hull_t *hull;
 394
 395         // the trace structure to fill in
 396         trace_t *trace;
 397
 398         // start, end, and end - start (in model space)
 399         double start[3];
 400         double end[3];
 401         double dist[3];
 402 }
 403 RecursiveHullCheckTraceInfo_t;
 404
 405 // 1/32 epsilon to keep floating point happy
 406 #define DIST_EPSILON (0.03125)
 407
 408 #define HULLCHECKSTATE_EMPTY 0
 409 #define HULLCHECKSTATE_SOLID 1
 410 #define HULLCHECKSTATE_DONE 2
 411
 412 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
 413 {
 414         // status variables, these don't need to be saved on the stack when
 415         // recursing...  but are because this should be thread-safe
 416         // (note: tracing against a bbox is not thread-safe, yet)
 417         int ret;
 418         mplane_t *plane;
 419         double t1, t2;
 420
 421         // variables that need to be stored on the stack when recursing
 422         dclipnode_t *node;
 423         int side;
 424         double midf, mid[3];
 425
 426         // LordHavoc: a goto!  everyone flee in terror... :)
 427 loc0:
 428         // check for empty
 429         if (num < 0)
 430         {
 431                 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
 432                 if (!t->trace->startfound)
 433                 {
 434                         t->trace->startfound = true;
 435                         t->trace->startsupercontents |= num;
 436                 }
 437                 if (num & SUPERCONTENTS_LIQUIDSMASK)
 438                         t->trace->inwater = true;
 439                 if (num == 0)
 440                         t->trace->inopen = true;
 441                 if (num & t->trace->hitsupercontentsmask)
 442                 {
 443                         // if the first leaf is solid, set startsolid
 444                         if (t->trace->allsolid)
 445                                 t->trace->startsolid = true;
 446 #if COLLISIONPARANOID >= 3
 447                         Con_Print("S");
 448 #endif
 449                         return HULLCHECKSTATE_SOLID;
 450                 }
 451                 else
 452                 {
 453                         t->trace->allsolid = false;
 454 #if COLLISIONPARANOID >= 3
 455                         Con_Print("E");
 456 #endif
 457                         return HULLCHECKSTATE_EMPTY;
 458                 }
 459         }
 460
 461         // find the point distances
 462         node = t->hull->clipnodes + num;
 463
 464         plane = t->hull->planes + node->planenum;
 465         if (plane->type < 3)
 466         {
 467                 t1 = p1[plane->type] - plane->dist;
 468                 t2 = p2[plane->type] - plane->dist;
 469         }
 470         else
 471         {
 472                 t1 = DotProduct (plane->normal, p1) - plane->dist;
 473                 t2 = DotProduct (plane->normal, p2) - plane->dist;
 474         }
 475
 476         if (t1 < 0)
 477         {
 478                 if (t2 < 0)
 479                 {
 480 #if COLLISIONPARANOID >= 3
 481                         Con_Print("<");
 482 #endif
 483                         num = node->children[1];
 484                         goto loc0;
 485                 }
 486                 side = 1;
 487         }
 488         else
 489         {
 490                 if (t2 >= 0)
 491                 {
 492 #if COLLISIONPARANOID >= 3
 493                         Con_Print(">");
 494 #endif
 495                         num = node->children[0];
 496                         goto loc0;
 497                 }
 498                 side = 0;
 499         }
 500
 501         // the line intersects, find intersection point
 502         // LordHavoc: this uses the original trace for maximum accuracy
 503 #if COLLISIONPARANOID >= 3
 504         Con_Print("M");
 505 #endif
 506         if (plane->type < 3)
 507         {
 508                 t1 = t->start[plane->type] - plane->dist;
 509                 t2 = t->end[plane->type] - plane->dist;
 510         }
 511         else
 512         {
 513                 t1 = DotProduct (plane->normal, t->start) - plane->dist;
 514                 t2 = DotProduct (plane->normal, t->end) - plane->dist;
 515         }
 516
 517         midf = t1 / (t1 - t2);
 518         midf = bound(p1f, midf, p2f);
 519         VectorMA(t->start, midf, t->dist, mid);
 520
 521         // recurse both sides, front side first
 522         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
 523         // if this side is not empty, return what it is (solid or done)
 524         if (ret != HULLCHECKSTATE_EMPTY)
 525                 return ret;
 526
 527         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
 528         // if other side is not solid, return what it is (empty or done)
 529         if (ret != HULLCHECKSTATE_SOLID)
 530                 return ret;
 531
 532         // front is air and back is solid, this is the impact point...
 533         if (side)
 534         {
 535                 t->trace->plane.dist = -plane->dist;
 536                 VectorNegate (plane->normal, t->trace->plane.normal);
 537         }
 538         else
 539         {
 540                 t->trace->plane.dist = plane->dist;
 541                 VectorCopy (plane->normal, t->trace->plane.normal);
 542         }
 543
 544         // calculate the true fraction
 545         t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
 546         t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
 547         midf = t1 / (t1 - t2);
 548         t->trace->realfraction = bound(0, midf, 1);
 549
 550         // calculate the return fraction which is nudged off the surface a bit
 551         midf = (t1 - DIST_EPSILON) / (t1 - t2);
 552         t->trace->fraction = bound(0, midf, 1);
 553
 554 #if COLLISIONPARANOID >= 3
 555         Con_Print("D");
 556 #endif
 557         return HULLCHECKSTATE_DONE;
 558 }
 559
 560 #if COLLISIONPARANOID < 2
 561 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
 562 {
 563         while (num >= 0)
 564                 num = t->hull->clipnodes[num].children[(t->hull->planes[t->hull->clipnodes[num].planenum].type < 3 ? t->start[t->hull->planes[t->hull->clipnodes[num].planenum].type] : DotProduct(t->hull->planes[t->hull->clipnodes[num].planenum].normal, t->start)) < t->hull->planes[t->hull->clipnodes[num].planenum].dist];
 565         num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
 566         t->trace->startsupercontents |= num;
 567         if (num & SUPERCONTENTS_LIQUIDSMASK)
 568                 t->trace->inwater = true;
 569         if (num == 0)
 570                 t->trace->inopen = true;
 571         if (num & t->trace->hitsupercontentsmask)
 572         {
 573                 t->trace->allsolid = t->trace->startsolid = true;
 574                 return HULLCHECKSTATE_SOLID;
 575         }
 576         else
 577         {
 578                 t->trace->allsolid = t->trace->startsolid = false;
 579                 return HULLCHECKSTATE_EMPTY;
 580         }
 581 }
 582 #endif
 583
 584 static void Mod_Q1BSP_TraceBox(struct model_s *model, int frame, trace_t *trace, const vec3_t boxstartmins, const vec3_t boxstartmaxs, const vec3_t boxendmins, const vec3_t boxendmaxs, int hitsupercontentsmask)
 585 {
 586         // this function currently only supports same size start and end
 587         double boxsize[3];
 588         RecursiveHullCheckTraceInfo_t rhc;
 589
 590         memset(&rhc, 0, sizeof(rhc));
 591         memset(trace, 0, sizeof(trace_t));
 592         rhc.trace = trace;
 593         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 594         rhc.trace->fraction = 1;
 595         rhc.trace->realfraction = 1;
 596         rhc.trace->allsolid = true;
 597         VectorSubtract(boxstartmaxs, boxstartmins, boxsize);
 598         if (boxsize[0] < 3)
 599                 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
 600         else if (model->brush.ishlbsp)
 601         {
 602                 // LordHavoc: this has to have a minor tolerance (the .1) because of
 603                 // minor float precision errors from the box being transformed around
 604                 if (boxsize[0] < 32.1)
 605                 {
 606                         if (boxsize[2] < 54) // pick the nearest of 36 or 72
 607                                 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
 608                         else
 609                                 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
 610                 }
 611                 else
 612                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
 613         }
 614         else
 615         {
 616                 // LordHavoc: this has to have a minor tolerance (the .1) because of
 617                 // minor float precision errors from the box being transformed around
 618                 if (boxsize[0] < 32.1)
 619                         rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
 620                 else
 621                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
 622         }
 623         VectorSubtract(boxstartmins, rhc.hull->clip_mins, rhc.start);
 624         VectorSubtract(boxendmins, rhc.hull->clip_mins, rhc.end);
 625         VectorSubtract(rhc.end, rhc.start, rhc.dist);
 626 #if COLLISIONPARANOID >= 2
 627         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]);
 628         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 629         Con_Print("\n");
 630 #else
 631         if (DotProduct(rhc.dist, rhc.dist))
 632                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 633         else
 634                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 635 #endif
 636 }
 637
 638 static hull_t box_hull;
 639 static dclipnode_t box_clipnodes[6];
 640 static mplane_t box_planes[6];
 641
 642 static void Mod_Q1BSP_Collision_Init (void)
 643 {
 644         int             i;
 645         int             side;
 646
 647         //Set up the planes and clipnodes so that the six floats of a bounding box
 648         //can just be stored out and get a proper hull_t structure.
 649
 650         box_hull.clipnodes = box_clipnodes;
 651         box_hull.planes = box_planes;
 652         box_hull.firstclipnode = 0;
 653         box_hull.lastclipnode = 5;
 654
 655         for (i = 0;i < 6;i++)
 656         {
 657                 box_clipnodes[i].planenum = i;
 658
 659                 side = i&1;
 660
 661                 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
 662                 if (i != 5)
 663                         box_clipnodes[i].children[side^1] = i + 1;
 664                 else
 665                         box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
 666
 667                 box_planes[i].type = i>>1;
 668                 box_planes[i].normal[i>>1] = 1;
 669         }
 670 }
 671
 672 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)
 673 {
 674 #if 1
 675         colbrushf_t cbox;
 676         colplanef_t cbox_planes[6];
 677         cbox.supercontents = boxsupercontents;
 678         cbox.numplanes = 6;
 679         cbox.numpoints = 0;
 680         cbox.numtriangles = 0;
 681         cbox.planes = cbox_planes;
 682         cbox.points = NULL;
 683         cbox.elements = NULL;
 684         cbox.markframe = 0;
 685         cbox.mins[0] = 0;
 686         cbox.mins[1] = 0;
 687         cbox.mins[2] = 0;
 688         cbox.maxs[0] = 0;
 689         cbox.maxs[1] = 0;
 690         cbox.maxs[2] = 0;
 691         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];
 692         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];
 693         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];
 694         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];
 695         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];
 696         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];
 697         memset(trace, 0, sizeof(trace_t));
 698         trace->hitsupercontentsmask = hitsupercontentsmask;
 699         trace->fraction = 1;
 700         trace->realfraction = 1;
 701         Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
 702 #else
 703         RecursiveHullCheckTraceInfo_t rhc;
 704         // fill in a default trace
 705         memset(&rhc, 0, sizeof(rhc));
 706         memset(trace, 0, sizeof(trace_t));
 707         //To keep everything totally uniform, bounding boxes are turned into small
 708         //BSP trees instead of being compared directly.
 709         // create a temp hull from bounding box sizes
 710         box_planes[0].dist = cmaxs[0] - mins[0];
 711         box_planes[1].dist = cmins[0] - maxs[0];
 712         box_planes[2].dist = cmaxs[1] - mins[1];
 713         box_planes[3].dist = cmins[1] - maxs[1];
 714         box_planes[4].dist = cmaxs[2] - mins[2];
 715         box_planes[5].dist = cmins[2] - maxs[2];
 716 #if COLLISIONPARANOID >= 3
 717         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]);
 718 #endif
 719         // trace a line through the generated clipping hull
 720         //rhc.boxsupercontents = boxsupercontents;
 721         rhc.hull = &box_hull;
 722         rhc.trace = trace;
 723         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 724         rhc.trace->fraction = 1;
 725         rhc.trace->realfraction = 1;
 726         rhc.trace->allsolid = true;
 727         VectorCopy(start, rhc.start);
 728         VectorCopy(end, rhc.end);
 729         VectorSubtract(rhc.end, rhc.start, rhc.dist);
 730         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 731         //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
 732         if (rhc.trace->startsupercontents)
 733                 rhc.trace->startsupercontents = boxsupercontents;
 734 #endif
 735 }
 736
 737 static int Mod_Q1BSP_LightPoint_RecursiveBSPNode(vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal, const mnode_t *node, float x, float y, float startz, float endz)
 738 {
 739         int side, distz = endz - startz;
 740         float front, back;
 741         float mid;
 742
 743 loc0:
 744         if (node->contents < 0)
 745                 return false;           // didn't hit anything
 746
 747         switch (node->plane->type)
 748         {
 749         case PLANE_X:
 750                 node = node->children[x < node->plane->dist];
 751                 goto loc0;
 752         case PLANE_Y:
 753                 node = node->children[y < node->plane->dist];
 754                 goto loc0;
 755         case PLANE_Z:
 756                 side = startz < node->plane->dist;
 757                 if ((endz < node->plane->dist) == side)
 758                 {
 759                         node = node->children[side];
 760                         goto loc0;
 761                 }
 762                 // found an intersection
 763                 mid = node->plane->dist;
 764                 break;
 765         default:
 766                 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
 767                 front += startz * node->plane->normal[2];
 768                 back += endz * node->plane->normal[2];
 769                 side = front < node->plane->dist;
 770                 if ((back < node->plane->dist) == side)
 771                 {
 772                         node = node->children[side];
 773                         goto loc0;
 774                 }
 775                 // found an intersection
 776                 mid = startz + distz * (front - node->plane->dist) / (front - back);
 777                 break;
 778         }
 779
 780         // go down front side
 781         if (node->children[side]->contents >= 0 && Mod_Q1BSP_LightPoint_RecursiveBSPNode(ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
 782                 return true;    // hit something
 783         else
 784         {
 785                 // check for impact on this node
 786                 if (node->numsurfaces)
 787                 {
 788                         int i, ds, dt;
 789                         msurface_t *surf;
 790
 791                         surf = r_refdef.worldmodel->brushq1.surfaces + node->firstsurface;
 792                         for (i = 0;i < node->numsurfaces;i++, surf++)
 793                         {
 794                                 if (!(surf->flags & SURF_LIGHTMAP) || !surf->samples)
 795                                         continue;       // no lightmaps
 796
 797                                 ds = (int) (x * surf->texinfo->vecs[0][0] + y * surf->texinfo->vecs[0][1] + mid * surf->texinfo->vecs[0][2] + surf->texinfo->vecs[0][3]) - surf->texturemins[0];
 798                                 dt = (int) (x * surf->texinfo->vecs[1][0] + y * surf->texinfo->vecs[1][1] + mid * surf->texinfo->vecs[1][2] + surf->texinfo->vecs[1][3]) - surf->texturemins[1];
 799
 800                                 if (ds >= 0 && ds < surf->extents[0] && dt >= 0 && dt < surf->extents[1])
 801                                 {
 802                                         qbyte *lightmap;
 803                                         int lmwidth, lmheight, maps, line3, size3, dsfrac = ds & 15, dtfrac = dt & 15, scale = 0, r00 = 0, g00 = 0, b00 = 0, r01 = 0, g01 = 0, b01 = 0, r10 = 0, g10 = 0, b10 = 0, r11 = 0, g11 = 0, b11 = 0;
 804                                         lmwidth = ((surf->extents[0]>>4)+1);
 805                                         lmheight = ((surf->extents[1]>>4)+1);
 806                                         line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
 807                                         size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
 808
 809                                         lightmap = surf->samples + ((dt>>4) * lmwidth + (ds>>4))*3; // LordHavoc: *3 for colored lighting
 810
 811                                         for (maps = 0;maps < MAXLIGHTMAPS && surf->styles[maps] != 255;maps++)
 812                                         {
 813                                                 scale = d_lightstylevalue[surf->styles[maps]];
 814                                                 r00 += lightmap[      0] * scale;g00 += lightmap[      1] * scale;b00 += lightmap[      2] * scale;
 815                                                 r01 += lightmap[      3] * scale;g01 += lightmap[      4] * scale;b01 += lightmap[      5] * scale;
 816                                                 r10 += lightmap[line3+0] * scale;g10 += lightmap[line3+1] * scale;b10 += lightmap[line3+2] * scale;
 817                                                 r11 += lightmap[line3+3] * scale;g11 += lightmap[line3+4] * scale;b11 += lightmap[line3+5] * scale;
 818                                                 lightmap += size3;
 819                                         }
 820
 821 /*
 822 LordHavoc: here's the readable version of the interpolation
 823 code, not quite as easy for the compiler to optimize...
 824
 825 dsfrac is the X position in the lightmap pixel, * 16
 826 dtfrac is the Y position in the lightmap pixel, * 16
 827 r00 is top left corner, r01 is top right corner
 828 r10 is bottom left corner, r11 is bottom right corner
 829 g and b are the same layout.
 830 r0 and r1 are the top and bottom intermediate results
 831
 832 first we interpolate the top two points, to get the top
 833 edge sample
 834
 835         r0 = (((r01-r00) * dsfrac) >> 4) + r00;
 836         g0 = (((g01-g00) * dsfrac) >> 4) + g00;
 837         b0 = (((b01-b00) * dsfrac) >> 4) + b00;
 838
 839 then we interpolate the bottom two points, to get the
 840 bottom edge sample
 841
 842         r1 = (((r11-r10) * dsfrac) >> 4) + r10;
 843         g1 = (((g11-g10) * dsfrac) >> 4) + g10;
 844         b1 = (((b11-b10) * dsfrac) >> 4) + b10;
 845
 846 then we interpolate the top and bottom samples to get the
 847 middle sample (the one which was requested)
 848
 849         r = (((r1-r0) * dtfrac) >> 4) + r0;
 850         g = (((g1-g0) * dtfrac) >> 4) + g0;
 851         b = (((b1-b0) * dtfrac) >> 4) + b0;
 852 */
 853
 854                                         ambientcolor[0] += (float) ((((((((r11-r10) * dsfrac) >> 4) + r10)-((((r01-r00) * dsfrac) >> 4) + r00)) * dtfrac) >> 4) + ((((r01-r00) * dsfrac) >> 4) + r00)) * (1.0f / 32768.0f);
 855                                         ambientcolor[1] += (float) ((((((((g11-g10) * dsfrac) >> 4) + g10)-((((g01-g00) * dsfrac) >> 4) + g00)) * dtfrac) >> 4) + ((((g01-g00) * dsfrac) >> 4) + g00)) * (1.0f / 32768.0f);
 856                                         ambientcolor[2] += (float) ((((((((b11-b10) * dsfrac) >> 4) + b10)-((((b01-b00) * dsfrac) >> 4) + b00)) * dtfrac) >> 4) + ((((b01-b00) * dsfrac) >> 4) + b00)) * (1.0f / 32768.0f);
 857                                         return true; // success
 858                                 }
 859                         }
 860                 }
 861
 862                 // go down back side
 863                 node = node->children[side ^ 1];
 864                 startz = mid;
 865                 distz = endz - startz;
 866                 goto loc0;
 867         }
 868 }
 869
 870 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
 871 {
 872         Mod_Q1BSP_LightPoint_RecursiveBSPNode(ambientcolor, diffusecolor, diffusenormal, model->brushq1.nodes + model->brushq1.hulls[0].firstclipnode, p[0], p[1], p[2], p[2] - 65536);
 873 }
 874
 875 static void Mod_Q1BSP_DecompressVis(const qbyte *in, const qbyte *inend, qbyte *out, qbyte *outend)
 876 {
 877         int c;
 878         qbyte *outstart = out;
 879         while (out < outend)
 880         {
 881                 if (in == inend)
 882                 {
 883                         Con_Printf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
 884                         return;
 885                 }
 886                 c = *in++;
 887                 if (c)
 888                         *out++ = c;
 889                 else
 890                 {
 891                         if (in == inend)
 892                         {
 893                                 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun (during zero-run) on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
 894                                 return;
 895                         }
 896                         for (c = *in++;c > 0;c--)
 897                         {
 898                                 if (out == outend)
 899                                 {
 900                                         Con_Printf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
 901                                         return;
 902                                 }
 903                                 *out++ = 0;
 904                         }
 905                 }
 906         }
 907 }
 908
 909 /*
 910 =============
 911 R_Q1BSP_LoadSplitSky
 912
 913 A sky texture is 256*128, with the right side being a masked overlay
 914 ==============
 915 */
 916 void R_Q1BSP_LoadSplitSky (qbyte *src, int width, int height, int bytesperpixel)
 917 {
 918         int i, j;
 919         unsigned solidpixels[128*128], alphapixels[128*128];
 920
 921         // if sky isn't the right size, just use it as a solid layer
 922         if (width != 256 || height != 128)
 923         {
 924                 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", width, height, src, bytesperpixel == 4 ? TEXTYPE_RGBA : TEXTYPE_PALETTE, TEXF_PRECACHE, bytesperpixel == 1 ? palette_complete : NULL);
 925                 loadmodel->brush.alphaskytexture = NULL;;
 926                 return;
 927         }
 928
 929         if (bytesperpixel == 4)
 930         {
 931                 for (i = 0;i < 128;i++)
 932                 {
 933                         for (j = 0;j < 128;j++)
 934                         {
 935                                 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
 936                                 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
 937                         }
 938                 }
 939         }
 940         else
 941         {
 942                 // make an average value for the back to avoid
 943                 // a fringe on the top level
 944                 int p, r, g, b;
 945                 union
 946                 {
 947                         unsigned int i;
 948                         unsigned char b[4];
 949                 }
 950                 rgba;
 951                 r = g = b = 0;
 952                 for (i = 0;i < 128;i++)
 953                 {
 954                         for (j = 0;j < 128;j++)
 955                         {
 956                                 rgba.i = palette_complete[src[i*256 + j + 128]];
 957                                 r += rgba.b[0];
 958                                 g += rgba.b[1];
 959                                 b += rgba.b[2];
 960                         }
 961                 }
 962                 rgba.b[0] = r/(128*128);
 963                 rgba.b[1] = g/(128*128);
 964                 rgba.b[2] = b/(128*128);
 965                 rgba.b[3] = 0;
 966                 for (i = 0;i < 128;i++)
 967                 {
 968                         for (j = 0;j < 128;j++)
 969                         {
 970                                 solidpixels[(i*128) + j] = palette_complete[src[i*256 + j + 128]];
 971                                 alphapixels[(i*128) + j] = (p = src[i*256 + j]) ? palette_complete[p] : rgba.i;
 972                         }
 973                 }
 974         }
 975
 976         loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (qbyte *) solidpixels, TEXTYPE_RGBA, TEXF_PRECACHE, NULL);
 977         loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (qbyte *) alphapixels, TEXTYPE_RGBA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
 978 }
 979
 980 static void Mod_Q1BSP_LoadTextures(lump_t *l)
 981 {
 982         int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
 983         miptex_t *dmiptex;
 984         texture_t *tx, *tx2, *anims[10], *altanims[10];
 985         dmiptexlump_t *m;
 986         qbyte *data, *mtdata;
 987         char name[256];
 988
 989         loadmodel->brushq1.textures = NULL;
 990
 991         // add two slots for notexture walls and notexture liquids
 992         if (l->filelen)
 993         {
 994                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
 995                 m->nummiptex = LittleLong (m->nummiptex);
 996                 loadmodel->brushq1.numtextures = m->nummiptex + 2;
 997         }
 998         else
 999         {
1000                 m = NULL;
1001                 loadmodel->brushq1.numtextures = 2;
1002         }
1003
1004         loadmodel->brushq1.textures = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numtextures * sizeof(texture_t));
1005
1006         // fill out all slots with notexture
1007         for (i = 0, tx = loadmodel->brushq1.textures;i < loadmodel->brushq1.numtextures;i++, tx++)
1008         {
1009                 tx->number = i;
1010                 strcpy(tx->name, "NO TEXTURE FOUND");
1011                 tx->width = 16;
1012                 tx->height = 16;
1013                 tx->skin.base = r_notexture;
1014                 if (i == loadmodel->brushq1.numtextures - 1)
1015                         tx->flags = SURF_DRAWTURB | SURF_LIGHTBOTHSIDES;
1016                 else
1017                         tx->flags = SURF_LIGHTMAP | SURF_SOLIDCLIP;
1018                 tx->currentframe = tx;
1019         }
1020
1021         if (!m)
1022                 return;
1023
1024         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1025         dofs = m->dataofs;
1026         // LordHavoc: mostly rewritten map texture loader
1027         for (i = 0;i < m->nummiptex;i++)
1028         {
1029                 dofs[i] = LittleLong(dofs[i]);
1030                 if (dofs[i] == -1 || r_nosurftextures.integer)
1031                         continue;
1032                 dmiptex = (miptex_t *)((qbyte *)m + dofs[i]);
1033
1034                 // make sure name is no more than 15 characters
1035                 for (j = 0;dmiptex->name[j] && j < 15;j++)
1036                         name[j] = dmiptex->name[j];
1037                 name[j] = 0;
1038
1039                 mtwidth = LittleLong(dmiptex->width);
1040                 mtheight = LittleLong(dmiptex->height);
1041                 mtdata = NULL;
1042                 j = LittleLong(dmiptex->offsets[0]);
1043                 if (j)
1044                 {
1045                         // texture included
1046                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1047                         {
1048                                 Con_Printf("Texture \"%s\" in \"%s\"is corrupt or incomplete\n", dmiptex->name, loadmodel->name);
1049                                 continue;
1050                         }
1051                         mtdata = (qbyte *)dmiptex + j;
1052                 }
1053
1054                 if ((mtwidth & 15) || (mtheight & 15))
1055                         Con_Printf("warning: texture \"%s\" in \"%s\" is not 16 aligned\n", dmiptex->name, loadmodel->name);
1056
1057                 // LordHavoc: force all names to lowercase
1058                 for (j = 0;name[j];j++)
1059                         if (name[j] >= 'A' && name[j] <= 'Z')
1060                                 name[j] += 'a' - 'A';
1061
1062                 tx = loadmodel->brushq1.textures + i;
1063                 strcpy(tx->name, name);
1064                 tx->width = mtwidth;
1065                 tx->height = mtheight;
1066
1067                 if (!tx->name[0])
1068                 {
1069                         sprintf(tx->name, "unnamed%i", i);
1070                         Con_Printf("warning: unnamed texture in %s, renaming to %s\n", loadmodel->name, tx->name);
1071                 }
1072
1073                 // LordHavoc: HL sky textures are entirely different than quake
1074                 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1075                 {
1076                         if (loadmodel->isworldmodel)
1077                         {
1078                                 data = loadimagepixels(tx->name, false, 0, 0);
1079                                 if (data)
1080                                 {
1081                                         R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1082                                         Mem_Free(data);
1083                                 }
1084                                 else if (mtdata != NULL)
1085                                         R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1086                         }
1087                 }
1088                 else
1089                 {
1090                         if (!Mod_LoadSkinFrame(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, true, true))
1091                         {
1092                                 // did not find external texture, load it from the bsp or wad3
1093                                 if (loadmodel->brush.ishlbsp)
1094                                 {
1095                                         // internal texture overrides wad
1096                                         qbyte *pixels, *freepixels, *fogpixels;
1097                                         pixels = freepixels = NULL;
1098                                         if (mtdata)
1099                                                 pixels = W_ConvertWAD3Texture(dmiptex);
1100                                         if (pixels == NULL)
1101                                                 pixels = freepixels = W_GetTexture(tx->name);
1102                                         if (pixels != NULL)
1103                                         {
1104                                                 tx->width = image_width;
1105                                                 tx->height = image_height;
1106                                                 tx->skin.base = tx->skin.merged = R_LoadTexture2D(loadmodel->texturepool, tx->name, image_width, image_height, pixels, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, NULL);
1107                                                 if (Image_CheckAlpha(pixels, image_width * image_height, true))
1108                                                 {
1109                                                         fogpixels = Mem_Alloc(tempmempool, image_width * image_height * 4);
1110                                                         for (j = 0;j < image_width * image_height * 4;j += 4)
1111                                                         {
1112                                                                 fogpixels[j + 0] = 255;
1113                                                                 fogpixels[j + 1] = 255;
1114                                                                 fogpixels[j + 2] = 255;
1115                                                                 fogpixels[j + 3] = pixels[j + 3];
1116                                                         }
1117                                                         tx->skin.fog = R_LoadTexture2D(loadmodel->texturepool, tx->name, image_width, image_height, pixels, TEXTYPE_RGBA, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, NULL);
1118                                                         Mem_Free(fogpixels);
1119                                                 }
1120                                         }
1121                                         if (freepixels)
1122                                                 Mem_Free(freepixels);
1123                                 }
1124                                 else if (mtdata) // texture included
1125                                         Mod_LoadSkinFrame_Internal(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_PICMIP, false, true, tx->name[0] != '*' && r_fullbrights.integer, mtdata, tx->width, tx->height);
1126                         }
1127                 }
1128                 if (tx->skin.base == NULL)
1129                 {
1130                         // no texture found
1131                         tx->width = 16;
1132                         tx->height = 16;
1133                         tx->skin.base = r_notexture;
1134                 }
1135
1136                 if (tx->name[0] == '*')
1137                 {
1138                         // turb does not block movement
1139                         tx->flags = SURF_DRAWTURB | SURF_LIGHTBOTHSIDES;
1140                         // LordHavoc: some turbulent textures should be fullbright and solid
1141                         if (!strncmp(tx->name,"*lava",5)
1142                          || !strncmp(tx->name,"*teleport",9)
1143                          || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1144                                 tx->flags |= SURF_DRAWFULLBRIGHT | SURF_DRAWNOALPHA;
1145                         else
1146                                 tx->flags |= SURF_WATERALPHA;
1147                 }
1148                 else if (tx->name[0] == 's' && tx->name[1] == 'k' && tx->name[2] == 'y')
1149                         tx->flags = SURF_DRAWSKY | SURF_SOLIDCLIP;
1150                 else
1151                         tx->flags = SURF_LIGHTMAP | SURF_SOLIDCLIP;
1152
1153                 // start out with no animation
1154                 tx->currentframe = tx;
1155         }
1156
1157         // sequence the animations
1158         for (i = 0;i < m->nummiptex;i++)
1159         {
1160                 tx = loadmodel->brushq1.textures + i;
1161                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1162                         continue;
1163                 if (tx->anim_total[0] || tx->anim_total[1])
1164                         continue;       // already sequenced
1165
1166                 // find the number of frames in the animation
1167                 memset(anims, 0, sizeof(anims));
1168                 memset(altanims, 0, sizeof(altanims));
1169
1170                 for (j = i;j < m->nummiptex;j++)
1171                 {
1172                         tx2 = loadmodel->brushq1.textures + j;
1173                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1174                                 continue;
1175
1176                         num = tx2->name[1];
1177                         if (num >= '0' && num <= '9')
1178                                 anims[num - '0'] = tx2;
1179                         else if (num >= 'a' && num <= 'j')
1180                                 altanims[num - 'a'] = tx2;
1181                         else
1182                                 Con_Printf("Bad animating texture %s\n", tx->name);
1183                 }
1184
1185                 max = altmax = 0;
1186                 for (j = 0;j < 10;j++)
1187                 {
1188                         if (anims[j])
1189                                 max = j + 1;
1190                         if (altanims[j])
1191                                 altmax = j + 1;
1192                 }
1193                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1194
1195                 incomplete = false;
1196                 for (j = 0;j < max;j++)
1197                 {
1198                         if (!anims[j])
1199                         {
1200                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1201                                 incomplete = true;
1202                         }
1203                 }
1204                 for (j = 0;j < altmax;j++)
1205                 {
1206                         if (!altanims[j])
1207                         {
1208                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1209                                 incomplete = true;
1210                         }
1211                 }
1212                 if (incomplete)
1213                         continue;
1214
1215                 if (altmax < 1)
1216                 {
1217                         // if there is no alternate animation, duplicate the primary
1218                         // animation into the alternate
1219                         altmax = max;
1220                         for (k = 0;k < 10;k++)
1221                                 altanims[k] = anims[k];
1222                 }
1223
1224                 // link together the primary animation
1225                 for (j = 0;j < max;j++)
1226                 {
1227                         tx2 = anims[j];
1228                         tx2->animated = true;
1229                         tx2->anim_total[0] = max;
1230                         tx2->anim_total[1] = altmax;
1231                         for (k = 0;k < 10;k++)
1232                         {
1233                                 tx2->anim_frames[0][k] = anims[k];
1234                                 tx2->anim_frames[1][k] = altanims[k];
1235                         }
1236                 }
1237
1238                 // if there really is an alternate anim...
1239                 if (anims[0] != altanims[0])
1240                 {
1241                         // link together the alternate animation
1242                         for (j = 0;j < altmax;j++)
1243                         {
1244                                 tx2 = altanims[j];
1245                                 tx2->animated = true;
1246                                 // the primary/alternate are reversed here
1247                                 tx2->anim_total[0] = altmax;
1248                                 tx2->anim_total[1] = max;
1249                                 for (k = 0;k < 10;k++)
1250                                 {
1251                                         tx2->anim_frames[0][k] = altanims[k];
1252                                         tx2->anim_frames[1][k] = anims[k];
1253                                 }
1254                         }
1255                 }
1256         }
1257 }
1258
1259 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1260 {
1261         int i;
1262         qbyte *in, *out, *data, d;
1263         char litfilename[1024];
1264         loadmodel->brushq1.lightdata = NULL;
1265         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1266         {
1267                 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen);
1268                 for (i=0; i<l->filelen; i++)
1269                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1270         }
1271         else // LordHavoc: bsp version 29 (normal white lighting)
1272         {
1273                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1274                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1275                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1276                 strlcat (litfilename, ".lit", sizeof (litfilename));
1277                 data = (qbyte*) FS_LoadFile(litfilename, tempmempool, false);
1278                 if (data)
1279                 {
1280                         if (fs_filesize > 8 && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1281                         {
1282                                 i = LittleLong(((int *)data)[1]);
1283                                 if (i == 1)
1284                                 {
1285                                         Con_DPrintf("loaded %s\n", litfilename);
1286                                         loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, fs_filesize - 8);
1287                                         memcpy(loadmodel->brushq1.lightdata, data + 8, fs_filesize - 8);
1288                                         Mem_Free(data);
1289                                         return;
1290                                 }
1291                                 else
1292                                 {
1293                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1294                                         Mem_Free(data);
1295                                 }
1296                         }
1297                         else
1298                         {
1299                                 if (fs_filesize == 8)
1300                                         Con_Print("Empty .lit file, ignoring\n");
1301                                 else
1302                                         Con_Print("Corrupt .lit file (old version?), ignoring\n");
1303                                 Mem_Free(data);
1304                         }
1305                 }
1306                 // LordHavoc: oh well, expand the white lighting data
1307                 if (!l->filelen)
1308                         return;
1309                 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen*3);
1310                 in = loadmodel->brushq1.lightdata + l->filelen*2; // place the file at the end, so it will not be overwritten until the very last write
1311                 out = loadmodel->brushq1.lightdata;
1312                 memcpy(in, mod_base + l->fileofs, l->filelen);
1313                 for (i = 0;i < l->filelen;i++)
1314                 {
1315                         d = *in++;
1316                         *out++ = d;
1317                         *out++ = d;
1318                         *out++ = d;
1319                 }
1320         }
1321 }
1322
1323 static void Mod_Q1BSP_LoadLightList(void)
1324 {
1325         int a, n, numlights;
1326         char tempchar, *s, *t, *lightsstring, lightsfilename[1024];
1327         mlight_t *e;
1328
1329         strlcpy (lightsfilename, loadmodel->name, sizeof (lightsfilename));
1330         FS_StripExtension (lightsfilename, lightsfilename, sizeof(lightsfilename));
1331         strlcat (lightsfilename, ".lights", sizeof (lightsfilename));
1332         s = lightsstring = (char *) FS_LoadFile(lightsfilename, tempmempool, false);
1333         if (s)
1334         {
1335                 numlights = 0;
1336                 while (*s)
1337                 {
1338                         while (*s && *s != '\n' && *s != '\r')
1339                                 s++;
1340                         if (!*s)
1341                         {
1342                                 Mem_Free(lightsstring);
1343                                 Con_Printf("lights file must end with a newline\n");
1344                                 return;
1345                         }
1346                         s++;
1347                         numlights++;
1348                 }
1349                 loadmodel->brushq1.lights = Mem_Alloc(loadmodel->mempool, numlights * sizeof(mlight_t));
1350                 s = lightsstring;
1351                 n = 0;
1352                 while (*s && n < numlights)
1353                 {
1354                         t = s;
1355                         while (*s && *s != '\n' && *s != '\r')
1356                                 s++;
1357                         if (!*s)
1358                         {
1359                                 Con_Printf("misparsed lights file!\n");
1360                                 break;
1361                         }
1362                         e = loadmodel->brushq1.lights + n;
1363                         tempchar = *s;
1364                         *s = 0;
1365                         a = sscanf(t, "%f %f %f %f %f %f %f %f %f %f %f %f %f %d", &e->origin[0], &e->origin[1], &e->origin[2], &e->falloff, &e->light[0], &e->light[1], &e->light[2], &e->subtract, &e->spotdir[0], &e->spotdir[1], &e->spotdir[2], &e->spotcone, &e->distbias, &e->style);
1366                         *s = tempchar;
1367                         if (a != 14)
1368                         {
1369                                 Con_Printf("invalid lights file, found %d parameters on line %i, should be 14 parameters (origin[0] origin[1] origin[2] falloff light[0] light[1] light[2] subtract spotdir[0] spotdir[1] spotdir[2] spotcone distancebias style)\n", a, n + 1);
1370                                 break;
1371                         }
1372                         if (*s == '\r')
1373                                 s++;
1374                         if (*s == '\n')
1375                                 s++;
1376                         n++;
1377                 }
1378                 if (*s)
1379                         Con_Printf("misparsed lights file!\n");
1380                 loadmodel->brushq1.numlights = numlights;
1381                 Mem_Free(lightsstring);
1382         }
1383 }
1384
1385 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1386 {
1387         loadmodel->brushq1.num_compressedpvs = 0;
1388         loadmodel->brushq1.data_compressedpvs = NULL;
1389         if (!l->filelen)
1390                 return;
1391         loadmodel->brushq1.num_compressedpvs = l->filelen;
1392         loadmodel->brushq1.data_compressedpvs = Mem_Alloc(loadmodel->mempool, l->filelen);
1393         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1394 }
1395
1396 // used only for HalfLife maps
1397 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1398 {
1399         char key[128], value[4096];
1400         char wadname[128];
1401         int i, j, k;
1402         if (!data)
1403                 return;
1404         if (!COM_ParseToken(&data, false))
1405                 return; // error
1406         if (com_token[0] != '{')
1407                 return; // error
1408         while (1)
1409         {
1410                 if (!COM_ParseToken(&data, false))
1411                         return; // error
1412                 if (com_token[0] == '}')
1413                         break; // end of worldspawn
1414                 if (com_token[0] == '_')
1415                         strcpy(key, com_token + 1);
1416                 else
1417                         strcpy(key, com_token);
1418                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1419                         key[strlen(key)-1] = 0;
1420                 if (!COM_ParseToken(&data, false))
1421                         return; // error
1422                 strcpy(value, com_token);
1423                 if (!strcmp("wad", key)) // for HalfLife maps
1424                 {
1425                         if (loadmodel->brush.ishlbsp)
1426                         {
1427                                 j = 0;
1428                                 for (i = 0;i < 4096;i++)
1429                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1430                                                 break;
1431                                 if (value[i])
1432                                 {
1433                                         for (;i < 4096;i++)
1434                                         {
1435                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1436                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1437                                                         j = i+1;
1438                                                 else if (value[i] == ';' || value[i] == 0)
1439                                                 {
1440                                                         k = value[i];
1441                                                         value[i] = 0;
1442                                                         strcpy(wadname, "textures/");
1443                                                         strcat(wadname, &value[j]);
1444                                                         W_LoadTextureWadFile(wadname, false);
1445                                                         j = i+1;
1446                                                         if (!k)
1447                                                                 break;
1448                                                 }
1449                                         }
1450                                 }
1451                         }
1452                 }
1453         }
1454 }
1455
1456 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1457 {
1458         loadmodel->brush.entities = NULL;
1459         if (!l->filelen)
1460                 return;
1461         loadmodel->brush.entities = Mem_Alloc(loadmodel->mempool, l->filelen);
1462         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1463         if (loadmodel->brush.ishlbsp)
1464                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1465 }
1466
1467
1468 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1469 {
1470         dvertex_t       *in;
1471         mvertex_t       *out;
1472         int                     i, count;
1473
1474         in = (void *)(mod_base + l->fileofs);
1475         if (l->filelen % sizeof(*in))
1476                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1477         count = l->filelen / sizeof(*in);
1478         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1479
1480         loadmodel->brushq1.vertexes = out;
1481         loadmodel->brushq1.numvertexes = count;
1482
1483         for ( i=0 ; i<count ; i++, in++, out++)
1484         {
1485                 out->position[0] = LittleFloat(in->point[0]);
1486                 out->position[1] = LittleFloat(in->point[1]);
1487                 out->position[2] = LittleFloat(in->point[2]);
1488         }
1489 }
1490
1491 static void Mod_Q1BSP_LoadSubmodels(lump_t *l)
1492 {
1493         dmodel_t        *in;
1494         dmodel_t        *out;
1495         int                     i, j, count;
1496
1497         in = (void *)(mod_base + l->fileofs);
1498         if (l->filelen % sizeof(*in))
1499                 Host_Error("Mod_Q1BSP_LoadSubmodels: funny lump size in %s",loadmodel->name);
1500         count = l->filelen / sizeof(*in);
1501         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1502
1503         loadmodel->brushq1.submodels = out;
1504         loadmodel->brush.numsubmodels = count;
1505
1506         for ( i=0 ; i<count ; i++, in++, out++)
1507         {
1508                 for (j=0 ; j<3 ; j++)
1509                 {
1510                         // spread the mins / maxs by a pixel
1511                         out->mins[j] = LittleFloat(in->mins[j]) - 1;
1512                         out->maxs[j] = LittleFloat(in->maxs[j]) + 1;
1513                         out->origin[j] = LittleFloat(in->origin[j]);
1514                 }
1515                 for (j=0 ; j<MAX_MAP_HULLS ; j++)
1516                         out->headnode[j] = LittleLong(in->headnode[j]);
1517                 out->visleafs = LittleLong(in->visleafs);
1518                 out->firstface = LittleLong(in->firstface);
1519                 out->numfaces = LittleLong(in->numfaces);
1520         }
1521 }
1522
1523 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1524 {
1525         dedge_t *in;
1526         medge_t *out;
1527         int     i, count;
1528
1529         in = (void *)(mod_base + l->fileofs);
1530         if (l->filelen % sizeof(*in))
1531                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1532         count = l->filelen / sizeof(*in);
1533         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1534
1535         loadmodel->brushq1.edges = out;
1536         loadmodel->brushq1.numedges = count;
1537
1538         for ( i=0 ; i<count ; i++, in++, out++)
1539         {
1540                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1541                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1542         }
1543 }
1544
1545 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1546 {
1547         texinfo_t *in;
1548         mtexinfo_t *out;
1549         int i, j, k, count, miptex;
1550
1551         in = (void *)(mod_base + l->fileofs);
1552         if (l->filelen % sizeof(*in))
1553                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1554         count = l->filelen / sizeof(*in);
1555         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1556
1557         loadmodel->brushq1.texinfo = out;
1558         loadmodel->brushq1.numtexinfo = count;
1559
1560         for (i = 0;i < count;i++, in++, out++)
1561         {
1562                 for (k = 0;k < 2;k++)
1563                         for (j = 0;j < 4;j++)
1564                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1565
1566                 miptex = LittleLong(in->miptex);
1567                 out->flags = LittleLong(in->flags);
1568
1569                 out->texture = NULL;
1570                 if (loadmodel->brushq1.textures)
1571                 {
1572                         if ((unsigned int) miptex >= (unsigned int) loadmodel->brushq1.numtextures)
1573                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->brushq1.numtextures);
1574                         else
1575                                 out->texture = loadmodel->brushq1.textures + miptex;
1576                 }
1577                 if (out->flags & TEX_SPECIAL)
1578                 {
1579                         // if texture chosen is NULL or the shader needs a lightmap,
1580                         // force to notexture water shader
1581                         if (out->texture == NULL || out->texture->flags & SURF_LIGHTMAP)
1582                                 out->texture = loadmodel->brushq1.textures + (loadmodel->brushq1.numtextures - 1);
1583                 }
1584                 else
1585                 {
1586                         // if texture chosen is NULL, force to notexture
1587                         if (out->texture == NULL)
1588                                 out->texture = loadmodel->brushq1.textures + (loadmodel->brushq1.numtextures - 2);
1589                 }
1590         }
1591 }
1592
1593 #if 0
1594 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1595 {
1596         int             i, j;
1597         float   *v;
1598
1599         mins[0] = mins[1] = mins[2] = 9999;
1600         maxs[0] = maxs[1] = maxs[2] = -9999;
1601         v = verts;
1602         for (i = 0;i < numverts;i++)
1603         {
1604                 for (j = 0;j < 3;j++, v++)
1605                 {
1606                         if (*v < mins[j])
1607                                 mins[j] = *v;
1608                         if (*v > maxs[j])
1609                                 maxs[j] = *v;
1610                 }
1611         }
1612 }
1613
1614 #define MAX_SUBDIVPOLYTRIANGLES 4096
1615 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
1616
1617 static int subdivpolyverts, subdivpolytriangles;
1618 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
1619 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
1620
1621 static int subdivpolylookupvert(vec3_t v)
1622 {
1623         int i;
1624         for (i = 0;i < subdivpolyverts;i++)
1625                 if (subdivpolyvert[i][0] == v[0]
1626                  && subdivpolyvert[i][1] == v[1]
1627                  && subdivpolyvert[i][2] == v[2])
1628                         return i;
1629         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
1630                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
1631         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
1632         return subdivpolyverts++;
1633 }
1634
1635 static void SubdividePolygon(int numverts, float *verts)
1636 {
1637         int             i, i1, i2, i3, f, b, c, p;
1638         vec3_t  mins, maxs, front[256], back[256];
1639         float   m, *pv, *cv, dist[256], frac;
1640
1641         if (numverts > 250)
1642                 Host_Error("SubdividePolygon: ran out of verts in buffer");
1643
1644         BoundPoly(numverts, verts, mins, maxs);
1645
1646         for (i = 0;i < 3;i++)
1647         {
1648                 m = (mins[i] + maxs[i]) * 0.5;
1649                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
1650                 if (maxs[i] - m < 8)
1651                         continue;
1652                 if (m - mins[i] < 8)
1653                         continue;
1654
1655                 // cut it
1656                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
1657                         dist[c] = cv[i] - m;
1658
1659                 f = b = 0;
1660                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
1661                 {
1662                         if (dist[p] >= 0)
1663                         {
1664                                 VectorCopy(pv, front[f]);
1665                                 f++;
1666                         }
1667                         if (dist[p] <= 0)
1668                         {
1669                                 VectorCopy(pv, back[b]);
1670                                 b++;
1671                         }
1672                         if (dist[p] == 0 || dist[c] == 0)
1673                                 continue;
1674                         if ((dist[p] > 0) != (dist[c] > 0) )
1675                         {
1676                                 // clip point
1677                                 frac = dist[p] / (dist[p] - dist[c]);
1678                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
1679                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
1680                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
1681                                 f++;
1682                                 b++;
1683                         }
1684                 }
1685
1686                 SubdividePolygon(f, front[0]);
1687                 SubdividePolygon(b, back[0]);
1688                 return;
1689         }
1690
1691         i1 = subdivpolylookupvert(verts);
1692         i2 = subdivpolylookupvert(verts + 3);
1693         for (i = 2;i < numverts;i++)
1694         {
1695                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
1696                 {
1697                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
1698                         return;
1699                 }
1700
1701                 i3 = subdivpolylookupvert(verts + i * 3);
1702                 subdivpolyindex[subdivpolytriangles][0] = i1;
1703                 subdivpolyindex[subdivpolytriangles][1] = i2;
1704                 subdivpolyindex[subdivpolytriangles][2] = i3;
1705                 i2 = i3;
1706                 subdivpolytriangles++;
1707         }
1708 }
1709
1710 //Breaks a polygon up along axial 64 unit
1711 //boundaries so that turbulent and sky warps
1712 //can be done reasonably.
1713 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surf)
1714 {
1715         int i, j;
1716         surfvertex_t *v;
1717         surfmesh_t *mesh;
1718
1719         subdivpolytriangles = 0;
1720         subdivpolyverts = 0;
1721         SubdividePolygon(surf->poly_numverts, surf->poly_verts);
1722         if (subdivpolytriangles < 1)
1723                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?\n");
1724
1725         surf->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
1726         mesh->num_vertices = subdivpolyverts;
1727         mesh->num_triangles = subdivpolytriangles;
1728         mesh->vertex = (surfvertex_t *)(mesh + 1);
1729         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
1730         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
1731
1732         for (i = 0;i < mesh->num_triangles;i++)
1733                 for (j = 0;j < 3;j++)
1734                         mesh->index[i*3+j] = subdivpolyindex[i][j];
1735
1736         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
1737         {
1738                 VectorCopy(subdivpolyvert[i], v->v);
1739                 v->st[0] = DotProduct(v->v, surf->texinfo->vecs[0]);
1740                 v->st[1] = DotProduct(v->v, surf->texinfo->vecs[1]);
1741         }
1742 }
1743 #endif
1744
1745 static void Mod_Q1BSP_GenerateSurfacePolygon(msurface_t *surf, int firstedge, int numedges)
1746 {
1747         int i, lindex, j;
1748         float *vec, *vert, mins[3], maxs[3], val, *v;
1749         mtexinfo_t *tex;
1750
1751         // convert edges back to a normal polygon
1752         surf->poly_numverts = numedges;
1753         vert = surf->poly_verts = Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * numedges);
1754         for (i = 0;i < numedges;i++)
1755         {
1756                 lindex = loadmodel->brushq1.surfedges[firstedge + i];
1757                 if (lindex > 0)
1758                         vec = loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position;
1759                 else
1760                         vec = loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position;
1761                 VectorCopy(vec, vert);
1762                 vert += 3;
1763         }
1764
1765         // calculate polygon bounding box and center
1766         vert = surf->poly_verts;
1767         VectorCopy(vert, mins);
1768         VectorCopy(vert, maxs);
1769         vert += 3;
1770         for (i = 1;i < surf->poly_numverts;i++, vert += 3)
1771         {
1772                 if (mins[0] > vert[0]) mins[0] = vert[0];if (maxs[0] < vert[0]) maxs[0] = vert[0];
1773                 if (mins[1] > vert[1]) mins[1] = vert[1];if (maxs[1] < vert[1]) maxs[1] = vert[1];
1774                 if (mins[2] > vert[2]) mins[2] = vert[2];if (maxs[2] < vert[2]) maxs[2] = vert[2];
1775         }
1776         VectorCopy(mins, surf->poly_mins);
1777         VectorCopy(maxs, surf->poly_maxs);
1778         surf->poly_center[0] = (mins[0] + maxs[0]) * 0.5f;
1779         surf->poly_center[1] = (mins[1] + maxs[1]) * 0.5f;
1780         surf->poly_center[2] = (mins[2] + maxs[2]) * 0.5f;
1781
1782         // generate surface extents information
1783         tex = surf->texinfo;
1784         mins[0] = maxs[0] = DotProduct(surf->poly_verts, tex->vecs[0]) + tex->vecs[0][3];
1785         mins[1] = maxs[1] = DotProduct(surf->poly_verts, tex->vecs[1]) + tex->vecs[1][3];
1786         for (i = 1, v = surf->poly_verts + 3;i < surf->poly_numverts;i++, v += 3)
1787         {
1788                 for (j = 0;j < 2;j++)
1789                 {
1790                         val = DotProduct(v, tex->vecs[j]) + tex->vecs[j][3];
1791                         if (mins[j] > val)
1792                                 mins[j] = val;
1793                         if (maxs[j] < val)
1794                                 maxs[j] = val;
1795                 }
1796         }
1797         for (i = 0;i < 2;i++)
1798         {
1799                 surf->texturemins[i] = (int) floor(mins[i] / 16) * 16;
1800                 surf->extents[i] = (int) ceil(maxs[i] / 16) * 16 - surf->texturemins[i];
1801         }
1802 }
1803
1804 static void Mod_Q1BSP_LoadFaces(lump_t *l)
1805 {
1806         dface_t *in;
1807         msurface_t *surf;
1808         int i, count, surfnum, planenum, ssize, tsize, firstedge, numedges, totalverts, totaltris, totalmeshes;
1809         surfmesh_t *mesh;
1810         float s, t;
1811
1812         in = (void *)(mod_base + l->fileofs);
1813         if (l->filelen % sizeof(*in))
1814                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
1815         count = l->filelen / sizeof(*in);
1816         loadmodel->brushq1.surfaces = Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
1817
1818         loadmodel->brushq1.numsurfaces = count;
1819         loadmodel->brushq1.surfacevisframes = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
1820         loadmodel->brushq1.surfacepvsframes = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
1821         loadmodel->brushq1.pvssurflist = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
1822
1823         for (surfnum = 0, surf = loadmodel->brushq1.surfaces, totalverts = 0, totaltris = 0, totalmeshes = 0;surfnum < count;surfnum++, totalverts += surf->poly_numverts, totaltris += surf->poly_numverts - 2, totalmeshes++, in++, surf++)
1824         {
1825                 surf->number = surfnum;
1826                 // FIXME: validate edges, texinfo, etc?
1827                 firstedge = LittleLong(in->firstedge);
1828                 numedges = LittleShort(in->numedges);
1829                 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)
1830                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)\n", firstedge, numedges, loadmodel->brushq1.numsurfedges);
1831                 i = LittleShort(in->texinfo);
1832                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
1833                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)\n", i, loadmodel->brushq1.numtexinfo);
1834                 surf->texinfo = loadmodel->brushq1.texinfo + i;
1835                 surf->flags = surf->texinfo->texture->flags;
1836
1837                 planenum = LittleShort(in->planenum);
1838                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brushq1.numplanes)
1839                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)\n", planenum, loadmodel->brushq1.numplanes);
1840
1841                 if (LittleShort(in->side))
1842                         surf->flags |= SURF_PLANEBACK;
1843
1844                 surf->plane = loadmodel->brushq1.planes + planenum;
1845
1846                 // clear lightmap (filled in later)
1847                 surf->lightmaptexture = NULL;
1848
1849                 // force lightmap upload on first time seeing the surface
1850                 surf->cached_dlight = true;
1851
1852                 Mod_Q1BSP_GenerateSurfacePolygon(surf, firstedge, numedges);
1853
1854                 ssize = (surf->extents[0] >> 4) + 1;
1855                 tsize = (surf->extents[1] >> 4) + 1;
1856
1857                 // lighting info
1858                 for (i = 0;i < MAXLIGHTMAPS;i++)
1859                         surf->styles[i] = in->styles[i];
1860                 i = LittleLong(in->lightofs);
1861                 if (i == -1)
1862                         surf->samples = NULL;
1863                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
1864                         surf->samples = loadmodel->brushq1.lightdata + i;
1865                 else // LordHavoc: white lighting (bsp version 29)
1866                         surf->samples = loadmodel->brushq1.lightdata + (i * 3);
1867
1868                 if (surf->texinfo->texture->flags & SURF_LIGHTMAP)
1869                 {
1870                         if ((surf->extents[0] >> 4) + 1 > (256) || (surf->extents[1] >> 4) + 1 > (256))
1871                                 Host_Error("Bad surface extents");
1872                         // stainmap for permanent marks on walls
1873                         surf->stainsamples = Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
1874                         // clear to white
1875                         memset(surf->stainsamples, 255, ssize * tsize * 3);
1876                 }
1877         }
1878
1879         // TODO: split up into multiple meshes as needed to avoid exceeding 65536
1880         // vertex limit
1881         loadmodel->nummeshes = 1;
1882         loadmodel->meshlist = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *));
1883         loadmodel->meshlist[0] = Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, 0, 0, true, true, false);
1884
1885         for (surfnum = 0, surf = loadmodel->brushq1.surfaces, totalverts = 0, totaltris = 0, totalmeshes = 0;surfnum < count;surfnum++, totalverts += surf->poly_numverts, totaltris += surf->poly_numverts - 2, totalmeshes++, surf++)
1886         {
1887                 mesh = &surf->mesh;
1888                 mesh->num_vertices = surf->poly_numverts;
1889                 mesh->num_triangles = surf->poly_numverts - 2;
1890                 mesh->data_vertex3f = loadmodel->meshlist[0]->data_vertex3f + totalverts * 3;
1891                 mesh->data_texcoordtexture2f = loadmodel->meshlist[0]->data_texcoordtexture2f + totalverts * 2;
1892                 mesh->data_texcoordlightmap2f = loadmodel->meshlist[0]->data_texcoordlightmap2f + totalverts * 2;
1893                 mesh->data_texcoorddetail2f = loadmodel->meshlist[0]->data_texcoorddetail2f + totalverts * 2;
1894                 mesh->data_svector3f = loadmodel->meshlist[0]->data_svector3f + totalverts * 3;
1895                 mesh->data_tvector3f = loadmodel->meshlist[0]->data_tvector3f + totalverts * 3;
1896                 mesh->data_normal3f = loadmodel->meshlist[0]->data_normal3f + totalverts * 3;
1897                 mesh->data_lightmapoffsets = loadmodel->meshlist[0]->data_lightmapoffsets + totalverts;
1898                 mesh->data_element3i = loadmodel->meshlist[0]->data_element3i + totaltris * 3;
1899                 mesh->data_neighbor3i = loadmodel->meshlist[0]->data_neighbor3i + totaltris * 3;
1900
1901                 surf->lightmaptexturestride = 0;
1902                 surf->lightmaptexture = NULL;
1903
1904                 for (i = 0;i < mesh->num_vertices;i++)
1905                 {
1906                         mesh->data_vertex3f[i * 3 + 0] = surf->poly_verts[i * 3 + 0];
1907                         mesh->data_vertex3f[i * 3 + 1] = surf->poly_verts[i * 3 + 1];
1908                         mesh->data_vertex3f[i * 3 + 2] = surf->poly_verts[i * 3 + 2];
1909                         s = DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[0]) + surf->texinfo->vecs[0][3];
1910                         t = DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[1]) + surf->texinfo->vecs[1][3];
1911                         mesh->data_texcoordtexture2f[i * 2 + 0] = s / surf->texinfo->texture->width;
1912                         mesh->data_texcoordtexture2f[i * 2 + 1] = t / surf->texinfo->texture->height;
1913                         mesh->data_texcoorddetail2f[i * 2 + 0] = s * (1.0f / 16.0f);
1914                         mesh->data_texcoorddetail2f[i * 2 + 1] = t * (1.0f / 16.0f);
1915                         mesh->data_texcoordlightmap2f[i * 2 + 0] = 0;
1916                         mesh->data_texcoordlightmap2f[i * 2 + 1] = 0;
1917                         mesh->data_lightmapoffsets[i] = 0;
1918                 }
1919
1920                 for (i = 0;i < mesh->num_triangles;i++)
1921                 {
1922                         mesh->data_element3i[i * 3 + 0] = 0;
1923                         mesh->data_element3i[i * 3 + 1] = i + 1;
1924                         mesh->data_element3i[i * 3 + 2] = i + 2;
1925                 }
1926
1927                 Mod_BuildTriangleNeighbors(mesh->data_neighbor3i, mesh->data_element3i, mesh->num_triangles);
1928                 Mod_BuildTextureVectorsAndNormals(mesh->num_vertices, mesh->num_triangles, mesh->data_vertex3f, mesh->data_texcoordtexture2f, mesh->data_element3i, mesh->data_svector3f, mesh->data_tvector3f, mesh->data_normal3f);
1929
1930                 if (surf->texinfo->texture->flags & SURF_LIGHTMAP)
1931                 {
1932                         int i, iu, iv, smax, tmax;
1933                         float u, v, ubase, vbase, uscale, vscale;
1934
1935                         smax = surf->extents[0] >> 4;
1936                         tmax = surf->extents[1] >> 4;
1937
1938                         if (r_miplightmaps.integer)
1939                         {
1940                                 surf->lightmaptexturestride = smax+1;
1941                                 surf->lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, NULL, surf->lightmaptexturestride, (surf->extents[1]>>4)+1, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_MIPMAP | TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
1942                         }
1943                         else
1944                         {
1945                                 surf->lightmaptexturestride = R_CompatibleFragmentWidth(smax+1, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, 0);
1946                                 surf->lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, NULL, surf->lightmaptexturestride, (surf->extents[1]>>4)+1, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FRAGMENT | TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
1947                         }
1948                         R_FragmentLocation(surf->lightmaptexture, NULL, NULL, &ubase, &vbase, &uscale, &vscale);
1949                         uscale = (uscale - ubase) / (smax + 1);
1950                         vscale = (vscale - vbase) / (tmax + 1);
1951
1952                         for (i = 0;i < mesh->num_vertices;i++)
1953                         {
1954                                 u = ((DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[0]) + surf->texinfo->vecs[0][3]) + 8 - surf->texturemins[0]) * (1.0 / 16.0);
1955                                 v = ((DotProduct((mesh->data_vertex3f + i * 3), surf->texinfo->vecs[1]) + surf->texinfo->vecs[1][3]) + 8 - surf->texturemins[1]) * (1.0 / 16.0);
1956                                 mesh->data_texcoordlightmap2f[i * 2 + 0] = u * uscale + ubase;
1957                                 mesh->data_texcoordlightmap2f[i * 2 + 1] = v * vscale + vbase;
1958                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
1959                                 iu = (int) u;
1960                                 iv = (int) v;
1961                                 mesh->data_lightmapoffsets[i] = (bound(0, iv, tmax) * (smax+1) + bound(0, iu, smax)) * 3;
1962                         }
1963                 }
1964         }
1965 }
1966
1967 static void Mod_Q1BSP_SetParent(mnode_t *node, mnode_t *parent)
1968 {
1969         node->parent = parent;
1970         if (node->contents < 0)
1971                 return;
1972         Mod_Q1BSP_SetParent(node->children[0], node);
1973         Mod_Q1BSP_SetParent(node->children[1], node);
1974 }
1975
1976 static void Mod_Q1BSP_LoadNodes(lump_t *l)
1977 {
1978         int                     i, j, count, p;
1979         dnode_t         *in;
1980         mnode_t         *out;
1981
1982         in = (void *)(mod_base + l->fileofs);
1983         if (l->filelen % sizeof(*in))
1984                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
1985         count = l->filelen / sizeof(*in);
1986         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1987
1988         loadmodel->brushq1.nodes = out;
1989         loadmodel->brushq1.numnodes = count;
1990
1991         for ( i=0 ; i<count ; i++, in++, out++)
1992         {
1993                 for (j=0 ; j<3 ; j++)
1994                 {
1995                         out->mins[j] = LittleShort(in->mins[j]);
1996                         out->maxs[j] = LittleShort(in->maxs[j]);
1997                 }
1998
1999                 p = LittleLong(in->planenum);
2000                 out->plane = loadmodel->brushq1.planes + p;
2001
2002                 out->firstsurface = LittleShort(in->firstface);
2003                 out->numsurfaces = LittleShort(in->numfaces);
2004
2005                 for (j=0 ; j<2 ; j++)
2006                 {
2007                         p = LittleShort(in->children[j]);
2008                         if (p >= 0)
2009                                 out->children[j] = loadmodel->brushq1.nodes + p;
2010                         else
2011                                 out->children[j] = (mnode_t *)(loadmodel->brushq1.data_leafs + (-1 - p));
2012                 }
2013         }
2014
2015         Mod_Q1BSP_SetParent(loadmodel->brushq1.nodes, NULL);    // sets nodes and leafs
2016 }
2017
2018 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2019 {
2020         dleaf_t *in;
2021         mleaf_t *out;
2022         int i, j, count, p;
2023
2024         in = (void *)(mod_base + l->fileofs);
2025         if (l->filelen % sizeof(*in))
2026                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2027         count = l->filelen / sizeof(*in);
2028         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2029
2030         loadmodel->brushq1.data_leafs = out;
2031         loadmodel->brushq1.num_leafs = count;
2032         // get visleafs from the submodel data
2033         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2034         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2035         loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2036         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2037
2038         for ( i=0 ; i<count ; i++, in++, out++)
2039         {
2040                 for (j=0 ; j<3 ; j++)
2041                 {
2042                         out->mins[j] = LittleShort(in->mins[j]);
2043                         out->maxs[j] = LittleShort(in->maxs[j]);
2044                 }
2045
2046                 // FIXME: this function could really benefit from some error checking
2047
2048                 out->contents = LittleLong(in->contents);
2049
2050                 out->firstmarksurface = loadmodel->brushq1.marksurfaces + LittleShort(in->firstmarksurface);
2051                 out->nummarksurfaces = LittleShort(in->nummarksurfaces);
2052                 if (out->firstmarksurface < 0 || LittleShort(in->firstmarksurface) + out->nummarksurfaces > loadmodel->brushq1.nummarksurfaces)
2053                 {
2054                         Con_Printf("Mod_Q1BSP_LoadLeafs: invalid marksurface range %i:%i outside range %i:%i\n", out->firstmarksurface, out->firstmarksurface + out->nummarksurfaces, 0, loadmodel->brushq1.nummarksurfaces);
2055                         out->firstmarksurface = NULL;
2056                         out->nummarksurfaces = 0;
2057                 }
2058
2059                 out->clusterindex = i - 1;
2060                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2061                         out->clusterindex = -1;
2062
2063                 p = LittleLong(in->visofs);
2064                 // ignore visofs errors on leaf 0 (solid)
2065                 if (p >= 0 && out->clusterindex >= 0)
2066                 {
2067                         if (p >= loadmodel->brushq1.num_compressedpvs)
2068                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2069                         else
2070                                 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);
2071                 }
2072
2073                 for (j = 0;j < 4;j++)
2074                         out->ambient_sound_level[j] = in->ambient_level[j];
2075
2076                 // FIXME: Insert caustics here
2077         }
2078 }
2079
2080 static void Mod_Q1BSP_LoadClipnodes(lump_t *l)
2081 {
2082         dclipnode_t *in, *out;
2083         int                     i, count;
2084         hull_t          *hull;
2085
2086         in = (void *)(mod_base + l->fileofs);
2087         if (l->filelen % sizeof(*in))
2088                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2089         count = l->filelen / sizeof(*in);
2090         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2091
2092         loadmodel->brushq1.clipnodes = out;
2093         loadmodel->brushq1.numclipnodes = count;
2094
2095         if (loadmodel->brush.ishlbsp)
2096         {
2097                 hull = &loadmodel->brushq1.hulls[1];
2098                 hull->clipnodes = out;
2099                 hull->firstclipnode = 0;
2100                 hull->lastclipnode = count-1;
2101                 hull->planes = loadmodel->brushq1.planes;
2102                 hull->clip_mins[0] = -16;
2103                 hull->clip_mins[1] = -16;
2104                 hull->clip_mins[2] = -36;
2105                 hull->clip_maxs[0] = 16;
2106                 hull->clip_maxs[1] = 16;
2107                 hull->clip_maxs[2] = 36;
2108                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2109
2110                 hull = &loadmodel->brushq1.hulls[2];
2111                 hull->clipnodes = out;
2112                 hull->firstclipnode = 0;
2113                 hull->lastclipnode = count-1;
2114                 hull->planes = loadmodel->brushq1.planes;
2115                 hull->clip_mins[0] = -32;
2116                 hull->clip_mins[1] = -32;
2117                 hull->clip_mins[2] = -32;
2118                 hull->clip_maxs[0] = 32;
2119                 hull->clip_maxs[1] = 32;
2120                 hull->clip_maxs[2] = 32;
2121                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2122
2123                 hull = &loadmodel->brushq1.hulls[3];
2124                 hull->clipnodes = out;
2125                 hull->firstclipnode = 0;
2126                 hull->lastclipnode = count-1;
2127                 hull->planes = loadmodel->brushq1.planes;
2128                 hull->clip_mins[0] = -16;
2129                 hull->clip_mins[1] = -16;
2130                 hull->clip_mins[2] = -18;
2131                 hull->clip_maxs[0] = 16;
2132                 hull->clip_maxs[1] = 16;
2133                 hull->clip_maxs[2] = 18;
2134                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2135         }
2136         else
2137         {
2138                 hull = &loadmodel->brushq1.hulls[1];
2139                 hull->clipnodes = out;
2140                 hull->firstclipnode = 0;
2141                 hull->lastclipnode = count-1;
2142                 hull->planes = loadmodel->brushq1.planes;
2143                 hull->clip_mins[0] = -16;
2144                 hull->clip_mins[1] = -16;
2145                 hull->clip_mins[2] = -24;
2146                 hull->clip_maxs[0] = 16;
2147                 hull->clip_maxs[1] = 16;
2148                 hull->clip_maxs[2] = 32;
2149                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2150
2151                 hull = &loadmodel->brushq1.hulls[2];
2152                 hull->clipnodes = out;
2153                 hull->firstclipnode = 0;
2154                 hull->lastclipnode = count-1;
2155                 hull->planes = loadmodel->brushq1.planes;
2156                 hull->clip_mins[0] = -32;
2157                 hull->clip_mins[1] = -32;
2158                 hull->clip_mins[2] = -24;
2159                 hull->clip_maxs[0] = 32;
2160                 hull->clip_maxs[1] = 32;
2161                 hull->clip_maxs[2] = 64;
2162                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2163         }
2164
2165         for (i=0 ; i<count ; i++, out++, in++)
2166         {
2167                 out->planenum = LittleLong(in->planenum);
2168                 out->children[0] = LittleShort(in->children[0]);
2169                 out->children[1] = LittleShort(in->children[1]);
2170                 if (out->children[0] >= count || out->children[1] >= count)
2171                         Host_Error("Corrupt clipping hull(out of range child)\n");
2172         }
2173 }
2174
2175 //Duplicate the drawing hull structure as a clipping hull
2176 static void Mod_Q1BSP_MakeHull0(void)
2177 {
2178         mnode_t         *in;
2179         dclipnode_t *out;
2180         int                     i;
2181         hull_t          *hull;
2182
2183         hull = &loadmodel->brushq1.hulls[0];
2184
2185         in = loadmodel->brushq1.nodes;
2186         out = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numnodes * sizeof(dclipnode_t));
2187
2188         hull->clipnodes = out;
2189         hull->firstclipnode = 0;
2190         hull->lastclipnode = loadmodel->brushq1.numnodes - 1;
2191         hull->planes = loadmodel->brushq1.planes;
2192
2193         for (i = 0;i < loadmodel->brushq1.numnodes;i++, out++, in++)
2194         {
2195                 out->planenum = in->plane - loadmodel->brushq1.planes;
2196                 out->children[0] = in->children[0]->contents < 0 ? in->children[0]->contents : in->children[0] - loadmodel->brushq1.nodes;
2197                 out->children[1] = in->children[1]->contents < 0 ? in->children[1]->contents : in->children[1] - loadmodel->brushq1.nodes;
2198         }
2199 }
2200
2201 static void Mod_Q1BSP_LoadMarksurfaces(lump_t *l)
2202 {
2203         int i, j;
2204         short *in;
2205
2206         in = (void *)(mod_base + l->fileofs);
2207         if (l->filelen % sizeof(*in))
2208                 Host_Error("Mod_Q1BSP_LoadMarksurfaces: funny lump size in %s",loadmodel->name);
2209         loadmodel->brushq1.nummarksurfaces = l->filelen / sizeof(*in);
2210         loadmodel->brushq1.marksurfaces = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.nummarksurfaces * sizeof(int));
2211
2212         for (i = 0;i < loadmodel->brushq1.nummarksurfaces;i++)
2213         {
2214                 j = (unsigned) LittleShort(in[i]);
2215                 if (j >= loadmodel->brushq1.numsurfaces)
2216                         Host_Error("Mod_Q1BSP_LoadMarksurfaces: bad surface number");
2217                 loadmodel->brushq1.marksurfaces[i] = j;
2218         }
2219 }
2220
2221 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2222 {
2223         int             i;
2224         int             *in;
2225
2226         in = (void *)(mod_base + l->fileofs);
2227         if (l->filelen % sizeof(*in))
2228                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2229         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2230         loadmodel->brushq1.surfedges = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2231
2232         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2233                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2234 }
2235
2236
2237 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2238 {
2239         int                     i;
2240         mplane_t        *out;
2241         dplane_t        *in;
2242
2243         in = (void *)(mod_base + l->fileofs);
2244         if (l->filelen % sizeof(*in))
2245                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2246
2247         loadmodel->brushq1.numplanes = l->filelen / sizeof(*in);
2248         loadmodel->brushq1.planes = out = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numplanes * sizeof(*out));
2249
2250         for (i = 0;i < loadmodel->brushq1.numplanes;i++, in++, out++)
2251         {
2252                 out->normal[0] = LittleFloat(in->normal[0]);
2253                 out->normal[1] = LittleFloat(in->normal[1]);
2254                 out->normal[2] = LittleFloat(in->normal[2]);
2255                 out->dist = LittleFloat(in->dist);
2256
2257                 PlaneClassify(out);
2258         }
2259 }
2260
2261 static void Mod_Q1BSP_LoadMapBrushes(void)
2262 {
2263 #if 0
2264 // unfinished
2265         int submodel, numbrushes;
2266         qboolean firstbrush;
2267         char *text, *maptext;
2268         char mapfilename[MAX_QPATH];
2269         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2270         strlcat (mapfilename, ".map", sizeof (mapfilename));
2271         maptext = (qbyte*) FS_LoadFile(mapfilename, tempmempool, false);
2272         if (!maptext)
2273                 return;
2274         text = maptext;
2275         if (!COM_ParseToken(&data, false))
2276                 return; // error
2277         submodel = 0;
2278         for (;;)
2279         {
2280                 if (!COM_ParseToken(&data, false))
2281                         break;
2282                 if (com_token[0] != '{')
2283                         return; // error
2284                 // entity
2285                 firstbrush = true;
2286                 numbrushes = 0;
2287                 maxbrushes = 256;
2288                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2289                 for (;;)
2290                 {
2291                         if (!COM_ParseToken(&data, false))
2292                                 return; // error
2293                         if (com_token[0] == '}')
2294                                 break; // end of entity
2295                         if (com_token[0] == '{')
2296                         {
2297                                 // brush
2298                                 if (firstbrush)
2299                                 {
2300                                         if (submodel)
2301                                         {
2302                                                 if (submodel > loadmodel->brush.numsubmodels)
2303                                                 {
2304                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2305                                                         model = NULL;
2306                                                 }
2307                                                 else
2308                                                         model = loadmodel->brush.submodels[submodel];
2309                                         }
2310                                         else
2311                                                 model = loadmodel;
2312                                 }
2313                                 for (;;)
2314                                 {
2315                                         if (!COM_ParseToken(&data, false))
2316                                                 return; // error
2317                                         if (com_token[0] == '}')
2318                                                 break; // end of brush
2319                                         // each brush face should be this format:
2320                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2321                                         // FIXME: support hl .map format
2322                                         for (pointnum = 0;pointnum < 3;pointnum++)
2323                                         {
2324                                                 COM_ParseToken(&data, false);
2325                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2326                                                 {
2327                                                         COM_ParseToken(&data, false);
2328                                                         point[pointnum][componentnum] = atof(com_token);
2329                                                 }
2330                                                 COM_ParseToken(&data, false);
2331                                         }
2332                                         COM_ParseToken(&data, false);
2333                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2334                                         COM_ParseToken(&data, false);
2335                                         //scroll_s = atof(com_token);
2336                                         COM_ParseToken(&data, false);
2337                                         //scroll_t = atof(com_token);
2338                                         COM_ParseToken(&data, false);
2339                                         //rotate = atof(com_token);
2340                                         COM_ParseToken(&data, false);
2341                                         //scale_s = atof(com_token);
2342                                         COM_ParseToken(&data, false);
2343                                         //scale_t = atof(com_token);
2344                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2345                                         VectorNormalizeDouble(planenormal);
2346                                         planedist = DotProduct(point[0], planenormal);
2347                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2348                                 }
2349                                 continue;
2350                         }
2351                 }
2352         }
2353 #endif
2354 }
2355
2356
2357 #define MAX_PORTALPOINTS 64
2358
2359 typedef struct portal_s
2360 {
2361         mplane_t plane;
2362         mnode_t *nodes[2];              // [0] = front side of plane
2363         struct portal_s *next[2];
2364         int numpoints;
2365         double points[3*MAX_PORTALPOINTS];
2366         struct portal_s *chain; // all portals are linked into a list
2367 }
2368 portal_t;
2369
2370 static portal_t *portalchain;
2371
2372 /*
2373 ===========
2374 AllocPortal
2375 ===========
2376 */
2377 static portal_t *AllocPortal(void)
2378 {
2379         portal_t *p;
2380         p = Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2381         p->chain = portalchain;
2382         portalchain = p;
2383         return p;
2384 }
2385
2386 static void FreePortal(portal_t *p)
2387 {
2388         Mem_Free(p);
2389 }
2390
2391 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2392 {
2393         // calculate children first
2394         if (node->children[0]->contents >= 0)
2395                 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2396         if (node->children[1]->contents >= 0)
2397                 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2398
2399         // make combined bounding box from children
2400         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2401         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2402         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2403         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2404         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2405         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2406 }
2407
2408 static void Mod_Q1BSP_FinalizePortals(void)
2409 {
2410         int i, j, numportals, numpoints;
2411         portal_t *p, *pnext;
2412         mportal_t *portal;
2413         mvertex_t *point;
2414         mleaf_t *leaf, *endleaf;
2415
2416         // recalculate bounding boxes for all leafs(because qbsp is very sloppy)
2417         leaf = loadmodel->brushq1.data_leafs;
2418         endleaf = leaf + loadmodel->brushq1.num_leafs;
2419         for (;leaf < endleaf;leaf++)
2420         {
2421                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
2422                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2423         }
2424         p = portalchain;
2425         while (p)
2426         {
2427                 if (p->numpoints >= 3)
2428                 {
2429                         for (i = 0;i < 2;i++)
2430                         {
2431                                 leaf = (mleaf_t *)p->nodes[i];
2432                                 for (j = 0;j < p->numpoints;j++)
2433                                 {
2434                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
2435                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
2436                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
2437                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
2438                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
2439                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
2440                                 }
2441                         }
2442                 }
2443                 p = p->chain;
2444         }
2445
2446         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brushq1.nodes);
2447
2448         // tally up portal and point counts
2449         p = portalchain;
2450         numportals = 0;
2451         numpoints = 0;
2452         while (p)
2453         {
2454                 // note: this check must match the one below or it will usually corrupt memory
2455                 // 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
2456                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1]
2457                  && p->nodes[0]->contents != CONTENTS_SOLID && p->nodes[1]->contents != CONTENTS_SOLID
2458                  && p->nodes[0]->contents != CONTENTS_SKY && p->nodes[1]->contents != CONTENTS_SKY)
2459                 {
2460                         numportals += 2;
2461                         numpoints += p->numpoints * 2;
2462                 }
2463                 p = p->chain;
2464         }
2465         loadmodel->brushq1.portals = Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2466         loadmodel->brushq1.numportals = numportals;
2467         loadmodel->brushq1.portalpoints = (void *)((qbyte *) loadmodel->brushq1.portals + numportals * sizeof(mportal_t));
2468         loadmodel->brushq1.numportalpoints = numpoints;
2469         // clear all leaf portal chains
2470         for (i = 0;i < loadmodel->brushq1.num_leafs;i++)
2471                 loadmodel->brushq1.data_leafs[i].portals = NULL;
2472         // process all portals in the global portal chain, while freeing them
2473         portal = loadmodel->brushq1.portals;
2474         point = loadmodel->brushq1.portalpoints;
2475         p = portalchain;
2476         portalchain = NULL;
2477         while (p)
2478         {
2479                 pnext = p->chain;
2480
2481                 if (p->numpoints >= 3)
2482                 {
2483                         // note: this check must match the one above or it will usually corrupt memory
2484                         // 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
2485                         if (p->nodes[0] != p->nodes[1]
2486                          && p->nodes[0]->contents != CONTENTS_SOLID && p->nodes[1]->contents != CONTENTS_SOLID
2487                          && p->nodes[0]->contents != CONTENTS_SKY && p->nodes[1]->contents != CONTENTS_SKY)
2488                         {
2489                                 // first make the back to front portal(forward portal)
2490                                 portal->points = point;
2491                                 portal->numpoints = p->numpoints;
2492                                 portal->plane.dist = p->plane.dist;
2493                                 VectorCopy(p->plane.normal, portal->plane.normal);
2494                                 portal->here = (mleaf_t *)p->nodes[1];
2495                                 portal->past = (mleaf_t *)p->nodes[0];
2496                                 // copy points
2497                                 for (j = 0;j < portal->numpoints;j++)
2498                                 {
2499                                         VectorCopy(p->points + j*3, point->position);
2500                                         point++;
2501                                 }
2502                                 PlaneClassify(&portal->plane);
2503
2504                                 // link into leaf's portal chain
2505                                 portal->next = portal->here->portals;
2506                                 portal->here->portals = portal;
2507
2508                                 // advance to next portal
2509                                 portal++;
2510
2511                                 // then make the front to back portal(backward portal)
2512                                 portal->points = point;
2513                                 portal->numpoints = p->numpoints;
2514                                 portal->plane.dist = -p->plane.dist;
2515                                 VectorNegate(p->plane.normal, portal->plane.normal);
2516                                 portal->here = (mleaf_t *)p->nodes[0];
2517                                 portal->past = (mleaf_t *)p->nodes[1];
2518                                 // copy points
2519                                 for (j = portal->numpoints - 1;j >= 0;j--)
2520                                 {
2521                                         VectorCopy(p->points + j*3, point->position);
2522                                         point++;
2523                                 }
2524                                 PlaneClassify(&portal->plane);
2525
2526                                 // link into leaf's portal chain
2527                                 portal->next = portal->here->portals;
2528                                 portal->here->portals = portal;
2529
2530                                 // advance to next portal
2531                                 portal++;
2532                         }
2533                 }
2534                 FreePortal(p);
2535                 p = pnext;
2536         }
2537 }
2538
2539 /*
2540 =============
2541 AddPortalToNodes
2542 =============
2543 */
2544 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2545 {
2546         if (!front)
2547                 Host_Error("AddPortalToNodes: NULL front node");
2548         if (!back)
2549                 Host_Error("AddPortalToNodes: NULL back node");
2550         if (p->nodes[0] || p->nodes[1])
2551                 Host_Error("AddPortalToNodes: already included");
2552         // 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
2553
2554         p->nodes[0] = front;
2555         p->next[0] = (portal_t *)front->portals;
2556         front->portals = (mportal_t *)p;
2557
2558         p->nodes[1] = back;
2559         p->next[1] = (portal_t *)back->portals;
2560         back->portals = (mportal_t *)p;
2561 }
2562
2563 /*
2564 =============
2565 RemovePortalFromNode
2566 =============
2567 */
2568 static void RemovePortalFromNodes(portal_t *portal)
2569 {
2570         int i;
2571         mnode_t *node;
2572         void **portalpointer;
2573         portal_t *t;
2574         for (i = 0;i < 2;i++)
2575         {
2576                 node = portal->nodes[i];
2577
2578                 portalpointer = (void **) &node->portals;
2579                 while (1)
2580                 {
2581                         t = *portalpointer;
2582                         if (!t)
2583                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
2584
2585                         if (t == portal)
2586                         {
2587                                 if (portal->nodes[0] == node)
2588                                 {
2589                                         *portalpointer = portal->next[0];
2590                                         portal->nodes[0] = NULL;
2591                                 }
2592                                 else if (portal->nodes[1] == node)
2593                                 {
2594                                         *portalpointer = portal->next[1];
2595                                         portal->nodes[1] = NULL;
2596                                 }
2597                                 else
2598                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2599                                 break;
2600                         }
2601
2602                         if (t->nodes[0] == node)
2603                                 portalpointer = (void **) &t->next[0];
2604                         else if (t->nodes[1] == node)
2605                                 portalpointer = (void **) &t->next[1];
2606                         else
2607                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2608                 }
2609         }
2610 }
2611
2612 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
2613 {
2614         int i, side;
2615         mnode_t *front, *back, *other_node;
2616         mplane_t clipplane, *plane;
2617         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
2618         int numfrontpoints, numbackpoints;
2619         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
2620
2621         // if a leaf, we're done
2622         if (node->contents)
2623                 return;
2624
2625         plane = node->plane;
2626
2627         front = node->children[0];
2628         back = node->children[1];
2629         if (front == back)
2630                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
2631
2632         // create the new portal by generating a polygon for the node plane,
2633         // and clipping it by all of the other portals(which came from nodes above this one)
2634         nodeportal = AllocPortal();
2635         nodeportal->plane = *plane;
2636
2637         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);
2638         nodeportal->numpoints = 4;
2639         side = 0;       // shut up compiler warning
2640         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
2641         {
2642                 clipplane = portal->plane;
2643                 if (portal->nodes[0] == portal->nodes[1])
2644                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
2645                 if (portal->nodes[0] == node)
2646                         side = 0;
2647                 else if (portal->nodes[1] == node)
2648                 {
2649                         clipplane.dist = -clipplane.dist;
2650                         VectorNegate(clipplane.normal, clipplane.normal);
2651                         side = 1;
2652                 }
2653                 else
2654                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2655
2656                 for (i = 0;i < nodeportal->numpoints*3;i++)
2657                         frontpoints[i] = nodeportal->points[i];
2658                 PolygonD_Divide(nodeportal->numpoints, frontpoints, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, 1.0/32.0, MAX_PORTALPOINTS, nodeportal->points, &nodeportal->numpoints, 0, NULL, NULL);
2659                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
2660                         break;
2661         }
2662
2663         if (nodeportal->numpoints < 3)
2664         {
2665                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
2666                 nodeportal->numpoints = 0;
2667         }
2668         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
2669         {
2670                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
2671                 nodeportal->numpoints = 0;
2672         }
2673         else
2674         {
2675                 AddPortalToNodes(nodeportal, front, back);
2676
2677                 // split the portals of this node along this node's plane and assign them to the children of this node
2678                 // (migrating the portals downward through the tree)
2679                 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
2680                 {
2681                         if (portal->nodes[0] == portal->nodes[1])
2682                                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
2683                         if (portal->nodes[0] == node)
2684                                 side = 0;
2685                         else if (portal->nodes[1] == node)
2686                                 side = 1;
2687                         else
2688                                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2689                         nextportal = portal->next[side];
2690
2691                         other_node = portal->nodes[!side];
2692                         RemovePortalFromNodes(portal);
2693
2694                         // cut the portal into two portals, one on each side of the node plane
2695                         PolygonD_Divide(portal->numpoints, portal->points, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, 1.0/32.0, MAX_PORTALPOINTS, frontpoints, &numfrontpoints, MAX_PORTALPOINTS, backpoints, &numbackpoints);
2696
2697                         if (!numfrontpoints)
2698                         {
2699                                 if (side == 0)
2700                                         AddPortalToNodes(portal, back, other_node);
2701                                 else
2702                                         AddPortalToNodes(portal, other_node, back);
2703                                 continue;
2704                         }
2705                         if (!numbackpoints)
2706                         {
2707                                 if (side == 0)
2708                                         AddPortalToNodes(portal, front, other_node);
2709                                 else
2710                                         AddPortalToNodes(portal, other_node, front);
2711                                 continue;
2712                         }
2713
2714                         // the portal is split
2715                         splitportal = AllocPortal();
2716                         temp = splitportal->chain;
2717                         *splitportal = *portal;
2718                         splitportal->chain = temp;
2719                         for (i = 0;i < numbackpoints*3;i++)
2720                                 splitportal->points[i] = backpoints[i];
2721                         splitportal->numpoints = numbackpoints;
2722                         for (i = 0;i < numfrontpoints*3;i++)
2723                                 portal->points[i] = frontpoints[i];
2724                         portal->numpoints = numfrontpoints;
2725
2726                         if (side == 0)
2727                         {
2728                                 AddPortalToNodes(portal, front, other_node);
2729                                 AddPortalToNodes(splitportal, back, other_node);
2730                         }
2731                         else
2732                         {
2733                                 AddPortalToNodes(portal, other_node, front);
2734                                 AddPortalToNodes(splitportal, other_node, back);
2735                         }
2736                 }
2737         }
2738
2739         Mod_Q1BSP_RecursiveNodePortals(front);
2740         Mod_Q1BSP_RecursiveNodePortals(back);
2741 }
2742
2743 static void Mod_Q1BSP_MakePortals(void)
2744 {
2745         portalchain = NULL;
2746         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brushq1.nodes);
2747         Mod_Q1BSP_FinalizePortals();
2748 }
2749
2750 static void Mod_Q1BSP_BuildSurfaceNeighbors(msurface_t *surfaces, int numsurfaces, mempool_t *mempool)
2751 {
2752 #if 0
2753         int surfnum, vertnum, vertnum2, snum, vnum, vnum2;
2754         msurface_t *surf, *s;
2755         float *v0, *v1, *v2, *v3;
2756         for (surf = surfaces, surfnum = 0;surfnum < numsurfaces;surf++, surfnum++)
2757                 surf->neighborsurfaces = Mem_Alloc(mempool, surf->poly_numverts * sizeof(msurface_t *));
2758         for (surf = surfaces, surfnum = 0;surfnum < numsurfaces;surf++, surfnum++)
2759         {
2760                 for (vertnum = surf->poly_numverts - 1, vertnum2 = 0, v0 = surf->poly_verts + (surf->poly_numverts - 1) * 3, v1 = surf->poly_verts;vertnum2 < surf->poly_numverts;vertnum = vertnum2, vertnum2++, v0 = v1, v1 += 3)
2761                 {
2762                         if (surf->neighborsurfaces[vertnum])
2763                                 continue;
2764                         surf->neighborsurfaces[vertnum] = NULL;
2765                         for (s = surfaces, snum = 0;snum < numsurfaces;s++, snum++)
2766                         {
2767                                 if (s->poly_mins[0] > (surf->poly_maxs[0] + 1) || s->poly_maxs[0] < (surf->poly_mins[0] - 1)
2768                                  || s->poly_mins[1] > (surf->poly_maxs[1] + 1) || s->poly_maxs[1] < (surf->poly_mins[1] - 1)
2769                                  || s->poly_mins[2] > (surf->poly_maxs[2] + 1) || s->poly_maxs[2] < (surf->poly_mins[2] - 1)
2770                                  || s == surf)
2771                                         continue;
2772                                 for (vnum = 0;vnum < s->poly_numverts;vnum++)
2773                                         if (s->neighborsurfaces[vnum] == surf)
2774                                                 break;
2775                                 if (vnum < s->poly_numverts)
2776                                         continue;
2777                                 for (vnum = s->poly_numverts - 1, vnum2 = 0, v2 = s->poly_verts + (s->poly_numverts - 1) * 3, v3 = s->poly_verts;vnum2 < s->poly_numverts;vnum = vnum2, vnum2++, v2 = v3, v3 += 3)
2778                                 {
2779                                         if (s->neighborsurfaces[vnum] == NULL
2780                                          && ((v0[0] == v2[0] && v0[1] == v2[1] && v0[2] == v2[2] && v1[0] == v3[0] && v1[1] == v3[1] && v1[2] == v3[2])
2781                                           || (v1[0] == v2[0] && v1[1] == v2[1] && v1[2] == v2[2] && v0[0] == v3[0] && v0[1] == v3[1] && v0[2] == v3[2])))
2782                                         {
2783                                                 surf->neighborsurfaces[vertnum] = s;
2784                                                 s->neighborsurfaces[vnum] = surf;
2785                                                 break;
2786                                         }
2787                                 }
2788                                 if (vnum < s->poly_numverts)
2789                                         break;
2790                         }
2791                 }
2792         }
2793 #endif
2794 }
2795
2796 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
2797 {
2798         int i, j, stylecounts[256], totalcount, remapstyles[256];
2799         msurface_t *surf;
2800         memset(stylecounts, 0, sizeof(stylecounts));
2801         for (i = 0;i < model->nummodelsurfaces;i++)
2802         {
2803                 surf = model->brushq1.surfaces + model->firstmodelsurface + i;
2804                 for (j = 0;j < MAXLIGHTMAPS;j++)
2805                         stylecounts[surf->styles[j]]++;
2806         }
2807         totalcount = 0;
2808         model->brushq1.light_styles = 0;
2809         for (i = 0;i < 255;i++)
2810         {
2811                 if (stylecounts[i])
2812                 {
2813                         remapstyles[i] = model->brushq1.light_styles++;
2814                         totalcount += stylecounts[i] + 1;
2815                 }
2816         }
2817         if (!totalcount)
2818                 return;
2819         model->brushq1.light_style = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(qbyte));
2820         model->brushq1.light_stylevalue = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
2821         model->brushq1.light_styleupdatechains = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
2822         model->brushq1.light_styleupdatechainsbuffer = Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
2823         model->brushq1.light_styles = 0;
2824         for (i = 0;i < 255;i++)
2825                 if (stylecounts[i])
2826                         model->brushq1.light_style[model->brushq1.light_styles++] = i;
2827         j = 0;
2828         for (i = 0;i < model->brushq1.light_styles;i++)
2829         {
2830                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2831                 j += stylecounts[model->brushq1.light_style[i]] + 1;
2832         }
2833         for (i = 0;i < model->nummodelsurfaces;i++)
2834         {
2835                 surf = model->brushq1.surfaces + model->firstmodelsurface + i;
2836                 for (j = 0;j < MAXLIGHTMAPS;j++)
2837                         if (surf->styles[j] != 255)
2838                                 *model->brushq1.light_styleupdatechains[remapstyles[surf->styles[j]]]++ = surf;
2839         }
2840         j = 0;
2841         for (i = 0;i < model->brushq1.light_styles;i++)
2842         {
2843                 *model->brushq1.light_styleupdatechains[i] = NULL;
2844                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2845                 j += stylecounts[model->brushq1.light_style[i]] + 1;
2846         }
2847 }
2848
2849 static void Mod_Q1BSP_BuildPVSTextureChains(model_t *model)
2850 {
2851         int i, j;
2852         for (i = 0;i < model->brushq1.numtextures;i++)
2853                 model->brushq1.pvstexturechainslength[i] = 0;
2854         for (i = 0, j = model->firstmodelsurface;i < model->nummodelsurfaces;i++, j++)
2855         {
2856                 if (model->brushq1.surfacepvsframes[j] == model->brushq1.pvsframecount)
2857                 {
2858                         model->brushq1.pvssurflist[model->brushq1.pvssurflistlength++] = j;
2859                         model->brushq1.pvstexturechainslength[model->brushq1.surfaces[j].texinfo->texture->number]++;
2860                 }
2861         }
2862         for (i = 0, j = 0;i < model->brushq1.numtextures;i++)
2863         {
2864                 if (model->brushq1.pvstexturechainslength[i])
2865                 {
2866                         model->brushq1.pvstexturechains[i] = model->brushq1.pvstexturechainsbuffer + j;
2867                         j += model->brushq1.pvstexturechainslength[i] + 1;
2868                 }
2869                 else
2870                         model->brushq1.pvstexturechains[i] = NULL;
2871         }
2872         for (i = 0, j = model->firstmodelsurface;i < model->nummodelsurfaces;i++, j++)
2873                 if (model->brushq1.surfacepvsframes[j] == model->brushq1.pvsframecount)
2874                         *model->brushq1.pvstexturechains[model->brushq1.surfaces[j].texinfo->texture->number]++ = model->brushq1.surfaces + j;
2875         for (i = 0;i < model->brushq1.numtextures;i++)
2876         {
2877                 if (model->brushq1.pvstexturechainslength[i])
2878                 {
2879                         *model->brushq1.pvstexturechains[i] = NULL;
2880                         model->brushq1.pvstexturechains[i] -= model->brushq1.pvstexturechainslength[i];
2881                 }
2882         }
2883 }
2884
2885 //Returns PVS data for a given point
2886 //(note: can return NULL)
2887 static qbyte *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
2888 {
2889         mnode_t *node;
2890         Mod_CheckLoaded(model);
2891         node = model->brushq1.nodes;
2892         while (node->plane)
2893                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
2894         if (((mleaf_t *)node)->clusterindex >= 0)
2895                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2896         else
2897                 return NULL;
2898 }
2899
2900 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbytes, mnode_t *node)
2901 {
2902         while (node->plane)
2903         {
2904                 float d = PlaneDiff(org, node->plane);
2905                 if (d > radius)
2906                         node = node->children[0];
2907                 else if (d < -radius)
2908                         node = node->children[1];
2909                 else
2910                 {
2911                         // go down both sides
2912                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
2913                         node = node->children[1];
2914                 }
2915         }
2916         // if this leaf is in a cluster, accumulate the pvs bits
2917         if (((mleaf_t *)node)->clusterindex >= 0)
2918         {
2919                 int i;
2920                 qbyte *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2921                 for (i = 0;i < pvsbytes;i++)
2922                         pvsbuffer[i] |= pvs[i];
2923         }
2924 }
2925
2926 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
2927 //of the given point.
2928 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbufferlength)
2929 {
2930         int bytes = ((model->brushq1.num_leafs - 1) + 7) >> 3;
2931         bytes = min(bytes, pvsbufferlength);
2932         if (r_novis.integer || !Mod_Q1BSP_GetPVS(model, org))
2933         {
2934                 memset(pvsbuffer, 0xFF, bytes);
2935                 return bytes;
2936         }
2937         memset(pvsbuffer, 0, bytes);
2938         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brushq1.nodes);
2939         return bytes;
2940 }
2941
2942 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
2943 {
2944         vec3_t size;
2945         const hull_t *hull;
2946
2947         VectorSubtract(inmaxs, inmins, size);
2948         if (cmodel->brush.ishlbsp)
2949         {
2950                 if (size[0] < 3)
2951                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2952                 else if (size[0] <= 32)
2953                 {
2954                         if (size[2] < 54) // pick the nearest of 36 or 72
2955                                 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
2956                         else
2957                                 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
2958                 }
2959                 else
2960                         hull = &cmodel->brushq1.hulls[2]; // 64x64x64
2961         }
2962         else
2963         {
2964                 if (size[0] < 3)
2965                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2966                 else if (size[0] <= 32)
2967                         hull = &cmodel->brushq1.hulls[1]; // 32x32x56
2968                 else
2969                         hull = &cmodel->brushq1.hulls[2]; // 64x64x88
2970         }
2971         VectorCopy(inmins, outmins);
2972         VectorAdd(inmins, hull->clip_size, outmaxs);
2973 }
2974
2975 /*
2976 void Mod_Q1BSP_RecursiveGetVisible(mnode_t *node, model_t *model, const vec3_t point, const vec3_t mins, const vec3_t maxs, int maxleafs, mleaf_t *leaflist, int *numleafs, int maxsurfaces, msurface_t *surfacelist, int *numsurfaces, const qbyte *pvs)
2977 {
2978         mleaf_t *leaf;
2979         for (;;)
2980         {
2981                 if (!BoxesOverlap(node->mins, node->maxs, mins, maxs))
2982                         return;
2983                 if (!node->plane)
2984                         break;
2985                 Mod_Q1BSP_RecursiveGetVisible(node->children[0], model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces, pvs);
2986                 node = node->children[1];
2987         }
2988         leaf = (mleaf_t *)node;
2989         if ((pvs == NULL || CHECKPVSBIT(pvs, leaf->clusterindex)))
2990         {
2991                 int marksurfacenum;
2992                 msurface_t *surf;
2993                 if (maxleafs && *numleafs < maxleafs)
2994                         leaflist[(*numleafs)++] = leaf;
2995                 if (maxsurfaces)
2996                 {
2997                         for (marksurfacenum = 0;marksurfacenum < leaf->nummarksurfaces;marksurfacenum++)
2998                         {
2999                                 surf = model->brushq1.surfaces + leaf->firstmarksurface[marksurfacenum];
3000                                 if (surf->shadowmark != shadowmarkcount)
3001                                 {
3002                                         surf->shadowmark = shadowmarkcount;
3003                                         if (BoxesOverlap(mins, maxs, surf->poly_mins, surf->poly_maxs) && ((surf->flags & SURF_PLANEBACK) ? PlaneDiff(point, surf->plane) < 0 : PlaneDiff(point, surf->plane) > 0) && *numsurfaces < maxsurfaces)
3004                                                 surfacelist[(*numsurfaces)++] = surf;
3005                                 }
3006                         }
3007                 }
3008         }
3009 }
3010
3011 void Mod_Q1BSP_GetVisible(model_t *model, const vec3_t point, const vec3_t mins, const vec3_t maxs, int maxleafs, mleaf_t *leaflist, int *numleafs, int maxsurfaces, msurface_t *surfacelist, int *numsurfaces)
3012 {
3013         // FIXME: support portals
3014         if (maxsurfaces)
3015                 *numsurfaces = 0;
3016         if (maxleafs)
3017                 *numleafs = 0;
3018         pvs = ent->model->brush.GetPVS(ent->model, relativelightorigin);
3019         Mod_Q1BSP_RecursiveGetVisible(ent->model->brushq1.nodes + ent->model->brushq1.firstclipnode, model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces);
3020 }
3021 */
3022
3023 extern void R_Q1BSP_DrawSky(entity_render_t *ent);
3024 extern void R_Q1BSP_Draw(entity_render_t *ent);
3025 extern void R_Q1BSP_GetLightInfo(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, vec3_t outmins, vec3_t outmaxs, int *outclusterlist, qbyte *outclusterpvs, int *outnumclusterspointer, int *outsurfacelist, qbyte *outsurfacepvs, int *outnumsurfacespointer);
3026 extern void R_Q1BSP_DrawShadowVolume(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, int numsurfaces, const int *surfacelist);
3027 extern void R_Q1BSP_DrawLight(entity_render_t *ent, vec3_t relativelightorigin, vec3_t relativeeyeorigin, float lightradius, float *lightcolor, const matrix4x4_t *matrix_modeltolight, const matrix4x4_t *matrix_modeltoattenuationxyz, const matrix4x4_t *matrix_modeltoattenuationz, rtexture_t *lightcubemap, vec_t ambientscale, vec_t diffusescale, vec_t specularscale, int numsurfaces, const int *surfacelist);
3028 void Mod_Q1BSP_Load(model_t *mod, void *buffer)
3029 {
3030         int i, j, k;
3031         dheader_t *header;
3032         dmodel_t *bm;
3033         mempool_t *mainmempool;
3034         float dist, modelyawradius, modelradius, *vec;
3035         msurface_t *surf;
3036         int numshadowmeshtriangles;
3037
3038         mod->type = mod_brushq1;
3039
3040         header = (dheader_t *)buffer;
3041
3042         i = LittleLong(header->version);
3043         if (i != BSPVERSION && i != 30)
3044                 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife))", mod->name, i, BSPVERSION);
3045         mod->brush.ishlbsp = i == 30;
3046
3047         mod->soundfromcenter = true;
3048         mod->TraceBox = Mod_Q1BSP_TraceBox;
3049         mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3050         mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3051         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3052         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3053         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3054         mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3055         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3056         mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3057         mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3058         mod->brushq1.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3059         mod->brushq1.BuildPVSTextureChains = Mod_Q1BSP_BuildPVSTextureChains;
3060
3061         if (loadmodel->isworldmodel)
3062                 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3063
3064 // swap all the lumps
3065         mod_base = (qbyte *)header;
3066
3067         header->version = LittleLong(header->version);
3068         for (i = 0;i < HEADER_LUMPS;i++)
3069         {
3070                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3071                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3072         }
3073
3074 // load into heap
3075
3076         // store which lightmap format to use
3077         mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3078
3079         Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3080         Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3081         Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3082         Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3083         Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3084         Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3085         Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3086         Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3087         Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3088         Mod_Q1BSP_LoadMarksurfaces(&header->lumps[LUMP_MARKSURFACES]);
3089         Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3090         // load submodels before leafs because they contain the number of vis leafs
3091         Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS]);
3092         Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3093         Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3094         Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES]);
3095
3096         if (!mod->brushq1.lightdata)
3097                 mod->brush.LightPoint = NULL;
3098
3099         if (mod->brushq1.data_compressedpvs)
3100                 Mem_Free(mod->brushq1.data_compressedpvs);
3101         mod->brushq1.data_compressedpvs = NULL;
3102         mod->brushq1.num_compressedpvs = 0;
3103
3104         Mod_Q1BSP_MakeHull0();
3105         Mod_Q1BSP_MakePortals();
3106
3107         mod->numframes = 2;             // regular and alternate animation
3108         mod->numskins = 1;
3109
3110         mainmempool = mod->mempool;
3111
3112         Mod_Q1BSP_LoadLightList();
3113
3114         // make a single combined shadow mesh to allow optimized shadow volume creation
3115         numshadowmeshtriangles = 0;
3116         for (j = 0, surf = loadmodel->brushq1.surfaces;j < loadmodel->brushq1.numsurfaces;j++, surf++)
3117         {
3118                 surf->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3119                 numshadowmeshtriangles += surf->mesh.num_triangles;
3120         }
3121         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3122         for (j = 0, surf = loadmodel->brushq1.surfaces;j < loadmodel->brushq1.numsurfaces;j++, surf++)
3123                 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, surf->mesh.data_vertex3f, NULL, NULL, NULL, NULL, surf->mesh.num_triangles, surf->mesh.data_element3i);
3124         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
3125         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3126
3127         if (loadmodel->brush.numsubmodels)
3128                 loadmodel->brush.submodels = Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(model_t *));
3129
3130         // LordHavoc: to clear the fog around the original quake submodel code, I
3131         // will explain:
3132         // first of all, some background info on the submodels:
3133         // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3134         // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3135         // now the weird for loop itself:
3136         // the loop functions in an odd way, on each iteration it sets up the
3137         // current 'mod' model (which despite the confusing code IS the model of
3138         // the number i), at the end of the loop it duplicates the model to become
3139         // the next submodel, and loops back to set up the new submodel.
3140
3141         // LordHavoc: now the explanation of my sane way (which works identically):
3142         // set up the world model, then on each submodel copy from the world model
3143         // and set up the submodel with the respective model info.
3144         for (i = 0;i < mod->brush.numsubmodels;i++)
3145         {
3146                 // LordHavoc: this code was originally at the end of this loop, but
3147                 // has been transformed to something more readable at the start here.
3148
3149                 if (i > 0)
3150                 {
3151                         char name[10];
3152                         // LordHavoc: only register submodels if it is the world
3153                         // (prevents external bsp models from replacing world submodels with
3154                         //  their own)
3155                         if (!loadmodel->isworldmodel)
3156                                 continue;
3157                         // duplicate the basic information
3158                         sprintf(name, "*%i", i);
3159                         mod = Mod_FindName(name);
3160                         // copy the base model to this one
3161                         *mod = *loadmodel;
3162                         // rename the clone back to its proper name
3163                         strcpy(mod->name, name);
3164                         // textures and memory belong to the main model
3165                         mod->texturepool = NULL;
3166                         mod->mempool = NULL;
3167                 }
3168
3169                 if (loadmodel->brush.submodels)
3170                         loadmodel->brush.submodels[i] = mod;
3171
3172                 bm = &mod->brushq1.submodels[i];
3173
3174                 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3175                 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3176                 {
3177                         mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3178                         mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3179                 }
3180
3181                 mod->firstmodelsurface = bm->firstface;
3182                 mod->nummodelsurfaces = bm->numfaces;
3183
3184                 // make the model surface list (used by shadowing/lighting)
3185                 mod->surfacelist = Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
3186                 for (j = 0;j < mod->nummodelsurfaces;j++)
3187                         mod->surfacelist[j] = mod->firstmodelsurface + j;
3188
3189                 // this gets altered below if sky is used
3190                 mod->DrawSky = NULL;
3191                 mod->Draw = R_Q1BSP_Draw;
3192                 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3193                 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3194                 mod->DrawLight = R_Q1BSP_DrawLight;
3195                 if (i != 0)
3196                 {
3197                         mod->brush.GetPVS = NULL;
3198                         mod->brush.FatPVS = NULL;
3199                         mod->brush.BoxTouchingPVS = NULL;
3200                         mod->brush.LightPoint = NULL;
3201                         mod->brush.AmbientSoundLevelsForPoint = NULL;
3202                 }
3203                 mod->brushq1.pvstexturechains = Mem_Alloc(loadmodel->mempool, mod->brushq1.numtextures * sizeof(msurface_t **));
3204                 mod->brushq1.pvstexturechainsbuffer = Mem_Alloc(loadmodel->mempool,(mod->nummodelsurfaces + mod->brushq1.numtextures) * sizeof(msurface_t *));
3205                 mod->brushq1.pvstexturechainslength = Mem_Alloc(loadmodel->mempool, mod->brushq1.numtextures * sizeof(int));
3206                 Mod_Q1BSP_BuildPVSTextureChains(mod);
3207                 Mod_Q1BSP_BuildLightmapUpdateChains(loadmodel->mempool, mod);
3208                 if (mod->nummodelsurfaces)
3209                 {
3210                         // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3211                         mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3212                         mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3213                         modelyawradius = 0;
3214                         modelradius = 0;
3215                         for (j = 0, surf = &mod->brushq1.surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surf++)
3216                         {
3217                                 // we only need to have a drawsky function if it is used(usually only on world model)
3218                                 if (surf->texinfo->texture->flags & SURF_DRAWSKY)
3219                                         mod->DrawSky = R_Q1BSP_DrawSky;
3220                                 // LordHavoc: submodels always clip, even if water
3221                                 if (mod->brush.numsubmodels - 1)
3222                                         surf->flags |= SURF_SOLIDCLIP;
3223                                 // calculate bounding shapes
3224                                 for (k = 0, vec = surf->mesh.data_vertex3f;k < surf->mesh.num_vertices;k++, vec += 3)
3225                                 {
3226                                         if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3227                                         if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3228                                         if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3229                                         if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3230                                         if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3231                                         if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3232                                         dist = vec[0]*vec[0]+vec[1]*vec[1];
3233                                         if (modelyawradius < dist)
3234                                                 modelyawradius = dist;
3235                                         dist += vec[2]*vec[2];
3236                                         if (modelradius < dist)
3237                                                 modelradius = dist;
3238                                 }
3239                         }
3240                         modelyawradius = sqrt(modelyawradius);
3241                         modelradius = sqrt(modelradius);
3242                         mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3243                         mod->yawmins[2] = mod->normalmins[2];
3244                         mod->yawmaxs[2] = mod->normalmaxs[2];
3245                         mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3246                         mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3247                         mod->radius = modelradius;
3248                         mod->radius2 = modelradius * modelradius;
3249                 }
3250                 else
3251                 {
3252                         // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3253                         Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3254                 }
3255                 Mod_Q1BSP_BuildSurfaceNeighbors(mod->brushq1.surfaces + mod->firstmodelsurface, mod->nummodelsurfaces, loadmodel->mempool);
3256
3257                 mod->brushq1.num_visleafs = bm->visleafs;
3258         }
3259
3260         Mod_Q1BSP_LoadMapBrushes();
3261
3262         //Mod_Q1BSP_ProcessLightList();
3263
3264         if (developer.integer)
3265                 Con_Printf("Some stats for q1bsp model \"%s\": %i faces, %i nodes, %i leafs, %i visleafs, %i visleafportals\n", loadmodel->name, loadmodel->brushq1.numsurfaces, loadmodel->brushq1.numnodes, loadmodel->brushq1.num_leafs, loadmodel->brushq1.num_visleafs, loadmodel->brushq1.numportals);
3266 }
3267
3268 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3269 {
3270 }
3271
3272 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3273 {
3274 /*
3275         d_t *in;
3276         m_t *out;
3277         int i, count;
3278
3279         in = (void *)(mod_base + l->fileofs);
3280         if (l->filelen % sizeof(*in))
3281                 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3282         count = l->filelen / sizeof(*in);
3283         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3284
3285         loadmodel-> = out;
3286         loadmodel->num = count;
3287
3288         for (i = 0;i < count;i++, in++, out++)
3289         {
3290         }
3291 */
3292 }
3293
3294 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3295 {
3296 /*
3297         d_t *in;
3298         m_t *out;
3299         int i, count;
3300
3301         in = (void *)(mod_base + l->fileofs);
3302         if (l->filelen % sizeof(*in))
3303                 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3304         count = l->filelen / sizeof(*in);
3305         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3306
3307         loadmodel-> = out;
3308         loadmodel->num = count;
3309
3310         for (i = 0;i < count;i++, in++, out++)
3311         {
3312         }
3313 */
3314 }
3315
3316 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3317 {
3318 /*
3319         d_t *in;
3320         m_t *out;
3321         int i, count;
3322
3323         in = (void *)(mod_base + l->fileofs);
3324         if (l->filelen % sizeof(*in))
3325                 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3326         count = l->filelen / sizeof(*in);
3327         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3328
3329         loadmodel-> = out;
3330         loadmodel->num = count;
3331
3332         for (i = 0;i < count;i++, in++, out++)
3333         {
3334         }
3335 */
3336 }
3337
3338 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3339 {
3340 /*
3341         d_t *in;
3342         m_t *out;
3343         int i, count;
3344
3345         in = (void *)(mod_base + l->fileofs);
3346         if (l->filelen % sizeof(*in))
3347                 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3348         count = l->filelen / sizeof(*in);
3349         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3350
3351         loadmodel-> = out;
3352         loadmodel->num = count;
3353
3354         for (i = 0;i < count;i++, in++, out++)
3355         {
3356         }
3357 */
3358 }
3359
3360 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3361 {
3362 /*
3363         d_t *in;
3364         m_t *out;
3365         int i, count;
3366
3367         in = (void *)(mod_base + l->fileofs);
3368         if (l->filelen % sizeof(*in))
3369                 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3370         count = l->filelen / sizeof(*in);
3371         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3372
3373         loadmodel-> = out;
3374         loadmodel->num = count;
3375
3376         for (i = 0;i < count;i++, in++, out++)
3377         {
3378         }
3379 */
3380 }
3381
3382 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3383 {
3384 /*
3385         d_t *in;
3386         m_t *out;
3387         int i, count;
3388
3389         in = (void *)(mod_base + l->fileofs);
3390         if (l->filelen % sizeof(*in))
3391                 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3392         count = l->filelen / sizeof(*in);
3393         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3394
3395         loadmodel-> = out;
3396         loadmodel->num = count;
3397
3398         for (i = 0;i < count;i++, in++, out++)
3399         {
3400         }
3401 */
3402 }
3403
3404 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3405 {
3406 /*
3407         d_t *in;
3408         m_t *out;
3409         int i, count;
3410
3411         in = (void *)(mod_base + l->fileofs);
3412         if (l->filelen % sizeof(*in))
3413                 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3414         count = l->filelen / sizeof(*in);
3415         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3416
3417         loadmodel-> = out;
3418         loadmodel->num = count;
3419
3420         for (i = 0;i < count;i++, in++, out++)
3421         {
3422         }
3423 */
3424 }
3425
3426 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3427 {
3428 /*
3429         d_t *in;
3430         m_t *out;
3431         int i, count;
3432
3433         in = (void *)(mod_base + l->fileofs);
3434         if (l->filelen % sizeof(*in))
3435                 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3436         count = l->filelen / sizeof(*in);
3437         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3438
3439         loadmodel-> = out;
3440         loadmodel->num = count;
3441
3442         for (i = 0;i < count;i++, in++, out++)
3443         {
3444         }
3445 */
3446 }
3447
3448 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3449 {
3450 /*
3451         d_t *in;
3452         m_t *out;
3453         int i, count;
3454
3455         in = (void *)(mod_base + l->fileofs);
3456         if (l->filelen % sizeof(*in))
3457                 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3458         count = l->filelen / sizeof(*in);
3459         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3460
3461         loadmodel-> = out;
3462         loadmodel->num = count;
3463
3464         for (i = 0;i < count;i++, in++, out++)
3465         {
3466         }
3467 */
3468 }
3469
3470 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3471 {
3472 /*
3473         d_t *in;
3474         m_t *out;
3475         int i, count;
3476
3477         in = (void *)(mod_base + l->fileofs);
3478         if (l->filelen % sizeof(*in))
3479                 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3480         count = l->filelen / sizeof(*in);
3481         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3482
3483         loadmodel-> = out;
3484         loadmodel->num = count;
3485
3486         for (i = 0;i < count;i++, in++, out++)
3487         {
3488         }
3489 */
3490 }
3491
3492 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3493 {
3494 /*
3495         d_t *in;
3496         m_t *out;
3497         int i, count;
3498
3499         in = (void *)(mod_base + l->fileofs);
3500         if (l->filelen % sizeof(*in))
3501                 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3502         count = l->filelen / sizeof(*in);
3503         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3504
3505         loadmodel-> = out;
3506         loadmodel->num = count;
3507
3508         for (i = 0;i < count;i++, in++, out++)
3509         {
3510         }
3511 */
3512 }
3513
3514 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3515 {
3516 /*
3517         d_t *in;
3518         m_t *out;
3519         int i, count;
3520
3521         in = (void *)(mod_base + l->fileofs);
3522         if (l->filelen % sizeof(*in))
3523                 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3524         count = l->filelen / sizeof(*in);
3525         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3526
3527         loadmodel-> = out;
3528         loadmodel->num = count;
3529
3530         for (i = 0;i < count;i++, in++, out++)
3531         {
3532         }
3533 */
3534 }
3535
3536 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3537 {
3538 /*
3539         d_t *in;
3540         m_t *out;
3541         int i, count;
3542
3543         in = (void *)(mod_base + l->fileofs);
3544         if (l->filelen % sizeof(*in))
3545                 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3546         count = l->filelen / sizeof(*in);
3547         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3548
3549         loadmodel-> = out;
3550         loadmodel->num = count;
3551
3552         for (i = 0;i < count;i++, in++, out++)
3553         {
3554         }
3555 */
3556 }
3557
3558 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
3559 {
3560 /*
3561         d_t *in;
3562         m_t *out;
3563         int i, count;
3564
3565         in = (void *)(mod_base + l->fileofs);
3566         if (l->filelen % sizeof(*in))
3567                 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3568         count = l->filelen / sizeof(*in);
3569         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3570
3571         loadmodel-> = out;
3572         loadmodel->num = count;
3573
3574         for (i = 0;i < count;i++, in++, out++)
3575         {
3576         }
3577 */
3578 }
3579
3580 static void Mod_Q2BSP_LoadAreas(lump_t *l)
3581 {
3582 /*
3583         d_t *in;
3584         m_t *out;
3585         int i, count;
3586
3587         in = (void *)(mod_base + l->fileofs);
3588         if (l->filelen % sizeof(*in))
3589                 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
3590         count = l->filelen / sizeof(*in);
3591         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3592
3593         loadmodel-> = out;
3594         loadmodel->num = count;
3595
3596         for (i = 0;i < count;i++, in++, out++)
3597         {
3598         }
3599 */
3600 }
3601
3602 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
3603 {
3604 /*
3605         d_t *in;
3606         m_t *out;
3607         int i, count;
3608
3609         in = (void *)(mod_base + l->fileofs);
3610         if (l->filelen % sizeof(*in))
3611                 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
3612         count = l->filelen / sizeof(*in);
3613         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3614
3615         loadmodel-> = out;
3616         loadmodel->num = count;
3617
3618         for (i = 0;i < count;i++, in++, out++)
3619         {
3620         }
3621 */
3622 }
3623
3624 static void Mod_Q2BSP_LoadModels(lump_t *l)
3625 {
3626 /*
3627         d_t *in;
3628         m_t *out;
3629         int i, count;
3630
3631         in = (void *)(mod_base + l->fileofs);
3632         if (l->filelen % sizeof(*in))
3633                 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
3634         count = l->filelen / sizeof(*in);
3635         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3636
3637         loadmodel-> = out;
3638         loadmodel->num = count;
3639
3640         for (i = 0;i < count;i++, in++, out++)
3641         {
3642         }
3643 */
3644 }
3645
3646 void static Mod_Q2BSP_Load(model_t *mod, void *buffer)
3647 {
3648         int i;
3649         q2dheader_t *header;
3650
3651         Host_Error("Mod_Q2BSP_Load: not yet implemented\n");
3652
3653         mod->type = mod_brushq2;
3654
3655         header = (q2dheader_t *)buffer;
3656
3657         i = LittleLong(header->version);
3658         if (i != Q2BSPVERSION)
3659                 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
3660         mod->brush.ishlbsp = false;
3661         if (loadmodel->isworldmodel)
3662                 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3663
3664         mod_base = (qbyte *)header;
3665
3666         // swap all the lumps
3667         for (i = 0;i < (int) sizeof(*header) / 4;i++)
3668                 ((int *)header)[i] = LittleLong(((int *)header)[i]);
3669
3670         // store which lightmap format to use
3671         mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3672
3673         Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
3674         Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
3675         Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
3676         Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
3677         Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
3678         Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
3679         Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
3680         Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
3681         Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
3682         Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
3683         Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
3684         Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
3685         Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
3686         Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
3687         Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
3688         Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
3689         Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
3690         // LordHavoc: must go last because this makes the submodels
3691         Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
3692 }
3693
3694 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents);
3695 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents);
3696
3697 static void Mod_Q3BSP_LoadEntities(lump_t *l)
3698 {
3699         const char *data;
3700         char key[128], value[4096];
3701         float v[3];
3702         loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
3703         loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
3704         loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
3705         if (!l->filelen)
3706                 return;
3707         loadmodel->brush.entities = Mem_Alloc(loadmodel->mempool, l->filelen);
3708         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
3709         data = loadmodel->brush.entities;
3710         // some Q3 maps override the lightgrid_cellsize with a worldspawn key
3711         if (data && COM_ParseToken(&data, false) && com_token[0] == '{')
3712         {
3713                 while (1)
3714                 {
3715                         if (!COM_ParseToken(&data, false))
3716                                 break; // error
3717                         if (com_token[0] == '}')
3718                                 break; // end of worldspawn
3719                         if (com_token[0] == '_')
3720                                 strcpy(key, com_token + 1);
3721                         else
3722                                 strcpy(key, com_token);
3723                         while (key[strlen(key)-1] == ' ') // remove trailing spaces
3724                                 key[strlen(key)-1] = 0;
3725                         if (!COM_ParseToken(&data, false))
3726                                 break; // error
3727                         strcpy(value, com_token);
3728                         if (!strcmp("gridsize", key))
3729                         {
3730                                 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
3731                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
3732                         }
3733                 }
3734         }
3735 }
3736
3737 static void Mod_Q3BSP_LoadTextures(lump_t *l)
3738 {
3739         q3dtexture_t *in;
3740         q3mtexture_t *out;
3741         int i, count;
3742         int j, c;
3743         fssearch_t *search;
3744         char *f;
3745         const char *text;
3746         int flags, flags2, numparameters, passnumber;
3747         char shadername[Q3PATHLENGTH];
3748         char sky[Q3PATHLENGTH];
3749         char firstpasstexturename[Q3PATHLENGTH];
3750         char parameter[4][Q3PATHLENGTH];
3751
3752         in = (void *)(mod_base + l->fileofs);
3753         if (l->filelen % sizeof(*in))
3754                 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
3755         count = l->filelen / sizeof(*in);
3756         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3757
3758         loadmodel->brushq3.data_textures = out;
3759         loadmodel->brushq3.num_textures = count;
3760
3761         for (i = 0;i < count;i++, in++, out++)
3762         {
3763                 out->number = i;
3764                 strlcpy (out->name, in->name, sizeof (out->name));
3765                 out->surfaceflags = LittleLong(in->surfaceflags);
3766                 out->nativecontents = LittleLong(in->contents);
3767                 out->supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, out->nativecontents);
3768                 out->surfaceparms = -1;
3769         }
3770
3771         // do a quick parse of shader files to get surfaceparms
3772         if ((search = FS_Search("scripts/*.shader", true, false)))
3773         {
3774                 for (i = 0;i < search->numfilenames;i++)
3775                 {
3776                         if ((f = FS_LoadFile(search->filenames[i], tempmempool, false)))
3777                         {
3778                                 text = f;
3779                                 while (COM_ParseToken(&text, false))
3780                                 {
3781                                         strlcpy (shadername, com_token, sizeof (shadername));
3782                                         flags = 0;
3783                                         flags2 = 0;
3784                                         sky[0] = 0;
3785                                         passnumber = 0;
3786                                         firstpasstexturename[0] = 0;
3787                                         if (COM_ParseToken(&text, false) && !strcasecmp(com_token, "{"))
3788                                         {
3789                                                 while (COM_ParseToken(&text, false))
3790                                                 {
3791                                                         if (!strcasecmp(com_token, "}"))
3792                                                                 break;
3793                                                         else if (!strcasecmp(com_token, "{"))
3794                                                         {
3795                                                                 while (COM_ParseToken(&text, false))
3796                                                                 {
3797                                                                         if (!strcasecmp(com_token, "}"))
3798                                                                                 break;
3799                                                                         if (!strcasecmp(com_token, "\n"))
3800                                                                                 continue;
3801                                                                         numparameters = 0;
3802                                                                         for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
3803                                                                         {
3804                                                                                 if (j < 4)
3805                                                                                 {
3806                                                                                         strlcpy(parameter[j], com_token, sizeof(parameter[j]));
3807                                                                                         numparameters = j + 1;
3808                                                                                 }
3809                                                                                 if (!COM_ParseToken(&text, true))
3810                                                                                         break;
3811                                                                         }
3812                                                                         if (developer.integer >= 2)
3813                                                                         {
3814                                                                                 Con_Printf("%s %i: ", shadername, passnumber);
3815                                                                                 for (j = 0;j < numparameters;j++)
3816                                                                                         Con_Printf(" %s", parameter[j]);
3817                                                                                 Con_Print("\n");
3818                                                                         }
3819                                                                         if (passnumber == 0 && numparameters >= 1)
3820                                                                         {
3821                                                                                 if (!strcasecmp(parameter[0], "blendfunc"))
3822                                                                                 {
3823                                                                                         if (numparameters == 2 && !strcasecmp(parameter[1], "add"))
3824                                                                                                 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3825                                                                                         else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_one") && !strcasecmp(parameter[2], "gl_one"))
3826                                                                                                 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3827                                                                                         else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_src_alpha") && !strcasecmp(parameter[2], "gl_one"))
3828                                                                                                 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3829                                                                                 }
3830                                                                                 else if (numparameters >= 2 && (!strcasecmp(parameter[0], "map") || !strcasecmp(parameter[0], "clampmap")))
3831                                                                                         strlcpy(firstpasstexturename, parameter[1], sizeof(firstpasstexturename));
3832                                                                                 else if (numparameters >= 3 && !strcasecmp(parameter[0], "animmap"))
3833                                                                                         strlcpy(firstpasstexturename, parameter[2], sizeof(firstpasstexturename));
3834                                                                         }
3835                                                                         if (!strcasecmp(parameter[0], "alphafunc"))
3836                                                                                 flags2 |= Q3TEXTUREFLAG_ALPHATEST;
3837                                                                         // break out a level if it was }
3838                                                                         if (!strcasecmp(com_token, "}"))
3839                                                                                 break;
3840                                                                 }
3841                                                                 passnumber++;
3842                                                                 continue;
3843                                                         }
3844                                                         numparameters = 0;
3845                                                         for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
3846                                                         {
3847                                                                 if (j < 4)
3848                                                                 {
3849                                                                         strlcpy(parameter[j], com_token, sizeof(parameter[j]));
3850                                                                         numparameters = j + 1;
3851                                                                 }
3852                                                                 if (!COM_ParseToken(&text, true))
3853                                                                         break;
3854                                                         }
3855                                                         if (i == 0 && !strcasecmp(com_token, "}"))
3856                                                                 break;
3857                                                         if (developer.integer >= 2)
3858                                                         {
3859                                                                 Con_Printf("%s: ", shadername);
3860                                                                 for (j = 0;j < numparameters;j++)
3861                                                                         Con_Printf(" %s", parameter[j]);
3862                                                                 Con_Print("\n");
3863                                                         }
3864                                                         if (numparameters < 1)
3865                                                                 continue;
3866                                                         if (!strcasecmp(parameter[0], "surfaceparm") && numparameters >= 2)
3867                                                         {
3868                                                                 if (!strcasecmp(parameter[1], "alphashadow"))
3869                                                                         flags |= Q3SURFACEPARM_ALPHASHADOW;
3870                                                                 else if (!strcasecmp(parameter[1], "areaportal"))
3871                                                                         flags |= Q3SURFACEPARM_AREAPORTAL;
3872                                                                 else if (!strcasecmp(parameter[1], "clusterportal"))
3873                                                                         flags |= Q3SURFACEPARM_CLUSTERPORTAL;
3874                                                                 else if (!strcasecmp(parameter[1], "detail"))
3875                                                                         flags |= Q3SURFACEPARM_DETAIL;
3876                                                                 else if (!strcasecmp(parameter[1], "donotenter"))
3877                                                                         flags |= Q3SURFACEPARM_DONOTENTER;
3878                                                                 else if (!strcasecmp(parameter[1], "fog"))
3879                                                                         flags |= Q3SURFACEPARM_FOG;
3880                                                                 else if (!strcasecmp(parameter[1], "lava"))
3881                                                                         flags |= Q3SURFACEPARM_LAVA;
3882                                                                 else if (!strcasecmp(parameter[1], "lightfilter"))
3883                                                                         flags |= Q3SURFACEPARM_LIGHTFILTER;
3884                                                                 else if (!strcasecmp(parameter[1], "metalsteps"))
3885                                                                         flags |= Q3SURFACEPARM_METALSTEPS;
3886                                                                 else if (!strcasecmp(parameter[1], "nodamage"))
3887                                                                         flags |= Q3SURFACEPARM_NODAMAGE;
3888                                                                 else if (!strcasecmp(parameter[1], "nodlight"))
3889                                                                         flags |= Q3SURFACEPARM_NODLIGHT;
3890                                                                 else if (!strcasecmp(parameter[1], "nodraw"))
3891                                                                         flags |= Q3SURFACEPARM_NODRAW;
3892                                                                 else if (!strcasecmp(parameter[1], "nodrop"))
3893                                                                         flags |= Q3SURFACEPARM_NODROP;
3894                                                                 else if (!strcasecmp(parameter[1], "noimpact"))
3895                                                                         flags |= Q3SURFACEPARM_NOIMPACT;
3896                                                                 else if (!strcasecmp(parameter[1], "nolightmap"))
3897                                                                         flags |= Q3SURFACEPARM_NOLIGHTMAP;
3898                                                                 else if (!strcasecmp(parameter[1], "nomarks"))
3899                                                                         flags |= Q3SURFACEPARM_NOMARKS;
3900                                                                 else if (!strcasecmp(parameter[1], "nomipmaps"))
3901                                                                         flags |= Q3SURFACEPARM_NOMIPMAPS;
3902                                                                 else if (!strcasecmp(parameter[1], "nonsolid"))
3903                                                                         flags |= Q3SURFACEPARM_NONSOLID;
3904                                                                 else if (!strcasecmp(parameter[1], "origin"))
3905                                                                         flags |= Q3SURFACEPARM_ORIGIN;
3906                                                                 else if (!strcasecmp(parameter[1], "playerclip"))
3907                                                                         flags |= Q3SURFACEPARM_PLAYERCLIP;
3908                                                                 else if (!strcasecmp(parameter[1], "sky"))
3909                                                                         flags |= Q3SURFACEPARM_SKY;
3910                                                                 else if (!strcasecmp(parameter[1], "slick"))
3911                                                                         flags |= Q3SURFACEPARM_SLICK;
3912                                                                 else if (!strcasecmp(parameter[1], "slime"))
3913                                                                         flags |= Q3SURFACEPARM_SLIME;
3914                                                                 else if (!strcasecmp(parameter[1], "structural"))
3915                                                                         flags |= Q3SURFACEPARM_STRUCTURAL;
3916                                                                 else if (!strcasecmp(parameter[1], "trans"))
3917                                                                         flags |= Q3SURFACEPARM_TRANS;
3918                                                                 else if (!strcasecmp(parameter[1], "water"))
3919                                                                         flags |= Q3SURFACEPARM_WATER;
3920                                                                 else if (!strcasecmp(parameter[1], "pointlight"))
3921                                                                         flags |= Q3SURFACEPARM_POINTLIGHT;
3922                                                                 else
3923                                                                         Con_Printf("%s parsing warning: unknown surfaceparm \"%s\"\n", search->filenames[i], parameter[1]);
3924                                                         }
3925                                                         else if (!strcasecmp(parameter[0], "sky") && numparameters >= 2)
3926                                                                 strlcpy(sky, parameter[1], sizeof(sky));
3927                                                         else if (!strcasecmp(parameter[0], "skyparms") && numparameters >= 2)
3928                                                         {
3929                                                                 if (!atoi(parameter[1]) && strcasecmp(parameter[1], "-"))
3930                                                                         strlcpy(sky, parameter[1], sizeof(sky));
3931                                                         }
3932                                                         else if (!strcasecmp(parameter[0], "cull") && numparameters >= 2)
3933                                                         {
3934                                                                 if (!strcasecmp(parameter[1], "disable") || !strcasecmp(parameter[1], "none") || !strcasecmp(parameter[1], "twosided"))
3935                                                                         flags2 |= Q3TEXTUREFLAG_TWOSIDED;
3936                                                         }
3937                                                         else if (!strcasecmp(parameter[0], "nomipmaps"))
3938                                                                 flags2 |= Q3TEXTUREFLAG_NOMIPMAPS;
3939                                                         else if (!strcasecmp(parameter[0], "nopicmip"))
3940                                                                 flags2 |= Q3TEXTUREFLAG_NOPICMIP;
3941                                                         else if (!strcasecmp(parameter[0], "deformvertexes") && numparameters >= 2)
3942                                                         {
3943                                                                 if (!strcasecmp(parameter[1], "autosprite") && numparameters == 2)
3944                                                                         flags2 |= Q3TEXTUREFLAG_AUTOSPRITE;
3945                                                                 if (!strcasecmp(parameter[1], "autosprite2") && numparameters == 2)
3946                                                                         flags2 |= Q3TEXTUREFLAG_AUTOSPRITE2;
3947                                                         }
3948                                                 }
3949                                                 // force transparent render path for a number of odd
3950                                                 // shader effects to avoid bogging down the normal
3951                                                 // render path unnecessarily
3952                                                 if (flags2 & (Q3TEXTUREFLAG_ADDITIVE | Q3TEXTUREFLAG_AUTOSPRITE | Q3TEXTUREFLAG_AUTOSPRITE2 | Q3TEXTUREFLAG_ALPHATEST))
3953                                                         flags |= Q3SURFACEPARM_TRANS;
3954                                                 // add shader to list (shadername and flags)
3955                                                 // actually here we just poke into the texture settings
3956                                                 for (j = 0, out = loadmodel->brushq3.data_textures;j < loadmodel->brushq3.num_textures;j++, out++)
3957                                                 {
3958                                                         if (!strcasecmp(out->name, shadername))
3959                                                         {
3960                                                                 out->surfaceparms = flags;
3961                                                                 out->textureflags = flags2;
3962                                                                 strlcpy(out->firstpasstexturename, firstpasstexturename, sizeof(out->firstpasstexturename));
3963                                                                 if ((flags & Q3SURFACEPARM_SKY) && sky[0])
3964                                                                 {
3965                                                                         // quake3 seems to append a _ to the skybox name, so this must do so as well
3966                                                                         dpsnprintf(loadmodel->brush.skybox, sizeof(loadmodel->brush.skybox), "%s_", sky);
3967                                                                 }
3968                                                         }
3969                                                 }
3970                                         }
3971                                         else
3972                                         {
3973                                                 Con_Printf("%s parsing error - expected \"{\", found \"%s\"\n", search->filenames[i], com_token);
3974                                                 goto parseerror;
3975                                         }
3976                                 }
3977 parseerror:
3978                                 Mem_Free(f);
3979                         }
3980                 }
3981         }
3982
3983         c = 0;
3984         for (j = 0, out = loadmodel->brushq3.data_textures;j < loadmodel->brushq3.num_textures;j++, out++)
3985         {
3986                 if (out->surfaceparms == -1)
3987                 {
3988                         c++;
3989                         Con_DPrintf("%s: No shader found for texture \"%s\"\n", loadmodel->name, out->name);
3990                         out->surfaceparms = 0;
3991                         // these are defaults
3992                         //if (!strncmp(out->name, "textures/skies/", 15))
3993                         //      out->surfaceparms |= Q3SURFACEPARM_SKY;
3994                         //if (!strcmp(out->name, "caulk") || !strcmp(out->name, "common/caulk") || !strcmp(out->name, "textures/common/caulk")
3995                         // || !strcmp(out->name, "nodraw") || !strcmp(out->name, "common/nodraw") || !strcmp(out->name, "textures/common/nodraw"))
3996                         //      out->surfaceparms |= Q3SURFACEPARM_NODRAW;
3997                         //if (R_TextureHasAlpha(out->skin.base))
3998                         //      out->surfaceparms |= Q3SURFACEPARM_TRANS;
3999                 }
4000                 if (!Mod_LoadSkinFrame(&out->skin, out->name, (((out->textureflags & Q3TEXTUREFLAG_NOMIPMAPS) || (out->surfaceparms & Q3SURFACEPARM_NOMIPMAPS)) ? 0 : TEXF_MIPMAP) | TEXF_ALPHA | TEXF_PRECACHE | (out->textureflags & Q3TEXTUREFLAG_NOPICMIP ? 0 : TEXF_PICMIP), false, true, true))
4001                         if (!Mod_LoadSkinFrame(&out->skin, out->firstpasstexturename, (((out->textureflags & Q3TEXTUREFLAG_NOMIPMAPS) || (out->surfaceparms & Q3SURFACEPARM_NOMIPMAPS)) ? 0 : TEXF_MIPMAP) | TEXF_ALPHA | TEXF_PRECACHE | (out->textureflags & Q3TEXTUREFLAG_NOPICMIP ? 0 : TEXF_PICMIP), false, true, true))
4002                                 Con_Printf("%s: texture loading for shader \"%s\" failed (first layer \"%s\" not found either)\n", loadmodel->name, out->name, out->firstpasstexturename);
4003         }
4004         if (c)
4005                 Con_DPrintf("%s: %i textures missing shaders\n", loadmodel->name, c);
4006 }
4007
4008 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4009 {
4010         q3dplane_t *in;
4011         mplane_t *out;
4012         int i, count;
4013
4014         in = (void *)(mod_base + l->fileofs);
4015         if (l->filelen % sizeof(*in))
4016                 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4017         count = l->filelen / sizeof(*in);
4018         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4019
4020         loadmodel->brushq3.data_planes = out;
4021         loadmodel->brushq3.num_planes = count;
4022
4023         for (i = 0;i < count;i++, in++, out++)
4024         {
4025                 out->normal[0] = LittleLong(in->normal[0]);
4026                 out->normal[1] = LittleLong(in->normal[1]);
4027                 out->normal[2] = LittleLong(in->normal[2]);
4028                 out->dist = LittleLong(in->dist);
4029                 PlaneClassify(out);
4030         }
4031 }
4032
4033 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4034 {
4035         q3dbrushside_t *in;
4036         q3mbrushside_t *out;
4037         int i, n, count;
4038
4039         in = (void *)(mod_base + l->fileofs);
4040         if (l->filelen % sizeof(*in))
4041                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4042         count = l->filelen / sizeof(*in);
4043         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4044
4045         loadmodel->brushq3.data_brushsides = out;
4046         loadmodel->brushq3.num_brushsides = count;
4047
4048         for (i = 0;i < count;i++, in++, out++)
4049         {
4050                 n = LittleLong(in->planeindex);
4051                 if (n < 0 || n >= loadmodel->brushq3.num_planes)
4052                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)\n", n, loadmodel->brushq3.num_planes);
4053                 out->plane = loadmodel->brushq3.data_planes + n;
4054                 n = LittleLong(in->textureindex);
4055                 if (n < 0 || n >= loadmodel->brushq3.num_textures)
4056                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)\n", n, loadmodel->brushq3.num_textures);
4057                 out->texture = loadmodel->brushq3.data_textures + n;
4058         }
4059 }
4060
4061 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4062 {
4063         q3dbrush_t *in;
4064         q3mbrush_t *out;
4065         int i, j, n, c, count, maxplanes;
4066         mplane_t *planes;
4067
4068         in = (void *)(mod_base + l->fileofs);
4069         if (l->filelen % sizeof(*in))
4070                 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4071         count = l->filelen / sizeof(*in);
4072         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4073
4074         loadmodel->brushq3.data_brushes = out;
4075         loadmodel->brushq3.num_brushes = count;
4076
4077         maxplanes = 0;
4078         planes = NULL;
4079
4080         for (i = 0;i < count;i++, in++, out++)
4081         {
4082                 n = LittleLong(in->firstbrushside);
4083                 c = LittleLong(in->numbrushsides);
4084                 if (n < 0 || n + c > loadmodel->brushq3.num_brushsides)
4085                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)\n", n, n + c, loadmodel->brushq3.num_brushsides);
4086                 out->firstbrushside = loadmodel->brushq3.data_brushsides + n;
4087                 out->numbrushsides = c;
4088                 n = LittleLong(in->textureindex);
4089                 if (n < 0 || n >= loadmodel->brushq3.num_textures)
4090                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)\n", n, loadmodel->brushq3.num_textures);
4091                 out->texture = loadmodel->brushq3.data_textures + n;
4092
4093                 // make a list of mplane_t structs to construct a colbrush from
4094                 if (maxplanes < out->numbrushsides)
4095                 {
4096                         maxplanes = out->numbrushsides;
4097                         if (planes)
4098                                 Mem_Free(planes);
4099                         planes = Mem_Alloc(tempmempool, sizeof(mplane_t) * maxplanes);
4100                 }
4101                 for (j = 0;j < out->numbrushsides;j++)
4102                 {
4103                         VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4104                         planes[j].dist = out->firstbrushside[j].plane->dist;
4105                 }
4106                 // make the colbrush from the planes
4107                 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4108         }
4109         if (planes)
4110                 Mem_Free(planes);
4111 }
4112
4113 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4114 {
4115         q3deffect_t *in;
4116         q3meffect_t *out;
4117         int i, n, count;
4118
4119         in = (void *)(mod_base + l->fileofs);
4120         if (l->filelen % sizeof(*in))
4121                 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4122         count = l->filelen / sizeof(*in);
4123         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4124
4125         loadmodel->brushq3.data_effects = out;
4126         loadmodel->brushq3.num_effects = count;
4127
4128         for (i = 0;i < count;i++, in++, out++)
4129         {
4130                 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4131                 n = LittleLong(in->brushindex);
4132                 if (n < 0 || n >= loadmodel->brushq3.num_brushes)
4133                         Host_Error("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes)\n", n, loadmodel->brushq3.num_brushes);
4134                 out->brush = loadmodel->brushq3.data_brushes + n;
4135                 out->unknown = LittleLong(in->unknown);
4136         }
4137 }
4138
4139 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4140 {
4141         q3dvertex_t *in;
4142         int i, count;
4143
4144         in = (void *)(mod_base + l->fileofs);
4145         if (l->filelen % sizeof(*in))
4146                 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4147         loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4148         loadmodel->brushq3.data_vertex3f = Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 2 + 2 + 3 + 3 + 3 + 4)));
4149         loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_vertex3f + count * 3;
4150         loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4151         loadmodel->brushq3.data_svector3f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4152         loadmodel->brushq3.data_tvector3f = loadmodel->brushq3.data_svector3f + count * 3;
4153         loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_tvector3f + count * 3;
4154         loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_normal3f + count * 3;
4155
4156         for (i = 0;i < count;i++, in++)
4157         {
4158                 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4159                 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4160                 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4161                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4162                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4163                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4164                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4165                 // svector/tvector are calculated later in face loading
4166                 loadmodel->brushq3.data_svector3f[i * 3 + 0] = 0;
4167                 loadmodel->brushq3.data_svector3f[i * 3 + 1] = 0;
4168                 loadmodel->brushq3.data_svector3f[i * 3 + 2] = 0;
4169                 loadmodel->brushq3.data_tvector3f[i * 3 + 0] = 0;
4170                 loadmodel->brushq3.data_tvector3f[i * 3 + 1] = 0;
4171                 loadmodel->brushq3.data_tvector3f[i * 3 + 2] = 0;
4172                 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4173                 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4174                 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4175                 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4176                 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4177                 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4178                 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4179         }
4180 }
4181
4182 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4183 {
4184         int *in;
4185         int *out;
4186         int i, count;
4187
4188         in = (void *)(mod_base + l->fileofs);
4189         if (l->filelen % sizeof(int[3]))
4190                 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4191         count = l->filelen / sizeof(*in);
4192         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out) * 2);
4193
4194         loadmodel->brushq3.num_triangles = count / 3;
4195         loadmodel->brushq3.data_element3i = out;
4196         loadmodel->brushq3.data_neighbor3i = out + count;
4197
4198         for (i = 0;i < count;i++, in++, out++)
4199         {
4200                 *out = LittleLong(*in);
4201                 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4202                 {
4203                         Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4204                         *out = 0;
4205                 }
4206         }
4207 }
4208
4209 static void Mod_Q3BSP_LoadLightmaps(lump_t *l)
4210 {
4211         q3dlightmap_t *in;
4212         rtexture_t **out;
4213         int i, count;
4214
4215         if (!l->filelen)
4216                 return;
4217         in = (void *)(mod_base + l->fileofs);
4218         if (l->filelen % sizeof(*in))
4219                 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4220         count = l->filelen / sizeof(*in);
4221         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4222
4223         loadmodel->brushq3.data_lightmaps = out;
4224         loadmodel->brushq3.num_lightmaps = count;
4225
4226         for (i = 0;i < count;i++, in++, out++)
4227                 *out = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", i), 128, 128, in->rgb, TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
4228 }
4229
4230 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4231 {
4232         q3dface_t *in, *oldin;
4233         q3msurface_t *out, *oldout;
4234         int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshnum, meshvertices, meshtriangles, numvertices, numtriangles;
4235         //int *originalelement3i;
4236         //int *originalneighbor3i;
4237         float *originalvertex3f;
4238         //float *originalsvector3f;
4239         //float *originaltvector3f;
4240         //float *originalnormal3f;
4241         float *originalcolor4f;
4242         float *originaltexcoordtexture2f;
4243         float *originaltexcoordlightmap2f;
4244         float *v;
4245         surfmesh_t *mesh, *tempmeshlist[1024];
4246
4247         in = (void *)(mod_base + l->fileofs);
4248         if (l->filelen % sizeof(*in))
4249                 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4250         count = l->filelen / sizeof(*in);
4251         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4252
4253         loadmodel->brushq3.data_faces = out;
4254         loadmodel->brushq3.num_faces = count;
4255
4256         i = 0;
4257         for (meshnum = 0;i < count;meshnum++)
4258         {
4259                 oldi = i;
4260                 oldin = in;
4261                 oldout = out;
4262                 meshvertices = 0;
4263                 meshtriangles = 0;
4264                 for (;i < count;i++, in++, out++)
4265                 {
4266                         // check face type first
4267                         type = LittleLong(in->type);
4268                         if (type != Q3FACETYPE_POLYGON
4269                          && type != Q3FACETYPE_PATCH
4270                          && type != Q3FACETYPE_MESH
4271                          && type != Q3FACETYPE_FLARE)
4272                         {
4273                                 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4274                                 continue;
4275                         }
4276
4277                         n = LittleLong(in->textureindex);
4278                         if (n < 0 || n >= loadmodel->brushq3.num_textures)
4279                         {
4280                                 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->brushq3.num_textures);
4281                                 continue;
4282                         }
4283                         out->texture = loadmodel->brushq3.data_textures + n;
4284                         n = LittleLong(in->effectindex);
4285                         if (n < -1 || n >= loadmodel->brushq3.num_effects)
4286                         {
4287                                 if (developer.integer >= 2)
4288                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4289                                 n = -1;
4290                         }
4291                         if (n == -1)
4292                                 out->effect = NULL;
4293                         else
4294                                 out->effect = loadmodel->brushq3.data_effects + n;
4295                         n = LittleLong(in->lightmapindex);
4296                         if (n >= loadmodel->brushq3.num_lightmaps)
4297                         {
4298                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_lightmaps);
4299                                 n = -1;
4300                         }
4301                         else if (n < 0)
4302                                 n = -1;
4303                         if (n == -1)
4304                                 out->lightmaptexture = NULL;
4305                         else
4306                                 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n];
4307
4308                         firstvertex = LittleLong(in->firstvertex);
4309                         numvertices = LittleLong(in->numvertices);
4310                         firstelement = LittleLong(in->firstelement);
4311                         numtriangles = LittleLong(in->numelements) / 3;
4312                         if (numtriangles * 3 != LittleLong(in->numelements))
4313                         {
4314                                 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));
4315                                 continue;
4316                         }
4317                         if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4318                         {
4319                                 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);
4320                                 continue;
4321                         }
4322                         if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4323                         {
4324                                 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);
4325                                 continue;
4326                         }
4327                         switch(type)
4328                         {
4329                         case Q3FACETYPE_POLYGON:
4330                         case Q3FACETYPE_MESH:
4331                                 // no processing necessary
4332                                 break;
4333                         case Q3FACETYPE_PATCH:
4334                                 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4335                                 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4336                                 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))
4337                                 {
4338                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4339                                         continue;
4340                                 }
4341                                 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4342                                 // convert patch to Q3FACETYPE_MESH
4343                                 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4344                                 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4345                                 // bound to user settings
4346                                 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4347                                 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4348                                 // bound to sanity settings
4349                                 xtess = bound(1, xtess, 1024);
4350                                 ytess = bound(1, ytess, 1024);
4351                                 // bound to user limit on vertices
4352                                 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4353                                 {
4354                                         if (xtess > ytess)
4355                                                 xtess--;
4356                                         else
4357                                                 ytess--;
4358                                 }
4359                                 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4360                                 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4361                                 numvertices = finalwidth * finalheight;
4362                                 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4363                                 break;
4364                         case Q3FACETYPE_FLARE:
4365                                 if (developer.integer >= 2)
4366                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4367                                 // don't render it
4368                                 continue;
4369                         }
4370                         out->mesh.num_vertices = numvertices;
4371                         out->mesh.num_triangles = numtriangles;
4372                         if (meshvertices + out->mesh.num_vertices > 65536)
4373                                 break;
4374                         meshvertices += out->mesh.num_vertices;
4375                         meshtriangles += out->mesh.num_triangles;
4376                 }
4377
4378                 i = oldi;
4379                 in = oldin;
4380                 out = oldout;
4381                 mesh = tempmeshlist[meshnum] = Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, 0, 0, false, false, true);
4382                 meshvertices = 0;
4383                 meshtriangles = 0;
4384                 for (;i < count && meshvertices + out->mesh.num_vertices <= mesh->num_vertices;i++, in++, out++)
4385                 {
4386                         if (out->mesh.num_vertices < 3 || out->mesh.num_triangles < 1)
4387                                 continue;
4388
4389                         type = LittleLong(in->type);
4390                         firstvertex = LittleLong(in->firstvertex);
4391                         firstelement = LittleLong(in->firstelement);
4392                         out->mesh.data_vertex3f = mesh->data_vertex3f + meshvertices * 3;
4393                         out->mesh.data_svector3f = mesh->data_svector3f + meshvertices * 3;
4394                         out->mesh.data_tvector3f = mesh->data_tvector3f + meshvertices * 3;
4395                         out->mesh.data_normal3f = mesh->data_normal3f + meshvertices * 3;
4396                         out->mesh.data_texcoordtexture2f = mesh->data_texcoordtexture2f + meshvertices * 2;
4397                         out->mesh.data_texcoordlightmap2f = mesh->data_texcoordlightmap2f + meshvertices * 2;
4398                         out->mesh.data_lightmapcolor4f = mesh->data_lightmapcolor4f + meshvertices * 4;
4399                         out->mesh.data_element3i = mesh->data_element3i + meshtriangles * 3;
4400                         out->mesh.data_neighbor3i = mesh->data_neighbor3i + meshtriangles * 3;
4401                         switch(type)
4402                         {
4403                         case Q3FACETYPE_POLYGON:
4404                         case Q3FACETYPE_MESH:
4405                                 // no processing necessary
4406                                 for (j = 0;j < out->mesh.num_vertices;j++)
4407                                 {
4408                                         out->mesh.data_vertex3f[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4409                                         out->mesh.data_vertex3f[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4410                                         out->mesh.data_vertex3f[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4411                                         out->mesh.data_texcoordtexture2f[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4412                                         out->mesh.data_texcoordtexture2f[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4413                                         out->mesh.data_texcoordlightmap2f[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4414                                         out->mesh.data_texcoordlightmap2f[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4415                                         out->mesh.data_lightmapcolor4f[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4416                                         out->mesh.data_lightmapcolor4f[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4417                                         out->mesh.data_lightmapcolor4f[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4418                                         out->mesh.data_lightmapcolor4f[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4419                                 }
4420                                 for (j = 0;j < out->mesh.num_triangles*3;j++)
4421                                         out->mesh.data_element3i[j] = loadmodel->brushq3.data_element3i[firstelement + j];
4422                                 break;
4423                         case Q3FACETYPE_PATCH:
4424                                 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4425                                 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4426                                 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4427                                 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4428                                 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4429                                 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4430                                 // convert patch to Q3FACETYPE_MESH
4431                                 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4432                                 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4433                                 // bound to user settings
4434                                 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4435                                 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4436                                 // bound to sanity settings
4437                                 xtess = bound(1, xtess, 1024);
4438                                 ytess = bound(1, ytess, 1024);
4439                                 // bound to user limit on vertices
4440                                 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4441                                 {
4442                                         if (xtess > ytess)
4443                                                 xtess--;
4444                                         else
4445                                                 ytess--;
4446                                 }
4447                                 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4448                                 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4449                                 finalvertices = finalwidth * finalheight;
4450                                 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4451                                 type = Q3FACETYPE_MESH;
4452                                 // generate geometry
4453                                 // (note: normals are skipped because they get recalculated)
4454                                 Q3PatchTesselateFloat(3, sizeof(float[3]), out->mesh.data_vertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4455                                 Q3PatchTesselateFloat(2, sizeof(float[2]), out->mesh.data_texcoordtexture2f, patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
4456                                 Q3PatchTesselateFloat(2, sizeof(float[2]), out->mesh.data_texcoordlightmap2f, patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
4457                                 Q3PatchTesselateFloat(4, sizeof(float[4]), out->mesh.data_lightmapcolor4f, patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
4458                                 Q3PatchTriangleElements(out->mesh.data_element3i, finalwidth, finalheight);
4459                                 out->mesh.num_triangles = Mod_RemoveDegenerateTriangles(out->mesh.num_triangles, out->mesh.data_element3i, out->mesh.data_element3i, out->mesh.data_vertex3f);
4460                                 if (developer.integer >= 2)
4461                                 {
4462                                         if (out->mesh.num_triangles < finaltriangles)
4463                                                 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles, %i degenerate triangles removed (leaving %i)\n", patchsize[0], patchsize[1], out->mesh.num_vertices, finaltriangles, finaltriangles - out->mesh.num_triangles, out->mesh.num_triangles);
4464                                         else
4465                                                 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles\n", patchsize[0], patchsize[1], out->mesh.num_vertices, out->mesh.num_triangles);
4466                                 }
4467                                 // q3map does not put in collision brushes for curves... ugh
4468                                 // build the lower quality collision geometry
4469                                 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4470                                 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4471                                 // bound to user settings
4472                                 xtess = bound(r_subdivisions_collision_mintess.integer, xtess, r_subdivisions_collision_maxtess.integer);
4473                                 ytess = bound(r_subdivisions_collision_mintess.integer, ytess, r_subdivisions_collision_maxtess.integer);
4474                                 // bound to sanity settings
4475                                 xtess = bound(1, xtess, 1024);
4476                                 ytess = bound(1, ytess, 1024);
4477                                 // bound to user limit on vertices
4478                                 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4479                                 {
4480                                         if (xtess > ytess)
4481                                                 xtess--;
4482                                         else
4483                                                 ytess--;
4484                                 }
4485                                 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4486                                 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4487                                 finalvertices = finalwidth * finalheight;
4488                                 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4489
4490                                 out->mesh.data_collisionvertex3f = Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4491                                 out->mesh.data_collisionelement3i = Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4492                                 out->mesh.num_collisionvertices = finalvertices;
4493                                 out->mesh.num_collisiontriangles = finaltriangles;
4494                                 Q3PatchTesselateFloat(3, sizeof(float[3]), out->mesh.data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4495                                 Q3PatchTriangleElements(out->mesh.data_collisionelement3i, finalwidth, finalheight);
4496
4497                                 //Mod_SnapVertices(3, out->mesh.num_vertices, out->mesh.data_vertex3f, 0.25);
4498                                 Mod_SnapVertices(3, out->mesh.num_collisionvertices, out->mesh.data_collisionvertex3f, 1);
4499
4500                                 oldnumtriangles = out->mesh.num_triangles;
4501                                 oldnumtriangles2 = out->mesh.num_collisiontriangles;
4502                                 out->mesh.num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->mesh.num_collisiontriangles, out->mesh.data_collisionelement3i, out->mesh.data_collisionelement3i, out->mesh.data_collisionvertex3f);
4503                                 if (developer.integer)
4504                                         Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve became %i:%i vertices / %i:%i triangles (%i:%i degenerate)\n", patchsize[0], patchsize[1], out->mesh.num_vertices, out->mesh.num_collisionvertices, oldnumtriangles, oldnumtriangles2, oldnumtriangles - out->mesh.num_triangles, oldnumtriangles2 - out->mesh.num_collisiontriangles);
4505                                 break;
4506                         default:
4507                                 break;
4508                         }
4509                         meshvertices += out->mesh.num_vertices;
4510                         meshtriangles += out->mesh.num_triangles;
4511                         for (j = 0, invalidelements = 0;j < out->mesh.num_triangles * 3;j++)
4512                                 if (out->mesh.data_element3i[j] < 0 || out->mesh.data_element3i[j] >= out->mesh.num_vertices)
4513                                         invalidelements++;
4514                         if (invalidelements)
4515                         {
4516                                 Con_Printf("Mod_Q3BSP_LoadFaces: Warning: face #%i has %i invalid elements, type = %i, texture->name = \"%s\", texture->surfaceflags = %i, texture->nativecontents = %i, firstvertex = %i, numvertices = %i, firstelement = %i, numelements = %i, elements list:\n", i, invalidelements, type, out->texture->name, out->texture->surfaceflags, out->texture->nativecontents, firstvertex, out->mesh.num_vertices, firstelement, out->mesh.num_triangles * 3);
4517                                 for (j = 0;j < out->mesh.num_triangles * 3;j++)
4518                                 {
4519                                         Con_Printf(" %i", out->mesh.data_element3i[j]);
4520                                         if (out->mesh.data_element3i[j] < 0 || out->mesh.data_element3i[j] >= out->mesh.num_vertices)
4521                                                 out->mesh.data_element3i[j] = 0;
4522                                 }
4523                                 Con_Print("\n");
4524                         }
4525                         // for shadow volumes
4526                         Mod_BuildTriangleNeighbors(out->mesh.data_neighbor3i, out->mesh.data_element3i, out->mesh.num_triangles);
4527                         // for per pixel lighting
4528                         Mod_BuildTextureVectorsAndNormals(out->mesh.num_vertices, out->mesh.num_triangles, out->mesh.data_vertex3f, out->mesh.data_texcoordtexture2f, out->mesh.data_element3i, out->mesh.data_svector3f, out->mesh.data_tvector3f, out->mesh.data_normal3f);
4529                         // calculate a bounding box
4530                         VectorClear(out->mins);
4531                         VectorClear(out->maxs);
4532                         if (out->mesh.num_vertices)
4533                         {
4534                                 VectorCopy(out->mesh.data_vertex3f, out->mins);
4535                                 VectorCopy(out->mesh.data_vertex3f, out->maxs);
4536                                 for (j = 1, v = out->mesh.data_vertex3f + 3;j < out->mesh.num_vertices;j++, v += 3)
4537                                 {
4538                                         out->mins[0] = min(out->mins[0], v[0]);
4539                                         out->maxs[0] = max(out->maxs[0], v[0]);
4540                                         out->mins[1] = min(out->mins[1], v[1]);
4541                                         out->maxs[1] = max(out->maxs[1], v[1]);
4542                                         out->mins[2] = min(out->mins[2], v[2]);
4543                                         out->maxs[2] = max(out->maxs[2], v[2]);
4544                                 }
4545                                 out->mins[0] -= 1.0f;
4546                                 out->mins[1] -= 1.0f;
4547                                 out->mins[2] -= 1.0f;
4548                                 out->maxs[0] += 1.0f;
4549                                 out->maxs[1] += 1.0f;
4550                                 out->maxs[2] += 1.0f;
4551                         }
4552                 }
4553         }
4554
4555         // now store the completed list of meshes
4556         loadmodel->nummeshes = meshnum;
4557         if (loadmodel->nummeshes)
4558         {
4559                 loadmodel->meshlist = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4560                 memcpy(loadmodel->meshlist, tempmeshlist, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4561         }
4562 }
4563
4564 static void Mod_Q3BSP_LoadModels(lump_t *l)
4565 {
4566         q3dmodel_t *in;
4567         q3mmodel_t *out;
4568         int i, j, n, c, count;
4569
4570         in = (void *)(mod_base + l->fileofs);
4571         if (l->filelen % sizeof(*in))
4572                 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4573         count = l->filelen / sizeof(*in);
4574         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4575
4576         loadmodel->brushq3.data_models = out;
4577         loadmodel->brushq3.num_models = count;
4578
4579         for (i = 0;i < count;i++, in++, out++)
4580         {
4581                 for (j = 0;j < 3;j++)
4582                 {
4583                         out->mins[j] = LittleFloat(in->mins[j]);
4584                         out->maxs[j] = LittleFloat(in->maxs[j]);
4585                 }
4586                 n = LittleLong(in->firstface);
4587                 c = LittleLong(in->numfaces);
4588                 if (n < 0 || n + c > loadmodel->brushq3.num_faces)
4589                         Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)\n", n, n + c, loadmodel->brushq3.num_faces);
4590                 out->firstface = loadmodel->brushq3.data_faces + n;
4591                 out->numfaces = c;
4592                 n = LittleLong(in->firstbrush);
4593                 c = LittleLong(in->numbrushes);
4594                 if (n < 0 || n + c > loadmodel->brushq3.num_brushes)
4595                         Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)\n", n, n + c, loadmodel->brushq3.num_brushes);
4596                 out->firstbrush = loadmodel->brushq3.data_brushes + n;
4597                 out->numbrushes = c;
4598         }
4599 }
4600
4601 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
4602 {
4603         int *in;
4604         q3mbrush_t **out;
4605         int i, n, count;
4606
4607         in = (void *)(mod_base + l->fileofs);
4608         if (l->filelen % sizeof(*in))
4609                 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4610         count = l->filelen / sizeof(*in);
4611         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4612
4613         loadmodel->brushq3.data_leafbrushes = out;
4614         loadmodel->brushq3.num_leafbrushes = count;
4615
4616         for (i = 0;i < count;i++, in++, out++)
4617         {
4618                 n = LittleLong(*in);
4619                 if (n < 0 || n >= loadmodel->brushq3.num_brushes)
4620                         Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)\n", n, loadmodel->brushq3.num_brushes);
4621                 *out = loadmodel->brushq3.data_brushes + n;
4622         }
4623 }
4624
4625 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
4626 {
4627         int *in;
4628         q3msurface_t **out;
4629         int i, n, count;
4630
4631         in = (void *)(mod_base + l->fileofs);
4632         if (l->filelen % sizeof(*in))
4633                 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4634         count = l->filelen / sizeof(*in);
4635         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4636
4637         loadmodel->brushq3.data_leaffaces = out;
4638         loadmodel->brushq3.num_leaffaces = count;
4639
4640         loadmodel->brushq3.data_leaffacenums = Mem_Alloc(loadmodel->mempool, count * sizeof(int));
4641
4642         for (i = 0;i < count;i++, in++, out++)
4643         {
4644                 n = LittleLong(*in);
4645                 if (n < 0 || n >= loadmodel->brushq3.num_faces)
4646                         Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)\n", n, loadmodel->brushq3.num_faces);
4647                 *out = loadmodel->brushq3.data_faces + n;
4648                 loadmodel->brushq3.data_leaffacenums[i] = n;
4649         }
4650 }
4651
4652 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
4653 {
4654         q3dleaf_t *in;
4655         q3mleaf_t *out;
4656         int i, j, n, c, count;
4657
4658         in = (void *)(mod_base + l->fileofs);
4659         if (l->filelen % sizeof(*in))
4660                 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4661         count = l->filelen / sizeof(*in);
4662         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4663
4664         loadmodel->brushq3.data_leafs = out;
4665         loadmodel->brushq3.num_leafs = count;
4666
4667         for (i = 0;i < count;i++, in++, out++)
4668         {
4669                 out->parent = NULL;
4670                 out->plane = NULL;
4671                 out->clusterindex = LittleLong(in->clusterindex);
4672                 out->areaindex = LittleLong(in->areaindex);
4673                 for (j = 0;j < 3;j++)
4674                 {
4675                         // yes the mins/maxs are ints
4676                         out->mins[j] = LittleLong(in->mins[j]) - 1;
4677                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4678                 }
4679                 n = LittleLong(in->firstleafface);
4680                 c = LittleLong(in->numleaffaces);
4681                 if (n < 0 || n + c > loadmodel->brushq3.num_leaffaces)
4682                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafface range %i : %i (%i leaffaces)\n", n, n + c, loadmodel->brushq3.num_leaffaces);
4683                 out->firstleafface = loadmodel->brushq3.data_leaffaces + n;
4684                 out->firstleaffacenum = loadmodel->brushq3.data_leaffacenums + n;
4685                 out->numleaffaces = c;
4686                 n = LittleLong(in->firstleafbrush);
4687                 c = LittleLong(in->numleafbrushes);
4688                 if (n < 0 || n + c > loadmodel->brushq3.num_leafbrushes)
4689                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)\n", n, n + c, loadmodel->brushq3.num_leafbrushes);
4690                 out->firstleafbrush = loadmodel->brushq3.data_leafbrushes + n;
4691                 out->numleafbrushes = c;
4692         }
4693 }
4694
4695 static void Mod_Q3BSP_LoadNodes_RecursiveSetParent(q3mnode_t *node, q3mnode_t *parent)
4696 {
4697         if (node->parent)
4698                 Host_Error("Mod_Q3BSP_LoadNodes_RecursiveSetParent: runaway recursion\n");
4699         node->parent = parent;
4700         if (node->plane)
4701         {
4702                 Mod_Q3BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
4703                 Mod_Q3BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
4704         }
4705 }
4706
4707 static void Mod_Q3BSP_LoadNodes(lump_t *l)
4708 {
4709         q3dnode_t *in;
4710         q3mnode_t *out;
4711         int i, j, n, count;
4712
4713         in = (void *)(mod_base + l->fileofs);
4714         if (l->filelen % sizeof(*in))
4715                 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4716         count = l->filelen / sizeof(*in);
4717         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4718
4719         loadmodel->brushq3.data_nodes = out;
4720         loadmodel->brushq3.num_nodes = count;
4721
4722         for (i = 0;i < count;i++, in++, out++)
4723         {
4724                 out->parent = NULL;
4725                 n = LittleLong(in->planeindex);
4726                 if (n < 0 || n >= loadmodel->brushq3.num_planes)
4727                         Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)\n", n, loadmodel->brushq3.num_planes);
4728                 out->plane = loadmodel->brushq3.data_planes + n;
4729                 for (j = 0;j < 2;j++)
4730                 {
4731                         n = LittleLong(in->childrenindex[j]);
4732                         if (n >= 0)
4733                         {
4734                                 if (n >= loadmodel->brushq3.num_nodes)
4735                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)\n", n, loadmodel->brushq3.num_nodes);
4736                                 out->children[j] = loadmodel->brushq3.data_nodes + n;
4737                         }
4738                         else
4739                         {
4740                                 n = -1 - n;
4741                                 if (n >= loadmodel->brushq3.num_leafs)
4742                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)\n", n, loadmodel->brushq3.num_leafs);
4743                                 out->children[j] = (q3mnode_t *)(loadmodel->brushq3.data_leafs + n);
4744                         }
4745                 }
4746                 for (j = 0;j < 3;j++)
4747                 {
4748                         // yes the mins/maxs are ints
4749                         out->mins[j] = LittleLong(in->mins[j]) - 1;
4750                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4751                 }
4752         }
4753
4754         // set the parent pointers
4755         Mod_Q3BSP_LoadNodes_RecursiveSetParent(loadmodel->brushq3.data_nodes, NULL);
4756 }
4757
4758 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
4759 {
4760         q3dlightgrid_t *in;
4761         q3dlightgrid_t *out;
4762         int count;
4763
4764         in = (void *)(mod_base + l->fileofs);
4765         if (l->filelen % sizeof(*in))
4766                 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
4767         loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
4768         loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
4769         loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
4770         loadmodel->brushq3.num_lightgrid_imins[0] = ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4771         loadmodel->brushq3.num_lightgrid_imins[1] = ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4772         loadmodel->brushq3.num_lightgrid_imins[2] = ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4773         loadmodel->brushq3.num_lightgrid_imaxs[0] = floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4774         loadmodel->brushq3.num_lightgrid_imaxs[1] = floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4775         loadmodel->brushq3.num_lightgrid_imaxs[2] = floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4776         loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
4777         loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
4778         loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
4779         count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
4780         if (l->filelen)
4781         {
4782                 if (l->filelen < count * (int)sizeof(*in))
4783                         Host_Error("Mod_Q3BSP_LoadLightGrid: invalid lightgrid lump size %i bytes, should be %i bytes (%ix%ix%i)\n", l->filelen, count * sizeof(*in), loadmodel->brushq3.num_lightgrid_dimensions[0], loadmodel->brushq3.num_lightgrid_dimensions[1], loadmodel->brushq3.num_lightgrid_dimensions[2]);
4784                 if (l->filelen != count * (int)sizeof(*in))
4785                         Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", count * sizeof(*in), l->filelen);
4786         }
4787
4788         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4789         loadmodel->brushq3.data_lightgrid = out;
4790         loadmodel->brushq3.num_lightgrid = count;
4791
4792         // no swapping or validation necessary
4793         if (l->filelen)
4794                 memcpy(out, in, count * (int)sizeof(*out));
4795         else
4796         {
4797                 // no data, fill with white
4798                 int i;
4799                 for (i = 0;i < count;i++)
4800                 {
4801                         out[i].ambientrgb[0] = 128;
4802                         out[i].ambientrgb[1] = 128;
4803                         out[i].ambientrgb[2] = 128;
4804                         out[i].diffusergb[0] = 0;
4805                         out[i].diffusergb[1] = 0;
4806                         out[i].diffusergb[2] = 0;
4807                         out[i].diffusepitch = 0;
4808                         out[i].diffuseyaw = 0;
4809                 }
4810         }
4811
4812         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]);
4813         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]);
4814 }
4815
4816 static void Mod_Q3BSP_LoadPVS(lump_t *l)
4817 {
4818         q3dpvs_t *in;
4819         int totalchains;
4820
4821         if (l->filelen == 0)
4822         {
4823                 int i;
4824                 // unvised maps often have cluster indices even without pvs, so check
4825                 // leafs to find real number of clusters
4826                 loadmodel->brush.num_pvsclusters = 1;
4827                 for (i = 0;i < loadmodel->brushq3.num_leafs;i++)
4828                         loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brushq3.data_leafs[i].clusterindex + 1);
4829
4830                 // create clusters
4831                 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
4832                 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4833                 loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, totalchains);
4834                 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
4835                 return;
4836         }
4837
4838         in = (void *)(mod_base + l->fileofs);
4839         if (l->filelen < 9)
4840                 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
4841
4842         loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
4843         loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
4844         if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
4845                 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8\n", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
4846         totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4847         if (l->filelen < totalchains + (int)sizeof(*in))
4848                 Host_Error("Mod_Q3BSP_LoadPVS: lump too small ((numclusters = %i) * (chainlength = %i) + sizeof(q3dpvs_t) == %i bytes, lump is %i bytes)\n", loadmodel->brush.num_pvsclusters, loadmodel->brush.num_pvsclusterbytes, totalchains + sizeof(*in), l->filelen);
4849
4850         loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, totalchains);
4851         memcpy(loadmodel->brush.data_pvsclusters, (qbyte *)(in + 1), totalchains);
4852 }
4853
4854 static void Mod_Q3BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, vec_t radius)
4855 {
4856         // FIXME: finish this code
4857         VectorCopy(in, out);
4858 }
4859
4860 static void Mod_Q3BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
4861 {
4862         int i, j, k, index[3];
4863         float transformed[3], blend1, blend2, blend, yaw, pitch, sinpitch;
4864         q3dlightgrid_t *a, *s;
4865         // FIXME: write this
4866         if (!model->brushq3.num_lightgrid)
4867         {
4868                 ambientcolor[0] = 1;
4869                 ambientcolor[1] = 1;
4870                 ambientcolor[2] = 1;
4871                 return;
4872         }
4873         Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
4874         //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
4875         //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
4876         transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
4877         transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
4878         transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
4879         index[0] = (int)floor(transformed[0]);
4880         index[1] = (int)floor(transformed[1]);
4881         index[2] = (int)floor(transformed[2]);
4882         //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
4883         // now lerp the values
4884         VectorClear(diffusenormal);
4885         a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
4886         for (k = 0;k < 2;k++)
4887         {
4888                 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
4889                 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
4890                         continue;
4891                 for (j = 0;j < 2;j++)
4892                 {
4893                         blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
4894                         if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
4895                                 continue;
4896                         for (i = 0;i < 2;i++)
4897                         {
4898                                 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0])));
4899                                 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
4900                                         continue;
4901                                 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
4902                                 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
4903                                 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
4904                                 pitch = s->diffusepitch * M_PI / 128;
4905                                 yaw = s->diffuseyaw * M_PI / 128;
4906                                 sinpitch = sin(pitch);
4907                                 diffusenormal[0] += blend * (cos(yaw) * sinpitch);
4908                                 diffusenormal[1] += blend * (sin(yaw) * sinpitch);
4909                                 diffusenormal[2] += blend * (cos(pitch));
4910                                 //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)));
4911                         }
4912                 }
4913         }
4914         VectorNormalize(diffusenormal);
4915         //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]);
4916 }
4917
4918 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, q3mnode_t *node, const vec3_t point, int markframe)
4919 {
4920         int i;
4921         q3mleaf_t *leaf;
4922         colbrushf_t *brush;
4923         // find which leaf the point is in
4924         while (node->plane)
4925                 node = node->children[DotProduct(point, node->plane->normal) < node->plane->dist];
4926         // point trace the brushes
4927         leaf = (q3mleaf_t *)node;
4928         for (i = 0;i < leaf->numleafbrushes;i++)
4929         {
4930                 brush = leaf->firstleafbrush[i]->colbrushf;
4931                 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
4932                 {
4933                         brush->markframe = markframe;
4934                         Collision_TracePointBrushFloat(trace, point, leaf->firstleafbrush[i]->colbrushf);
4935                 }
4936         }
4937         // can't do point traces on curves (they have no thickness)
4938 }
4939
4940 static void Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace_t *trace, q3mnode_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)
4941 {
4942         int i, startside, endside;
4943         float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
4944         q3mleaf_t *leaf;
4945         q3msurface_t *face;
4946         colbrushf_t *brush;
4947         if (startfrac > trace->realfraction)
4948                 return;
4949         // note: all line fragments past first impact fraction are ignored
4950         if (VectorCompare(start, end))
4951         {
4952                 // find which leaf the point is in
4953                 while (node->plane)
4954                         node = node->children[DotProduct(start, node->plane->normal) < node->plane->dist];
4955         }
4956         else
4957         {
4958                 // find which nodes the line is in and recurse for them
4959                 while (node->plane)
4960                 {
4961                         // recurse down node sides
4962                         dist1 = PlaneDiff(start, node->plane);
4963                         dist2 = PlaneDiff(end, node->plane);
4964                         startside = dist1 < 0;
4965                         endside = dist2 < 0;
4966                         if (startside == endside)
4967                         {
4968                                 // most of the time the line fragment is on one side of the plane
4969                                 node = node->children[startside];
4970                         }
4971                         else
4972                         {
4973                                 // line crosses node plane, split the line
4974                                 midfrac = dist1 / (dist1 - dist2);
4975                                 VectorLerp(start, midfrac, end, mid);
4976                                 // take the near side first
4977                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
4978                                 if (midfrac <= trace->realfraction)
4979                                         Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
4980                                 return;
4981                         }
4982                 }
4983         }
4984         // hit a leaf
4985         nodesegmentmins[0] = min(start[0], end[0]);
4986         nodesegmentmins[1] = min(start[1], end[1]);
4987         nodesegmentmins[2] = min(start[2], end[2]);
4988         nodesegmentmaxs[0] = max(start[0], end[0]);
4989         nodesegmentmaxs[1] = max(start[1], end[1]);
4990         nodesegmentmaxs[2] = max(start[2], end[2]);
4991         // line trace the brushes
4992         leaf = (q3mleaf_t *)node;
4993         for (i = 0;i < leaf->numleafbrushes;i++)
4994         {
4995                 brush = leaf->firstleafbrush[i]->colbrushf;
4996                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
4997                 {
4998                         brush->markframe = markframe;
4999                         Collision_TraceLineBrushFloat(trace, linestart, lineend, leaf->firstleafbrush[i]->colbrushf, leaf->firstleafbrush[i]->colbrushf);
5000                         if (startfrac > trace->realfraction)
5001                                 return;
5002                 }
5003         }
5004         // can't do point traces on curves (they have no thickness)
5005         if (mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5006         {
5007                 // line trace the curves
5008                 for (i = 0;i < leaf->numleaffaces;i++)
5009                 {
5010                         face = leaf->firstleafface[i];
5011                         if (face->mesh.num_collisiontriangles && face->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, face->mins, face->maxs))
5012                         {
5013                                 face->collisionmarkframe = markframe;
5014                                 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, face->mesh.num_collisiontriangles, face->mesh.data_collisionelement3i, face->mesh.data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
5015                                 if (startfrac > trace->realfraction)
5016                                         return;
5017                         }
5018                 }
5019         }
5020 }
5021
5022 static void Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace_t *trace, q3mnode_t *node, const colbrushf_t *thisbrush_start, const colbrushf_t *thisbrush_end, int markframe, const vec3_t segmentmins, const vec3_t segmentmaxs)
5023 {
5024         int i;
5025         //int sides;
5026         float nodesegmentmins[3], nodesegmentmaxs[3];
5027         q3mleaf_t *leaf;
5028         colbrushf_t *brush;
5029         q3msurface_t *face;
5030         /*
5031                 // find which nodes the line is in and recurse for them
5032                 while (node->plane)
5033                 {
5034                         // recurse down node sides
5035                         int startside, endside;
5036                         float dist1near, dist1far, dist2near, dist2far;
5037                         BoxPlaneCornerDistances(thisbrush_start->mins, thisbrush_start->maxs, node->plane, &dist1near, &dist1far);
5038                         BoxPlaneCornerDistances(thisbrush_end->mins, thisbrush_end->maxs, node->plane, &dist2near, &dist2far);
5039                         startside = dist1near < 0;
5040                         startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
5041                         endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
5042                         if (startside == 2 || endside == 2)
5043                         {
5044                                 // brushes cross plane
5045                                 // do not clip anything, just take both sides
5046                                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5047                                 node = node->children[1];
5048                                 continue;
5049                         }
5050                         if (startside == 0)
5051                         {
5052                                 if (endside == 0)
5053                                 {
5054                                         node = node->children[0];
5055                                         continue;
5056                                 }
5057                                 else
5058                                 {
5059                                         //midf0 = dist1near / (dist1near - dist2near);
5060                                         //midf1 = dist1far / (dist1far - dist2far);
5061                                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5062                                         node = node->children[1];
5063                                         continue;
5064                                 }
5065                         }
5066                         else
5067                         {
5068                                 if (endside == 0)
5069                                 {
5070                                         //midf0 = dist1near / (dist1near - dist2near);
5071                                         //midf1 = dist1far / (dist1far - dist2far);
5072                                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5073                                         node = node->children[1];
5074                                         continue;
5075                                 }
5076                                 else
5077                                 {
5078                                         node = node->children[1];
5079                                         continue;
5080                                 }
5081                         }
5082
5083                         if (dist1near <  0 && dist2near <  0 && dist1far <  0 && dist2far <  0){node = node->children[1];continue;}
5084                         if (dist1near <  0 && dist2near <  0 && dist1far <  0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5085                         if (dist1near <  0 && dist2near <  0 && dist1far >= 0 && dist2far <  0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5086                         if (dist1near <  0 && dist2near <  0 && dist1far >= 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5087                         if (dist1near <  0 && dist2near >= 0 && dist1far <  0 && dist2far <  0){node = node->children[1];continue;}
5088                         if (dist1near <  0 && dist2near >= 0 && dist1far <  0 && dist2far >= 0){}
5089                         if (dist1near <  0 && dist2near >= 0 && dist1far >= 0 && dist2far <  0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5090                         if (dist1near <  0 && dist2near >= 0 && dist1far >= 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5091                         if (dist1near >= 0 && dist2near <  0 && dist1far <  0 && dist2far <  0){node = node->children[1];continue;}
5092                         if (dist1near >= 0 && dist2near <  0 && dist1far <  0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5093                         if (dist1near >= 0 && dist2near <  0 && dist1far >= 0 && dist2far <  0){}
5094                         if (dist1near >= 0 && dist2near <  0 && dist1far >= 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5095                         if (dist1near >= 0 && dist2near >= 0 && dist1far <  0 && dist2far <  0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5096                         if (dist1near >= 0 && dist2near >= 0 && dist1far <  0 && dist2far >= 0){node = node->children[0];continue;}
5097                         if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far <  0){node = node->children[0];continue;}
5098                         if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far >= 0){node = node->children[0];continue;}
5099                         {
5100                                 if (dist2near < 0) // d1n<0 && d2n<0
5101                                 {
5102                                         if (dist2near < 0) // d1n<0 && d2n<0
5103                                         {
5104                                                 if (dist2near < 0) // d1n<0 && d2n<0
5105                                                 {
5106                                                 }
5107                                                 else // d1n<0 && d2n>0
5108                                                 {
5109                                                 }
5110                                         }
5111                                         else // d1n<0 && d2n>0
5112                                         {
5113                                                 if (dist2near < 0) // d1n<0 && d2n<0
5114                                                 {
5115                                                 }
5116                                                 else // d1n<0 && d2n>0
5117                                                 {
5118                                                 }
5119                                         }
5120                                 }
5121                                 else // d1n<0 && d2n>0
5122                                 {
5123                                 }
5124                         }
5125                         else // d1n>0
5126                         {
5127                                 if (dist2near < 0) // d1n>0 && d2n<0
5128                                 {
5129                                 }
5130                                 else // d1n>0 && d2n>0
5131                                 {
5132                                 }
5133                         }
5134                         if (dist1near < 0 == dist1far < 0 == dist2near < 0 == dist2far < 0)
5135                         {
5136                                 node = node->children[startside];
5137                                 continue;
5138                         }
5139                         if (dist1near < dist2near)
5140                         {
5141                                 // out
5142                                 if (dist1near >= 0)
5143                                 {
5144                                         node = node->children[0];
5145                                         continue;
5146                                 }
5147                                 if (dist2far < 0)
5148                                 {
5149                                         node = node->children[1];
5150                                         continue;
5151                                 }
5152                                 // dist1near < 0 && dist2far >= 0
5153                         }
5154                         else
5155                         {
5156                                 // in
5157                         }
5158                         startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
5159                         endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
5160                         if (startside == 2 || endside == 2)
5161                         {
5162                                 // brushes cross plane
5163                                 // do not clip anything, just take both sides
5164                                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5165                                 node = node->children[1];
5166                         }
5167                         else if (startside == endside)
5168                                 node = node->children[startside];
5169                         else if (startside == 0) // endside = 1 (start infront, end behind)
5170                         {
5171                         }
5172                         else // startside == 1 endside = 0 (start behind, end infront)
5173                         {
5174                         }
5175                         == endside)
5176                         {
5177                                 if (startside < 2)
5178                                         node = node->children[startside];
5179                                 else
5180                                 {
5181                                         // start and end brush cross plane
5182                                 }
5183                         }
5184                         else
5185                         {
5186                         }
5187                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5188                                 node = node->children[1];
5189                         else if (dist1near < 0 && dist1far < 0 && dist2near >= 0 && dist2far >= 0)
5190                         else if (dist1near >= 0 && dist1far >= 0 && dist2near < 0 && dist2far < 0)
5191                         else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5192                                 node = node->children[0];
5193                         else
5194                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5195                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5196                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5197                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5198                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5199                         {
5200                         }
5201                         else if (dist1near >= 0 && dist1far >= 0)
5202                         {
5203                         }
5204                         else // mixed (lying on plane)
5205                         {
5206                         }
5207                         {
5208                                 if (dist2near < 0 && dist2far < 0)
5209                                 {
5210                                 }
5211                                 else
5212                                         node = node->children[1];
5213                         }
5214                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5215                                 node = node->children[0];
5216                         else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5217                                 node = node->children[1];
5218                         else
5219                         {
5220                                 // both sides
5221                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5222                                 node = node->children[1];
5223                         }
5224                         sides = dist1near || dist1near < 0 | dist1far < 0 | dist2near < 0 | dist
5225                         startside = dist1 < 0;
5226                         endside = dist2 < 0;
5227                         if (startside == endside)
5228                         {
5229                                 // most of the time the line fragment is on one side of the plane
5230                                 node = node->children[startside];
5231                         }
5232                         else
5233                         {
5234                                 // line crosses node plane, split the line
5235                                 midfrac = dist1 / (dist1 - dist2);
5236                                 VectorLerp(start, midfrac, end, mid);
5237                                 // take the near side first
5238                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5239                                 if (midfrac <= trace->fraction)
5240                                         Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5241                                 return;
5242                         }
5243                 }
5244         */
5245 #if 1
5246         for (;;)
5247         {
5248                 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5249                 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5250                 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5251                 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5252                 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5253                 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5254                 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5255                         return;
5256                 if (!node->plane)
5257                         break;
5258                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5259                 node = node->children[1];
5260         }
5261 #elif 0
5262         // FIXME: could be made faster by copying TraceLine code and making it use
5263         // box plane distances...  (variant on the BoxOnPlaneSide code)
5264         for (;;)
5265         {
5266                 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5267                 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5268                 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5269                 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5270                 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5271                 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5272                 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5273                         return;
5274                 if (!node->plane)
5275                         break;
5276                 if (mod_q3bsp_debugtracebrush.integer == 2)
5277                 {
5278                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5279                         node = node->children[1];
5280                         continue;
5281                 }
5282                 else if (mod_q3bsp_debugtracebrush.integer == 1)
5283                 {
5284                         // recurse down node sides
5285                         sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5286                         if (sides == 3)
5287                         {
5288                                 // segment box crosses plane
5289                                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5290                                 node = node->children[1];
5291                                 continue;
5292                         }
5293                         // take whichever side the segment box is on
5294                         node = node->children[sides - 1];
5295                         continue;
5296                 }
5297                 else
5298                 {
5299                         // recurse down node sides
5300                         sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5301                         if (sides == 3)
5302                         {
5303                                 // segment box crosses plane
5304                                 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5305                                 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5306                                 if (sides == 3)
5307                                 {
5308                                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5309                                         node = node->children[1];
5310                                         continue;
5311                                 }
5312                         }
5313                         // take whichever side the segment box is on
5314                         node = node->children[sides - 1];
5315                         continue;
5316                 }
5317                 return;
5318         }
5319 #else
5320         // FIXME: could be made faster by copying TraceLine code and making it use
5321         // box plane distances...  (variant on the BoxOnPlaneSide code)
5322         for (;;)
5323         {
5324                 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5325                 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5326                 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5327                 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5328                 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5329                 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5330                 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5331                         return;
5332                 if (!node->plane)
5333                         break;
5334                 if (mod_q3bsp_debugtracebrush.integer == 2)
5335                 {
5336                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5337                         node = node->children[1];
5338                 }
5339                 else if (mod_q3bsp_debugtracebrush.integer == 1)
5340                 {
5341                         // recurse down node sides
5342                         sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5343                         if (sides == 3)
5344                         {
5345                                 // segment box crosses plane
5346                                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5347                                 node = node->children[1];
5348                         }
5349                         else
5350                         {
5351                                 // take whichever side the segment box is on
5352                                 node = node->children[sides - 1];
5353                         }
5354                 }
5355                 else
5356                 {
5357                         // recurse down node sides
5358                         sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5359                         if (sides == 3)
5360                         {
5361                                 // segment box crosses plane
5362                                 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5363                                 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5364                                 if (sides == 3)
5365                                 {
5366                                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5367                                         sides = 2;
5368                                 }
5369                         }
5370                         // take whichever side the segment box is on
5371                         node = node->children[sides - 1];
5372                 }
5373         }
5374 #endif
5375         // hit a leaf
5376         leaf = (q3mleaf_t *)node;
5377         for (i = 0;i < leaf->numleafbrushes;i++)
5378         {
5379                 brush = leaf->firstleafbrush[i]->colbrushf;
5380                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5381                 {
5382                         brush->markframe = markframe;
5383                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, leaf->firstleafbrush[i]->colbrushf, leaf->firstleafbrush[i]->colbrushf);
5384                 }
5385         }
5386         if (mod_q3bsp_curves_collisions.integer)
5387         {
5388                 for (i = 0;i < leaf->numleaffaces;i++)
5389                 {
5390                         face = leaf->firstleafface[i];
5391                         if (face->mesh.num_collisiontriangles && face->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, face->mins, face->maxs))
5392                         {
5393                                 face->collisionmarkframe = markframe;
5394                                 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, face->mesh.num_collisiontriangles, face->mesh.data_collisionelement3i, face->mesh.data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
5395                         }
5396                 }
5397         }
5398 }
5399
5400 static void Mod_Q3BSP_TraceBox(model_t *model, int frame, trace_t *trace, const vec3_t boxstartmins, const vec3_t boxstartmaxs, const vec3_t boxendmins, const vec3_t boxendmaxs, int hitsupercontentsmask)
5401 {
5402         int i;
5403         float segmentmins[3], segmentmaxs[3];
5404         colbrushf_t *thisbrush_start, *thisbrush_end;
5405         matrix4x4_t startmatrix, endmatrix;
5406         static int markframe = 0;
5407         q3msurface_t *face;
5408         memset(trace, 0, sizeof(*trace));
5409         trace->fraction = 1;
5410         trace->realfraction = 1;
5411         trace->hitsupercontentsmask = hitsupercontentsmask;
5412         Matrix4x4_CreateIdentity(&startmatrix);
5413         Matrix4x4_CreateIdentity(&endmatrix);
5414         segmentmins[0] = min(boxstartmins[0], boxendmins[0]);
5415         segmentmins[1] = min(boxstartmins[1], boxendmins[1]);
5416         segmentmins[2] = min(boxstartmins[2], boxendmins[2]);
5417         segmentmaxs[0] = max(boxstartmaxs[0], boxendmaxs[0]);
5418         segmentmaxs[1] = max(boxstartmaxs[1], boxendmaxs[1]);
5419         segmentmaxs[2] = max(boxstartmaxs[2], boxendmaxs[2]);
5420         if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxstartmins, boxstartmaxs) && VectorCompare(boxendmins, boxendmaxs))
5421         {
5422                 if (VectorCompare(boxstartmins, boxendmins))
5423                 {
5424                         // point trace
5425                         if (model->brushq3.submodel)
5426                         {
5427                                 for (i = 0;i < model->brushq3.data_thismodel->numbrushes;i++)
5428                                         if (model->brushq3.data_thismodel->firstbrush[i].colbrushf)
5429                                                 Collision_TracePointBrushFloat(trace, boxstartmins, model->brushq3.data_thismodel->firstbrush[i].colbrushf);
5430                         }
5431                         else
5432                                 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model->brushq3.data_nodes, boxstartmins, ++markframe);
5433                 }
5434                 else
5435                 {
5436                         // line trace
5437                         if (model->brushq3.submodel)
5438                         {
5439                                 for (i = 0;i < model->brushq3.data_thismodel->numbrushes;i++)
5440                                         if (model->brushq3.data_thismodel->firstbrush[i].colbrushf)
5441                                                 Collision_TraceLineBrushFloat(trace, boxstartmins, boxendmins, model->brushq3.data_thismodel->firstbrush[i].colbrushf, model->brushq3.data_thismodel->firstbrush[i].colbrushf);
5442                                 if (mod_q3bsp_curves_collisions.integer)
5443                                 {
5444                                         for (i = 0;i < model->brushq3.data_thismodel->numfaces;i++)
5445                                         {
5446                                                 face = model->brushq3.data_thismodel->firstface + i;
5447                                                 if (face->mesh.num_collisiontriangles)
5448                                                         Collision_TraceLineTriangleMeshFloat(trace, boxstartmins, boxendmins, face->mesh.num_collisiontriangles, face->mesh.data_collisionelement3i, face->mesh.data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
5449                                         }
5450                                 }
5451                         }
5452                         else
5453                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model->brushq3.data_nodes, boxstartmins, boxendmins, 0, 1, boxstartmins, boxendmins, ++markframe, segmentmins, segmentmaxs);
5454                 }
5455         }
5456         else
5457         {
5458                 // box trace, performed as brush trace
5459                 thisbrush_start = Collision_BrushForBox(&startmatrix, boxstartmins, boxstartmaxs);
5460                 thisbrush_end = Collision_BrushForBox(&endmatrix, boxendmins, boxendmaxs);
5461                 if (model->brushq3.submodel)
5462                 {
5463                         for (i = 0;i < model->brushq3.data_thismodel->numbrushes;i++)
5464                                 if (model->brushq3.data_thismodel->firstbrush[i].colbrushf)
5465                                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, model->brushq3.data_thismodel->firstbrush[i].colbrushf, model->brushq3.data_thismodel->firstbrush[i].colbrushf);
5466                         if (mod_q3bsp_curves_collisions.integer)
5467                         {
5468                                 for (i = 0;i < model->brushq3.data_thismodel->numfaces;i++)
5469                                 {
5470                                         face = model->brushq3.data_thismodel->firstface + i;
5471                                         if (face->mesh.num_collisiontriangles)
5472                                                 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, face->mesh.num_collisiontriangles, face->mesh.data_collisionelement3i, face->mesh.data_collisionvertex3f, face->texture->supercontents, segmentmins, segmentmaxs);
5473                                 }
5474                         }
5475                 }
5476                 else
5477                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model->brushq3.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5478         }
5479 }
5480
5481 static int Mod_Q3BSP_BoxTouchingPVS(model_t *model, const qbyte *pvs, const vec3_t mins, const vec3_t maxs)
5482 {
5483         int clusterindex, side, nodestackindex = 0;
5484         q3mnode_t *node, *nodestack[1024];
5485         node = model->brushq3.data_nodes;
5486         if (!model->brush.num_pvsclusters)
5487                 return true;
5488         for (;;)
5489         {
5490                 if (node->plane)
5491                 {
5492                         // node - recurse down the BSP tree
5493                         side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
5494                         if (side < 2)
5495                         {
5496                                 // box is on one side of plane, take that path
5497                                 node = node->children[side];
5498                         }
5499                         else
5500                         {
5501                                 // box crosses plane, take one path and remember the other
5502                                 if (nodestackindex < 1024)
5503                                         nodestack[nodestackindex++] = node->children[0];
5504                                 node = node->children[1];
5505                         }
5506                 }
5507                 else
5508                 {
5509                         // leaf - check cluster bit
5510                         clusterindex = ((q3mleaf_t *)node)->clusterindex;
5511 #if 0
5512                         if (clusterindex >= model->brush.num_pvsclusters)
5513                         {
5514                                 Con_Printf("%i >= %i\n", clusterindex, model->brush.num_pvsclusters);
5515                                 return true;
5516                         }
5517 #endif
5518                         if (CHECKPVSBIT(pvs, clusterindex))
5519                         {
5520                                 // it is visible, return immediately with the news
5521                                 return true;
5522                         }
5523                         else
5524                         {
5525                                 // nothing to see here, try another path we didn't take earlier
5526                                 if (nodestackindex == 0)
5527                                         break;
5528                                 node = nodestack[--nodestackindex];
5529                         }
5530                 }
5531         }
5532         // it is not visible
5533         return false;
5534 }
5535
5536 //Returns PVS data for a given point
5537 //(note: can return NULL)
5538 static qbyte *Mod_Q3BSP_GetPVS(model_t *model, const vec3_t p)
5539 {
5540         q3mnode_t *node;
5541         Mod_CheckLoaded(model);
5542         node = model->brushq3.data_nodes;
5543         while (node->plane)
5544                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
5545         if (((q3mleaf_t *)node)->clusterindex >= 0)
5546                 return model->brush.data_pvsclusters + ((q3mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
5547         else
5548                 return NULL;
5549 }
5550
5551 static void Mod_Q3BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbytes, q3mnode_t *node)
5552 {
5553         while (node->plane)
5554         {
5555                 float d = PlaneDiff(org, node->plane);
5556                 if (d > radius)
5557                         node = node->children[0];
5558                 else if (d < -radius)
5559                         node = node->children[1];
5560                 else
5561                 {
5562                         // go down both sides
5563                         Mod_Q3BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
5564                         node = node->children[1];
5565                 }
5566         }
5567         // if this leaf is in a cluster, accumulate the pvs bits
5568         if (((q3mleaf_t *)node)->clusterindex >= 0)
5569         {
5570                 int i;
5571                 qbyte *pvs = model->brush.data_pvsclusters + ((q3mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
5572                 for (i = 0;i < pvsbytes;i++)
5573                         pvsbuffer[i] |= pvs[i];
5574         }
5575 }
5576
5577 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
5578 //of the given point.
5579 static int Mod_Q3BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbufferlength)
5580 {
5581         int bytes = model->brush.num_pvsclusterbytes;
5582         bytes = min(bytes, pvsbufferlength);
5583         if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q3BSP_GetPVS(model, org))
5584         {
5585                 memset(pvsbuffer, 0xFF, bytes);
5586                 return bytes;
5587         }
5588         memset(pvsbuffer, 0, bytes);
5589         Mod_Q3BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brushq3.data_nodes);
5590         return bytes;
5591 }
5592
5593
5594 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
5595 {
5596         int supercontents = 0;
5597         if (nativecontents & Q2CONTENTS_SOLID)
5598                 supercontents |= SUPERCONTENTS_SOLID;
5599         if (nativecontents & Q2CONTENTS_WATER)
5600                 supercontents |= SUPERCONTENTS_WATER;
5601         if (nativecontents & Q2CONTENTS_SLIME)
5602                 supercontents |= SUPERCONTENTS_SLIME;
5603         if (nativecontents & Q2CONTENTS_LAVA)
5604                 supercontents |= SUPERCONTENTS_LAVA;
5605         return supercontents;
5606 }
5607
5608 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
5609 {
5610         int nativecontents = 0;
5611         if (supercontents & SUPERCONTENTS_SOLID)
5612                 nativecontents |= Q2CONTENTS_SOLID;
5613         if (supercontents & SUPERCONTENTS_WATER)
5614                 nativecontents |= Q2CONTENTS_WATER;
5615         if (supercontents & SUPERCONTENTS_SLIME)
5616                 nativecontents |= Q2CONTENTS_SLIME;
5617         if (supercontents & SUPERCONTENTS_LAVA)
5618                 nativecontents |= Q2CONTENTS_LAVA;
5619         return nativecontents;
5620 }
5621
5622 /*
5623 void Mod_Q3BSP_RecursiveGetVisible(q3mnode_t *node, model_t *model, const vec3_t point, const vec3_t mins, const vec3_t maxs, int maxleafs, q3mleaf_t *leaflist, int *numleafs, int maxsurfaces, q3msurface_t *surfacelist, int *numsurfaces, const qbyte *pvs)
5624 {
5625         mleaf_t *leaf;
5626         for (;;)
5627         {
5628                 if (!BoxesOverlap(node->mins, node->maxs, mins, maxs))
5629                         return;
5630                 if (!node->plane)
5631                         break;
5632                 Mod_Q3BSP_RecursiveGetVisible(node->children[0], model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces, pvs);
5633                 node = node->children[1];
5634         }
5635         leaf = (mleaf_t *)node;
5636         if ((pvs == NULL || CHECKPVSBIT(pvs, leaf->clusterindex)))
5637         {
5638                 int marksurfacenum;
5639                 q3msurface_t *surf;
5640                 if (maxleafs && *numleafs < maxleafs)
5641                         leaflist[(*numleaf)++] = leaf;
5642                 if (maxsurfaces)
5643                 {
5644                         for (marksurfacenum = 0;marksurfacenum < leaf->nummarksurfaces;marksurfacenum++)
5645                         {
5646                                 face = leaf->firstleafface[marksurfacenum];
5647                                 if (face->shadowmark != shadowmarkcount)
5648                                 {
5649                                         face->shadowmark = shadowmarkcount;
5650                                         if (BoxesOverlap(mins, maxs, face->mins, face->maxs) && *numsurfaces < maxsurfaces)
5651                                                 surfacelist[(*numsurfaces)++] = face;
5652                                 }
5653                         }
5654                 }
5655         }
5656 }
5657
5658 void Mod_Q3BSP_GetVisible(model_t *model, const vec3_t point, const vec3_t mins, const vec3_t maxs, int maxleafs, q3mleaf_t *leaflist, int *numleafs, int maxsurfaces, q3msurface_t *surfacelist, int *numsurfaces)
5659 {
5660         // FIXME: support portals
5661         if (maxsurfaces)
5662                 *numsurfaces = 0;
5663         if (maxleafs)
5664                 *numleafs = 0;
5665         if (model->submodel)
5666         {
5667                 if (maxsurfaces)
5668                 {
5669                         for (marksurfacenum = 0;marksurfacenum < leaf->nummarksurfaces;marksurfacenum++)
5670                         {
5671                                 face = ent->model->brushq3.surfaces + leaf->firstmarksurface[marksurfacenum];
5672                                 if (BoxesOverlap(mins, maxs, face->mins, face->maxs) && *numsurfaces < maxsurfaces)
5673                                         surfacelist[(*numsurfaces)++] = face;
5674                         }
5675                 }
5676         }
5677         else
5678         {
5679                 pvs = ent->model->brush.GetPVS(ent->model, relativelightorigin);
5680                 Mod_Q3BSP_RecursiveGetVisible(ent->model->brushq3.data_nodes, model, point, mins, maxs, maxleafs, leaflist, numleafs, maxsurfaces, surfacelist, numsurfaces, pvs);
5681         }
5682 }
5683 */
5684
5685 void Mod_Q3BSP_BuildTextureFaceLists(void)
5686 {
5687         int i, j;
5688         loadmodel->brushq3.data_texturefaces = Mem_Alloc(loadmodel->mempool, loadmodel->nummodelsurfaces * sizeof(q3msurface_t *));
5689         loadmodel->brushq3.data_texturefacenums = Mem_Alloc(loadmodel->mempool, loadmodel->nummodelsurfaces * sizeof(int));
5690         for (i = 0;i < loadmodel->brushq3.num_textures;i++)
5691                 loadmodel->brushq3.data_textures[i].numfaces = 0;
5692         for (i = 0;i < loadmodel->nummodelsurfaces;i++)
5693                 loadmodel->brushq3.data_faces[loadmodel->surfacelist[i]].texture->numfaces++;
5694         j = 0;
5695         for (i = 0;i < loadmodel->brushq3.num_textures;i++)
5696         {
5697                 loadmodel->brushq3.data_textures[i].facelist = loadmodel->brushq3.data_texturefaces + j;
5698                 loadmodel->brushq3.data_textures[i].facenumlist = loadmodel->brushq3.data_texturefacenums + j;
5699                 j += loadmodel->brushq3.data_textures[i].numfaces;
5700                 loadmodel->brushq3.data_textures[i].numfaces = 0;
5701         }
5702         for (i = 0;i < loadmodel->nummodelsurfaces;i++)
5703         {
5704                 loadmodel->brushq3.data_faces[loadmodel->surfacelist[i]].texture->facenumlist[loadmodel->brushq3.data_faces[loadmodel->surfacelist[i]].texture->numfaces] = loadmodel->surfacelist[i];
5705                 loadmodel->brushq3.data_faces[loadmodel->surfacelist[i]].texture->facelist[loadmodel->brushq3.data_faces[loadmodel->surfacelist[i]].texture->numfaces++] = loadmodel->brushq3.data_faces + loadmodel->surfacelist[i];
5706         }
5707 }
5708
5709 void Mod_Q3BSP_RecursiveFindNumLeafs(q3mnode_t *node)
5710 {
5711         int numleafs;
5712         while (node->plane)
5713         {
5714                 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5715                 node = node->children[1];
5716         }
5717         numleafs = ((q3mleaf_t *)node - loadmodel->brushq3.data_leafs) + 1;
5718         if (loadmodel->brushq3.num_leafs < numleafs)
5719                 loadmodel->brushq3.num_leafs = numleafs;
5720 }
5721
5722 extern void R_Q3BSP_DrawSky(struct entity_render_s *ent);
5723 extern void R_Q3BSP_Draw(struct entity_render_s *ent);
5724 extern void R_Q3BSP_GetLightInfo(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, vec3_t outmins, vec3_t outmaxs, int *outclusterlist, qbyte *outclusterpvs, int *outnumclusterspointer, int *outsurfacelist, qbyte *outsurfacepvs, int *outnumsurfacespointer);
5725 extern void R_Q3BSP_DrawShadowVolume(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, int numsurfaces, const int *surfacelist);
5726 extern void R_Q3BSP_DrawLight(entity_render_t *ent, vec3_t relativelightorigin, vec3_t relativeeyeorigin, float lightradius, float *lightcolor, const matrix4x4_t *matrix_modeltolight, const matrix4x4_t *matrix_modeltoattenuationxyz, const matrix4x4_t *matrix_modeltoattenuationz, rtexture_t *lightcubemap, vec_t ambientscale, vec_t diffusescale, vec_t specularscale, int numsurfaces, const int *surfacelist);
5727 void Mod_Q3BSP_Load(model_t *mod, void *buffer)
5728 {
5729         int i, j, numshadowmeshtriangles;
5730         q3dheader_t *header;
5731         float corner[3], yawradius, modelradius;
5732         q3msurface_t *face;
5733
5734         mod->type = mod_brushq3;
5735         mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5736         mod->numskins = 1;
5737
5738         header = (q3dheader_t *)buffer;
5739
5740         i = LittleLong(header->version);
5741         if (i != Q3BSPVERSION)
5742                 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5743         if (mod->isworldmodel)
5744                 Cvar_SetValue("halflifebsp", false);
5745
5746         mod->soundfromcenter = true;
5747         mod->TraceBox = Mod_Q3BSP_TraceBox;
5748         mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5749         mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5750         mod->brush.GetPVS = Mod_Q3BSP_GetPVS;
5751         mod->brush.FatPVS = Mod_Q3BSP_FatPVS;
5752         mod->brush.BoxTouchingPVS = Mod_Q3BSP_BoxTouchingPVS;
5753         mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5754         mod->brush.FindNonSolidLocation = Mod_Q3BSP_FindNonSolidLocation;
5755         //mod->DrawSky = R_Q3BSP_DrawSky;
5756         mod->Draw = R_Q3BSP_Draw;
5757         mod->GetLightInfo = R_Q3BSP_GetLightInfo;
5758         mod->DrawShadowVolume = R_Q3BSP_DrawShadowVolume;
5759         mod->DrawLight = R_Q3BSP_DrawLight;
5760
5761         mod_base = (qbyte *)header;
5762
5763         // swap all the lumps
5764         header->ident = LittleLong(header->ident);
5765         header->version = LittleLong(header->version);
5766         for (i = 0;i < Q3HEADER_LUMPS;i++)
5767         {
5768                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
5769                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
5770         }
5771
5772         Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5773         Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5774         Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5775         Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5776         Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5777         Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5778         Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5779         Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5780         Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS]);
5781         Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5782         Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5783         Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5784         Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5785         Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5786         Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5787         Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5788         Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5789         loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5790
5791         // make a single combined shadow mesh to allow optimized shadow volume creation
5792         numshadowmeshtriangles = 0;
5793         for (j = 0, face = loadmodel->brushq3.data_faces;j < loadmodel->brushq3.num_faces;j++, face++)
5794         {
5795                 face->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5796                 numshadowmeshtriangles += face->mesh.num_triangles;
5797         }
5798         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5799         for (j = 0, face = loadmodel->brushq3.data_faces;j < loadmodel->brushq3.num_faces;j++, face++)
5800                 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, face->mesh.data_vertex3f, NULL, NULL, NULL, NULL, face->mesh.num_triangles, face->mesh.data_element3i);
5801         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
5802         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5803
5804         loadmodel->brushq3.num_leafs = 0;
5805         Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brushq3.data_nodes);
5806
5807         mod = loadmodel;
5808         for (i = 0;i < loadmodel->brushq3.num_models;i++)
5809         {
5810                 if (i > 0)
5811                 {
5812                         char name[10];
5813                         // LordHavoc: only register submodels if it is the world
5814                         // (prevents external bsp models from replacing world submodels with
5815                         //  their own)
5816                         if (!loadmodel->isworldmodel)
5817                                 continue;
5818                         // duplicate the basic information
5819                         sprintf(name, "*%i", i);
5820                         mod = Mod_FindName(name);
5821                         *mod = *loadmodel;
5822                         strcpy(mod->name, name);
5823                         // textures and memory belong to the main model
5824                         mod->texturepool = NULL;
5825                         mod->mempool = NULL;
5826                         mod->brush.GetPVS = NULL;
5827                         mod->brush.FatPVS = NULL;
5828                         mod->brush.BoxTouchingPVS = NULL;
5829                         mod->brush.LightPoint = NULL;
5830                         mod->brush.FindNonSolidLocation = Mod_Q3BSP_FindNonSolidLocation;
5831                 }
5832                 mod->brushq3.data_thismodel = loadmodel->brushq3.data_models + i;
5833                 mod->brushq3.submodel = i;
5834
5835                 // make the model surface list (used by shadowing/lighting)
5836                 mod->nummodelsurfaces = mod->brushq3.data_thismodel->numfaces;
5837                 mod->surfacelist = Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
5838                 for (j = 0;j < mod->nummodelsurfaces;j++)
5839                         mod->surfacelist[j] = (mod->brushq3.data_thismodel->firstface - mod->brushq3.data_faces) + j;
5840
5841                 VectorCopy(mod->brushq3.data_thismodel->mins, mod->normalmins);
5842                 VectorCopy(mod->brushq3.data_thismodel->maxs, mod->normalmaxs);
5843                 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5844                 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5845                 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5846                 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5847                 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5848                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5849                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5850                 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5851                 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5852                 mod->yawmins[2] = mod->normalmins[2];
5853                 mod->yawmaxs[2] = mod->normalmaxs[2];
5854                 mod->radius = modelradius;
5855                 mod->radius2 = modelradius * modelradius;
5856
5857                 for (j = 0;j < mod->brushq3.data_thismodel->numfaces;j++)
5858                         if (mod->brushq3.data_thismodel->firstface[j].texture->surfaceflags & Q3SURFACEFLAG_SKY)
5859                                 break;
5860                 if (j < mod->brushq3.data_thismodel->numfaces)
5861                         mod->DrawSky = R_Q3BSP_DrawSky;
5862         }
5863
5864         Mod_Q3BSP_BuildTextureFaceLists();
5865 }
5866
5867 void Mod_IBSP_Load(model_t *mod, void *buffer)
5868 {
5869         int i = LittleLong(((int *)buffer)[1]);
5870         if (i == Q3BSPVERSION)
5871                 Mod_Q3BSP_Load(mod,buffer);
5872         else if (i == Q2BSPVERSION)
5873                 Mod_Q2BSP_Load(mod,buffer);
5874         else
5875                 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i\n", i);
5876 }
5877
5878 void Mod_MAP_Load(model_t *mod, void *buffer)
5879 {
5880         Host_Error("Mod_MAP_Load: not yet implemented\n");
5881 }
5882