model_brush.c

   1 /*
   2 Copyright (C) 1996-1997 Id Software, Inc.
   3
   4 This program is free software; you can redistribute it and/or
   5 modify it under the terms of the GNU General Public License
   6 as published by the Free Software Foundation; either version 2
   7 of the License, or (at your option) any later version.
   8
   9 This program is distributed in the hope that it will be useful,
  10 but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  12
  13 See the GNU General Public License for more details.
  14
  15 You should have received a copy of the GNU General Public License
  16 along with this program; if not, write to the Free Software
  17 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
  18
  19 */
  20
  21 #include "quakedef.h"
  22 #include "image.h"
  23 #include "r_shadow.h"
  24 #include "polygon.h"
  25 #include "curves.h"
  26 #include "wad.h"
  27
  28
  29 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128"};
  30 cvar_t halflifebsp = {0, "halflifebsp", "0"};
  31 cvar_t mcbsp = {0, "mcbsp", "0"};
  32 cvar_t r_novis = {0, "r_novis", "0"};
  33 cvar_t r_miplightmaps = {CVAR_SAVE, "r_miplightmaps", "0"};
  34 cvar_t r_lightmaprgba = {0, "r_lightmaprgba", "1"};
  35 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0"};
  36 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4"};
  37 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "1"};
  38 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024"};
  39 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536"};
  40 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15"};
  41 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "1"};
  42 cvar_t r_subdivisions_collision_maxtess = {0, "r_subdivisions_collision_maxtess", "1024"};
  43 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225"};
  44 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1"};
  45 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1"};
  46 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0"};
  47
  48 void Mod_BrushInit(void)
  49 {
  50 //      Cvar_RegisterVariable(&r_subdivide_size);
  51         Cvar_RegisterVariable(&halflifebsp);
  52         Cvar_RegisterVariable(&mcbsp);
  53         Cvar_RegisterVariable(&r_novis);
  54         Cvar_RegisterVariable(&r_miplightmaps);
  55         Cvar_RegisterVariable(&r_lightmaprgba);
  56         Cvar_RegisterVariable(&r_nosurftextures);
  57         Cvar_RegisterVariable(&r_subdivisions_tolerance);
  58         Cvar_RegisterVariable(&r_subdivisions_mintess);
  59         Cvar_RegisterVariable(&r_subdivisions_maxtess);
  60         Cvar_RegisterVariable(&r_subdivisions_maxvertices);
  61         Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
  62         Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
  63         Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
  64         Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
  65         Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
  66         Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
  67         Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
  68 }
  69
  70 static mleaf_t *Mod_Q1BSP_PointInLeaf(model_t *model, const vec3_t p)
  71 {
  72         mnode_t *node;
  73
  74         if (model == NULL)
  75                 return NULL;
  76
  77         Mod_CheckLoaded(model);
  78
  79         // LordHavoc: modified to start at first clip node,
  80         // in other words: first node of the (sub)model
  81         node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
  82         while (node->plane)
  83                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
  84
  85         return (mleaf_t *)node;
  86 }
  87
  88 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(model_t *model, const vec3_t p, qbyte *out, int outsize)
  89 {
  90         int i;
  91         mleaf_t *leaf;
  92         leaf = Mod_Q1BSP_PointInLeaf(model, p);
  93         if (leaf)
  94         {
  95                 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
  96                 if (i)
  97                 {
  98                         memcpy(out, leaf->ambient_sound_level, i);
  99                         out += i;
 100                         outsize -= i;
 101                 }
 102         }
 103         if (outsize)
 104                 memset(out, 0, outsize);
 105 }
 106
 107 static int Mod_Q1BSP_BoxTouchingPVS(model_t *model, const qbyte *pvs, const vec3_t mins, const vec3_t maxs)
 108 {
 109         int clusterindex, side, nodestackindex = 0;
 110         mnode_t *node, *nodestack[1024];
 111         if (!model->brush.num_pvsclusters)
 112                 return true;
 113         node = model->brush.data_nodes;
 114         for (;;)
 115         {
 116                 if (node->plane)
 117                 {
 118                         // node - recurse down the BSP tree
 119                         side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
 120                         if (side < 2)
 121                         {
 122                                 // box is on one side of plane, take that path
 123                                 node = node->children[side];
 124                         }
 125                         else
 126                         {
 127                                 // box crosses plane, take one path and remember the other
 128                                 if (nodestackindex < 1024)
 129                                         nodestack[nodestackindex++] = node->children[0];
 130                                 node = node->children[1];
 131                         }
 132                 }
 133                 else
 134                 {
 135                         // leaf - check cluster bit
 136                         clusterindex = ((mleaf_t *)node)->clusterindex;
 137                         if (CHECKPVSBIT(pvs, clusterindex))
 138                         {
 139                                 // it is visible, return immediately with the news
 140                                 return true;
 141                         }
 142                         else
 143                         {
 144                                 // nothing to see here, try another path we didn't take earlier
 145                                 if (nodestackindex == 0)
 146                                         break;
 147                                 node = nodestack[--nodestackindex];
 148                         }
 149                 }
 150         }
 151         // it is not visible
 152         return false;
 153 }
 154
 155 static int Mod_Q1BSP_BoxTouchingLeafPVS(model_t *model, const qbyte *pvs, const vec3_t mins, const vec3_t maxs)
 156 {
 157         int clusterindex, side, nodestackindex = 0;
 158         mnode_t *node, *nodestack[1024];
 159         if (!model->brush.num_leafs)
 160                 return true;
 161         node = model->brush.data_nodes;
 162         for (;;)
 163         {
 164                 if (node->plane)
 165                 {
 166                         // node - recurse down the BSP tree
 167                         side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
 168                         if (side < 2)
 169                         {
 170                                 // box is on one side of plane, take that path
 171                                 node = node->children[side];
 172                         }
 173                         else
 174                         {
 175                                 // box crosses plane, take one path and remember the other
 176                                 if (nodestackindex < 1024)
 177                                         nodestack[nodestackindex++] = node->children[0];
 178                                 node = node->children[1];
 179                         }
 180                 }
 181                 else
 182                 {
 183                         // leaf - check cluster bit
 184                         clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
 185                         if (CHECKPVSBIT(pvs, clusterindex))
 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 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(model_t *model, const qbyte *visibleleafs, const vec3_t mins, const vec3_t maxs)
 204 {
 205         int side, nodestackindex = 0;
 206         mnode_t *node, *nodestack[1024];
 207         node = model->brush.data_nodes;
 208         for (;;)
 209         {
 210                 if (node->plane)
 211                 {
 212                         // node - recurse down the BSP tree
 213                         side = BoxOnPlaneSide(mins, maxs, node->plane) - 1;
 214                         if (side < 2)
 215                         {
 216                                 // box is on one side of plane, take that path
 217                                 node = node->children[side];
 218                         }
 219                         else
 220                         {
 221                                 // box crosses plane, take one path and remember the other
 222                                 if (nodestackindex < 1024)
 223                                         nodestack[nodestackindex++] = node->children[0];
 224                                 node = node->children[1];
 225                         }
 226                 }
 227                 else
 228                 {
 229                         // leaf - check if it is visible
 230                         if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
 231                         {
 232                                 // it is visible, return immediately with the news
 233                                 return true;
 234                         }
 235                         else
 236                         {
 237                                 // nothing to see here, try another path we didn't take earlier
 238                                 if (nodestackindex == 0)
 239                                         break;
 240                                 node = nodestack[--nodestackindex];
 241                         }
 242                 }
 243         }
 244         // it is not visible
 245         return false;
 246 }
 247
 248 typedef struct findnonsolidlocationinfo_s
 249 {
 250         vec3_t center;
 251         vec_t radius;
 252         vec3_t nudge;
 253         vec_t bestdist;
 254         model_t *model;
 255 }
 256 findnonsolidlocationinfo_t;
 257
 258 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
 259 {
 260         int i, surfacenum, k, *tri, *mark;
 261         float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
 262         msurface_t *surface;
 263         for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
 264         {
 265                 surface = info->model->data_surfaces + *mark;
 266                 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
 267                 {
 268                         for (k = 0;k < surface->num_triangles;k++)
 269                         {
 270                                 tri = (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle) + k * 3;
 271                                 VectorCopy((surface->groupmesh->data_vertex3f + tri[0] * 3), vert[0]);
 272                                 VectorCopy((surface->groupmesh->data_vertex3f + tri[1] * 3), vert[1]);
 273                                 VectorCopy((surface->groupmesh->data_vertex3f + tri[2] * 3), vert[2]);
 274                                 VectorSubtract(vert[1], vert[0], edge[0]);
 275                                 VectorSubtract(vert[2], vert[1], edge[1]);
 276                                 CrossProduct(edge[1], edge[0], facenormal);
 277                                 if (facenormal[0] || facenormal[1] || facenormal[2])
 278                                 {
 279                                         VectorNormalize(facenormal);
 280                                         f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 281                                         if (f <= info->bestdist && f >= -info->bestdist)
 282                                         {
 283                                                 VectorSubtract(vert[0], vert[2], edge[2]);
 284                                                 VectorNormalize(edge[0]);
 285                                                 VectorNormalize(edge[1]);
 286                                                 VectorNormalize(edge[2]);
 287                                                 CrossProduct(facenormal, edge[0], edgenormal[0]);
 288                                                 CrossProduct(facenormal, edge[1], edgenormal[1]);
 289                                                 CrossProduct(facenormal, edge[2], edgenormal[2]);
 290                                                 // face distance
 291                                                 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
 292                                                  && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
 293                                                  && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
 294                                                 {
 295                                                         // we got lucky, the center is within the face
 296                                                         dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
 297                                                         if (dist < 0)
 298                                                         {
 299                                                                 dist = -dist;
 300                                                                 if (info->bestdist > dist)
 301                                                                 {
 302                                                                         info->bestdist = dist;
 303                                                                         VectorScale(facenormal, (info->radius - -dist), info->nudge);
 304                                                                 }
 305                                                         }
 306                                                         else
 307                                                         {
 308                                                                 if (info->bestdist > dist)
 309                                                                 {
 310                                                                         info->bestdist = dist;
 311                                                                         VectorScale(facenormal, (info->radius - dist), info->nudge);
 312                                                                 }
 313                                                         }
 314                                                 }
 315                                                 else
 316                                                 {
 317                                                         // check which edge or vertex the center is nearest
 318                                                         for (i = 0;i < 3;i++)
 319                                                         {
 320                                                                 f = DotProduct(info->center, edge[i]);
 321                                                                 if (f >= DotProduct(vert[0], edge[i])
 322                                                                  && f <= DotProduct(vert[1], edge[i]))
 323                                                                 {
 324                                                                         // on edge
 325                                                                         VectorMA(info->center, -f, edge[i], point);
 326                                                                         dist = sqrt(DotProduct(point, point));
 327                                                                         if (info->bestdist > dist)
 328                                                                         {
 329                                                                                 info->bestdist = dist;
 330                                                                                 VectorScale(point, (info->radius / dist), info->nudge);
 331                                                                         }
 332                                                                         // skip both vertex checks
 333                                                                         // (both are further away than this edge)
 334                                                                         i++;
 335                                                                 }
 336                                                                 else
 337                                                                 {
 338                                                                         // not on edge, check first vertex of edge
 339                                                                         VectorSubtract(info->center, vert[i], point);
 340                                                                         dist = sqrt(DotProduct(point, point));
 341                                                                         if (info->bestdist > dist)
 342                                                                         {
 343                                                                                 info->bestdist = dist;
 344                                                                                 VectorScale(point, (info->radius / dist), info->nudge);
 345                                                                         }
 346                                                                 }
 347                                                         }
 348                                                 }
 349                                         }
 350                                 }
 351                         }
 352                 }
 353         }
 354 }
 355
 356 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
 357 {
 358         if (node->plane)
 359         {
 360                 float f = PlaneDiff(info->center, node->plane);
 361                 if (f >= -info->bestdist)
 362                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
 363                 if (f <= info->bestdist)
 364                         Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
 365         }
 366         else
 367         {
 368                 if (((mleaf_t *)node)->numleafsurfaces)
 369                         Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
 370         }
 371 }
 372
 373 static void Mod_Q1BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, float radius)
 374 {
 375         int i;
 376         findnonsolidlocationinfo_t info;
 377         if (model == NULL)
 378         {
 379                 VectorCopy(in, out);
 380                 return;
 381         }
 382         VectorCopy(in, info.center);
 383         info.radius = radius;
 384         info.model = model;
 385         i = 0;
 386         do
 387         {
 388                 VectorClear(info.nudge);
 389                 info.bestdist = radius;
 390                 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
 391                 VectorAdd(info.center, info.nudge, info.center);
 392         }
 393         while (info.bestdist < radius && ++i < 10);
 394         VectorCopy(info.center, out);
 395 }
 396
 397 int Mod_Q1BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
 398 {
 399         switch(nativecontents)
 400         {
 401                 case CONTENTS_EMPTY:
 402                         return 0;
 403                 case CONTENTS_SOLID:
 404                         return SUPERCONTENTS_SOLID;
 405                 case CONTENTS_WATER:
 406                         return SUPERCONTENTS_WATER;
 407                 case CONTENTS_SLIME:
 408                         return SUPERCONTENTS_SLIME;
 409                 case CONTENTS_LAVA:
 410                         return SUPERCONTENTS_LAVA;
 411                 case CONTENTS_SKY:
 412                         return SUPERCONTENTS_SKY;
 413         }
 414         return 0;
 415 }
 416
 417 int Mod_Q1BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
 418 {
 419         if (supercontents & SUPERCONTENTS_SOLID)
 420                 return CONTENTS_SOLID;
 421         if (supercontents & SUPERCONTENTS_SKY)
 422                 return CONTENTS_SKY;
 423         if (supercontents & SUPERCONTENTS_LAVA)
 424                 return CONTENTS_LAVA;
 425         if (supercontents & SUPERCONTENTS_SLIME)
 426                 return CONTENTS_SLIME;
 427         if (supercontents & SUPERCONTENTS_WATER)
 428                 return CONTENTS_WATER;
 429         return CONTENTS_EMPTY;
 430 }
 431
 432 typedef struct
 433 {
 434         // the hull we're tracing through
 435         const hull_t *hull;
 436
 437         // the trace structure to fill in
 438         trace_t *trace;
 439
 440         // start, end, and end - start (in model space)
 441         double start[3];
 442         double end[3];
 443         double dist[3];
 444 }
 445 RecursiveHullCheckTraceInfo_t;
 446
 447 // 1/32 epsilon to keep floating point happy
 448 #define DIST_EPSILON (0.03125)
 449
 450 #define HULLCHECKSTATE_EMPTY 0
 451 #define HULLCHECKSTATE_SOLID 1
 452 #define HULLCHECKSTATE_DONE 2
 453
 454 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
 455 {
 456         // status variables, these don't need to be saved on the stack when
 457         // recursing...  but are because this should be thread-safe
 458         // (note: tracing against a bbox is not thread-safe, yet)
 459         int ret;
 460         mplane_t *plane;
 461         double t1, t2;
 462
 463         // variables that need to be stored on the stack when recursing
 464         dclipnode_t *node;
 465         int side;
 466         double midf, mid[3];
 467
 468         // LordHavoc: a goto!  everyone flee in terror... :)
 469 loc0:
 470         // check for empty
 471         if (num < 0)
 472         {
 473                 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
 474                 if (!t->trace->startfound)
 475                 {
 476                         t->trace->startfound = true;
 477                         t->trace->startsupercontents |= num;
 478                 }
 479                 if (num & SUPERCONTENTS_LIQUIDSMASK)
 480                         t->trace->inwater = true;
 481                 if (num == 0)
 482                         t->trace->inopen = true;
 483                 if (num & t->trace->hitsupercontentsmask)
 484                 {
 485                         // if the first leaf is solid, set startsolid
 486                         if (t->trace->allsolid)
 487                                 t->trace->startsolid = true;
 488 #if COLLISIONPARANOID >= 3
 489                         Con_Print("S");
 490 #endif
 491                         return HULLCHECKSTATE_SOLID;
 492                 }
 493                 else
 494                 {
 495                         t->trace->allsolid = false;
 496 #if COLLISIONPARANOID >= 3
 497                         Con_Print("E");
 498 #endif
 499                         return HULLCHECKSTATE_EMPTY;
 500                 }
 501         }
 502
 503         // find the point distances
 504         node = t->hull->clipnodes + num;
 505
 506         plane = t->hull->planes + node->planenum;
 507         if (plane->type < 3)
 508         {
 509                 t1 = p1[plane->type] - plane->dist;
 510                 t2 = p2[plane->type] - plane->dist;
 511         }
 512         else
 513         {
 514                 t1 = DotProduct (plane->normal, p1) - plane->dist;
 515                 t2 = DotProduct (plane->normal, p2) - plane->dist;
 516         }
 517
 518         if (t1 < 0)
 519         {
 520                 if (t2 < 0)
 521                 {
 522 #if COLLISIONPARANOID >= 3
 523                         Con_Print("<");
 524 #endif
 525                         num = node->children[1];
 526                         goto loc0;
 527                 }
 528                 side = 1;
 529         }
 530         else
 531         {
 532                 if (t2 >= 0)
 533                 {
 534 #if COLLISIONPARANOID >= 3
 535                         Con_Print(">");
 536 #endif
 537                         num = node->children[0];
 538                         goto loc0;
 539                 }
 540                 side = 0;
 541         }
 542
 543         // the line intersects, find intersection point
 544         // LordHavoc: this uses the original trace for maximum accuracy
 545 #if COLLISIONPARANOID >= 3
 546         Con_Print("M");
 547 #endif
 548         if (plane->type < 3)
 549         {
 550                 t1 = t->start[plane->type] - plane->dist;
 551                 t2 = t->end[plane->type] - plane->dist;
 552         }
 553         else
 554         {
 555                 t1 = DotProduct (plane->normal, t->start) - plane->dist;
 556                 t2 = DotProduct (plane->normal, t->end) - plane->dist;
 557         }
 558
 559         midf = t1 / (t1 - t2);
 560         midf = bound(p1f, midf, p2f);
 561         VectorMA(t->start, midf, t->dist, mid);
 562
 563         // recurse both sides, front side first
 564         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
 565         // if this side is not empty, return what it is (solid or done)
 566         if (ret != HULLCHECKSTATE_EMPTY)
 567                 return ret;
 568
 569         ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
 570         // if other side is not solid, return what it is (empty or done)
 571         if (ret != HULLCHECKSTATE_SOLID)
 572                 return ret;
 573
 574         // front is air and back is solid, this is the impact point...
 575         if (side)
 576         {
 577                 t->trace->plane.dist = -plane->dist;
 578                 VectorNegate (plane->normal, t->trace->plane.normal);
 579         }
 580         else
 581         {
 582                 t->trace->plane.dist = plane->dist;
 583                 VectorCopy (plane->normal, t->trace->plane.normal);
 584         }
 585
 586         // calculate the true fraction
 587         t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
 588         t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
 589         midf = t1 / (t1 - t2);
 590         t->trace->realfraction = bound(0, midf, 1);
 591
 592         // calculate the return fraction which is nudged off the surface a bit
 593         midf = (t1 - DIST_EPSILON) / (t1 - t2);
 594         t->trace->fraction = bound(0, midf, 1);
 595
 596 #if COLLISIONPARANOID >= 3
 597         Con_Print("D");
 598 #endif
 599         return HULLCHECKSTATE_DONE;
 600 }
 601
 602 #if COLLISIONPARANOID < 2
 603 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
 604 {
 605         while (num >= 0)
 606                 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];
 607         num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
 608         t->trace->startsupercontents |= num;
 609         if (num & SUPERCONTENTS_LIQUIDSMASK)
 610                 t->trace->inwater = true;
 611         if (num == 0)
 612                 t->trace->inopen = true;
 613         if (num & t->trace->hitsupercontentsmask)
 614         {
 615                 t->trace->allsolid = t->trace->startsolid = true;
 616                 return HULLCHECKSTATE_SOLID;
 617         }
 618         else
 619         {
 620                 t->trace->allsolid = t->trace->startsolid = false;
 621                 return HULLCHECKSTATE_EMPTY;
 622         }
 623 }
 624 #endif
 625
 626 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)
 627 {
 628         // this function currently only supports same size start and end
 629         double boxsize[3];
 630         RecursiveHullCheckTraceInfo_t rhc;
 631
 632         memset(&rhc, 0, sizeof(rhc));
 633         memset(trace, 0, sizeof(trace_t));
 634         rhc.trace = trace;
 635         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 636         rhc.trace->fraction = 1;
 637         rhc.trace->realfraction = 1;
 638         rhc.trace->allsolid = true;
 639         VectorSubtract(boxstartmaxs, boxstartmins, boxsize);
 640         if (boxsize[0] < 3)
 641                 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
 642         else if (model->brush.ismcbsp)
 643         {
 644                 if (boxsize[2] < 48) // pick the nearest of 40 or 56
 645                         rhc.hull = &model->brushq1.hulls[2]; // 16x16x40
 646                 else
 647                         rhc.hull = &model->brushq1.hulls[1]; // 16x16x56
 648         }
 649         else if (model->brush.ishlbsp)
 650         {
 651                 // LordHavoc: this has to have a minor tolerance (the .1) because of
 652                 // minor float precision errors from the box being transformed around
 653                 if (boxsize[0] < 32.1)
 654                 {
 655                         if (boxsize[2] < 54) // pick the nearest of 36 or 72
 656                                 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
 657                         else
 658                                 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
 659                 }
 660                 else
 661                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
 662         }
 663         else
 664         {
 665                 // LordHavoc: this has to have a minor tolerance (the .1) because of
 666                 // minor float precision errors from the box being transformed around
 667                 if (boxsize[0] < 32.1)
 668                         rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
 669                 else
 670                         rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
 671         }
 672         VectorSubtract(boxstartmins, rhc.hull->clip_mins, rhc.start);
 673         VectorSubtract(boxendmins, rhc.hull->clip_mins, rhc.end);
 674         VectorSubtract(rhc.end, rhc.start, rhc.dist);
 675 #if COLLISIONPARANOID >= 2
 676         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]);
 677         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 678         Con_Print("\n");
 679 #else
 680         if (DotProduct(rhc.dist, rhc.dist))
 681                 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 682         else
 683                 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
 684 #endif
 685 }
 686
 687 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)
 688 {
 689 #if 1
 690         colbrushf_t cbox;
 691         colplanef_t cbox_planes[6];
 692         cbox.supercontents = boxsupercontents;
 693         cbox.numplanes = 6;
 694         cbox.numpoints = 0;
 695         cbox.numtriangles = 0;
 696         cbox.planes = cbox_planes;
 697         cbox.points = NULL;
 698         cbox.elements = NULL;
 699         cbox.markframe = 0;
 700         cbox.mins[0] = 0;
 701         cbox.mins[1] = 0;
 702         cbox.mins[2] = 0;
 703         cbox.maxs[0] = 0;
 704         cbox.maxs[1] = 0;
 705         cbox.maxs[2] = 0;
 706         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];
 707         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];
 708         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];
 709         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];
 710         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];
 711         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];
 712         memset(trace, 0, sizeof(trace_t));
 713         trace->hitsupercontentsmask = hitsupercontentsmask;
 714         trace->fraction = 1;
 715         trace->realfraction = 1;
 716         Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
 717 #else
 718         RecursiveHullCheckTraceInfo_t rhc;
 719         static hull_t box_hull;
 720         static dclipnode_t box_clipnodes[6];
 721         static mplane_t box_planes[6];
 722         // fill in a default trace
 723         memset(&rhc, 0, sizeof(rhc));
 724         memset(trace, 0, sizeof(trace_t));
 725         //To keep everything totally uniform, bounding boxes are turned into small
 726         //BSP trees instead of being compared directly.
 727         // create a temp hull from bounding box sizes
 728         box_planes[0].dist = cmaxs[0] - mins[0];
 729         box_planes[1].dist = cmins[0] - maxs[0];
 730         box_planes[2].dist = cmaxs[1] - mins[1];
 731         box_planes[3].dist = cmins[1] - maxs[1];
 732         box_planes[4].dist = cmaxs[2] - mins[2];
 733         box_planes[5].dist = cmins[2] - maxs[2];
 734 #if COLLISIONPARANOID >= 3
 735         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]);
 736 #endif
 737
 738         if (box_hull.clipnodes == NULL)
 739         {
 740                 int i, side;
 741
 742                 //Set up the planes and clipnodes so that the six floats of a bounding box
 743                 //can just be stored out and get a proper hull_t structure.
 744
 745                 box_hull.clipnodes = box_clipnodes;
 746                 box_hull.planes = box_planes;
 747                 box_hull.firstclipnode = 0;
 748                 box_hull.lastclipnode = 5;
 749
 750                 for (i = 0;i < 6;i++)
 751                 {
 752                         box_clipnodes[i].planenum = i;
 753
 754                         side = i&1;
 755
 756                         box_clipnodes[i].children[side] = CONTENTS_EMPTY;
 757                         if (i != 5)
 758                                 box_clipnodes[i].children[side^1] = i + 1;
 759                         else
 760                                 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
 761
 762                         box_planes[i].type = i>>1;
 763                         box_planes[i].normal[i>>1] = 1;
 764                 }
 765         }
 766
 767         // trace a line through the generated clipping hull
 768         //rhc.boxsupercontents = boxsupercontents;
 769         rhc.hull = &box_hull;
 770         rhc.trace = trace;
 771         rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
 772         rhc.trace->fraction = 1;
 773         rhc.trace->realfraction = 1;
 774         rhc.trace->allsolid = true;
 775         VectorCopy(start, rhc.start);
 776         VectorCopy(end, rhc.end);
 777         VectorSubtract(rhc.end, rhc.start, rhc.dist);
 778         Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
 779         //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
 780         if (rhc.trace->startsupercontents)
 781                 rhc.trace->startsupercontents = boxsupercontents;
 782 #endif
 783 }
 784
 785 static int Mod_Q1BSP_LightPoint_RecursiveBSPNode(model_t *model, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal, const mnode_t *node, float x, float y, float startz, float endz)
 786 {
 787         int side, distz = endz - startz;
 788         float front, back;
 789         float mid;
 790
 791 loc0:
 792         if (!node->plane)
 793                 return false;           // didn't hit anything
 794
 795         switch (node->plane->type)
 796         {
 797         case PLANE_X:
 798                 node = node->children[x < node->plane->dist];
 799                 goto loc0;
 800         case PLANE_Y:
 801                 node = node->children[y < node->plane->dist];
 802                 goto loc0;
 803         case PLANE_Z:
 804                 side = startz < node->plane->dist;
 805                 if ((endz < node->plane->dist) == side)
 806                 {
 807                         node = node->children[side];
 808                         goto loc0;
 809                 }
 810                 // found an intersection
 811                 mid = node->plane->dist;
 812                 break;
 813         default:
 814                 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
 815                 front += startz * node->plane->normal[2];
 816                 back += endz * node->plane->normal[2];
 817                 side = front < node->plane->dist;
 818                 if ((back < node->plane->dist) == side)
 819                 {
 820                         node = node->children[side];
 821                         goto loc0;
 822                 }
 823                 // found an intersection
 824                 mid = startz + distz * (front - node->plane->dist) / (front - back);
 825                 break;
 826         }
 827
 828         // go down front side
 829         if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
 830                 return true;    // hit something
 831         else
 832         {
 833                 // check for impact on this node
 834                 if (node->numsurfaces)
 835                 {
 836                         int i, ds, dt;
 837                         msurface_t *surface;
 838
 839                         surface = model->data_surfaces + node->firstsurface;
 840                         for (i = 0;i < node->numsurfaces;i++, surface++)
 841                         {
 842                                 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
 843                                         continue;       // no lightmaps
 844
 845                                 ds = (int) (x * surface->lightmapinfo->texinfo->vecs[0][0] + y * surface->lightmapinfo->texinfo->vecs[0][1] + mid * surface->lightmapinfo->texinfo->vecs[0][2] + surface->lightmapinfo->texinfo->vecs[0][3]) - surface->lightmapinfo->texturemins[0];
 846                                 dt = (int) (x * surface->lightmapinfo->texinfo->vecs[1][0] + y * surface->lightmapinfo->texinfo->vecs[1][1] + mid * surface->lightmapinfo->texinfo->vecs[1][2] + surface->lightmapinfo->texinfo->vecs[1][3]) - surface->lightmapinfo->texturemins[1];
 847
 848                                 if (ds >= 0 && ds < surface->lightmapinfo->extents[0] && dt >= 0 && dt < surface->lightmapinfo->extents[1])
 849                                 {
 850                                         qbyte *lightmap;
 851                                         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;
 852                                         lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
 853                                         lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
 854                                         line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
 855                                         size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
 856
 857                                         lightmap = surface->lightmapinfo->samples + ((dt>>4) * lmwidth + (ds>>4))*3; // LordHavoc: *3 for colored lighting
 858
 859                                         for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
 860                                         {
 861                                                 scale = d_lightstylevalue[surface->lightmapinfo->styles[maps]];
 862                                                 r00 += lightmap[      0] * scale;g00 += lightmap[      1] * scale;b00 += lightmap[      2] * scale;
 863                                                 r01 += lightmap[      3] * scale;g01 += lightmap[      4] * scale;b01 += lightmap[      5] * scale;
 864                                                 r10 += lightmap[line3+0] * scale;g10 += lightmap[line3+1] * scale;b10 += lightmap[line3+2] * scale;
 865                                                 r11 += lightmap[line3+3] * scale;g11 += lightmap[line3+4] * scale;b11 += lightmap[line3+5] * scale;
 866                                                 lightmap += size3;
 867                                         }
 868
 869 /*
 870 LordHavoc: here's the readable version of the interpolation
 871 code, not quite as easy for the compiler to optimize...
 872
 873 dsfrac is the X position in the lightmap pixel, * 16
 874 dtfrac is the Y position in the lightmap pixel, * 16
 875 r00 is top left corner, r01 is top right corner
 876 r10 is bottom left corner, r11 is bottom right corner
 877 g and b are the same layout.
 878 r0 and r1 are the top and bottom intermediate results
 879
 880 first we interpolate the top two points, to get the top
 881 edge sample
 882
 883         r0 = (((r01-r00) * dsfrac) >> 4) + r00;
 884         g0 = (((g01-g00) * dsfrac) >> 4) + g00;
 885         b0 = (((b01-b00) * dsfrac) >> 4) + b00;
 886
 887 then we interpolate the bottom two points, to get the
 888 bottom edge sample
 889
 890         r1 = (((r11-r10) * dsfrac) >> 4) + r10;
 891         g1 = (((g11-g10) * dsfrac) >> 4) + g10;
 892         b1 = (((b11-b10) * dsfrac) >> 4) + b10;
 893
 894 then we interpolate the top and bottom samples to get the
 895 middle sample (the one which was requested)
 896
 897         r = (((r1-r0) * dtfrac) >> 4) + r0;
 898         g = (((g1-g0) * dtfrac) >> 4) + g0;
 899         b = (((b1-b0) * dtfrac) >> 4) + b0;
 900 */
 901
 902                                         ambientcolor[0] += (float) ((((((((r11-r10) * dsfrac) >> 4) + r10)-((((r01-r00) * dsfrac) >> 4) + r00)) * dtfrac) >> 4) + ((((r01-r00) * dsfrac) >> 4) + r00)) * (1.0f / 32768.0f);
 903                                         ambientcolor[1] += (float) ((((((((g11-g10) * dsfrac) >> 4) + g10)-((((g01-g00) * dsfrac) >> 4) + g00)) * dtfrac) >> 4) + ((((g01-g00) * dsfrac) >> 4) + g00)) * (1.0f / 32768.0f);
 904                                         ambientcolor[2] += (float) ((((((((b11-b10) * dsfrac) >> 4) + b10)-((((b01-b00) * dsfrac) >> 4) + b00)) * dtfrac) >> 4) + ((((b01-b00) * dsfrac) >> 4) + b00)) * (1.0f / 32768.0f);
 905                                         return true; // success
 906                                 }
 907                         }
 908                 }
 909
 910                 // go down back side
 911                 node = node->children[side ^ 1];
 912                 startz = mid;
 913                 distz = endz - startz;
 914                 goto loc0;
 915         }
 916 }
 917
 918 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
 919 {
 920         Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode, p[0], p[1], p[2], p[2] - 65536);
 921 }
 922
 923 static void Mod_Q1BSP_DecompressVis(const qbyte *in, const qbyte *inend, qbyte *out, qbyte *outend)
 924 {
 925         int c;
 926         qbyte *outstart = out;
 927         while (out < outend)
 928         {
 929                 if (in == inend)
 930                 {
 931                         Con_Printf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
 932                         return;
 933                 }
 934                 c = *in++;
 935                 if (c)
 936                         *out++ = c;
 937                 else
 938                 {
 939                         if (in == inend)
 940                         {
 941                                 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);
 942                                 return;
 943                         }
 944                         for (c = *in++;c > 0;c--)
 945                         {
 946                                 if (out == outend)
 947                                 {
 948                                         Con_Printf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
 949                                         return;
 950                                 }
 951                                 *out++ = 0;
 952                         }
 953                 }
 954         }
 955 }
 956
 957 /*
 958 =============
 959 R_Q1BSP_LoadSplitSky
 960
 961 A sky texture is 256*128, with the right side being a masked overlay
 962 ==============
 963 */
 964 void R_Q1BSP_LoadSplitSky (qbyte *src, int width, int height, int bytesperpixel)
 965 {
 966         int i, j;
 967         unsigned solidpixels[128*128], alphapixels[128*128];
 968
 969         // if sky isn't the right size, just use it as a solid layer
 970         if (width != 256 || height != 128)
 971         {
 972                 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);
 973                 loadmodel->brush.alphaskytexture = NULL;;
 974                 return;
 975         }
 976
 977         if (bytesperpixel == 4)
 978         {
 979                 for (i = 0;i < 128;i++)
 980                 {
 981                         for (j = 0;j < 128;j++)
 982                         {
 983                                 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
 984                                 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
 985                         }
 986                 }
 987         }
 988         else
 989         {
 990                 // make an average value for the back to avoid
 991                 // a fringe on the top level
 992                 int p, r, g, b;
 993                 union
 994                 {
 995                         unsigned int i;
 996                         unsigned char b[4];
 997                 }
 998                 rgba;
 999                 r = g = b = 0;
1000                 for (i = 0;i < 128;i++)
1001                 {
1002                         for (j = 0;j < 128;j++)
1003                         {
1004                                 rgba.i = palette_complete[src[i*256 + j + 128]];
1005                                 r += rgba.b[0];
1006                                 g += rgba.b[1];
1007                                 b += rgba.b[2];
1008                         }
1009                 }
1010                 rgba.b[0] = r/(128*128);
1011                 rgba.b[1] = g/(128*128);
1012                 rgba.b[2] = b/(128*128);
1013                 rgba.b[3] = 0;
1014                 for (i = 0;i < 128;i++)
1015                 {
1016                         for (j = 0;j < 128;j++)
1017                         {
1018                                 solidpixels[(i*128) + j] = palette_complete[src[i*256 + j + 128]];
1019                                 alphapixels[(i*128) + j] = (p = src[i*256 + j]) ? palette_complete[p] : rgba.i;
1020                         }
1021                 }
1022         }
1023
1024         loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (qbyte *) solidpixels, TEXTYPE_RGBA, TEXF_PRECACHE, NULL);
1025         loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (qbyte *) alphapixels, TEXTYPE_RGBA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1026 }
1027
1028 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1029 {
1030         int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1031         miptex_t *dmiptex;
1032         texture_t *tx, *tx2, *anims[10], *altanims[10];
1033         dmiptexlump_t *m;
1034         qbyte *data, *mtdata;
1035         char name[256];
1036
1037         loadmodel->data_textures = NULL;
1038
1039         // add two slots for notexture walls and notexture liquids
1040         if (l->filelen)
1041         {
1042                 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1043                 m->nummiptex = LittleLong (m->nummiptex);
1044                 loadmodel->num_textures = m->nummiptex + 2;
1045         }
1046         else
1047         {
1048                 m = NULL;
1049                 loadmodel->num_textures = 2;
1050         }
1051
1052         loadmodel->data_textures = Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1053
1054         // fill out all slots with notexture
1055         for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1056         {
1057                 strcpy(tx->name, "NO TEXTURE FOUND");
1058                 tx->width = 16;
1059                 tx->height = 16;
1060                 tx->skin.base = r_texture_notexture;
1061                 tx->basematerialflags = 0;
1062                 if (i == loadmodel->num_textures - 1)
1063                 {
1064                         tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES;
1065                         tx->supercontents = SUPERCONTENTS_WATER;
1066                 }
1067                 else
1068                 {
1069                         tx->basematerialflags |= MATERIALFLAG_WALL;
1070                         tx->supercontents = SUPERCONTENTS_SOLID;
1071                 }
1072                 tx->currentframe = tx;
1073         }
1074
1075         if (!m)
1076                 return;
1077
1078         // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1079         dofs = m->dataofs;
1080         // LordHavoc: mostly rewritten map texture loader
1081         for (i = 0;i < m->nummiptex;i++)
1082         {
1083                 dofs[i] = LittleLong(dofs[i]);
1084                 if (dofs[i] == -1 || r_nosurftextures.integer)
1085                         continue;
1086                 dmiptex = (miptex_t *)((qbyte *)m + dofs[i]);
1087
1088                 // make sure name is no more than 15 characters
1089                 for (j = 0;dmiptex->name[j] && j < 15;j++)
1090                         name[j] = dmiptex->name[j];
1091                 name[j] = 0;
1092
1093                 mtwidth = LittleLong(dmiptex->width);
1094                 mtheight = LittleLong(dmiptex->height);
1095                 mtdata = NULL;
1096                 j = LittleLong(dmiptex->offsets[0]);
1097                 if (j)
1098                 {
1099                         // texture included
1100                         if (j < 40 || j + mtwidth * mtheight > l->filelen)
1101                         {
1102                                 Con_Printf("Texture \"%s\" in \"%s\"is corrupt or incomplete\n", dmiptex->name, loadmodel->name);
1103                                 continue;
1104                         }
1105                         mtdata = (qbyte *)dmiptex + j;
1106                 }
1107
1108                 if ((mtwidth & 15) || (mtheight & 15))
1109                         Con_Printf("warning: texture \"%s\" in \"%s\" is not 16 aligned\n", dmiptex->name, loadmodel->name);
1110
1111                 // LordHavoc: force all names to lowercase
1112                 for (j = 0;name[j];j++)
1113                         if (name[j] >= 'A' && name[j] <= 'Z')
1114                                 name[j] += 'a' - 'A';
1115
1116                 tx = loadmodel->data_textures + i;
1117                 strcpy(tx->name, name);
1118                 tx->width = mtwidth;
1119                 tx->height = mtheight;
1120
1121                 if (!tx->name[0])
1122                 {
1123                         sprintf(tx->name, "unnamed%i", i);
1124                         Con_Printf("warning: unnamed texture in %s, renaming to %s\n", loadmodel->name, tx->name);
1125                 }
1126
1127                 // LordHavoc: HL sky textures are entirely different than quake
1128                 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1129                 {
1130                         if (loadmodel->isworldmodel)
1131                         {
1132                                 data = loadimagepixels(tx->name, false, 0, 0);
1133                                 if (data)
1134                                 {
1135                                         R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1136                                         Mem_Free(data);
1137                                 }
1138                                 else if (mtdata != NULL)
1139                                         R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1140                         }
1141                 }
1142                 else
1143                 {
1144                         if (!Mod_LoadSkinFrame(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, true))
1145                         {
1146                                 // did not find external texture, load it from the bsp or wad3
1147                                 if (loadmodel->brush.ishlbsp)
1148                                 {
1149                                         // internal texture overrides wad
1150                                         qbyte *pixels, *freepixels, *fogpixels;
1151                                         pixels = freepixels = NULL;
1152                                         if (mtdata)
1153                                                 pixels = W_ConvertWAD3Texture(dmiptex);
1154                                         if (pixels == NULL)
1155                                                 pixels = freepixels = W_GetTexture(tx->name);
1156                                         if (pixels != NULL)
1157                                         {
1158                                                 tx->width = image_width;
1159                                                 tx->height = image_height;
1160                                                 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);
1161                                                 if (Image_CheckAlpha(pixels, image_width * image_height, true))
1162                                                 {
1163                                                         fogpixels = Mem_Alloc(tempmempool, image_width * image_height * 4);
1164                                                         for (j = 0;j < image_width * image_height * 4;j += 4)
1165                                                         {
1166                                                                 fogpixels[j + 0] = 255;
1167                                                                 fogpixels[j + 1] = 255;
1168                                                                 fogpixels[j + 2] = 255;
1169                                                                 fogpixels[j + 3] = pixels[j + 3];
1170                                                         }
1171                                                         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);
1172                                                         Mem_Free(fogpixels);
1173                                                 }
1174                                         }
1175                                         if (freepixels)
1176                                                 Mem_Free(freepixels);
1177                                 }
1178                                 else if (mtdata) // texture included
1179                                         Mod_LoadSkinFrame_Internal(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_PICMIP, false, tx->name[0] != '*' && r_fullbrights.integer, mtdata, tx->width, tx->height);
1180                         }
1181                 }
1182                 if (tx->skin.base == NULL)
1183                 {
1184                         // no texture found
1185                         tx->width = 16;
1186                         tx->height = 16;
1187                         tx->skin.base = r_texture_notexture;
1188                 }
1189
1190                 tx->basematerialflags = 0;
1191                 if (tx->name[0] == '*')
1192                 {
1193                         // turb does not block movement
1194                         tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES;
1195                         // LordHavoc: some turbulent textures should be fullbright and solid
1196                         if (!strncmp(tx->name,"*lava",5)
1197                          || !strncmp(tx->name,"*teleport",9)
1198                          || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1199                                 tx->basematerialflags |= MATERIALFLAG_FULLBRIGHT;
1200                         else
1201                                 tx->basematerialflags |= MATERIALFLAG_WATERALPHA;
1202                         if (!strncmp(tx->name, "*lava", 5))
1203                                 tx->supercontents = SUPERCONTENTS_LAVA;
1204                         else if (!strncmp(tx->name, "*slime", 6))
1205                                 tx->supercontents = SUPERCONTENTS_SLIME;
1206                         else
1207                                 tx->supercontents = SUPERCONTENTS_WATER;
1208                 }
1209                 else if (tx->name[0] == 's' && tx->name[1] == 'k' && tx->name[2] == 'y')
1210                 {
1211                         tx->supercontents = SUPERCONTENTS_SKY;
1212                         tx->basematerialflags |= MATERIALFLAG_SKY;
1213                 }
1214                 else
1215                 {
1216                         tx->supercontents = SUPERCONTENTS_SOLID;
1217                         tx->basematerialflags |= MATERIALFLAG_WALL;
1218                 }
1219                 if (tx->skin.fog)
1220                         tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
1221
1222                 // start out with no animation
1223                 tx->currentframe = tx;
1224         }
1225
1226         // sequence the animations
1227         for (i = 0;i < m->nummiptex;i++)
1228         {
1229                 tx = loadmodel->data_textures + i;
1230                 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1231                         continue;
1232                 if (tx->anim_total[0] || tx->anim_total[1])
1233                         continue;       // already sequenced
1234
1235                 // find the number of frames in the animation
1236                 memset(anims, 0, sizeof(anims));
1237                 memset(altanims, 0, sizeof(altanims));
1238
1239                 for (j = i;j < m->nummiptex;j++)
1240                 {
1241                         tx2 = loadmodel->data_textures + j;
1242                         if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1243                                 continue;
1244
1245                         num = tx2->name[1];
1246                         if (num >= '0' && num <= '9')
1247                                 anims[num - '0'] = tx2;
1248                         else if (num >= 'a' && num <= 'j')
1249                                 altanims[num - 'a'] = tx2;
1250                         else
1251                                 Con_Printf("Bad animating texture %s\n", tx->name);
1252                 }
1253
1254                 max = altmax = 0;
1255                 for (j = 0;j < 10;j++)
1256                 {
1257                         if (anims[j])
1258                                 max = j + 1;
1259                         if (altanims[j])
1260                                 altmax = j + 1;
1261                 }
1262                 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1263
1264                 incomplete = false;
1265                 for (j = 0;j < max;j++)
1266                 {
1267                         if (!anims[j])
1268                         {
1269                                 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1270                                 incomplete = true;
1271                         }
1272                 }
1273                 for (j = 0;j < altmax;j++)
1274                 {
1275                         if (!altanims[j])
1276                         {
1277                                 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1278                                 incomplete = true;
1279                         }
1280                 }
1281                 if (incomplete)
1282                         continue;
1283
1284                 if (altmax < 1)
1285                 {
1286                         // if there is no alternate animation, duplicate the primary
1287                         // animation into the alternate
1288                         altmax = max;
1289                         for (k = 0;k < 10;k++)
1290                                 altanims[k] = anims[k];
1291                 }
1292
1293                 // link together the primary animation
1294                 for (j = 0;j < max;j++)
1295                 {
1296                         tx2 = anims[j];
1297                         tx2->animated = true;
1298                         tx2->anim_total[0] = max;
1299                         tx2->anim_total[1] = altmax;
1300                         for (k = 0;k < 10;k++)
1301                         {
1302                                 tx2->anim_frames[0][k] = anims[k];
1303                                 tx2->anim_frames[1][k] = altanims[k];
1304                         }
1305                 }
1306
1307                 // if there really is an alternate anim...
1308                 if (anims[0] != altanims[0])
1309                 {
1310                         // link together the alternate animation
1311                         for (j = 0;j < altmax;j++)
1312                         {
1313                                 tx2 = altanims[j];
1314                                 tx2->animated = true;
1315                                 // the primary/alternate are reversed here
1316                                 tx2->anim_total[0] = altmax;
1317                                 tx2->anim_total[1] = max;
1318                                 for (k = 0;k < 10;k++)
1319                                 {
1320                                         tx2->anim_frames[0][k] = altanims[k];
1321                                         tx2->anim_frames[1][k] = anims[k];
1322                                 }
1323                         }
1324                 }
1325         }
1326 }
1327
1328 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1329 {
1330         int i;
1331         qbyte *in, *out, *data, d;
1332         char litfilename[1024];
1333         loadmodel->brushq1.lightdata = NULL;
1334         if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1335         {
1336                 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen);
1337                 for (i=0; i<l->filelen; i++)
1338                         loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1339         }
1340         else if (loadmodel->brush.ismcbsp)
1341         {
1342                 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen);
1343                 memcpy(loadmodel->brushq1.lightdata, mod_base + l->fileofs, l->filelen);
1344         }
1345         else // LordHavoc: bsp version 29 (normal white lighting)
1346         {
1347                 // LordHavoc: hope is not lost yet, check for a .lit file to load
1348                 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1349                 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1350                 strlcat (litfilename, ".lit", sizeof (litfilename));
1351                 data = (qbyte*) FS_LoadFile(litfilename, tempmempool, false);
1352                 if (data)
1353                 {
1354                         if (fs_filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1355                         {
1356                                 i = LittleLong(((int *)data)[1]);
1357                                 if (i == 1)
1358                                 {
1359                                         Con_DPrintf("loaded %s\n", litfilename);
1360                                         loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, fs_filesize - 8);
1361                                         memcpy(loadmodel->brushq1.lightdata, data + 8, fs_filesize - 8);
1362                                         Mem_Free(data);
1363                                         return;
1364                                 }
1365                                 else
1366                                 {
1367                                         Con_Printf("Unknown .lit file version (%d)\n", i);
1368                                         Mem_Free(data);
1369                                 }
1370                         }
1371                         else
1372                         {
1373                                 if (fs_filesize == 8)
1374                                         Con_Print("Empty .lit file, ignoring\n");
1375                                 else
1376                                         Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", fs_filesize, 8 + l->filelen * 3);
1377                                 Mem_Free(data);
1378                         }
1379                 }
1380                 // LordHavoc: oh well, expand the white lighting data
1381                 if (!l->filelen)
1382                         return;
1383                 loadmodel->brushq1.lightdata = Mem_Alloc(loadmodel->mempool, l->filelen*3);
1384                 in = loadmodel->brushq1.lightdata + l->filelen*2; // place the file at the end, so it will not be overwritten until the very last write
1385                 out = loadmodel->brushq1.lightdata;
1386                 memcpy(in, mod_base + l->fileofs, l->filelen);
1387                 for (i = 0;i < l->filelen;i++)
1388                 {
1389                         d = *in++;
1390                         *out++ = d;
1391                         *out++ = d;
1392                         *out++ = d;
1393                 }
1394         }
1395 }
1396
1397 static void Mod_Q1BSP_LoadLightList(void)
1398 {
1399         int a, n, numlights;
1400         char tempchar, *s, *t, *lightsstring, lightsfilename[1024];
1401         mlight_t *e;
1402
1403         strlcpy (lightsfilename, loadmodel->name, sizeof (lightsfilename));
1404         FS_StripExtension (lightsfilename, lightsfilename, sizeof(lightsfilename));
1405         strlcat (lightsfilename, ".lights", sizeof (lightsfilename));
1406         s = lightsstring = (char *) FS_LoadFile(lightsfilename, tempmempool, false);
1407         if (s)
1408         {
1409                 numlights = 0;
1410                 while (*s)
1411                 {
1412                         while (*s && *s != '\n' && *s != '\r')
1413                                 s++;
1414                         if (!*s)
1415                         {
1416                                 Mem_Free(lightsstring);
1417                                 Con_Printf("lights file must end with a newline\n");
1418                                 return;
1419                         }
1420                         s++;
1421                         numlights++;
1422                 }
1423                 loadmodel->brushq1.lights = Mem_Alloc(loadmodel->mempool, numlights * sizeof(mlight_t));
1424                 s = lightsstring;
1425                 n = 0;
1426                 while (*s && n < numlights)
1427                 {
1428                         t = s;
1429                         while (*s && *s != '\n' && *s != '\r')
1430                                 s++;
1431                         if (!*s)
1432                         {
1433                                 Con_Printf("misparsed lights file!\n");
1434                                 break;
1435                         }
1436                         e = loadmodel->brushq1.lights + n;
1437                         tempchar = *s;
1438                         *s = 0;
1439                         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);
1440                         *s = tempchar;
1441                         if (a != 14)
1442                         {
1443                                 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);
1444                                 break;
1445                         }
1446                         if (*s == '\r')
1447                                 s++;
1448                         if (*s == '\n')
1449                                 s++;
1450                         n++;
1451                 }
1452                 if (*s)
1453                         Con_Printf("misparsed lights file!\n");
1454                 loadmodel->brushq1.numlights = numlights;
1455                 Mem_Free(lightsstring);
1456         }
1457 }
1458
1459 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1460 {
1461         loadmodel->brushq1.num_compressedpvs = 0;
1462         loadmodel->brushq1.data_compressedpvs = NULL;
1463         if (!l->filelen)
1464                 return;
1465         loadmodel->brushq1.num_compressedpvs = l->filelen;
1466         loadmodel->brushq1.data_compressedpvs = Mem_Alloc(loadmodel->mempool, l->filelen);
1467         memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1468 }
1469
1470 // used only for HalfLife maps
1471 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1472 {
1473         char key[128], value[4096];
1474         char wadname[128];
1475         int i, j, k;
1476         if (!data)
1477                 return;
1478         if (!COM_ParseToken(&data, false))
1479                 return; // error
1480         if (com_token[0] != '{')
1481                 return; // error
1482         while (1)
1483         {
1484                 if (!COM_ParseToken(&data, false))
1485                         return; // error
1486                 if (com_token[0] == '}')
1487                         break; // end of worldspawn
1488                 if (com_token[0] == '_')
1489                         strcpy(key, com_token + 1);
1490                 else
1491                         strcpy(key, com_token);
1492                 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1493                         key[strlen(key)-1] = 0;
1494                 if (!COM_ParseToken(&data, false))
1495                         return; // error
1496                 strcpy(value, com_token);
1497                 if (!strcmp("wad", key)) // for HalfLife maps
1498                 {
1499                         if (loadmodel->brush.ishlbsp)
1500                         {
1501                                 j = 0;
1502                                 for (i = 0;i < 4096;i++)
1503                                         if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1504                                                 break;
1505                                 if (value[i])
1506                                 {
1507                                         for (;i < 4096;i++)
1508                                         {
1509                                                 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1510                                                 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1511                                                         j = i+1;
1512                                                 else if (value[i] == ';' || value[i] == 0)
1513                                                 {
1514                                                         k = value[i];
1515                                                         value[i] = 0;
1516                                                         strcpy(wadname, "textures/");
1517                                                         strcat(wadname, &value[j]);
1518                                                         W_LoadTextureWadFile(wadname, false);
1519                                                         j = i+1;
1520                                                         if (!k)
1521                                                                 break;
1522                                                 }
1523                                         }
1524                                 }
1525                         }
1526                 }
1527         }
1528 }
1529
1530 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1531 {
1532         loadmodel->brush.entities = NULL;
1533         if (!l->filelen)
1534                 return;
1535         loadmodel->brush.entities = Mem_Alloc(loadmodel->mempool, l->filelen);
1536         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1537         if (loadmodel->brush.ishlbsp)
1538                 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1539 }
1540
1541
1542 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1543 {
1544         dvertex_t       *in;
1545         mvertex_t       *out;
1546         int                     i, count;
1547
1548         in = (void *)(mod_base + l->fileofs);
1549         if (l->filelen % sizeof(*in))
1550                 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1551         count = l->filelen / sizeof(*in);
1552         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1553
1554         loadmodel->brushq1.vertexes = out;
1555         loadmodel->brushq1.numvertexes = count;
1556
1557         for ( i=0 ; i<count ; i++, in++, out++)
1558         {
1559                 out->position[0] = LittleFloat(in->point[0]);
1560                 out->position[1] = LittleFloat(in->point[1]);
1561                 out->position[2] = LittleFloat(in->point[2]);
1562         }
1563 }
1564
1565 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, dhullinfo_t *hullinfo)
1566 {
1567         byte            *index;
1568         dmodel_t        *out;
1569         int                     i, j, count;
1570
1571         index = (byte *)(mod_base + l->fileofs);
1572         if (l->filelen % (48+4*hullinfo->filehulls))
1573                 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1574
1575         count = l->filelen / (48+4*hullinfo->filehulls);
1576         out = Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1577
1578         loadmodel->brushq1.submodels = out;
1579         loadmodel->brush.numsubmodels = count;
1580
1581         for (i = 0; i < count; i++, out++)
1582         {
1583         // spread out the mins / maxs by a pixel
1584                 out->mins[0] = LittleFloat(*(float*)index) - 1; index += 4;
1585                 out->mins[1] = LittleFloat(*(float*)index) - 1; index += 4;
1586                 out->mins[2] = LittleFloat(*(float*)index) - 1; index += 4;
1587                 out->maxs[0] = LittleFloat(*(float*)index) + 1; index += 4;
1588                 out->maxs[1] = LittleFloat(*(float*)index) + 1; index += 4;
1589                 out->maxs[2] = LittleFloat(*(float*)index) + 1; index += 4;
1590                 out->origin[0] = LittleFloat (*(float*)index); index += 4;
1591                 out->origin[1] = LittleFloat (*(float*)index); index += 4;
1592                 out->origin[2] = LittleFloat (*(float*)index); index += 4;
1593                 for (j = 0; j < hullinfo->filehulls; j++)
1594                 {
1595                         out->headnode[j] = LittleLong (*(int*)index);
1596                         index += 4;
1597                 }
1598                 out->visleafs = LittleLong (*(int*)index); index += 4;
1599                 out->firstface = LittleLong (*(int*)index); index += 4;
1600                 out->numfaces = LittleLong (*(int*)index); index += 4;
1601         }
1602 }
1603
1604 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1605 {
1606         dedge_t *in;
1607         medge_t *out;
1608         int     i, count;
1609
1610         in = (void *)(mod_base + l->fileofs);
1611         if (l->filelen % sizeof(*in))
1612                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1613         count = l->filelen / sizeof(*in);
1614         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1615
1616         loadmodel->brushq1.edges = out;
1617         loadmodel->brushq1.numedges = count;
1618
1619         for ( i=0 ; i<count ; i++, in++, out++)
1620         {
1621                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1622                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1623         }
1624 }
1625
1626 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1627 {
1628         texinfo_t *in;
1629         mtexinfo_t *out;
1630         int i, j, k, count, miptex;
1631
1632         in = (void *)(mod_base + l->fileofs);
1633         if (l->filelen % sizeof(*in))
1634                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1635         count = l->filelen / sizeof(*in);
1636         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1637
1638         loadmodel->brushq1.texinfo = out;
1639         loadmodel->brushq1.numtexinfo = count;
1640
1641         for (i = 0;i < count;i++, in++, out++)
1642         {
1643                 for (k = 0;k < 2;k++)
1644                         for (j = 0;j < 4;j++)
1645                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1646
1647                 miptex = LittleLong(in->miptex);
1648                 out->flags = LittleLong(in->flags);
1649
1650                 out->texture = NULL;
1651                 if (loadmodel->data_textures)
1652                 {
1653                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1654                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1655                         else
1656                                 out->texture = loadmodel->data_textures + miptex;
1657                 }
1658                 if (out->flags & TEX_SPECIAL)
1659                 {
1660                         // if texture chosen is NULL or the shader needs a lightmap,
1661                         // force to notexture water shader
1662                         if (out->texture == NULL || out->texture->basematerialflags & MATERIALFLAG_WALL)
1663                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1664                 }
1665                 else
1666                 {
1667                         // if texture chosen is NULL, force to notexture
1668                         if (out->texture == NULL)
1669                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1670                 }
1671         }
1672 }
1673
1674 #if 0
1675 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1676 {
1677         int             i, j;
1678         float   *v;
1679
1680         mins[0] = mins[1] = mins[2] = 9999;
1681         maxs[0] = maxs[1] = maxs[2] = -9999;
1682         v = verts;
1683         for (i = 0;i < numverts;i++)
1684         {
1685                 for (j = 0;j < 3;j++, v++)
1686                 {
1687                         if (*v < mins[j])
1688                                 mins[j] = *v;
1689                         if (*v > maxs[j])
1690                                 maxs[j] = *v;
1691                 }
1692         }
1693 }
1694
1695 #define MAX_SUBDIVPOLYTRIANGLES 4096
1696 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
1697
1698 static int subdivpolyverts, subdivpolytriangles;
1699 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
1700 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
1701
1702 static int subdivpolylookupvert(vec3_t v)
1703 {
1704         int i;
1705         for (i = 0;i < subdivpolyverts;i++)
1706                 if (subdivpolyvert[i][0] == v[0]
1707                  && subdivpolyvert[i][1] == v[1]
1708                  && subdivpolyvert[i][2] == v[2])
1709                         return i;
1710         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
1711                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
1712         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
1713         return subdivpolyverts++;
1714 }
1715
1716 static void SubdividePolygon(int numverts, float *verts)
1717 {
1718         int             i, i1, i2, i3, f, b, c, p;
1719         vec3_t  mins, maxs, front[256], back[256];
1720         float   m, *pv, *cv, dist[256], frac;
1721
1722         if (numverts > 250)
1723                 Host_Error("SubdividePolygon: ran out of verts in buffer");
1724
1725         BoundPoly(numverts, verts, mins, maxs);
1726
1727         for (i = 0;i < 3;i++)
1728         {
1729                 m = (mins[i] + maxs[i]) * 0.5;
1730                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
1731                 if (maxs[i] - m < 8)
1732                         continue;
1733                 if (m - mins[i] < 8)
1734                         continue;
1735
1736                 // cut it
1737                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
1738                         dist[c] = cv[i] - m;
1739
1740                 f = b = 0;
1741                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
1742                 {
1743                         if (dist[p] >= 0)
1744                         {
1745                                 VectorCopy(pv, front[f]);
1746                                 f++;
1747                         }
1748                         if (dist[p] <= 0)
1749                         {
1750                                 VectorCopy(pv, back[b]);
1751                                 b++;
1752                         }
1753                         if (dist[p] == 0 || dist[c] == 0)
1754                                 continue;
1755                         if ((dist[p] > 0) != (dist[c] > 0) )
1756                         {
1757                                 // clip point
1758                                 frac = dist[p] / (dist[p] - dist[c]);
1759                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
1760                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
1761                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
1762                                 f++;
1763                                 b++;
1764                         }
1765                 }
1766
1767                 SubdividePolygon(f, front[0]);
1768                 SubdividePolygon(b, back[0]);
1769                 return;
1770         }
1771
1772         i1 = subdivpolylookupvert(verts);
1773         i2 = subdivpolylookupvert(verts + 3);
1774         for (i = 2;i < numverts;i++)
1775         {
1776                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
1777                 {
1778                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
1779                         return;
1780                 }
1781
1782                 i3 = subdivpolylookupvert(verts + i * 3);
1783                 subdivpolyindex[subdivpolytriangles][0] = i1;
1784                 subdivpolyindex[subdivpolytriangles][1] = i2;
1785                 subdivpolyindex[subdivpolytriangles][2] = i3;
1786                 i2 = i3;
1787                 subdivpolytriangles++;
1788         }
1789 }
1790
1791 //Breaks a polygon up along axial 64 unit
1792 //boundaries so that turbulent and sky warps
1793 //can be done reasonably.
1794 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
1795 {
1796         int i, j;
1797         surfvertex_t *v;
1798         surfmesh_t *mesh;
1799
1800         subdivpolytriangles = 0;
1801         subdivpolyverts = 0;
1802         SubdividePolygon(surface->num_vertices, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex));
1803         if (subdivpolytriangles < 1)
1804                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?\n");
1805
1806         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
1807         mesh->num_vertices = subdivpolyverts;
1808         mesh->num_triangles = subdivpolytriangles;
1809         mesh->vertex = (surfvertex_t *)(mesh + 1);
1810         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
1811         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
1812
1813         for (i = 0;i < mesh->num_triangles;i++)
1814                 for (j = 0;j < 3;j++)
1815                         mesh->index[i*3+j] = subdivpolyindex[i][j];
1816
1817         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
1818         {
1819                 VectorCopy(subdivpolyvert[i], v->v);
1820                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
1821                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
1822         }
1823 }
1824 #endif
1825
1826 static void Mod_Q1BSP_LoadFaces(lump_t *l)
1827 {
1828         dface_t *in;
1829         msurface_t *surface;
1830         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris;
1831         float texmins[2], texmaxs[2], val;
1832
1833         in = (void *)(mod_base + l->fileofs);
1834         if (l->filelen % sizeof(*in))
1835                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
1836         count = l->filelen / sizeof(*in);
1837         loadmodel->data_surfaces = Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
1838         loadmodel->data_surfaces_lightmapinfo = Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
1839
1840         loadmodel->num_surfaces = count;
1841
1842         totalverts = 0;
1843         totaltris = 0;
1844         for (surfacenum = 0, in = (void *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
1845         {
1846                 numedges = LittleShort(in->numedges);
1847                 totalverts += numedges;
1848                 totaltris += numedges - 2;
1849         }
1850
1851         // TODO: split up into multiple meshes as needed to avoid exceeding 65536
1852         // vertex limit
1853         loadmodel->nummeshes = 1;
1854         loadmodel->meshlist = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *));
1855         loadmodel->meshlist[0] = Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
1856
1857         totalverts = 0;
1858         totaltris = 0;
1859         for (surfacenum = 0, in = (void *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
1860         {
1861                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
1862
1863                 // FIXME: validate edges, texinfo, etc?
1864                 firstedge = LittleLong(in->firstedge);
1865                 numedges = LittleShort(in->numedges);
1866                 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)
1867                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)\n", firstedge, numedges, loadmodel->brushq1.numsurfedges);
1868                 i = LittleShort(in->texinfo);
1869                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
1870                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)\n", i, loadmodel->brushq1.numtexinfo);
1871                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
1872                 surface->texture = surface->lightmapinfo->texinfo->texture;
1873
1874                 planenum = LittleShort(in->planenum);
1875                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
1876                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)\n", planenum, loadmodel->brush.num_planes);
1877
1878                 //surface->flags = surface->texture->flags;
1879                 //if (LittleShort(in->side))
1880                 //      surface->flags |= SURF_PLANEBACK;
1881                 //surface->plane = loadmodel->brush.data_planes + planenum;
1882
1883                 surface->groupmesh = loadmodel->meshlist[0];
1884                 surface->num_firstvertex = totalverts;
1885                 surface->num_vertices = numedges;
1886                 surface->num_firsttriangle = totaltris;
1887                 surface->num_triangles = numedges - 2;
1888                 totalverts += numedges;
1889                 totaltris += numedges - 2;
1890
1891                 // convert edges back to a normal polygon
1892                 for (i = 0;i < surface->num_vertices;i++)
1893                 {
1894                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
1895                         float s, t;
1896                         if (lindex > 0)
1897                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
1898                         else
1899                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
1900                         s = DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
1901                         t = DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
1902                         (surface->groupmesh->data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
1903                         (surface->groupmesh->data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
1904                         (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
1905                         (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
1906                         (surface->groupmesh->data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
1907                 }
1908
1909                 for (i = 0;i < surface->num_triangles;i++)
1910                 {
1911                         (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
1912                         (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
1913                         (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
1914                 }
1915
1916                 // compile additional data about the surface geometry
1917                 Mod_BuildTextureVectorsAndNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, surface->groupmesh->data_vertex3f, surface->groupmesh->data_texcoordtexture2f, (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle), surface->groupmesh->data_svector3f, surface->groupmesh->data_tvector3f, surface->groupmesh->data_normal3f, true);
1918                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex));
1919
1920                 // generate surface extents information
1921                 texmins[0] = texmaxs[0] = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
1922                 texmins[1] = texmaxs[1] = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
1923                 for (i = 1;i < surface->num_vertices;i++)
1924                 {
1925                         for (j = 0;j < 2;j++)
1926                         {
1927                                 val = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
1928                                 texmins[j] = min(texmins[j], val);
1929                                 texmaxs[j] = max(texmaxs[j], val);
1930                         }
1931                 }
1932                 for (i = 0;i < 2;i++)
1933                 {
1934                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
1935                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
1936                 }
1937
1938                 smax = surface->lightmapinfo->extents[0] >> 4;
1939                 tmax = surface->lightmapinfo->extents[1] >> 4;
1940                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
1941                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
1942
1943                 // lighting info
1944                 for (i = 0;i < MAXLIGHTMAPS;i++)
1945                         surface->lightmapinfo->styles[i] = in->styles[i];
1946                 // force lightmap upload on first time seeing the surface
1947                 surface->cached_dlight = true;
1948                 surface->lightmapinfo->lightmaptexturestride = 0;
1949                 surface->lightmaptexture = NULL;
1950                 i = LittleLong(in->lightofs);
1951                 if (i == -1)
1952                 {
1953                         surface->lightmapinfo->samples = NULL;
1954                         // give non-lightmapped water a 1x white lightmap
1955                         if ((surface->texture->basematerialflags & MATERIALFLAG_WATER) && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
1956                         {
1957                                 surface->lightmapinfo->samples = Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
1958                                 surface->lightmapinfo->styles[0] = 0;
1959                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
1960                         }
1961                 }
1962                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
1963                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
1964                 else // LordHavoc: white lighting (bsp version 29)
1965                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
1966
1967                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
1968                 {
1969                         int i, iu, iv;
1970                         float u, v, ubase, vbase, uscale, vscale;
1971
1972                         if (ssize > 256 || tsize > 256)
1973                                 Host_Error("Bad surface extents");
1974                         // stainmap for permanent marks on walls
1975                         surface->lightmapinfo->stainsamples = Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
1976                         // clear to white
1977                         memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
1978
1979                         if (r_miplightmaps.integer)
1980                         {
1981                                 surface->lightmapinfo->lightmaptexturestride = ssize;
1982                                 surface->lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, NULL, surface->lightmapinfo->lightmaptexturestride, tsize, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_MIPMAP | TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
1983                         }
1984                         else
1985                         {
1986                                 surface->lightmapinfo->lightmaptexturestride = R_CompatibleFragmentWidth(ssize, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, 0);
1987                                 surface->lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, NULL, surface->lightmapinfo->lightmaptexturestride, tsize, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FRAGMENT | TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
1988                         }
1989                         R_FragmentLocation(surface->lightmaptexture, NULL, NULL, &ubase, &vbase, &uscale, &vscale);
1990                         uscale = (uscale - ubase) / ssize;
1991                         vscale = (vscale - vbase) / tsize;
1992
1993                         for (i = 0;i < surface->num_vertices;i++)
1994                         {
1995                                 u = ((DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3]) + 8 - surface->lightmapinfo->texturemins[0]) * (1.0 / 16.0);
1996                                 v = ((DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3]) + 8 - surface->lightmapinfo->texturemins[1]) * (1.0 / 16.0);
1997                                 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
1998                                 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
1999                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
2000                                 iu = (int) u;
2001                                 iv = (int) v;
2002                                 (surface->groupmesh->data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2003                         }
2004                 }
2005         }
2006 }
2007
2008 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2009 {
2010         //if (node->parent)
2011         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion\n");
2012         node->parent = parent;
2013         if (node->plane)
2014         {
2015                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2016                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2017         }
2018 }
2019
2020 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2021 {
2022         int                     i, j, count, p;
2023         dnode_t         *in;
2024         mnode_t         *out;
2025
2026         in = (void *)(mod_base + l->fileofs);
2027         if (l->filelen % sizeof(*in))
2028                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2029         count = l->filelen / sizeof(*in);
2030         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2031
2032         loadmodel->brush.data_nodes = out;
2033         loadmodel->brush.num_nodes = count;
2034
2035         for ( i=0 ; i<count ; i++, in++, out++)
2036         {
2037                 for (j=0 ; j<3 ; j++)
2038                 {
2039                         out->mins[j] = LittleShort(in->mins[j]);
2040                         out->maxs[j] = LittleShort(in->maxs[j]);
2041                 }
2042
2043                 p = LittleLong(in->planenum);
2044                 out->plane = loadmodel->brush.data_planes + p;
2045
2046                 out->firstsurface = LittleShort(in->firstface);
2047                 out->numsurfaces = LittleShort(in->numfaces);
2048
2049                 for (j=0 ; j<2 ; j++)
2050                 {
2051                         p = LittleShort(in->children[j]);
2052                         if (p >= 0)
2053                                 out->children[j] = loadmodel->brush.data_nodes + p;
2054                         else
2055                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + (-1 - p));
2056                 }
2057         }
2058
2059         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2060 }
2061
2062 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2063 {
2064         dleaf_t *in;
2065         mleaf_t *out;
2066         int i, j, count, p;
2067
2068         in = (void *)(mod_base + l->fileofs);
2069         if (l->filelen % sizeof(*in))
2070                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2071         count = l->filelen / sizeof(*in);
2072         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2073
2074         loadmodel->brush.data_leafs = out;
2075         loadmodel->brush.num_leafs = count;
2076         // get visleafs from the submodel data
2077         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2078         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2079         loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2080         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2081
2082         for ( i=0 ; i<count ; i++, in++, out++)
2083         {
2084                 for (j=0 ; j<3 ; j++)
2085                 {
2086                         out->mins[j] = LittleShort(in->mins[j]);
2087                         out->maxs[j] = LittleShort(in->maxs[j]);
2088                 }
2089
2090                 // FIXME: this function could really benefit from some error checking
2091
2092                 out->contents = LittleLong(in->contents);
2093
2094                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + LittleShort(in->firstmarksurface);
2095                 out->numleafsurfaces = LittleShort(in->nummarksurfaces);
2096                 if (out->firstleafsurface < 0 || LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2097                 {
2098                         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);
2099                         out->firstleafsurface = NULL;
2100                         out->numleafsurfaces = 0;
2101                 }
2102
2103                 out->clusterindex = i - 1;
2104                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2105                         out->clusterindex = -1;
2106
2107                 p = LittleLong(in->visofs);
2108                 // ignore visofs errors on leaf 0 (solid)
2109                 if (p >= 0 && out->clusterindex >= 0)
2110                 {
2111                         if (p >= loadmodel->brushq1.num_compressedpvs)
2112                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2113                         else
2114                                 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);
2115                 }
2116
2117                 for (j = 0;j < 4;j++)
2118                         out->ambient_sound_level[j] = in->ambient_level[j];
2119
2120                 // FIXME: Insert caustics here
2121         }
2122 }
2123
2124 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, dhullinfo_t *hullinfo)
2125 {
2126         dclipnode_t *in, *out;
2127         int                     i, count;
2128         hull_t          *hull;
2129
2130         in = (void *)(mod_base + l->fileofs);
2131         if (l->filelen % sizeof(*in))
2132                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2133         count = l->filelen / sizeof(*in);
2134         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2135
2136         loadmodel->brushq1.clipnodes = out;
2137         loadmodel->brushq1.numclipnodes = count;
2138
2139         for (i = 1; i < hullinfo->numhulls; i++)
2140         {
2141                 hull = &loadmodel->brushq1.hulls[i];
2142                 hull->clipnodes = out;
2143                 hull->firstclipnode = 0;
2144                 hull->lastclipnode = count-1;
2145                 hull->planes = loadmodel->brush.data_planes;
2146                 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2147                 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2148                 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2149                 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2150                 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2151                 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2152                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2153         }
2154
2155         for (i=0 ; i<count ; i++, out++, in++)
2156         {
2157                 out->planenum = LittleLong(in->planenum);
2158                 out->children[0] = LittleShort(in->children[0]);
2159                 out->children[1] = LittleShort(in->children[1]);
2160                 if (out->children[0] >= count || out->children[1] >= count)
2161                         Host_Error("Corrupt clipping hull(out of range child)\n");
2162         }
2163 }
2164
2165 //Duplicate the drawing hull structure as a clipping hull
2166 static void Mod_Q1BSP_MakeHull0(void)
2167 {
2168         mnode_t         *in;
2169         dclipnode_t *out;
2170         int                     i;
2171         hull_t          *hull;
2172
2173         hull = &loadmodel->brushq1.hulls[0];
2174
2175         in = loadmodel->brush.data_nodes;
2176         out = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(dclipnode_t));
2177
2178         hull->clipnodes = out;
2179         hull->firstclipnode = 0;
2180         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2181         hull->planes = loadmodel->brush.data_planes;
2182
2183         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2184         {
2185                 out->planenum = in->plane - loadmodel->brush.data_planes;
2186                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2187                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2188         }
2189 }
2190
2191 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2192 {
2193         int i, j;
2194         short *in;
2195
2196         in = (void *)(mod_base + l->fileofs);
2197         if (l->filelen % sizeof(*in))
2198                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2199         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2200         loadmodel->brush.data_leafsurfaces = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2201
2202         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2203         {
2204                 j = (unsigned) LittleShort(in[i]);
2205                 if (j >= loadmodel->num_surfaces)
2206                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2207                 loadmodel->brush.data_leafsurfaces[i] = j;
2208         }
2209 }
2210
2211 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2212 {
2213         int             i;
2214         int             *in;
2215
2216         in = (void *)(mod_base + l->fileofs);
2217         if (l->filelen % sizeof(*in))
2218                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2219         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2220         loadmodel->brushq1.surfedges = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2221
2222         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2223                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2224 }
2225
2226
2227 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2228 {
2229         int                     i;
2230         mplane_t        *out;
2231         dplane_t        *in;
2232
2233         in = (void *)(mod_base + l->fileofs);
2234         if (l->filelen % sizeof(*in))
2235                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2236
2237         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2238         loadmodel->brush.data_planes = out = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2239
2240         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2241         {
2242                 out->normal[0] = LittleFloat(in->normal[0]);
2243                 out->normal[1] = LittleFloat(in->normal[1]);
2244                 out->normal[2] = LittleFloat(in->normal[2]);
2245                 out->dist = LittleFloat(in->dist);
2246
2247                 PlaneClassify(out);
2248         }
2249 }
2250
2251 static void Mod_Q1BSP_LoadMapBrushes(void)
2252 {
2253 #if 0
2254 // unfinished
2255         int submodel, numbrushes;
2256         qboolean firstbrush;
2257         char *text, *maptext;
2258         char mapfilename[MAX_QPATH];
2259         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2260         strlcat (mapfilename, ".map", sizeof (mapfilename));
2261         maptext = (qbyte*) FS_LoadFile(mapfilename, tempmempool, false);
2262         if (!maptext)
2263                 return;
2264         text = maptext;
2265         if (!COM_ParseToken(&data, false))
2266                 return; // error
2267         submodel = 0;
2268         for (;;)
2269         {
2270                 if (!COM_ParseToken(&data, false))
2271                         break;
2272                 if (com_token[0] != '{')
2273                         return; // error
2274                 // entity
2275                 firstbrush = true;
2276                 numbrushes = 0;
2277                 maxbrushes = 256;
2278                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2279                 for (;;)
2280                 {
2281                         if (!COM_ParseToken(&data, false))
2282                                 return; // error
2283                         if (com_token[0] == '}')
2284                                 break; // end of entity
2285                         if (com_token[0] == '{')
2286                         {
2287                                 // brush
2288                                 if (firstbrush)
2289                                 {
2290                                         if (submodel)
2291                                         {
2292                                                 if (submodel > loadmodel->brush.numsubmodels)
2293                                                 {
2294                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2295                                                         model = NULL;
2296                                                 }
2297                                                 else
2298                                                         model = loadmodel->brush.submodels[submodel];
2299                                         }
2300                                         else
2301                                                 model = loadmodel;
2302                                 }
2303                                 for (;;)
2304                                 {
2305                                         if (!COM_ParseToken(&data, false))
2306                                                 return; // error
2307                                         if (com_token[0] == '}')
2308                                                 break; // end of brush
2309                                         // each brush face should be this format:
2310                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2311                                         // FIXME: support hl .map format
2312                                         for (pointnum = 0;pointnum < 3;pointnum++)
2313                                         {
2314                                                 COM_ParseToken(&data, false);
2315                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2316                                                 {
2317                                                         COM_ParseToken(&data, false);
2318                                                         point[pointnum][componentnum] = atof(com_token);
2319                                                 }
2320                                                 COM_ParseToken(&data, false);
2321                                         }
2322                                         COM_ParseToken(&data, false);
2323                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2324                                         COM_ParseToken(&data, false);
2325                                         //scroll_s = atof(com_token);
2326                                         COM_ParseToken(&data, false);
2327                                         //scroll_t = atof(com_token);
2328                                         COM_ParseToken(&data, false);
2329                                         //rotate = atof(com_token);
2330                                         COM_ParseToken(&data, false);
2331                                         //scale_s = atof(com_token);
2332                                         COM_ParseToken(&data, false);
2333                                         //scale_t = atof(com_token);
2334                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2335                                         VectorNormalizeDouble(planenormal);
2336                                         planedist = DotProduct(point[0], planenormal);
2337                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2338                                 }
2339                                 continue;
2340                         }
2341                 }
2342         }
2343 #endif
2344 }
2345
2346
2347 #define MAX_PORTALPOINTS 64
2348
2349 typedef struct portal_s
2350 {
2351         mplane_t plane;
2352         mnode_t *nodes[2];              // [0] = front side of plane
2353         struct portal_s *next[2];
2354         int numpoints;
2355         double points[3*MAX_PORTALPOINTS];
2356         struct portal_s *chain; // all portals are linked into a list
2357 }
2358 portal_t;
2359
2360 static portal_t *portalchain;
2361
2362 /*
2363 ===========
2364 AllocPortal
2365 ===========
2366 */
2367 static portal_t *AllocPortal(void)
2368 {
2369         portal_t *p;
2370         p = Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2371         p->chain = portalchain;
2372         portalchain = p;
2373         return p;
2374 }
2375
2376 static void FreePortal(portal_t *p)
2377 {
2378         Mem_Free(p);
2379 }
2380
2381 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2382 {
2383         // process only nodes (leafs already had their box calculated)
2384         if (!node->plane)
2385                 return;
2386
2387         // calculate children first
2388         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2389         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2390
2391         // make combined bounding box from children
2392         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2393         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2394         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2395         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2396         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2397         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2398 }
2399
2400 static void Mod_Q1BSP_FinalizePortals(void)
2401 {
2402         int i, j, numportals, numpoints;
2403         portal_t *p, *pnext;
2404         mportal_t *portal;
2405         mvertex_t *point;
2406         mleaf_t *leaf, *endleaf;
2407
2408         // recalculate bounding boxes for all leafs(because qbsp is very sloppy)
2409         leaf = loadmodel->brush.data_leafs;
2410         endleaf = leaf + loadmodel->brush.num_leafs;
2411         for (;leaf < endleaf;leaf++)
2412         {
2413                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
2414                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2415         }
2416         p = portalchain;
2417         while (p)
2418         {
2419                 if (p->numpoints >= 3)
2420                 {
2421                         for (i = 0;i < 2;i++)
2422                         {
2423                                 leaf = (mleaf_t *)p->nodes[i];
2424                                 for (j = 0;j < p->numpoints;j++)
2425                                 {
2426                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
2427                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
2428                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
2429                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
2430                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
2431                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
2432                                 }
2433                         }
2434                 }
2435                 p = p->chain;
2436         }
2437
2438         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
2439
2440         // tally up portal and point counts
2441         p = portalchain;
2442         numportals = 0;
2443         numpoints = 0;
2444         while (p)
2445         {
2446                 // note: this check must match the one below or it will usually corrupt memory
2447                 // 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
2448                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2449                 {
2450                         numportals += 2;
2451                         numpoints += p->numpoints * 2;
2452                 }
2453                 p = p->chain;
2454         }
2455         loadmodel->brush.data_portals = Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2456         loadmodel->brush.num_portals = numportals;
2457         loadmodel->brush.data_portalpoints = (void *)((qbyte *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2458         loadmodel->brush.num_portalpoints = numpoints;
2459         // clear all leaf portal chains
2460         for (i = 0;i < loadmodel->brush.num_leafs;i++)
2461                 loadmodel->brush.data_leafs[i].portals = NULL;
2462         // process all portals in the global portal chain, while freeing them
2463         portal = loadmodel->brush.data_portals;
2464         point = loadmodel->brush.data_portalpoints;
2465         p = portalchain;
2466         portalchain = NULL;
2467         while (p)
2468         {
2469                 pnext = p->chain;
2470
2471                 // note: this check must match the one above or it will usually corrupt memory
2472                 // 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
2473                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2474                 {
2475                         // first make the back to front portal(forward portal)
2476                         portal->points = point;
2477                         portal->numpoints = p->numpoints;
2478                         portal->plane.dist = p->plane.dist;
2479                         VectorCopy(p->plane.normal, portal->plane.normal);
2480                         portal->here = (mleaf_t *)p->nodes[1];
2481                         portal->past = (mleaf_t *)p->nodes[0];
2482                         // copy points
2483                         for (j = 0;j < portal->numpoints;j++)
2484                         {
2485                                 VectorCopy(p->points + j*3, point->position);
2486                                 point++;
2487                         }
2488                         BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2489                         PlaneClassify(&portal->plane);
2490
2491                         // link into leaf's portal chain
2492                         portal->next = portal->here->portals;
2493                         portal->here->portals = portal;
2494
2495                         // advance to next portal
2496                         portal++;
2497
2498                         // then make the front to back portal(backward portal)
2499                         portal->points = point;
2500                         portal->numpoints = p->numpoints;
2501                         portal->plane.dist = -p->plane.dist;
2502                         VectorNegate(p->plane.normal, portal->plane.normal);
2503                         portal->here = (mleaf_t *)p->nodes[0];
2504                         portal->past = (mleaf_t *)p->nodes[1];
2505                         // copy points
2506                         for (j = portal->numpoints - 1;j >= 0;j--)
2507                         {
2508                                 VectorCopy(p->points + j*3, point->position);
2509                                 point++;
2510                         }
2511                         BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2512                         PlaneClassify(&portal->plane);
2513
2514                         // link into leaf's portal chain
2515                         portal->next = portal->here->portals;
2516                         portal->here->portals = portal;
2517
2518                         // advance to next portal
2519                         portal++;
2520                 }
2521                 FreePortal(p);
2522                 p = pnext;
2523         }
2524 }
2525
2526 /*
2527 =============
2528 AddPortalToNodes
2529 =============
2530 */
2531 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2532 {
2533         if (!front)
2534                 Host_Error("AddPortalToNodes: NULL front node");
2535         if (!back)
2536                 Host_Error("AddPortalToNodes: NULL back node");
2537         if (p->nodes[0] || p->nodes[1])
2538                 Host_Error("AddPortalToNodes: already included");
2539         // 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
2540
2541         p->nodes[0] = front;
2542         p->next[0] = (portal_t *)front->portals;
2543         front->portals = (mportal_t *)p;
2544
2545         p->nodes[1] = back;
2546         p->next[1] = (portal_t *)back->portals;
2547         back->portals = (mportal_t *)p;
2548 }
2549
2550 /*
2551 =============
2552 RemovePortalFromNode
2553 =============
2554 */
2555 static void RemovePortalFromNodes(portal_t *portal)
2556 {
2557         int i;
2558         mnode_t *node;
2559         void **portalpointer;
2560         portal_t *t;
2561         for (i = 0;i < 2;i++)
2562         {
2563                 node = portal->nodes[i];
2564
2565                 portalpointer = (void **) &node->portals;
2566                 while (1)
2567                 {
2568                         t = *portalpointer;
2569                         if (!t)
2570                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
2571
2572                         if (t == portal)
2573                         {
2574                                 if (portal->nodes[0] == node)
2575                                 {
2576                                         *portalpointer = portal->next[0];
2577                                         portal->nodes[0] = NULL;
2578                                 }
2579                                 else if (portal->nodes[1] == node)
2580                                 {
2581                                         *portalpointer = portal->next[1];
2582                                         portal->nodes[1] = NULL;
2583                                 }
2584                                 else
2585                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2586                                 break;
2587                         }
2588
2589                         if (t->nodes[0] == node)
2590                                 portalpointer = (void **) &t->next[0];
2591                         else if (t->nodes[1] == node)
2592                                 portalpointer = (void **) &t->next[1];
2593                         else
2594                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2595                 }
2596         }
2597 }
2598
2599 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
2600 {
2601         int i, side;
2602         mnode_t *front, *back, *other_node;
2603         mplane_t clipplane, *plane;
2604         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
2605         int numfrontpoints, numbackpoints;
2606         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
2607
2608         // if a leaf, we're done
2609         if (!node->plane)
2610                 return;
2611
2612         plane = node->plane;
2613
2614         front = node->children[0];
2615         back = node->children[1];
2616         if (front == back)
2617                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
2618
2619         // create the new portal by generating a polygon for the node plane,
2620         // and clipping it by all of the other portals(which came from nodes above this one)
2621         nodeportal = AllocPortal();
2622         nodeportal->plane = *plane;
2623
2624         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);
2625         nodeportal->numpoints = 4;
2626         side = 0;       // shut up compiler warning
2627         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
2628         {
2629                 clipplane = portal->plane;
2630                 if (portal->nodes[0] == portal->nodes[1])
2631                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
2632                 if (portal->nodes[0] == node)
2633                         side = 0;
2634                 else if (portal->nodes[1] == node)
2635                 {
2636                         clipplane.dist = -clipplane.dist;
2637                         VectorNegate(clipplane.normal, clipplane.normal);
2638                         side = 1;
2639                 }
2640                 else
2641                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2642
2643                 for (i = 0;i < nodeportal->numpoints*3;i++)
2644                         frontpoints[i] = nodeportal->points[i];
2645                 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);
2646                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
2647                         break;
2648         }
2649
2650         if (nodeportal->numpoints < 3)
2651         {
2652                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
2653                 nodeportal->numpoints = 0;
2654         }
2655         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
2656         {
2657                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
2658                 nodeportal->numpoints = 0;
2659         }
2660
2661         AddPortalToNodes(nodeportal, front, back);
2662
2663         // split the portals of this node along this node's plane and assign them to the children of this node
2664         // (migrating the portals downward through the tree)
2665         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
2666         {
2667                 if (portal->nodes[0] == portal->nodes[1])
2668                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
2669                 if (portal->nodes[0] == node)
2670                         side = 0;
2671                 else if (portal->nodes[1] == node)
2672                         side = 1;
2673                 else
2674                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2675                 nextportal = portal->next[side];
2676                 if (!portal->numpoints)
2677                         continue;
2678
2679                 other_node = portal->nodes[!side];
2680                 RemovePortalFromNodes(portal);
2681
2682                 // cut the portal into two portals, one on each side of the node plane
2683                 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);
2684
2685                 if (!numfrontpoints)
2686                 {
2687                         if (side == 0)
2688                                 AddPortalToNodes(portal, back, other_node);
2689                         else
2690                                 AddPortalToNodes(portal, other_node, back);
2691                         continue;
2692                 }
2693                 if (!numbackpoints)
2694                 {
2695                         if (side == 0)
2696                                 AddPortalToNodes(portal, front, other_node);
2697                         else
2698                                 AddPortalToNodes(portal, other_node, front);
2699                         continue;
2700                 }
2701
2702                 // the portal is split
2703                 splitportal = AllocPortal();
2704                 temp = splitportal->chain;
2705                 *splitportal = *portal;
2706                 splitportal->chain = temp;
2707                 for (i = 0;i < numbackpoints*3;i++)
2708                         splitportal->points[i] = backpoints[i];
2709                 splitportal->numpoints = numbackpoints;
2710                 for (i = 0;i < numfrontpoints*3;i++)
2711                         portal->points[i] = frontpoints[i];
2712                 portal->numpoints = numfrontpoints;
2713
2714                 if (side == 0)
2715                 {
2716                         AddPortalToNodes(portal, front, other_node);
2717                         AddPortalToNodes(splitportal, back, other_node);
2718                 }
2719                 else
2720                 {
2721                         AddPortalToNodes(portal, other_node, front);
2722                         AddPortalToNodes(splitportal, other_node, back);
2723                 }
2724         }
2725
2726         Mod_Q1BSP_RecursiveNodePortals(front);
2727         Mod_Q1BSP_RecursiveNodePortals(back);
2728 }
2729
2730 static void Mod_Q1BSP_MakePortals(void)
2731 {
2732         portalchain = NULL;
2733         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
2734         Mod_Q1BSP_FinalizePortals();
2735 }
2736
2737 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
2738 {
2739         int i, j, stylecounts[256], totalcount, remapstyles[256];
2740         msurface_t *surface;
2741         memset(stylecounts, 0, sizeof(stylecounts));
2742         for (i = 0;i < model->nummodelsurfaces;i++)
2743         {
2744                 surface = model->data_surfaces + model->firstmodelsurface + i;
2745                 for (j = 0;j < MAXLIGHTMAPS;j++)
2746                         stylecounts[surface->lightmapinfo->styles[j]]++;
2747         }
2748         totalcount = 0;
2749         model->brushq1.light_styles = 0;
2750         for (i = 0;i < 255;i++)
2751         {
2752                 if (stylecounts[i])
2753                 {
2754                         remapstyles[i] = model->brushq1.light_styles++;
2755                         totalcount += stylecounts[i] + 1;
2756                 }
2757         }
2758         if (!totalcount)
2759                 return;
2760         model->brushq1.light_style = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(qbyte));
2761         model->brushq1.light_stylevalue = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
2762         model->brushq1.light_styleupdatechains = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
2763         model->brushq1.light_styleupdatechainsbuffer = Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
2764         model->brushq1.light_styles = 0;
2765         for (i = 0;i < 255;i++)
2766                 if (stylecounts[i])
2767                         model->brushq1.light_style[model->brushq1.light_styles++] = i;
2768         j = 0;
2769         for (i = 0;i < model->brushq1.light_styles;i++)
2770         {
2771                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2772                 j += stylecounts[model->brushq1.light_style[i]] + 1;
2773         }
2774         for (i = 0;i < model->nummodelsurfaces;i++)
2775         {
2776                 surface = model->data_surfaces + model->firstmodelsurface + i;
2777                 for (j = 0;j < MAXLIGHTMAPS;j++)
2778                         if (surface->lightmapinfo->styles[j] != 255)
2779                                 *model->brushq1.light_styleupdatechains[remapstyles[surface->lightmapinfo->styles[j]]]++ = surface;
2780         }
2781         j = 0;
2782         for (i = 0;i < model->brushq1.light_styles;i++)
2783         {
2784                 *model->brushq1.light_styleupdatechains[i] = NULL;
2785                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2786                 j += stylecounts[model->brushq1.light_style[i]] + 1;
2787         }
2788 }
2789
2790 //Returns PVS data for a given point
2791 //(note: can return NULL)
2792 static qbyte *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
2793 {
2794         mnode_t *node;
2795         Mod_CheckLoaded(model);
2796         node = model->brush.data_nodes;
2797         while (node->plane)
2798                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
2799         if (((mleaf_t *)node)->clusterindex >= 0)
2800                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2801         else
2802                 return NULL;
2803 }
2804
2805 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbytes, mnode_t *node)
2806 {
2807         while (node->plane)
2808         {
2809                 float d = PlaneDiff(org, node->plane);
2810                 if (d > radius)
2811                         node = node->children[0];
2812                 else if (d < -radius)
2813                         node = node->children[1];
2814                 else
2815                 {
2816                         // go down both sides
2817                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
2818                         node = node->children[1];
2819                 }
2820         }
2821         // if this leaf is in a cluster, accumulate the pvs bits
2822         if (((mleaf_t *)node)->clusterindex >= 0)
2823         {
2824                 int i;
2825                 qbyte *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2826                 for (i = 0;i < pvsbytes;i++)
2827                         pvsbuffer[i] |= pvs[i];
2828         }
2829 }
2830
2831 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
2832 //of the given point.
2833 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbufferlength)
2834 {
2835         int bytes = model->brush.num_pvsclusterbytes;
2836         bytes = min(bytes, pvsbufferlength);
2837         if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
2838         {
2839                 memset(pvsbuffer, 0xFF, bytes);
2840                 return bytes;
2841         }
2842         memset(pvsbuffer, 0, bytes);
2843         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
2844         return bytes;
2845 }
2846
2847 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
2848 {
2849         vec3_t size;
2850         const hull_t *hull;
2851
2852         VectorSubtract(inmaxs, inmins, size);
2853         if (cmodel->brush.ismcbsp)
2854         {
2855                 if (size[0] < 3)
2856                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2857                 else if (size[2] < 48) // pick the nearest of 40 or 56
2858                         hull = &cmodel->brushq1.hulls[2]; // 16x16x40
2859                 else
2860                         hull = &cmodel->brushq1.hulls[1]; // 16x16x56
2861         }
2862         else if (cmodel->brush.ishlbsp)
2863         {
2864                 if (size[0] < 3)
2865                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2866                 else if (size[0] <= 32)
2867                 {
2868                         if (size[2] < 54) // pick the nearest of 36 or 72
2869                                 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
2870                         else
2871                                 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
2872                 }
2873                 else
2874                         hull = &cmodel->brushq1.hulls[2]; // 64x64x64
2875         }
2876         else
2877         {
2878                 if (size[0] < 3)
2879                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2880                 else if (size[0] <= 32)
2881                         hull = &cmodel->brushq1.hulls[1]; // 32x32x56
2882                 else
2883                         hull = &cmodel->brushq1.hulls[2]; // 64x64x88
2884         }
2885         VectorCopy(inmins, outmins);
2886         VectorAdd(inmins, hull->clip_size, outmaxs);
2887 }
2888
2889 void Mod_Q1BSP_Load(model_t *mod, void *buffer, void *bufferend)
2890 {
2891         int i, j, k;
2892         dheader_t *header;
2893         dmodel_t *bm;
2894         mempool_t *mainmempool;
2895         float dist, modelyawradius, modelradius, *vec;
2896         msurface_t *surface;
2897         int numshadowmeshtriangles;
2898         dheader_t _header;
2899         dhullinfo_t hullinfo;
2900
2901         mod->type = mod_brushq1;
2902
2903         if (!memcmp (buffer, "MCBSP", 5))
2904         {
2905                 qbyte   *index;
2906
2907                 mod->brush.ismcbsp = true;
2908                 mod->brush.ishlbsp = false;
2909
2910                 mod_base = (qbyte*)buffer;
2911
2912                 index = mod_base;
2913                 index += 5;
2914                 i = LittleLong(*(int*)index); index += 4;
2915                 if (i != MCBSPVERSION)
2916                         Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i)", mod->name, i, MCBSPVERSION);
2917
2918         // read hull info
2919                 hullinfo.numhulls = LittleLong(*(int*)index); index += 4;
2920                 hullinfo.filehulls = hullinfo.numhulls;
2921                 VectorClear (hullinfo.hullsizes[0][0]);
2922                 VectorClear (hullinfo.hullsizes[0][1]);
2923                 for (i = 1; i < hullinfo.numhulls; i++)
2924                 {
2925                         hullinfo.hullsizes[i][0][0] = LittleFloat(*(float*)index); index += 4;
2926                         hullinfo.hullsizes[i][0][1] = LittleFloat(*(float*)index); index += 4;
2927                         hullinfo.hullsizes[i][0][2] = LittleFloat(*(float*)index); index += 4;
2928                         hullinfo.hullsizes[i][1][0] = LittleFloat(*(float*)index); index += 4;
2929                         hullinfo.hullsizes[i][1][1] = LittleFloat(*(float*)index); index += 4;
2930                         hullinfo.hullsizes[i][1][2] = LittleFloat(*(float*)index); index += 4;
2931                 }
2932
2933         // read lumps
2934                 _header.version = 0;
2935                 for (i = 0; i < HEADER_LUMPS; i++)
2936                 {
2937                         _header.lumps[i].fileofs = LittleLong(*(int*)index); index += 4;
2938                         _header.lumps[i].filelen = LittleLong(*(int*)index); index += 4;
2939                 }
2940
2941                 header = &_header;
2942         }
2943         else
2944         {
2945                 header = (dheader_t *)buffer;
2946
2947                 i = LittleLong(header->version);
2948                 if (i != BSPVERSION && i != 30)
2949                         Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
2950                 mod->brush.ishlbsp = i == 30;
2951                 mod->brush.ismcbsp = false;
2952
2953         // fill in hull info
2954                 VectorClear (hullinfo.hullsizes[0][0]);
2955                 VectorClear (hullinfo.hullsizes[0][1]);
2956                 if (mod->brush.ishlbsp)
2957                 {
2958                         hullinfo.numhulls = 4;
2959                         hullinfo.filehulls = 4;
2960                         VectorSet (hullinfo.hullsizes[0][0], -16, -16, -36);
2961                         VectorSet (hullinfo.hullsizes[0][1], 16, 16, 36);
2962                         VectorSet (hullinfo.hullsizes[1][0], -32, -32, -32);
2963                         VectorSet (hullinfo.hullsizes[1][1], 32, 32, 32);
2964                         VectorSet (hullinfo.hullsizes[2][0], -16, -16, -18);
2965                         VectorSet (hullinfo.hullsizes[2][1], 16, 16, 18);
2966                 }
2967                 else
2968                 {
2969                         hullinfo.numhulls = 3;
2970                         hullinfo.filehulls = 4;
2971                         VectorSet (hullinfo.hullsizes[0][0], -16, -16, -24);
2972                         VectorSet (hullinfo.hullsizes[0][1], 16, 16, 32);
2973                         VectorSet (hullinfo.hullsizes[1][0], -32, -32, -24);
2974                         VectorSet (hullinfo.hullsizes[1][1], 32, 32, 64);
2975                 }
2976
2977         // read lumps
2978                 mod_base = (qbyte*)buffer;
2979                 for (i = 0; i < HEADER_LUMPS; i++)
2980                 {
2981                         header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
2982                         header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
2983                 }
2984         }
2985
2986         mod->soundfromcenter = true;
2987         mod->TraceBox = Mod_Q1BSP_TraceBox;
2988         mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
2989         mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
2990         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
2991         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
2992         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
2993         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
2994         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
2995         mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
2996         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
2997         mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
2998         mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
2999         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3000
3001         if (loadmodel->isworldmodel)
3002         {
3003                 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3004                 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3005         }
3006
3007 // load into heap
3008
3009         // store which lightmap format to use
3010         mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3011
3012         Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3013         Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3014         Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3015         Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3016         Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3017         Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3018         Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3019         Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3020         Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3021         Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3022         Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3023         // load submodels before leafs because they contain the number of vis leafs
3024         Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3025         Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3026         Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3027         Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3028
3029         if (!mod->brushq1.lightdata)
3030                 mod->brush.LightPoint = NULL;
3031
3032         if (mod->brushq1.data_compressedpvs)
3033                 Mem_Free(mod->brushq1.data_compressedpvs);
3034         mod->brushq1.data_compressedpvs = NULL;
3035         mod->brushq1.num_compressedpvs = 0;
3036
3037         Mod_Q1BSP_MakeHull0();
3038         Mod_Q1BSP_MakePortals();
3039
3040         mod->numframes = 2;             // regular and alternate animation
3041         mod->numskins = 1;
3042
3043         mainmempool = mod->mempool;
3044
3045         Mod_Q1BSP_LoadLightList();
3046
3047         // make a single combined shadow mesh to allow optimized shadow volume creation
3048         numshadowmeshtriangles = 0;
3049         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3050         {
3051                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3052                 numshadowmeshtriangles += surface->num_triangles;
3053         }
3054         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3055         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3056                 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, surface->groupmesh->data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle));
3057         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
3058         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3059
3060         if (loadmodel->brush.numsubmodels)
3061                 loadmodel->brush.submodels = Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(model_t *));
3062
3063         if (loadmodel->isworldmodel)
3064         {
3065                 // clear out any stale submodels or worldmodels lying around
3066                 // if we did this clear before now, an error might abort loading and
3067                 // leave things in a bad state
3068                 Mod_RemoveStaleWorldModels(loadmodel);
3069         }
3070
3071         // LordHavoc: to clear the fog around the original quake submodel code, I
3072         // will explain:
3073         // first of all, some background info on the submodels:
3074         // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3075         // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3076         // now the weird for loop itself:
3077         // the loop functions in an odd way, on each iteration it sets up the
3078         // current 'mod' model (which despite the confusing code IS the model of
3079         // the number i), at the end of the loop it duplicates the model to become
3080         // the next submodel, and loops back to set up the new submodel.
3081
3082         // LordHavoc: now the explanation of my sane way (which works identically):
3083         // set up the world model, then on each submodel copy from the world model
3084         // and set up the submodel with the respective model info.
3085         for (i = 0;i < mod->brush.numsubmodels;i++)
3086         {
3087                 // LordHavoc: this code was originally at the end of this loop, but
3088                 // has been transformed to something more readable at the start here.
3089
3090                 if (i > 0)
3091                 {
3092                         char name[10];
3093                         // LordHavoc: only register submodels if it is the world
3094                         // (prevents external bsp models from replacing world submodels with
3095                         //  their own)
3096                         if (!loadmodel->isworldmodel)
3097                                 continue;
3098                         // duplicate the basic information
3099                         sprintf(name, "*%i", i);
3100                         mod = Mod_FindName(name);
3101                         // copy the base model to this one
3102                         *mod = *loadmodel;
3103                         // rename the clone back to its proper name
3104                         strcpy(mod->name, name);
3105                         // textures and memory belong to the main model
3106                         mod->texturepool = NULL;
3107                         mod->mempool = NULL;
3108                 }
3109
3110                 mod->brush.submodel = i;
3111
3112                 if (loadmodel->brush.submodels)
3113                         loadmodel->brush.submodels[i] = mod;
3114
3115                 bm = &mod->brushq1.submodels[i];
3116
3117                 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3118                 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3119                 {
3120                         mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3121                         mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3122                 }
3123
3124                 mod->firstmodelsurface = bm->firstface;
3125                 mod->nummodelsurfaces = bm->numfaces;
3126
3127                 // make the model surface list (used by shadowing/lighting)
3128                 mod->surfacelist = Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
3129                 for (j = 0;j < mod->nummodelsurfaces;j++)
3130                         mod->surfacelist[j] = mod->firstmodelsurface + j;
3131
3132                 // this gets altered below if sky is used
3133                 mod->DrawSky = NULL;
3134                 mod->Draw = R_Q1BSP_Draw;
3135                 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3136                 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3137                 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3138                 mod->DrawLight = R_Q1BSP_DrawLight;
3139                 if (i != 0)
3140                 {
3141                         mod->brush.GetPVS = NULL;
3142                         mod->brush.FatPVS = NULL;
3143                         mod->brush.BoxTouchingPVS = NULL;
3144                         mod->brush.BoxTouchingLeafPVS = NULL;
3145                         mod->brush.BoxTouchingVisibleLeafs = NULL;
3146                         mod->brush.LightPoint = NULL;
3147                         mod->brush.AmbientSoundLevelsForPoint = NULL;
3148                 }
3149                 Mod_Q1BSP_BuildLightmapUpdateChains(loadmodel->mempool, mod);
3150                 if (mod->nummodelsurfaces)
3151                 {
3152                         // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3153                         mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3154                         mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3155                         modelyawradius = 0;
3156                         modelradius = 0;
3157                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3158                         {
3159                                 // we only need to have a drawsky function if it is used(usually only on world model)
3160                                 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3161                                         mod->DrawSky = R_Q1BSP_DrawSky;
3162                                 // calculate bounding shapes
3163                                 for (k = 0, vec = (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex);k < surface->num_vertices;k++, vec += 3)
3164                                 {
3165                                         if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3166                                         if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3167                                         if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3168                                         if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3169                                         if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3170                                         if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3171                                         dist = vec[0]*vec[0]+vec[1]*vec[1];
3172                                         if (modelyawradius < dist)
3173                                                 modelyawradius = dist;
3174                                         dist += vec[2]*vec[2];
3175                                         if (modelradius < dist)
3176                                                 modelradius = dist;
3177                                 }
3178                         }
3179                         modelyawradius = sqrt(modelyawradius);
3180                         modelradius = sqrt(modelradius);
3181                         mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3182                         mod->yawmins[2] = mod->normalmins[2];
3183                         mod->yawmaxs[2] = mod->normalmaxs[2];
3184                         mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3185                         mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3186                         mod->radius = modelradius;
3187                         mod->radius2 = modelradius * modelradius;
3188                 }
3189                 else
3190                 {
3191                         // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3192                         Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3193                 }
3194                 //mod->brushq1.num_visleafs = bm->visleafs;
3195         }
3196
3197         Mod_Q1BSP_LoadMapBrushes();
3198
3199         //Mod_Q1BSP_ProcessLightList();
3200
3201         if (developer.integer)
3202                 Con_Printf("Some stats for q1bsp model \"%s\": %i faces, %i nodes, %i leafs, %i visleafs, %i visleafportals\n", loadmodel->name, loadmodel->num_surfaces, loadmodel->brush.num_nodes, loadmodel->brush.num_leafs, mod->brush.num_pvsclusters, loadmodel->brush.num_portals);
3203 }
3204
3205 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3206 {
3207 }
3208
3209 static void Mod_Q2BSP_LoadPlanes(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_LoadPlanes: 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_LoadVertices(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_LoadVertices: 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_LoadVisibility(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_LoadVisibility: 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_LoadNodes(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_LoadNodes: 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_LoadTexInfo(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_LoadTexInfo: 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_LoadFaces(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_LoadFaces: 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_LoadLighting(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_LoadLighting: 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_LoadLeafs(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_LoadLeafs: 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_LoadLeafFaces(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_LoadLeafFaces: 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_LoadLeafBrushes(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_LoadLeafBrushes: 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_LoadEdges(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_LoadEdges: 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_LoadSurfEdges(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_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3461