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