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, tx->name[0] != '*', 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] != '*', 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)
1566 {
1567         dmodel_t        *in;
1568         dmodel_t        *out;
1569         int                     i, j, count;
1570
1571         in = (void *)(mod_base + l->fileofs);
1572         if (l->filelen % sizeof(*in))
1573                 Host_Error("Mod_Q1BSP_LoadSubmodels: funny lump size in %s",loadmodel->name);
1574         count = l->filelen / sizeof(*in);
1575         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1576
1577         loadmodel->brushq1.submodels = out;
1578         loadmodel->brush.numsubmodels = count;
1579
1580         for ( i=0 ; i<count ; i++, in++, out++)
1581         {
1582                 for (j=0 ; j<3 ; j++)
1583                 {
1584                         // spread the mins / maxs by a pixel
1585                         out->mins[j] = LittleFloat(in->mins[j]) - 1;
1586                         out->maxs[j] = LittleFloat(in->maxs[j]) + 1;
1587                         out->origin[j] = LittleFloat(in->origin[j]);
1588                 }
1589                 for (j=0 ; j<MAX_MAP_HULLS ; j++)
1590                         out->headnode[j] = LittleLong(in->headnode[j]);
1591                 out->visleafs = LittleLong(in->visleafs);
1592                 out->firstface = LittleLong(in->firstface);
1593                 out->numfaces = LittleLong(in->numfaces);
1594         }
1595 }
1596
1597 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1598 {
1599         dedge_t *in;
1600         medge_t *out;
1601         int     i, count;
1602
1603         in = (void *)(mod_base + l->fileofs);
1604         if (l->filelen % sizeof(*in))
1605                 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1606         count = l->filelen / sizeof(*in);
1607         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1608
1609         loadmodel->brushq1.edges = out;
1610         loadmodel->brushq1.numedges = count;
1611
1612         for ( i=0 ; i<count ; i++, in++, out++)
1613         {
1614                 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1615                 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1616         }
1617 }
1618
1619 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1620 {
1621         texinfo_t *in;
1622         mtexinfo_t *out;
1623         int i, j, k, count, miptex;
1624
1625         in = (void *)(mod_base + l->fileofs);
1626         if (l->filelen % sizeof(*in))
1627                 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1628         count = l->filelen / sizeof(*in);
1629         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1630
1631         loadmodel->brushq1.texinfo = out;
1632         loadmodel->brushq1.numtexinfo = count;
1633
1634         for (i = 0;i < count;i++, in++, out++)
1635         {
1636                 for (k = 0;k < 2;k++)
1637                         for (j = 0;j < 4;j++)
1638                                 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1639
1640                 miptex = LittleLong(in->miptex);
1641                 out->flags = LittleLong(in->flags);
1642
1643                 out->texture = NULL;
1644                 if (loadmodel->data_textures)
1645                 {
1646                         if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1647                                 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1648                         else
1649                                 out->texture = loadmodel->data_textures + miptex;
1650                 }
1651                 if (out->flags & TEX_SPECIAL)
1652                 {
1653                         // if texture chosen is NULL or the shader needs a lightmap,
1654                         // force to notexture water shader
1655                         if (out->texture == NULL || out->texture->basematerialflags & MATERIALFLAG_WALL)
1656                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1657                 }
1658                 else
1659                 {
1660                         // if texture chosen is NULL, force to notexture
1661                         if (out->texture == NULL)
1662                                 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1663                 }
1664         }
1665 }
1666
1667 #if 0
1668 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1669 {
1670         int             i, j;
1671         float   *v;
1672
1673         mins[0] = mins[1] = mins[2] = 9999;
1674         maxs[0] = maxs[1] = maxs[2] = -9999;
1675         v = verts;
1676         for (i = 0;i < numverts;i++)
1677         {
1678                 for (j = 0;j < 3;j++, v++)
1679                 {
1680                         if (*v < mins[j])
1681                                 mins[j] = *v;
1682                         if (*v > maxs[j])
1683                                 maxs[j] = *v;
1684                 }
1685         }
1686 }
1687
1688 #define MAX_SUBDIVPOLYTRIANGLES 4096
1689 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
1690
1691 static int subdivpolyverts, subdivpolytriangles;
1692 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
1693 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
1694
1695 static int subdivpolylookupvert(vec3_t v)
1696 {
1697         int i;
1698         for (i = 0;i < subdivpolyverts;i++)
1699                 if (subdivpolyvert[i][0] == v[0]
1700                  && subdivpolyvert[i][1] == v[1]
1701                  && subdivpolyvert[i][2] == v[2])
1702                         return i;
1703         if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
1704                 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
1705         VectorCopy(v, subdivpolyvert[subdivpolyverts]);
1706         return subdivpolyverts++;
1707 }
1708
1709 static void SubdividePolygon(int numverts, float *verts)
1710 {
1711         int             i, i1, i2, i3, f, b, c, p;
1712         vec3_t  mins, maxs, front[256], back[256];
1713         float   m, *pv, *cv, dist[256], frac;
1714
1715         if (numverts > 250)
1716                 Host_Error("SubdividePolygon: ran out of verts in buffer");
1717
1718         BoundPoly(numverts, verts, mins, maxs);
1719
1720         for (i = 0;i < 3;i++)
1721         {
1722                 m = (mins[i] + maxs[i]) * 0.5;
1723                 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
1724                 if (maxs[i] - m < 8)
1725                         continue;
1726                 if (m - mins[i] < 8)
1727                         continue;
1728
1729                 // cut it
1730                 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
1731                         dist[c] = cv[i] - m;
1732
1733                 f = b = 0;
1734                 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
1735                 {
1736                         if (dist[p] >= 0)
1737                         {
1738                                 VectorCopy(pv, front[f]);
1739                                 f++;
1740                         }
1741                         if (dist[p] <= 0)
1742                         {
1743                                 VectorCopy(pv, back[b]);
1744                                 b++;
1745                         }
1746                         if (dist[p] == 0 || dist[c] == 0)
1747                                 continue;
1748                         if ((dist[p] > 0) != (dist[c] > 0) )
1749                         {
1750                                 // clip point
1751                                 frac = dist[p] / (dist[p] - dist[c]);
1752                                 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
1753                                 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
1754                                 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
1755                                 f++;
1756                                 b++;
1757                         }
1758                 }
1759
1760                 SubdividePolygon(f, front[0]);
1761                 SubdividePolygon(b, back[0]);
1762                 return;
1763         }
1764
1765         i1 = subdivpolylookupvert(verts);
1766         i2 = subdivpolylookupvert(verts + 3);
1767         for (i = 2;i < numverts;i++)
1768         {
1769                 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
1770                 {
1771                         Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
1772                         return;
1773                 }
1774
1775                 i3 = subdivpolylookupvert(verts + i * 3);
1776                 subdivpolyindex[subdivpolytriangles][0] = i1;
1777                 subdivpolyindex[subdivpolytriangles][1] = i2;
1778                 subdivpolyindex[subdivpolytriangles][2] = i3;
1779                 i2 = i3;
1780                 subdivpolytriangles++;
1781         }
1782 }
1783
1784 //Breaks a polygon up along axial 64 unit
1785 //boundaries so that turbulent and sky warps
1786 //can be done reasonably.
1787 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
1788 {
1789         int i, j;
1790         surfvertex_t *v;
1791         surfmesh_t *mesh;
1792
1793         subdivpolytriangles = 0;
1794         subdivpolyverts = 0;
1795         SubdividePolygon(surface->num_vertices, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex));
1796         if (subdivpolytriangles < 1)
1797                 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?\n");
1798
1799         surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
1800         mesh->num_vertices = subdivpolyverts;
1801         mesh->num_triangles = subdivpolytriangles;
1802         mesh->vertex = (surfvertex_t *)(mesh + 1);
1803         mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
1804         memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
1805
1806         for (i = 0;i < mesh->num_triangles;i++)
1807                 for (j = 0;j < 3;j++)
1808                         mesh->index[i*3+j] = subdivpolyindex[i][j];
1809
1810         for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
1811         {
1812                 VectorCopy(subdivpolyvert[i], v->v);
1813                 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
1814                 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
1815         }
1816 }
1817 #endif
1818
1819 static void Mod_Q1BSP_LoadFaces(lump_t *l)
1820 {
1821         dface_t *in;
1822         msurface_t *surface;
1823         int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris;
1824         float texmins[2], texmaxs[2], val;
1825
1826         in = (void *)(mod_base + l->fileofs);
1827         if (l->filelen % sizeof(*in))
1828                 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
1829         count = l->filelen / sizeof(*in);
1830         loadmodel->data_surfaces = Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
1831         loadmodel->data_surfaces_lightmapinfo = Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
1832
1833         loadmodel->num_surfaces = count;
1834
1835         totalverts = 0;
1836         totaltris = 0;
1837         for (surfacenum = 0, in = (void *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
1838         {
1839                 numedges = LittleShort(in->numedges);
1840                 totalverts += numedges;
1841                 totaltris += numedges - 2;
1842         }
1843
1844         // TODO: split up into multiple meshes as needed to avoid exceeding 65536
1845         // vertex limit
1846         loadmodel->nummeshes = 1;
1847         loadmodel->meshlist = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *));
1848         loadmodel->meshlist[0] = Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, true, false, false);
1849
1850         totalverts = 0;
1851         totaltris = 0;
1852         for (surfacenum = 0, in = (void *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
1853         {
1854                 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
1855
1856                 // FIXME: validate edges, texinfo, etc?
1857                 firstedge = LittleLong(in->firstedge);
1858                 numedges = LittleShort(in->numedges);
1859                 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)
1860                         Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)\n", firstedge, numedges, loadmodel->brushq1.numsurfedges);
1861                 i = LittleShort(in->texinfo);
1862                 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
1863                         Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)\n", i, loadmodel->brushq1.numtexinfo);
1864                 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
1865                 surface->texture = surface->lightmapinfo->texinfo->texture;
1866
1867                 planenum = LittleShort(in->planenum);
1868                 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
1869                         Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)\n", planenum, loadmodel->brush.num_planes);
1870
1871                 //surface->flags = surface->texture->flags;
1872                 //if (LittleShort(in->side))
1873                 //      surface->flags |= SURF_PLANEBACK;
1874                 //surface->plane = loadmodel->brush.data_planes + planenum;
1875
1876                 surface->groupmesh = loadmodel->meshlist[0];
1877                 surface->num_firstvertex = totalverts;
1878                 surface->num_vertices = numedges;
1879                 surface->num_firsttriangle = totaltris;
1880                 surface->num_triangles = numedges - 2;
1881                 totalverts += numedges;
1882                 totaltris += numedges - 2;
1883
1884                 // convert edges back to a normal polygon
1885                 for (i = 0;i < surface->num_vertices;i++)
1886                 {
1887                         int lindex = loadmodel->brushq1.surfedges[firstedge + i];
1888                         float s, t;
1889                         if (lindex > 0)
1890                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
1891                         else
1892                                 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
1893                         s = DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
1894                         t = DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
1895                         (surface->groupmesh->data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
1896                         (surface->groupmesh->data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
1897                         (surface->groupmesh->data_texcoorddetail2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s * (1.0f / 16.0f);
1898                         (surface->groupmesh->data_texcoorddetail2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t * (1.0f / 16.0f);
1899                         (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
1900                         (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
1901                         (surface->groupmesh->data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
1902                 }
1903
1904                 for (i = 0;i < surface->num_triangles;i++)
1905                 {
1906                         (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
1907                         (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
1908                         (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
1909                 }
1910
1911                 // compile additional data about the surface geometry
1912                 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);
1913                 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex));
1914
1915                 // generate surface extents information
1916                 texmins[0] = texmaxs[0] = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
1917                 texmins[1] = texmaxs[1] = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
1918                 for (i = 1;i < surface->num_vertices;i++)
1919                 {
1920                         for (j = 0;j < 2;j++)
1921                         {
1922                                 val = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
1923                                 texmins[j] = min(texmins[j], val);
1924                                 texmaxs[j] = max(texmaxs[j], val);
1925                         }
1926                 }
1927                 for (i = 0;i < 2;i++)
1928                 {
1929                         surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
1930                         surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
1931                 }
1932
1933                 smax = surface->lightmapinfo->extents[0] >> 4;
1934                 tmax = surface->lightmapinfo->extents[1] >> 4;
1935                 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
1936                 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
1937
1938                 // lighting info
1939                 for (i = 0;i < MAXLIGHTMAPS;i++)
1940                         surface->lightmapinfo->styles[i] = in->styles[i];
1941                 // force lightmap upload on first time seeing the surface
1942                 surface->cached_dlight = true;
1943                 surface->lightmapinfo->lightmaptexturestride = 0;
1944                 surface->lightmaptexture = NULL;
1945                 i = LittleLong(in->lightofs);
1946                 if (i == -1)
1947                 {
1948                         surface->lightmapinfo->samples = NULL;
1949                         // give non-lightmapped water a 1x white lightmap
1950                         if ((surface->texture->basematerialflags & MATERIALFLAG_WATER) && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
1951                         {
1952                                 surface->lightmapinfo->samples = Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
1953                                 surface->lightmapinfo->styles[0] = 0;
1954                                 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
1955                         }
1956                 }
1957                 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
1958                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
1959                 else // LordHavoc: white lighting (bsp version 29)
1960                         surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
1961
1962                 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
1963                 {
1964                         int i, iu, iv;
1965                         float u, v, ubase, vbase, uscale, vscale;
1966
1967                         if (ssize > 256 || tsize > 256)
1968                                 Host_Error("Bad surface extents");
1969                         // stainmap for permanent marks on walls
1970                         surface->lightmapinfo->stainsamples = Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
1971                         // clear to white
1972                         memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
1973
1974                         if (r_miplightmaps.integer)
1975                         {
1976                                 surface->lightmapinfo->lightmaptexturestride = ssize;
1977                                 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);
1978                         }
1979                         else
1980                         {
1981                                 surface->lightmapinfo->lightmaptexturestride = R_CompatibleFragmentWidth(ssize, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, 0);
1982                                 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);
1983                         }
1984                         R_FragmentLocation(surface->lightmaptexture, NULL, NULL, &ubase, &vbase, &uscale, &vscale);
1985                         uscale = (uscale - ubase) / ssize;
1986                         vscale = (vscale - vbase) / tsize;
1987
1988                         for (i = 0;i < surface->num_vertices;i++)
1989                         {
1990                                 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);
1991                                 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);
1992                                 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
1993                                 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
1994                                 // LordHavoc: calc lightmap data offset for vertex lighting to use
1995                                 iu = (int) u;
1996                                 iv = (int) v;
1997                                 (surface->groupmesh->data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
1998                         }
1999                 }
2000         }
2001 }
2002
2003 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2004 {
2005         //if (node->parent)
2006         //      Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion\n");
2007         node->parent = parent;
2008         if (node->plane)
2009         {
2010                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2011                 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2012         }
2013 }
2014
2015 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2016 {
2017         int                     i, j, count, p;
2018         dnode_t         *in;
2019         mnode_t         *out;
2020
2021         in = (void *)(mod_base + l->fileofs);
2022         if (l->filelen % sizeof(*in))
2023                 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2024         count = l->filelen / sizeof(*in);
2025         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2026
2027         loadmodel->brush.data_nodes = out;
2028         loadmodel->brush.num_nodes = count;
2029
2030         for ( i=0 ; i<count ; i++, in++, out++)
2031         {
2032                 for (j=0 ; j<3 ; j++)
2033                 {
2034                         out->mins[j] = LittleShort(in->mins[j]);
2035                         out->maxs[j] = LittleShort(in->maxs[j]);
2036                 }
2037
2038                 p = LittleLong(in->planenum);
2039                 out->plane = loadmodel->brush.data_planes + p;
2040
2041                 out->firstsurface = LittleShort(in->firstface);
2042                 out->numsurfaces = LittleShort(in->numfaces);
2043
2044                 for (j=0 ; j<2 ; j++)
2045                 {
2046                         p = LittleShort(in->children[j]);
2047                         if (p >= 0)
2048                                 out->children[j] = loadmodel->brush.data_nodes + p;
2049                         else
2050                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + (-1 - p));
2051                 }
2052         }
2053
2054         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);      // sets nodes and leafs
2055 }
2056
2057 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2058 {
2059         dleaf_t *in;
2060         mleaf_t *out;
2061         int i, j, count, p;
2062
2063         in = (void *)(mod_base + l->fileofs);
2064         if (l->filelen % sizeof(*in))
2065                 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2066         count = l->filelen / sizeof(*in);
2067         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2068
2069         loadmodel->brush.data_leafs = out;
2070         loadmodel->brush.num_leafs = count;
2071         // get visleafs from the submodel data
2072         loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2073         loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2074         loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2075         memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2076
2077         for ( i=0 ; i<count ; i++, in++, out++)
2078         {
2079                 for (j=0 ; j<3 ; j++)
2080                 {
2081                         out->mins[j] = LittleShort(in->mins[j]);
2082                         out->maxs[j] = LittleShort(in->maxs[j]);
2083                 }
2084
2085                 // FIXME: this function could really benefit from some error checking
2086
2087                 out->contents = LittleLong(in->contents);
2088
2089                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + LittleShort(in->firstmarksurface);
2090                 out->numleafsurfaces = LittleShort(in->nummarksurfaces);
2091                 if (out->firstleafsurface < 0 || LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2092                 {
2093                         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);
2094                         out->firstleafsurface = NULL;
2095                         out->numleafsurfaces = 0;
2096                 }
2097
2098                 out->clusterindex = i - 1;
2099                 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2100                         out->clusterindex = -1;
2101
2102                 p = LittleLong(in->visofs);
2103                 // ignore visofs errors on leaf 0 (solid)
2104                 if (p >= 0 && out->clusterindex >= 0)
2105                 {
2106                         if (p >= loadmodel->brushq1.num_compressedpvs)
2107                                 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2108                         else
2109                                 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);
2110                 }
2111
2112                 for (j = 0;j < 4;j++)
2113                         out->ambient_sound_level[j] = in->ambient_level[j];
2114
2115                 // FIXME: Insert caustics here
2116         }
2117 }
2118
2119 static void Mod_Q1BSP_LoadClipnodes(lump_t *l)
2120 {
2121         dclipnode_t *in, *out;
2122         int                     i, count;
2123         hull_t          *hull;
2124
2125         in = (void *)(mod_base + l->fileofs);
2126         if (l->filelen % sizeof(*in))
2127                 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2128         count = l->filelen / sizeof(*in);
2129         out = Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2130
2131         loadmodel->brushq1.clipnodes = out;
2132         loadmodel->brushq1.numclipnodes = count;
2133
2134         if (loadmodel->brush.ismcbsp)
2135         {
2136                 hull = &loadmodel->brushq1.hulls[1];
2137                 hull->clipnodes = out;
2138                 hull->firstclipnode = 0;
2139                 hull->lastclipnode = count-1;
2140                 hull->planes = loadmodel->brush.data_planes;
2141                 hull->clip_mins[0] = -12;
2142                 hull->clip_mins[1] = -12;
2143                 hull->clip_mins[2] = -24;
2144                 hull->clip_maxs[0] = 12;
2145                 hull->clip_maxs[1] = 12;
2146                 hull->clip_maxs[2] = 32;
2147                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2148
2149                 hull = &loadmodel->brushq1.hulls[2];
2150                 hull->clipnodes = out;
2151                 hull->firstclipnode = 0;
2152                 hull->lastclipnode = count-1;
2153                 hull->planes = loadmodel->brush.data_planes;
2154                 hull->clip_mins[0] = -12;
2155                 hull->clip_mins[1] = -12;
2156                 hull->clip_mins[2] = -24;
2157                 hull->clip_maxs[0] = 12;
2158                 hull->clip_maxs[1] = 12;
2159                 hull->clip_maxs[2] = 16;
2160                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2161         }
2162         else if (loadmodel->brush.ishlbsp)
2163         {
2164                 hull = &loadmodel->brushq1.hulls[1];
2165                 hull->clipnodes = out;
2166                 hull->firstclipnode = 0;
2167                 hull->lastclipnode = count-1;
2168                 hull->planes = loadmodel->brush.data_planes;
2169                 hull->clip_mins[0] = -16;
2170                 hull->clip_mins[1] = -16;
2171                 hull->clip_mins[2] = -36;
2172                 hull->clip_maxs[0] = 16;
2173                 hull->clip_maxs[1] = 16;
2174                 hull->clip_maxs[2] = 36;
2175                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2176
2177                 hull = &loadmodel->brushq1.hulls[2];
2178                 hull->clipnodes = out;
2179                 hull->firstclipnode = 0;
2180                 hull->lastclipnode = count-1;
2181                 hull->planes = loadmodel->brush.data_planes;
2182                 hull->clip_mins[0] = -32;
2183                 hull->clip_mins[1] = -32;
2184                 hull->clip_mins[2] = -32;
2185                 hull->clip_maxs[0] = 32;
2186                 hull->clip_maxs[1] = 32;
2187                 hull->clip_maxs[2] = 32;
2188                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2189
2190                 hull = &loadmodel->brushq1.hulls[3];
2191                 hull->clipnodes = out;
2192                 hull->firstclipnode = 0;
2193                 hull->lastclipnode = count-1;
2194                 hull->planes = loadmodel->brush.data_planes;
2195                 hull->clip_mins[0] = -16;
2196                 hull->clip_mins[1] = -16;
2197                 hull->clip_mins[2] = -18;
2198                 hull->clip_maxs[0] = 16;
2199                 hull->clip_maxs[1] = 16;
2200                 hull->clip_maxs[2] = 18;
2201                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2202         }
2203         else
2204         {
2205                 hull = &loadmodel->brushq1.hulls[1];
2206                 hull->clipnodes = out;
2207                 hull->firstclipnode = 0;
2208                 hull->lastclipnode = count-1;
2209                 hull->planes = loadmodel->brush.data_planes;
2210                 hull->clip_mins[0] = -16;
2211                 hull->clip_mins[1] = -16;
2212                 hull->clip_mins[2] = -24;
2213                 hull->clip_maxs[0] = 16;
2214                 hull->clip_maxs[1] = 16;
2215                 hull->clip_maxs[2] = 32;
2216                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2217
2218                 hull = &loadmodel->brushq1.hulls[2];
2219                 hull->clipnodes = out;
2220                 hull->firstclipnode = 0;
2221                 hull->lastclipnode = count-1;
2222                 hull->planes = loadmodel->brush.data_planes;
2223                 hull->clip_mins[0] = -32;
2224                 hull->clip_mins[1] = -32;
2225                 hull->clip_mins[2] = -24;
2226                 hull->clip_maxs[0] = 32;
2227                 hull->clip_maxs[1] = 32;
2228                 hull->clip_maxs[2] = 64;
2229                 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2230         }
2231
2232         for (i=0 ; i<count ; i++, out++, in++)
2233         {
2234                 out->planenum = LittleLong(in->planenum);
2235                 out->children[0] = LittleShort(in->children[0]);
2236                 out->children[1] = LittleShort(in->children[1]);
2237                 if (out->children[0] >= count || out->children[1] >= count)
2238                         Host_Error("Corrupt clipping hull(out of range child)\n");
2239         }
2240 }
2241
2242 //Duplicate the drawing hull structure as a clipping hull
2243 static void Mod_Q1BSP_MakeHull0(void)
2244 {
2245         mnode_t         *in;
2246         dclipnode_t *out;
2247         int                     i;
2248         hull_t          *hull;
2249
2250         hull = &loadmodel->brushq1.hulls[0];
2251
2252         in = loadmodel->brush.data_nodes;
2253         out = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(dclipnode_t));
2254
2255         hull->clipnodes = out;
2256         hull->firstclipnode = 0;
2257         hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2258         hull->planes = loadmodel->brush.data_planes;
2259
2260         for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2261         {
2262                 out->planenum = in->plane - loadmodel->brush.data_planes;
2263                 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2264                 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2265         }
2266 }
2267
2268 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2269 {
2270         int i, j;
2271         short *in;
2272
2273         in = (void *)(mod_base + l->fileofs);
2274         if (l->filelen % sizeof(*in))
2275                 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2276         loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2277         loadmodel->brush.data_leafsurfaces = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2278
2279         for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2280         {
2281                 j = (unsigned) LittleShort(in[i]);
2282                 if (j >= loadmodel->num_surfaces)
2283                         Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2284                 loadmodel->brush.data_leafsurfaces[i] = j;
2285         }
2286 }
2287
2288 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2289 {
2290         int             i;
2291         int             *in;
2292
2293         in = (void *)(mod_base + l->fileofs);
2294         if (l->filelen % sizeof(*in))
2295                 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2296         loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2297         loadmodel->brushq1.surfedges = Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2298
2299         for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2300                 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2301 }
2302
2303
2304 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2305 {
2306         int                     i;
2307         mplane_t        *out;
2308         dplane_t        *in;
2309
2310         in = (void *)(mod_base + l->fileofs);
2311         if (l->filelen % sizeof(*in))
2312                 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2313
2314         loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2315         loadmodel->brush.data_planes = out = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2316
2317         for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2318         {
2319                 out->normal[0] = LittleFloat(in->normal[0]);
2320                 out->normal[1] = LittleFloat(in->normal[1]);
2321                 out->normal[2] = LittleFloat(in->normal[2]);
2322                 out->dist = LittleFloat(in->dist);
2323
2324                 PlaneClassify(out);
2325         }
2326 }
2327
2328 static void Mod_Q1BSP_LoadMapBrushes(void)
2329 {
2330 #if 0
2331 // unfinished
2332         int submodel, numbrushes;
2333         qboolean firstbrush;
2334         char *text, *maptext;
2335         char mapfilename[MAX_QPATH];
2336         FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2337         strlcat (mapfilename, ".map", sizeof (mapfilename));
2338         maptext = (qbyte*) FS_LoadFile(mapfilename, tempmempool, false);
2339         if (!maptext)
2340                 return;
2341         text = maptext;
2342         if (!COM_ParseToken(&data, false))
2343                 return; // error
2344         submodel = 0;
2345         for (;;)
2346         {
2347                 if (!COM_ParseToken(&data, false))
2348                         break;
2349                 if (com_token[0] != '{')
2350                         return; // error
2351                 // entity
2352                 firstbrush = true;
2353                 numbrushes = 0;
2354                 maxbrushes = 256;
2355                 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2356                 for (;;)
2357                 {
2358                         if (!COM_ParseToken(&data, false))
2359                                 return; // error
2360                         if (com_token[0] == '}')
2361                                 break; // end of entity
2362                         if (com_token[0] == '{')
2363                         {
2364                                 // brush
2365                                 if (firstbrush)
2366                                 {
2367                                         if (submodel)
2368                                         {
2369                                                 if (submodel > loadmodel->brush.numsubmodels)
2370                                                 {
2371                                                         Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2372                                                         model = NULL;
2373                                                 }
2374                                                 else
2375                                                         model = loadmodel->brush.submodels[submodel];
2376                                         }
2377                                         else
2378                                                 model = loadmodel;
2379                                 }
2380                                 for (;;)
2381                                 {
2382                                         if (!COM_ParseToken(&data, false))
2383                                                 return; // error
2384                                         if (com_token[0] == '}')
2385                                                 break; // end of brush
2386                                         // each brush face should be this format:
2387                                         // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2388                                         // FIXME: support hl .map format
2389                                         for (pointnum = 0;pointnum < 3;pointnum++)
2390                                         {
2391                                                 COM_ParseToken(&data, false);
2392                                                 for (componentnum = 0;componentnum < 3;componentnum++)
2393                                                 {
2394                                                         COM_ParseToken(&data, false);
2395                                                         point[pointnum][componentnum] = atof(com_token);
2396                                                 }
2397                                                 COM_ParseToken(&data, false);
2398                                         }
2399                                         COM_ParseToken(&data, false);
2400                                         strlcpy(facetexture, com_token, sizeof(facetexture));
2401                                         COM_ParseToken(&data, false);
2402                                         //scroll_s = atof(com_token);
2403                                         COM_ParseToken(&data, false);
2404                                         //scroll_t = atof(com_token);
2405                                         COM_ParseToken(&data, false);
2406                                         //rotate = atof(com_token);
2407                                         COM_ParseToken(&data, false);
2408                                         //scale_s = atof(com_token);
2409                                         COM_ParseToken(&data, false);
2410                                         //scale_t = atof(com_token);
2411                                         TriangleNormal(point[0], point[1], point[2], planenormal);
2412                                         VectorNormalizeDouble(planenormal);
2413                                         planedist = DotProduct(point[0], planenormal);
2414                                         //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2415                                 }
2416                                 continue;
2417                         }
2418                 }
2419         }
2420 #endif
2421 }
2422
2423
2424 #define MAX_PORTALPOINTS 64
2425
2426 typedef struct portal_s
2427 {
2428         mplane_t plane;
2429         mnode_t *nodes[2];              // [0] = front side of plane
2430         struct portal_s *next[2];
2431         int numpoints;
2432         double points[3*MAX_PORTALPOINTS];
2433         struct portal_s *chain; // all portals are linked into a list
2434 }
2435 portal_t;
2436
2437 static portal_t *portalchain;
2438
2439 /*
2440 ===========
2441 AllocPortal
2442 ===========
2443 */
2444 static portal_t *AllocPortal(void)
2445 {
2446         portal_t *p;
2447         p = Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2448         p->chain = portalchain;
2449         portalchain = p;
2450         return p;
2451 }
2452
2453 static void FreePortal(portal_t *p)
2454 {
2455         Mem_Free(p);
2456 }
2457
2458 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2459 {
2460         // process only nodes (leafs already had their box calculated)
2461         if (!node->plane)
2462                 return;
2463
2464         // calculate children first
2465         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2466         Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2467
2468         // make combined bounding box from children
2469         node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2470         node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2471         node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2472         node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2473         node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2474         node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2475 }
2476
2477 static void Mod_Q1BSP_FinalizePortals(void)
2478 {
2479         int i, j, numportals, numpoints;
2480         portal_t *p, *pnext;
2481         mportal_t *portal;
2482         mvertex_t *point;
2483         mleaf_t *leaf, *endleaf;
2484
2485         // recalculate bounding boxes for all leafs(because qbsp is very sloppy)
2486         leaf = loadmodel->brush.data_leafs;
2487         endleaf = leaf + loadmodel->brush.num_leafs;
2488         for (;leaf < endleaf;leaf++)
2489         {
2490                 VectorSet(leaf->mins,  2000000000,  2000000000,  2000000000);
2491                 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2492         }
2493         p = portalchain;
2494         while (p)
2495         {
2496                 if (p->numpoints >= 3)
2497                 {
2498                         for (i = 0;i < 2;i++)
2499                         {
2500                                 leaf = (mleaf_t *)p->nodes[i];
2501                                 for (j = 0;j < p->numpoints;j++)
2502                                 {
2503                                         if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
2504                                         if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
2505                                         if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
2506                                         if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
2507                                         if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
2508                                         if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
2509                                 }
2510                         }
2511                 }
2512                 p = p->chain;
2513         }
2514
2515         Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
2516
2517         // tally up portal and point counts
2518         p = portalchain;
2519         numportals = 0;
2520         numpoints = 0;
2521         while (p)
2522         {
2523                 // note: this check must match the one below or it will usually corrupt memory
2524                 // 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
2525                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2526                 {
2527                         numportals += 2;
2528                         numpoints += p->numpoints * 2;
2529                 }
2530                 p = p->chain;
2531         }
2532         loadmodel->brush.data_portals = Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2533         loadmodel->brush.num_portals = numportals;
2534         loadmodel->brush.data_portalpoints = (void *)((qbyte *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2535         loadmodel->brush.num_portalpoints = numpoints;
2536         // clear all leaf portal chains
2537         for (i = 0;i < loadmodel->brush.num_leafs;i++)
2538                 loadmodel->brush.data_leafs[i].portals = NULL;
2539         // process all portals in the global portal chain, while freeing them
2540         portal = loadmodel->brush.data_portals;
2541         point = loadmodel->brush.data_portalpoints;
2542         p = portalchain;
2543         portalchain = NULL;
2544         while (p)
2545         {
2546                 pnext = p->chain;
2547
2548                 // note: this check must match the one above or it will usually corrupt memory
2549                 // 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
2550                 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2551                 {
2552                         // first make the back to front portal(forward portal)
2553                         portal->points = point;
2554                         portal->numpoints = p->numpoints;
2555                         portal->plane.dist = p->plane.dist;
2556                         VectorCopy(p->plane.normal, portal->plane.normal);
2557                         portal->here = (mleaf_t *)p->nodes[1];
2558                         portal->past = (mleaf_t *)p->nodes[0];
2559                         // copy points
2560                         for (j = 0;j < portal->numpoints;j++)
2561                         {
2562                                 VectorCopy(p->points + j*3, point->position);
2563                                 point++;
2564                         }
2565                         BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2566                         PlaneClassify(&portal->plane);
2567
2568                         // link into leaf's portal chain
2569                         portal->next = portal->here->portals;
2570                         portal->here->portals = portal;
2571
2572                         // advance to next portal
2573                         portal++;
2574
2575                         // then make the front to back portal(backward portal)
2576                         portal->points = point;
2577                         portal->numpoints = p->numpoints;
2578                         portal->plane.dist = -p->plane.dist;
2579                         VectorNegate(p->plane.normal, portal->plane.normal);
2580                         portal->here = (mleaf_t *)p->nodes[0];
2581                         portal->past = (mleaf_t *)p->nodes[1];
2582                         // copy points
2583                         for (j = portal->numpoints - 1;j >= 0;j--)
2584                         {
2585                                 VectorCopy(p->points + j*3, point->position);
2586                                 point++;
2587                         }
2588                         BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2589                         PlaneClassify(&portal->plane);
2590
2591                         // link into leaf's portal chain
2592                         portal->next = portal->here->portals;
2593                         portal->here->portals = portal;
2594
2595                         // advance to next portal
2596                         portal++;
2597                 }
2598                 FreePortal(p);
2599                 p = pnext;
2600         }
2601 }
2602
2603 /*
2604 =============
2605 AddPortalToNodes
2606 =============
2607 */
2608 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2609 {
2610         if (!front)
2611                 Host_Error("AddPortalToNodes: NULL front node");
2612         if (!back)
2613                 Host_Error("AddPortalToNodes: NULL back node");
2614         if (p->nodes[0] || p->nodes[1])
2615                 Host_Error("AddPortalToNodes: already included");
2616         // 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
2617
2618         p->nodes[0] = front;
2619         p->next[0] = (portal_t *)front->portals;
2620         front->portals = (mportal_t *)p;
2621
2622         p->nodes[1] = back;
2623         p->next[1] = (portal_t *)back->portals;
2624         back->portals = (mportal_t *)p;
2625 }
2626
2627 /*
2628 =============
2629 RemovePortalFromNode
2630 =============
2631 */
2632 static void RemovePortalFromNodes(portal_t *portal)
2633 {
2634         int i;
2635         mnode_t *node;
2636         void **portalpointer;
2637         portal_t *t;
2638         for (i = 0;i < 2;i++)
2639         {
2640                 node = portal->nodes[i];
2641
2642                 portalpointer = (void **) &node->portals;
2643                 while (1)
2644                 {
2645                         t = *portalpointer;
2646                         if (!t)
2647                                 Host_Error("RemovePortalFromNodes: portal not in leaf");
2648
2649                         if (t == portal)
2650                         {
2651                                 if (portal->nodes[0] == node)
2652                                 {
2653                                         *portalpointer = portal->next[0];
2654                                         portal->nodes[0] = NULL;
2655                                 }
2656                                 else if (portal->nodes[1] == node)
2657                                 {
2658                                         *portalpointer = portal->next[1];
2659                                         portal->nodes[1] = NULL;
2660                                 }
2661                                 else
2662                                         Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2663                                 break;
2664                         }
2665
2666                         if (t->nodes[0] == node)
2667                                 portalpointer = (void **) &t->next[0];
2668                         else if (t->nodes[1] == node)
2669                                 portalpointer = (void **) &t->next[1];
2670                         else
2671                                 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2672                 }
2673         }
2674 }
2675
2676 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
2677 {
2678         int i, side;
2679         mnode_t *front, *back, *other_node;
2680         mplane_t clipplane, *plane;
2681         portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
2682         int numfrontpoints, numbackpoints;
2683         double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
2684
2685         // if a leaf, we're done
2686         if (!node->plane)
2687                 return;
2688
2689         plane = node->plane;
2690
2691         front = node->children[0];
2692         back = node->children[1];
2693         if (front == back)
2694                 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
2695
2696         // create the new portal by generating a polygon for the node plane,
2697         // and clipping it by all of the other portals(which came from nodes above this one)
2698         nodeportal = AllocPortal();
2699         nodeportal->plane = *plane;
2700
2701         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);
2702         nodeportal->numpoints = 4;
2703         side = 0;       // shut up compiler warning
2704         for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
2705         {
2706                 clipplane = portal->plane;
2707                 if (portal->nodes[0] == portal->nodes[1])
2708                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
2709                 if (portal->nodes[0] == node)
2710                         side = 0;
2711                 else if (portal->nodes[1] == node)
2712                 {
2713                         clipplane.dist = -clipplane.dist;
2714                         VectorNegate(clipplane.normal, clipplane.normal);
2715                         side = 1;
2716                 }
2717                 else
2718                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2719
2720                 for (i = 0;i < nodeportal->numpoints*3;i++)
2721                         frontpoints[i] = nodeportal->points[i];
2722                 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);
2723                 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
2724                         break;
2725         }
2726
2727         if (nodeportal->numpoints < 3)
2728         {
2729                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
2730                 nodeportal->numpoints = 0;
2731         }
2732         else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
2733         {
2734                 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
2735                 nodeportal->numpoints = 0;
2736         }
2737
2738         AddPortalToNodes(nodeportal, front, back);
2739
2740         // split the portals of this node along this node's plane and assign them to the children of this node
2741         // (migrating the portals downward through the tree)
2742         for (portal = (portal_t *)node->portals;portal;portal = nextportal)
2743         {
2744                 if (portal->nodes[0] == portal->nodes[1])
2745                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
2746                 if (portal->nodes[0] == node)
2747                         side = 0;
2748                 else if (portal->nodes[1] == node)
2749                         side = 1;
2750                 else
2751                         Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2752                 nextportal = portal->next[side];
2753                 if (!portal->numpoints)
2754                         continue;
2755
2756                 other_node = portal->nodes[!side];
2757                 RemovePortalFromNodes(portal);
2758
2759                 // cut the portal into two portals, one on each side of the node plane
2760                 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);
2761
2762                 if (!numfrontpoints)
2763                 {
2764                         if (side == 0)
2765                                 AddPortalToNodes(portal, back, other_node);
2766                         else
2767                                 AddPortalToNodes(portal, other_node, back);
2768                         continue;
2769                 }
2770                 if (!numbackpoints)
2771                 {
2772                         if (side == 0)
2773                                 AddPortalToNodes(portal, front, other_node);
2774                         else
2775                                 AddPortalToNodes(portal, other_node, front);
2776                         continue;
2777                 }
2778
2779                 // the portal is split
2780                 splitportal = AllocPortal();
2781                 temp = splitportal->chain;
2782                 *splitportal = *portal;
2783                 splitportal->chain = temp;
2784                 for (i = 0;i < numbackpoints*3;i++)
2785                         splitportal->points[i] = backpoints[i];
2786                 splitportal->numpoints = numbackpoints;
2787                 for (i = 0;i < numfrontpoints*3;i++)
2788                         portal->points[i] = frontpoints[i];
2789                 portal->numpoints = numfrontpoints;
2790
2791                 if (side == 0)
2792                 {
2793                         AddPortalToNodes(portal, front, other_node);
2794                         AddPortalToNodes(splitportal, back, other_node);
2795                 }
2796                 else
2797                 {
2798                         AddPortalToNodes(portal, other_node, front);
2799                         AddPortalToNodes(splitportal, other_node, back);
2800                 }
2801         }
2802
2803         Mod_Q1BSP_RecursiveNodePortals(front);
2804         Mod_Q1BSP_RecursiveNodePortals(back);
2805 }
2806
2807 static void Mod_Q1BSP_MakePortals(void)
2808 {
2809         portalchain = NULL;
2810         Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
2811         Mod_Q1BSP_FinalizePortals();
2812 }
2813
2814 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
2815 {
2816         int i, j, stylecounts[256], totalcount, remapstyles[256];
2817         msurface_t *surface;
2818         memset(stylecounts, 0, sizeof(stylecounts));
2819         for (i = 0;i < model->nummodelsurfaces;i++)
2820         {
2821                 surface = model->data_surfaces + model->firstmodelsurface + i;
2822                 for (j = 0;j < MAXLIGHTMAPS;j++)
2823                         stylecounts[surface->lightmapinfo->styles[j]]++;
2824         }
2825         totalcount = 0;
2826         model->brushq1.light_styles = 0;
2827         for (i = 0;i < 255;i++)
2828         {
2829                 if (stylecounts[i])
2830                 {
2831                         remapstyles[i] = model->brushq1.light_styles++;
2832                         totalcount += stylecounts[i] + 1;
2833                 }
2834         }
2835         if (!totalcount)
2836                 return;
2837         model->brushq1.light_style = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(qbyte));
2838         model->brushq1.light_stylevalue = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
2839         model->brushq1.light_styleupdatechains = Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
2840         model->brushq1.light_styleupdatechainsbuffer = Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
2841         model->brushq1.light_styles = 0;
2842         for (i = 0;i < 255;i++)
2843                 if (stylecounts[i])
2844                         model->brushq1.light_style[model->brushq1.light_styles++] = i;
2845         j = 0;
2846         for (i = 0;i < model->brushq1.light_styles;i++)
2847         {
2848                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2849                 j += stylecounts[model->brushq1.light_style[i]] + 1;
2850         }
2851         for (i = 0;i < model->nummodelsurfaces;i++)
2852         {
2853                 surface = model->data_surfaces + model->firstmodelsurface + i;
2854                 for (j = 0;j < MAXLIGHTMAPS;j++)
2855                         if (surface->lightmapinfo->styles[j] != 255)
2856                                 *model->brushq1.light_styleupdatechains[remapstyles[surface->lightmapinfo->styles[j]]]++ = surface;
2857         }
2858         j = 0;
2859         for (i = 0;i < model->brushq1.light_styles;i++)
2860         {
2861                 *model->brushq1.light_styleupdatechains[i] = NULL;
2862                 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2863                 j += stylecounts[model->brushq1.light_style[i]] + 1;
2864         }
2865 }
2866
2867 //Returns PVS data for a given point
2868 //(note: can return NULL)
2869 static qbyte *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
2870 {
2871         mnode_t *node;
2872         Mod_CheckLoaded(model);
2873         node = model->brush.data_nodes;
2874         while (node->plane)
2875                 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
2876         if (((mleaf_t *)node)->clusterindex >= 0)
2877                 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2878         else
2879                 return NULL;
2880 }
2881
2882 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbytes, mnode_t *node)
2883 {
2884         while (node->plane)
2885         {
2886                 float d = PlaneDiff(org, node->plane);
2887                 if (d > radius)
2888                         node = node->children[0];
2889                 else if (d < -radius)
2890                         node = node->children[1];
2891                 else
2892                 {
2893                         // go down both sides
2894                         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
2895                         node = node->children[1];
2896                 }
2897         }
2898         // if this leaf is in a cluster, accumulate the pvs bits
2899         if (((mleaf_t *)node)->clusterindex >= 0)
2900         {
2901                 int i;
2902                 qbyte *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2903                 for (i = 0;i < pvsbytes;i++)
2904                         pvsbuffer[i] |= pvs[i];
2905         }
2906 }
2907
2908 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
2909 //of the given point.
2910 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, qbyte *pvsbuffer, int pvsbufferlength)
2911 {
2912         int bytes = model->brush.num_pvsclusterbytes;
2913         bytes = min(bytes, pvsbufferlength);
2914         if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
2915         {
2916                 memset(pvsbuffer, 0xFF, bytes);
2917                 return bytes;
2918         }
2919         memset(pvsbuffer, 0, bytes);
2920         Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
2921         return bytes;
2922 }
2923
2924 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
2925 {
2926         vec3_t size;
2927         const hull_t *hull;
2928
2929         VectorSubtract(inmaxs, inmins, size);
2930         if (cmodel->brush.ismcbsp)
2931         {
2932                 if (size[0] < 3)
2933                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2934                 else if (size[2] < 48) // pick the nearest of 40 or 56
2935                         hull = &cmodel->brushq1.hulls[2]; // 16x16x40
2936                 else
2937                         hull = &cmodel->brushq1.hulls[1]; // 16x16x56
2938         }
2939         else if (cmodel->brush.ishlbsp)
2940         {
2941                 if (size[0] < 3)
2942                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2943                 else if (size[0] <= 32)
2944                 {
2945                         if (size[2] < 54) // pick the nearest of 36 or 72
2946                                 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
2947                         else
2948                                 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
2949                 }
2950                 else
2951                         hull = &cmodel->brushq1.hulls[2]; // 64x64x64
2952         }
2953         else
2954         {
2955                 if (size[0] < 3)
2956                         hull = &cmodel->brushq1.hulls[0]; // 0x0x0
2957                 else if (size[0] <= 32)
2958                         hull = &cmodel->brushq1.hulls[1]; // 32x32x56
2959                 else
2960                         hull = &cmodel->brushq1.hulls[2]; // 64x64x88
2961         }
2962         VectorCopy(inmins, outmins);
2963         VectorAdd(inmins, hull->clip_size, outmaxs);
2964 }
2965
2966 extern void R_Q1BSP_DrawSky(entity_render_t *ent);
2967 extern void R_Q1BSP_Draw(entity_render_t *ent);
2968 extern void R_Q1BSP_GetLightInfo(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, vec3_t outmins, vec3_t outmaxs, int *outleaflist, qbyte *outleafpvs, int *outnumleafspointer, int *outsurfacelist, qbyte *outsurfacepvs, int *outnumsurfacespointer);
2969 extern void R_Q1BSP_DrawShadowVolume(entity_render_t *ent, vec3_t relativelightorigin, float lightradius, int numsurfaces, const int *surfacelist, const vec3_t lightmins, const vec3_t lightmaxs);
2970 extern void R_Q1BSP_DrawLight(entity_render_t *ent, float *lightcolor, int numsurfaces, const int *surfacelist);
2971 void Mod_Q1BSP_Load(model_t *mod, void *buffer, void *bufferend)
2972 {
2973         int i, j, k;
2974         dheader_t *header;
2975         dmodel_t *bm;
2976         mempool_t *mainmempool;
2977         float dist, modelyawradius, modelradius, *vec;
2978         msurface_t *surface;
2979         int numshadowmeshtriangles;
2980
2981         mod->type = mod_brushq1;
2982
2983         if (!memcmp(buffer, "MCBSP", 5))
2984         {
2985                 header = (dheader_t *)((unsigned char*)buffer + 5);
2986
2987                 i = LittleLong(header->version);
2988                 if (i != MCBSPVERSION)
2989                         Host_Error("Mod_Q1BSP_Load: %s has wrong version number(MCBSP %i should be %i", mod->name, i, MCBSPVERSION);
2990                 mod->brush.ismcbsp = true;
2991                 mod->brush.ishlbsp = false;
2992         }
2993         else
2994         {
2995                 header = (dheader_t *)buffer;
2996
2997                 i = LittleLong(header->version);
2998                 if (i != BSPVERSION && i != 30)
2999                         Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3000                 mod->brush.ishlbsp = i == 30;
3001         }
3002
3003         mod->soundfromcenter = true;
3004         mod->TraceBox = Mod_Q1BSP_TraceBox;
3005         mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3006         mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3007         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3008         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3009         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3010         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3011         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3012         mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3013         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3014         mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3015         mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3016         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3017
3018         if (loadmodel->isworldmodel)
3019         {
3020                 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3021                 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3022         }
3023
3024 // swap all the lumps
3025         mod_base = (qbyte *)header;
3026
3027         header->version = LittleLong(header->version);
3028         for (i = 0;i < HEADER_LUMPS;i++)
3029         {
3030                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3031                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3032         }
3033
3034 // load into heap
3035
3036         // store which lightmap format to use
3037         mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3038
3039         Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3040         Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3041         Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3042         Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3043         Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3044         Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3045         Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3046         Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3047         Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3048         Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3049         Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3050         // load submodels before leafs because they contain the number of vis leafs
3051         Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS]);
3052         Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3053         Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3054         Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES]);
3055
3056         if (!mod->brushq1.lightdata)
3057                 mod->brush.LightPoint = NULL;
3058
3059         if (mod->brushq1.data_compressedpvs)
3060                 Mem_Free(mod->brushq1.data_compressedpvs);
3061         mod->brushq1.data_compressedpvs = NULL;
3062         mod->brushq1.num_compressedpvs = 0;
3063
3064         Mod_Q1BSP_MakeHull0();
3065         Mod_Q1BSP_MakePortals();
3066
3067         mod->numframes = 2;             // regular and alternate animation
3068         mod->numskins = 1;
3069
3070         mainmempool = mod->mempool;
3071
3072         Mod_Q1BSP_LoadLightList();
3073
3074         // make a single combined shadow mesh to allow optimized shadow volume creation
3075         numshadowmeshtriangles = 0;
3076         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3077         {
3078                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3079                 numshadowmeshtriangles += surface->num_triangles;
3080         }
3081         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3082         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3083                 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));
3084         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
3085         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3086
3087         if (loadmodel->brush.numsubmodels)
3088                 loadmodel->brush.submodels = Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(model_t *));
3089
3090         if (loadmodel->isworldmodel)
3091         {
3092                 // clear out any stale submodels or worldmodels lying around
3093                 // if we did this clear before now, an error might abort loading and
3094                 // leave things in a bad state
3095                 Mod_RemoveStaleWorldModels(loadmodel);
3096         }
3097
3098         // LordHavoc: to clear the fog around the original quake submodel code, I
3099         // will explain:
3100         // first of all, some background info on the submodels:
3101         // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3102         // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3103         // now the weird for loop itself:
3104         // the loop functions in an odd way, on each iteration it sets up the
3105         // current 'mod' model (which despite the confusing code IS the model of
3106         // the number i), at the end of the loop it duplicates the model to become
3107         // the next submodel, and loops back to set up the new submodel.
3108
3109         // LordHavoc: now the explanation of my sane way (which works identically):
3110         // set up the world model, then on each submodel copy from the world model
3111         // and set up the submodel with the respective model info.
3112         for (i = 0;i < mod->brush.numsubmodels;i++)
3113         {
3114                 // LordHavoc: this code was originally at the end of this loop, but
3115                 // has been transformed to something more readable at the start here.
3116
3117                 if (i > 0)
3118                 {
3119                         char name[10];
3120                         // LordHavoc: only register submodels if it is the world
3121                         // (prevents external bsp models from replacing world submodels with
3122                         //  their own)
3123                         if (!loadmodel->isworldmodel)
3124                                 continue;
3125                         // duplicate the basic information
3126                         sprintf(name, "*%i", i);
3127                         mod = Mod_FindName(name);
3128                         // copy the base model to this one
3129                         *mod = *loadmodel;
3130                         // rename the clone back to its proper name
3131                         strcpy(mod->name, name);
3132                         // textures and memory belong to the main model
3133                         mod->texturepool = NULL;
3134                         mod->mempool = NULL;
3135                 }
3136
3137                 mod->brush.submodel = i;
3138
3139                 if (loadmodel->brush.submodels)
3140                         loadmodel->brush.submodels[i] = mod;
3141
3142                 bm = &mod->brushq1.submodels[i];
3143
3144                 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3145                 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3146                 {
3147                         mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3148                         mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3149                 }
3150
3151                 mod->firstmodelsurface = bm->firstface;
3152                 mod->nummodelsurfaces = bm->numfaces;
3153
3154                 // make the model surface list (used by shadowing/lighting)
3155                 mod->surfacelist = Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
3156                 for (j = 0;j < mod->nummodelsurfaces;j++)
3157                         mod->surfacelist[j] = mod->firstmodelsurface + j;
3158
3159                 // this gets altered below if sky is used
3160                 mod->DrawSky = NULL;
3161                 mod->Draw = R_Q1BSP_Draw;
3162                 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3163                 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3164                 mod->DrawLight = R_Q1BSP_DrawLight;
3165                 if (i != 0)
3166                 {
3167                         mod->brush.GetPVS = NULL;
3168                         mod->brush.FatPVS = NULL;
3169                         mod->brush.BoxTouchingPVS = NULL;
3170                         mod->brush.BoxTouchingLeafPVS = NULL;
3171                         mod->brush.BoxTouchingVisibleLeafs = NULL;
3172                         mod->brush.LightPoint = NULL;
3173                         mod->brush.AmbientSoundLevelsForPoint = NULL;
3174                 }
3175                 Mod_Q1BSP_BuildLightmapUpdateChains(loadmodel->mempool, mod);
3176                 if (mod->nummodelsurfaces)
3177                 {
3178                         // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3179                         mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3180                         mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3181                         modelyawradius = 0;
3182                         modelradius = 0;
3183                         for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3184                         {
3185                                 // we only need to have a drawsky function if it is used(usually only on world model)
3186                                 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3187                                         mod->DrawSky = R_Q1BSP_DrawSky;
3188                                 // calculate bounding shapes
3189                                 for (k = 0, vec = (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex);k < surface->num_vertices;k++, vec += 3)
3190                                 {
3191                                         if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3192                                         if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3193                                         if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3194                                         if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3195                                         if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3196                                         if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3197                                         dist = vec[0]*vec[0]+vec[1]*vec[1];
3198                                         if (modelyawradius < dist)
3199                                                 modelyawradius = dist;
3200                                         dist += vec[2]*vec[2];
3201                                         if (modelradius < dist)
3202                                                 modelradius = dist;
3203                                 }
3204                         }
3205                         modelyawradius = sqrt(modelyawradius);
3206                         modelradius = sqrt(modelradius);
3207                         mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3208                         mod->yawmins[2] = mod->normalmins[2];
3209                         mod->yawmaxs[2] = mod->normalmaxs[2];
3210                         mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3211                         mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3212                         mod->radius = modelradius;
3213                         mod->radius2 = modelradius * modelradius;
3214                 }
3215                 else
3216                 {
3217                         // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3218                         Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3219                 }
3220                 //mod->brushq1.num_visleafs = bm->visleafs;
3221         }
3222
3223         Mod_Q1BSP_LoadMapBrushes();
3224
3225         //Mod_Q1BSP_ProcessLightList();
3226
3227         if (developer.integer)
3228                 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);
3229 }
3230
3231 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3232 {
3233 }
3234
3235 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3236 {
3237 /*
3238         d_t *in;
3239         m_t *out;
3240         int i, count;
3241
3242         in = (void *)(mod_base + l->fileofs);
3243         if (l->filelen % sizeof(*in))
3244                 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3245         count = l->filelen / sizeof(*in);
3246         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3247
3248         loadmodel-> = out;
3249         loadmodel->num = count;
3250
3251         for (i = 0;i < count;i++, in++, out++)
3252         {
3253         }
3254 */
3255 }
3256
3257 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3258 {
3259 /*
3260         d_t *in;
3261         m_t *out;
3262         int i, count;
3263
3264         in = (void *)(mod_base + l->fileofs);
3265         if (l->filelen % sizeof(*in))
3266                 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3267         count = l->filelen / sizeof(*in);
3268         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3269
3270         loadmodel-> = out;
3271         loadmodel->num = count;
3272
3273         for (i = 0;i < count;i++, in++, out++)
3274         {
3275         }
3276 */
3277 }
3278
3279 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3280 {
3281 /*
3282         d_t *in;
3283         m_t *out;
3284         int i, count;
3285
3286         in = (void *)(mod_base + l->fileofs);
3287         if (l->filelen % sizeof(*in))
3288                 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3289         count = l->filelen / sizeof(*in);
3290         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3291
3292         loadmodel-> = out;
3293         loadmodel->num = count;
3294
3295         for (i = 0;i < count;i++, in++, out++)
3296         {
3297         }
3298 */
3299 }
3300
3301 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3302 {
3303 /*
3304         d_t *in;
3305         m_t *out;
3306         int i, count;
3307
3308         in = (void *)(mod_base + l->fileofs);
3309         if (l->filelen % sizeof(*in))
3310                 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3311         count = l->filelen / sizeof(*in);
3312         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3313
3314         loadmodel-> = out;
3315         loadmodel->num = count;
3316
3317         for (i = 0;i < count;i++, in++, out++)
3318         {
3319         }
3320 */
3321 }
3322
3323 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3324 {
3325 /*
3326         d_t *in;
3327         m_t *out;
3328         int i, count;
3329
3330         in = (void *)(mod_base + l->fileofs);
3331         if (l->filelen % sizeof(*in))
3332                 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3333         count = l->filelen / sizeof(*in);
3334         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3335
3336         loadmodel-> = out;
3337         loadmodel->num = count;
3338
3339         for (i = 0;i < count;i++, in++, out++)
3340         {
3341         }
3342 */
3343 }
3344
3345 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3346 {
3347 /*
3348         d_t *in;
3349         m_t *out;
3350         int i, count;
3351
3352         in = (void *)(mod_base + l->fileofs);
3353         if (l->filelen % sizeof(*in))
3354                 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3355         count = l->filelen / sizeof(*in);
3356         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3357
3358         loadmodel-> = out;
3359         loadmodel->num = count;
3360
3361         for (i = 0;i < count;i++, in++, out++)
3362         {
3363         }
3364 */
3365 }
3366
3367 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3368 {
3369 /*
3370         d_t *in;
3371         m_t *out;
3372         int i, count;
3373
3374         in = (void *)(mod_base + l->fileofs);
3375         if (l->filelen % sizeof(*in))
3376                 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3377         count = l->filelen / sizeof(*in);
3378         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3379
3380         loadmodel-> = out;
3381         loadmodel->num = count;
3382
3383         for (i = 0;i < count;i++, in++, out++)
3384         {
3385         }
3386 */
3387 }
3388
3389 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3390 {
3391 /*
3392         d_t *in;
3393         m_t *out;
3394         int i, count;
3395
3396         in = (void *)(mod_base + l->fileofs);
3397         if (l->filelen % sizeof(*in))
3398                 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3399         count = l->filelen / sizeof(*in);
3400         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3401
3402         loadmodel-> = out;
3403         loadmodel->num = count;
3404
3405         for (i = 0;i < count;i++, in++, out++)
3406         {
3407         }
3408 */
3409 }
3410
3411 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3412 {
3413 /*
3414         d_t *in;
3415         m_t *out;
3416         int i, count;
3417
3418         in = (void *)(mod_base + l->fileofs);
3419         if (l->filelen % sizeof(*in))
3420                 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3421         count = l->filelen / sizeof(*in);
3422         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3423
3424         loadmodel-> = out;
3425         loadmodel->num = count;
3426
3427         for (i = 0;i < count;i++, in++, out++)
3428         {
3429         }
3430 */
3431 }
3432
3433 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3434 {
3435 /*
3436         d_t *in;
3437         m_t *out;
3438         int i, count;
3439
3440         in = (void *)(mod_base + l->fileofs);
3441         if (l->filelen % sizeof(*in))
3442                 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3443         count = l->filelen / sizeof(*in);
3444         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3445
3446         loadmodel-> = out;
3447         loadmodel->num = count;
3448
3449         for (i = 0;i < count;i++, in++, out++)
3450         {
3451         }
3452 */
3453 }
3454
3455 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3456 {
3457 /*
3458         d_t *in;
3459         m_t *out;
3460         int i, count;
3461
3462         in = (void *)(mod_base + l->fileofs);
3463         if (l->filelen % sizeof(*in))
3464                 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3465         count = l->filelen / sizeof(*in);
3466         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3467
3468         loadmodel-> = out;
3469         loadmodel->num = count;
3470
3471         for (i = 0;i < count;i++, in++, out++)
3472         {
3473         }
3474 */
3475 }
3476
3477 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3478 {
3479 /*
3480         d_t *in;
3481         m_t *out;
3482         int i, count;
3483
3484         in = (void *)(mod_base + l->fileofs);
3485         if (l->filelen % sizeof(*in))
3486                 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3487         count = l->filelen / sizeof(*in);
3488         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3489
3490         loadmodel-> = out;
3491         loadmodel->num = count;
3492
3493         for (i = 0;i < count;i++, in++, out++)
3494         {
3495         }
3496 */
3497 }
3498
3499 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3500 {
3501 /*
3502         d_t *in;
3503         m_t *out;
3504         int i, count;
3505
3506         in = (void *)(mod_base + l->fileofs);
3507         if (l->filelen % sizeof(*in))
3508                 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3509         count = l->filelen / sizeof(*in);
3510         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3511
3512         loadmodel-> = out;
3513         loadmodel->num = count;
3514
3515         for (i = 0;i < count;i++, in++, out++)
3516         {
3517         }
3518 */
3519 }
3520
3521 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
3522 {
3523 /*
3524         d_t *in;
3525         m_t *out;
3526         int i, count;
3527
3528         in = (void *)(mod_base + l->fileofs);
3529         if (l->filelen % sizeof(*in))
3530                 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3531         count = l->filelen / sizeof(*in);
3532         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3533
3534         loadmodel-> = out;
3535         loadmodel->num = count;
3536
3537         for (i = 0;i < count;i++, in++, out++)
3538         {
3539         }
3540 */
3541 }
3542
3543 static void Mod_Q2BSP_LoadAreas(lump_t *l)
3544 {
3545 /*
3546         d_t *in;
3547         m_t *out;
3548         int i, count;
3549
3550         in = (void *)(mod_base + l->fileofs);
3551         if (l->filelen % sizeof(*in))
3552                 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
3553         count = l->filelen / sizeof(*in);
3554         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3555
3556         loadmodel-> = out;
3557         loadmodel->num = count;
3558
3559         for (i = 0;i < count;i++, in++, out++)
3560         {
3561         }
3562 */
3563 }
3564
3565 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
3566 {
3567 /*
3568         d_t *in;
3569         m_t *out;
3570         int i, count;
3571
3572         in = (void *)(mod_base + l->fileofs);
3573         if (l->filelen % sizeof(*in))
3574                 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
3575         count = l->filelen / sizeof(*in);
3576         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3577
3578         loadmodel-> = out;
3579         loadmodel->num = count;
3580
3581         for (i = 0;i < count;i++, in++, out++)
3582         {
3583         }
3584 */
3585 }
3586
3587 static void Mod_Q2BSP_LoadModels(lump_t *l)
3588 {
3589 /*
3590         d_t *in;
3591         m_t *out;
3592         int i, count;
3593
3594         in = (void *)(mod_base + l->fileofs);
3595         if (l->filelen % sizeof(*in))
3596                 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
3597         count = l->filelen / sizeof(*in);
3598         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3599
3600         loadmodel-> = out;
3601         loadmodel->num = count;
3602
3603         for (i = 0;i < count;i++, in++, out++)
3604         {
3605         }
3606 */
3607 }
3608
3609 void static Mod_Q2BSP_Load(model_t *mod, void *buffer, void *bufferend)
3610 {
3611         int i;
3612         q2dheader_t *header;
3613
3614         Host_Error("Mod_Q2BSP_Load: not yet implemented\n");
3615
3616         mod->type = mod_brushq2;
3617
3618         header = (q2dheader_t *)buffer;
3619
3620         i = LittleLong(header->version);
3621         if (i != Q2BSPVERSION)
3622                 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
3623         mod->brush.ishlbsp = false;
3624         mod->brush.ismcbsp = false;
3625         if (loadmodel->isworldmodel)
3626         {
3627                 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3628                 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3629         }
3630
3631         mod_base = (qbyte *)header;
3632
3633         // swap all the lumps
3634         for (i = 0;i < (int) sizeof(*header) / 4;i++)
3635                 ((int *)header)[i] = LittleLong(((int *)header)[i]);
3636
3637         // store which lightmap format to use
3638         mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3639
3640         Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
3641         Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
3642         Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
3643         Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
3644         Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
3645         Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
3646         Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
3647         Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
3648         Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
3649         Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
3650         Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
3651         Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
3652         Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
3653         Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
3654         Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
3655         Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
3656         Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
3657         // LordHavoc: must go last because this makes the submodels
3658         Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
3659 }
3660
3661 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents);
3662 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents);
3663
3664 static void Mod_Q3BSP_LoadEntities(lump_t *l)
3665 {
3666         const char *data;
3667         char key[128], value[4096];
3668         float v[3];
3669         loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
3670         loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
3671         loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
3672         if (!l->filelen)
3673                 return;
3674         loadmodel->brush.entities = Mem_Alloc(loadmodel->mempool, l->filelen);
3675         memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
3676         data = loadmodel->brush.entities;
3677         // some Q3 maps override the lightgrid_cellsize with a worldspawn key
3678         if (data && COM_ParseToken(&data, false) && com_token[0] == '{')
3679         {
3680                 while (1)
3681                 {
3682                         if (!COM_ParseToken(&data, false))
3683                                 break; // error
3684                         if (com_token[0] == '}')
3685                                 break; // end of worldspawn
3686                         if (com_token[0] == '_')
3687                                 strcpy(key, com_token + 1);
3688                         else
3689                                 strcpy(key, com_token);
3690                         while (key[strlen(key)-1] == ' ') // remove trailing spaces
3691                                 key[strlen(key)-1] = 0;
3692                         if (!COM_ParseToken(&data, false))
3693                                 break; // error
3694                         strcpy(value, com_token);
3695                         if (!strcmp("gridsize", key))
3696                         {
3697                                 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
3698                                         VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
3699                         }
3700                 }
3701         }
3702 }
3703
3704 static void Mod_Q3BSP_LoadTextures(lump_t *l)
3705 {
3706         q3dtexture_t *in;
3707         texture_t *out;
3708         int i, count;
3709         int j, c;
3710         fssearch_t *search;
3711         char *f;
3712         const char *text;
3713         int flags, flags2, numparameters, passnumber;
3714         char shadername[Q3PATHLENGTH];
3715         char sky[Q3PATHLENGTH];
3716         char firstpasstexturename[Q3PATHLENGTH];
3717         char parameter[4][Q3PATHLENGTH];
3718
3719         in = (void *)(mod_base + l->fileofs);
3720         if (l->filelen % sizeof(*in))
3721                 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
3722         count = l->filelen / sizeof(*in);
3723         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3724
3725         loadmodel->data_textures = out;
3726         loadmodel->num_textures = count;
3727
3728         for (i = 0;i < count;i++, in++, out++)
3729         {
3730                 strlcpy (out->name, in->name, sizeof (out->name));
3731                 out->surfaceflags = LittleLong(in->surfaceflags);
3732                 out->supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in->contents));
3733                 out->surfaceparms = -1;
3734         }
3735
3736         // do a quick parse of shader files to get surfaceparms
3737         if ((search = FS_Search("scripts/*.shader", true, false)))
3738         {
3739                 for (i = 0;i < search->numfilenames;i++)
3740                 {
3741                         if ((f = FS_LoadFile(search->filenames[i], tempmempool, false)))
3742                         {
3743                                 text = f;
3744                                 while (COM_ParseToken(&text, false))
3745                                 {
3746                                         strlcpy (shadername, com_token, sizeof (shadername));
3747                                         flags = 0;
3748                                         flags2 = 0;
3749                                         sky[0] = 0;
3750                                         passnumber = 0;
3751                                         firstpasstexturename[0] = 0;
3752                                         if (COM_ParseToken(&text, false) && !strcasecmp(com_token, "{"))
3753                                         {
3754                                                 while (COM_ParseToken(&text, false))
3755                                                 {
3756                                                         if (!strcasecmp(com_token, "}"))
3757                                                                 break;
3758                                                         else if (!strcasecmp(com_token, "{"))
3759                                                         {
3760                                                                 while (COM_ParseToken(&text, false))
3761                                                                 {
3762                                                                         if (!strcasecmp(com_token, "}"))
3763                                                                                 break;
3764                                                                         if (!strcasecmp(com_token, "\n"))
3765                                                                                 continue;
3766                                                                         numparameters = 0;
3767                                                                         for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
3768                                                                         {
3769                                                                                 if (j < 4)
3770                                                                                 {
3771                                                                                         strlcpy(parameter[j], com_token, sizeof(parameter[j]));
3772                                                                                         numparameters = j + 1;
3773                                                                                 }
3774                                                                                 if (!COM_ParseToken(&text, true))
3775                                                                                         break;
3776                                                                         }
3777                                                                         if (developer.integer >= 2)
3778                                                                         {
3779                                                                                 Con_Printf("%s %i: ", shadername, passnumber);
3780                                                                                 for (j = 0;j < numparameters;j++)
3781                                                                                         Con_Printf(" %s", parameter[j]);
3782                                                                                 Con_Print("\n");
3783                                                                         }
3784                                                                         if (passnumber == 0 && numparameters >= 1)
3785                                                                         {
3786                                                                                 if (!strcasecmp(parameter[0], "blendfunc") && (flags & Q3SURFACEPARM_TRANS))
3787                                                                                 {
3788                                                                                         if (numparameters == 2 && !strcasecmp(parameter[1], "add"))
3789                                                                                                 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3790                                                                                         else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_one") && !strcasecmp(parameter[2], "gl_one"))
3791                                                                                                 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3792                                                                                         else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_src_alpha") && !strcasecmp(parameter[2], "gl_one"))
3793                                                                                                 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3794                                                                                 }
3795                                                                                 else if (numparameters >= 2 && (!strcasecmp(parameter[0], "map") || !strcasecmp(parameter[0], "clampmap")))
3796                                                                                         strlcpy(firstpasstexturename, parameter[1], sizeof(firstpasstexturename));
3797                                                                                 else if (numparameters >= 3 && !strcasecmp(parameter[0], "animmap"))
3798                                                                                         strlcpy(firstpasstexturename, parameter[2], sizeof(firstpasstexturename));
3799                                                                                 else if (numparameters >= 2 && !strcasecmp(parameter[0], "alphafunc"))
3800                                                                                         flags2 |= Q3TEXTUREFLAG_ALPHATEST;
3801                                                                         }
3802                                                                         // break out a level if it was }
3803                                                                         if (!strcasecmp(com_token, "}"))
3804                                                                                 break;
3805                                                                 }
3806                                                                 passnumber++;
3807                                                                 continue;
3808                                                         }
3809                                                         numparameters = 0;
3810                                                         for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
3811                                                         {
3812                                                                 if (j < 4)
3813                                                                 {
3814                                                                         strlcpy(parameter[j], com_token, sizeof(parameter[j]));
3815                                                                         numparameters = j + 1;
3816                                                                 }
3817                                                                 if (!COM_ParseToken(&text, true))
3818                                                                         break;
3819                                                         }
3820                                                         if (i == 0 && !strcasecmp(com_token, "}"))
3821                                                                 break;
3822                                                         if (developer.integer >= 2)
3823                                                         {
3824                                                                 Con_Printf("%s: ", shadername);
3825                                                                 for (j = 0;j < numparameters;j++)
3826                                                                         Con_Printf(" %s", parameter[j]);
3827                                                                 Con_Print("\n");
3828                                                         }
3829                                                         if (numparameters < 1)
3830                                                                 continue;
3831                                                         if (!strcasecmp(parameter[0], "surfaceparm") && numparameters >= 2)
3832                                                         {
3833                                                                 if (!strcasecmp(parameter[1], "alphashadow"))
3834                                                                         flags |= Q3SURFACEPARM_ALPHASHADOW;
3835                                                                 else if (!strcasecmp(parameter[1], "areaportal"))
3836                                                                         flags |= Q3SURFACEPARM_AREAPORTAL;
3837                                                                 else if (!strcasecmp(parameter[1], "clusterportal"))
3838                                                                         flags |= Q3SURFACEPARM_CLUSTERPORTAL;
3839                                                                 else if (!strcasecmp(parameter[1], "detail"))
3840                                                                         flags |= Q3SURFACEPARM_DETAIL;
3841                                                                 else if (!strcasecmp(parameter[1], "donotenter"))
3842                                                                         flags |= Q3SURFACEPARM_DONOTENTER;
3843                                                                 else if (!strcasecmp(parameter[1], "fog"))
3844                                                                         flags |= Q3SURFACEPARM_FOG;
3845                                                                 else if (!strcasecmp(parameter[1], "lava"))
3846                                                                         flags |= Q3SURFACEPARM_LAVA;
3847                                                                 else if (!strcasecmp(parameter[1], "lightfilter"))
3848                                                                         flags |= Q3SURFACEPARM_LIGHTFILTER;
3849                                                                 else if (!strcasecmp(parameter[1], "metalsteps"))
3850                                                                         flags |= Q3SURFACEPARM_METALSTEPS;
3851                                                                 else if (!strcasecmp(parameter[1], "nodamage"))
3852                                                                         flags |= Q3SURFACEPARM_NODAMAGE;
3853                                                                 else if (!strcasecmp(parameter[1], "nodlight"))
3854                                                                         flags |= Q3SURFACEPARM_NODLIGHT;
3855                                                                 else if (!strcasecmp(parameter[1], "nodraw"))
3856                                                                         flags |= Q3SURFACEPARM_NODRAW;
3857                                                                 else if (!strcasecmp(parameter[1], "nodrop"))
3858                                                                         flags |= Q3SURFACEPARM_NODROP;
3859                                                                 else if (!strcasecmp(parameter[1], "noimpact"))
3860                                                                         flags |= Q3SURFACEPARM_NOIMPACT;
3861                                                                 else if (!strcasecmp(parameter[1], "nolightmap"))
3862                                                                         flags |= Q3SURFACEPARM_NOLIGHTMAP;
3863                                                                 else if (!strcasecmp(parameter[1], "nomarks"))
3864                                                                         flags |= Q3SURFACEPARM_NOMARKS;
3865                                                                 else if (!strcasecmp(parameter[1], "nomipmaps"))
3866                                                                         flags |= Q3SURFACEPARM_NOMIPMAPS;
3867                                                                 else if (!strcasecmp(parameter[1], "nonsolid"))
3868                                                                         flags |= Q3SURFACEPARM_NONSOLID;
3869                                                                 else if (!strcasecmp(parameter[1], "origin"))
3870                                                                         flags |= Q3SURFACEPARM_ORIGIN;
3871                                                                 else if (!strcasecmp(parameter[1], "playerclip"))
3872                                                                         flags |= Q3SURFACEPARM_PLAYERCLIP;
3873                                                                 else if (!strcasecmp(parameter[1], "sky"))
3874                                                                         flags |= Q3SURFACEPARM_SKY;
3875                                                                 else if (!strcasecmp(parameter[1], "slick"))
3876                                                                         flags |= Q3SURFACEPARM_SLICK;
3877                                                                 else if (!strcasecmp(parameter[1], "slime"))
3878                                                                         flags |= Q3SURFACEPARM_SLIME;
3879                                                                 else if (!strcasecmp(parameter[1], "structural"))
3880                                                                         flags |= Q3SURFACEPARM_STRUCTURAL;
3881                                                                 else if (!strcasecmp(parameter[1], "trans"))
3882                                                                         flags |= Q3SURFACEPARM_TRANS;
3883                                                                 else if (!strcasecmp(parameter[1], "water"))
3884                                                                         flags |= Q3SURFACEPARM_WATER;
3885                                                                 else if (!strcasecmp(parameter[1], "pointlight"))
3886                                                                         flags |= Q3SURFACEPARM_POINTLIGHT;
3887                                                                 else
3888                                                                         Con_Printf("%s parsing warning: unknown surfaceparm \"%s\"\n", search->filenames[i], parameter[1]);
3889                                                         }
3890                                                         else if (!strcasecmp(parameter[0], "sky") && numparameters >= 2)
3891                                                                 strlcpy(sky, parameter[1], sizeof(sky));
3892                                                         else if (!strcasecmp(parameter[0], "skyparms") && numparameters >= 2)
3893                                                         {
3894                                                                 if (!atoi(parameter[1]) && strcasecmp(parameter[1], "-"))
3895                                                                         strlcpy(sky, parameter[1], sizeof(sky));
3896                                                         }
3897                                                         else if (!strcasecmp(parameter[0], "cull") && numparameters >= 2)
3898                                                         {
3899                                                                 if (!strcasecmp(parameter[1], "disable") || !strcasecmp(parameter[1], "none") || !strcasecmp(parameter[1], "twosided"))
3900                                                                         flags2 |= Q3TEXTUREFLAG_TWOSIDED;
3901                                                         }
3902                                                         else if (!strcasecmp(parameter[0], "nomipmaps"))
3903                                                                 flags2 |= Q3TEXTUREFLAG_NOMIPMAPS;
3904                                                         else if (!strcasecmp(parameter[0], "nopicmip"))
3905                                                                 flags2 |= Q3TEXTUREFLAG_NOPICMIP;
3906                                                         else if (!strcasecmp(parameter[0], "deformvertexes") && numparameters >= 2)
3907                                                         {
3908                                                                 if (!strcasecmp(parameter[1], "autosprite") && numparameters == 2)
3909                                                                         flags2 |= Q3TEXTUREFLAG_AUTOSPRITE;
3910                                                                 if (!strcasecmp(parameter[1], "autosprite2") && numparameters == 2)
3911                                                                         flags2 |= Q3TEXTUREFLAG_AUTOSPRITE2;
3912                                                         }
3913                                                 }
3914                                                 // add shader to list (shadername and flags)
3915                                                 // actually here we just poke into the texture settings
3916                                                 for (j = 0, out = loadmodel->data_textures;j < loadmodel->num_textures;j++, out++)
3917                                                 {
3918                                                         if (!strcasecmp(out->name, shadername))
3919                                                         {
3920                                                                 out->surfaceparms = flags;
3921                                                                 out->textureflags = flags2;
3922                                                                 out->basematerialflags = 0;
3923                                                                 if (out->surfaceparms & Q3SURFACEPARM_NODRAW)
3924                                                                         out->basematerialflags |= MATERIALFLAG_NODRAW;
3925                                                                 else if (out->surfaceparms & Q3SURFACEPARM_SKY)
3926                                                                         out->basematerialflags |= MATERIALFLAG_SKY;
3927                                                                 else if (out->surfaceparms & Q3SURFACEPARM_LAVA)
3928                                                                         out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_FULLBRIGHT;
3929                                                                 else if (out->surfaceparms & Q3SURFACEPARM_SLIME)
3930                                                                         out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_WATERALPHA;
3931                                                                 else if (out->surfaceparms & Q3SURFACEPARM_WATER)
3932                                                                         out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_WATERALPHA;
3933                                                                 else
3934                                                                         out->basematerialflags |= MATERIALFLAG_WALL;
3935                                                                 if (out->textureflags & Q3TEXTUREFLAG_ALPHATEST)
3936                                                                 {
3937                                                                         // FIXME: support alpha test?
3938                                                                         out->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
3939                                                                 }
3940                                                                 else if (out->surfaceparms & Q3SURFACEPARM_TRANS)
3941                                                                 {
3942                                                                         if (out->textureflags & Q3TEXTUREFLAG_ADDITIVE)
3943                                                                                 out->basematerialflags |= MATERIALFLAG_ADD | MATERIALFLAG_TRANSPARENT;
3944                                                                         else
3945                                                                                 out->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
3946                                                                 }
3947                                                                 strlcpy(out->firstpasstexturename, firstpasstexturename, sizeof(out->firstpasstexturename));
3948                                                                 if ((flags & Q3SURFACEPARM_SKY) && sky[0])
3949                                                                 {
3950                                                                         // quake3 seems to append a _ to the skybox name, so this must do so as well
3951                                                                         dpsnprintf(loadmodel->brush.skybox, sizeof(loadmodel->brush.skybox), "%s_", sky);
3952                                                                 }
3953                                                         }
3954                                                 }
3955                                         }
3956                                         else
3957                                         {
3958                                                 Con_Printf("%s parsing error - expected \"{\", found \"%s\"\n", search->filenames[i], com_token);
3959                                                 goto parseerror;
3960                                         }
3961                                 }
3962 parseerror:
3963                                 Mem_Free(f);
3964                         }
3965                 }
3966         }
3967
3968         c = 0;
3969         for (j = 0, out = loadmodel->data_textures;j < loadmodel->num_textures;j++, out++)
3970         {
3971                 if (out->surfaceparms == -1)
3972                 {
3973                         c++;
3974                         Con_DPrintf("%s: No shader found for texture \"%s\"\n", loadmodel->name, out->name);
3975                         out->surfaceparms = 0;
3976                         if (out->surfaceflags & Q3SURFACEFLAG_NODRAW)
3977                                 out->basematerialflags |= MATERIALFLAG_NODRAW;
3978                         else if (out->surfaceflags & Q3SURFACEFLAG_SKY)
3979                                 out->basematerialflags |= MATERIALFLAG_SKY;
3980                         else
3981                                 out->basematerialflags |= MATERIALFLAG_WALL;
3982                         // these are defaults
3983                         //if (!strncmp(out->name, "textures/skies/", 15))
3984                         //      out->surfaceparms |= Q3SURFACEPARM_SKY;
3985                         //if (!strcmp(out->name, "caulk") || !strcmp(out->name, "common/caulk") || !strcmp(out->name, "textures/common/caulk")
3986                         // || !strcmp(out->name, "nodraw") || !strcmp(out->name, "common/nodraw") || !strcmp(out->name, "textures/common/nodraw"))
3987                         //      out->surfaceparms |= Q3SURFACEPARM_NODRAW;
3988                         //if (R_TextureHasAlpha(out->skin.base))
3989                         //      out->surfaceparms |= Q3SURFACEPARM_TRANS;
3990                 }
3991                 if (!Mod_LoadSkinFrame(&out->skin, out->name, (((out->textureflags & Q3TEXTUREFLAG_NOMIPMAPS) || (out->surfaceparms & Q3SURFACEPARM_NOMIPMAPS)) ? 0 : TEXF_MIPMAP) | TEXF_ALPHA | TEXF_PRECACHE | (out->textureflags & Q3TEXTUREFLAG_NOPICMIP ? 0 : TEXF_PICMIP), false, false, true))
3992                         if (!Mod_LoadSkinFrame(&out->skin, out->firstpasstexturename, (((out->textureflags & Q3TEXTUREFLAG_NOMIPMAPS) || (out->surfaceparms & Q3SURFACEPARM_NOMIPMAPS)) ? 0 : TEXF_MIPMAP) | TEXF_ALPHA | TEXF_PRECACHE | (out->textureflags & Q3TEXTUREFLAG_NOPICMIP ? 0 : TEXF_PICMIP), false, false, true))
3993                                 if (cls.state != ca_dedicated)
3994                                         Con_Printf("%s: texture loading for shader \"%s\" failed (first layer \"%s\" not found either)\n", loadmodel->name, out->name, out->firstpasstexturename);
3995                 // no animation
3996                 out->currentframe = out;
3997         }
3998         if (c)
3999                 Con_DPrintf("%s: %i textures missing shaders\n", loadmodel->name, c);
4000 }
4001
4002 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4003 {
4004         q3dplane_t *in;
4005         mplane_t *out;
4006         int i, count;
4007
4008         in = (void *)(mod_base + l->fileofs);
4009         if (l->filelen % sizeof(*in))
4010                 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4011         count = l->filelen / sizeof(*in);
4012         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4013
4014         loadmodel->brush.data_planes = out;
4015         loadmodel->brush.num_planes = count;
4016
4017         for (i = 0;i < count;i++, in++, out++)
4018         {
4019                 out->normal[0] = LittleFloat(in->normal[0]);
4020                 out->normal[1] = LittleFloat(in->normal[1]);
4021                 out->normal[2] = LittleFloat(in->normal[2]);
4022                 out->dist = LittleFloat(in->dist);
4023                 PlaneClassify(out);
4024         }
4025 }
4026
4027 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4028 {
4029         q3dbrushside_t *in;
4030         q3mbrushside_t *out;
4031         int i, n, count;
4032
4033         in = (void *)(mod_base + l->fileofs);
4034         if (l->filelen % sizeof(*in))
4035                 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4036         count = l->filelen / sizeof(*in);
4037         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4038
4039         loadmodel->brush.data_brushsides = out;
4040         loadmodel->brush.num_brushsides = count;
4041
4042         for (i = 0;i < count;i++, in++, out++)
4043         {
4044                 n = LittleLong(in->planeindex);
4045                 if (n < 0 || n >= loadmodel->brush.num_planes)
4046                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)\n", n, loadmodel->brush.num_planes);
4047                 out->plane = loadmodel->brush.data_planes + n;
4048                 n = LittleLong(in->textureindex);
4049                 if (n < 0 || n >= loadmodel->num_textures)
4050                         Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)\n", n, loadmodel->num_textures);
4051                 out->texture = loadmodel->data_textures + n;
4052         }
4053 }
4054
4055 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4056 {
4057         q3dbrush_t *in;
4058         q3mbrush_t *out;
4059         int i, j, n, c, count, maxplanes;
4060         mplane_t *planes;
4061
4062         in = (void *)(mod_base + l->fileofs);
4063         if (l->filelen % sizeof(*in))
4064                 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4065         count = l->filelen / sizeof(*in);
4066         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4067
4068         loadmodel->brush.data_brushes = out;
4069         loadmodel->brush.num_brushes = count;
4070
4071         maxplanes = 0;
4072         planes = NULL;
4073
4074         for (i = 0;i < count;i++, in++, out++)
4075         {
4076                 n = LittleLong(in->firstbrushside);
4077                 c = LittleLong(in->numbrushsides);
4078                 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4079                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)\n", n, n + c, loadmodel->brush.num_brushsides);
4080                 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4081                 out->numbrushsides = c;
4082                 n = LittleLong(in->textureindex);
4083                 if (n < 0 || n >= loadmodel->num_textures)
4084                         Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)\n", n, loadmodel->num_textures);
4085                 out->texture = loadmodel->data_textures + n;
4086
4087                 // make a list of mplane_t structs to construct a colbrush from
4088                 if (maxplanes < out->numbrushsides)
4089                 {
4090                         maxplanes = out->numbrushsides;
4091                         if (planes)
4092                                 Mem_Free(planes);
4093                         planes = Mem_Alloc(tempmempool, sizeof(mplane_t) * maxplanes);
4094                 }
4095                 for (j = 0;j < out->numbrushsides;j++)
4096                 {
4097                         VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4098                         planes[j].dist = out->firstbrushside[j].plane->dist;
4099                 }
4100                 // make the colbrush from the planes
4101                 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4102         }
4103         if (planes)
4104                 Mem_Free(planes);
4105 }
4106
4107 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4108 {
4109         q3deffect_t *in;
4110         q3deffect_t *out;
4111         int i, n, count;
4112
4113         in = (void *)(mod_base + l->fileofs);
4114         if (l->filelen % sizeof(*in))
4115                 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4116         count = l->filelen / sizeof(*in);
4117         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4118
4119         loadmodel->brushq3.data_effects = out;
4120         loadmodel->brushq3.num_effects = count;
4121
4122         for (i = 0;i < count;i++, in++, out++)
4123         {
4124                 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4125                 n = LittleLong(in->brushindex);
4126                 if (n < 0 || n >= loadmodel->brush.num_brushes)
4127                         Host_Error("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes)\n", n, loadmodel->brush.num_brushes);
4128                 out->brushindex = n;
4129                 out->unknown = LittleLong(in->unknown);
4130         }
4131 }
4132
4133 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4134 {
4135         q3dvertex_t *in;
4136         int i, count;
4137
4138         in = (void *)(mod_base + l->fileofs);
4139         if (l->filelen % sizeof(*in))
4140                 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4141         loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4142         loadmodel->brushq3.data_vertex3f = Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 2 + 2 + 4)));
4143         loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_vertex3f + count * 3;
4144         loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4145         loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4146
4147         for (i = 0;i < count;i++, in++)
4148         {
4149                 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4150                 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4151                 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4152                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4153                 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4154                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4155                 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4156                 // svector/tvector are calculated later in face loading
4157                 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4158                 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4159                 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4160                 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4161         }
4162 }
4163
4164 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4165 {
4166         int *in;
4167         int *out;
4168         int i, count;
4169
4170         in = (void *)(mod_base + l->fileofs);
4171         if (l->filelen % sizeof(int[3]))
4172                 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4173         count = l->filelen / sizeof(*in);
4174         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4175
4176         loadmodel->brushq3.num_triangles = count / 3;
4177         loadmodel->brushq3.data_element3i = out;
4178
4179         for (i = 0;i < count;i++, in++, out++)
4180         {
4181                 *out = LittleLong(*in);
4182                 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4183                 {
4184                         Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4185                         *out = 0;
4186                 }
4187         }
4188 }
4189
4190 static void Mod_Q3BSP_LoadLightmaps(lump_t *l)
4191 {
4192         q3dlightmap_t *in;
4193         rtexture_t **out;
4194         int i, count;
4195
4196         if (!l->filelen)
4197                 return;
4198         in = (void *)(mod_base + l->fileofs);
4199         if (l->filelen % sizeof(*in))
4200                 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4201         count = l->filelen / sizeof(*in);
4202         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4203
4204         loadmodel->brushq3.data_lightmaps = out;
4205         loadmodel->brushq3.num_lightmaps = count;
4206
4207         for (i = 0;i < count;i++, in++, out++)
4208                 *out = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", i), 128, 128, in->rgb, TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
4209 }
4210
4211 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4212 {
4213         q3dface_t *in, *oldin;
4214         msurface_t *out, *oldout;
4215         int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshnum, meshvertices, meshtriangles, numvertices, numtriangles;
4216         //int *originalelement3i;
4217         //int *originalneighbor3i;
4218         float *originalvertex3f;
4219         //float *originalsvector3f;
4220         //float *originaltvector3f;
4221         //float *originalnormal3f;
4222         float *originalcolor4f;
4223         float *originaltexcoordtexture2f;
4224         float *originaltexcoordlightmap2f;
4225         float *v;
4226         surfmesh_t *mesh, *tempmeshlist[1024];
4227
4228         in = (void *)(mod_base + l->fileofs);
4229         if (l->filelen % sizeof(*in))
4230                 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4231         count = l->filelen / sizeof(*in);
4232         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4233
4234         loadmodel->data_surfaces = out;
4235         loadmodel->num_surfaces = count;
4236
4237         i = 0;
4238         for (meshnum = 0;i < count;meshnum++)
4239         {
4240                 oldi = i;
4241                 oldin = in;
4242                 oldout = out;
4243                 meshvertices = 0;
4244                 meshtriangles = 0;
4245                 for (;i < count;i++, in++, out++)
4246                 {
4247                         // check face type first
4248                         type = LittleLong(in->type);
4249                         if (type != Q3FACETYPE_POLYGON
4250                          && type != Q3FACETYPE_PATCH
4251                          && type != Q3FACETYPE_MESH
4252                          && type != Q3FACETYPE_FLARE)
4253                         {
4254                                 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4255                                 continue;
4256                         }
4257
4258                         n = LittleLong(in->textureindex);
4259                         if (n < 0 || n >= loadmodel->num_textures)
4260                         {
4261                                 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4262                                 continue;
4263                         }
4264                         out->texture = loadmodel->data_textures + n;
4265                         n = LittleLong(in->effectindex);
4266                         if (n < -1 || n >= loadmodel->brushq3.num_effects)
4267                         {
4268                                 if (developer.integer >= 2)
4269                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4270                                 n = -1;
4271                         }
4272                         if (n == -1)
4273                                 out->effect = NULL;
4274                         else
4275                                 out->effect = loadmodel->brushq3.data_effects + n;
4276                         n = LittleLong(in->lightmapindex);
4277                         if (n >= loadmodel->brushq3.num_lightmaps)
4278                         {
4279                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_lightmaps);
4280                                 n = -1;
4281                         }
4282                         else if (n < 0)
4283                                 n = -1;
4284                         if (n == -1)
4285                                 out->lightmaptexture = NULL;
4286                         else
4287                                 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n];
4288
4289                         firstvertex = LittleLong(in->firstvertex);
4290                         numvertices = LittleLong(in->numvertices);
4291                         firstelement = LittleLong(in->firstelement);
4292                         numtriangles = LittleLong(in->numelements) / 3;
4293                         if (numtriangles * 3 != LittleLong(in->numelements))
4294                         {
4295                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): numelements %i is not a multiple of 3\n", i, out->texture->name, LittleLong(in->numelements));
4296                                 continue;
4297                         }
4298                         if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4299                         {
4300                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid vertex range %i : %i (%i vertices)\n", i, out->texture->name, firstvertex, firstvertex + numvertices, loadmodel->brushq3.num_vertices);
4301                                 continue;
4302                         }
4303                         if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4304                         {
4305                                 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid element range %i : %i (%i elements)\n", i, out->texture->name, firstelement, firstelement + numtriangles * 3, loadmodel->brushq3.num_triangles * 3);
4306                                 continue;
4307                         }
4308                         switch(type)
4309                         {
4310                         case Q3FACETYPE_POLYGON:
4311                         case Q3FACETYPE_MESH:
4312                                 // no processing necessary
4313                                 break;
4314                         case Q3FACETYPE_PATCH:
4315                                 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4316                                 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4317                                 if (numvertices != (patchsize[0] * patchsize[1]) || patchsize[0] < 3 || patchsize[1] < 3 || !(patchsize[0] & 1) || !(patchsize[1] & 1) || patchsize[0] * patchsize[1] >= min(r_subdivisions_maxvertices.integer, r_subdivisions_collision_maxvertices.integer))
4318                                 {
4319                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4320                                         continue;
4321                                 }
4322                                 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4323                                 // convert patch to Q3FACETYPE_MESH
4324                                 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4325                                 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4326                                 // bound to user settings
4327                                 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4328                                 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4329                                 // bound to sanity settings
4330                                 xtess = bound(1, xtess, 1024);
4331                                 ytess = bound(1, ytess, 1024);
4332                                 // bound to user limit on vertices
4333                                 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4334                                 {
4335                                         if (xtess > ytess)
4336                                                 xtess--;
4337                                         else
4338                                                 ytess--;
4339                                 }
4340                                 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4341                                 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4342                                 numvertices = finalwidth * finalheight;
4343                                 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4344                                 break;
4345                         case Q3FACETYPE_FLARE:
4346                                 if (developer.integer >= 2)
4347                                         Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4348                                 // don't render it
4349                                 continue;
4350                         }
4351                         out->num_vertices = numvertices;
4352                         out->num_triangles = numtriangles;
4353                         if (meshvertices + out->num_vertices > 65536)
4354                                 break;
4355                         meshvertices += out->num_vertices;
4356                         meshtriangles += out->num_triangles;
4357                 }
4358
4359                 i = oldi;
4360                 in = oldin;
4361                 out = oldout;
4362                 mesh = tempmeshlist[meshnum] = Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, false, true, false);
4363                 meshvertices = 0;
4364                 meshtriangles = 0;
4365                 for (;i < count && meshvertices + out->num_vertices <= mesh->num_vertices;i++, in++, out++)
4366                 {
4367                         if (out->num_vertices < 3 || out->num_triangles < 1)
4368                                 continue;
4369
4370                         type = LittleLong(in->type);
4371                         firstvertex = LittleLong(in->firstvertex);
4372                         firstelement = LittleLong(in->firstelement);
4373                         out->groupmesh = mesh;
4374                         out->num_firstvertex = meshvertices;
4375                         out->num_firsttriangle = meshtriangles;
4376                         switch(type)
4377                         {
4378                         case Q3FACETYPE_POLYGON:
4379                         case Q3FACETYPE_MESH:
4380                                 // no processing necessary
4381                                 for (j = 0;j < out->num_vertices;j++)
4382                                 {
4383                                         (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4384                                         (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4385                                         (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4386                                         (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4387                                         (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4388                                         (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4389                                         (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4390                                         (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4391                                         (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4392                                         (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4393                                         (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4394                                 }
4395                                 for (j = 0;j < out->num_triangles*3;j++)
4396                                         (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
4397                                 break;
4398                         case Q3FACETYPE_PATCH:
4399                                 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4400                                 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4401                                 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4402                                 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4403                                 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4404                                 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4405                                 // convert patch to Q3FACETYPE_MESH
4406                                 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4407                                 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4408                                 // bound to user settings
4409                                 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4410                                 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4411                                 // bound to sanity settings
4412                                 xtess = bound(1, xtess, 1024);
4413                                 ytess = bound(1, ytess, 1024);
4414                                 // bound to user limit on vertices
4415                                 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4416                                 {
4417                                         if (xtess > ytess)
4418                                                 xtess--;
4419                                         else
4420                                                 ytess--;
4421                                 }
4422                                 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4423                                 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4424                                 finalvertices = finalwidth * finalheight;
4425                                 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4426                                 type = Q3FACETYPE_MESH;
4427                                 // generate geometry
4428                                 // (note: normals are skipped because they get recalculated)
4429                                 Q3PatchTesselateFloat(3, sizeof(float[3]), (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4430                                 Q3PatchTesselateFloat(2, sizeof(float[2]), (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
4431                                 Q3PatchTesselateFloat(2, sizeof(float[2]), (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
4432                                 Q3PatchTesselateFloat(4, sizeof(float[4]), (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
4433                                 Q3PatchTriangleElements((out->groupmesh->data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
4434                                 out->num_triangles = Mod_RemoveDegenerateTriangles(out->num_triangles, (out->groupmesh->data_element3i + 3 * out->num_firsttriangle), (out->groupmesh->data_element3i + 3 * out->num_firsttriangle), out->groupmesh->data_vertex3f);
4435                                 if (developer.integer >= 2)
4436                                 {
4437                                         if (out->num_triangles < finaltriangles)
4438                                                 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles, %i degenerate triangles removed (leaving %i)\n", patchsize[0], patchsize[1], out->num_vertices, finaltriangles, finaltriangles - out->num_triangles, out->num_triangles);
4439                                         else
4440                                                 Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles\n", patchsize[0], patchsize[1], out->num_vertices, out->num_triangles);
4441                                 }
4442                                 // q3map does not put in collision brushes for curves... ugh
4443                                 // build the lower quality collision geometry
4444                                 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4445                                 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4446                                 // bound to user settings
4447                                 xtess = bound(r_subdivisions_collision_mintess.integer, xtess, r_subdivisions_collision_maxtess.integer);
4448                                 ytess = bound(r_subdivisions_collision_mintess.integer, ytess, r_subdivisions_collision_maxtess.integer);
4449                                 // bound to sanity settings
4450                                 xtess = bound(1, xtess, 1024);
4451                                 ytess = bound(1, ytess, 1024);
4452                                 // bound to user limit on vertices
4453                                 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4454                                 {
4455                                         if (xtess > ytess)
4456                                                 xtess--;
4457                                         else
4458                                                 ytess--;
4459                                 }
4460                                 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4461                                 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4462                                 finalvertices = finalwidth * finalheight;
4463                                 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4464
4465                                 out->data_collisionvertex3f = Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4466                                 out->data_collisionelement3i = Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4467                                 out->num_collisionvertices = finalvertices;
4468                                 out->num_collisiontriangles = finaltriangles;
4469                                 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4470                                 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
4471
4472                                 //Mod_SnapVertices(3, out->num_vertices, (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), 0.25);
4473                                 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
4474
4475                                 oldnumtriangles = out->num_triangles;
4476                                 oldnumtriangles2 = out->num_collisiontriangles;
4477                                 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
4478                                 if (developer.integer)
4479                                         Con_Printf("Mod_Q3BSP_LoadFaces: %ix%i curve became %i:%i vertices / %i:%i triangles (%i:%i degenerate)\n", patchsize[0], patchsize[1], out->num_vertices, out->num_collisionvertices, oldnumtriangles, oldnumtriangles2, oldnumtriangles - out->num_triangles, oldnumtriangles2 - out->num_collisiontriangles);
4480                                 break;
4481                         default:
4482                                 break;
4483                         }
4484                         meshvertices += out->num_vertices;
4485                         meshtriangles += out->num_triangles;
4486                         for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
4487                                 if ((out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
4488                                         invalidelements++;
4489                         if (invalidelements)
4490                         {
4491                                 Con_Printf("Mod_Q3BSP_LoadFaces: Warning: face #%i has %i invalid elements, type = %i, texture->name = \"%s\", texture->surfaceflags = %i, firstvertex = %i, numvertices = %i, firstelement = %i, numelements = %i, elements list:\n", i, invalidelements, type, out->texture->name, out->texture->surfaceflags, firstvertex, out->num_vertices, firstelement, out->num_triangles * 3);
4492                                 for (j = 0;j < out->num_triangles * 3;j++)
4493                                 {
4494                                         Con_Printf(" %i", (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
4495                                         if ((out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
4496                                                 (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
4497                                 }
4498                                 Con_Print("\n");
4499                         }
4500                         // for per pixel lighting
4501                         Mod_BuildTextureVectorsAndNormals(out->num_firstvertex, out->num_vertices, out->num_triangles, out->groupmesh->data_vertex3f, out->groupmesh->data_texcoordtexture2f, (out->groupmesh->data_element3i + 3 * out->num_firsttriangle), out->groupmesh->data_svector3f, out->groupmesh->data_tvector3f, out->groupmesh->data_normal3f, true);
4502                         // calculate a bounding box
4503                         VectorClear(out->mins);
4504                         VectorClear(out->maxs);
4505                         if (out->num_vertices)
4506                         {
4507                                 VectorCopy((out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), out->mins);
4508                                 VectorCopy((out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), out->maxs);
4509                                 for (j = 1, v = (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
4510                                 {
4511                                         out->mins[0] = min(out->mins[0], v[0]);
4512                                         out->maxs[0] = max(out->maxs[0], v[0]);
4513                                         out->mins[1] = min(out->mins[1], v[1]);
4514                                         out->maxs[1] = max(out->maxs[1], v[1]);
4515                                         out->mins[2] = min(out->mins[2], v[2]);
4516                                         out->maxs[2] = max(out->maxs[2], v[2]);
4517                                 }
4518                                 out->mins[0] -= 1.0f;
4519                                 out->mins[1] -= 1.0f;
4520                                 out->mins[2] -= 1.0f;
4521                                 out->maxs[0] += 1.0f;
4522                                 out->maxs[1] += 1.0f;
4523                                 out->maxs[2] += 1.0f;
4524                         }
4525                         // set lightmap styles for consistency with q1bsp
4526                         //out->lightmapinfo->styles[0] = 0;
4527                         //out->lightmapinfo->styles[1] = 255;
4528                         //out->lightmapinfo->styles[2] = 255;
4529                         //out->lightmapinfo->styles[3] = 255;
4530                 }
4531         }
4532
4533         // now store the completed list of meshes
4534         loadmodel->nummeshes = meshnum;
4535         if (loadmodel->nummeshes)
4536         {
4537                 loadmodel->meshlist = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4538                 memcpy(loadmodel->meshlist, tempmeshlist, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4539         }
4540
4541         // free the no longer needed vertex data
4542         loadmodel->brushq3.num_vertices = 0;
4543         Mem_Free(loadmodel->brushq3.data_vertex3f);
4544         loadmodel->brushq3.data_vertex3f = NULL;
4545         loadmodel->brushq3.data_texcoordtexture2f = NULL;
4546         loadmodel->brushq3.data_texcoordlightmap2f = NULL;
4547         loadmodel->brushq3.data_color4f = NULL;
4548         // free the no longer needed triangle data
4549         loadmodel->brushq3.num_triangles = 0;
4550         Mem_Free(loadmodel->brushq3.data_element3i);
4551         loadmodel->brushq3.data_element3i = NULL;
4552 }
4553
4554 static void Mod_Q3BSP_LoadModels(lump_t *l)
4555 {
4556         q3dmodel_t *in;
4557         q3dmodel_t *out;
4558         int i, j, n, c, count;
4559
4560         in = (void *)(mod_base + l->fileofs);
4561         if (l->filelen % sizeof(*in))
4562                 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4563         count = l->filelen / sizeof(*in);
4564         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4565
4566         loadmodel->brushq3.data_models = out;
4567         loadmodel->brushq3.num_models = count;
4568
4569         for (i = 0;i < count;i++, in++, out++)
4570         {
4571                 for (j = 0;j < 3;j++)
4572                 {
4573                         out->mins[j] = LittleFloat(in->mins[j]);
4574                         out->maxs[j] = LittleFloat(in->maxs[j]);
4575                 }
4576                 n = LittleLong(in->firstface);
4577                 c = LittleLong(in->numfaces);
4578                 if (n < 0 || n + c > loadmodel->num_surfaces)
4579                         Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)\n", n, n + c, loadmodel->num_surfaces);
4580                 out->firstface = n;
4581                 out->numfaces = c;
4582                 n = LittleLong(in->firstbrush);
4583                 c = LittleLong(in->numbrushes);
4584                 if (n < 0 || n + c > loadmodel->brush.num_brushes)
4585                         Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)\n", n, n + c, loadmodel->brush.num_brushes);
4586                 out->firstbrush = n;
4587                 out->numbrushes = c;
4588         }
4589 }
4590
4591 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
4592 {
4593         int *in;
4594         int *out;
4595         int i, n, count;
4596
4597         in = (void *)(mod_base + l->fileofs);
4598         if (l->filelen % sizeof(*in))
4599                 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4600         count = l->filelen / sizeof(*in);
4601         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4602
4603         loadmodel->brush.data_leafbrushes = out;
4604         loadmodel->brush.num_leafbrushes = count;
4605
4606         for (i = 0;i < count;i++, in++, out++)
4607         {
4608                 n = LittleLong(*in);
4609                 if (n < 0 || n >= loadmodel->brush.num_brushes)
4610                         Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)\n", n, loadmodel->brush.num_brushes);
4611                 *out = n;
4612         }
4613 }
4614
4615 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
4616 {
4617         int *in;
4618         int *out;
4619         int i, n, count;
4620
4621         in = (void *)(mod_base + l->fileofs);
4622         if (l->filelen % sizeof(*in))
4623                 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4624         count = l->filelen / sizeof(*in);
4625         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4626
4627         loadmodel->brush.data_leafsurfaces = out;
4628         loadmodel->brush.num_leafsurfaces = count;
4629
4630         for (i = 0;i < count;i++, in++, out++)
4631         {
4632                 n = LittleLong(*in);
4633                 if (n < 0 || n >= loadmodel->num_surfaces)
4634                         Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)\n", n, loadmodel->num_surfaces);
4635                 *out = n;
4636         }
4637 }
4638
4639 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
4640 {
4641         q3dleaf_t *in;
4642         mleaf_t *out;
4643         int i, j, n, c, count;
4644
4645         in = (void *)(mod_base + l->fileofs);
4646         if (l->filelen % sizeof(*in))
4647                 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4648         count = l->filelen / sizeof(*in);
4649         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4650
4651         loadmodel->brush.data_leafs = out;
4652         loadmodel->brush.num_leafs = count;
4653
4654         for (i = 0;i < count;i++, in++, out++)
4655         {
4656                 out->parent = NULL;
4657                 out->plane = NULL;
4658                 out->clusterindex = LittleLong(in->clusterindex);
4659                 out->areaindex = LittleLong(in->areaindex);
4660                 for (j = 0;j < 3;j++)
4661                 {
4662                         // yes the mins/maxs are ints
4663                         out->mins[j] = LittleLong(in->mins[j]) - 1;
4664                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4665                 }
4666                 n = LittleLong(in->firstleafface);
4667                 c = LittleLong(in->numleaffaces);
4668                 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
4669                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)\n", n, n + c, loadmodel->brush.num_leafsurfaces);
4670                 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
4671                 out->numleafsurfaces = c;
4672                 n = LittleLong(in->firstleafbrush);
4673                 c = LittleLong(in->numleafbrushes);
4674                 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
4675                         Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)\n", n, n + c, loadmodel->brush.num_leafbrushes);
4676                 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
4677                 out->numleafbrushes = c;
4678         }
4679 }
4680
4681 static void Mod_Q3BSP_LoadNodes(lump_t *l)
4682 {
4683         q3dnode_t *in;
4684         mnode_t *out;
4685         int i, j, n, count;
4686
4687         in = (void *)(mod_base + l->fileofs);
4688         if (l->filelen % sizeof(*in))
4689                 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4690         count = l->filelen / sizeof(*in);
4691         out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4692
4693         loadmodel->brush.data_nodes = out;
4694         loadmodel->brush.num_nodes = count;
4695
4696         for (i = 0;i < count;i++, in++, out++)
4697         {
4698                 out->parent = NULL;
4699                 n = LittleLong(in->planeindex);
4700                 if (n < 0 || n >= loadmodel->brush.num_planes)
4701                         Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)\n", n, loadmodel->brush.num_planes);
4702                 out->plane = loadmodel->brush.data_planes + n;
4703                 for (j = 0;j < 2;j++)
4704                 {
4705                         n = LittleLong(in->childrenindex[j]);
4706                         if (n >= 0)
4707                         {
4708                                 if (n >= loadmodel->brush.num_nodes)
4709                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)\n", n, loadmodel->brush.num_nodes);
4710                                 out->children[j] = loadmodel->brush.data_nodes + n;
4711                         }
4712                         else
4713                         {
4714                                 n = -1 - n;
4715                                 if (n >= loadmodel->brush.num_leafs)
4716                                         Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)\n", n, loadmodel->brush.num_leafs);
4717                                 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
4718                         }
4719                 }
4720                 for (j = 0;j < 3;j++)
4721                 {
4722                         // yes the mins/maxs are ints
4723                         out->mins[j] = LittleLong(in->mins[j]) - 1;
4724                         out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4725                 }
4726         }
4727
4728         // set the parent pointers
4729         Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
4730 }
4731
4732 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
4733 {
4734         q3dlightgrid_t *in;
4735         q3dlightgrid_t *out;
4736         int count;
4737
4738         in = (void *)(mod_base + l->fileofs);
4739         if (l->filelen % sizeof(*in))
4740                 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
4741         loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
4742         loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
4743         loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
4744         loadmodel->brushq3.num_lightgrid_imins[0] = ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4745         loadmodel->brushq3.num_lightgrid_imins[1] = ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4746         loadmodel->brushq3.num_lightgrid_imins[2] = ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4747         loadmodel->brushq3.num_lightgrid_imaxs[0] = floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4748         loadmodel->brushq3.num_lightgrid_imaxs[1] = floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4749         loadmodel->brushq3.num_lightgrid_imaxs[2] = floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4750         loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
4751         loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
4752         loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
4753         count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
4754         Matrix4x4_CreateScale3(&loadmodel->brushq3.num_lightgrid_indexfromworld, loadmodel->brushq3.num_lightgrid_scale[0], loadmodel->brushq3.num_lightgrid_scale[1], loadmodel->brushq3.num_lightgrid_scale[2]);
4755         Matrix4x4_ConcatTranslate(&loadmodel->brushq3.num_lightgrid_indexfromworld, -loadmodel->brushq3.num_lightgrid_imins[0] * loadmodel->brushq3.num_lightgrid_cellsize[0], -loadmodel->brushq3.num_lightgrid_imins[1] * loadmodel->brushq3.num_lightgrid_cellsize[1], -loadmodel->brushq3.num_lightgrid_imins[2] * loadmodel->brushq3.num_lightgrid_cellsize[2]);
4756
4757         // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
4758         if (l->filelen)
4759         {
4760                 if (l->filelen < count * (int)sizeof(*in))
4761                         Host_Error("Mod_Q3BSP_LoadLightGrid: invalid lightgrid lump size %i bytes, should be %i bytes (%ix%ix%i)\n", l->filelen, count * sizeof(*in), loadmodel->brushq3.num_lightgrid_dimensions[0], loadmodel->brushq3.num_lightgrid_dimensions[1], loadmodel->brushq3.num_lightgrid_dimensions[2]);
4762                 if (l->filelen != count * (int)sizeof(*in))
4763                         Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", count * sizeof(*in), l->filelen);
4764                 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4765                 loadmodel->brushq3.data_lightgrid = out;
4766                 loadmodel->brushq3.num_lightgrid = count;
4767                 // no swapping or validation necessary
4768                 memcpy(out, in, count * (int)sizeof(*out));
4769         }
4770 }
4771
4772 static void Mod_Q3BSP_LoadPVS(lump_t *l)
4773 {
4774         q3dpvs_t *in;
4775         int totalchains;
4776
4777         if (l->filelen == 0)
4778         {
4779                 int i;
4780                 // unvised maps often have cluster indices even without pvs, so check
4781                 // leafs to find real number of clusters
4782                 loadmodel->brush.num_pvsclusters = 1;
4783                 for (i = 0;i < loadmodel->brush.num_leafs;i++)
4784                         loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
4785
4786                 // create clusters
4787                 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
4788                 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4789                 loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, totalchains);
4790                 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
4791                 return;
4792         }
4793
4794         in = (void *)(mod_base + l->fileofs);
4795         if (l->filelen < 9)
4796                 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
4797
4798         loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
4799         loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
4800         if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
4801                 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8\n", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
4802         totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
4803         if (l->filelen < totalchains + (int)sizeof(*in))
4804                 Host_Error("Mod_Q3BSP_LoadPVS: lump too small ((numclusters = %i) * (chainlength = %i) + sizeof(q3dpvs_t) == %i bytes, lump is %i bytes)\n", loadmodel->brush.num_pvsclusters, loadmodel->brush.num_pvsclusterbytes, totalchains + sizeof(*in), l->filelen);
4805
4806         loadmodel->brush.data_pvsclusters = Mem_Alloc(loadmodel->mempool, totalchains);
4807         memcpy(loadmodel->brush.data_pvsclusters, (qbyte *)(in + 1), totalchains);
4808 }
4809
4810 static void Mod_Q3BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
4811 {
4812         int i, j, k, index[3];
4813         float transformed[3], blend1, blend2, blend, yaw, pitch, sinpitch;
4814         q3dlightgrid_t *a, *s;
4815         if (!model->brushq3.num_lightgrid)
4816         {
4817                 ambientcolor[0] = 1;
4818                 ambientcolor[1] = 1;
4819                 ambientcolor[2] = 1;
4820                 return;
4821         }
4822         Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
4823         //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
4824         //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
4825         transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
4826         transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
4827         transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
4828         index[0] = (int)floor(transformed[0]);
4829         index[1] = (int)floor(transformed[1]);
4830         index[2] = (int)floor(transformed[2]);
4831         //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
4832         // now lerp the values
4833         VectorClear(diffusenormal);
4834         a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
4835         for (k = 0;k < 2;k++)
4836         {
4837                 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
4838                 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
4839                         continue;
4840                 for (j = 0;j < 2;j++)
4841                 {
4842                         blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
4843                         if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
4844                                 continue;
4845                         for (i = 0;i < 2;i++)
4846                         {
4847                                 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0])));
4848                                 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
4849                                         continue;
4850                                 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
4851                                 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
4852                                 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
4853                                 pitch = s->diffusepitch * M_PI / 128;
4854                                 yaw = s->diffuseyaw * M_PI / 128;
4855                                 sinpitch = sin(pitch);
4856                                 diffusenormal[0] += blend * (cos(yaw) * sinpitch);
4857                                 diffusenormal[1] += blend * (sin(yaw) * sinpitch);
4858                                 diffusenormal[2] += blend * (cos(pitch));
4859                                 //Con_Printf("blend %f: ambient %i %i %i, diffuse %i %i %i, diffusepitch %i diffuseyaw %i (%f %f, normal %f %f %f)\n", blend, s->ambientrgb[0], s->ambientrgb[1], s->ambientrgb[2], s->diffusergb[0], s->diffusergb[1], s->diffusergb[2], s->diffusepitch, s->diffuseyaw, pitch, yaw, (cos(yaw) * cospitch), (sin(yaw) * cospitch), (-sin(pitch)));
4860                         }
4861                 }
4862         }
4863         VectorNormalize(diffusenormal);
4864         //Con_Printf("result: ambient %f %f %f diffuse %f %f %f diffusenormal %f %f %f\n", ambientcolor[0], ambientcolor[1], ambientcolor[2], diffusecolor[0], diffusecolor[1], diffusecolor[2], diffusenormal[0], diffusenormal[1], diffusenormal[2]);
4865 }
4866
4867 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const vec3_t point, int markframe)
4868 {
4869         int i;
4870         mleaf_t *leaf;
4871         colbrushf_t *brush;
4872         // find which leaf the point is in
4873         while (node->plane)
4874                 node = node->children[DotProduct(point, node->plane->normal) < node->plane->dist];
4875         // point trace the brushes
4876         leaf = (mleaf_t *)node;
4877         for (i = 0;i < leaf->numleafbrushes;i++)
4878         {
4879                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
4880                 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
4881                 {
4882                         brush->markframe = markframe;
4883                         Collision_TracePointBrushFloat(trace, point, brush);
4884                 }
4885         }
4886         // can't do point traces on curves (they have no thickness)
4887 }
4888
4889 static void Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const vec3_t start, const vec3_t end, vec_t startfrac, vec_t endfrac, const vec3_t linestart, const vec3_t lineend, int markframe, const vec3_t segmentmins, const vec3_t segmentmaxs)
4890 {
4891         int i, startside, endside;
4892         float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
4893         mleaf_t *leaf;
4894         msurface_t *surface;
4895         colbrushf_t *brush;
4896         if (startfrac > trace->realfraction)
4897                 return;
4898         // note: all line fragments past first impact fraction are ignored
4899         if (VectorCompare(start, end))
4900         {
4901                 // find which leaf the point is in
4902                 while (node->plane)
4903                         node = node->children[DotProduct(start, node->plane->normal) < node->plane->dist];
4904         }
4905         else
4906         {
4907                 // find which nodes the line is in and recurse for them
4908                 while (node->plane)
4909                 {
4910                         // recurse down node sides
4911                         dist1 = PlaneDiff(start, node->plane);
4912                         dist2 = PlaneDiff(end, node->plane);
4913                         startside = dist1 < 0;
4914                         endside = dist2 < 0;
4915                         if (startside == endside)
4916                         {
4917                                 // most of the time the line fragment is on one side of the plane
4918                                 node = node->children[startside];
4919                         }
4920                         else
4921                         {
4922                                 // line crosses node plane, split the line
4923                                 midfrac = dist1 / (dist1 - dist2);
4924                                 VectorLerp(start, midfrac, end, mid);
4925                                 // take the near side first
4926                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
4927                                 if (midfrac <= trace->realfraction)
4928                                         Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
4929                                 return;
4930                         }
4931                 }
4932         }
4933         // hit a leaf
4934         nodesegmentmins[0] = min(start[0], end[0]);
4935         nodesegmentmins[1] = min(start[1], end[1]);
4936         nodesegmentmins[2] = min(start[2], end[2]);
4937         nodesegmentmaxs[0] = max(start[0], end[0]);
4938         nodesegmentmaxs[1] = max(start[1], end[1]);
4939         nodesegmentmaxs[2] = max(start[2], end[2]);
4940         // line trace the brushes
4941         leaf = (mleaf_t *)node;
4942         for (i = 0;i < leaf->numleafbrushes;i++)
4943         {
4944                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
4945                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
4946                 {
4947                         brush->markframe = markframe;
4948                         Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
4949                         if (startfrac > trace->realfraction)
4950                                 return;
4951                 }
4952         }
4953         // can't do point traces on curves (they have no thickness)
4954         if (mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
4955         {
4956                 // line trace the curves
4957                 for (i = 0;i < leaf->numleafsurfaces;i++)
4958                 {
4959                         surface = model->data_surfaces + leaf->firstleafsurface[i];
4960                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
4961                         {
4962                                 surface->collisionmarkframe = markframe;
4963                                 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, segmentmins, segmentmaxs);
4964                                 if (startfrac > trace->realfraction)
4965                                         return;
4966                         }
4967                 }
4968         }
4969 }
4970
4971 static void Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const colbrushf_t *thisbrush_start, const colbrushf_t *thisbrush_end, int markframe, const vec3_t segmentmins, const vec3_t segmentmaxs)
4972 {
4973         int i;
4974         //int sides;
4975         float nodesegmentmins[3], nodesegmentmaxs[3];
4976         mleaf_t *leaf;
4977         colbrushf_t *brush;
4978         msurface_t *surface;
4979         /*
4980                 // find which nodes the line is in and recurse for them
4981                 while (node->plane)
4982                 {
4983                         // recurse down node sides
4984                         int startside, endside;
4985                         float dist1near, dist1far, dist2near, dist2far;
4986                         BoxPlaneCornerDistances(thisbrush_start->mins, thisbrush_start->maxs, node->plane, &dist1near, &dist1far);
4987                         BoxPlaneCornerDistances(thisbrush_end->mins, thisbrush_end->maxs, node->plane, &dist2near, &dist2far);
4988                         startside = dist1near < 0;
4989                         startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
4990                         endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
4991                         if (startside == 2 || endside == 2)
4992                         {
4993                                 // brushes cross plane
4994                                 // do not clip anything, just take both sides
4995                                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
4996                                 node = node->children[1];
4997                                 continue;
4998                         }
4999                         if (startside == 0)
5000                         {
5001                                 if (endside == 0)
5002                                 {
5003                                         node = node->children[0];
5004                                         continue;
5005                                 }
5006                                 else
5007                                 {
5008                                         //midf0 = dist1near / (dist1near - dist2near);
5009                                         //midf1 = dist1far / (dist1far - dist2far);
5010                                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5011                                         node = node->children[1];
5012                                         continue;
5013                                 }
5014                         }
5015                         else
5016                         {
5017                                 if (endside == 0)
5018                                 {
5019                                         //midf0 = dist1near / (dist1near - dist2near);
5020                                         //midf1 = dist1far / (dist1far - dist2far);
5021                                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5022                                         node = node->children[1];
5023                                         continue;
5024                                 }
5025                                 else
5026                                 {
5027                                         node = node->children[1];
5028                                         continue;
5029                                 }
5030                         }
5031
5032                         if (dist1near <  0 && dist2near <  0 && dist1far <  0 && dist2far <  0){node = node->children[1];continue;}
5033                         if (dist1near <  0 && dist2near <  0 && dist1far <  0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5034                         if (dist1near <  0 && dist2near <  0 && dist1far >= 0 && dist2far <  0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5035                         if (dist1near <  0 && dist2near <  0 && dist1far >= 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5036                         if (dist1near <  0 && dist2near >= 0 && dist1far <  0 && dist2far <  0){node = node->children[1];continue;}
5037                         if (dist1near <  0 && dist2near >= 0 && dist1far <  0 && dist2far >= 0){}
5038                         if (dist1near <  0 && dist2near >= 0 && dist1far >= 0 && dist2far <  0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5039                         if (dist1near <  0 && dist2near >= 0 && dist1far >= 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5040                         if (dist1near >= 0 && dist2near <  0 && dist1far <  0 && dist2far <  0){node = node->children[1];continue;}
5041                         if (dist1near >= 0 && dist2near <  0 && dist1far <  0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5042                         if (dist1near >= 0 && dist2near <  0 && dist1far >= 0 && dist2far <  0){}
5043                         if (dist1near >= 0 && dist2near <  0 && dist1far >= 0 && dist2far >= 0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5044                         if (dist1near >= 0 && dist2near >= 0 && dist1far <  0 && dist2far <  0){Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);node = node->children[1];continue;}
5045                         if (dist1near >= 0 && dist2near >= 0 && dist1far <  0 && dist2far >= 0){node = node->children[0];continue;}
5046                         if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far <  0){node = node->children[0];continue;}
5047                         if (dist1near >= 0 && dist2near >= 0 && dist1far >= 0 && dist2far >= 0){node = node->children[0];continue;}
5048                         {
5049                                 if (dist2near < 0) // d1n<0 && d2n<0
5050                                 {
5051                                         if (dist2near < 0) // d1n<0 && d2n<0
5052                                         {
5053                                                 if (dist2near < 0) // d1n<0 && d2n<0
5054                                                 {
5055                                                 }
5056                                                 else // d1n<0 && d2n>0
5057                                                 {
5058                                                 }
5059                                         }
5060                                         else // d1n<0 && d2n>0
5061                                         {
5062                                                 if (dist2near < 0) // d1n<0 && d2n<0
5063                                                 {
5064                                                 }
5065                                                 else // d1n<0 && d2n>0
5066                                                 {
5067                                                 }
5068                                         }
5069                                 }
5070                                 else // d1n<0 && d2n>0
5071                                 {
5072                                 }
5073                         }
5074                         else // d1n>0
5075                         {
5076                                 if (dist2near < 0) // d1n>0 && d2n<0
5077                                 {
5078                                 }
5079                                 else // d1n>0 && d2n>0
5080                                 {
5081                                 }
5082                         }
5083                         if (dist1near < 0 == dist1far < 0 == dist2near < 0 == dist2far < 0)
5084                         {
5085                                 node = node->children[startside];
5086                                 continue;
5087                         }
5088                         if (dist1near < dist2near)
5089                         {
5090                                 // out
5091                                 if (dist1near >= 0)
5092                                 {
5093                                         node = node->children[0];
5094                                         continue;
5095                                 }
5096                                 if (dist2far < 0)
5097                                 {
5098                                         node = node->children[1];
5099                                         continue;
5100                                 }
5101                                 // dist1near < 0 && dist2far >= 0
5102                         }
5103                         else
5104                         {
5105                                 // in
5106                         }
5107                         startside = dist1near < 0 ? (dist1far < 0 ? 1 : 2) : (dist1far < 0 ? 2 : 0);
5108                         endside = dist2near < 0 ? (dist2far < 0 ? 1 : 2) : (dist2far < 0 ? 2 : 0);
5109                         if (startside == 2 || endside == 2)
5110                         {
5111                                 // brushes cross plane
5112                                 // do not clip anything, just take both sides
5113                                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5114                                 node = node->children[1];
5115                         }
5116                         else if (startside == endside)
5117                                 node = node->children[startside];
5118                         else if (startside == 0) // endside = 1 (start infront, end behind)
5119                         {
5120                         }
5121                         else // startside == 1 endside = 0 (start behind, end infront)
5122                         {
5123                         }
5124                         == endside)
5125                         {
5126                                 if (startside < 2)
5127                                         node = node->children[startside];
5128                                 else
5129                                 {
5130                                         // start and end brush cross plane
5131                                 }
5132                         }
5133                         else
5134                         {
5135                         }
5136                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5137                                 node = node->children[1];
5138                         else if (dist1near < 0 && dist1far < 0 && dist2near >= 0 && dist2far >= 0)
5139                         else if (dist1near >= 0 && dist1far >= 0 && dist2near < 0 && dist2far < 0)
5140                         else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5141                                 node = node->children[0];
5142                         else
5143                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5144                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5145                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5146                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5147                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5148                         {
5149                         }
5150                         else if (dist1near >= 0 && dist1far >= 0)
5151                         {
5152                         }
5153                         else // mixed (lying on plane)
5154                         {
5155                         }
5156                         {
5157                                 if (dist2near < 0 && dist2far < 0)
5158                                 {
5159                                 }
5160                                 else
5161                                         node = node->children[1];
5162                         }
5163                         if (dist1near < 0 && dist1far < 0 && dist2near < 0 && dist2far < 0)
5164                                 node = node->children[0];
5165                         else if (dist1near >= 0 && dist1far >= 0 && dist2near >= 0 && dist2far >= 0)
5166                                 node = node->children[1];
5167                         else
5168                         {
5169                                 // both sides
5170                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5171                                 node = node->children[1];
5172                         }
5173                         sides = dist1near || dist1near < 0 | dist1far < 0 | dist2near < 0 | dist
5174                         startside = dist1 < 0;
5175                         endside = dist2 < 0;
5176                         if (startside == endside)
5177                         {
5178                                 // most of the time the line fragment is on one side of the plane
5179                                 node = node->children[startside];
5180                         }
5181                         else
5182                         {
5183                                 // line crosses node plane, split the line
5184                                 midfrac = dist1 / (dist1 - dist2);
5185                                 VectorLerp(start, midfrac, end, mid);
5186                                 // take the near side first
5187                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5188                                 if (midfrac <= trace->fraction)
5189                                         Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5190                                 return;
5191                         }
5192                 }
5193         */
5194 #if 1
5195         for (;;)
5196         {
5197                 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5198                 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5199                 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5200                 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5201                 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5202                 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5203                 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5204                         return;
5205                 if (!node->plane)
5206                         break;
5207                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5208                 node = node->children[1];
5209         }
5210 #elif 0
5211         // FIXME: could be made faster by copying TraceLine code and making it use
5212         // box plane distances...  (variant on the BoxOnPlaneSide code)
5213         for (;;)
5214         {
5215                 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5216                 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5217                 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5218                 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5219                 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5220                 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5221                 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5222                         return;
5223                 if (!node->plane)
5224                         break;
5225                 if (mod_q3bsp_debugtracebrush.integer == 2)
5226                 {
5227                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5228                         node = node->children[1];
5229                         continue;
5230                 }
5231                 else if (mod_q3bsp_debugtracebrush.integer == 1)
5232                 {
5233                         // recurse down node sides
5234                         sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5235                         if (sides == 3)
5236                         {
5237                                 // segment box crosses plane
5238                                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5239                                 node = node->children[1];
5240                                 continue;
5241                         }
5242                         // take whichever side the segment box is on
5243                         node = node->children[sides - 1];
5244                         continue;
5245                 }
5246                 else
5247                 {
5248                         // recurse down node sides
5249                         sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5250                         if (sides == 3)
5251                         {
5252                                 // segment box crosses plane
5253                                 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5254                                 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5255                                 if (sides == 3)
5256                                 {
5257                                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5258                                         node = node->children[1];
5259                                         continue;
5260                                 }
5261                         }
5262                         // take whichever side the segment box is on
5263                         node = node->children[sides - 1];
5264                         continue;
5265                 }
5266                 return;
5267         }
5268 #else
5269         // FIXME: could be made faster by copying TraceLine code and making it use
5270         // box plane distances...  (variant on the BoxOnPlaneSide code)
5271         for (;;)
5272         {
5273                 nodesegmentmins[0] = max(segmentmins[0], node->mins[0]);
5274                 nodesegmentmins[1] = max(segmentmins[1], node->mins[1]);
5275                 nodesegmentmins[2] = max(segmentmins[2], node->mins[2]);
5276                 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0]);
5277                 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1]);
5278                 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2]);
5279                 if (nodesegmentmins[0] > nodesegmentmaxs[0] || nodesegmentmins[1] > nodesegmentmaxs[1] || nodesegmentmins[2] > nodesegmentmaxs[2])
5280                         return;
5281                 if (!node->plane)
5282                         break;
5283                 if (mod_q3bsp_debugtracebrush.integer == 2)
5284                 {
5285                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5286                         node = node->children[1];
5287                 }
5288                 else if (mod_q3bsp_debugtracebrush.integer == 1)
5289                 {
5290                         // recurse down node sides
5291                         sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5292                         if (sides == 3)
5293                         {
5294                                 // segment box crosses plane
5295                                 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5296                                 node = node->children[1];
5297                         }
5298                         else
5299                         {
5300                                 // take whichever side the segment box is on
5301                                 node = node->children[sides - 1];
5302                         }
5303                 }
5304                 else
5305                 {
5306                         // recurse down node sides
5307                         sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, node->plane);
5308                         if (sides == 3)
5309                         {
5310                                 // segment box crosses plane
5311                                 // now check start and end brush boxes to handle a lot of 'diagonal' cases more efficiently...
5312                                 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, node->plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, node->plane);
5313                                 if (sides == 3)
5314                                 {
5315                                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5316                                         sides = 2;
5317                                 }
5318                         }
5319                         // take whichever side the segment box is on
5320                         node = node->children[sides - 1];
5321                 }
5322         }
5323 #endif
5324         // hit a leaf
5325         leaf = (mleaf_t *)node;
5326         for (i = 0;i < leaf->numleafbrushes;i++)
5327         {
5328                 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5329                 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5330                 {
5331                         brush->markframe = markframe;
5332                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5333                 }
5334         }
5335         if (mod_q3bsp_curves_collisions.integer)
5336         {
5337                 for (i = 0;i < leaf->numleafsurfaces;i++)
5338                 {
5339                         surface = model->data_surfaces + leaf->firstleafsurface[i];
5340                         if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5341                         {
5342                                 surface->collisionmarkframe = markframe;
5343                                 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, segmentmins, segmentmaxs);
5344                         }
5345                 }
5346         }
5347 }
5348
5349 static void Mod_Q3BSP_TraceBox(model_t *model, int frame, trace_t *trace, const vec3_t boxstartmins, const vec3_t boxstartmaxs, const vec3_t boxendmins, const vec3_t boxendmaxs, int hitsupercontentsmask)
5350 {
5351         int i;
5352         float segmentmins[3], segmentmaxs[3];
5353         colbrushf_t *thisbrush_start, *thisbrush_end;
5354         matrix4x4_t startmatrix, endmatrix;
5355         static int markframe = 0;
5356         msurface_t *surface;
5357         q3mbrush_t *brush;
5358         memset(trace, 0, sizeof(*trace));
5359         trace->fraction = 1;
5360         trace->realfraction = 1;
5361         trace->hitsupercontentsmask = hitsupercontentsmask;
5362         Matrix4x4_CreateIdentity(&startmatrix);
5363         Matrix4x4_CreateIdentity(&endmatrix);
5364         segmentmins[0] = min(boxstartmins[0], boxendmins[0]);
5365         segmentmins[1] = min(boxstartmins[1], boxendmins[1]);
5366         segmentmins[2] = min(boxstartmins[2], boxendmins[2]);
5367         segmentmaxs[0] = max(boxstartmaxs[0], boxendmaxs[0]);
5368         segmentmaxs[1] = max(boxstartmaxs[1], boxendmaxs[1]);
5369         segmentmaxs[2] = max(boxstartmaxs[2], boxendmaxs[2]);
5370         if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxstartmins, boxstartmaxs) && VectorCompare(boxendmins, boxendmaxs))
5371         {
5372                 if (VectorCompare(boxstartmins, boxendmins))
5373                 {
5374                         // point trace
5375                         if (model->brush.submodel)
5376                         {
5377                                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5378                                         if (brush->colbrushf)
5379                                                 Collision_TracePointBrushFloat(trace, boxstartmins, brush->colbrushf);
5380                         }
5381                         else
5382                                 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, boxstartmins, ++markframe);
5383                 }
5384                 else
5385                 {
5386                         // line trace
5387                         if (model->brush.submodel)
5388                         {
5389                                 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5390                                         if (brush->colbrushf)
5391                                                 Collision_TraceLineBrushFloat(trace, boxstartmins, boxendmins, brush->colbrushf, brush->colbrushf);
5392                                 if (mod_q3bsp_curves_collisions.integer)
5393                                         for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5394                                                 if (surface->num_collisiontriangles)
5395                                                         Collision_TraceLineTriangleMeshFloat(trace, boxstartmins, boxendmins, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, segmentmins, segmentmaxs);
5396                         }
5397                         else
5398                                 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, boxstartmins, boxendmins, 0, 1, boxstartmins, boxendmins, ++markframe, segmentmins, segmentmaxs);
5399                 }
5400         }
5401         else
5402         {
5403                 // box trace, performed as brush trace
5404                 thisbrush_start = Collision_BrushForBox(&startmatrix, boxstartmins, boxstartmaxs);
5405                 thisbrush_end = Collision_BrushForBox(&endmatrix, boxendmins, boxendmaxs);
5406                 if (model->brush.submodel)
5407                 {
5408                         for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5409                                 if (brush->colbrushf)
5410                                         Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5411                         if (mod_q3bsp_curves_collisions.integer)
5412                                 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5413                                         if (surface->num_collisiontriangles)
5414                                                 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, segmentmins, segmentmaxs);
5415                 }
5416                 else
5417                         Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5418         }
5419 }
5420
5421 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
5422 {
5423         int supercontents = 0;
5424         if (nativecontents & CONTENTSQ3_SOLID)
5425                 supercontents |= SUPERCONTENTS_SOLID;
5426         if (nativecontents & CONTENTSQ3_WATER)
5427                 supercontents |= SUPERCONTENTS_WATER;
5428         if (nativecontents & CONTENTSQ3_SLIME)
5429                 supercontents |= SUPERCONTENTS_SLIME;
5430         if (nativecontents & CONTENTSQ3_LAVA)
5431                 supercontents |= SUPERCONTENTS_LAVA;
5432         if (nativecontents & CONTENTSQ3_BODY)
5433                 supercontents |= SUPERCONTENTS_BODY;
5434         if (nativecontents & CONTENTSQ3_CORPSE)
5435                 supercontents |= SUPERCONTENTS_CORPSE;
5436         if (nativecontents & CONTENTSQ3_NODROP)
5437                 supercontents |= SUPERCONTENTS_NODROP;
5438         if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5439                 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5440         if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5441                 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5442         if (nativecontents & CONTENTSQ3_DONOTENTER)
5443                 supercontents |= SUPERCONTENTS_DONOTENTER;
5444         return supercontents;
5445 }
5446
5447 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
5448 {
5449         int nativecontents = 0;
5450         if (supercontents & SUPERCONTENTS_SOLID)
5451                 nativecontents |= CONTENTSQ3_SOLID;
5452         if (supercontents & SUPERCONTENTS_WATER)
5453                 nativecontents |= CONTENTSQ3_WATER;
5454         if (supercontents & SUPERCONTENTS_SLIME)
5455                 nativecontents |= CONTENTSQ3_SLIME;
5456         if (supercontents & SUPERCONTENTS_LAVA)
5457                 nativecontents |= CONTENTSQ3_LAVA;
5458         if (supercontents & SUPERCONTENTS_BODY)
5459                 nativecontents |= CONTENTSQ3_BODY;
5460         if (supercontents & SUPERCONTENTS_CORPSE)
5461                 nativecontents |= CONTENTSQ3_CORPSE;
5462         if (supercontents & SUPERCONTENTS_NODROP)
5463                 nativecontents |= CONTENTSQ3_NODROP;
5464         if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5465                 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5466         if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5467                 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5468         if (supercontents & SUPERCONTENTS_DONOTENTER)
5469                 nativecontents |= CONTENTSQ3_DONOTENTER;
5470         return nativecontents;
5471 }
5472
5473 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5474 {
5475         int numleafs;
5476         while (node->plane)
5477         {
5478                 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5479                 node = node->children[1];
5480         }
5481         numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5482         if (loadmodel->brush.num_leafs < numleafs)
5483                 loadmodel->brush.num_leafs = numleafs;
5484 }
5485
5486 void Mod_Q3BSP_Load(model_t *mod, void *buffer, void *bufferend)
5487 {
5488         int i, j, numshadowmeshtriangles;
5489         q3dheader_t *header;
5490         float corner[3], yawradius, modelradius;
5491         msurface_t *surface;
5492
5493         mod->type = mod_brushq3;
5494         mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5495         mod->numskins = 1;
5496
5497         header = (q3dheader_t *)buffer;
5498
5499         i = LittleLong(header->version);
5500         if (i != Q3BSPVERSION)
5501                 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5502         mod->brush.ishlbsp = false;
5503         mod->brush.ismcbsp = false;
5504         if (loadmodel->isworldmodel)
5505         {
5506                 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
5507                 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
5508         }
5509
5510         mod->soundfromcenter = true;
5511         mod->TraceBox = Mod_Q3BSP_TraceBox;
5512         mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5513         mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5514         mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5515         mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5516         mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5517         mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5518         mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5519         mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5520         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5521         mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5522         mod->Draw = R_Q1BSP_Draw;
5523         mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5524         mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5525         mod->DrawLight = R_Q1BSP_DrawLight;
5526
5527         mod_base = (qbyte *)header;
5528
5529         // swap all the lumps
5530         header->ident = LittleLong(header->ident);
5531         header->version = LittleLong(header->version);
5532         for (i = 0;i < Q3HEADER_LUMPS;i++)
5533         {
5534                 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
5535                 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
5536         }
5537
5538         Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5539         Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5540         Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5541         Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5542         Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5543         Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5544         Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5545         Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5546         Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS]);
5547         Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5548         Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5549         Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5550         Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5551         Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5552         Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5553         Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5554         Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5555         loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5556
5557         // the MakePortals code works fine on the q3bsp data as well
5558         Mod_Q1BSP_MakePortals();
5559
5560         // make a single combined shadow mesh to allow optimized shadow volume creation
5561         numshadowmeshtriangles = 0;
5562         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5563         {
5564                 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5565                 numshadowmeshtriangles += surface->num_triangles;
5566         }
5567         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5568         for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5569                 if (surface->groupmesh)
5570                         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));
5571         loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
5572         Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5573
5574         loadmodel->brush.num_leafs = 0;
5575         Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
5576
5577         if (loadmodel->isworldmodel)
5578         {
5579                 // clear out any stale submodels or worldmodels lying around
5580                 // if we did this clear before now, an error might abort loading and
5581                 // leave things in a bad state
5582                 Mod_RemoveStaleWorldModels(loadmodel);
5583         }
5584
5585         mod = loadmodel;
5586         for (i = 0;i < loadmodel->brush.numsubmodels;i++)
5587         {
5588                 if (i > 0)
5589                 {
5590                         char name[10];
5591                         // LordHavoc: only register submodels if it is the world
5592                         // (prevents external bsp models from replacing world submodels with
5593                         //  their own)
5594                         if (!loadmodel->isworldmodel)
5595                                 continue;
5596                         // duplicate the basic information
5597                         sprintf(name, "*%i", i);
5598                         mod = Mod_FindName(name);
5599                         *mod = *loadmodel;
5600                         strcpy(mod->name, name);
5601                         // textures and memory belong to the main model
5602                         mod->texturepool = NULL;
5603                         mod->mempool = NULL;
5604                         mod->brush.GetPVS = NULL;
5605                         mod->brush.FatPVS = NULL;
5606                         mod->brush.BoxTouchingPVS = NULL;
5607                         mod->brush.BoxTouchingLeafPVS = NULL;
5608                         mod->brush.BoxTouchingVisibleLeafs = NULL;
5609                         mod->brush.LightPoint = NULL;
5610                         mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5611                 }
5612                 mod->brush.submodel = i;
5613
5614                 // make the model surface list (used by shadowing/lighting)
5615                 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
5616                 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
5617                 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
5618                 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
5619                 mod->surfacelist = Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
5620                 for (j = 0;j < mod->nummodelsurfaces;j++)
5621                         mod->surfacelist[j] = mod->firstmodelsurface + j;
5622
5623                 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
5624                 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
5625                 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5626                 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5627                 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5628                 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5629                 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5630                 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5631                 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5632                 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5633                 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5634                 mod->yawmins[2] = mod->normalmins[2];
5635                 mod->yawmaxs[2] = mod->normalmaxs[2];
5636                 mod->radius = modelradius;
5637                 mod->radius2 = modelradius * modelradius;
5638
5639                 for (j = 0;j < mod->nummodelsurfaces;j++)
5640                         if (mod->data_surfaces[j + mod->firstmodelsurface].texture->surfaceflags & Q3SURFACEFLAG_SKY)
5641                                 break;
5642                 if (j < mod->nummodelsurfaces)
5643                         mod->DrawSky = R_Q1BSP_DrawSky;
5644         }
5645 }
5646
5647 void Mod_IBSP_Load(model_t *mod, void *buffer, void *bufferend)
5648 {
5649         int i = LittleLong(((int *)buffer)[1]);
5650         if (i == Q3BSPVERSION)
5651                 Mod_Q3BSP_Load(mod,buffer, bufferend);
5652         else if (i == Q2BSPVERSION)
5653                 Mod_Q2BSP_Load(mod,buffer, bufferend);
5654         else
5655                 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i\n", i);
5656 }
5657
5658 void Mod_MAP_Load(model_t *mod, void *buffer, void *bufferend)
5659 {
5660         Host_Error("Mod_MAP_Load: not yet implemented\n");
5661 }
5662