2 Copyright (C) 1996-1997 Id Software, Inc.
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.
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.
13 See the GNU General Public License for more details.
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.
29 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128", "how large water polygons should be (smaller values produce more polygons which give better warping effects)"};
30 cvar_t halflifebsp = {0, "halflifebsp", "0", "indicates the current map is hlbsp format (useful to know because of different bounding box sizes)"};
31 cvar_t mcbsp = {0, "mcbsp", "0", "indicates the current map is mcbsp format (useful to know because of different bounding box sizes)"};
32 cvar_t r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
33 cvar_t r_picmipworld = {CVAR_SAVE, "r_picmipworld", "1", "whether gl_picmip shall apply to world textures too"};
34 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0", "pretends there was no texture lump found in the q1bsp/hlbsp loading (useful for debugging this rare case)"};
35 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4", "maximum error tolerance on curve subdivision for rendering purposes (in other words, the curves will be given as many polygons as necessary to represent curves at this quality)"};
36 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "1", "minimum number of subdivisions (values above 1 will smooth curves that don't need it)"};
37 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
38 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
39 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15", "maximum error tolerance on curve subdivision for collision purposes (usually a larger error tolerance than for rendering)"};
40 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "1", "minimum number of subdivisions (values above 1 will smooth curves that don't need it)"};
41 cvar_t r_subdivisions_collision_maxtess = {0, "r_subdivisions_collision_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
42 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
43 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
44 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
45 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
46 cvar_t mod_q3bsp_lightmapmergepower = {CVAR_SAVE, "mod_q3bsp_lightmapmergepower", "4", "merges the quake3 128x128 lightmap textures into larger lightmap group textures to speed up rendering, 1 = 256x256, 2 = 512x512, 3 = 1024x1024, 4 = 2048x2048, 5 = 4096x4096, ..."};
48 static texture_t mod_q1bsp_texture_solid;
49 static texture_t mod_q1bsp_texture_sky;
50 static texture_t mod_q1bsp_texture_lava;
51 static texture_t mod_q1bsp_texture_slime;
52 static texture_t mod_q1bsp_texture_water;
54 void Mod_BrushInit(void)
56 // Cvar_RegisterVariable(&r_subdivide_size);
57 Cvar_RegisterVariable(&halflifebsp);
58 Cvar_RegisterVariable(&mcbsp);
59 Cvar_RegisterVariable(&r_novis);
60 Cvar_RegisterVariable(&r_picmipworld);
61 Cvar_RegisterVariable(&r_nosurftextures);
62 Cvar_RegisterVariable(&r_subdivisions_tolerance);
63 Cvar_RegisterVariable(&r_subdivisions_mintess);
64 Cvar_RegisterVariable(&r_subdivisions_maxtess);
65 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
66 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
67 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
68 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
69 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
70 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
71 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
72 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
73 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
75 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
76 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
77 mod_q1bsp_texture_solid.surfaceflags = 0;
78 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
80 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
81 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
82 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
83 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
85 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
86 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
87 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
88 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
90 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
91 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
92 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
93 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
95 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
96 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
97 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
98 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
101 static mleaf_t *Mod_Q1BSP_PointInLeaf(model_t *model, const vec3_t p)
108 // LordHavoc: modified to start at first clip node,
109 // in other words: first node of the (sub)model
110 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
112 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
114 return (mleaf_t *)node;
117 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(model_t *model, const vec3_t p, unsigned char *out, int outsize)
121 leaf = Mod_Q1BSP_PointInLeaf(model, p);
124 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
127 memcpy(out, leaf->ambient_sound_level, i);
133 memset(out, 0, outsize);
136 static int Mod_Q1BSP_FindBoxClusters(model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
139 int nodestackindex = 0;
140 mnode_t *node, *nodestack[1024];
141 if (!model->brush.num_pvsclusters)
143 node = model->brush.data_nodes;
149 // node - recurse down the BSP tree
150 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
154 return -1; // ERROR: NAN bounding box!
155 // box is on one side of plane, take that path
156 node = node->children[sides-1];
160 // box crosses plane, take one path and remember the other
161 if (nodestackindex < 1024)
162 nodestack[nodestackindex++] = node->children[0];
163 node = node->children[1];
169 // leaf - add clusterindex to list
170 if (numclusters < maxclusters)
171 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
175 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
179 if (nodestackindex < 1024)
180 nodestack[nodestackindex++] = node->children[0];
181 node = node->children[1];
186 // leaf - add clusterindex to list
187 if (numclusters < maxclusters)
188 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
193 // try another path we didn't take earlier
194 if (nodestackindex == 0)
196 node = nodestack[--nodestackindex];
198 // return number of clusters found (even if more than the maxclusters)
202 static int Mod_Q1BSP_BoxTouchingPVS(model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
204 int nodestackindex = 0;
205 mnode_t *node, *nodestack[1024];
206 if (!model->brush.num_pvsclusters)
208 node = model->brush.data_nodes;
214 // node - recurse down the BSP tree
215 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
219 return -1; // ERROR: NAN bounding box!
220 // box is on one side of plane, take that path
221 node = node->children[sides-1];
225 // box crosses plane, take one path and remember the other
226 if (nodestackindex < 1024)
227 nodestack[nodestackindex++] = node->children[0];
228 node = node->children[1];
234 // leaf - check cluster bit
235 int clusterindex = ((mleaf_t *)node)->clusterindex;
236 if (CHECKPVSBIT(pvs, clusterindex))
238 // it is visible, return immediately with the news
243 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
247 if (nodestackindex < 1024)
248 nodestack[nodestackindex++] = node->children[0];
249 node = node->children[1];
254 // leaf - check cluster bit
255 int clusterindex = ((mleaf_t *)node)->clusterindex;
256 if (CHECKPVSBIT(pvs, clusterindex))
258 // it is visible, return immediately with the news
264 // nothing to see here, try another path we didn't take earlier
265 if (nodestackindex == 0)
267 node = nodestack[--nodestackindex];
273 static int Mod_Q1BSP_BoxTouchingLeafPVS(model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
275 int nodestackindex = 0;
276 mnode_t *node, *nodestack[1024];
277 if (!model->brush.num_leafs)
279 node = model->brush.data_nodes;
285 // node - recurse down the BSP tree
286 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
290 return -1; // ERROR: NAN bounding box!
291 // box is on one side of plane, take that path
292 node = node->children[sides-1];
296 // box crosses plane, take one path and remember the other
297 if (nodestackindex < 1024)
298 nodestack[nodestackindex++] = node->children[0];
299 node = node->children[1];
305 // leaf - check cluster bit
306 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
307 if (CHECKPVSBIT(pvs, clusterindex))
309 // it is visible, return immediately with the news
314 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
318 if (nodestackindex < 1024)
319 nodestack[nodestackindex++] = node->children[0];
320 node = node->children[1];
325 // leaf - check cluster bit
326 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
327 if (CHECKPVSBIT(pvs, clusterindex))
329 // it is visible, return immediately with the news
335 // nothing to see here, try another path we didn't take earlier
336 if (nodestackindex == 0)
338 node = nodestack[--nodestackindex];
344 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
346 int nodestackindex = 0;
347 mnode_t *node, *nodestack[1024];
348 if (!model->brush.num_leafs)
350 node = model->brush.data_nodes;
356 // node - recurse down the BSP tree
357 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
361 return -1; // ERROR: NAN bounding box!
362 // box is on one side of plane, take that path
363 node = node->children[sides-1];
367 // box crosses plane, take one path and remember the other
368 if (nodestackindex < 1024)
369 nodestack[nodestackindex++] = node->children[0];
370 node = node->children[1];
376 // leaf - check if it is visible
377 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
379 // it is visible, return immediately with the news
384 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
388 if (nodestackindex < 1024)
389 nodestack[nodestackindex++] = node->children[0];
390 node = node->children[1];
395 // leaf - check if it is visible
396 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
398 // it is visible, return immediately with the news
404 // nothing to see here, try another path we didn't take earlier
405 if (nodestackindex == 0)
407 node = nodestack[--nodestackindex];
413 typedef struct findnonsolidlocationinfo_s
421 findnonsolidlocationinfo_t;
423 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
425 int i, surfacenum, k, *tri, *mark;
426 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
428 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
430 surface = info->model->data_surfaces + *mark;
431 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
433 for (k = 0;k < surface->num_triangles;k++)
435 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
436 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
437 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
438 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
439 VectorSubtract(vert[1], vert[0], edge[0]);
440 VectorSubtract(vert[2], vert[1], edge[1]);
441 CrossProduct(edge[1], edge[0], facenormal);
442 if (facenormal[0] || facenormal[1] || facenormal[2])
444 VectorNormalize(facenormal);
445 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
446 if (f <= info->bestdist && f >= -info->bestdist)
448 VectorSubtract(vert[0], vert[2], edge[2]);
449 VectorNormalize(edge[0]);
450 VectorNormalize(edge[1]);
451 VectorNormalize(edge[2]);
452 CrossProduct(facenormal, edge[0], edgenormal[0]);
453 CrossProduct(facenormal, edge[1], edgenormal[1]);
454 CrossProduct(facenormal, edge[2], edgenormal[2]);
456 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
457 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
458 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
460 // we got lucky, the center is within the face
461 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
465 if (info->bestdist > dist)
467 info->bestdist = dist;
468 VectorScale(facenormal, (info->radius - -dist), info->nudge);
473 if (info->bestdist > dist)
475 info->bestdist = dist;
476 VectorScale(facenormal, (info->radius - dist), info->nudge);
482 // check which edge or vertex the center is nearest
483 for (i = 0;i < 3;i++)
485 f = DotProduct(info->center, edge[i]);
486 if (f >= DotProduct(vert[0], edge[i])
487 && f <= DotProduct(vert[1], edge[i]))
490 VectorMA(info->center, -f, edge[i], point);
491 dist = sqrt(DotProduct(point, point));
492 if (info->bestdist > dist)
494 info->bestdist = dist;
495 VectorScale(point, (info->radius / dist), info->nudge);
497 // skip both vertex checks
498 // (both are further away than this edge)
503 // not on edge, check first vertex of edge
504 VectorSubtract(info->center, vert[i], point);
505 dist = sqrt(DotProduct(point, point));
506 if (info->bestdist > dist)
508 info->bestdist = dist;
509 VectorScale(point, (info->radius / dist), info->nudge);
521 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
525 float f = PlaneDiff(info->center, node->plane);
526 if (f >= -info->bestdist)
527 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
528 if (f <= info->bestdist)
529 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
533 if (((mleaf_t *)node)->numleafsurfaces)
534 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
538 static void Mod_Q1BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, float radius)
541 findnonsolidlocationinfo_t info;
547 VectorCopy(in, info.center);
548 info.radius = radius;
553 VectorClear(info.nudge);
554 info.bestdist = radius;
555 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
556 VectorAdd(info.center, info.nudge, info.center);
558 while (info.bestdist < radius && ++i < 10);
559 VectorCopy(info.center, out);
562 int Mod_Q1BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
564 switch(nativecontents)
569 return SUPERCONTENTS_SOLID;
571 return SUPERCONTENTS_WATER;
573 return SUPERCONTENTS_SLIME;
575 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
577 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
582 int Mod_Q1BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
584 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
585 return CONTENTS_SOLID;
586 if (supercontents & SUPERCONTENTS_SKY)
588 if (supercontents & SUPERCONTENTS_LAVA)
589 return CONTENTS_LAVA;
590 if (supercontents & SUPERCONTENTS_SLIME)
591 return CONTENTS_SLIME;
592 if (supercontents & SUPERCONTENTS_WATER)
593 return CONTENTS_WATER;
594 return CONTENTS_EMPTY;
597 typedef struct RecursiveHullCheckTraceInfo_s
599 // the hull we're tracing through
602 // the trace structure to fill in
605 // start, end, and end - start (in model space)
610 RecursiveHullCheckTraceInfo_t;
612 // 1/32 epsilon to keep floating point happy
613 #define DIST_EPSILON (0.03125)
615 #define HULLCHECKSTATE_EMPTY 0
616 #define HULLCHECKSTATE_SOLID 1
617 #define HULLCHECKSTATE_DONE 2
619 extern cvar_t collision_prefernudgedfraction;
620 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
622 // status variables, these don't need to be saved on the stack when
623 // recursing... but are because this should be thread-safe
624 // (note: tracing against a bbox is not thread-safe, yet)
629 // variables that need to be stored on the stack when recursing
634 // LordHavoc: a goto! everyone flee in terror... :)
639 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
640 if (!t->trace->startfound)
642 t->trace->startfound = true;
643 t->trace->startsupercontents |= num;
645 if (num & SUPERCONTENTS_LIQUIDSMASK)
646 t->trace->inwater = true;
648 t->trace->inopen = true;
649 if (num & SUPERCONTENTS_SOLID)
650 t->trace->hittexture = &mod_q1bsp_texture_solid;
651 else if (num & SUPERCONTENTS_SKY)
652 t->trace->hittexture = &mod_q1bsp_texture_sky;
653 else if (num & SUPERCONTENTS_LAVA)
654 t->trace->hittexture = &mod_q1bsp_texture_lava;
655 else if (num & SUPERCONTENTS_SLIME)
656 t->trace->hittexture = &mod_q1bsp_texture_slime;
658 t->trace->hittexture = &mod_q1bsp_texture_water;
659 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
660 t->trace->hitsupercontents = num;
661 if (num & t->trace->hitsupercontentsmask)
663 // if the first leaf is solid, set startsolid
664 if (t->trace->allsolid)
665 t->trace->startsolid = true;
666 #if COLLISIONPARANOID >= 3
669 return HULLCHECKSTATE_SOLID;
673 t->trace->allsolid = false;
674 #if COLLISIONPARANOID >= 3
677 return HULLCHECKSTATE_EMPTY;
681 // find the point distances
682 node = t->hull->clipnodes + num;
684 plane = t->hull->planes + node->planenum;
687 t1 = p1[plane->type] - plane->dist;
688 t2 = p2[plane->type] - plane->dist;
692 t1 = DotProduct (plane->normal, p1) - plane->dist;
693 t2 = DotProduct (plane->normal, p2) - plane->dist;
700 #if COLLISIONPARANOID >= 3
703 num = node->children[1];
712 #if COLLISIONPARANOID >= 3
715 num = node->children[0];
721 // the line intersects, find intersection point
722 // LordHavoc: this uses the original trace for maximum accuracy
723 #if COLLISIONPARANOID >= 3
728 t1 = t->start[plane->type] - plane->dist;
729 t2 = t->end[plane->type] - plane->dist;
733 t1 = DotProduct (plane->normal, t->start) - plane->dist;
734 t2 = DotProduct (plane->normal, t->end) - plane->dist;
737 midf = t1 / (t1 - t2);
738 midf = bound(p1f, midf, p2f);
739 VectorMA(t->start, midf, t->dist, mid);
741 // recurse both sides, front side first
742 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
743 // if this side is not empty, return what it is (solid or done)
744 if (ret != HULLCHECKSTATE_EMPTY)
747 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
748 // if other side is not solid, return what it is (empty or done)
749 if (ret != HULLCHECKSTATE_SOLID)
752 // front is air and back is solid, this is the impact point...
755 t->trace->plane.dist = -plane->dist;
756 VectorNegate (plane->normal, t->trace->plane.normal);
760 t->trace->plane.dist = plane->dist;
761 VectorCopy (plane->normal, t->trace->plane.normal);
764 // calculate the true fraction
765 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
766 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
767 midf = t1 / (t1 - t2);
768 t->trace->realfraction = bound(0, midf, 1);
770 // calculate the return fraction which is nudged off the surface a bit
771 midf = (t1 - DIST_EPSILON) / (t1 - t2);
772 t->trace->fraction = bound(0, midf, 1);
774 if (collision_prefernudgedfraction.integer)
775 t->trace->realfraction = t->trace->fraction;
777 #if COLLISIONPARANOID >= 3
780 return HULLCHECKSTATE_DONE;
783 //#if COLLISIONPARANOID < 2
784 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
787 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];
788 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
789 t->trace->startsupercontents |= num;
790 if (num & SUPERCONTENTS_LIQUIDSMASK)
791 t->trace->inwater = true;
793 t->trace->inopen = true;
794 if (num & t->trace->hitsupercontentsmask)
796 t->trace->allsolid = t->trace->startsolid = true;
797 return HULLCHECKSTATE_SOLID;
801 t->trace->allsolid = t->trace->startsolid = false;
802 return HULLCHECKSTATE_EMPTY;
807 static void Mod_Q1BSP_TraceBox(struct model_s *model, int frame, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
809 // this function currently only supports same size start and end
811 RecursiveHullCheckTraceInfo_t rhc;
813 memset(&rhc, 0, sizeof(rhc));
814 memset(trace, 0, sizeof(trace_t));
816 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
817 rhc.trace->fraction = 1;
818 rhc.trace->realfraction = 1;
819 rhc.trace->allsolid = true;
820 VectorSubtract(boxmaxs, boxmins, boxsize);
822 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
823 else if (model->brush.ismcbsp)
829 vdist = 0; // shut up compiler warning
831 // find the closest hull size (this algorithm probably sucks, a qc field to override it might be in order...)
832 for (i = 1; i < model->brushq1.numhulls; i++)
834 dist = fabs(model->brushq1.hulls[i].clip_size[0] - boxsize[0]) +
835 fabs(model->brushq1.hulls[i].clip_size[1] - boxsize[1]) +
836 fabs(model->brushq1.hulls[i].clip_size[2] - boxsize[2]) * 0.25;
838 if (!vdisti || dist < vdist)
844 rhc.hull = &model->brushq1.hulls[vdisti];
846 else if (model->brush.ishlbsp)
848 // LordHavoc: this has to have a minor tolerance (the .1) because of
849 // minor float precision errors from the box being transformed around
850 if (boxsize[0] < 32.1)
852 if (boxsize[2] < 54) // pick the nearest of 36 or 72
853 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
855 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
858 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
862 // LordHavoc: this has to have a minor tolerance (the .1) because of
863 // minor float precision errors from the box being transformed around
864 if (boxsize[0] < 32.1)
865 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
867 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
869 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
870 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
871 VectorSubtract(rhc.end, rhc.start, rhc.dist);
872 #if COLLISIONPARANOID >= 2
873 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]);
874 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
879 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
880 memset(&testtrace, 0, sizeof(trace_t));
881 rhc.trace = &testtrace;
882 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
883 rhc.trace->fraction = 1;
884 rhc.trace->realfraction = 1;
885 rhc.trace->allsolid = true;
886 VectorCopy(test, rhc.start);
887 VectorCopy(test, rhc.end);
888 VectorClear(rhc.dist);
889 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
890 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
891 if (!trace->startsolid && testtrace.startsolid)
892 Con_Printf(" - ended in solid!\n");
896 if (VectorLength2(rhc.dist))
897 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
899 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
903 void Collision_ClipTrace_Box(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, const vec3_t mins, const vec3_t maxs, const vec3_t end, int hitsupercontentsmask, int boxsupercontents, int boxq3surfaceflags, texture_t *boxtexture)
907 colplanef_t cbox_planes[6];
908 cbox.supercontents = boxsupercontents;
911 cbox.numtriangles = 0;
912 cbox.planes = cbox_planes;
914 cbox.elements = NULL;
922 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];
923 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];
924 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];
925 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];
926 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];
927 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];
928 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
929 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
930 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
931 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
932 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
933 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
934 memset(trace, 0, sizeof(trace_t));
935 trace->hitsupercontentsmask = hitsupercontentsmask;
937 trace->realfraction = 1;
938 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
940 RecursiveHullCheckTraceInfo_t rhc;
941 static hull_t box_hull;
942 static mclipnode_t box_clipnodes[6];
943 static mplane_t box_planes[6];
944 // fill in a default trace
945 memset(&rhc, 0, sizeof(rhc));
946 memset(trace, 0, sizeof(trace_t));
947 //To keep everything totally uniform, bounding boxes are turned into small
948 //BSP trees instead of being compared directly.
949 // create a temp hull from bounding box sizes
950 box_planes[0].dist = cmaxs[0] - mins[0];
951 box_planes[1].dist = cmins[0] - maxs[0];
952 box_planes[2].dist = cmaxs[1] - mins[1];
953 box_planes[3].dist = cmins[1] - maxs[1];
954 box_planes[4].dist = cmaxs[2] - mins[2];
955 box_planes[5].dist = cmins[2] - maxs[2];
956 #if COLLISIONPARANOID >= 3
957 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]);
960 if (box_hull.clipnodes == NULL)
964 //Set up the planes and clipnodes so that the six floats of a bounding box
965 //can just be stored out and get a proper hull_t structure.
967 box_hull.clipnodes = box_clipnodes;
968 box_hull.planes = box_planes;
969 box_hull.firstclipnode = 0;
970 box_hull.lastclipnode = 5;
972 for (i = 0;i < 6;i++)
974 box_clipnodes[i].planenum = i;
978 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
980 box_clipnodes[i].children[side^1] = i + 1;
982 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
984 box_planes[i].type = i>>1;
985 box_planes[i].normal[i>>1] = 1;
989 // trace a line through the generated clipping hull
990 //rhc.boxsupercontents = boxsupercontents;
991 rhc.hull = &box_hull;
993 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
994 rhc.trace->fraction = 1;
995 rhc.trace->realfraction = 1;
996 rhc.trace->allsolid = true;
997 VectorCopy(start, rhc.start);
998 VectorCopy(end, rhc.end);
999 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1000 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1001 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1002 if (rhc.trace->startsupercontents)
1003 rhc.trace->startsupercontents = boxsupercontents;
1007 static int Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
1010 double midf, mid[3];
1016 // find the point distances
1017 mplane_t *plane = node->plane;
1018 if (plane->type < 3)
1020 t1 = p1[plane->type] - plane->dist;
1021 t2 = p2[plane->type] - plane->dist;
1025 t1 = DotProduct (plane->normal, p1) - plane->dist;
1026 t2 = DotProduct (plane->normal, p2) - plane->dist;
1033 node = node->children[1];
1042 node = node->children[0];
1048 midf = t1 / (t1 - t2);
1049 VectorLerp(p1, midf, p2, mid);
1051 // recurse both sides, front side first
1052 // return 2 if empty is followed by solid (hit something)
1053 // do not return 2 if both are solid or both empty,
1054 // or if start is solid and end is empty
1055 // as these degenerate cases usually indicate the eye is in solid and
1056 // should see the target point anyway
1057 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
1060 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
1065 return ((mleaf_t *)node)->clusterindex < 0;
1068 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1070 // this function currently only supports same size start and end
1071 double tracestart[3], traceend[3];
1072 VectorCopy(start, tracestart);
1073 VectorCopy(end, traceend);
1074 return Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend) != 2;
1077 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)
1081 float mid, distz = endz - startz;
1085 return false; // didn't hit anything
1087 switch (node->plane->type)
1090 node = node->children[x < node->plane->dist];
1093 node = node->children[y < node->plane->dist];
1096 side = startz < node->plane->dist;
1097 if ((endz < node->plane->dist) == side)
1099 node = node->children[side];
1102 // found an intersection
1103 mid = node->plane->dist;
1106 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1107 front += startz * node->plane->normal[2];
1108 back += endz * node->plane->normal[2];
1109 side = front < node->plane->dist;
1110 if ((back < node->plane->dist) == side)
1112 node = node->children[side];
1115 // found an intersection
1116 mid = startz + distz * (front - node->plane->dist) / (front - back);
1120 // go down front side
1121 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1122 return true; // hit something
1125 // check for impact on this node
1126 if (node->numsurfaces)
1128 int i, dsi, dti, lmwidth, lmheight;
1130 msurface_t *surface;
1131 unsigned char *lightmap;
1132 int maps, line3, size3;
1135 float scale, w, w00, w01, w10, w11;
1137 surface = model->data_surfaces + node->firstsurface;
1138 for (i = 0;i < node->numsurfaces;i++, surface++)
1140 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1141 continue; // no lightmaps
1143 // location we want to sample in the lightmap
1144 ds = ((x * surface->lightmapinfo->texinfo->vecs[0][0] + y * surface->lightmapinfo->texinfo->vecs[0][1] + mid * surface->lightmapinfo->texinfo->vecs[0][2] + surface->lightmapinfo->texinfo->vecs[0][3]) - surface->lightmapinfo->texturemins[0]) * 0.0625f;
1145 dt = ((x * surface->lightmapinfo->texinfo->vecs[1][0] + y * surface->lightmapinfo->texinfo->vecs[1][1] + mid * surface->lightmapinfo->texinfo->vecs[1][2] + surface->lightmapinfo->texinfo->vecs[1][3]) - surface->lightmapinfo->texturemins[1]) * 0.0625f;
1150 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1151 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1154 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1156 // calculate bilinear interpolation factors
1157 // and also multiply by fixedpoint conversion factors
1160 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1161 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1162 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1163 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1165 // values for pointer math
1166 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1167 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1169 // look up the pixel
1170 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1172 // bilinear filter each lightmap style, and sum them
1173 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1175 scale = r_refdef.lightstylevalue[surface->lightmapinfo->styles[maps]];
1176 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1177 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1178 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1179 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1183 return true; // success
1188 // go down back side
1189 node = node->children[side ^ 1];
1191 distz = endz - startz;
1196 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1198 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1199 VectorSet(diffusenormal, 0, 0, 1);
1201 if (!model->brushq1.lightdata)
1203 VectorSet(ambientcolor, 1, 1, 1);
1204 VectorSet(diffusecolor, 0, 0, 0);
1208 Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode, p[0], p[1], p[2] + 0.125, p[2] - 65536);
1211 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1214 unsigned char *outstart = out;
1215 while (out < outend)
1219 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1229 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun (during zero-run) on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1232 for (c = *in++;c > 0;c--)
1236 Con_Printf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1247 R_Q1BSP_LoadSplitSky
1249 A sky texture is 256*128, with the right side being a masked overlay
1252 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1255 unsigned solidpixels[128*128], alphapixels[128*128];
1257 // allocate a texture pool if we need it
1258 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1259 loadmodel->texturepool = R_AllocTexturePool();
1261 if (bytesperpixel == 4)
1263 for (i = 0;i < 128;i++)
1265 for (j = 0;j < 128;j++)
1267 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1268 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1274 // make an average value for the back to avoid
1275 // a fringe on the top level
1284 for (i = 0;i < 128;i++)
1286 for (j = 0;j < 128;j++)
1288 p = src[i*256 + j + 128];
1289 r += palette_rgb[p][0];
1290 g += palette_rgb[p][1];
1291 b += palette_rgb[p][2];
1294 bgra.b[2] = r/(128*128);
1295 bgra.b[1] = g/(128*128);
1296 bgra.b[0] = b/(128*128);
1298 for (i = 0;i < 128;i++)
1300 for (j = 0;j < 128;j++)
1302 solidpixels[(i*128) + j] = palette_bgra_complete[src[i*256 + j + 128]];
1304 alphapixels[(i*128) + j] = p ? palette_bgra_complete[p] : bgra.i;
1309 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1310 loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1313 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1315 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1316 skinframe_t *skinframe;
1318 texture_t *tx, *tx2, *anims[10], *altanims[10];
1320 unsigned char *data, *mtdata;
1322 char mapname[MAX_QPATH], name[MAX_QPATH];
1324 loadmodel->data_textures = NULL;
1326 // add two slots for notexture walls and notexture liquids
1329 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1330 m->nummiptex = LittleLong (m->nummiptex);
1331 loadmodel->num_textures = m->nummiptex + 2;
1332 loadmodel->num_texturesperskin = loadmodel->num_textures;
1337 loadmodel->num_textures = 2;
1338 loadmodel->num_texturesperskin = loadmodel->num_textures;
1341 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1343 // fill out all slots with notexture
1344 if (cls.state != ca_dedicated)
1345 skinframe = R_SkinFrame_LoadMissing();
1348 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1350 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1353 if (cls.state != ca_dedicated)
1355 tx->numskinframes = 1;
1356 tx->skinframerate = 1;
1357 tx->skinframes[0] = skinframe;
1358 tx->currentskinframe = tx->skinframes[0];
1359 tx->basematerialflags = 0;
1361 if (i == loadmodel->num_textures - 1)
1363 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1364 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1365 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1369 tx->basematerialflags |= MATERIALFLAG_WALL;
1370 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1371 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1373 tx->currentframe = tx;
1375 // clear water settings
1378 tx->refractfactor = 1;
1379 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1380 tx->reflectfactor = 1;
1381 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1386 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1390 s = loadmodel->name;
1391 if (!strncasecmp(s, "maps/", 5))
1393 FS_StripExtension(s, mapname, sizeof(mapname));
1395 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1397 // LordHavoc: mostly rewritten map texture loader
1398 for (i = 0;i < m->nummiptex;i++)
1400 dofs[i] = LittleLong(dofs[i]);
1401 if (r_nosurftextures.integer)
1405 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1408 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1410 // copy name, but only up to 16 characters
1411 // (the output buffer can hold more than this, but the input buffer is
1413 for (j = 0;dmiptex->name[j] && j < 16;j++)
1414 name[j] = dmiptex->name[j];
1419 sprintf(name, "unnamed%i", i);
1420 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1423 mtwidth = LittleLong(dmiptex->width);
1424 mtheight = LittleLong(dmiptex->height);
1426 j = LittleLong(dmiptex->offsets[0]);
1430 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1432 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1435 mtdata = (unsigned char *)dmiptex + j;
1438 if ((mtwidth & 15) || (mtheight & 15))
1439 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1441 // LordHavoc: force all names to lowercase
1442 for (j = 0;name[j];j++)
1443 if (name[j] >= 'A' && name[j] <= 'Z')
1444 name[j] += 'a' - 'A';
1446 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, true, false, false))
1449 tx = loadmodel->data_textures + i;
1450 strlcpy(tx->name, name, sizeof(tx->name));
1451 tx->width = mtwidth;
1452 tx->height = mtheight;
1454 if (tx->name[0] == '*')
1456 if (!strncmp(tx->name, "*lava", 5))
1458 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1459 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1461 else if (!strncmp(tx->name, "*slime", 6))
1463 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1464 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1468 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1469 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1472 else if (!strncmp(tx->name, "sky", 3))
1474 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1475 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1479 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1480 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1483 if (cls.state != ca_dedicated)
1485 // LordHavoc: HL sky textures are entirely different than quake
1486 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1488 if (loadmodel->isworldmodel)
1490 data = loadimagepixelsbgra(tx->name, false, false);
1491 if (data && image_width == 256 && image_height == 128)
1493 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1496 else if (mtdata != NULL)
1497 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1502 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1504 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1507 // did not find external texture, load it from the bsp or wad3
1508 if (loadmodel->brush.ishlbsp)
1510 // internal texture overrides wad
1511 unsigned char *pixels, *freepixels;
1512 pixels = freepixels = NULL;
1514 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1516 pixels = freepixels = W_GetTextureBGRA(tx->name);
1519 tx->width = image_width;
1520 tx->height = image_height;
1521 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1524 Mem_Free(freepixels);
1526 else if (mtdata) // texture included
1527 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1529 // if skinframe is still NULL the "missing" texture will be used
1531 tx->skinframes[0] = skinframe;
1534 tx->basematerialflags = 0;
1535 if (tx->name[0] == '*')
1537 // LordHavoc: some turbulent textures should not be affected by wateralpha
1538 if (strncmp(tx->name,"*lava",5)
1539 && strncmp(tx->name,"*teleport",9)
1540 && strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1541 tx->basematerialflags |= MATERIALFLAG_WATERALPHA | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERSHADER;
1542 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1544 else if (!strncmp(tx->name, "sky", 3))
1545 tx->basematerialflags |= MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1547 tx->basematerialflags |= MATERIALFLAG_WALL;
1548 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1549 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1551 // start out with no animation
1552 tx->currentframe = tx;
1553 tx->currentskinframe = tx->skinframes[0];
1557 // sequence the animations
1558 for (i = 0;i < m->nummiptex;i++)
1560 tx = loadmodel->data_textures + i;
1561 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1563 if (tx->anim_total[0] || tx->anim_total[1])
1564 continue; // already sequenced
1566 // find the number of frames in the animation
1567 memset(anims, 0, sizeof(anims));
1568 memset(altanims, 0, sizeof(altanims));
1570 for (j = i;j < m->nummiptex;j++)
1572 tx2 = loadmodel->data_textures + j;
1573 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1577 if (num >= '0' && num <= '9')
1578 anims[num - '0'] = tx2;
1579 else if (num >= 'a' && num <= 'j')
1580 altanims[num - 'a'] = tx2;
1582 Con_Printf("Bad animating texture %s\n", tx->name);
1586 for (j = 0;j < 10;j++)
1593 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1596 for (j = 0;j < max;j++)
1600 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1604 for (j = 0;j < altmax;j++)
1608 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1617 // if there is no alternate animation, duplicate the primary
1618 // animation into the alternate
1620 for (k = 0;k < 10;k++)
1621 altanims[k] = anims[k];
1624 // link together the primary animation
1625 for (j = 0;j < max;j++)
1628 tx2->animated = true;
1629 tx2->anim_total[0] = max;
1630 tx2->anim_total[1] = altmax;
1631 for (k = 0;k < 10;k++)
1633 tx2->anim_frames[0][k] = anims[k];
1634 tx2->anim_frames[1][k] = altanims[k];
1638 // if there really is an alternate anim...
1639 if (anims[0] != altanims[0])
1641 // link together the alternate animation
1642 for (j = 0;j < altmax;j++)
1645 tx2->animated = true;
1646 // the primary/alternate are reversed here
1647 tx2->anim_total[0] = altmax;
1648 tx2->anim_total[1] = max;
1649 for (k = 0;k < 10;k++)
1651 tx2->anim_frames[0][k] = altanims[k];
1652 tx2->anim_frames[1][k] = anims[k];
1659 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1662 unsigned char *in, *out, *data, d;
1663 char litfilename[MAX_QPATH];
1664 char dlitfilename[MAX_QPATH];
1665 fs_offset_t filesize;
1666 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1668 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1669 for (i=0; i<l->filelen; i++)
1670 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1672 else if (loadmodel->brush.ismcbsp)
1674 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1675 memcpy(loadmodel->brushq1.lightdata, mod_base + l->fileofs, l->filelen);
1677 else // LordHavoc: bsp version 29 (normal white lighting)
1679 // LordHavoc: hope is not lost yet, check for a .lit file to load
1680 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1681 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1682 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1683 strlcat (litfilename, ".lit", sizeof (litfilename));
1684 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1685 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1688 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1690 i = LittleLong(((int *)data)[1]);
1693 Con_DPrintf("loaded %s\n", litfilename);
1694 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1695 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1697 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1700 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1702 i = LittleLong(((int *)data)[1]);
1705 Con_DPrintf("loaded %s\n", dlitfilename);
1706 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1707 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1708 loadmodel->brushq3.deluxemapping_modelspace = false;
1709 loadmodel->brushq3.deluxemapping = true;
1718 Con_Printf("Unknown .lit file version (%d)\n", i);
1720 else if (filesize == 8)
1721 Con_Print("Empty .lit file, ignoring\n");
1723 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1730 // LordHavoc: oh well, expand the white lighting data
1733 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1734 in = mod_base + l->fileofs;
1735 out = loadmodel->brushq1.lightdata;
1736 for (i = 0;i < l->filelen;i++)
1746 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1748 loadmodel->brushq1.num_compressedpvs = 0;
1749 loadmodel->brushq1.data_compressedpvs = NULL;
1752 loadmodel->brushq1.num_compressedpvs = l->filelen;
1753 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1754 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1757 // used only for HalfLife maps
1758 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1760 char key[128], value[4096];
1765 if (!COM_ParseToken_Simple(&data, false, false))
1767 if (com_token[0] != '{')
1771 if (!COM_ParseToken_Simple(&data, false, false))
1773 if (com_token[0] == '}')
1774 break; // end of worldspawn
1775 if (com_token[0] == '_')
1776 strlcpy(key, com_token + 1, sizeof(key));
1778 strlcpy(key, com_token, sizeof(key));
1779 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1780 key[strlen(key)-1] = 0;
1781 if (!COM_ParseToken_Simple(&data, false, false))
1783 dpsnprintf(value, sizeof(value), "%s", com_token);
1784 if (!strcmp("wad", key)) // for HalfLife maps
1786 if (loadmodel->brush.ishlbsp)
1789 for (i = 0;i < (int)sizeof(value);i++)
1790 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1794 for (;i < (int)sizeof(value);i++)
1796 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1797 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1799 else if (value[i] == ';' || value[i] == 0)
1803 strlcpy(wadname, "textures/", sizeof(wadname));
1804 strlcat(wadname, &value[j], sizeof(wadname));
1805 W_LoadTextureWadFile(wadname, false);
1817 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1819 loadmodel->brush.entities = NULL;
1822 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1823 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1824 if (loadmodel->brush.ishlbsp)
1825 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1829 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1835 in = (dvertex_t *)(mod_base + l->fileofs);
1836 if (l->filelen % sizeof(*in))
1837 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1838 count = l->filelen / sizeof(*in);
1839 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1841 loadmodel->brushq1.vertexes = out;
1842 loadmodel->brushq1.numvertexes = count;
1844 for ( i=0 ; i<count ; i++, in++, out++)
1846 out->position[0] = LittleFloat(in->point[0]);
1847 out->position[1] = LittleFloat(in->point[1]);
1848 out->position[2] = LittleFloat(in->point[2]);
1852 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1853 // can be used for this
1855 int SB_ReadInt (unsigned char **buffer)
1858 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1864 float SB_ReadFloat (unsigned char **buffer)
1872 u.i = SB_ReadInt (buffer);
1876 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1878 unsigned char *index;
1882 index = (unsigned char *)(mod_base + l->fileofs);
1883 if (l->filelen % (48+4*hullinfo->filehulls))
1884 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1886 count = l->filelen / (48+4*hullinfo->filehulls);
1887 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1889 loadmodel->brushq1.submodels = out;
1890 loadmodel->brush.numsubmodels = count;
1892 for (i = 0; i < count; i++, out++)
1894 // spread out the mins / maxs by a pixel
1895 out->mins[0] = SB_ReadFloat (&index) - 1;
1896 out->mins[1] = SB_ReadFloat (&index) - 1;
1897 out->mins[2] = SB_ReadFloat (&index) - 1;
1898 out->maxs[0] = SB_ReadFloat (&index) + 1;
1899 out->maxs[1] = SB_ReadFloat (&index) + 1;
1900 out->maxs[2] = SB_ReadFloat (&index) + 1;
1901 out->origin[0] = SB_ReadFloat (&index);
1902 out->origin[1] = SB_ReadFloat (&index);
1903 out->origin[2] = SB_ReadFloat (&index);
1904 for (j = 0; j < hullinfo->filehulls; j++)
1905 out->headnode[j] = SB_ReadInt (&index);
1906 out->visleafs = SB_ReadInt (&index);
1907 out->firstface = SB_ReadInt (&index);
1908 out->numfaces = SB_ReadInt (&index);
1912 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1918 in = (dedge_t *)(mod_base + l->fileofs);
1919 if (l->filelen % sizeof(*in))
1920 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1921 count = l->filelen / sizeof(*in);
1922 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1924 loadmodel->brushq1.edges = out;
1925 loadmodel->brushq1.numedges = count;
1927 for ( i=0 ; i<count ; i++, in++, out++)
1929 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1930 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1931 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1933 Con_Printf("Mod_Q1BSP_LoadEdges: %s has invalid vertex indices in edge %i (vertices %i %i >= numvertices %i)\n", loadmodel->name, i, out->v[0], out->v[1], loadmodel->brushq1.numvertexes);
1940 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1944 int i, j, k, count, miptex;
1946 in = (texinfo_t *)(mod_base + l->fileofs);
1947 if (l->filelen % sizeof(*in))
1948 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1949 count = l->filelen / sizeof(*in);
1950 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1952 loadmodel->brushq1.texinfo = out;
1953 loadmodel->brushq1.numtexinfo = count;
1955 for (i = 0;i < count;i++, in++, out++)
1957 for (k = 0;k < 2;k++)
1958 for (j = 0;j < 4;j++)
1959 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1961 miptex = LittleLong(in->miptex);
1962 out->flags = LittleLong(in->flags);
1964 out->texture = NULL;
1965 if (loadmodel->data_textures)
1967 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1968 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1970 out->texture = loadmodel->data_textures + miptex;
1972 if (out->flags & TEX_SPECIAL)
1974 // if texture chosen is NULL or the shader needs a lightmap,
1975 // force to notexture water shader
1976 if (out->texture == NULL || out->texture->basematerialflags & MATERIALFLAG_WALL)
1977 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1981 // if texture chosen is NULL, force to notexture
1982 if (out->texture == NULL)
1983 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1989 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1994 mins[0] = mins[1] = mins[2] = 9999;
1995 maxs[0] = maxs[1] = maxs[2] = -9999;
1997 for (i = 0;i < numverts;i++)
1999 for (j = 0;j < 3;j++, v++)
2009 #define MAX_SUBDIVPOLYTRIANGLES 4096
2010 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2012 static int subdivpolyverts, subdivpolytriangles;
2013 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2014 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2016 static int subdivpolylookupvert(vec3_t v)
2019 for (i = 0;i < subdivpolyverts;i++)
2020 if (subdivpolyvert[i][0] == v[0]
2021 && subdivpolyvert[i][1] == v[1]
2022 && subdivpolyvert[i][2] == v[2])
2024 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2025 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2026 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2027 return subdivpolyverts++;
2030 static void SubdividePolygon(int numverts, float *verts)
2032 int i, i1, i2, i3, f, b, c, p;
2033 vec3_t mins, maxs, front[256], back[256];
2034 float m, *pv, *cv, dist[256], frac;
2037 Host_Error("SubdividePolygon: ran out of verts in buffer");
2039 BoundPoly(numverts, verts, mins, maxs);
2041 for (i = 0;i < 3;i++)
2043 m = (mins[i] + maxs[i]) * 0.5;
2044 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2045 if (maxs[i] - m < 8)
2047 if (m - mins[i] < 8)
2051 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2052 dist[c] = cv[i] - m;
2055 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2059 VectorCopy(pv, front[f]);
2064 VectorCopy(pv, back[b]);
2067 if (dist[p] == 0 || dist[c] == 0)
2069 if ((dist[p] > 0) != (dist[c] > 0) )
2072 frac = dist[p] / (dist[p] - dist[c]);
2073 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2074 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2075 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2081 SubdividePolygon(f, front[0]);
2082 SubdividePolygon(b, back[0]);
2086 i1 = subdivpolylookupvert(verts);
2087 i2 = subdivpolylookupvert(verts + 3);
2088 for (i = 2;i < numverts;i++)
2090 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2092 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2096 i3 = subdivpolylookupvert(verts + i * 3);
2097 subdivpolyindex[subdivpolytriangles][0] = i1;
2098 subdivpolyindex[subdivpolytriangles][1] = i2;
2099 subdivpolyindex[subdivpolytriangles][2] = i3;
2101 subdivpolytriangles++;
2105 //Breaks a polygon up along axial 64 unit
2106 //boundaries so that turbulent and sky warps
2107 //can be done reasonably.
2108 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2114 subdivpolytriangles = 0;
2115 subdivpolyverts = 0;
2116 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2117 if (subdivpolytriangles < 1)
2118 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2120 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2121 mesh->num_vertices = subdivpolyverts;
2122 mesh->num_triangles = subdivpolytriangles;
2123 mesh->vertex = (surfvertex_t *)(mesh + 1);
2124 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2125 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2127 for (i = 0;i < mesh->num_triangles;i++)
2128 for (j = 0;j < 3;j++)
2129 mesh->index[i*3+j] = subdivpolyindex[i][j];
2131 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2133 VectorCopy(subdivpolyvert[i], v->v);
2134 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2135 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2140 /* Maximum size of a single LM */
2141 #define MAX_SINGLE_LM_SIZE 256
2149 struct alloc_lm_state
2152 struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2155 static void init_alloc_lm_state (struct alloc_lm_state* state)
2159 state->currentY = 0;
2160 for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2162 state->rows[r].currentX = 0;
2163 state->rows[r].rowY = -1;
2167 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2169 struct alloc_lm_row* row;
2172 row = &(state->rows[blockheight]);
2173 if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2175 if (state->currentY + blockheight <= totalheight)
2177 row->rowY = state->currentY;
2179 state->currentY += blockheight;
2183 /* See if we can stuff the block into a higher row */
2185 for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2187 if ((state->rows[r].rowY >= 0)
2188 && (state->rows[r].currentX + blockwidth <= totalwidth))
2190 row = &(state->rows[r]);
2194 if (row == NULL) return false;
2198 *outx = row->currentX;
2199 row->currentX += blockwidth;
2204 extern cvar_t gl_max_size;
2205 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2208 msurface_t *surface;
2209 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2210 float texmins[2], texmaxs[2], val;
2211 rtexture_t *lightmaptexture, *deluxemaptexture;
2213 in = (dface_t *)(mod_base + l->fileofs);
2214 if (l->filelen % sizeof(*in))
2215 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2216 count = l->filelen / sizeof(*in);
2217 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2218 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2220 loadmodel->num_surfaces = count;
2224 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2226 numedges = (unsigned short)LittleShort(in->numedges);
2227 totalverts += numedges;
2228 totaltris += numedges - 2;
2231 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2233 lightmaptexture = NULL;
2234 deluxemaptexture = r_texture_blanknormalmap;
2236 lightmapsize = max(256, gl_max_size.integer);
2237 totallightmapsamples = 0;
2241 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2243 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2245 // FIXME: validate edges, texinfo, etc?
2246 firstedge = LittleLong(in->firstedge);
2247 numedges = (unsigned short)LittleShort(in->numedges);
2248 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)
2249 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2250 i = (unsigned short)LittleShort(in->texinfo);
2251 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2252 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2253 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2254 surface->texture = surface->lightmapinfo->texinfo->texture;
2256 planenum = (unsigned short)LittleShort(in->planenum);
2257 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2258 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2260 //surface->flags = surface->texture->flags;
2261 //if (LittleShort(in->side))
2262 // surface->flags |= SURF_PLANEBACK;
2263 //surface->plane = loadmodel->brush.data_planes + planenum;
2265 surface->num_firstvertex = totalverts;
2266 surface->num_vertices = numedges;
2267 surface->num_firsttriangle = totaltris;
2268 surface->num_triangles = numedges - 2;
2269 totalverts += numedges;
2270 totaltris += numedges - 2;
2272 // convert edges back to a normal polygon
2273 for (i = 0;i < surface->num_vertices;i++)
2275 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2278 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2280 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2281 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2282 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2283 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2284 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2285 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2286 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2287 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2290 for (i = 0;i < surface->num_triangles;i++)
2292 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2293 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2294 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2297 // compile additional data about the surface geometry
2298 Mod_BuildNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_normal3f, true);
2299 Mod_BuildTextureVectorsFromNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_texcoordtexture2f, loadmodel->surfmesh.data_normal3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_svector3f, loadmodel->surfmesh.data_tvector3f, true);
2300 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2302 // generate surface extents information
2303 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2304 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2305 for (i = 1;i < surface->num_vertices;i++)
2307 for (j = 0;j < 2;j++)
2309 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2310 texmins[j] = min(texmins[j], val);
2311 texmaxs[j] = max(texmaxs[j], val);
2314 for (i = 0;i < 2;i++)
2316 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2317 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2320 smax = surface->lightmapinfo->extents[0] >> 4;
2321 tmax = surface->lightmapinfo->extents[1] >> 4;
2322 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2323 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2326 for (i = 0;i < MAXLIGHTMAPS;i++)
2327 surface->lightmapinfo->styles[i] = in->styles[i];
2328 surface->lightmaptexture = NULL;
2329 surface->deluxemaptexture = r_texture_blanknormalmap;
2330 i = LittleLong(in->lightofs);
2333 surface->lightmapinfo->samples = NULL;
2334 // give non-lightmapped water a 1x white lightmap
2335 if ((surface->texture->basematerialflags & MATERIALFLAG_WATER) && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2337 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2338 surface->lightmapinfo->styles[0] = 0;
2339 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2342 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2343 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2344 else // LordHavoc: white lighting (bsp version 29)
2346 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2347 if (loadmodel->brushq1.nmaplightdata)
2348 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2351 // check if we should apply a lightmap to this
2352 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2354 if (ssize > 256 || tsize > 256)
2355 Host_Error("Bad surface extents");
2357 if (lightmapsize < ssize)
2358 lightmapsize = ssize;
2359 if (lightmapsize < tsize)
2360 lightmapsize = tsize;
2362 totallightmapsamples += ssize*tsize;
2364 // force lightmap upload on first time seeing the surface
2366 // additionally this is used by the later code to see if a
2367 // lightmap is needed on this surface (rather than duplicating the
2369 surface->cached_dlight = true;
2373 // small maps (such as ammo boxes especially) don't need big lightmap
2374 // textures, so this code tries to guess a good size based on
2375 // totallightmapsamples (size of the lightmaps lump basically), as well as
2376 // trying to max out the gl_max_size if there is a lot of lightmap data to
2378 // additionally, never choose a lightmapsize that is smaller than the
2379 // largest surface encountered (as it would fail)
2381 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2384 // now that we've decided the lightmap texture size, we can do the rest
2385 if (cls.state != ca_dedicated)
2387 struct alloc_lm_state allocState;
2389 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2391 int i, iu, iv, lightmapx, lightmapy;
2392 float u, v, ubase, vbase, uscale, vscale;
2394 smax = surface->lightmapinfo->extents[0] >> 4;
2395 tmax = surface->lightmapinfo->extents[1] >> 4;
2396 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2397 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2399 // stainmap for permanent marks on walls
2400 surface->lightmapinfo->stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2402 memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
2404 if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2406 // allocate a texture pool if we need it
2407 if (loadmodel->texturepool == NULL)
2408 loadmodel->texturepool = R_AllocTexturePool();
2409 // could not find room, make a new lightmap
2410 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2411 if (loadmodel->brushq1.nmaplightdata)
2412 deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2414 init_alloc_lm_state (&allocState);
2415 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2417 surface->lightmaptexture = lightmaptexture;
2418 surface->deluxemaptexture = deluxemaptexture;
2419 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2420 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2422 uscale = 1.0f / (float)lightmapsize;
2423 vscale = 1.0f / (float)lightmapsize;
2424 ubase = lightmapx * uscale;
2425 vbase = lightmapy * vscale;
2427 for (i = 0;i < surface->num_vertices;i++)
2429 u = ((DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3]) + 8 - surface->lightmapinfo->texturemins[0]) * (1.0 / 16.0);
2430 v = ((DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3]) + 8 - surface->lightmapinfo->texturemins[1]) * (1.0 / 16.0);
2431 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2432 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2433 // LordHavoc: calc lightmap data offset for vertex lighting to use
2436 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2443 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2446 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2447 node->parent = parent;
2450 // this is a node, recurse to children
2451 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2452 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2453 // combine supercontents of children
2454 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2459 mleaf_t *leaf = (mleaf_t *)node;
2460 // if this is a leaf, calculate supercontents mask from all collidable
2461 // primitives in the leaf (brushes and collision surfaces)
2462 // also flag if the leaf contains any collision surfaces
2463 leaf->combinedsupercontents = 0;
2464 // combine the supercontents values of all brushes in this leaf
2465 for (j = 0;j < leaf->numleafbrushes;j++)
2466 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2467 // check if this leaf contains any collision surfaces (q3 patches)
2468 for (j = 0;j < leaf->numleafsurfaces;j++)
2470 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2471 if (surface->num_collisiontriangles)
2473 leaf->containscollisionsurfaces = true;
2474 leaf->combinedsupercontents |= surface->texture->supercontents;
2480 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2486 in = (dnode_t *)(mod_base + l->fileofs);
2487 if (l->filelen % sizeof(*in))
2488 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2489 count = l->filelen / sizeof(*in);
2490 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2492 loadmodel->brush.data_nodes = out;
2493 loadmodel->brush.num_nodes = count;
2495 for ( i=0 ; i<count ; i++, in++, out++)
2497 for (j=0 ; j<3 ; j++)
2499 out->mins[j] = LittleShort(in->mins[j]);
2500 out->maxs[j] = LittleShort(in->maxs[j]);
2503 p = LittleLong(in->planenum);
2504 out->plane = loadmodel->brush.data_planes + p;
2506 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2507 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2509 for (j=0 ; j<2 ; j++)
2511 // LordHavoc: this code supports broken bsp files produced by
2512 // arguire qbsp which can produce more than 32768 nodes, any value
2513 // below count is assumed to be a node number, any other value is
2514 // assumed to be a leaf number
2515 p = (unsigned short)LittleShort(in->children[j]);
2518 if (p < loadmodel->brush.num_nodes)
2519 out->children[j] = loadmodel->brush.data_nodes + p;
2522 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2523 // map it to the solid leaf
2524 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2529 // note this uses 65535 intentionally, -1 is leaf 0
2531 if (p < loadmodel->brush.num_leafs)
2532 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2535 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2536 // map it to the solid leaf
2537 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2543 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2546 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2552 in = (dleaf_t *)(mod_base + l->fileofs);
2553 if (l->filelen % sizeof(*in))
2554 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2555 count = l->filelen / sizeof(*in);
2556 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2558 loadmodel->brush.data_leafs = out;
2559 loadmodel->brush.num_leafs = count;
2560 // get visleafs from the submodel data
2561 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2562 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2563 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2564 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2566 for ( i=0 ; i<count ; i++, in++, out++)
2568 for (j=0 ; j<3 ; j++)
2570 out->mins[j] = LittleShort(in->mins[j]);
2571 out->maxs[j] = LittleShort(in->maxs[j]);
2574 // FIXME: this function could really benefit from some error checking
2576 out->contents = LittleLong(in->contents);
2578 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2579 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2580 if (out->firstleafsurface < 0 || (unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2582 Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", (int)(out->firstleafsurface - loadmodel->brush.data_leafsurfaces), (int)(out->firstleafsurface + out->numleafsurfaces - loadmodel->brush.data_leafsurfaces), 0, loadmodel->brush.num_leafsurfaces);
2583 out->firstleafsurface = NULL;
2584 out->numleafsurfaces = 0;
2587 out->clusterindex = i - 1;
2588 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2589 out->clusterindex = -1;
2591 p = LittleLong(in->visofs);
2592 // ignore visofs errors on leaf 0 (solid)
2593 if (p >= 0 && out->clusterindex >= 0)
2595 if (p >= loadmodel->brushq1.num_compressedpvs)
2596 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2598 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);
2601 for (j = 0;j < 4;j++)
2602 out->ambient_sound_level[j] = in->ambient_level[j];
2604 // FIXME: Insert caustics here
2608 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2612 const unsigned char *pvs;
2613 // check all liquid leafs to see if they can see into empty leafs, if any
2614 // can we can assume this map supports r_wateralpha
2615 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2617 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && (leaf->clusterindex >= 0 && loadmodel->brush.data_pvsclusters))
2619 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2620 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2621 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2628 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2635 in = (dclipnode_t *)(mod_base + l->fileofs);
2636 if (l->filelen % sizeof(*in))
2637 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2638 count = l->filelen / sizeof(*in);
2639 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2641 loadmodel->brushq1.clipnodes = out;
2642 loadmodel->brushq1.numclipnodes = count;
2644 for (i = 1; i < hullinfo->numhulls; i++)
2646 hull = &loadmodel->brushq1.hulls[i];
2647 hull->clipnodes = out;
2648 hull->firstclipnode = 0;
2649 hull->lastclipnode = count-1;
2650 hull->planes = loadmodel->brush.data_planes;
2651 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2652 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2653 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2654 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2655 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2656 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2657 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2660 for (i=0 ; i<count ; i++, out++, in++)
2662 out->planenum = LittleLong(in->planenum);
2663 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2664 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2665 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2666 if (out->children[0] >= count)
2667 out->children[0] -= 65536;
2668 if (out->children[1] >= count)
2669 out->children[1] -= 65536;
2670 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2671 Host_Error("Corrupt clipping hull(out of range planenum)");
2675 //Duplicate the drawing hull structure as a clipping hull
2676 static void Mod_Q1BSP_MakeHull0(void)
2683 hull = &loadmodel->brushq1.hulls[0];
2685 in = loadmodel->brush.data_nodes;
2686 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2688 hull->clipnodes = out;
2689 hull->firstclipnode = 0;
2690 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2691 hull->planes = loadmodel->brush.data_planes;
2693 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2695 out->planenum = in->plane - loadmodel->brush.data_planes;
2696 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2697 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2701 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2706 in = (short *)(mod_base + l->fileofs);
2707 if (l->filelen % sizeof(*in))
2708 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2709 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2710 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2712 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2714 j = (unsigned short) LittleShort(in[i]);
2715 if (j >= loadmodel->num_surfaces)
2716 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2717 loadmodel->brush.data_leafsurfaces[i] = j;
2721 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2726 in = (int *)(mod_base + l->fileofs);
2727 if (l->filelen % sizeof(*in))
2728 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2729 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2730 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2732 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2733 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2737 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2743 in = (dplane_t *)(mod_base + l->fileofs);
2744 if (l->filelen % sizeof(*in))
2745 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2747 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2748 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2750 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2752 out->normal[0] = LittleFloat(in->normal[0]);
2753 out->normal[1] = LittleFloat(in->normal[1]);
2754 out->normal[2] = LittleFloat(in->normal[2]);
2755 out->dist = LittleFloat(in->dist);
2761 static void Mod_Q1BSP_LoadMapBrushes(void)
2765 int submodel, numbrushes;
2766 qboolean firstbrush;
2767 char *text, *maptext;
2768 char mapfilename[MAX_QPATH];
2769 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2770 strlcat (mapfilename, ".map", sizeof (mapfilename));
2771 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2775 if (!COM_ParseToken_Simple(&data, false, false))
2780 if (!COM_ParseToken_Simple(&data, false, false))
2782 if (com_token[0] != '{')
2788 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2791 if (!COM_ParseToken_Simple(&data, false, false))
2793 if (com_token[0] == '}')
2794 break; // end of entity
2795 if (com_token[0] == '{')
2802 if (submodel > loadmodel->brush.numsubmodels)
2804 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2808 model = loadmodel->brush.submodels[submodel];
2815 if (!COM_ParseToken_Simple(&data, false, false))
2817 if (com_token[0] == '}')
2818 break; // end of brush
2819 // each brush face should be this format:
2820 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2821 // FIXME: support hl .map format
2822 for (pointnum = 0;pointnum < 3;pointnum++)
2824 COM_ParseToken_Simple(&data, false, false);
2825 for (componentnum = 0;componentnum < 3;componentnum++)
2827 COM_ParseToken_Simple(&data, false, false);
2828 point[pointnum][componentnum] = atof(com_token);
2830 COM_ParseToken_Simple(&data, false, false);
2832 COM_ParseToken_Simple(&data, false, false);
2833 strlcpy(facetexture, com_token, sizeof(facetexture));
2834 COM_ParseToken_Simple(&data, false, false);
2835 //scroll_s = atof(com_token);
2836 COM_ParseToken_Simple(&data, false, false);
2837 //scroll_t = atof(com_token);
2838 COM_ParseToken_Simple(&data, false, false);
2839 //rotate = atof(com_token);
2840 COM_ParseToken_Simple(&data, false, false);
2841 //scale_s = atof(com_token);
2842 COM_ParseToken_Simple(&data, false, false);
2843 //scale_t = atof(com_token);
2844 TriangleNormal(point[0], point[1], point[2], planenormal);
2845 VectorNormalizeDouble(planenormal);
2846 planedist = DotProduct(point[0], planenormal);
2847 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2857 #define MAX_PORTALPOINTS 64
2859 typedef struct portal_s
2862 mnode_t *nodes[2]; // [0] = front side of plane
2863 struct portal_s *next[2];
2865 double points[3*MAX_PORTALPOINTS];
2866 struct portal_s *chain; // all portals are linked into a list
2870 static portal_t *portalchain;
2877 static portal_t *AllocPortal(void)
2880 p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2881 p->chain = portalchain;
2886 static void FreePortal(portal_t *p)
2891 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2893 // process only nodes (leafs already had their box calculated)
2897 // calculate children first
2898 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2899 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2901 // make combined bounding box from children
2902 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2903 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2904 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2905 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2906 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2907 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2910 static void Mod_Q1BSP_FinalizePortals(void)
2912 int i, j, numportals, numpoints;
2913 portal_t *p, *pnext;
2916 mleaf_t *leaf, *endleaf;
2918 // tally up portal and point counts and recalculate bounding boxes for all
2919 // leafs (because qbsp is very sloppy)
2920 leaf = loadmodel->brush.data_leafs;
2921 endleaf = leaf + loadmodel->brush.num_leafs;
2922 for (;leaf < endleaf;leaf++)
2924 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2925 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2932 // note: this check must match the one below or it will usually corrupt memory
2933 // 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
2934 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2937 numpoints += p->numpoints * 2;
2941 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2942 loadmodel->brush.num_portals = numportals;
2943 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2944 loadmodel->brush.num_portalpoints = numpoints;
2945 // clear all leaf portal chains
2946 for (i = 0;i < loadmodel->brush.num_leafs;i++)
2947 loadmodel->brush.data_leafs[i].portals = NULL;
2948 // process all portals in the global portal chain, while freeing them
2949 portal = loadmodel->brush.data_portals;
2950 point = loadmodel->brush.data_portalpoints;
2957 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2959 // note: this check must match the one above or it will usually corrupt memory
2960 // 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
2961 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2963 // first make the back to front portal(forward portal)
2964 portal->points = point;
2965 portal->numpoints = p->numpoints;
2966 portal->plane.dist = p->plane.dist;
2967 VectorCopy(p->plane.normal, portal->plane.normal);
2968 portal->here = (mleaf_t *)p->nodes[1];
2969 portal->past = (mleaf_t *)p->nodes[0];
2971 for (j = 0;j < portal->numpoints;j++)
2973 VectorCopy(p->points + j*3, point->position);
2976 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2977 PlaneClassify(&portal->plane);
2979 // link into leaf's portal chain
2980 portal->next = portal->here->portals;
2981 portal->here->portals = portal;
2983 // advance to next portal
2986 // then make the front to back portal(backward portal)
2987 portal->points = point;
2988 portal->numpoints = p->numpoints;
2989 portal->plane.dist = -p->plane.dist;
2990 VectorNegate(p->plane.normal, portal->plane.normal);
2991 portal->here = (mleaf_t *)p->nodes[0];
2992 portal->past = (mleaf_t *)p->nodes[1];
2994 for (j = portal->numpoints - 1;j >= 0;j--)
2996 VectorCopy(p->points + j*3, point->position);
2999 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3000 PlaneClassify(&portal->plane);
3002 // link into leaf's portal chain
3003 portal->next = portal->here->portals;
3004 portal->here->portals = portal;
3006 // advance to next portal
3009 // add the portal's polygon points to the leaf bounding boxes
3010 for (i = 0;i < 2;i++)
3012 leaf = (mleaf_t *)p->nodes[i];
3013 for (j = 0;j < p->numpoints;j++)
3015 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3016 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3017 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3018 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3019 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3020 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3027 // now recalculate the node bounding boxes from the leafs
3028 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
3036 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3039 Host_Error("AddPortalToNodes: NULL front node");
3041 Host_Error("AddPortalToNodes: NULL back node");
3042 if (p->nodes[0] || p->nodes[1])
3043 Host_Error("AddPortalToNodes: already included");
3044 // 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
3046 p->nodes[0] = front;
3047 p->next[0] = (portal_t *)front->portals;
3048 front->portals = (mportal_t *)p;
3051 p->next[1] = (portal_t *)back->portals;
3052 back->portals = (mportal_t *)p;
3057 RemovePortalFromNode
3060 static void RemovePortalFromNodes(portal_t *portal)
3064 void **portalpointer;
3066 for (i = 0;i < 2;i++)
3068 node = portal->nodes[i];
3070 portalpointer = (void **) &node->portals;
3073 t = (portal_t *)*portalpointer;
3075 Host_Error("RemovePortalFromNodes: portal not in leaf");
3079 if (portal->nodes[0] == node)
3081 *portalpointer = portal->next[0];
3082 portal->nodes[0] = NULL;
3084 else if (portal->nodes[1] == node)
3086 *portalpointer = portal->next[1];
3087 portal->nodes[1] = NULL;
3090 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3094 if (t->nodes[0] == node)
3095 portalpointer = (void **) &t->next[0];
3096 else if (t->nodes[1] == node)
3097 portalpointer = (void **) &t->next[1];
3099 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3104 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3105 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3108 mnode_t *front, *back, *other_node;
3109 mplane_t clipplane, *plane;
3110 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3111 int numfrontpoints, numbackpoints;
3112 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3114 // if a leaf, we're done
3118 plane = node->plane;
3120 front = node->children[0];
3121 back = node->children[1];
3123 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3125 // create the new portal by generating a polygon for the node plane,
3126 // and clipping it by all of the other portals(which came from nodes above this one)
3127 nodeportal = AllocPortal();
3128 nodeportal->plane = *plane;
3130 // TODO: calculate node bounding boxes during recursion and calculate a maximum plane size accordingly to improve precision (as most maps do not need 1 billion unit plane polygons)
3131 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);
3132 nodeportal->numpoints = 4;
3133 side = 0; // shut up compiler warning
3134 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3136 clipplane = portal->plane;
3137 if (portal->nodes[0] == portal->nodes[1])
3138 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3139 if (portal->nodes[0] == node)
3141 else if (portal->nodes[1] == node)
3143 clipplane.dist = -clipplane.dist;
3144 VectorNegate(clipplane.normal, clipplane.normal);
3148 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3150 for (i = 0;i < nodeportal->numpoints*3;i++)
3151 frontpoints[i] = nodeportal->points[i];
3152 PolygonD_Divide(nodeportal->numpoints, frontpoints, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, nodeportal->points, &nodeportal->numpoints, 0, NULL, NULL, NULL);
3153 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3157 if (nodeportal->numpoints < 3)
3159 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3160 nodeportal->numpoints = 0;
3162 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3164 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3165 nodeportal->numpoints = 0;
3168 AddPortalToNodes(nodeportal, front, back);
3170 // split the portals of this node along this node's plane and assign them to the children of this node
3171 // (migrating the portals downward through the tree)
3172 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3174 if (portal->nodes[0] == portal->nodes[1])
3175 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3176 if (portal->nodes[0] == node)
3178 else if (portal->nodes[1] == node)
3181 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3182 nextportal = portal->next[side];
3183 if (!portal->numpoints)
3186 other_node = portal->nodes[!side];
3187 RemovePortalFromNodes(portal);
3189 // cut the portal into two portals, one on each side of the node plane
3190 PolygonD_Divide(portal->numpoints, portal->points, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, frontpoints, &numfrontpoints, MAX_PORTALPOINTS, backpoints, &numbackpoints, NULL);
3192 if (!numfrontpoints)
3195 AddPortalToNodes(portal, back, other_node);
3197 AddPortalToNodes(portal, other_node, back);
3203 AddPortalToNodes(portal, front, other_node);
3205 AddPortalToNodes(portal, other_node, front);
3209 // the portal is split
3210 splitportal = AllocPortal();
3211 temp = splitportal->chain;
3212 *splitportal = *portal;
3213 splitportal->chain = temp;
3214 for (i = 0;i < numbackpoints*3;i++)
3215 splitportal->points[i] = backpoints[i];
3216 splitportal->numpoints = numbackpoints;
3217 for (i = 0;i < numfrontpoints*3;i++)
3218 portal->points[i] = frontpoints[i];
3219 portal->numpoints = numfrontpoints;
3223 AddPortalToNodes(portal, front, other_node);
3224 AddPortalToNodes(splitportal, back, other_node);
3228 AddPortalToNodes(portal, other_node, front);
3229 AddPortalToNodes(splitportal, other_node, back);
3233 Mod_Q1BSP_RecursiveNodePortals(front);
3234 Mod_Q1BSP_RecursiveNodePortals(back);
3237 static void Mod_Q1BSP_MakePortals(void)
3240 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3241 Mod_Q1BSP_FinalizePortals();
3244 //Returns PVS data for a given point
3245 //(note: can return NULL)
3246 static unsigned char *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
3249 node = model->brush.data_nodes;
3251 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3252 if (((mleaf_t *)node)->clusterindex >= 0)
3253 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3258 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbytes, mnode_t *node)
3262 float d = PlaneDiff(org, node->plane);
3264 node = node->children[0];
3265 else if (d < -radius)
3266 node = node->children[1];
3269 // go down both sides
3270 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3271 node = node->children[1];
3274 // if this leaf is in a cluster, accumulate the pvs bits
3275 if (((mleaf_t *)node)->clusterindex >= 0)
3278 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3279 for (i = 0;i < pvsbytes;i++)
3280 pvsbuffer[i] |= pvs[i];
3284 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3285 //of the given point.
3286 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3288 int bytes = model->brush.num_pvsclusterbytes;
3289 bytes = min(bytes, pvsbufferlength);
3290 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3292 memset(pvsbuffer, 0xFF, bytes);
3296 memset(pvsbuffer, 0, bytes);
3297 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3301 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3306 VectorSubtract(inmaxs, inmins, size);
3307 if (cmodel->brush.ismcbsp)
3310 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3311 else if (size[2] < 48) // pick the nearest of 40 or 56
3312 hull = &cmodel->brushq1.hulls[2]; // 16x16x40
3314 hull = &cmodel->brushq1.hulls[1]; // 16x16x56
3316 else if (cmodel->brush.ishlbsp)
3319 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3320 else if (size[0] <= 32)
3322 if (size[2] < 54) // pick the nearest of 36 or 72
3323 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3325 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3328 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3333 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3334 else if (size[0] <= 32)
3335 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3337 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3339 VectorCopy(inmins, outmins);
3340 VectorAdd(inmins, hull->clip_size, outmaxs);
3343 void Mod_Q1BSP_Load(model_t *mod, void *buffer, void *bufferend)
3348 mempool_t *mainmempool;
3349 float dist, modelyawradius, modelradius, *vec;
3350 msurface_t *surface;
3351 int numshadowmeshtriangles;
3353 hullinfo_t hullinfo;
3354 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3355 model_brush_lightstyleinfo_t styleinfo[256];
3356 unsigned char *datapointer;
3358 mod->modeldatatypestring = "Q1BSP";
3360 mod->type = mod_brushq1;
3362 if (!memcmp (buffer, "MCBSPpad", 8))
3364 unsigned char *index;
3366 mod->brush.ismcbsp = true;
3367 mod->brush.ishlbsp = false;
3369 mod_base = (unsigned char*)buffer;
3373 i = SB_ReadInt (&index);
3374 if (i != MCBSPVERSION)
3375 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i)", mod->name, i, MCBSPVERSION);
3378 hullinfo.numhulls = SB_ReadInt (&index);
3379 hullinfo.filehulls = hullinfo.numhulls;
3380 mod->brushq1.numhulls = hullinfo.numhulls;
3382 VectorClear (hullinfo.hullsizes[0][0]);
3383 VectorClear (hullinfo.hullsizes[0][1]);
3384 for (i = 1; i < hullinfo.numhulls; i++)
3386 hullinfo.hullsizes[i][0][0] = SB_ReadFloat (&index);
3387 hullinfo.hullsizes[i][0][1] = SB_ReadFloat (&index);
3388 hullinfo.hullsizes[i][0][2] = SB_ReadFloat (&index);
3389 hullinfo.hullsizes[i][1][0] = SB_ReadFloat (&index);
3390 hullinfo.hullsizes[i][1][1] = SB_ReadFloat (&index);
3391 hullinfo.hullsizes[i][1][2] = SB_ReadFloat (&index);
3395 _header.version = 0;
3396 for (i = 0; i < HEADER_LUMPS; i++)
3398 _header.lumps[i].fileofs = SB_ReadInt (&index);
3399 _header.lumps[i].filelen = SB_ReadInt (&index);
3406 header = (dheader_t *)buffer;
3408 i = LittleLong(header->version);
3409 if (i != BSPVERSION && i != 30)
3410 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3411 mod->brush.ishlbsp = i == 30;
3412 mod->brush.ismcbsp = false;
3414 // fill in hull info
3415 VectorClear (hullinfo.hullsizes[0][0]);
3416 VectorClear (hullinfo.hullsizes[0][1]);
3417 if (mod->brush.ishlbsp)
3419 mod->modeldatatypestring = "HLBSP";
3421 hullinfo.numhulls = 4;
3422 hullinfo.filehulls = 4;
3423 mod->brushq1.numhulls = 4;
3424 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3425 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3426 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3427 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3428 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3429 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3433 hullinfo.numhulls = 3;
3434 hullinfo.filehulls = 4;
3435 mod->brushq1.numhulls = 3;
3436 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3437 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3438 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3439 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3443 mod_base = (unsigned char*)buffer;
3444 for (i = 0; i < HEADER_LUMPS; i++)
3446 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3447 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3451 mod->soundfromcenter = true;
3452 mod->TraceBox = Mod_Q1BSP_TraceBox;
3453 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3454 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3455 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3456 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3457 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3458 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3459 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3460 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3461 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3462 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3463 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3464 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3465 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3466 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3468 if (loadmodel->isworldmodel)
3470 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3471 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3476 mod->brush.qw_md4sum = 0;
3477 mod->brush.qw_md4sum2 = 0;
3478 for (i = 0;i < HEADER_LUMPS;i++)
3480 if (i == LUMP_ENTITIES)
3482 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3483 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3485 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3488 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3489 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3490 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3491 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3492 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3493 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3494 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3495 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3496 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3497 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3498 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3499 // load submodels before leafs because they contain the number of vis leafs
3500 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3501 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3502 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3503 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3505 // check if the map supports transparent water rendering
3506 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3508 if (mod->brushq1.data_compressedpvs)
3509 Mem_Free(mod->brushq1.data_compressedpvs);
3510 mod->brushq1.data_compressedpvs = NULL;
3511 mod->brushq1.num_compressedpvs = 0;
3513 Mod_Q1BSP_MakeHull0();
3514 Mod_Q1BSP_MakePortals();
3516 mod->numframes = 2; // regular and alternate animation
3519 mainmempool = mod->mempool;
3521 // make a single combined shadow mesh to allow optimized shadow volume creation
3522 numshadowmeshtriangles = 0;
3523 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3525 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3526 numshadowmeshtriangles += surface->num_triangles;
3528 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3529 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3530 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, loadmodel->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
3531 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3532 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3534 if (loadmodel->brush.numsubmodels)
3535 loadmodel->brush.submodels = (model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(model_t *));
3537 if (loadmodel->isworldmodel)
3539 // clear out any stale submodels or worldmodels lying around
3540 // if we did this clear before now, an error might abort loading and
3541 // leave things in a bad state
3542 Mod_RemoveStaleWorldModels(loadmodel);
3545 // LordHavoc: to clear the fog around the original quake submodel code, I
3547 // first of all, some background info on the submodels:
3548 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3549 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3550 // now the weird for loop itself:
3551 // the loop functions in an odd way, on each iteration it sets up the
3552 // current 'mod' model (which despite the confusing code IS the model of
3553 // the number i), at the end of the loop it duplicates the model to become
3554 // the next submodel, and loops back to set up the new submodel.
3556 // LordHavoc: now the explanation of my sane way (which works identically):
3557 // set up the world model, then on each submodel copy from the world model
3558 // and set up the submodel with the respective model info.
3559 totalstylesurfaces = 0;
3561 for (i = 0;i < mod->brush.numsubmodels;i++)
3563 memset(stylecounts, 0, sizeof(stylecounts));
3564 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3566 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3567 for (j = 0;j < MAXLIGHTMAPS;j++)
3568 stylecounts[surface->lightmapinfo->styles[j]]++;
3570 for (k = 0;k < 255;k++)
3574 totalstylesurfaces += stylecounts[k];
3577 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3578 for (i = 0;i < mod->brush.numsubmodels;i++)
3580 // LordHavoc: this code was originally at the end of this loop, but
3581 // has been transformed to something more readable at the start here.
3586 // LordHavoc: only register submodels if it is the world
3587 // (prevents external bsp models from replacing world submodels with
3589 if (!loadmodel->isworldmodel)
3591 // duplicate the basic information
3592 sprintf(name, "*%i", i);
3593 mod = Mod_FindName(name);
3594 // copy the base model to this one
3596 // rename the clone back to its proper name
3597 strlcpy(mod->name, name, sizeof(mod->name));
3598 // textures and memory belong to the main model
3599 mod->texturepool = NULL;
3600 mod->mempool = NULL;
3603 mod->brush.submodel = i;
3605 if (loadmodel->brush.submodels)
3606 loadmodel->brush.submodels[i] = mod;
3608 bm = &mod->brushq1.submodels[i];
3610 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3611 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3613 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3614 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3617 mod->firstmodelsurface = bm->firstface;
3618 mod->nummodelsurfaces = bm->numfaces;
3620 // make the model surface list (used by shadowing/lighting)
3621 mod->surfacelist = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3622 for (j = 0;j < mod->nummodelsurfaces;j++)
3623 mod->surfacelist[j] = mod->firstmodelsurface + j;
3625 // this gets altered below if sky or water is used
3626 mod->DrawSky = NULL;
3627 mod->DrawAddWaterPlanes = NULL;
3628 mod->Draw = R_Q1BSP_Draw;
3629 mod->DrawDepth = R_Q1BSP_DrawDepth;
3630 mod->DrawDebug = R_Q1BSP_DrawDebug;
3631 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3632 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3633 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3634 mod->DrawLight = R_Q1BSP_DrawLight;
3637 mod->brush.TraceLineOfSight = NULL;
3638 mod->brush.GetPVS = NULL;
3639 mod->brush.FatPVS = NULL;
3640 mod->brush.BoxTouchingPVS = NULL;
3641 mod->brush.BoxTouchingLeafPVS = NULL;
3642 mod->brush.BoxTouchingVisibleLeafs = NULL;
3643 mod->brush.FindBoxClusters = NULL;
3644 mod->brush.LightPoint = NULL;
3645 mod->brush.AmbientSoundLevelsForPoint = NULL;
3647 if (mod->nummodelsurfaces)
3649 // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3650 mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3651 mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3654 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3656 // we only need to have a drawsky function if it is used(usually only on world model)
3657 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3658 mod->DrawSky = R_Q1BSP_DrawSky;
3659 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3660 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3661 // calculate bounding shapes
3662 for (k = 0, vec = (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex);k < surface->num_vertices;k++, vec += 3)
3664 if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3665 if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3666 if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3667 if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3668 if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3669 if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3670 dist = vec[0]*vec[0]+vec[1]*vec[1];
3671 if (modelyawradius < dist)
3672 modelyawradius = dist;
3673 dist += vec[2]*vec[2];
3674 if (modelradius < dist)
3678 modelyawradius = sqrt(modelyawradius);
3679 modelradius = sqrt(modelradius);
3680 mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3681 mod->yawmins[2] = mod->normalmins[2];
3682 mod->yawmaxs[2] = mod->normalmaxs[2];
3683 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3684 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3685 mod->radius = modelradius;
3686 mod->radius2 = modelradius * modelradius;
3688 // build lightstyle update chains
3689 // (used to rapidly mark surface->cached_dlight on many surfaces
3690 // when d_lightstylevalue changes)
3691 memset(stylecounts, 0, sizeof(stylecounts));
3692 for (k = 0;k < mod->nummodelsurfaces;k++)
3694 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3695 for (j = 0;j < MAXLIGHTMAPS;j++)
3696 stylecounts[surface->lightmapinfo->styles[j]]++;
3698 mod->brushq1.num_lightstyles = 0;
3699 for (k = 0;k < 255;k++)
3703 styleinfo[mod->brushq1.num_lightstyles].style = k;
3704 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3705 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3706 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3707 remapstyles[k] = mod->brushq1.num_lightstyles;
3708 mod->brushq1.num_lightstyles++;
3711 for (k = 0;k < mod->nummodelsurfaces;k++)
3713 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3714 for (j = 0;j < MAXLIGHTMAPS;j++)
3716 if (surface->lightmapinfo->styles[j] != 255)
3718 int r = remapstyles[surface->lightmapinfo->styles[j]];
3719 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3723 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3724 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3728 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3729 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3731 //mod->brushq1.num_visleafs = bm->visleafs;
3734 Mod_Q1BSP_LoadMapBrushes();
3736 //Mod_Q1BSP_ProcessLightList();
3738 if (developer.integer >= 10)
3739 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);
3742 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3746 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3753 in = (void *)(mod_base + l->fileofs);
3754 if (l->filelen % sizeof(*in))
3755 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3756 count = l->filelen / sizeof(*in);
3757 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3760 loadmodel->num = count;
3762 for (i = 0;i < count;i++, in++, out++)
3768 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3775 in = (void *)(mod_base + l->fileofs);
3776 if (l->filelen % sizeof(*in))
3777 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3778 count = l->filelen / sizeof(*in);
3779 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3782 loadmodel->num = count;
3784 for (i = 0;i < count;i++, in++, out++)
3790 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3797 in = (void *)(mod_base + l->fileofs);
3798 if (l->filelen % sizeof(*in))
3799 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3800 count = l->filelen / sizeof(*in);
3801 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3804 loadmodel->num = count;
3806 for (i = 0;i < count;i++, in++, out++)
3812 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3819 in = (void *)(mod_base + l->fileofs);
3820 if (l->filelen % sizeof(*in))
3821 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3822 count = l->filelen / sizeof(*in);
3823 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3826 loadmodel->num = count;
3828 for (i = 0;i < count;i++, in++, out++)
3834 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3841 in = (void *)(mod_base + l->fileofs);
3842 if (l->filelen % sizeof(*in))
3843 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3844 count = l->filelen / sizeof(*in);
3845 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3848 loadmodel->num = count;
3850 for (i = 0;i < count;i++, in++, out++)
3856 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3863 in = (void *)(mod_base + l->fileofs);
3864 if (l->filelen % sizeof(*in))
3865 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3866 count = l->filelen / sizeof(*in);
3867 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3870 loadmodel->num = count;
3872 for (i = 0;i < count;i++, in++, out++)
3878 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3885 in = (void *)(mod_base + l->fileofs);
3886 if (l->filelen % sizeof(*in))
3887 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3888 count = l->filelen / sizeof(*in);
3889 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3892 loadmodel->num = count;
3894 for (i = 0;i < count;i++, in++, out++)
3900 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3907 in = (void *)(mod_base + l->fileofs);
3908 if (l->filelen % sizeof(*in))
3909 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3910 count = l->filelen / sizeof(*in);
3911 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3914 loadmodel->num = count;
3916 for (i = 0;i < count;i++, in++, out++)
3922 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3929 in = (void *)(mod_base + l->fileofs);
3930 if (l->filelen % sizeof(*in))
3931 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3932 count = l->filelen / sizeof(*in);
3933 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3936 loadmodel->num = count;
3938 for (i = 0;i < count;i++, in++, out++)
3944 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3951 in = (void *)(mod_base + l->fileofs);
3952 if (l->filelen % sizeof(*in))
3953 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3954 count = l->filelen / sizeof(*in);
3955 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3958 loadmodel->num = count;
3960 for (i = 0;i < count;i++, in++, out++)
3966 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3973 in = (void *)(mod_base + l->fileofs);
3974 if (l->filelen % sizeof(*in))
3975 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3976 count = l->filelen / sizeof(*in);
3977 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3980 loadmodel->num = count;
3982 for (i = 0;i < count;i++, in++, out++)
3988 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3995 in = (void *)(mod_base + l->fileofs);
3996 if (l->filelen % sizeof(*in))
3997 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3998 count = l->filelen / sizeof(*in);
3999 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4002 loadmodel->num = count;
4004 for (i = 0;i < count;i++, in++, out++)
4010 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4017 in = (void *)(mod_base + l->fileofs);
4018 if (l->filelen % sizeof(*in))
4019 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4020 count = l->filelen / sizeof(*in);
4021 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4024 loadmodel->num = count;
4026 for (i = 0;i < count;i++, in++, out++)
4032 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4039 in = (void *)(mod_base + l->fileofs);
4040 if (l->filelen % sizeof(*in))
4041 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4042 count = l->filelen / sizeof(*in);
4043 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4046 loadmodel->num = count;
4048 for (i = 0;i < count;i++, in++, out++)
4054 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4061 in = (void *)(mod_base + l->fileofs);
4062 if (l->filelen % sizeof(*in))
4063 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4064 count = l->filelen / sizeof(*in);
4065 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4068 loadmodel->num = count;
4070 for (i = 0;i < count;i++, in++, out++)
4076 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4083 in = (void *)(mod_base + l->fileofs);
4084 if (l->filelen % sizeof(*in))
4085 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4086 count = l->filelen / sizeof(*in);
4087 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4090 loadmodel->num = count;
4092 for (i = 0;i < count;i++, in++, out++)
4098 static void Mod_Q2BSP_LoadModels(lump_t *l)
4105 in = (void *)(mod_base + l->fileofs);
4106 if (l->filelen % sizeof(*in))
4107 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4108 count = l->filelen / sizeof(*in);
4109 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4112 loadmodel->num = count;
4114 for (i = 0;i < count;i++, in++, out++)
4120 void static Mod_Q2BSP_Load(model_t *mod, void *buffer, void *bufferend)
4123 q2dheader_t *header;
4125 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4127 mod->modeldatatypestring = "Q2BSP";
4129 mod->type = mod_brushq2;
4131 header = (q2dheader_t *)buffer;
4133 i = LittleLong(header->version);
4134 if (i != Q2BSPVERSION)
4135 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4136 mod->brush.ishlbsp = false;
4137 mod->brush.ismcbsp = false;
4138 if (loadmodel->isworldmodel)
4140 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
4141 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
4144 mod_base = (unsigned char *)header;
4146 // swap all the lumps
4147 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4148 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4150 mod->brush.qw_md4sum = 0;
4151 mod->brush.qw_md4sum2 = 0;
4152 for (i = 0;i < Q2HEADER_LUMPS;i++)
4154 if (i == Q2LUMP_ENTITIES)
4156 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4157 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4159 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4162 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4163 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4164 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4165 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4166 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4167 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4168 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4169 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4170 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4171 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4172 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4173 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4174 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4175 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4176 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4177 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4178 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4179 // LordHavoc: must go last because this makes the submodels
4180 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4183 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents);
4184 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents);
4186 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4189 char key[128], value[MAX_INPUTLINE];
4191 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4192 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4193 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4196 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
4197 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4198 data = loadmodel->brush.entities;
4199 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4200 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4204 if (!COM_ParseToken_Simple(&data, false, false))
4206 if (com_token[0] == '}')
4207 break; // end of worldspawn
4208 if (com_token[0] == '_')
4209 strlcpy(key, com_token + 1, sizeof(key));
4211 strlcpy(key, com_token, sizeof(key));
4212 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4213 key[strlen(key)-1] = 0;
4214 if (!COM_ParseToken_Simple(&data, false, false))
4216 strlcpy(value, com_token, sizeof(value));
4217 if (!strcmp("gridsize", key))
4219 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4220 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4226 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4232 in = (q3dtexture_t *)(mod_base + l->fileofs);
4233 if (l->filelen % sizeof(*in))
4234 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4235 count = l->filelen / sizeof(*in);
4236 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4238 loadmodel->data_textures = out;
4239 loadmodel->num_textures = count;
4240 loadmodel->num_texturesperskin = loadmodel->num_textures;
4242 for (i = 0;i < count;i++)
4244 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4245 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4246 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4249 if (cls.state == ca_dedicated)
4253 for (i = 0;i < count;i++, in++, out++)
4254 if (!Mod_LoadTextureFromQ3Shader(out, out->name, false, true, false))
4257 Con_DPrintf("%s: %i textures missing shaders\n", loadmodel->name, c);
4260 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4266 in = (q3dplane_t *)(mod_base + l->fileofs);
4267 if (l->filelen % sizeof(*in))
4268 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4269 count = l->filelen / sizeof(*in);
4270 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4272 loadmodel->brush.data_planes = out;
4273 loadmodel->brush.num_planes = count;
4275 for (i = 0;i < count;i++, in++, out++)
4277 out->normal[0] = LittleFloat(in->normal[0]);
4278 out->normal[1] = LittleFloat(in->normal[1]);
4279 out->normal[2] = LittleFloat(in->normal[2]);
4280 out->dist = LittleFloat(in->dist);
4285 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4288 q3mbrushside_t *out;
4291 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4292 if (l->filelen % sizeof(*in))
4293 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4294 count = l->filelen / sizeof(*in);
4295 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4297 loadmodel->brush.data_brushsides = out;
4298 loadmodel->brush.num_brushsides = count;
4300 for (i = 0;i < count;i++, in++, out++)
4302 n = LittleLong(in->planeindex);
4303 if (n < 0 || n >= loadmodel->brush.num_planes)
4304 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4305 out->plane = loadmodel->brush.data_planes + n;
4306 n = LittleLong(in->textureindex);
4307 if (n < 0 || n >= loadmodel->num_textures)
4308 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4309 out->texture = loadmodel->data_textures + n;
4313 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4317 int i, j, n, c, count, maxplanes;
4318 colplanef_t *planes;
4320 in = (q3dbrush_t *)(mod_base + l->fileofs);
4321 if (l->filelen % sizeof(*in))
4322 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4323 count = l->filelen / sizeof(*in);
4324 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4326 loadmodel->brush.data_brushes = out;
4327 loadmodel->brush.num_brushes = count;
4332 for (i = 0;i < count;i++, in++, out++)
4334 n = LittleLong(in->firstbrushside);
4335 c = LittleLong(in->numbrushsides);
4336 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4337 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4338 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4339 out->numbrushsides = c;
4340 n = LittleLong(in->textureindex);
4341 if (n < 0 || n >= loadmodel->num_textures)
4342 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4343 out->texture = loadmodel->data_textures + n;
4345 // make a list of mplane_t structs to construct a colbrush from
4346 if (maxplanes < out->numbrushsides)
4348 maxplanes = out->numbrushsides;
4351 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4353 for (j = 0;j < out->numbrushsides;j++)
4355 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4356 planes[j].dist = out->firstbrushside[j].plane->dist;
4357 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4358 planes[j].texture = out->firstbrushside[j].texture;
4360 // make the colbrush from the planes
4361 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4367 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4373 in = (q3deffect_t *)(mod_base + l->fileofs);
4374 if (l->filelen % sizeof(*in))
4375 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4376 count = l->filelen / sizeof(*in);
4377 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4379 loadmodel->brushq3.data_effects = out;
4380 loadmodel->brushq3.num_effects = count;
4382 for (i = 0;i < count;i++, in++, out++)
4384 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4385 n = LittleLong(in->brushindex);
4386 if (n >= loadmodel->brush.num_brushes)
4388 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4391 out->brushindex = n;
4392 out->unknown = LittleLong(in->unknown);
4396 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4401 in = (q3dvertex_t *)(mod_base + l->fileofs);
4402 if (l->filelen % sizeof(*in))
4403 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4404 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4405 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4406 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4407 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4408 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4409 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4411 for (i = 0;i < count;i++, in++)
4413 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4414 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4415 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4416 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4417 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4418 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4419 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4420 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4421 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4422 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4423 // svector/tvector are calculated later in face loading
4424 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4425 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4426 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4427 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4431 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4437 in = (int *)(mod_base + l->fileofs);
4438 if (l->filelen % sizeof(int[3]))
4439 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4440 count = l->filelen / sizeof(*in);
4441 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4443 loadmodel->brushq3.num_triangles = count / 3;
4444 loadmodel->brushq3.data_element3i = out;
4446 for (i = 0;i < count;i++, in++, out++)
4448 *out = LittleLong(*in);
4449 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4451 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4457 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4460 int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4462 unsigned char convertedpixels[128*128*4];
4466 if (cls.state == ca_dedicated)
4468 in = (q3dlightmap_t *)(mod_base + l->fileofs);
4469 if (l->filelen % sizeof(*in))
4470 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4471 count = l->filelen / sizeof(*in);
4472 loadmodel->brushq3.num_originallightmaps = count;
4474 // now check the surfaces to see if any of them index an odd numbered
4475 // lightmap, if so this is not a deluxemapped bsp file
4477 // also check what lightmaps are actually used, because q3map2 sometimes
4478 // (always?) makes an unused one at the end, which
4479 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4480 // reason when only one lightmap is used, which can throw off the
4481 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4482 // to see if the second lightmap is blank, if so it is not deluxemapped.
4483 loadmodel->brushq3.deluxemapping = !(count & 1);
4484 loadmodel->brushq3.deluxemapping_modelspace = true;
4486 if (loadmodel->brushq3.deluxemapping)
4488 int facecount = faceslump->filelen / sizeof(q3dface_t);
4489 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4490 for (i = 0;i < facecount;i++)
4492 j = LittleLong(faces[i].lightmapindex);
4495 endlightmap = max(endlightmap, j + 1);
4496 if ((j & 1) || j + 1 >= count)
4498 loadmodel->brushq3.deluxemapping = false;
4504 if (endlightmap < 2)
4505 loadmodel->brushq3.deluxemapping = false;
4507 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4508 // reason when only one lightmap is used, which can throw off the
4509 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4510 // to see if the second lightmap is blank, if so it is not deluxemapped.
4511 if (endlightmap == 1 && count == 2)
4514 for (i = 0;i < 128*128*3;i++)
4519 // all pixels in the unused lightmap were black...
4520 loadmodel->brushq3.deluxemapping = false;
4524 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4526 // figure out what the most reasonable merge power is within limits
4527 loadmodel->brushq3.num_lightmapmergepower = 0;
4528 for (power = 1;power <= mod_q3bsp_lightmapmergepower.integer && (128 << power) <= gl_max_texture_size && (1 << (power * 2)) < 4 * (count >> loadmodel->brushq3.deluxemapping);power++)
4529 loadmodel->brushq3.num_lightmapmergepower = power;
4530 loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4532 loadmodel->brushq3.num_mergedlightmaps = ((count >> loadmodel->brushq3.deluxemapping) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4533 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4534 if (loadmodel->brushq3.deluxemapping)
4535 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4537 // allocate a texture pool if we need it
4538 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4539 loadmodel->texturepool = R_AllocTexturePool();
4541 power = loadmodel->brushq3.num_lightmapmergepower;
4543 mask = (1 << power) - 1;
4544 for (i = 0;i < count;i++)
4546 // figure out which merged lightmap texture this fits into
4547 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4548 for (k = 0;k < 128*128;k++)
4550 convertedpixels[k*4+2] = in[i].rgb[k*3+0];
4551 convertedpixels[k*4+1] = in[i].rgb[k*3+1];
4552 convertedpixels[k*4+0] = in[i].rgb[k*3+2];
4553 convertedpixels[k*4+3] = 255;
4555 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4557 // if the lightmap has not been allocated yet, create it
4558 if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4560 // create a lightmap only as large as necessary to hold the
4561 // remaining 128x128 blocks
4562 // if there are multiple merged lightmap textures then they will
4563 // all be full size except the last one which may be smaller
4564 // because it only needs to the remaining blocks, and it will often
4565 // be odd sizes like 2048x512 due to only being 25% full or so.
4566 j = (count >> loadmodel->brushq3.deluxemapping) - (lightmapindex << power2);
4567 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4569 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4571 Con_DPrintf("lightmap merge texture #%i is %ix%i (%i of %i used)\n", lightmapindex, mergewidth*128, mergeheight*128, min(j, mergewidth*mergeheight), mergewidth*mergeheight);
4572 loadmodel->brushq3.data_lightmaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), mergewidth * 128, mergeheight * 128, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), NULL);
4573 if (loadmodel->brushq3.data_deluxemaps)
4574 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), mergewidth * 128, mergeheight * 128, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), NULL);
4576 mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / 128;
4577 mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / 128;
4578 j = (i >> loadmodel->brushq3.deluxemapping) & ((1 << power2) - 1);
4579 if (loadmodel->brushq3.deluxemapping && (i & 1))
4580 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * 128, (j / mergewidth) * 128, 128, 128);
4582 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * 128, (j / mergewidth) * 128, 128, 128);
4586 // figure out which merged lightmap texture this fits into
4587 if (loadmodel->brushq3.deluxemapping && (i & 1))
4588 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), 128, 128, convertedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), NULL);
4590 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), 128, 128, convertedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), NULL);
4595 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4597 q3dface_t *in, *oldin;
4598 msurface_t *out, *oldout;
4599 int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, numvertices, numtriangles;
4600 float lightmaptcbase[2], lightmaptcscale[2];
4601 //int *originalelement3i;
4602 //int *originalneighbor3i;
4603 float *originalvertex3f;
4604 //float *originalsvector3f;
4605 //float *originaltvector3f;
4606 float *originalnormal3f;
4607 float *originalcolor4f;
4608 float *originaltexcoordtexture2f;
4609 float *originaltexcoordlightmap2f;
4612 in = (q3dface_t *)(mod_base + l->fileofs);
4613 if (l->filelen % sizeof(*in))
4614 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4615 count = l->filelen / sizeof(*in);
4616 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4618 loadmodel->data_surfaces = out;
4619 loadmodel->num_surfaces = count;
4627 for (;i < count;i++, in++, out++)
4629 // check face type first
4630 type = LittleLong(in->type);
4631 if (type != Q3FACETYPE_POLYGON
4632 && type != Q3FACETYPE_PATCH
4633 && type != Q3FACETYPE_MESH
4634 && type != Q3FACETYPE_FLARE)
4636 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4640 n = LittleLong(in->textureindex);
4641 if (n < 0 || n >= loadmodel->num_textures)
4643 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4646 out->texture = loadmodel->data_textures + n;
4647 n = LittleLong(in->effectindex);
4648 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4650 if (developer.integer >= 100)
4651 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4657 out->effect = loadmodel->brushq3.data_effects + n;
4659 if (cls.state != ca_dedicated)
4661 out->lightmaptexture = NULL;
4662 out->deluxemaptexture = r_texture_blanknormalmap;
4663 n = LittleLong(in->lightmapindex);
4666 else if (n >= loadmodel->brushq3.num_originallightmaps)
4668 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4673 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4674 if (loadmodel->brushq3.deluxemapping)
4675 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4679 firstvertex = LittleLong(in->firstvertex);
4680 numvertices = LittleLong(in->numvertices);
4681 firstelement = LittleLong(in->firstelement);
4682 numtriangles = LittleLong(in->numelements) / 3;
4683 if (numtriangles * 3 != LittleLong(in->numelements))
4685 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));
4688 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4690 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);
4693 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4695 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);
4700 case Q3FACETYPE_POLYGON:
4701 case Q3FACETYPE_MESH:
4702 // no processing necessary
4704 case Q3FACETYPE_PATCH:
4705 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4706 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4707 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))
4709 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4712 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4713 // convert patch to Q3FACETYPE_MESH
4714 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4715 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4716 // bound to user settings
4717 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4718 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4719 // bound to sanity settings
4720 xtess = bound(1, xtess, 1024);
4721 ytess = bound(1, ytess, 1024);
4722 // bound to user limit on vertices
4723 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4730 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4731 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4732 numvertices = finalwidth * finalheight;
4733 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4735 case Q3FACETYPE_FLARE:
4736 if (developer.integer >= 100)
4737 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4741 out->num_vertices = numvertices;
4742 out->num_triangles = numtriangles;
4743 meshvertices += out->num_vertices;
4744 meshtriangles += out->num_triangles;
4750 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4753 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
4755 if (out->num_vertices < 3 || out->num_triangles < 1)
4758 type = LittleLong(in->type);
4759 firstvertex = LittleLong(in->firstvertex);
4760 firstelement = LittleLong(in->firstelement);
4761 out->num_firstvertex = meshvertices;
4762 out->num_firsttriangle = meshtriangles;
4765 case Q3FACETYPE_POLYGON:
4766 case Q3FACETYPE_MESH:
4767 // no processing necessary, except for lightmap merging
4768 for (j = 0;j < out->num_vertices;j++)
4770 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4771 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4772 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4773 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
4774 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
4775 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
4776 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4777 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4778 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4779 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4780 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4781 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4782 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4783 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4785 for (j = 0;j < out->num_triangles*3;j++)
4786 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
4788 case Q3FACETYPE_PATCH:
4789 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4790 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4791 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4792 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
4793 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4794 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4795 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4796 // convert patch to Q3FACETYPE_MESH
4797 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4798 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4799 // bound to user settings
4800 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4801 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4802 // bound to sanity settings
4803 xtess = bound(1, xtess, 1024);
4804 ytess = bound(1, ytess, 1024);
4805 // bound to user limit on vertices
4806 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4813 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4814 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4815 finalvertices = finalwidth * finalheight;
4816 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4817 type = Q3FACETYPE_MESH;
4818 // generate geometry
4819 // (note: normals are skipped because they get recalculated)
4820 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4821 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
4822 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
4823 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
4824 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
4825 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
4826 out->num_triangles = Mod_RemoveDegenerateTriangles(out->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), loadmodel->surfmesh.data_vertex3f);
4827 if (developer.integer >= 100)
4829 if (out->num_triangles < finaltriangles)
4830 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);
4832 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);
4834 // q3map does not put in collision brushes for curves... ugh
4835 // build the lower quality collision geometry
4836 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4837 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4838 // bound to user settings
4839 xtess = bound(r_subdivisions_collision_mintess.integer, xtess, r_subdivisions_collision_maxtess.integer);
4840 ytess = bound(r_subdivisions_collision_mintess.integer, ytess, r_subdivisions_collision_maxtess.integer);
4841 // bound to sanity settings
4842 xtess = bound(1, xtess, 1024);
4843 ytess = bound(1, ytess, 1024);
4844 // bound to user limit on vertices
4845 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4852 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4853 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4854 finalvertices = finalwidth * finalheight;
4855 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4857 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4858 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4859 out->num_collisionvertices = finalvertices;
4860 out->num_collisiontriangles = finaltriangles;
4861 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4862 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
4864 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
4865 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
4867 oldnumtriangles = out->num_triangles;
4868 oldnumtriangles2 = out->num_collisiontriangles;
4869 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
4870 if (developer.integer >= 100)
4871 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);
4876 meshvertices += out->num_vertices;
4877 meshtriangles += out->num_triangles;
4878 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
4879 if ((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
4881 if (invalidelements)
4883 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);
4884 for (j = 0;j < out->num_triangles * 3;j++)
4886 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
4887 if ((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
4888 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
4892 // calculate a bounding box
4893 VectorClear(out->mins);
4894 VectorClear(out->maxs);
4895 if (out->num_vertices)
4897 if (cls.state != ca_dedicated && out->lightmaptexture)
4899 // figure out which part of the merged lightmap this fits into
4900 int lightmapindex = LittleLong(in->lightmapindex) >> loadmodel->brushq3.deluxemapping;
4901 int mergewidth = R_TextureWidth(out->lightmaptexture) / 128;
4902 int mergeheight = R_TextureHeight(out->lightmaptexture) / 128;
4903 lightmapindex &= mergewidth * mergeheight - 1;
4904 lightmaptcscale[0] = 1.0f / mergewidth;
4905 lightmaptcscale[1] = 1.0f / mergeheight;
4906 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
4907 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
4908 // modify the lightmap texcoords to match this region of the merged lightmap
4909 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
4911 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
4912 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
4915 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
4916 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
4917 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
4919 out->mins[0] = min(out->mins[0], v[0]);
4920 out->maxs[0] = max(out->maxs[0], v[0]);
4921 out->mins[1] = min(out->mins[1], v[1]);
4922 out->maxs[1] = max(out->maxs[1], v[1]);
4923 out->mins[2] = min(out->mins[2], v[2]);
4924 out->maxs[2] = max(out->maxs[2], v[2]);
4926 out->mins[0] -= 1.0f;
4927 out->mins[1] -= 1.0f;
4928 out->mins[2] -= 1.0f;
4929 out->maxs[0] += 1.0f;
4930 out->maxs[1] += 1.0f;
4931 out->maxs[2] += 1.0f;
4933 // set lightmap styles for consistency with q1bsp
4934 //out->lightmapinfo->styles[0] = 0;
4935 //out->lightmapinfo->styles[1] = 255;
4936 //out->lightmapinfo->styles[2] = 255;
4937 //out->lightmapinfo->styles[3] = 255;
4940 // for per pixel lighting
4941 Mod_BuildTextureVectorsFromNormals(0, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_texcoordtexture2f, loadmodel->surfmesh.data_normal3f, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.data_svector3f, loadmodel->surfmesh.data_tvector3f, true);
4943 // free the no longer needed vertex data
4944 loadmodel->brushq3.num_vertices = 0;
4945 if (loadmodel->brushq3.data_vertex3f)
4946 Mem_Free(loadmodel->brushq3.data_vertex3f);
4947 loadmodel->brushq3.data_vertex3f = NULL;
4948 loadmodel->brushq3.data_normal3f = NULL;
4949 loadmodel->brushq3.data_texcoordtexture2f = NULL;
4950 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
4951 loadmodel->brushq3.data_color4f = NULL;
4952 // free the no longer needed triangle data
4953 loadmodel->brushq3.num_triangles = 0;
4954 if (loadmodel->brushq3.data_element3i)
4955 Mem_Free(loadmodel->brushq3.data_element3i);
4956 loadmodel->brushq3.data_element3i = NULL;
4959 static void Mod_Q3BSP_LoadModels(lump_t *l)
4963 int i, j, n, c, count;
4965 in = (q3dmodel_t *)(mod_base + l->fileofs);
4966 if (l->filelen % sizeof(*in))
4967 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4968 count = l->filelen / sizeof(*in);
4969 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4971 loadmodel->brushq3.data_models = out;
4972 loadmodel->brushq3.num_models = count;
4974 for (i = 0;i < count;i++, in++, out++)
4976 for (j = 0;j < 3;j++)
4978 out->mins[j] = LittleFloat(in->mins[j]);
4979 out->maxs[j] = LittleFloat(in->maxs[j]);
4981 n = LittleLong(in->firstface);
4982 c = LittleLong(in->numfaces);
4983 if (n < 0 || n + c > loadmodel->num_surfaces)
4984 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
4987 n = LittleLong(in->firstbrush);
4988 c = LittleLong(in->numbrushes);
4989 if (n < 0 || n + c > loadmodel->brush.num_brushes)
4990 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
4991 out->firstbrush = n;
4992 out->numbrushes = c;
4996 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5002 in = (int *)(mod_base + l->fileofs);
5003 if (l->filelen % sizeof(*in))
5004 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5005 count = l->filelen / sizeof(*in);
5006 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5008 loadmodel->brush.data_leafbrushes = out;
5009 loadmodel->brush.num_leafbrushes = count;
5011 for (i = 0;i < count;i++, in++, out++)
5013 n = LittleLong(*in);
5014 if (n < 0 || n >= loadmodel->brush.num_brushes)
5015 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5020 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5026 in = (int *)(mod_base + l->fileofs);
5027 if (l->filelen % sizeof(*in))
5028 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5029 count = l->filelen / sizeof(*in);
5030 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5032 loadmodel->brush.data_leafsurfaces = out;
5033 loadmodel->brush.num_leafsurfaces = count;
5035 for (i = 0;i < count;i++, in++, out++)
5037 n = LittleLong(*in);
5038 if (n < 0 || n >= loadmodel->num_surfaces)
5039 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5044 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5048 int i, j, n, c, count;
5050 in = (q3dleaf_t *)(mod_base + l->fileofs);
5051 if (l->filelen % sizeof(*in))
5052 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5053 count = l->filelen / sizeof(*in);
5054 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5056 loadmodel->brush.data_leafs = out;
5057 loadmodel->brush.num_leafs = count;
5059 for (i = 0;i < count;i++, in++, out++)
5063 out->clusterindex = LittleLong(in->clusterindex);
5064 out->areaindex = LittleLong(in->areaindex);
5065 for (j = 0;j < 3;j++)
5067 // yes the mins/maxs are ints
5068 out->mins[j] = LittleLong(in->mins[j]) - 1;
5069 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5071 n = LittleLong(in->firstleafface);
5072 c = LittleLong(in->numleaffaces);
5073 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5074 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5075 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5076 out->numleafsurfaces = c;
5077 n = LittleLong(in->firstleafbrush);
5078 c = LittleLong(in->numleafbrushes);
5079 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5080 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5081 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5082 out->numleafbrushes = c;
5086 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5092 in = (q3dnode_t *)(mod_base + l->fileofs);
5093 if (l->filelen % sizeof(*in))
5094 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5095 count = l->filelen / sizeof(*in);
5096 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5098 loadmodel->brush.data_nodes = out;
5099 loadmodel->brush.num_nodes = count;
5101 for (i = 0;i < count;i++, in++, out++)
5104 n = LittleLong(in->planeindex);
5105 if (n < 0 || n >= loadmodel->brush.num_planes)
5106 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5107 out->plane = loadmodel->brush.data_planes + n;
5108 for (j = 0;j < 2;j++)
5110 n = LittleLong(in->childrenindex[j]);
5113 if (n >= loadmodel->brush.num_nodes)
5114 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5115 out->children[j] = loadmodel->brush.data_nodes + n;
5120 if (n >= loadmodel->brush.num_leafs)
5121 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5122 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5125 for (j = 0;j < 3;j++)
5127 // yes the mins/maxs are ints
5128 out->mins[j] = LittleLong(in->mins[j]) - 1;
5129 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5133 // set the parent pointers
5134 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5137 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5140 q3dlightgrid_t *out;
5143 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5144 if (l->filelen % sizeof(*in))
5145 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5146 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5147 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5148 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5149 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5150 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5151 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5152 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5153 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5154 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5155 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5156 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5157 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5158 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5159 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]);
5160 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]);
5162 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5165 if (l->filelen < count * (int)sizeof(*in))
5166 Host_Error("Mod_Q3BSP_LoadLightGrid: invalid lightgrid lump size %i bytes, should be %i bytes (%ix%ix%i)", l->filelen, (int)(count * sizeof(*in)), loadmodel->brushq3.num_lightgrid_dimensions[0], loadmodel->brushq3.num_lightgrid_dimensions[1], loadmodel->brushq3.num_lightgrid_dimensions[2]);
5167 if (l->filelen != count * (int)sizeof(*in))
5168 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5169 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5170 loadmodel->brushq3.data_lightgrid = out;
5171 loadmodel->brushq3.num_lightgrid = count;
5172 // no swapping or validation necessary
5173 memcpy(out, in, count * (int)sizeof(*out));
5177 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5182 if (l->filelen == 0)
5185 // unvised maps often have cluster indices even without pvs, so check
5186 // leafs to find real number of clusters
5187 loadmodel->brush.num_pvsclusters = 1;
5188 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5189 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5192 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5193 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5194 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5195 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5199 in = (q3dpvs_t *)(mod_base + l->fileofs);
5201 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5203 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5204 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5205 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5206 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5207 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5208 if (l->filelen < totalchains + (int)sizeof(*in))
5209 Host_Error("Mod_Q3BSP_LoadPVS: lump too small ((numclusters = %i) * (chainlength = %i) + sizeof(q3dpvs_t) == %i bytes, lump is %i bytes)", loadmodel->brush.num_pvsclusters, loadmodel->brush.num_pvsclusterbytes, (int)(totalchains + sizeof(*in)), l->filelen);
5211 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5212 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5215 static void Mod_Q3BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5217 int i, j, k, index[3];
5218 float transformed[3], blend1, blend2, blend, stylescale;
5219 q3dlightgrid_t *a, *s;
5221 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5222 stylescale = r_refdef.rtlightstylevalue[0];
5224 if (!model->brushq3.num_lightgrid)
5226 ambientcolor[0] = stylescale;
5227 ambientcolor[1] = stylescale;
5228 ambientcolor[2] = stylescale;
5232 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5233 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5234 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5235 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5236 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5237 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5238 index[0] = (int)floor(transformed[0]);
5239 index[1] = (int)floor(transformed[1]);
5240 index[2] = (int)floor(transformed[2]);
5241 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5243 // now lerp the values
5244 VectorClear(diffusenormal);
5245 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5246 for (k = 0;k < 2;k++)
5248 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5249 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5251 for (j = 0;j < 2;j++)
5253 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5254 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5256 for (i = 0;i < 2;i++)
5258 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5259 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5261 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5262 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5263 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5264 // this uses the mod_md3_sin table because the values are
5265 // already in the 0-255 range, the 64+ bias fetches a cosine
5266 // instead of a sine value
5267 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5268 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5269 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5270 //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)));
5275 // normalize the light direction before turning
5276 VectorNormalize(diffusenormal);
5277 //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]);
5280 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const vec3_t point, int markframe)
5285 // find which leaf the point is in
5287 node = node->children[DotProduct(point, node->plane->normal) < node->plane->dist];
5288 // point trace the brushes
5289 leaf = (mleaf_t *)node;
5290 for (i = 0;i < leaf->numleafbrushes;i++)
5292 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5293 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5295 brush->markframe = markframe;
5296 Collision_TracePointBrushFloat(trace, point, brush);
5299 // can't do point traces on curves (they have no thickness)
5302 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)
5304 int i, startside, endside;
5305 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5307 msurface_t *surface;
5310 // walk the tree until we hit a leaf, recursing for any split cases
5313 // abort if this part of the bsp tree can not be hit by this trace
5314 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5316 plane = node->plane;
5317 // axial planes are much more common than non-axial, so an optimized
5318 // axial case pays off here
5319 if (plane->type < 3)
5321 dist1 = start[plane->type] - plane->dist;
5322 dist2 = end[plane->type] - plane->dist;
5326 dist1 = DotProduct(start, plane->normal) - plane->dist;
5327 dist2 = DotProduct(end, plane->normal) - plane->dist;
5329 startside = dist1 < 0;
5330 endside = dist2 < 0;
5331 if (startside == endside)
5333 // most of the time the line fragment is on one side of the plane
5334 node = node->children[startside];
5338 // line crosses node plane, split the line
5339 dist1 = PlaneDiff(linestart, plane);
5340 dist2 = PlaneDiff(lineend, plane);
5341 midfrac = dist1 / (dist1 - dist2);
5342 VectorLerp(linestart, midfrac, lineend, mid);
5343 // take the near side first
5344 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5345 // if we found an impact on the front side, don't waste time
5346 // exploring the far side
5347 if (midfrac <= trace->realfraction)
5348 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5352 // abort if this part of the bsp tree can not be hit by this trace
5353 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5356 nodesegmentmins[0] = min(start[0], end[0]) - 1;
5357 nodesegmentmins[1] = min(start[1], end[1]) - 1;
5358 nodesegmentmins[2] = min(start[2], end[2]) - 1;
5359 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5360 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5361 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5362 // line trace the brushes
5363 leaf = (mleaf_t *)node;
5364 for (i = 0;i < leaf->numleafbrushes;i++)
5366 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5367 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5369 brush->markframe = markframe;
5370 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5373 // can't do point traces on curves (they have no thickness)
5374 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5376 // line trace the curves
5377 for (i = 0;i < leaf->numleafsurfaces;i++)
5379 surface = model->data_surfaces + leaf->firstleafsurface[i];
5380 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5382 surface->collisionmarkframe = markframe;
5383 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5389 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)
5395 msurface_t *surface;
5397 float nodesegmentmins[3], nodesegmentmaxs[3];
5398 // walk the tree until we hit a leaf, recursing for any split cases
5401 // abort if this part of the bsp tree can not be hit by this trace
5402 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5404 plane = node->plane;
5405 // axial planes are much more common than non-axial, so an optimized
5406 // axial case pays off here
5407 if (plane->type < 3)
5409 // this is an axial plane, compare bounding box directly to it and
5410 // recurse sides accordingly
5411 // recurse down node sides
5412 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5413 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5414 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5415 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5419 // this is a non-axial plane, so check if the start and end boxes
5420 // are both on one side of the plane to handle 'diagonal' cases
5421 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5425 // segment crosses plane
5426 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5429 // if sides == 0 then the trace itself is bogus (Not A Number values),
5430 // in this case we simply pretend the trace hit nothing
5432 return; // ERROR: NAN bounding box!
5433 // take whichever side the segment box is on
5434 node = node->children[sides - 1];
5436 // abort if this part of the bsp tree can not be hit by this trace
5437 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5439 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5440 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5441 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5442 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5443 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5444 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5446 leaf = (mleaf_t *)node;
5447 for (i = 0;i < leaf->numleafbrushes;i++)
5449 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5450 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5452 brush->markframe = markframe;
5453 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5456 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5458 for (i = 0;i < leaf->numleafsurfaces;i++)
5460 surface = model->data_surfaces + leaf->firstleafsurface[i];
5461 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5463 surface->collisionmarkframe = markframe;
5464 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5470 static void Mod_Q3BSP_TraceBox(model_t *model, int frame, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
5473 float segmentmins[3], segmentmaxs[3];
5474 static int markframe = 0;
5475 msurface_t *surface;
5477 memset(trace, 0, sizeof(*trace));
5478 trace->fraction = 1;
5479 trace->realfraction = 1;
5480 trace->hitsupercontentsmask = hitsupercontentsmask;
5481 if (mod_q3bsp_optimizedtraceline.integer && VectorLength2(boxmins) + VectorLength2(boxmaxs) == 0)
5483 if (VectorCompare(start, end))
5486 if (model->brush.submodel)
5488 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5489 if (brush->colbrushf)
5490 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5493 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5498 segmentmins[0] = min(start[0], end[0]) - 1;
5499 segmentmins[1] = min(start[1], end[1]) - 1;
5500 segmentmins[2] = min(start[2], end[2]) - 1;
5501 segmentmaxs[0] = max(start[0], end[0]) + 1;
5502 segmentmaxs[1] = max(start[1], end[1]) + 1;
5503 segmentmaxs[2] = max(start[2], end[2]) + 1;
5504 if (model->brush.submodel)
5506 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5507 if (brush->colbrushf)
5508 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5509 if (mod_q3bsp_curves_collisions.integer)
5510 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5511 if (surface->num_collisiontriangles)
5512 Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5515 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5520 // box trace, performed as brush trace
5521 colbrushf_t *thisbrush_start, *thisbrush_end;
5522 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5523 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5524 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5525 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5526 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5527 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5528 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5529 VectorAdd(start, boxmins, boxstartmins);
5530 VectorAdd(start, boxmaxs, boxstartmaxs);
5531 VectorAdd(end, boxmins, boxendmins);
5532 VectorAdd(end, boxmaxs, boxendmaxs);
5533 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5534 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5535 if (model->brush.submodel)
5537 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5538 if (brush->colbrushf)
5539 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5540 if (mod_q3bsp_curves_collisions.integer)
5541 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5542 if (surface->num_collisiontriangles)
5543 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5546 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5550 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
5552 int supercontents = 0;
5553 if (nativecontents & CONTENTSQ3_SOLID)
5554 supercontents |= SUPERCONTENTS_SOLID;
5555 if (nativecontents & CONTENTSQ3_WATER)
5556 supercontents |= SUPERCONTENTS_WATER;
5557 if (nativecontents & CONTENTSQ3_SLIME)
5558 supercontents |= SUPERCONTENTS_SLIME;
5559 if (nativecontents & CONTENTSQ3_LAVA)
5560 supercontents |= SUPERCONTENTS_LAVA;
5561 if (nativecontents & CONTENTSQ3_BODY)
5562 supercontents |= SUPERCONTENTS_BODY;
5563 if (nativecontents & CONTENTSQ3_CORPSE)
5564 supercontents |= SUPERCONTENTS_CORPSE;
5565 if (nativecontents & CONTENTSQ3_NODROP)
5566 supercontents |= SUPERCONTENTS_NODROP;
5567 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5568 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5569 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5570 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5571 if (nativecontents & CONTENTSQ3_DONOTENTER)
5572 supercontents |= SUPERCONTENTS_DONOTENTER;
5573 return supercontents;
5576 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
5578 int nativecontents = 0;
5579 if (supercontents & SUPERCONTENTS_SOLID)
5580 nativecontents |= CONTENTSQ3_SOLID;
5581 if (supercontents & SUPERCONTENTS_WATER)
5582 nativecontents |= CONTENTSQ3_WATER;
5583 if (supercontents & SUPERCONTENTS_SLIME)
5584 nativecontents |= CONTENTSQ3_SLIME;
5585 if (supercontents & SUPERCONTENTS_LAVA)
5586 nativecontents |= CONTENTSQ3_LAVA;
5587 if (supercontents & SUPERCONTENTS_BODY)
5588 nativecontents |= CONTENTSQ3_BODY;
5589 if (supercontents & SUPERCONTENTS_CORPSE)
5590 nativecontents |= CONTENTSQ3_CORPSE;
5591 if (supercontents & SUPERCONTENTS_NODROP)
5592 nativecontents |= CONTENTSQ3_NODROP;
5593 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5594 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5595 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5596 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5597 if (supercontents & SUPERCONTENTS_DONOTENTER)
5598 nativecontents |= CONTENTSQ3_DONOTENTER;
5599 return nativecontents;
5602 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5607 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5608 node = node->children[1];
5610 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5611 if (loadmodel->brush.num_leafs < numleafs)
5612 loadmodel->brush.num_leafs = numleafs;
5615 void Mod_Q3BSP_Load(model_t *mod, void *buffer, void *bufferend)
5617 int i, j, numshadowmeshtriangles;
5618 q3dheader_t *header;
5619 float corner[3], yawradius, modelradius;
5620 msurface_t *surface;
5622 mod->modeldatatypestring = "Q3BSP";
5624 mod->type = mod_brushq3;
5625 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5628 header = (q3dheader_t *)buffer;
5630 i = LittleLong(header->version);
5631 if (i != Q3BSPVERSION)
5632 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5633 mod->brush.ishlbsp = false;
5634 mod->brush.ismcbsp = false;
5635 if (loadmodel->isworldmodel)
5637 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
5638 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
5641 mod->soundfromcenter = true;
5642 mod->TraceBox = Mod_Q3BSP_TraceBox;
5643 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
5644 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5645 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5646 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5647 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5648 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5649 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5650 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5651 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
5652 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5653 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5654 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5655 mod->Draw = R_Q1BSP_Draw;
5656 mod->DrawDepth = R_Q1BSP_DrawDepth;
5657 mod->DrawDebug = R_Q1BSP_DrawDebug;
5658 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5659 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5660 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5661 mod->DrawLight = R_Q1BSP_DrawLight;
5662 mod->DrawAddWaterPlanes = NULL;
5664 mod_base = (unsigned char *)header;
5666 // swap all the lumps
5667 header->ident = LittleLong(header->ident);
5668 header->version = LittleLong(header->version);
5669 for (i = 0;i < Q3HEADER_LUMPS;i++)
5671 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
5672 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
5675 mod->brush.qw_md4sum = 0;
5676 mod->brush.qw_md4sum2 = 0;
5677 for (i = 0;i < Q3HEADER_LUMPS;i++)
5679 if (i == Q3LUMP_ENTITIES)
5681 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5682 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
5684 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5687 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5688 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5689 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5690 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5691 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5692 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5693 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5694 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5695 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
5696 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5697 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5698 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5699 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5700 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5701 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5702 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5703 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5704 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5706 // the MakePortals code works fine on the q3bsp data as well
5707 Mod_Q1BSP_MakePortals();
5709 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
5710 loadmodel->brush.supportwateralpha = true;
5712 // make a single combined shadow mesh to allow optimized shadow volume creation
5713 numshadowmeshtriangles = 0;
5714 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5716 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5717 numshadowmeshtriangles += surface->num_triangles;
5719 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5720 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5721 if (surface->num_triangles > 0)
5722 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, loadmodel->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
5723 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
5724 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5726 loadmodel->brush.num_leafs = 0;
5727 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
5729 if (loadmodel->isworldmodel)
5731 // clear out any stale submodels or worldmodels lying around
5732 // if we did this clear before now, an error might abort loading and
5733 // leave things in a bad state
5734 Mod_RemoveStaleWorldModels(loadmodel);
5738 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
5743 // LordHavoc: only register submodels if it is the world
5744 // (prevents external bsp models from replacing world submodels with
5746 if (!loadmodel->isworldmodel)
5748 // duplicate the basic information
5749 sprintf(name, "*%i", i);
5750 mod = Mod_FindName(name);
5752 strlcpy(mod->name, name, sizeof(mod->name));
5753 // textures and memory belong to the main model
5754 mod->texturepool = NULL;
5755 mod->mempool = NULL;
5756 mod->brush.TraceLineOfSight = NULL;
5757 mod->brush.GetPVS = NULL;
5758 mod->brush.FatPVS = NULL;
5759 mod->brush.BoxTouchingPVS = NULL;
5760 mod->brush.BoxTouchingLeafPVS = NULL;
5761 mod->brush.BoxTouchingVisibleLeafs = NULL;
5762 mod->brush.FindBoxClusters = NULL;
5763 mod->brush.LightPoint = NULL;
5764 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5766 mod->brush.submodel = i;
5768 // make the model surface list (used by shadowing/lighting)
5769 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
5770 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
5771 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
5772 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
5773 mod->surfacelist = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
5774 for (j = 0;j < mod->nummodelsurfaces;j++)
5775 mod->surfacelist[j] = mod->firstmodelsurface + j;
5777 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
5778 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
5779 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5780 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5781 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5782 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5783 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5784 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5785 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5786 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5787 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5788 mod->yawmins[2] = mod->normalmins[2];
5789 mod->yawmaxs[2] = mod->normalmaxs[2];
5790 mod->radius = modelradius;
5791 mod->radius2 = modelradius * modelradius;
5793 for (j = 0;j < mod->nummodelsurfaces;j++)
5794 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
5796 if (j < mod->nummodelsurfaces)
5797 mod->DrawSky = R_Q1BSP_DrawSky;
5799 mod->DrawSky = NULL;
5801 for (j = 0;j < mod->nummodelsurfaces;j++)
5802 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
5804 if (j < mod->nummodelsurfaces)
5805 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
5807 mod->DrawAddWaterPlanes = NULL;
5811 void Mod_IBSP_Load(model_t *mod, void *buffer, void *bufferend)
5813 int i = LittleLong(((int *)buffer)[1]);
5814 if (i == Q3BSPVERSION)
5815 Mod_Q3BSP_Load(mod,buffer, bufferend);
5816 else if (i == Q2BSPVERSION)
5817 Mod_Q2BSP_Load(mod,buffer, bufferend);
5819 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
5822 void Mod_MAP_Load(model_t *mod, void *buffer, void *bufferend)
5824 Host_Error("Mod_MAP_Load: not yet implemented");
5827 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
5829 // we already have done PVS culling at this point...
5830 // so we don't need to do it again.
5833 vec3_t testorigin, mins, maxs;
5835 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
5836 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
5837 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
5839 if(model->brush.TraceLineOfSight(model, eye, testorigin))
5842 // expand the box a little
5843 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
5844 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
5845 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
5846 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
5847 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
5848 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
5850 for(i = 0; i != numsamples; ++i)
5852 testorigin[0] = lhrandom(mins[0], maxs[0]);
5853 testorigin[1] = lhrandom(mins[1], maxs[1]);
5854 testorigin[2] = lhrandom(mins[2], maxs[2]);
5856 if(model->brush.TraceLineOfSight(model, eye, testorigin))