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_lightmaprgba = {0, "r_lightmaprgba", "1", "whether to use RGBA (32bit) or RGB (24bit) lightmaps"};
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)"};
47 static texture_t mod_q1bsp_texture_solid;
48 static texture_t mod_q1bsp_texture_sky;
49 static texture_t mod_q1bsp_texture_lava;
50 static texture_t mod_q1bsp_texture_slime;
51 static texture_t mod_q1bsp_texture_water;
53 void Mod_BrushInit(void)
55 // Cvar_RegisterVariable(&r_subdivide_size);
56 Cvar_RegisterVariable(&halflifebsp);
57 Cvar_RegisterVariable(&mcbsp);
58 Cvar_RegisterVariable(&r_novis);
59 Cvar_RegisterVariable(&r_lightmaprgba);
60 Cvar_RegisterVariable(&r_nosurftextures);
61 Cvar_RegisterVariable(&r_subdivisions_tolerance);
62 Cvar_RegisterVariable(&r_subdivisions_mintess);
63 Cvar_RegisterVariable(&r_subdivisions_maxtess);
64 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
65 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
66 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
67 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
68 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
69 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
70 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
71 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
73 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
74 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
75 mod_q1bsp_texture_solid.surfaceflags = 0;
76 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
78 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
79 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
80 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
81 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
83 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
84 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
85 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
86 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
88 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
89 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
90 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
91 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
93 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
94 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
95 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
96 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
99 static mleaf_t *Mod_Q1BSP_PointInLeaf(model_t *model, const vec3_t p)
106 // LordHavoc: modified to start at first clip node,
107 // in other words: first node of the (sub)model
108 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
110 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
112 return (mleaf_t *)node;
115 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(model_t *model, const vec3_t p, unsigned char *out, int outsize)
119 leaf = Mod_Q1BSP_PointInLeaf(model, p);
122 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
125 memcpy(out, leaf->ambient_sound_level, i);
131 memset(out, 0, outsize);
134 static int Mod_Q1BSP_FindBoxClusters(model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
137 int nodestackindex = 0;
138 mnode_t *node, *nodestack[1024];
139 if (!model->brush.num_pvsclusters)
141 node = model->brush.data_nodes;
147 // node - recurse down the BSP tree
148 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
152 return -1; // ERROR: NAN bounding box!
153 // box is on one side of plane, take that path
154 node = node->children[sides-1];
158 // box crosses plane, take one path and remember the other
159 if (nodestackindex < 1024)
160 nodestack[nodestackindex++] = node->children[0];
161 node = node->children[1];
167 // leaf - add clusterindex to list
168 if (numclusters < maxclusters)
169 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
173 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
177 if (nodestackindex < 1024)
178 nodestack[nodestackindex++] = node->children[0];
179 node = node->children[1];
184 // leaf - add clusterindex to list
185 if (numclusters < maxclusters)
186 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
191 // try another path we didn't take earlier
192 if (nodestackindex == 0)
194 node = nodestack[--nodestackindex];
196 // return number of clusters found (even if more than the maxclusters)
200 static int Mod_Q1BSP_BoxTouchingPVS(model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
202 int nodestackindex = 0;
203 mnode_t *node, *nodestack[1024];
204 if (!model->brush.num_pvsclusters)
206 node = model->brush.data_nodes;
212 // node - recurse down the BSP tree
213 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
217 return -1; // ERROR: NAN bounding box!
218 // box is on one side of plane, take that path
219 node = node->children[sides-1];
223 // box crosses plane, take one path and remember the other
224 if (nodestackindex < 1024)
225 nodestack[nodestackindex++] = node->children[0];
226 node = node->children[1];
232 // leaf - check cluster bit
233 int clusterindex = ((mleaf_t *)node)->clusterindex;
234 if (CHECKPVSBIT(pvs, clusterindex))
236 // it is visible, return immediately with the news
241 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
245 if (nodestackindex < 1024)
246 nodestack[nodestackindex++] = node->children[0];
247 node = node->children[1];
252 // leaf - check cluster bit
253 int clusterindex = ((mleaf_t *)node)->clusterindex;
254 if (CHECKPVSBIT(pvs, clusterindex))
256 // it is visible, return immediately with the news
262 // nothing to see here, try another path we didn't take earlier
263 if (nodestackindex == 0)
265 node = nodestack[--nodestackindex];
271 static int Mod_Q1BSP_BoxTouchingLeafPVS(model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
273 int nodestackindex = 0;
274 mnode_t *node, *nodestack[1024];
275 if (!model->brush.num_leafs)
277 node = model->brush.data_nodes;
283 // node - recurse down the BSP tree
284 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
288 return -1; // ERROR: NAN bounding box!
289 // box is on one side of plane, take that path
290 node = node->children[sides-1];
294 // box crosses plane, take one path and remember the other
295 if (nodestackindex < 1024)
296 nodestack[nodestackindex++] = node->children[0];
297 node = node->children[1];
303 // leaf - check cluster bit
304 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
305 if (CHECKPVSBIT(pvs, clusterindex))
307 // it is visible, return immediately with the news
312 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
316 if (nodestackindex < 1024)
317 nodestack[nodestackindex++] = node->children[0];
318 node = node->children[1];
323 // leaf - check cluster bit
324 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
325 if (CHECKPVSBIT(pvs, clusterindex))
327 // it is visible, return immediately with the news
333 // nothing to see here, try another path we didn't take earlier
334 if (nodestackindex == 0)
336 node = nodestack[--nodestackindex];
342 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
344 int nodestackindex = 0;
345 mnode_t *node, *nodestack[1024];
346 if (!model->brush.num_leafs)
348 node = model->brush.data_nodes;
354 // node - recurse down the BSP tree
355 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
359 return -1; // ERROR: NAN bounding box!
360 // box is on one side of plane, take that path
361 node = node->children[sides-1];
365 // box crosses plane, take one path and remember the other
366 if (nodestackindex < 1024)
367 nodestack[nodestackindex++] = node->children[0];
368 node = node->children[1];
374 // leaf - check if it is visible
375 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
377 // it is visible, return immediately with the news
382 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
386 if (nodestackindex < 1024)
387 nodestack[nodestackindex++] = node->children[0];
388 node = node->children[1];
393 // leaf - check if it is visible
394 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
396 // it is visible, return immediately with the news
402 // nothing to see here, try another path we didn't take earlier
403 if (nodestackindex == 0)
405 node = nodestack[--nodestackindex];
411 typedef struct findnonsolidlocationinfo_s
419 findnonsolidlocationinfo_t;
421 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
423 int i, surfacenum, k, *tri, *mark;
424 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
426 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
428 surface = info->model->data_surfaces + *mark;
429 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
431 for (k = 0;k < surface->num_triangles;k++)
433 tri = (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle) + k * 3;
434 VectorCopy((surface->groupmesh->data_vertex3f + tri[0] * 3), vert[0]);
435 VectorCopy((surface->groupmesh->data_vertex3f + tri[1] * 3), vert[1]);
436 VectorCopy((surface->groupmesh->data_vertex3f + tri[2] * 3), vert[2]);
437 VectorSubtract(vert[1], vert[0], edge[0]);
438 VectorSubtract(vert[2], vert[1], edge[1]);
439 CrossProduct(edge[1], edge[0], facenormal);
440 if (facenormal[0] || facenormal[1] || facenormal[2])
442 VectorNormalize(facenormal);
443 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
444 if (f <= info->bestdist && f >= -info->bestdist)
446 VectorSubtract(vert[0], vert[2], edge[2]);
447 VectorNormalize(edge[0]);
448 VectorNormalize(edge[1]);
449 VectorNormalize(edge[2]);
450 CrossProduct(facenormal, edge[0], edgenormal[0]);
451 CrossProduct(facenormal, edge[1], edgenormal[1]);
452 CrossProduct(facenormal, edge[2], edgenormal[2]);
454 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
455 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
456 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
458 // we got lucky, the center is within the face
459 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
463 if (info->bestdist > dist)
465 info->bestdist = dist;
466 VectorScale(facenormal, (info->radius - -dist), info->nudge);
471 if (info->bestdist > dist)
473 info->bestdist = dist;
474 VectorScale(facenormal, (info->radius - dist), info->nudge);
480 // check which edge or vertex the center is nearest
481 for (i = 0;i < 3;i++)
483 f = DotProduct(info->center, edge[i]);
484 if (f >= DotProduct(vert[0], edge[i])
485 && f <= DotProduct(vert[1], edge[i]))
488 VectorMA(info->center, -f, edge[i], point);
489 dist = sqrt(DotProduct(point, point));
490 if (info->bestdist > dist)
492 info->bestdist = dist;
493 VectorScale(point, (info->radius / dist), info->nudge);
495 // skip both vertex checks
496 // (both are further away than this edge)
501 // not on edge, check first vertex of edge
502 VectorSubtract(info->center, vert[i], point);
503 dist = sqrt(DotProduct(point, point));
504 if (info->bestdist > dist)
506 info->bestdist = dist;
507 VectorScale(point, (info->radius / dist), info->nudge);
519 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
523 float f = PlaneDiff(info->center, node->plane);
524 if (f >= -info->bestdist)
525 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
526 if (f <= info->bestdist)
527 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
531 if (((mleaf_t *)node)->numleafsurfaces)
532 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
536 static void Mod_Q1BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, float radius)
539 findnonsolidlocationinfo_t info;
545 VectorCopy(in, info.center);
546 info.radius = radius;
551 VectorClear(info.nudge);
552 info.bestdist = radius;
553 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
554 VectorAdd(info.center, info.nudge, info.center);
556 while (info.bestdist < radius && ++i < 10);
557 VectorCopy(info.center, out);
560 int Mod_Q1BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
562 switch(nativecontents)
567 return SUPERCONTENTS_SOLID;
569 return SUPERCONTENTS_WATER;
571 return SUPERCONTENTS_SLIME;
573 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
575 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
580 int Mod_Q1BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
582 if (supercontents & SUPERCONTENTS_SOLID)
583 return CONTENTS_SOLID;
584 if (supercontents & SUPERCONTENTS_SKY)
586 if (supercontents & SUPERCONTENTS_LAVA)
587 return CONTENTS_LAVA;
588 if (supercontents & SUPERCONTENTS_SLIME)
589 return CONTENTS_SLIME;
590 if (supercontents & SUPERCONTENTS_WATER)
591 return CONTENTS_WATER;
592 return CONTENTS_EMPTY;
595 typedef struct RecursiveHullCheckTraceInfo_s
597 // the hull we're tracing through
600 // the trace structure to fill in
603 // start, end, and end - start (in model space)
608 RecursiveHullCheckTraceInfo_t;
610 // 1/32 epsilon to keep floating point happy
611 #define DIST_EPSILON (0.03125)
613 #define HULLCHECKSTATE_EMPTY 0
614 #define HULLCHECKSTATE_SOLID 1
615 #define HULLCHECKSTATE_DONE 2
617 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
619 // status variables, these don't need to be saved on the stack when
620 // recursing... but are because this should be thread-safe
621 // (note: tracing against a bbox is not thread-safe, yet)
626 // variables that need to be stored on the stack when recursing
631 // LordHavoc: a goto! everyone flee in terror... :)
636 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
637 if (!t->trace->startfound)
639 t->trace->startfound = true;
640 t->trace->startsupercontents |= num;
642 if (num & SUPERCONTENTS_LIQUIDSMASK)
643 t->trace->inwater = true;
645 t->trace->inopen = true;
646 if (num & SUPERCONTENTS_SOLID)
647 t->trace->hittexture = &mod_q1bsp_texture_solid;
648 else if (num & SUPERCONTENTS_SKY)
649 t->trace->hittexture = &mod_q1bsp_texture_sky;
650 else if (num & SUPERCONTENTS_LAVA)
651 t->trace->hittexture = &mod_q1bsp_texture_lava;
652 else if (num & SUPERCONTENTS_SLIME)
653 t->trace->hittexture = &mod_q1bsp_texture_slime;
655 t->trace->hittexture = &mod_q1bsp_texture_water;
656 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
657 t->trace->hitsupercontents = num;
658 if (num & t->trace->hitsupercontentsmask)
660 // if the first leaf is solid, set startsolid
661 if (t->trace->allsolid)
662 t->trace->startsolid = true;
663 #if COLLISIONPARANOID >= 3
666 return HULLCHECKSTATE_SOLID;
670 t->trace->allsolid = false;
671 #if COLLISIONPARANOID >= 3
674 return HULLCHECKSTATE_EMPTY;
678 // find the point distances
679 node = t->hull->clipnodes + num;
681 plane = t->hull->planes + node->planenum;
684 t1 = p1[plane->type] - plane->dist;
685 t2 = p2[plane->type] - plane->dist;
689 t1 = DotProduct (plane->normal, p1) - plane->dist;
690 t2 = DotProduct (plane->normal, p2) - plane->dist;
697 #if COLLISIONPARANOID >= 3
700 num = node->children[1];
709 #if COLLISIONPARANOID >= 3
712 num = node->children[0];
718 // the line intersects, find intersection point
719 // LordHavoc: this uses the original trace for maximum accuracy
720 #if COLLISIONPARANOID >= 3
725 t1 = t->start[plane->type] - plane->dist;
726 t2 = t->end[plane->type] - plane->dist;
730 t1 = DotProduct (plane->normal, t->start) - plane->dist;
731 t2 = DotProduct (plane->normal, t->end) - plane->dist;
734 midf = t1 / (t1 - t2);
735 midf = bound(p1f, midf, p2f);
736 VectorMA(t->start, midf, t->dist, mid);
738 // recurse both sides, front side first
739 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
740 // if this side is not empty, return what it is (solid or done)
741 if (ret != HULLCHECKSTATE_EMPTY)
744 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
745 // if other side is not solid, return what it is (empty or done)
746 if (ret != HULLCHECKSTATE_SOLID)
749 // front is air and back is solid, this is the impact point...
752 t->trace->plane.dist = -plane->dist;
753 VectorNegate (plane->normal, t->trace->plane.normal);
757 t->trace->plane.dist = plane->dist;
758 VectorCopy (plane->normal, t->trace->plane.normal);
761 // calculate the true fraction
762 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
763 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
764 midf = t1 / (t1 - t2);
765 t->trace->realfraction = bound(0, midf, 1);
767 // calculate the return fraction which is nudged off the surface a bit
768 midf = (t1 - DIST_EPSILON) / (t1 - t2);
769 t->trace->fraction = bound(0, midf, 1);
771 #if COLLISIONPARANOID >= 3
774 return HULLCHECKSTATE_DONE;
777 #if COLLISIONPARANOID < 2
778 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
781 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];
782 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
783 t->trace->startsupercontents |= num;
784 if (num & SUPERCONTENTS_LIQUIDSMASK)
785 t->trace->inwater = true;
787 t->trace->inopen = true;
788 if (num & t->trace->hitsupercontentsmask)
790 t->trace->allsolid = t->trace->startsolid = true;
791 return HULLCHECKSTATE_SOLID;
795 t->trace->allsolid = t->trace->startsolid = false;
796 return HULLCHECKSTATE_EMPTY;
801 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)
803 // this function currently only supports same size start and end
805 RecursiveHullCheckTraceInfo_t rhc;
807 memset(&rhc, 0, sizeof(rhc));
808 memset(trace, 0, sizeof(trace_t));
810 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
811 rhc.trace->fraction = 1;
812 rhc.trace->realfraction = 1;
813 rhc.trace->allsolid = true;
814 VectorSubtract(boxmaxs, boxmins, boxsize);
816 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
817 else if (model->brush.ismcbsp)
819 if (boxsize[2] < 48) // pick the nearest of 40 or 56
820 rhc.hull = &model->brushq1.hulls[2]; // 16x16x40
822 rhc.hull = &model->brushq1.hulls[1]; // 16x16x56
824 else if (model->brush.ishlbsp)
826 // LordHavoc: this has to have a minor tolerance (the .1) because of
827 // minor float precision errors from the box being transformed around
828 if (boxsize[0] < 32.1)
830 if (boxsize[2] < 54) // pick the nearest of 36 or 72
831 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
833 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
836 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
840 // LordHavoc: this has to have a minor tolerance (the .1) because of
841 // minor float precision errors from the box being transformed around
842 if (boxsize[0] < 32.1)
843 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
845 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
847 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
848 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
849 VectorSubtract(rhc.end, rhc.start, rhc.dist);
850 #if COLLISIONPARANOID >= 2
851 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]);
852 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
855 if (VectorLength2(rhc.dist))
856 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
858 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
860 if (trace->fraction == 1)
862 trace->hitsupercontents = 0;
863 trace->hitq3surfaceflags = 0;
864 trace->hittexture = NULL;
868 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)
872 colplanef_t cbox_planes[6];
873 cbox.supercontents = boxsupercontents;
876 cbox.numtriangles = 0;
877 cbox.planes = cbox_planes;
879 cbox.elements = NULL;
887 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];
888 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];
889 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];
890 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];
891 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];
892 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];
893 memset(trace, 0, sizeof(trace_t));
894 trace->hitsupercontentsmask = hitsupercontentsmask;
896 trace->realfraction = 1;
897 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
899 RecursiveHullCheckTraceInfo_t rhc;
900 static hull_t box_hull;
901 static dclipnode_t box_clipnodes[6];
902 static mplane_t box_planes[6];
903 // fill in a default trace
904 memset(&rhc, 0, sizeof(rhc));
905 memset(trace, 0, sizeof(trace_t));
906 //To keep everything totally uniform, bounding boxes are turned into small
907 //BSP trees instead of being compared directly.
908 // create a temp hull from bounding box sizes
909 box_planes[0].dist = cmaxs[0] - mins[0];
910 box_planes[1].dist = cmins[0] - maxs[0];
911 box_planes[2].dist = cmaxs[1] - mins[1];
912 box_planes[3].dist = cmins[1] - maxs[1];
913 box_planes[4].dist = cmaxs[2] - mins[2];
914 box_planes[5].dist = cmins[2] - maxs[2];
915 #if COLLISIONPARANOID >= 3
916 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]);
919 if (box_hull.clipnodes == NULL)
923 //Set up the planes and clipnodes so that the six floats of a bounding box
924 //can just be stored out and get a proper hull_t structure.
926 box_hull.clipnodes = box_clipnodes;
927 box_hull.planes = box_planes;
928 box_hull.firstclipnode = 0;
929 box_hull.lastclipnode = 5;
931 for (i = 0;i < 6;i++)
933 box_clipnodes[i].planenum = i;
937 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
939 box_clipnodes[i].children[side^1] = i + 1;
941 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
943 box_planes[i].type = i>>1;
944 box_planes[i].normal[i>>1] = 1;
948 // trace a line through the generated clipping hull
949 //rhc.boxsupercontents = boxsupercontents;
950 rhc.hull = &box_hull;
952 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
953 rhc.trace->fraction = 1;
954 rhc.trace->realfraction = 1;
955 rhc.trace->allsolid = true;
956 VectorCopy(start, rhc.start);
957 VectorCopy(end, rhc.end);
958 VectorSubtract(rhc.end, rhc.start, rhc.dist);
959 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
960 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
961 if (rhc.trace->startsupercontents)
962 rhc.trace->startsupercontents = boxsupercontents;
966 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)
968 int side, distz = endz - startz;
974 return false; // didn't hit anything
976 switch (node->plane->type)
979 node = node->children[x < node->plane->dist];
982 node = node->children[y < node->plane->dist];
985 side = startz < node->plane->dist;
986 if ((endz < node->plane->dist) == side)
988 node = node->children[side];
991 // found an intersection
992 mid = node->plane->dist;
995 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
996 front += startz * node->plane->normal[2];
997 back += endz * node->plane->normal[2];
998 side = front < node->plane->dist;
999 if ((back < node->plane->dist) == side)
1001 node = node->children[side];
1004 // found an intersection
1005 mid = startz + distz * (front - node->plane->dist) / (front - back);
1009 // go down front side
1010 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1011 return true; // hit something
1014 // check for impact on this node
1015 if (node->numsurfaces)
1018 msurface_t *surface;
1020 surface = model->data_surfaces + node->firstsurface;
1021 for (i = 0;i < node->numsurfaces;i++, surface++)
1023 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1024 continue; // no lightmaps
1026 ds = (int) (x * surface->lightmapinfo->texinfo->vecs[0][0] + y * surface->lightmapinfo->texinfo->vecs[0][1] + mid * surface->lightmapinfo->texinfo->vecs[0][2] + surface->lightmapinfo->texinfo->vecs[0][3]) - surface->lightmapinfo->texturemins[0];
1027 dt = (int) (x * surface->lightmapinfo->texinfo->vecs[1][0] + y * surface->lightmapinfo->texinfo->vecs[1][1] + mid * surface->lightmapinfo->texinfo->vecs[1][2] + surface->lightmapinfo->texinfo->vecs[1][3]) - surface->lightmapinfo->texturemins[1];
1029 if (ds >= 0 && ds < surface->lightmapinfo->extents[0] && dt >= 0 && dt < surface->lightmapinfo->extents[1])
1031 unsigned char *lightmap;
1032 int lmwidth, lmheight, maps, line3, size3, dsfrac = ds & 15, dtfrac = dt & 15, scale = 0, r00 = 0, g00 = 0, b00 = 0, r01 = 0, g01 = 0, b01 = 0, r10 = 0, g10 = 0, b10 = 0, r11 = 0, g11 = 0, b11 = 0;
1033 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1034 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1035 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1036 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1038 lightmap = surface->lightmapinfo->samples + ((dt>>4) * lmwidth + (ds>>4))*3; // LordHavoc: *3 for colored lighting
1040 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1042 scale = r_refdef.lightstylevalue[surface->lightmapinfo->styles[maps]];
1043 r00 += lightmap[ 0] * scale;g00 += lightmap[ 1] * scale;b00 += lightmap[ 2] * scale;
1044 r01 += lightmap[ 3] * scale;g01 += lightmap[ 4] * scale;b01 += lightmap[ 5] * scale;
1045 r10 += lightmap[line3+0] * scale;g10 += lightmap[line3+1] * scale;b10 += lightmap[line3+2] * scale;
1046 r11 += lightmap[line3+3] * scale;g11 += lightmap[line3+4] * scale;b11 += lightmap[line3+5] * scale;
1051 LordHavoc: here's the readable version of the interpolation
1052 code, not quite as easy for the compiler to optimize...
1054 dsfrac is the X position in the lightmap pixel, * 16
1055 dtfrac is the Y position in the lightmap pixel, * 16
1056 r00 is top left corner, r01 is top right corner
1057 r10 is bottom left corner, r11 is bottom right corner
1058 g and b are the same layout.
1059 r0 and r1 are the top and bottom intermediate results
1061 first we interpolate the top two points, to get the top
1064 r0 = (((r01-r00) * dsfrac) >> 4) + r00;
1065 g0 = (((g01-g00) * dsfrac) >> 4) + g00;
1066 b0 = (((b01-b00) * dsfrac) >> 4) + b00;
1068 then we interpolate the bottom two points, to get the
1071 r1 = (((r11-r10) * dsfrac) >> 4) + r10;
1072 g1 = (((g11-g10) * dsfrac) >> 4) + g10;
1073 b1 = (((b11-b10) * dsfrac) >> 4) + b10;
1075 then we interpolate the top and bottom samples to get the
1076 middle sample (the one which was requested)
1078 r = (((r1-r0) * dtfrac) >> 4) + r0;
1079 g = (((g1-g0) * dtfrac) >> 4) + g0;
1080 b = (((b1-b0) * dtfrac) >> 4) + b0;
1083 ambientcolor[0] += (float) ((((((((r11-r10) * dsfrac) >> 4) + r10)-((((r01-r00) * dsfrac) >> 4) + r00)) * dtfrac) >> 4) + ((((r01-r00) * dsfrac) >> 4) + r00)) * (1.0f / 32768.0f);
1084 ambientcolor[1] += (float) ((((((((g11-g10) * dsfrac) >> 4) + g10)-((((g01-g00) * dsfrac) >> 4) + g00)) * dtfrac) >> 4) + ((((g01-g00) * dsfrac) >> 4) + g00)) * (1.0f / 32768.0f);
1085 ambientcolor[2] += (float) ((((((((b11-b10) * dsfrac) >> 4) + b10)-((((b01-b00) * dsfrac) >> 4) + b00)) * dtfrac) >> 4) + ((((b01-b00) * dsfrac) >> 4) + b00)) * (1.0f / 32768.0f);
1086 return true; // success
1091 // go down back side
1092 node = node->children[side ^ 1];
1094 distz = endz - startz;
1099 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1101 Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode, p[0], p[1], p[2], p[2] - 65536);
1102 VectorSet(diffusenormal, 0, 0, -1);
1105 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1108 unsigned char *outstart = out;
1109 while (out < outend)
1113 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
1123 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun (during zero-run) on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
1126 for (c = *in++;c > 0;c--)
1130 Con_Printf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
1141 R_Q1BSP_LoadSplitSky
1143 A sky texture is 256*128, with the right side being a masked overlay
1146 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1149 unsigned solidpixels[128*128], alphapixels[128*128];
1151 // if sky isn't the right size, just use it as a solid layer
1152 if (width != 256 || height != 128)
1154 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", width, height, src, bytesperpixel == 4 ? TEXTYPE_RGBA : TEXTYPE_PALETTE, TEXF_PRECACHE, bytesperpixel == 1 ? palette_complete : NULL);
1155 loadmodel->brush.alphaskytexture = NULL;
1159 if (bytesperpixel == 4)
1161 for (i = 0;i < 128;i++)
1163 for (j = 0;j < 128;j++)
1165 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1166 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1172 // make an average value for the back to avoid
1173 // a fringe on the top level
1182 for (i = 0;i < 128;i++)
1184 for (j = 0;j < 128;j++)
1186 rgba.i = palette_complete[src[i*256 + j + 128]];
1192 rgba.b[0] = r/(128*128);
1193 rgba.b[1] = g/(128*128);
1194 rgba.b[2] = b/(128*128);
1196 for (i = 0;i < 128;i++)
1198 for (j = 0;j < 128;j++)
1200 solidpixels[(i*128) + j] = palette_complete[src[i*256 + j + 128]];
1201 alphapixels[(i*128) + j] = (p = src[i*256 + j]) ? palette_complete[p] : rgba.i;
1206 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_RGBA, TEXF_PRECACHE, NULL);
1207 loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_RGBA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1210 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1212 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1214 texture_t *tx, *tx2, *anims[10], *altanims[10];
1216 unsigned char *data, *mtdata;
1217 char name[MAX_QPATH];
1219 loadmodel->data_textures = NULL;
1221 // add two slots for notexture walls and notexture liquids
1224 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1225 m->nummiptex = LittleLong (m->nummiptex);
1226 loadmodel->num_textures = m->nummiptex + 2;
1231 loadmodel->num_textures = 2;
1234 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1236 // fill out all slots with notexture
1237 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1239 strcpy(tx->name, "NO TEXTURE FOUND");
1242 tx->skin.base = r_texture_notexture;
1243 tx->basematerialflags = 0;
1244 if (i == loadmodel->num_textures - 1)
1246 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES;
1247 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1248 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1252 tx->basematerialflags |= MATERIALFLAG_WALL;
1253 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1254 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1256 tx->currentframe = tx;
1262 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1264 // LordHavoc: mostly rewritten map texture loader
1265 for (i = 0;i < m->nummiptex;i++)
1267 dofs[i] = LittleLong(dofs[i]);
1268 if (dofs[i] == -1 || r_nosurftextures.integer)
1270 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1272 // make sure name is no more than 15 characters
1273 for (j = 0;dmiptex->name[j] && j < 15;j++)
1274 name[j] = dmiptex->name[j];
1277 mtwidth = LittleLong(dmiptex->width);
1278 mtheight = LittleLong(dmiptex->height);
1280 j = LittleLong(dmiptex->offsets[0]);
1284 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1286 Con_Printf("Texture \"%s\" in \"%s\"is corrupt or incomplete\n", dmiptex->name, loadmodel->name);
1289 mtdata = (unsigned char *)dmiptex + j;
1292 if ((mtwidth & 15) || (mtheight & 15))
1293 Con_Printf("warning: texture \"%s\" in \"%s\" is not 16 aligned\n", dmiptex->name, loadmodel->name);
1295 // LordHavoc: force all names to lowercase
1296 for (j = 0;name[j];j++)
1297 if (name[j] >= 'A' && name[j] <= 'Z')
1298 name[j] += 'a' - 'A';
1300 tx = loadmodel->data_textures + i;
1301 strcpy(tx->name, name);
1302 tx->width = mtwidth;
1303 tx->height = mtheight;
1307 sprintf(tx->name, "unnamed%i", i);
1308 Con_Printf("warning: unnamed texture in %s, renaming to %s\n", loadmodel->name, tx->name);
1311 if (cls.state != ca_dedicated)
1313 // LordHavoc: HL sky textures are entirely different than quake
1314 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1316 if (loadmodel->isworldmodel)
1318 data = loadimagepixels(tx->name, false, 0, 0);
1321 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1324 else if (mtdata != NULL)
1325 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1330 if (!Mod_LoadSkinFrame(&tx->skin, gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, true))
1332 // did not find external texture, load it from the bsp or wad3
1333 if (loadmodel->brush.ishlbsp)
1335 // internal texture overrides wad
1336 unsigned char *pixels, *freepixels;
1337 pixels = freepixels = NULL;
1339 pixels = W_ConvertWAD3Texture(dmiptex);
1341 pixels = freepixels = W_GetTexture(tx->name);
1344 tx->width = image_width;
1345 tx->height = image_height;
1346 Mod_LoadSkinFrame_Internal(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP, false, false, pixels, image_width, image_height, 32, NULL, NULL);
1349 Mem_Free(freepixels);
1351 else if (mtdata) // texture included
1352 Mod_LoadSkinFrame_Internal(&tx->skin, tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_PICMIP, false, r_fullbrights.integer, mtdata, tx->width, tx->height, 8, NULL, NULL);
1355 if (tx->skin.base == NULL)
1360 tx->skin.base = r_texture_notexture;
1364 tx->basematerialflags = 0;
1365 if (tx->name[0] == '*')
1367 // LordHavoc: some turbulent textures should not be affected by wateralpha
1368 if (strncmp(tx->name,"*lava",5)
1369 && strncmp(tx->name,"*teleport",9)
1370 && strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1371 tx->basematerialflags |= MATERIALFLAG_WATERALPHA;
1372 if (!strncmp(tx->name, "*lava", 5))
1374 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1375 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1377 else if (!strncmp(tx->name, "*slime", 6))
1379 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1380 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1384 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1385 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1387 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES;
1389 else if (tx->name[0] == 's' && tx->name[1] == 'k' && tx->name[2] == 'y')
1391 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1392 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1393 tx->basematerialflags |= MATERIALFLAG_SKY;
1397 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1398 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1399 tx->basematerialflags |= MATERIALFLAG_WALL;
1402 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
1404 // start out with no animation
1405 tx->currentframe = tx;
1408 // sequence the animations
1409 for (i = 0;i < m->nummiptex;i++)
1411 tx = loadmodel->data_textures + i;
1412 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1414 if (tx->anim_total[0] || tx->anim_total[1])
1415 continue; // already sequenced
1417 // find the number of frames in the animation
1418 memset(anims, 0, sizeof(anims));
1419 memset(altanims, 0, sizeof(altanims));
1421 for (j = i;j < m->nummiptex;j++)
1423 tx2 = loadmodel->data_textures + j;
1424 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1428 if (num >= '0' && num <= '9')
1429 anims[num - '0'] = tx2;
1430 else if (num >= 'a' && num <= 'j')
1431 altanims[num - 'a'] = tx2;
1433 Con_Printf("Bad animating texture %s\n", tx->name);
1437 for (j = 0;j < 10;j++)
1444 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1447 for (j = 0;j < max;j++)
1451 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1455 for (j = 0;j < altmax;j++)
1459 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1468 // if there is no alternate animation, duplicate the primary
1469 // animation into the alternate
1471 for (k = 0;k < 10;k++)
1472 altanims[k] = anims[k];
1475 // link together the primary animation
1476 for (j = 0;j < max;j++)
1479 tx2->animated = true;
1480 tx2->anim_total[0] = max;
1481 tx2->anim_total[1] = altmax;
1482 for (k = 0;k < 10;k++)
1484 tx2->anim_frames[0][k] = anims[k];
1485 tx2->anim_frames[1][k] = altanims[k];
1489 // if there really is an alternate anim...
1490 if (anims[0] != altanims[0])
1492 // link together the alternate animation
1493 for (j = 0;j < altmax;j++)
1496 tx2->animated = true;
1497 // the primary/alternate are reversed here
1498 tx2->anim_total[0] = altmax;
1499 tx2->anim_total[1] = max;
1500 for (k = 0;k < 10;k++)
1502 tx2->anim_frames[0][k] = altanims[k];
1503 tx2->anim_frames[1][k] = anims[k];
1510 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1513 unsigned char *in, *out, *data, d;
1514 char litfilename[1024];
1515 fs_offset_t filesize;
1516 loadmodel->brushq1.lightdata = NULL;
1517 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1519 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1520 for (i=0; i<l->filelen; i++)
1521 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1523 else if (loadmodel->brush.ismcbsp)
1525 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1526 memcpy(loadmodel->brushq1.lightdata, mod_base + l->fileofs, l->filelen);
1528 else // LordHavoc: bsp version 29 (normal white lighting)
1530 // LordHavoc: hope is not lost yet, check for a .lit file to load
1531 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1532 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1533 strlcat (litfilename, ".lit", sizeof (litfilename));
1534 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1537 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1539 i = LittleLong(((int *)data)[1]);
1542 Con_DPrintf("loaded %s\n", litfilename);
1543 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1544 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1550 Con_Printf("Unknown .lit file version (%d)\n", i);
1557 Con_Print("Empty .lit file, ignoring\n");
1559 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", filesize, 8 + l->filelen * 3);
1563 // LordHavoc: oh well, expand the white lighting data
1566 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1567 in = loadmodel->brushq1.lightdata + l->filelen*2; // place the file at the end, so it will not be overwritten until the very last write
1568 out = loadmodel->brushq1.lightdata;
1569 memcpy(in, mod_base + l->fileofs, l->filelen);
1570 for (i = 0;i < l->filelen;i++)
1580 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1582 loadmodel->brushq1.num_compressedpvs = 0;
1583 loadmodel->brushq1.data_compressedpvs = NULL;
1586 loadmodel->brushq1.num_compressedpvs = l->filelen;
1587 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1588 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1591 // used only for HalfLife maps
1592 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1594 char key[128], value[4096];
1599 if (!COM_ParseToken(&data, false))
1601 if (com_token[0] != '{')
1605 if (!COM_ParseToken(&data, false))
1607 if (com_token[0] == '}')
1608 break; // end of worldspawn
1609 if (com_token[0] == '_')
1610 strcpy(key, com_token + 1);
1612 strcpy(key, com_token);
1613 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1614 key[strlen(key)-1] = 0;
1615 if (!COM_ParseToken(&data, false))
1617 dpsnprintf(value, sizeof(value), "%s", com_token);
1618 if (!strcmp("wad", key)) // for HalfLife maps
1620 if (loadmodel->brush.ishlbsp)
1623 for (i = 0;i < (int)sizeof(value);i++)
1624 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1628 for (;i < (int)sizeof(value);i++)
1630 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1631 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1633 else if (value[i] == ';' || value[i] == 0)
1637 strcpy(wadname, "textures/");
1638 strcat(wadname, &value[j]);
1639 W_LoadTextureWadFile(wadname, false);
1651 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1653 loadmodel->brush.entities = NULL;
1656 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1657 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1658 if (loadmodel->brush.ishlbsp)
1659 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1663 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1669 in = (dvertex_t *)(mod_base + l->fileofs);
1670 if (l->filelen % sizeof(*in))
1671 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1672 count = l->filelen / sizeof(*in);
1673 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1675 loadmodel->brushq1.vertexes = out;
1676 loadmodel->brushq1.numvertexes = count;
1678 for ( i=0 ; i<count ; i++, in++, out++)
1680 out->position[0] = LittleFloat(in->point[0]);
1681 out->position[1] = LittleFloat(in->point[1]);
1682 out->position[2] = LittleFloat(in->point[2]);
1686 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1687 // can be used for this
1689 int SB_ReadInt (unsigned char **buffer)
1692 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1698 float SB_ReadFloat (unsigned char **buffer)
1706 u.i = SB_ReadInt (buffer);
1710 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1712 unsigned char *index;
1716 index = (unsigned char *)(mod_base + l->fileofs);
1717 if (l->filelen % (48+4*hullinfo->filehulls))
1718 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1720 count = l->filelen / (48+4*hullinfo->filehulls);
1721 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1723 loadmodel->brushq1.submodels = out;
1724 loadmodel->brush.numsubmodels = count;
1726 for (i = 0; i < count; i++, out++)
1728 // spread out the mins / maxs by a pixel
1729 out->mins[0] = SB_ReadFloat (&index) - 1;
1730 out->mins[1] = SB_ReadFloat (&index) - 1;
1731 out->mins[2] = SB_ReadFloat (&index) - 1;
1732 out->maxs[0] = SB_ReadFloat (&index) + 1;
1733 out->maxs[1] = SB_ReadFloat (&index) + 1;
1734 out->maxs[2] = SB_ReadFloat (&index) + 1;
1735 out->origin[0] = SB_ReadFloat (&index);
1736 out->origin[1] = SB_ReadFloat (&index);
1737 out->origin[2] = SB_ReadFloat (&index);
1738 for (j = 0; j < hullinfo->filehulls; j++)
1739 out->headnode[j] = SB_ReadInt (&index);
1740 out->visleafs = SB_ReadInt (&index);
1741 out->firstface = SB_ReadInt (&index);
1742 out->numfaces = SB_ReadInt (&index);
1746 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1752 in = (dedge_t *)(mod_base + l->fileofs);
1753 if (l->filelen % sizeof(*in))
1754 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1755 count = l->filelen / sizeof(*in);
1756 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1758 loadmodel->brushq1.edges = out;
1759 loadmodel->brushq1.numedges = count;
1761 for ( i=0 ; i<count ; i++, in++, out++)
1763 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1764 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1765 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1767 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);
1774 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1778 int i, j, k, count, miptex;
1780 in = (texinfo_t *)(mod_base + l->fileofs);
1781 if (l->filelen % sizeof(*in))
1782 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1783 count = l->filelen / sizeof(*in);
1784 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1786 loadmodel->brushq1.texinfo = out;
1787 loadmodel->brushq1.numtexinfo = count;
1789 for (i = 0;i < count;i++, in++, out++)
1791 for (k = 0;k < 2;k++)
1792 for (j = 0;j < 4;j++)
1793 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1795 miptex = LittleLong(in->miptex);
1796 out->flags = LittleLong(in->flags);
1798 out->texture = NULL;
1799 if (loadmodel->data_textures)
1801 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1802 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1804 out->texture = loadmodel->data_textures + miptex;
1806 if (out->flags & TEX_SPECIAL)
1808 // if texture chosen is NULL or the shader needs a lightmap,
1809 // force to notexture water shader
1810 if (out->texture == NULL || out->texture->basematerialflags & MATERIALFLAG_WALL)
1811 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1815 // if texture chosen is NULL, force to notexture
1816 if (out->texture == NULL)
1817 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1823 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1828 mins[0] = mins[1] = mins[2] = 9999;
1829 maxs[0] = maxs[1] = maxs[2] = -9999;
1831 for (i = 0;i < numverts;i++)
1833 for (j = 0;j < 3;j++, v++)
1843 #define MAX_SUBDIVPOLYTRIANGLES 4096
1844 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
1846 static int subdivpolyverts, subdivpolytriangles;
1847 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
1848 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
1850 static int subdivpolylookupvert(vec3_t v)
1853 for (i = 0;i < subdivpolyverts;i++)
1854 if (subdivpolyvert[i][0] == v[0]
1855 && subdivpolyvert[i][1] == v[1]
1856 && subdivpolyvert[i][2] == v[2])
1858 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
1859 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
1860 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
1861 return subdivpolyverts++;
1864 static void SubdividePolygon(int numverts, float *verts)
1866 int i, i1, i2, i3, f, b, c, p;
1867 vec3_t mins, maxs, front[256], back[256];
1868 float m, *pv, *cv, dist[256], frac;
1871 Host_Error("SubdividePolygon: ran out of verts in buffer");
1873 BoundPoly(numverts, verts, mins, maxs);
1875 for (i = 0;i < 3;i++)
1877 m = (mins[i] + maxs[i]) * 0.5;
1878 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
1879 if (maxs[i] - m < 8)
1881 if (m - mins[i] < 8)
1885 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
1886 dist[c] = cv[i] - m;
1889 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
1893 VectorCopy(pv, front[f]);
1898 VectorCopy(pv, back[b]);
1901 if (dist[p] == 0 || dist[c] == 0)
1903 if ((dist[p] > 0) != (dist[c] > 0) )
1906 frac = dist[p] / (dist[p] - dist[c]);
1907 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
1908 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
1909 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
1915 SubdividePolygon(f, front[0]);
1916 SubdividePolygon(b, back[0]);
1920 i1 = subdivpolylookupvert(verts);
1921 i2 = subdivpolylookupvert(verts + 3);
1922 for (i = 2;i < numverts;i++)
1924 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
1926 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
1930 i3 = subdivpolylookupvert(verts + i * 3);
1931 subdivpolyindex[subdivpolytriangles][0] = i1;
1932 subdivpolyindex[subdivpolytriangles][1] = i2;
1933 subdivpolyindex[subdivpolytriangles][2] = i3;
1935 subdivpolytriangles++;
1939 //Breaks a polygon up along axial 64 unit
1940 //boundaries so that turbulent and sky warps
1941 //can be done reasonably.
1942 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
1948 subdivpolytriangles = 0;
1949 subdivpolyverts = 0;
1950 SubdividePolygon(surface->num_vertices, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex));
1951 if (subdivpolytriangles < 1)
1952 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
1954 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
1955 mesh->num_vertices = subdivpolyverts;
1956 mesh->num_triangles = subdivpolytriangles;
1957 mesh->vertex = (surfvertex_t *)(mesh + 1);
1958 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
1959 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
1961 for (i = 0;i < mesh->num_triangles;i++)
1962 for (j = 0;j < 3;j++)
1963 mesh->index[i*3+j] = subdivpolyindex[i][j];
1965 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
1967 VectorCopy(subdivpolyvert[i], v->v);
1968 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
1969 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
1974 static qboolean Mod_Q1BSP_AllocLightmapBlock(int *lineused, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
1977 int bestx = totalwidth, besty = 0;
1978 // find the left-most space we can find
1979 for (y = 0;y <= totalheight - blockheight;y++)
1982 for (y2 = 0;y2 < blockheight;y2++)
1983 x2 = max(x2, lineused[y+y2]);
1990 // if the best was not good enough, return failure
1991 if (bestx > totalwidth - blockwidth)
1993 // we found a good spot
1998 // now mark the space used
1999 for (y2 = 0;y2 < blockheight;y2++)
2000 lineused[besty+y2] = bestx + blockwidth;
2005 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2008 msurface_t *surface;
2009 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber;
2010 float texmins[2], texmaxs[2], val, lightmaptexcoordscale;
2011 #define LIGHTMAPSIZE 256
2012 rtexture_t *lightmaptexture;
2013 int lightmap_lineused[LIGHTMAPSIZE];
2015 in = (dface_t *)(mod_base + l->fileofs);
2016 if (l->filelen % sizeof(*in))
2017 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2018 count = l->filelen / sizeof(*in);
2019 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2020 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2022 loadmodel->num_surfaces = count;
2026 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2028 numedges = LittleShort(in->numedges);
2029 totalverts += numedges;
2030 totaltris += numedges - 2;
2033 // TODO: split up into multiple meshes as needed to avoid exceeding 65536
2035 loadmodel->nummeshes = 1;
2036 loadmodel->meshlist = (surfmesh_t **)Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *));
2037 loadmodel->meshlist[0] = Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2039 lightmaptexture = NULL;
2041 lightmaptexcoordscale = 1.0f / (float)LIGHTMAPSIZE;
2045 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2047 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2049 // FIXME: validate edges, texinfo, etc?
2050 firstedge = LittleLong(in->firstedge);
2051 numedges = LittleShort(in->numedges);
2052 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)
2053 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2054 i = LittleShort(in->texinfo);
2055 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2056 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2057 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2058 surface->texture = surface->lightmapinfo->texinfo->texture;
2060 planenum = LittleShort(in->planenum);
2061 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2062 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2064 //surface->flags = surface->texture->flags;
2065 //if (LittleShort(in->side))
2066 // surface->flags |= SURF_PLANEBACK;
2067 //surface->plane = loadmodel->brush.data_planes + planenum;
2069 surface->groupmesh = loadmodel->meshlist[0];
2070 surface->num_firstvertex = totalverts;
2071 surface->num_vertices = numedges;
2072 surface->num_firsttriangle = totaltris;
2073 surface->num_triangles = numedges - 2;
2074 totalverts += numedges;
2075 totaltris += numedges - 2;
2077 // convert edges back to a normal polygon
2078 for (i = 0;i < surface->num_vertices;i++)
2080 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2083 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2085 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2086 s = DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2087 t = DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2088 (surface->groupmesh->data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2089 (surface->groupmesh->data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2090 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2091 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2092 (surface->groupmesh->data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2095 for (i = 0;i < surface->num_triangles;i++)
2097 (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2098 (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2099 (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2102 // compile additional data about the surface geometry
2103 Mod_BuildTextureVectorsAndNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, surface->groupmesh->data_vertex3f, surface->groupmesh->data_texcoordtexture2f, (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle), surface->groupmesh->data_svector3f, surface->groupmesh->data_tvector3f, surface->groupmesh->data_normal3f, true);
2104 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex));
2106 // generate surface extents information
2107 texmins[0] = texmaxs[0] = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2108 texmins[1] = texmaxs[1] = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2109 for (i = 1;i < surface->num_vertices;i++)
2111 for (j = 0;j < 2;j++)
2113 val = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2114 texmins[j] = min(texmins[j], val);
2115 texmaxs[j] = max(texmaxs[j], val);
2118 for (i = 0;i < 2;i++)
2120 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2121 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2124 smax = surface->lightmapinfo->extents[0] >> 4;
2125 tmax = surface->lightmapinfo->extents[1] >> 4;
2126 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2127 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2130 for (i = 0;i < MAXLIGHTMAPS;i++)
2131 surface->lightmapinfo->styles[i] = in->styles[i];
2132 surface->lightmaptexture = NULL;
2133 surface->deluxemaptexture = r_texture_blanknormalmap;
2134 i = LittleLong(in->lightofs);
2137 surface->lightmapinfo->samples = NULL;
2138 // give non-lightmapped water a 1x white lightmap
2139 if ((surface->texture->basematerialflags & MATERIALFLAG_WATER) && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2141 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2142 surface->lightmapinfo->styles[0] = 0;
2143 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2146 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2147 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2148 else // LordHavoc: white lighting (bsp version 29)
2149 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2151 // check if we should apply a lightmap to this
2152 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2154 int i, iu, iv, lightmapx, lightmapy;
2155 float u, v, ubase, vbase, uscale, vscale;
2157 if (ssize > 256 || tsize > 256)
2158 Host_Error("Bad surface extents");
2159 // force lightmap upload on first time seeing the surface
2160 surface->cached_dlight = true;
2161 // stainmap for permanent marks on walls
2162 surface->lightmapinfo->stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2164 memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
2166 // find a place for this lightmap
2167 if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(lightmap_lineused, LIGHTMAPSIZE, LIGHTMAPSIZE, ssize, tsize, &lightmapx, &lightmapy))
2169 // could not find room, make a new lightmap
2170 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber++), LIGHTMAPSIZE, LIGHTMAPSIZE, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2171 memset(lightmap_lineused, 0, sizeof(lightmap_lineused));
2172 Mod_Q1BSP_AllocLightmapBlock(lightmap_lineused, LIGHTMAPSIZE, LIGHTMAPSIZE, ssize, tsize, &lightmapx, &lightmapy);
2175 surface->lightmaptexture = lightmaptexture;
2176 surface->deluxemaptexture = r_texture_blanknormalmap;
2177 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2178 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2180 ubase = lightmapx * lightmaptexcoordscale;
2181 vbase = lightmapy * lightmaptexcoordscale;
2182 uscale = lightmaptexcoordscale;
2183 vscale = lightmaptexcoordscale;
2185 for (i = 0;i < surface->num_vertices;i++)
2187 u = ((DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3]) + 8 - surface->lightmapinfo->texturemins[0]) * (1.0 / 16.0);
2188 v = ((DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3]) + 8 - surface->lightmapinfo->texturemins[1]) * (1.0 / 16.0);
2189 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2190 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2191 // LordHavoc: calc lightmap data offset for vertex lighting to use
2194 (surface->groupmesh->data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2200 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2203 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2204 node->parent = parent;
2207 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2208 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2212 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2218 in = (dnode_t *)(mod_base + l->fileofs);
2219 if (l->filelen % sizeof(*in))
2220 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2221 count = l->filelen / sizeof(*in);
2222 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2224 loadmodel->brush.data_nodes = out;
2225 loadmodel->brush.num_nodes = count;
2227 for ( i=0 ; i<count ; i++, in++, out++)
2229 for (j=0 ; j<3 ; j++)
2231 out->mins[j] = LittleShort(in->mins[j]);
2232 out->maxs[j] = LittleShort(in->maxs[j]);
2235 p = LittleLong(in->planenum);
2236 out->plane = loadmodel->brush.data_planes + p;
2238 out->firstsurface = LittleShort(in->firstface);
2239 out->numsurfaces = LittleShort(in->numfaces);
2241 for (j=0 ; j<2 ; j++)
2243 p = LittleShort(in->children[j]);
2245 out->children[j] = loadmodel->brush.data_nodes + p;
2247 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + (-1 - p));
2251 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2254 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2260 in = (dleaf_t *)(mod_base + l->fileofs);
2261 if (l->filelen % sizeof(*in))
2262 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2263 count = l->filelen / sizeof(*in);
2264 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2266 loadmodel->brush.data_leafs = out;
2267 loadmodel->brush.num_leafs = count;
2268 // get visleafs from the submodel data
2269 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2270 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2271 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2272 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2274 for ( i=0 ; i<count ; i++, in++, out++)
2276 for (j=0 ; j<3 ; j++)
2278 out->mins[j] = LittleShort(in->mins[j]);
2279 out->maxs[j] = LittleShort(in->maxs[j]);
2282 // FIXME: this function could really benefit from some error checking
2284 out->contents = LittleLong(in->contents);
2286 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + LittleShort(in->firstmarksurface);
2287 out->numleafsurfaces = LittleShort(in->nummarksurfaces);
2288 if (out->firstleafsurface < 0 || LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2290 Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", out->firstleafsurface, out->firstleafsurface + out->numleafsurfaces, 0, loadmodel->brush.num_leafsurfaces);
2291 out->firstleafsurface = NULL;
2292 out->numleafsurfaces = 0;
2295 out->clusterindex = i - 1;
2296 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2297 out->clusterindex = -1;
2299 p = LittleLong(in->visofs);
2300 // ignore visofs errors on leaf 0 (solid)
2301 if (p >= 0 && out->clusterindex >= 0)
2303 if (p >= loadmodel->brushq1.num_compressedpvs)
2304 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2306 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);
2309 for (j = 0;j < 4;j++)
2310 out->ambient_sound_level[j] = in->ambient_level[j];
2312 // FIXME: Insert caustics here
2316 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2318 dclipnode_t *in, *out;
2322 in = (dclipnode_t *)(mod_base + l->fileofs);
2323 if (l->filelen % sizeof(*in))
2324 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2325 count = l->filelen / sizeof(*in);
2326 out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2328 loadmodel->brushq1.clipnodes = out;
2329 loadmodel->brushq1.numclipnodes = count;
2331 for (i = 1; i < hullinfo->numhulls; i++)
2333 hull = &loadmodel->brushq1.hulls[i];
2334 hull->clipnodes = out;
2335 hull->firstclipnode = 0;
2336 hull->lastclipnode = count-1;
2337 hull->planes = loadmodel->brush.data_planes;
2338 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2339 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2340 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2341 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2342 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2343 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2344 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2347 for (i=0 ; i<count ; i++, out++, in++)
2349 out->planenum = LittleLong(in->planenum);
2350 out->children[0] = LittleShort(in->children[0]);
2351 out->children[1] = LittleShort(in->children[1]);
2352 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2353 Host_Error("Corrupt clipping hull(out of range planenum)");
2354 if (out->children[0] >= count || out->children[1] >= count)
2355 Host_Error("Corrupt clipping hull(out of range child)");
2359 //Duplicate the drawing hull structure as a clipping hull
2360 static void Mod_Q1BSP_MakeHull0(void)
2367 hull = &loadmodel->brushq1.hulls[0];
2369 in = loadmodel->brush.data_nodes;
2370 out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(dclipnode_t));
2372 hull->clipnodes = out;
2373 hull->firstclipnode = 0;
2374 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2375 hull->planes = loadmodel->brush.data_planes;
2377 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2379 out->planenum = in->plane - loadmodel->brush.data_planes;
2380 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2381 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2385 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2390 in = (short *)(mod_base + l->fileofs);
2391 if (l->filelen % sizeof(*in))
2392 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2393 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2394 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2396 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2398 j = (unsigned) LittleShort(in[i]);
2399 if (j >= loadmodel->num_surfaces)
2400 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2401 loadmodel->brush.data_leafsurfaces[i] = j;
2405 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2410 in = (int *)(mod_base + l->fileofs);
2411 if (l->filelen % sizeof(*in))
2412 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2413 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2414 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2416 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2417 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2421 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2427 in = (dplane_t *)(mod_base + l->fileofs);
2428 if (l->filelen % sizeof(*in))
2429 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2431 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2432 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2434 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2436 out->normal[0] = LittleFloat(in->normal[0]);
2437 out->normal[1] = LittleFloat(in->normal[1]);
2438 out->normal[2] = LittleFloat(in->normal[2]);
2439 out->dist = LittleFloat(in->dist);
2445 static void Mod_Q1BSP_LoadMapBrushes(void)
2449 int submodel, numbrushes;
2450 qboolean firstbrush;
2451 char *text, *maptext;
2452 char mapfilename[MAX_QPATH];
2453 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2454 strlcat (mapfilename, ".map", sizeof (mapfilename));
2455 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2459 if (!COM_ParseToken(&data, false))
2464 if (!COM_ParseToken(&data, false))
2466 if (com_token[0] != '{')
2472 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2475 if (!COM_ParseToken(&data, false))
2477 if (com_token[0] == '}')
2478 break; // end of entity
2479 if (com_token[0] == '{')
2486 if (submodel > loadmodel->brush.numsubmodels)
2488 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2492 model = loadmodel->brush.submodels[submodel];
2499 if (!COM_ParseToken(&data, false))
2501 if (com_token[0] == '}')
2502 break; // end of brush
2503 // each brush face should be this format:
2504 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2505 // FIXME: support hl .map format
2506 for (pointnum = 0;pointnum < 3;pointnum++)
2508 COM_ParseToken(&data, false);
2509 for (componentnum = 0;componentnum < 3;componentnum++)
2511 COM_ParseToken(&data, false);
2512 point[pointnum][componentnum] = atof(com_token);
2514 COM_ParseToken(&data, false);
2516 COM_ParseToken(&data, false);
2517 strlcpy(facetexture, com_token, sizeof(facetexture));
2518 COM_ParseToken(&data, false);
2519 //scroll_s = atof(com_token);
2520 COM_ParseToken(&data, false);
2521 //scroll_t = atof(com_token);
2522 COM_ParseToken(&data, false);
2523 //rotate = atof(com_token);
2524 COM_ParseToken(&data, false);
2525 //scale_s = atof(com_token);
2526 COM_ParseToken(&data, false);
2527 //scale_t = atof(com_token);
2528 TriangleNormal(point[0], point[1], point[2], planenormal);
2529 VectorNormalizeDouble(planenormal);
2530 planedist = DotProduct(point[0], planenormal);
2531 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2541 #define MAX_PORTALPOINTS 64
2543 typedef struct portal_s
2546 mnode_t *nodes[2]; // [0] = front side of plane
2547 struct portal_s *next[2];
2549 double points[3*MAX_PORTALPOINTS];
2550 struct portal_s *chain; // all portals are linked into a list
2554 static portal_t *portalchain;
2561 static portal_t *AllocPortal(void)
2564 p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2565 p->chain = portalchain;
2570 static void FreePortal(portal_t *p)
2575 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2577 // process only nodes (leafs already had their box calculated)
2581 // calculate children first
2582 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2583 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2585 // make combined bounding box from children
2586 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2587 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2588 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2589 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2590 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2591 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2594 static void Mod_Q1BSP_FinalizePortals(void)
2596 int i, j, numportals, numpoints;
2597 portal_t *p, *pnext;
2600 mleaf_t *leaf, *endleaf;
2602 // tally up portal and point counts and recalculate bounding boxes for all
2603 // leafs (because qbsp is very sloppy)
2604 leaf = loadmodel->brush.data_leafs;
2605 endleaf = leaf + loadmodel->brush.num_leafs;
2606 for (;leaf < endleaf;leaf++)
2608 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2609 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2616 // note: this check must match the one below or it will usually corrupt memory
2617 // 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
2618 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2621 numpoints += p->numpoints * 2;
2625 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2626 loadmodel->brush.num_portals = numportals;
2627 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2628 loadmodel->brush.num_portalpoints = numpoints;
2629 // clear all leaf portal chains
2630 for (i = 0;i < loadmodel->brush.num_leafs;i++)
2631 loadmodel->brush.data_leafs[i].portals = NULL;
2632 // process all portals in the global portal chain, while freeing them
2633 portal = loadmodel->brush.data_portals;
2634 point = loadmodel->brush.data_portalpoints;
2641 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2643 // note: this check must match the one above or it will usually corrupt memory
2644 // 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
2645 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2647 // first make the back to front portal(forward portal)
2648 portal->points = point;
2649 portal->numpoints = p->numpoints;
2650 portal->plane.dist = p->plane.dist;
2651 VectorCopy(p->plane.normal, portal->plane.normal);
2652 portal->here = (mleaf_t *)p->nodes[1];
2653 portal->past = (mleaf_t *)p->nodes[0];
2655 for (j = 0;j < portal->numpoints;j++)
2657 VectorCopy(p->points + j*3, point->position);
2660 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2661 PlaneClassify(&portal->plane);
2663 // link into leaf's portal chain
2664 portal->next = portal->here->portals;
2665 portal->here->portals = portal;
2667 // advance to next portal
2670 // then make the front to back portal(backward portal)
2671 portal->points = point;
2672 portal->numpoints = p->numpoints;
2673 portal->plane.dist = -p->plane.dist;
2674 VectorNegate(p->plane.normal, portal->plane.normal);
2675 portal->here = (mleaf_t *)p->nodes[0];
2676 portal->past = (mleaf_t *)p->nodes[1];
2678 for (j = portal->numpoints - 1;j >= 0;j--)
2680 VectorCopy(p->points + j*3, point->position);
2683 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2684 PlaneClassify(&portal->plane);
2686 // link into leaf's portal chain
2687 portal->next = portal->here->portals;
2688 portal->here->portals = portal;
2690 // advance to next portal
2693 // add the portal's polygon points to the leaf bounding boxes
2694 for (i = 0;i < 2;i++)
2696 leaf = (mleaf_t *)p->nodes[i];
2697 for (j = 0;j < p->numpoints;j++)
2699 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
2700 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
2701 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
2702 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
2703 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
2704 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
2711 // now recalculate the node bounding boxes from the leafs
2712 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
2720 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2723 Host_Error("AddPortalToNodes: NULL front node");
2725 Host_Error("AddPortalToNodes: NULL back node");
2726 if (p->nodes[0] || p->nodes[1])
2727 Host_Error("AddPortalToNodes: already included");
2728 // 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
2730 p->nodes[0] = front;
2731 p->next[0] = (portal_t *)front->portals;
2732 front->portals = (mportal_t *)p;
2735 p->next[1] = (portal_t *)back->portals;
2736 back->portals = (mportal_t *)p;
2741 RemovePortalFromNode
2744 static void RemovePortalFromNodes(portal_t *portal)
2748 void **portalpointer;
2750 for (i = 0;i < 2;i++)
2752 node = portal->nodes[i];
2754 portalpointer = (void **) &node->portals;
2757 t = (portal_t *)*portalpointer;
2759 Host_Error("RemovePortalFromNodes: portal not in leaf");
2763 if (portal->nodes[0] == node)
2765 *portalpointer = portal->next[0];
2766 portal->nodes[0] = NULL;
2768 else if (portal->nodes[1] == node)
2770 *portalpointer = portal->next[1];
2771 portal->nodes[1] = NULL;
2774 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2778 if (t->nodes[0] == node)
2779 portalpointer = (void **) &t->next[0];
2780 else if (t->nodes[1] == node)
2781 portalpointer = (void **) &t->next[1];
2783 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2788 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
2791 mnode_t *front, *back, *other_node;
2792 mplane_t clipplane, *plane;
2793 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
2794 int numfrontpoints, numbackpoints;
2795 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
2797 // if a leaf, we're done
2801 plane = node->plane;
2803 front = node->children[0];
2804 back = node->children[1];
2806 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
2808 // create the new portal by generating a polygon for the node plane,
2809 // and clipping it by all of the other portals(which came from nodes above this one)
2810 nodeportal = AllocPortal();
2811 nodeportal->plane = *plane;
2813 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);
2814 nodeportal->numpoints = 4;
2815 side = 0; // shut up compiler warning
2816 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
2818 clipplane = portal->plane;
2819 if (portal->nodes[0] == portal->nodes[1])
2820 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
2821 if (portal->nodes[0] == node)
2823 else if (portal->nodes[1] == node)
2825 clipplane.dist = -clipplane.dist;
2826 VectorNegate(clipplane.normal, clipplane.normal);
2830 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2832 for (i = 0;i < nodeportal->numpoints*3;i++)
2833 frontpoints[i] = nodeportal->points[i];
2834 PolygonD_Divide(nodeportal->numpoints, frontpoints, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, 1.0/32.0, MAX_PORTALPOINTS, nodeportal->points, &nodeportal->numpoints, 0, NULL, NULL, NULL);
2835 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
2839 if (nodeportal->numpoints < 3)
2841 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
2842 nodeportal->numpoints = 0;
2844 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
2846 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
2847 nodeportal->numpoints = 0;
2850 AddPortalToNodes(nodeportal, front, back);
2852 // split the portals of this node along this node's plane and assign them to the children of this node
2853 // (migrating the portals downward through the tree)
2854 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
2856 if (portal->nodes[0] == portal->nodes[1])
2857 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
2858 if (portal->nodes[0] == node)
2860 else if (portal->nodes[1] == node)
2863 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2864 nextportal = portal->next[side];
2865 if (!portal->numpoints)
2868 other_node = portal->nodes[!side];
2869 RemovePortalFromNodes(portal);
2871 // cut the portal into two portals, one on each side of the node plane
2872 PolygonD_Divide(portal->numpoints, portal->points, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, 1.0/32.0, MAX_PORTALPOINTS, frontpoints, &numfrontpoints, MAX_PORTALPOINTS, backpoints, &numbackpoints, NULL);
2874 if (!numfrontpoints)
2877 AddPortalToNodes(portal, back, other_node);
2879 AddPortalToNodes(portal, other_node, back);
2885 AddPortalToNodes(portal, front, other_node);
2887 AddPortalToNodes(portal, other_node, front);
2891 // the portal is split
2892 splitportal = AllocPortal();
2893 temp = splitportal->chain;
2894 *splitportal = *portal;
2895 splitportal->chain = temp;
2896 for (i = 0;i < numbackpoints*3;i++)
2897 splitportal->points[i] = backpoints[i];
2898 splitportal->numpoints = numbackpoints;
2899 for (i = 0;i < numfrontpoints*3;i++)
2900 portal->points[i] = frontpoints[i];
2901 portal->numpoints = numfrontpoints;
2905 AddPortalToNodes(portal, front, other_node);
2906 AddPortalToNodes(splitportal, back, other_node);
2910 AddPortalToNodes(portal, other_node, front);
2911 AddPortalToNodes(splitportal, other_node, back);
2915 Mod_Q1BSP_RecursiveNodePortals(front);
2916 Mod_Q1BSP_RecursiveNodePortals(back);
2919 static void Mod_Q1BSP_MakePortals(void)
2922 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
2923 Mod_Q1BSP_FinalizePortals();
2926 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
2928 int i, j, stylecounts[256], totalcount, remapstyles[256];
2929 msurface_t *surface;
2930 memset(stylecounts, 0, sizeof(stylecounts));
2931 for (i = 0;i < model->nummodelsurfaces;i++)
2933 surface = model->data_surfaces + model->firstmodelsurface + i;
2934 for (j = 0;j < MAXLIGHTMAPS;j++)
2935 stylecounts[surface->lightmapinfo->styles[j]]++;
2938 model->brushq1.light_styles = 0;
2939 for (i = 0;i < 255;i++)
2943 remapstyles[i] = model->brushq1.light_styles++;
2944 totalcount += stylecounts[i] + 1;
2949 model->brushq1.light_style = (unsigned char *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(unsigned char));
2950 model->brushq1.light_stylevalue = (int *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
2951 model->brushq1.light_styleupdatechains = (msurface_t ***)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
2952 model->brushq1.light_styleupdatechainsbuffer = (msurface_t **)Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
2953 model->brushq1.light_styles = 0;
2954 for (i = 0;i < 255;i++)
2956 model->brushq1.light_style[model->brushq1.light_styles++] = i;
2958 for (i = 0;i < model->brushq1.light_styles;i++)
2960 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2961 j += stylecounts[model->brushq1.light_style[i]] + 1;
2963 for (i = 0;i < model->nummodelsurfaces;i++)
2965 surface = model->data_surfaces + model->firstmodelsurface + i;
2966 for (j = 0;j < MAXLIGHTMAPS;j++)
2967 if (surface->lightmapinfo->styles[j] != 255)
2968 *model->brushq1.light_styleupdatechains[remapstyles[surface->lightmapinfo->styles[j]]]++ = surface;
2971 for (i = 0;i < model->brushq1.light_styles;i++)
2973 *model->brushq1.light_styleupdatechains[i] = NULL;
2974 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2975 j += stylecounts[model->brushq1.light_style[i]] + 1;
2979 //Returns PVS data for a given point
2980 //(note: can return NULL)
2981 static unsigned char *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
2984 node = model->brush.data_nodes;
2986 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
2987 if (((mleaf_t *)node)->clusterindex >= 0)
2988 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
2993 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbytes, mnode_t *node)
2997 float d = PlaneDiff(org, node->plane);
2999 node = node->children[0];
3000 else if (d < -radius)
3001 node = node->children[1];
3004 // go down both sides
3005 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3006 node = node->children[1];
3009 // if this leaf is in a cluster, accumulate the pvs bits
3010 if (((mleaf_t *)node)->clusterindex >= 0)
3013 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3014 for (i = 0;i < pvsbytes;i++)
3015 pvsbuffer[i] |= pvs[i];
3019 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3020 //of the given point.
3021 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength)
3023 int bytes = model->brush.num_pvsclusterbytes;
3024 bytes = min(bytes, pvsbufferlength);
3025 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3027 memset(pvsbuffer, 0xFF, bytes);
3030 memset(pvsbuffer, 0, bytes);
3031 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3035 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3040 VectorSubtract(inmaxs, inmins, size);
3041 if (cmodel->brush.ismcbsp)
3044 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3045 else if (size[2] < 48) // pick the nearest of 40 or 56
3046 hull = &cmodel->brushq1.hulls[2]; // 16x16x40
3048 hull = &cmodel->brushq1.hulls[1]; // 16x16x56
3050 else if (cmodel->brush.ishlbsp)
3053 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3054 else if (size[0] <= 32)
3056 if (size[2] < 54) // pick the nearest of 36 or 72
3057 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3059 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3062 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3067 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3068 else if (size[0] <= 32)
3069 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3071 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3073 VectorCopy(inmins, outmins);
3074 VectorAdd(inmins, hull->clip_size, outmaxs);
3077 void Mod_Q1BSP_Load(model_t *mod, void *buffer, void *bufferend)
3082 mempool_t *mainmempool;
3083 float dist, modelyawradius, modelradius, *vec;
3084 msurface_t *surface;
3085 int numshadowmeshtriangles;
3087 hullinfo_t hullinfo;
3089 mod->type = mod_brushq1;
3091 if (!memcmp (buffer, "MCBSPpad", 8))
3093 unsigned char *index;
3095 mod->brush.ismcbsp = true;
3096 mod->brush.ishlbsp = false;
3098 mod_base = (unsigned char*)buffer;
3102 i = SB_ReadInt (&index);
3103 if (i != MCBSPVERSION)
3104 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i)", mod->name, i, MCBSPVERSION);
3107 hullinfo.numhulls = LittleLong(*(int*)index); index += 4;
3108 hullinfo.filehulls = hullinfo.numhulls;
3109 VectorClear (hullinfo.hullsizes[0][0]);
3110 VectorClear (hullinfo.hullsizes[0][1]);
3111 for (i = 1; i < hullinfo.numhulls; i++)
3113 hullinfo.hullsizes[i][0][0] = SB_ReadFloat (&index);
3114 hullinfo.hullsizes[i][0][1] = SB_ReadFloat (&index);
3115 hullinfo.hullsizes[i][0][2] = SB_ReadFloat (&index);
3116 hullinfo.hullsizes[i][1][0] = SB_ReadFloat (&index);
3117 hullinfo.hullsizes[i][1][1] = SB_ReadFloat (&index);
3118 hullinfo.hullsizes[i][1][2] = SB_ReadFloat (&index);
3122 _header.version = 0;
3123 for (i = 0; i < HEADER_LUMPS; i++)
3125 _header.lumps[i].fileofs = SB_ReadInt (&index);
3126 _header.lumps[i].filelen = SB_ReadInt (&index);
3133 header = (dheader_t *)buffer;
3135 i = LittleLong(header->version);
3136 if (i != BSPVERSION && i != 30)
3137 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3138 mod->brush.ishlbsp = i == 30;
3139 mod->brush.ismcbsp = false;
3141 // fill in hull info
3142 VectorClear (hullinfo.hullsizes[0][0]);
3143 VectorClear (hullinfo.hullsizes[0][1]);
3144 if (mod->brush.ishlbsp)
3146 hullinfo.numhulls = 4;
3147 hullinfo.filehulls = 4;
3148 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3149 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3150 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3151 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3152 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3153 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3157 hullinfo.numhulls = 3;
3158 hullinfo.filehulls = 4;
3159 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3160 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3161 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3162 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3166 mod_base = (unsigned char*)buffer;
3167 for (i = 0; i < HEADER_LUMPS; i++)
3169 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3170 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3174 mod->soundfromcenter = true;
3175 mod->TraceBox = Mod_Q1BSP_TraceBox;
3176 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3177 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3178 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3179 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3180 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3181 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3182 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3183 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3184 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3185 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3186 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3187 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3188 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3190 if (loadmodel->isworldmodel)
3192 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3193 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3198 // store which lightmap format to use
3199 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3201 mod->brush.qw_md4sum = 0;
3202 mod->brush.qw_md4sum2 = 0;
3203 for (i = 0;i < HEADER_LUMPS;i++)
3205 if (i == LUMP_ENTITIES)
3207 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3208 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3210 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3213 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3214 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3215 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3216 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3217 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3218 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3219 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3220 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3221 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3222 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3223 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3224 // load submodels before leafs because they contain the number of vis leafs
3225 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3226 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3227 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3228 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3230 if (!mod->brushq1.lightdata)
3231 mod->brush.LightPoint = NULL;
3233 if (mod->brushq1.data_compressedpvs)
3234 Mem_Free(mod->brushq1.data_compressedpvs);
3235 mod->brushq1.data_compressedpvs = NULL;
3236 mod->brushq1.num_compressedpvs = 0;
3238 Mod_Q1BSP_MakeHull0();
3239 Mod_Q1BSP_MakePortals();
3241 mod->numframes = 2; // regular and alternate animation
3244 mainmempool = mod->mempool;
3246 // make a single combined shadow mesh to allow optimized shadow volume creation
3247 numshadowmeshtriangles = 0;
3248 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3250 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3251 numshadowmeshtriangles += surface->num_triangles;
3253 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3254 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3255 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, surface->groupmesh->data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle));
3256 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
3257 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3259 if (loadmodel->brush.numsubmodels)
3260 loadmodel->brush.submodels = (model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(model_t *));
3262 if (loadmodel->isworldmodel)
3264 // clear out any stale submodels or worldmodels lying around
3265 // if we did this clear before now, an error might abort loading and
3266 // leave things in a bad state
3267 Mod_RemoveStaleWorldModels(loadmodel);
3270 // LordHavoc: to clear the fog around the original quake submodel code, I
3272 // first of all, some background info on the submodels:
3273 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3274 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3275 // now the weird for loop itself:
3276 // the loop functions in an odd way, on each iteration it sets up the
3277 // current 'mod' model (which despite the confusing code IS the model of
3278 // the number i), at the end of the loop it duplicates the model to become
3279 // the next submodel, and loops back to set up the new submodel.
3281 // LordHavoc: now the explanation of my sane way (which works identically):
3282 // set up the world model, then on each submodel copy from the world model
3283 // and set up the submodel with the respective model info.
3284 for (i = 0;i < mod->brush.numsubmodels;i++)
3286 // LordHavoc: this code was originally at the end of this loop, but
3287 // has been transformed to something more readable at the start here.
3292 // LordHavoc: only register submodels if it is the world
3293 // (prevents external bsp models from replacing world submodels with
3295 if (!loadmodel->isworldmodel)
3297 // duplicate the basic information
3298 sprintf(name, "*%i", i);
3299 mod = Mod_FindName(name);
3300 // copy the base model to this one
3302 // rename the clone back to its proper name
3303 strcpy(mod->name, name);
3304 // textures and memory belong to the main model
3305 mod->texturepool = NULL;
3306 mod->mempool = NULL;
3309 mod->brush.submodel = i;
3311 if (loadmodel->brush.submodels)
3312 loadmodel->brush.submodels[i] = mod;
3314 bm = &mod->brushq1.submodels[i];
3316 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3317 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3319 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3320 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3323 mod->firstmodelsurface = bm->firstface;
3324 mod->nummodelsurfaces = bm->numfaces;
3326 // make the model surface list (used by shadowing/lighting)
3327 mod->surfacelist = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
3328 for (j = 0;j < mod->nummodelsurfaces;j++)
3329 mod->surfacelist[j] = mod->firstmodelsurface + j;
3331 // this gets altered below if sky is used
3332 mod->DrawSky = NULL;
3333 mod->Draw = R_Q1BSP_Draw;
3334 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3335 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3336 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3337 mod->DrawLight = R_Q1BSP_DrawLight;
3340 mod->brush.GetPVS = NULL;
3341 mod->brush.FatPVS = NULL;
3342 mod->brush.BoxTouchingPVS = NULL;
3343 mod->brush.BoxTouchingLeafPVS = NULL;
3344 mod->brush.BoxTouchingVisibleLeafs = NULL;
3345 mod->brush.FindBoxClusters = NULL;
3346 mod->brush.LightPoint = NULL;
3347 mod->brush.AmbientSoundLevelsForPoint = NULL;
3349 Mod_Q1BSP_BuildLightmapUpdateChains(loadmodel->mempool, mod);
3350 if (mod->nummodelsurfaces)
3352 // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3353 mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3354 mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3357 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3359 // we only need to have a drawsky function if it is used(usually only on world model)
3360 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3361 mod->DrawSky = R_Q1BSP_DrawSky;
3362 // calculate bounding shapes
3363 for (k = 0, vec = (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex);k < surface->num_vertices;k++, vec += 3)
3365 if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3366 if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3367 if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3368 if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3369 if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3370 if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3371 dist = vec[0]*vec[0]+vec[1]*vec[1];
3372 if (modelyawradius < dist)
3373 modelyawradius = dist;
3374 dist += vec[2]*vec[2];
3375 if (modelradius < dist)
3379 modelyawradius = sqrt(modelyawradius);
3380 modelradius = sqrt(modelradius);
3381 mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3382 mod->yawmins[2] = mod->normalmins[2];
3383 mod->yawmaxs[2] = mod->normalmaxs[2];
3384 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3385 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3386 mod->radius = modelradius;
3387 mod->radius2 = modelradius * modelradius;
3391 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3392 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3394 //mod->brushq1.num_visleafs = bm->visleafs;
3397 Mod_Q1BSP_LoadMapBrushes();
3399 //Mod_Q1BSP_ProcessLightList();
3401 if (developer.integer)
3402 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);
3405 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3409 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3416 in = (void *)(mod_base + l->fileofs);
3417 if (l->filelen % sizeof(*in))
3418 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3419 count = l->filelen / sizeof(*in);
3420 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3423 loadmodel->num = count;
3425 for (i = 0;i < count;i++, in++, out++)
3431 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3438 in = (void *)(mod_base + l->fileofs);
3439 if (l->filelen % sizeof(*in))
3440 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3441 count = l->filelen / sizeof(*in);
3442 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3445 loadmodel->num = count;
3447 for (i = 0;i < count;i++, in++, out++)
3453 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3460 in = (void *)(mod_base + l->fileofs);
3461 if (l->filelen % sizeof(*in))
3462 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3463 count = l->filelen / sizeof(*in);
3464 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3467 loadmodel->num = count;
3469 for (i = 0;i < count;i++, in++, out++)
3475 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3482 in = (void *)(mod_base + l->fileofs);
3483 if (l->filelen % sizeof(*in))
3484 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3485 count = l->filelen / sizeof(*in);
3486 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3489 loadmodel->num = count;
3491 for (i = 0;i < count;i++, in++, out++)
3497 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3504 in = (void *)(mod_base + l->fileofs);
3505 if (l->filelen % sizeof(*in))
3506 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3507 count = l->filelen / sizeof(*in);
3508 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3511 loadmodel->num = count;
3513 for (i = 0;i < count;i++, in++, out++)
3519 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3526 in = (void *)(mod_base + l->fileofs);
3527 if (l->filelen % sizeof(*in))
3528 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3529 count = l->filelen / sizeof(*in);
3530 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3533 loadmodel->num = count;
3535 for (i = 0;i < count;i++, in++, out++)
3541 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3548 in = (void *)(mod_base + l->fileofs);
3549 if (l->filelen % sizeof(*in))
3550 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3551 count = l->filelen / sizeof(*in);
3552 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3555 loadmodel->num = count;
3557 for (i = 0;i < count;i++, in++, out++)
3563 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3570 in = (void *)(mod_base + l->fileofs);
3571 if (l->filelen % sizeof(*in))
3572 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3573 count = l->filelen / sizeof(*in);
3574 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3577 loadmodel->num = count;
3579 for (i = 0;i < count;i++, in++, out++)
3585 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3592 in = (void *)(mod_base + l->fileofs);
3593 if (l->filelen % sizeof(*in))
3594 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3595 count = l->filelen / sizeof(*in);
3596 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3599 loadmodel->num = count;
3601 for (i = 0;i < count;i++, in++, out++)
3607 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3614 in = (void *)(mod_base + l->fileofs);
3615 if (l->filelen % sizeof(*in))
3616 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3617 count = l->filelen / sizeof(*in);
3618 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3621 loadmodel->num = count;
3623 for (i = 0;i < count;i++, in++, out++)
3629 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3636 in = (void *)(mod_base + l->fileofs);
3637 if (l->filelen % sizeof(*in))
3638 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3639 count = l->filelen / sizeof(*in);
3640 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3643 loadmodel->num = count;
3645 for (i = 0;i < count;i++, in++, out++)
3651 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3658 in = (void *)(mod_base + l->fileofs);
3659 if (l->filelen % sizeof(*in))
3660 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3661 count = l->filelen / sizeof(*in);
3662 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3665 loadmodel->num = count;
3667 for (i = 0;i < count;i++, in++, out++)
3673 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3680 in = (void *)(mod_base + l->fileofs);
3681 if (l->filelen % sizeof(*in))
3682 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3683 count = l->filelen / sizeof(*in);
3684 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3687 loadmodel->num = count;
3689 for (i = 0;i < count;i++, in++, out++)
3695 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
3702 in = (void *)(mod_base + l->fileofs);
3703 if (l->filelen % sizeof(*in))
3704 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3705 count = l->filelen / sizeof(*in);
3706 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3709 loadmodel->num = count;
3711 for (i = 0;i < count;i++, in++, out++)
3717 static void Mod_Q2BSP_LoadAreas(lump_t *l)
3724 in = (void *)(mod_base + l->fileofs);
3725 if (l->filelen % sizeof(*in))
3726 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
3727 count = l->filelen / sizeof(*in);
3728 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3731 loadmodel->num = count;
3733 for (i = 0;i < count;i++, in++, out++)
3739 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
3746 in = (void *)(mod_base + l->fileofs);
3747 if (l->filelen % sizeof(*in))
3748 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
3749 count = l->filelen / sizeof(*in);
3750 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3753 loadmodel->num = count;
3755 for (i = 0;i < count;i++, in++, out++)
3761 static void Mod_Q2BSP_LoadModels(lump_t *l)
3768 in = (void *)(mod_base + l->fileofs);
3769 if (l->filelen % sizeof(*in))
3770 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
3771 count = l->filelen / sizeof(*in);
3772 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3775 loadmodel->num = count;
3777 for (i = 0;i < count;i++, in++, out++)
3783 void static Mod_Q2BSP_Load(model_t *mod, void *buffer, void *bufferend)
3786 q2dheader_t *header;
3788 Host_Error("Mod_Q2BSP_Load: not yet implemented");
3790 mod->type = mod_brushq2;
3792 header = (q2dheader_t *)buffer;
3794 i = LittleLong(header->version);
3795 if (i != Q2BSPVERSION)
3796 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
3797 mod->brush.ishlbsp = false;
3798 mod->brush.ismcbsp = false;
3799 if (loadmodel->isworldmodel)
3801 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3802 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3805 mod_base = (unsigned char *)header;
3807 // swap all the lumps
3808 for (i = 0;i < (int) sizeof(*header) / 4;i++)
3809 ((int *)header)[i] = LittleLong(((int *)header)[i]);
3811 // store which lightmap format to use
3812 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3814 mod->brush.qw_md4sum = 0;
3815 mod->brush.qw_md4sum2 = 0;
3816 for (i = 0;i < Q2HEADER_LUMPS;i++)
3818 if (i == Q2LUMP_ENTITIES)
3820 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3821 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
3823 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3826 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
3827 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
3828 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
3829 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
3830 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
3831 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
3832 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
3833 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
3834 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
3835 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
3836 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
3837 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
3838 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
3839 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
3840 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
3841 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
3842 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
3843 // LordHavoc: must go last because this makes the submodels
3844 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
3847 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents);
3848 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents);
3850 static void Mod_Q3BSP_LoadEntities(lump_t *l)
3853 char key[128], value[MAX_INPUTLINE];
3855 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
3856 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
3857 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
3860 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
3861 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
3862 data = loadmodel->brush.entities;
3863 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
3864 if (data && COM_ParseToken(&data, false) && com_token[0] == '{')
3868 if (!COM_ParseToken(&data, false))
3870 if (com_token[0] == '}')
3871 break; // end of worldspawn
3872 if (com_token[0] == '_')
3873 strcpy(key, com_token + 1);
3875 strcpy(key, com_token);
3876 while (key[strlen(key)-1] == ' ') // remove trailing spaces
3877 key[strlen(key)-1] = 0;
3878 if (!COM_ParseToken(&data, false))
3880 strcpy(value, com_token);
3881 if (!strcmp("gridsize", key))
3883 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
3884 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
3890 static void Mod_Q3BSP_LoadTextures(lump_t *l)
3899 int flags, flags2, numparameters, passnumber;
3900 char shadername[Q3PATHLENGTH];
3901 char sky[Q3PATHLENGTH];
3902 char firstpasstexturename[Q3PATHLENGTH];
3903 char parameter[4][Q3PATHLENGTH];
3905 in = (q3dtexture_t *)(mod_base + l->fileofs);
3906 if (l->filelen % sizeof(*in))
3907 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
3908 count = l->filelen / sizeof(*in);
3909 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3911 loadmodel->data_textures = out;
3912 loadmodel->num_textures = count;
3914 for (i = 0;i < count;i++, in++, out++)
3916 strlcpy (out->name, in->name, sizeof (out->name));
3917 out->surfaceflags = LittleLong(in->surfaceflags);
3918 out->supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in->contents));
3919 out->surfaceparms = -1;
3922 // do a quick parse of shader files to get surfaceparms
3923 if ((search = FS_Search("scripts/*.shader", true, false)))
3925 for (i = 0;i < search->numfilenames;i++)
3927 if ((f = (char *)FS_LoadFile(search->filenames[i], tempmempool, false, NULL)))
3930 while (COM_ParseToken(&text, false))
3932 strlcpy (shadername, com_token, sizeof (shadername));
3937 firstpasstexturename[0] = 0;
3938 if (COM_ParseToken(&text, false) && !strcasecmp(com_token, "{"))
3940 while (COM_ParseToken(&text, false))
3942 if (!strcasecmp(com_token, "}"))
3944 else if (!strcasecmp(com_token, "{"))
3946 while (COM_ParseToken(&text, false))
3948 if (!strcasecmp(com_token, "}"))
3950 if (!strcasecmp(com_token, "\n"))
3953 for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
3957 strlcpy(parameter[j], com_token, sizeof(parameter[j]));
3958 numparameters = j + 1;
3960 if (!COM_ParseToken(&text, true))
3963 if (developer.integer >= 2)
3965 Con_Printf("%s %i: ", shadername, passnumber);
3966 for (j = 0;j < numparameters;j++)
3967 Con_Printf(" %s", parameter[j]);
3970 if (passnumber == 0 && numparameters >= 1)
3972 if (!strcasecmp(parameter[0], "blendfunc") && (flags & Q3SURFACEPARM_TRANS))
3974 if (numparameters == 2 && !strcasecmp(parameter[1], "add"))
3975 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3976 else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_one") && !strcasecmp(parameter[2], "gl_one"))
3977 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3978 else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_src_alpha") && !strcasecmp(parameter[2], "gl_one"))
3979 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
3981 else if (numparameters >= 2 && (!strcasecmp(parameter[0], "map") || !strcasecmp(parameter[0], "clampmap")))
3982 strlcpy(firstpasstexturename, parameter[1], sizeof(firstpasstexturename));
3983 else if (numparameters >= 3 && !strcasecmp(parameter[0], "animmap"))
3984 strlcpy(firstpasstexturename, parameter[2], sizeof(firstpasstexturename));
3985 else if (numparameters >= 2 && !strcasecmp(parameter[0], "alphafunc"))
3986 flags2 |= Q3TEXTUREFLAG_ALPHATEST;
3988 // break out a level if it was }
3989 if (!strcasecmp(com_token, "}"))
3996 for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
4000 strlcpy(parameter[j], com_token, sizeof(parameter[j]));
4001 numparameters = j + 1;
4003 if (!COM_ParseToken(&text, true))
4006 if (i == 0 && !strcasecmp(com_token, "}"))
4008 if (developer.integer >= 2)
4010 Con_Printf("%s: ", shadername);
4011 for (j = 0;j < numparameters;j++)
4012 Con_Printf(" %s", parameter[j]);
4015 if (numparameters < 1)
4017 if (!strcasecmp(parameter[0], "surfaceparm") && numparameters >= 2)
4019 if (!strcasecmp(parameter[1], "alphashadow"))
4020 flags |= Q3SURFACEPARM_ALPHASHADOW;
4021 else if (!strcasecmp(parameter[1], "areaportal"))
4022 flags |= Q3SURFACEPARM_AREAPORTAL;
4023 else if (!strcasecmp(parameter[1], "clusterportal"))
4024 flags |= Q3SURFACEPARM_CLUSTERPORTAL;
4025 else if (!strcasecmp(parameter[1], "detail"))
4026 flags |= Q3SURFACEPARM_DETAIL;
4027 else if (!strcasecmp(parameter[1], "donotenter"))
4028 flags |= Q3SURFACEPARM_DONOTENTER;
4029 else if (!strcasecmp(parameter[1], "fog"))
4030 flags |= Q3SURFACEPARM_FOG;
4031 else if (!strcasecmp(parameter[1], "lava"))
4032 flags |= Q3SURFACEPARM_LAVA;
4033 else if (!strcasecmp(parameter[1], "lightfilter"))
4034 flags |= Q3SURFACEPARM_LIGHTFILTER;
4035 else if (!strcasecmp(parameter[1], "metalsteps"))
4036 flags |= Q3SURFACEPARM_METALSTEPS;
4037 else if (!strcasecmp(parameter[1], "nodamage"))
4038 flags |= Q3SURFACEPARM_NODAMAGE;
4039 else if (!strcasecmp(parameter[1], "nodlight"))
4040 flags |= Q3SURFACEPARM_NODLIGHT;
4041 else if (!strcasecmp(parameter[1], "nodraw"))
4042 flags |= Q3SURFACEPARM_NODRAW;
4043 else if (!strcasecmp(parameter[1], "nodrop"))
4044 flags |= Q3SURFACEPARM_NODROP;
4045 else if (!strcasecmp(parameter[1], "noimpact"))
4046 flags |= Q3SURFACEPARM_NOIMPACT;
4047 else if (!strcasecmp(parameter[1], "nolightmap"))
4048 flags |= Q3SURFACEPARM_NOLIGHTMAP;
4049 else if (!strcasecmp(parameter[1], "nomarks"))
4050 flags |= Q3SURFACEPARM_NOMARKS;
4051 else if (!strcasecmp(parameter[1], "nomipmaps"))
4052 flags |= Q3SURFACEPARM_NOMIPMAPS;
4053 else if (!strcasecmp(parameter[1], "nonsolid"))
4054 flags |= Q3SURFACEPARM_NONSOLID;
4055 else if (!strcasecmp(parameter[1], "origin"))
4056 flags |= Q3SURFACEPARM_ORIGIN;
4057 else if (!strcasecmp(parameter[1], "playerclip"))
4058 flags |= Q3SURFACEPARM_PLAYERCLIP;
4059 else if (!strcasecmp(parameter[1], "sky"))
4060 flags |= Q3SURFACEPARM_SKY;
4061 else if (!strcasecmp(parameter[1], "slick"))
4062 flags |= Q3SURFACEPARM_SLICK;
4063 else if (!strcasecmp(parameter[1], "slime"))
4064 flags |= Q3SURFACEPARM_SLIME;
4065 else if (!strcasecmp(parameter[1], "structural"))
4066 flags |= Q3SURFACEPARM_STRUCTURAL;
4067 else if (!strcasecmp(parameter[1], "trans"))
4068 flags |= Q3SURFACEPARM_TRANS;
4069 else if (!strcasecmp(parameter[1], "water"))
4070 flags |= Q3SURFACEPARM_WATER;
4071 else if (!strcasecmp(parameter[1], "pointlight"))
4072 flags |= Q3SURFACEPARM_POINTLIGHT;
4074 Con_Printf("%s parsing warning: unknown surfaceparm \"%s\"\n", search->filenames[i], parameter[1]);
4076 else if (!strcasecmp(parameter[0], "sky") && numparameters >= 2)
4077 strlcpy(sky, parameter[1], sizeof(sky));
4078 else if (!strcasecmp(parameter[0], "skyparms") && numparameters >= 2)
4080 if (!atoi(parameter[1]) && strcasecmp(parameter[1], "-"))
4081 strlcpy(sky, parameter[1], sizeof(sky));
4083 else if (!strcasecmp(parameter[0], "cull") && numparameters >= 2)
4085 if (!strcasecmp(parameter[1], "disable") || !strcasecmp(parameter[1], "none") || !strcasecmp(parameter[1], "twosided"))
4086 flags2 |= Q3TEXTUREFLAG_TWOSIDED;
4088 else if (!strcasecmp(parameter[0], "nomipmaps"))
4089 flags2 |= Q3TEXTUREFLAG_NOMIPMAPS;
4090 else if (!strcasecmp(parameter[0], "nopicmip"))
4091 flags2 |= Q3TEXTUREFLAG_NOPICMIP;
4092 else if (!strcasecmp(parameter[0], "deformvertexes") && numparameters >= 2)
4094 if (!strcasecmp(parameter[1], "autosprite") && numparameters == 2)
4095 flags2 |= Q3TEXTUREFLAG_AUTOSPRITE;
4096 if (!strcasecmp(parameter[1], "autosprite2") && numparameters == 2)
4097 flags2 |= Q3TEXTUREFLAG_AUTOSPRITE2;
4100 // add shader to list (shadername and flags)
4101 // actually here we just poke into the texture settings
4102 for (j = 0, out = loadmodel->data_textures;j < loadmodel->num_textures;j++, out++)
4104 if (!strcasecmp(out->name, shadername))
4106 out->surfaceparms = flags;
4107 out->textureflags = flags2;
4108 out->basematerialflags = 0;
4109 if (out->surfaceparms & Q3SURFACEPARM_NODRAW)
4110 out->basematerialflags |= MATERIALFLAG_NODRAW;
4111 else if (out->surfaceparms & Q3SURFACEPARM_SKY)
4112 out->basematerialflags |= MATERIALFLAG_SKY;
4113 else if (out->surfaceparms & Q3SURFACEPARM_LAVA)
4114 out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_FULLBRIGHT;
4115 else if (out->surfaceparms & Q3SURFACEPARM_SLIME)
4116 out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_WATERALPHA;
4117 else if (out->surfaceparms & Q3SURFACEPARM_WATER)
4118 out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_WATERALPHA;
4120 out->basematerialflags |= MATERIALFLAG_WALL;
4121 if (out->textureflags & Q3TEXTUREFLAG_ALPHATEST)
4123 // FIXME: support alpha test?
4124 out->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
4126 else if (out->surfaceparms & Q3SURFACEPARM_TRANS)
4128 if (out->textureflags & Q3TEXTUREFLAG_ADDITIVE)
4129 out->basematerialflags |= MATERIALFLAG_ADD | MATERIALFLAG_TRANSPARENT;
4131 out->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
4133 strlcpy(out->firstpasstexturename, firstpasstexturename, sizeof(out->firstpasstexturename));
4134 if ((flags & Q3SURFACEPARM_SKY) && sky[0])
4136 // quake3 seems to append a _ to the skybox name, so this must do so as well
4137 dpsnprintf(loadmodel->brush.skybox, sizeof(loadmodel->brush.skybox), "%s_", sky);
4144 Con_Printf("%s parsing error - expected \"{\", found \"%s\"\n", search->filenames[i], com_token);
4155 for (j = 0, out = loadmodel->data_textures;j < loadmodel->num_textures;j++, out++)
4157 if (out->surfaceparms == -1)
4160 Con_DPrintf("%s: No shader found for texture \"%s\"\n", loadmodel->name, out->name);
4161 out->surfaceparms = 0;
4162 if (out->surfaceflags & Q3SURFACEFLAG_NODRAW)
4163 out->basematerialflags |= MATERIALFLAG_NODRAW;
4164 else if (out->surfaceflags & Q3SURFACEFLAG_SKY)
4165 out->basematerialflags |= MATERIALFLAG_SKY;
4167 out->basematerialflags |= MATERIALFLAG_WALL;
4168 // these are defaults
4169 //if (!strncmp(out->name, "textures/skies/", 15))
4170 // out->surfaceparms |= Q3SURFACEPARM_SKY;
4171 //if (!strcmp(out->name, "caulk") || !strcmp(out->name, "common/caulk") || !strcmp(out->name, "textures/common/caulk")
4172 // || !strcmp(out->name, "nodraw") || !strcmp(out->name, "common/nodraw") || !strcmp(out->name, "textures/common/nodraw"))
4173 // out->surfaceparms |= Q3SURFACEPARM_NODRAW;
4174 //if (R_TextureHasAlpha(out->skin.base))
4175 // out->surfaceparms |= Q3SURFACEPARM_TRANS;
4177 if (cls.state != ca_dedicated)
4178 if (!Mod_LoadSkinFrame(&out->skin, out->name, (((out->textureflags & Q3TEXTUREFLAG_NOMIPMAPS) || (out->surfaceparms & Q3SURFACEPARM_NOMIPMAPS)) ? 0 : TEXF_MIPMAP) | TEXF_ALPHA | TEXF_PRECACHE | (out->textureflags & Q3TEXTUREFLAG_NOPICMIP ? 0 : TEXF_PICMIP), false, true))
4179 if (!Mod_LoadSkinFrame(&out->skin, out->firstpasstexturename, (((out->textureflags & Q3TEXTUREFLAG_NOMIPMAPS) || (out->surfaceparms & Q3SURFACEPARM_NOMIPMAPS)) ? 0 : TEXF_MIPMAP) | TEXF_ALPHA | TEXF_PRECACHE | (out->textureflags & Q3TEXTUREFLAG_NOPICMIP ? 0 : TEXF_PICMIP), false, true))
4180 Con_Printf("%s: texture loading for shader \"%s\" failed (first layer \"%s\" not found either)\n", loadmodel->name, out->name, out->firstpasstexturename);
4182 out->currentframe = out;
4185 Con_DPrintf("%s: %i textures missing shaders\n", loadmodel->name, c);
4188 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4194 in = (q3dplane_t *)(mod_base + l->fileofs);
4195 if (l->filelen % sizeof(*in))
4196 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4197 count = l->filelen / sizeof(*in);
4198 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4200 loadmodel->brush.data_planes = out;
4201 loadmodel->brush.num_planes = count;
4203 for (i = 0;i < count;i++, in++, out++)
4205 out->normal[0] = LittleFloat(in->normal[0]);
4206 out->normal[1] = LittleFloat(in->normal[1]);
4207 out->normal[2] = LittleFloat(in->normal[2]);
4208 out->dist = LittleFloat(in->dist);
4213 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4216 q3mbrushside_t *out;
4219 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4220 if (l->filelen % sizeof(*in))
4221 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4222 count = l->filelen / sizeof(*in);
4223 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4225 loadmodel->brush.data_brushsides = out;
4226 loadmodel->brush.num_brushsides = count;
4228 for (i = 0;i < count;i++, in++, out++)
4230 n = LittleLong(in->planeindex);
4231 if (n < 0 || n >= loadmodel->brush.num_planes)
4232 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4233 out->plane = loadmodel->brush.data_planes + n;
4234 n = LittleLong(in->textureindex);
4235 if (n < 0 || n >= loadmodel->num_textures)
4236 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4237 out->texture = loadmodel->data_textures + n;
4241 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4245 int i, j, n, c, count, maxplanes;
4246 colplanef_t *planes;
4248 in = (q3dbrush_t *)(mod_base + l->fileofs);
4249 if (l->filelen % sizeof(*in))
4250 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4251 count = l->filelen / sizeof(*in);
4252 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4254 loadmodel->brush.data_brushes = out;
4255 loadmodel->brush.num_brushes = count;
4260 for (i = 0;i < count;i++, in++, out++)
4262 n = LittleLong(in->firstbrushside);
4263 c = LittleLong(in->numbrushsides);
4264 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4265 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4266 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4267 out->numbrushsides = c;
4268 n = LittleLong(in->textureindex);
4269 if (n < 0 || n >= loadmodel->num_textures)
4270 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4271 out->texture = loadmodel->data_textures + n;
4273 // make a list of mplane_t structs to construct a colbrush from
4274 if (maxplanes < out->numbrushsides)
4276 maxplanes = out->numbrushsides;
4279 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4281 for (j = 0;j < out->numbrushsides;j++)
4283 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4284 planes[j].dist = out->firstbrushside[j].plane->dist;
4285 planes[j].supercontents = out->firstbrushside[j].texture->supercontents;
4286 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4287 planes[j].texture = out->firstbrushside[j].texture;
4289 // make the colbrush from the planes
4290 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes);
4296 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4302 in = (q3deffect_t *)(mod_base + l->fileofs);
4303 if (l->filelen % sizeof(*in))
4304 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4305 count = l->filelen / sizeof(*in);
4306 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4308 loadmodel->brushq3.data_effects = out;
4309 loadmodel->brushq3.num_effects = count;
4311 for (i = 0;i < count;i++, in++, out++)
4313 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4314 n = LittleLong(in->brushindex);
4315 if (n >= loadmodel->brush.num_brushes)
4317 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4320 out->brushindex = n;
4321 out->unknown = LittleLong(in->unknown);
4325 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4330 in = (q3dvertex_t *)(mod_base + l->fileofs);
4331 if (l->filelen % sizeof(*in))
4332 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4333 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4334 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 2 + 2 + 4)));
4335 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_vertex3f + count * 3;
4336 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4337 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4339 for (i = 0;i < count;i++, in++)
4341 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4342 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4343 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4344 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4345 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4346 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4347 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4348 // svector/tvector are calculated later in face loading
4349 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4350 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4351 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4352 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4356 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4362 in = (int *)(mod_base + l->fileofs);
4363 if (l->filelen % sizeof(int[3]))
4364 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4365 count = l->filelen / sizeof(*in);
4366 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4368 loadmodel->brushq3.num_triangles = count / 3;
4369 loadmodel->brushq3.data_element3i = out;
4371 for (i = 0;i < count;i++, in++, out++)
4373 *out = LittleLong(*in);
4374 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4376 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4382 static void Mod_Q3BSP_LoadLightmaps(lump_t *l)
4390 in = (q3dlightmap_t *)(mod_base + l->fileofs);
4391 if (l->filelen % sizeof(*in))
4392 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4393 count = l->filelen / sizeof(*in);
4394 out = (rtexture_t **)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4396 loadmodel->brushq3.data_lightmaps = out;
4397 loadmodel->brushq3.num_lightmaps = count;
4399 loadmodel->brushq3.deluxemapping_modelspace = false;
4400 for (i = 0;i < count;i++, in++, out++)
4402 // if this may be a deluxemap, check if it's in modelspace or not
4403 if ((i & 1) && !loadmodel->brushq3.deluxemapping_modelspace)
4406 unsigned char *b = in->rgb;
4407 for (j = 2;j < 128*128*3;j += 3)
4409 // if this is definitely negative Z, it is not facing outward,
4410 // and thus must be in modelspace, as negative Z would never
4411 // occur in tangentspace
4414 loadmodel->brushq3.deluxemapping_modelspace = true;
4419 *out = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", i), 128, 128, in->rgb, TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
4423 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4425 q3dface_t *in, *oldin;
4426 msurface_t *out, *oldout;
4427 int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshnum, meshvertices, meshtriangles, numvertices, numtriangles;
4428 //int *originalelement3i;
4429 //int *originalneighbor3i;
4430 float *originalvertex3f;
4431 //float *originalsvector3f;
4432 //float *originaltvector3f;
4433 //float *originalnormal3f;
4434 float *originalcolor4f;
4435 float *originaltexcoordtexture2f;
4436 float *originaltexcoordlightmap2f;
4438 surfmesh_t *mesh, *tempmeshlist[1024];
4440 in = (q3dface_t *)(mod_base + l->fileofs);
4441 if (l->filelen % sizeof(*in))
4442 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4443 count = l->filelen / sizeof(*in);
4444 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4446 loadmodel->data_surfaces = out;
4447 loadmodel->num_surfaces = count;
4449 // deluxemapped q3bsp files have an even number of lightmaps, and surfaces
4450 // always index even numbered ones (0, 2, 4, ...), the odd numbered
4451 // lightmaps are the deluxemaps (light direction textures), so if we
4452 // encounter any odd numbered lightmaps it is not a deluxemapped bsp, it
4453 // is also not a deluxemapped bsp if it has an odd number of lightmaps or
4455 loadmodel->brushq3.deluxemapping = true;
4456 if (count >= 2 && !(count & 1))
4458 for (i = 0;i < count;i++)
4460 n = LittleLong(in[i].lightmapindex);
4461 if (n >= 0 && ((n & 1) || n + 1 >= loadmodel->brushq3.num_lightmaps))
4463 loadmodel->brushq3.deluxemapping = false;
4469 loadmodel->brushq3.deluxemapping = false;
4470 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4473 for (meshnum = 0;i < count;meshnum++)
4480 for (;i < count;i++, in++, out++)
4482 // check face type first
4483 type = LittleLong(in->type);
4484 if (type != Q3FACETYPE_POLYGON
4485 && type != Q3FACETYPE_PATCH
4486 && type != Q3FACETYPE_MESH
4487 && type != Q3FACETYPE_FLARE)
4489 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4493 n = LittleLong(in->textureindex);
4494 if (n < 0 || n >= loadmodel->num_textures)
4496 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4499 out->texture = loadmodel->data_textures + n;
4500 n = LittleLong(in->effectindex);
4501 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4503 if (developer.integer >= 2)
4504 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4510 out->effect = loadmodel->brushq3.data_effects + n;
4511 n = LittleLong(in->lightmapindex);
4512 if (n >= loadmodel->brushq3.num_lightmaps)
4514 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_lightmaps);
4521 out->lightmaptexture = NULL;
4522 out->deluxemaptexture = r_texture_blanknormalmap;
4526 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n];
4527 if (loadmodel->brushq3.deluxemapping)
4528 out->deluxemaptexture = loadmodel->brushq3.data_lightmaps[n+1];
4530 out->deluxemaptexture = r_texture_blanknormalmap;
4533 firstvertex = LittleLong(in->firstvertex);
4534 numvertices = LittleLong(in->numvertices);
4535 firstelement = LittleLong(in->firstelement);
4536 numtriangles = LittleLong(in->numelements) / 3;
4537 if (numtriangles * 3 != LittleLong(in->numelements))
4539 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));
4542 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4544 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);
4547 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4549 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);
4554 case Q3FACETYPE_POLYGON:
4555 case Q3FACETYPE_MESH:
4556 // no processing necessary
4558 case Q3FACETYPE_PATCH:
4559 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4560 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4561 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))
4563 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4566 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4567 // convert patch to Q3FACETYPE_MESH
4568 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4569 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4570 // bound to user settings
4571 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4572 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4573 // bound to sanity settings
4574 xtess = bound(1, xtess, 1024);
4575 ytess = bound(1, ytess, 1024);
4576 // bound to user limit on vertices
4577 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4584 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4585 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4586 numvertices = finalwidth * finalheight;
4587 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4589 case Q3FACETYPE_FLARE:
4590 if (developer.integer >= 2)
4591 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4595 out->num_vertices = numvertices;
4596 out->num_triangles = numtriangles;
4597 if (meshvertices + out->num_vertices > 65536)
4599 meshvertices += out->num_vertices;
4600 meshtriangles += out->num_triangles;
4606 mesh = tempmeshlist[meshnum] = Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4609 for (;i < count && meshvertices + out->num_vertices <= mesh->num_vertices;i++, in++, out++)
4611 if (out->num_vertices < 3 || out->num_triangles < 1)
4614 type = LittleLong(in->type);
4615 firstvertex = LittleLong(in->firstvertex);
4616 firstelement = LittleLong(in->firstelement);
4617 out->groupmesh = mesh;
4618 out->num_firstvertex = meshvertices;
4619 out->num_firsttriangle = meshtriangles;
4622 case Q3FACETYPE_POLYGON:
4623 case Q3FACETYPE_MESH:
4624 // no processing necessary
4625 for (j = 0;j < out->num_vertices;j++)
4627 (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4628 (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4629 (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4630 (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4631 (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4632 (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4633 (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4634 (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4635 (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4636 (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4637 (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4639 for (j = 0;j < out->num_triangles*3;j++)
4640 (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
4642 case Q3FACETYPE_PATCH:
4643 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4644 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4645 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4646 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4647 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4648 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4649 // convert patch to Q3FACETYPE_MESH
4650 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4651 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4652 // bound to user settings
4653 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4654 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4655 // bound to sanity settings
4656 xtess = bound(1, xtess, 1024);
4657 ytess = bound(1, ytess, 1024);
4658 // bound to user limit on vertices
4659 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4666 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4667 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4668 finalvertices = finalwidth * finalheight;
4669 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4670 type = Q3FACETYPE_MESH;
4671 // generate geometry
4672 // (note: normals are skipped because they get recalculated)
4673 Q3PatchTesselateFloat(3, sizeof(float[3]), (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4674 Q3PatchTesselateFloat(2, sizeof(float[2]), (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
4675 Q3PatchTesselateFloat(2, sizeof(float[2]), (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
4676 Q3PatchTesselateFloat(4, sizeof(float[4]), (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
4677 Q3PatchTriangleElements((out->groupmesh->data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
4678 out->num_triangles = Mod_RemoveDegenerateTriangles(out->num_triangles, (out->groupmesh->data_element3i + 3 * out->num_firsttriangle), (out->groupmesh->data_element3i + 3 * out->num_firsttriangle), out->groupmesh->data_vertex3f);
4679 if (developer.integer >= 2)
4681 if (out->num_triangles < finaltriangles)
4682 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);
4684 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);
4686 // q3map does not put in collision brushes for curves... ugh
4687 // build the lower quality collision geometry
4688 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4689 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4690 // bound to user settings
4691 xtess = bound(r_subdivisions_collision_mintess.integer, xtess, r_subdivisions_collision_maxtess.integer);
4692 ytess = bound(r_subdivisions_collision_mintess.integer, ytess, r_subdivisions_collision_maxtess.integer);
4693 // bound to sanity settings
4694 xtess = bound(1, xtess, 1024);
4695 ytess = bound(1, ytess, 1024);
4696 // bound to user limit on vertices
4697 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4704 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4705 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4706 finalvertices = finalwidth * finalheight;
4707 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4709 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4710 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4711 out->num_collisionvertices = finalvertices;
4712 out->num_collisiontriangles = finaltriangles;
4713 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4714 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
4716 //Mod_SnapVertices(3, out->num_vertices, (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), 0.25);
4717 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
4719 oldnumtriangles = out->num_triangles;
4720 oldnumtriangles2 = out->num_collisiontriangles;
4721 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
4722 if (developer.integer)
4723 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);
4728 meshvertices += out->num_vertices;
4729 meshtriangles += out->num_triangles;
4730 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
4731 if ((out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
4733 if (invalidelements)
4735 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);
4736 for (j = 0;j < out->num_triangles * 3;j++)
4738 Con_Printf(" %i", (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
4739 if ((out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
4740 (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
4744 // for per pixel lighting
4745 Mod_BuildTextureVectorsAndNormals(out->num_firstvertex, out->num_vertices, out->num_triangles, out->groupmesh->data_vertex3f, out->groupmesh->data_texcoordtexture2f, (out->groupmesh->data_element3i + 3 * out->num_firsttriangle), out->groupmesh->data_svector3f, out->groupmesh->data_tvector3f, out->groupmesh->data_normal3f, true);
4746 // calculate a bounding box
4747 VectorClear(out->mins);
4748 VectorClear(out->maxs);
4749 if (out->num_vertices)
4751 VectorCopy((out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), out->mins);
4752 VectorCopy((out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), out->maxs);
4753 for (j = 1, v = (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
4755 out->mins[0] = min(out->mins[0], v[0]);
4756 out->maxs[0] = max(out->maxs[0], v[0]);
4757 out->mins[1] = min(out->mins[1], v[1]);
4758 out->maxs[1] = max(out->maxs[1], v[1]);
4759 out->mins[2] = min(out->mins[2], v[2]);
4760 out->maxs[2] = max(out->maxs[2], v[2]);
4762 out->mins[0] -= 1.0f;
4763 out->mins[1] -= 1.0f;
4764 out->mins[2] -= 1.0f;
4765 out->maxs[0] += 1.0f;
4766 out->maxs[1] += 1.0f;
4767 out->maxs[2] += 1.0f;
4769 // set lightmap styles for consistency with q1bsp
4770 //out->lightmapinfo->styles[0] = 0;
4771 //out->lightmapinfo->styles[1] = 255;
4772 //out->lightmapinfo->styles[2] = 255;
4773 //out->lightmapinfo->styles[3] = 255;
4777 // now store the completed list of meshes
4778 loadmodel->nummeshes = meshnum;
4779 if (loadmodel->nummeshes)
4781 loadmodel->meshlist = (surfmesh_t **)Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4782 memcpy(loadmodel->meshlist, tempmeshlist, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4785 // free the no longer needed vertex data
4786 loadmodel->brushq3.num_vertices = 0;
4787 Mem_Free(loadmodel->brushq3.data_vertex3f);
4788 loadmodel->brushq3.data_vertex3f = NULL;
4789 loadmodel->brushq3.data_texcoordtexture2f = NULL;
4790 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
4791 loadmodel->brushq3.data_color4f = NULL;
4792 // free the no longer needed triangle data
4793 loadmodel->brushq3.num_triangles = 0;
4794 Mem_Free(loadmodel->brushq3.data_element3i);
4795 loadmodel->brushq3.data_element3i = NULL;
4798 static void Mod_Q3BSP_LoadModels(lump_t *l)
4802 int i, j, n, c, count;
4804 in = (q3dmodel_t *)(mod_base + l->fileofs);
4805 if (l->filelen % sizeof(*in))
4806 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4807 count = l->filelen / sizeof(*in);
4808 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4810 loadmodel->brushq3.data_models = out;
4811 loadmodel->brushq3.num_models = count;
4813 for (i = 0;i < count;i++, in++, out++)
4815 for (j = 0;j < 3;j++)
4817 out->mins[j] = LittleFloat(in->mins[j]);
4818 out->maxs[j] = LittleFloat(in->maxs[j]);
4820 n = LittleLong(in->firstface);
4821 c = LittleLong(in->numfaces);
4822 if (n < 0 || n + c > loadmodel->num_surfaces)
4823 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
4826 n = LittleLong(in->firstbrush);
4827 c = LittleLong(in->numbrushes);
4828 if (n < 0 || n + c > loadmodel->brush.num_brushes)
4829 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
4830 out->firstbrush = n;
4831 out->numbrushes = c;
4835 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
4841 in = (int *)(mod_base + l->fileofs);
4842 if (l->filelen % sizeof(*in))
4843 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4844 count = l->filelen / sizeof(*in);
4845 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4847 loadmodel->brush.data_leafbrushes = out;
4848 loadmodel->brush.num_leafbrushes = count;
4850 for (i = 0;i < count;i++, in++, out++)
4852 n = LittleLong(*in);
4853 if (n < 0 || n >= loadmodel->brush.num_brushes)
4854 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
4859 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
4865 in = (int *)(mod_base + l->fileofs);
4866 if (l->filelen % sizeof(*in))
4867 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4868 count = l->filelen / sizeof(*in);
4869 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4871 loadmodel->brush.data_leafsurfaces = out;
4872 loadmodel->brush.num_leafsurfaces = count;
4874 for (i = 0;i < count;i++, in++, out++)
4876 n = LittleLong(*in);
4877 if (n < 0 || n >= loadmodel->num_surfaces)
4878 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
4883 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
4887 int i, j, n, c, count;
4889 in = (q3dleaf_t *)(mod_base + l->fileofs);
4890 if (l->filelen % sizeof(*in))
4891 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4892 count = l->filelen / sizeof(*in);
4893 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4895 loadmodel->brush.data_leafs = out;
4896 loadmodel->brush.num_leafs = count;
4898 for (i = 0;i < count;i++, in++, out++)
4902 out->clusterindex = LittleLong(in->clusterindex);
4903 out->areaindex = LittleLong(in->areaindex);
4904 for (j = 0;j < 3;j++)
4906 // yes the mins/maxs are ints
4907 out->mins[j] = LittleLong(in->mins[j]) - 1;
4908 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4910 n = LittleLong(in->firstleafface);
4911 c = LittleLong(in->numleaffaces);
4912 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
4913 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
4914 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
4915 out->numleafsurfaces = c;
4916 n = LittleLong(in->firstleafbrush);
4917 c = LittleLong(in->numleafbrushes);
4918 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
4919 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
4920 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
4921 out->numleafbrushes = c;
4925 static void Mod_Q3BSP_LoadNodes(lump_t *l)
4931 in = (q3dnode_t *)(mod_base + l->fileofs);
4932 if (l->filelen % sizeof(*in))
4933 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4934 count = l->filelen / sizeof(*in);
4935 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4937 loadmodel->brush.data_nodes = out;
4938 loadmodel->brush.num_nodes = count;
4940 for (i = 0;i < count;i++, in++, out++)
4943 n = LittleLong(in->planeindex);
4944 if (n < 0 || n >= loadmodel->brush.num_planes)
4945 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4946 out->plane = loadmodel->brush.data_planes + n;
4947 for (j = 0;j < 2;j++)
4949 n = LittleLong(in->childrenindex[j]);
4952 if (n >= loadmodel->brush.num_nodes)
4953 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
4954 out->children[j] = loadmodel->brush.data_nodes + n;
4959 if (n >= loadmodel->brush.num_leafs)
4960 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
4961 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
4964 for (j = 0;j < 3;j++)
4966 // yes the mins/maxs are ints
4967 out->mins[j] = LittleLong(in->mins[j]) - 1;
4968 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4972 // set the parent pointers
4973 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
4976 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
4979 q3dlightgrid_t *out;
4982 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
4983 if (l->filelen % sizeof(*in))
4984 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
4985 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
4986 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
4987 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
4988 loadmodel->brushq3.num_lightgrid_imins[0] = ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4989 loadmodel->brushq3.num_lightgrid_imins[1] = ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4990 loadmodel->brushq3.num_lightgrid_imins[2] = ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4991 loadmodel->brushq3.num_lightgrid_imaxs[0] = floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
4992 loadmodel->brushq3.num_lightgrid_imaxs[1] = floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
4993 loadmodel->brushq3.num_lightgrid_imaxs[2] = floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
4994 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
4995 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
4996 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
4997 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
4998 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]);
4999 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]);
5001 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5004 if (l->filelen < count * (int)sizeof(*in))
5005 Host_Error("Mod_Q3BSP_LoadLightGrid: invalid lightgrid lump size %i bytes, should be %i bytes (%ix%ix%i)", l->filelen, count * sizeof(*in), loadmodel->brushq3.num_lightgrid_dimensions[0], loadmodel->brushq3.num_lightgrid_dimensions[1], loadmodel->brushq3.num_lightgrid_dimensions[2]);
5006 if (l->filelen != count * (int)sizeof(*in))
5007 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i", count * sizeof(*in), l->filelen);
5008 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5009 loadmodel->brushq3.data_lightgrid = out;
5010 loadmodel->brushq3.num_lightgrid = count;
5011 // no swapping or validation necessary
5012 memcpy(out, in, count * (int)sizeof(*out));
5016 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5021 if (l->filelen == 0)
5024 // unvised maps often have cluster indices even without pvs, so check
5025 // leafs to find real number of clusters
5026 loadmodel->brush.num_pvsclusters = 1;
5027 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5028 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5031 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5032 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5033 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5034 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5038 in = (q3dpvs_t *)(mod_base + l->fileofs);
5040 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5042 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5043 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5044 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5045 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5046 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5047 if (l->filelen < totalchains + (int)sizeof(*in))
5048 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, totalchains + sizeof(*in), l->filelen);
5050 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5051 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5054 static void Mod_Q3BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5056 int i, j, k, index[3];
5057 float transformed[3], blend1, blend2, blend, yaw, pitch, sinpitch;
5058 q3dlightgrid_t *a, *s;
5059 if (!model->brushq3.num_lightgrid)
5061 ambientcolor[0] = 1;
5062 ambientcolor[1] = 1;
5063 ambientcolor[2] = 1;
5066 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5067 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5068 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5069 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5070 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5071 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5072 index[0] = (int)floor(transformed[0]);
5073 index[1] = (int)floor(transformed[1]);
5074 index[2] = (int)floor(transformed[2]);
5075 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5076 // now lerp the values
5077 VectorClear(diffusenormal);
5078 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5079 for (k = 0;k < 2;k++)
5081 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5082 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5084 for (j = 0;j < 2;j++)
5086 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5087 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5089 for (i = 0;i < 2;i++)
5091 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0])));
5092 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5094 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5095 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5096 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5097 pitch = s->diffusepitch * M_PI / 128;
5098 yaw = s->diffuseyaw * M_PI / 128;
5099 sinpitch = sin(pitch);
5100 diffusenormal[0] += blend * (cos(yaw) * sinpitch);
5101 diffusenormal[1] += blend * (sin(yaw) * sinpitch);
5102 diffusenormal[2] += blend * (cos(pitch));
5103 //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)));
5107 VectorNormalize(diffusenormal);
5108 //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]);
5111 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const vec3_t point, int markframe)
5116 // find which leaf the point is in
5118 node = node->children[DotProduct(point, node->plane->normal) < node->plane->dist];
5119 // point trace the brushes
5120 leaf = (mleaf_t *)node;
5121 for (i = 0;i < leaf->numleafbrushes;i++)
5123 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5124 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5126 brush->markframe = markframe;
5127 Collision_TracePointBrushFloat(trace, point, brush);
5130 // can't do point traces on curves (they have no thickness)
5133 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)
5135 int i, startside, endside;
5136 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5138 msurface_t *surface;
5141 // walk the tree until we hit a leaf, recursing for any split cases
5144 plane = node->plane;
5145 // axial planes are much more common than non-axial, so an optimized
5146 // axial case pays off here
5147 if (plane->type < 3)
5149 dist1 = start[plane->type] - plane->dist;
5150 dist2 = end[plane->type] - plane->dist;
5154 dist1 = DotProduct(start, plane->normal) - plane->dist;
5155 dist2 = DotProduct(end, plane->normal) - plane->dist;
5157 startside = dist1 < 0;
5158 endside = dist2 < 0;
5159 if (startside == endside)
5161 // most of the time the line fragment is on one side of the plane
5162 node = node->children[startside];
5166 // line crosses node plane, split the line
5167 dist1 = PlaneDiff(linestart, plane);
5168 dist2 = PlaneDiff(lineend, plane);
5169 midfrac = dist1 / (dist1 - dist2);
5170 VectorLerp(linestart, midfrac, lineend, mid);
5171 // take the near side first
5172 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5173 // if we found an impact on the front side, don't waste time
5174 // exploring the far side
5175 if (midfrac <= trace->realfraction)
5176 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5181 nodesegmentmins[0] = min(start[0], end[0]) - 1;
5182 nodesegmentmins[1] = min(start[1], end[1]) - 1;
5183 nodesegmentmins[2] = min(start[2], end[2]) - 1;
5184 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5185 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5186 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5187 // line trace the brushes
5188 leaf = (mleaf_t *)node;
5189 for (i = 0;i < leaf->numleafbrushes;i++)
5191 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5192 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5194 brush->markframe = markframe;
5195 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5198 // can't do point traces on curves (they have no thickness)
5199 if (mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5201 // line trace the curves
5202 for (i = 0;i < leaf->numleafsurfaces;i++)
5204 surface = model->data_surfaces + leaf->firstleafsurface[i];
5205 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5207 surface->collisionmarkframe = markframe;
5208 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5214 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)
5220 msurface_t *surface;
5222 float nodesegmentmins[3], nodesegmentmaxs[3];
5223 // walk the tree until we hit a leaf, recursing for any split cases
5226 plane = node->plane;
5227 // axial planes are much more common than non-axial, so an optimized
5228 // axial case pays off here
5229 if (plane->type < 3)
5231 // this is an axial plane, compare bounding box directly to it and
5232 // recurse sides accordingly
5233 // recurse down node sides
5234 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5235 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5236 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5237 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5241 // this is a non-axial plane, so check if the start and end boxes
5242 // are both on one side of the plane to handle 'diagonal' cases
5243 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5247 // segment crosses plane
5248 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5251 // if sides == 0 then the trace itself is bogus (Not A Number values),
5252 // in this case we simply pretend the trace hit nothing
5254 return; // ERROR: NAN bounding box!
5255 // take whichever side the segment box is on
5256 node = node->children[sides - 1];
5258 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5259 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5260 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5261 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5262 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5263 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5265 leaf = (mleaf_t *)node;
5266 for (i = 0;i < leaf->numleafbrushes;i++)
5268 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5269 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5271 brush->markframe = markframe;
5272 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5275 if (mod_q3bsp_curves_collisions.integer)
5277 for (i = 0;i < leaf->numleafsurfaces;i++)
5279 surface = model->data_surfaces + leaf->firstleafsurface[i];
5280 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5282 surface->collisionmarkframe = markframe;
5283 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);
5289 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)
5292 float segmentmins[3], segmentmaxs[3];
5293 static int markframe = 0;
5294 msurface_t *surface;
5296 memset(trace, 0, sizeof(*trace));
5297 trace->fraction = 1;
5298 trace->realfraction = 1;
5299 trace->hitsupercontentsmask = hitsupercontentsmask;
5300 if (mod_q3bsp_optimizedtraceline.integer && VectorLength2(boxmins) + VectorLength2(boxmaxs) == 0)
5302 if (VectorCompare(start, end))
5305 if (model->brush.submodel)
5307 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5308 if (brush->colbrushf)
5309 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5312 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5317 segmentmins[0] = min(start[0], end[0]) - 1;
5318 segmentmins[1] = min(start[1], end[1]) - 1;
5319 segmentmins[2] = min(start[2], end[2]) - 1;
5320 segmentmaxs[0] = max(start[0], end[0]) + 1;
5321 segmentmaxs[1] = max(start[1], end[1]) + 1;
5322 segmentmaxs[2] = max(start[2], end[2]) + 1;
5323 if (model->brush.submodel)
5325 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5326 if (brush->colbrushf)
5327 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5328 if (mod_q3bsp_curves_collisions.integer)
5329 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5330 if (surface->num_collisiontriangles)
5331 Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5334 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5339 // box trace, performed as brush trace
5340 colbrushf_t *thisbrush_start, *thisbrush_end;
5341 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5342 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5343 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5344 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5345 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5346 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5347 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5348 VectorAdd(start, boxmins, boxstartmins);
5349 VectorAdd(start, boxmaxs, boxstartmaxs);
5350 VectorAdd(end, boxmins, boxendmins);
5351 VectorAdd(end, boxmaxs, boxendmaxs);
5352 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5353 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5354 if (model->brush.submodel)
5356 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5357 if (brush->colbrushf)
5358 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5359 if (mod_q3bsp_curves_collisions.integer)
5360 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5361 if (surface->num_collisiontriangles)
5362 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);
5365 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5369 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
5371 int supercontents = 0;
5372 if (nativecontents & CONTENTSQ3_SOLID)
5373 supercontents |= SUPERCONTENTS_SOLID;
5374 if (nativecontents & CONTENTSQ3_WATER)
5375 supercontents |= SUPERCONTENTS_WATER;
5376 if (nativecontents & CONTENTSQ3_SLIME)
5377 supercontents |= SUPERCONTENTS_SLIME;
5378 if (nativecontents & CONTENTSQ3_LAVA)
5379 supercontents |= SUPERCONTENTS_LAVA;
5380 if (nativecontents & CONTENTSQ3_BODY)
5381 supercontents |= SUPERCONTENTS_BODY;
5382 if (nativecontents & CONTENTSQ3_CORPSE)
5383 supercontents |= SUPERCONTENTS_CORPSE;
5384 if (nativecontents & CONTENTSQ3_NODROP)
5385 supercontents |= SUPERCONTENTS_NODROP;
5386 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5387 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5388 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5389 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5390 if (nativecontents & CONTENTSQ3_DONOTENTER)
5391 supercontents |= SUPERCONTENTS_DONOTENTER;
5392 return supercontents;
5395 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
5397 int nativecontents = 0;
5398 if (supercontents & SUPERCONTENTS_SOLID)
5399 nativecontents |= CONTENTSQ3_SOLID;
5400 if (supercontents & SUPERCONTENTS_WATER)
5401 nativecontents |= CONTENTSQ3_WATER;
5402 if (supercontents & SUPERCONTENTS_SLIME)
5403 nativecontents |= CONTENTSQ3_SLIME;
5404 if (supercontents & SUPERCONTENTS_LAVA)
5405 nativecontents |= CONTENTSQ3_LAVA;
5406 if (supercontents & SUPERCONTENTS_BODY)
5407 nativecontents |= CONTENTSQ3_BODY;
5408 if (supercontents & SUPERCONTENTS_CORPSE)
5409 nativecontents |= CONTENTSQ3_CORPSE;
5410 if (supercontents & SUPERCONTENTS_NODROP)
5411 nativecontents |= CONTENTSQ3_NODROP;
5412 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5413 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5414 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5415 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5416 if (supercontents & SUPERCONTENTS_DONOTENTER)
5417 nativecontents |= CONTENTSQ3_DONOTENTER;
5418 return nativecontents;
5421 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5426 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5427 node = node->children[1];
5429 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5430 if (loadmodel->brush.num_leafs < numleafs)
5431 loadmodel->brush.num_leafs = numleafs;
5434 void Mod_Q3BSP_Load(model_t *mod, void *buffer, void *bufferend)
5436 int i, j, numshadowmeshtriangles;
5437 q3dheader_t *header;
5438 float corner[3], yawradius, modelradius;
5439 msurface_t *surface;
5441 mod->type = mod_brushq3;
5442 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5445 header = (q3dheader_t *)buffer;
5447 i = LittleLong(header->version);
5448 if (i != Q3BSPVERSION)
5449 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5450 mod->brush.ishlbsp = false;
5451 mod->brush.ismcbsp = false;
5452 if (loadmodel->isworldmodel)
5454 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
5455 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
5458 mod->soundfromcenter = true;
5459 mod->TraceBox = Mod_Q3BSP_TraceBox;
5460 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5461 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5462 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5463 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5464 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5465 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5466 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5467 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
5468 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5469 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5470 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5471 mod->Draw = R_Q1BSP_Draw;
5472 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5473 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5474 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5475 mod->DrawLight = R_Q1BSP_DrawLight;
5477 mod_base = (unsigned char *)header;
5479 // swap all the lumps
5480 header->ident = LittleLong(header->ident);
5481 header->version = LittleLong(header->version);
5482 for (i = 0;i < Q3HEADER_LUMPS;i++)
5484 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
5485 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
5488 mod->brush.qw_md4sum = 0;
5489 mod->brush.qw_md4sum2 = 0;
5490 for (i = 0;i < Q3HEADER_LUMPS;i++)
5492 if (i == Q3LUMP_ENTITIES)
5494 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5495 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
5497 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5500 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5501 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5502 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5503 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5504 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5505 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5506 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5507 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5508 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS]);
5509 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5510 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5511 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5512 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5513 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5514 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5515 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5516 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5517 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5519 // the MakePortals code works fine on the q3bsp data as well
5520 Mod_Q1BSP_MakePortals();
5522 // make a single combined shadow mesh to allow optimized shadow volume creation
5523 numshadowmeshtriangles = 0;
5524 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5526 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5527 numshadowmeshtriangles += surface->num_triangles;
5529 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5530 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5531 if (surface->groupmesh)
5532 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, surface->groupmesh->data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle));
5533 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
5534 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5536 loadmodel->brush.num_leafs = 0;
5537 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
5539 if (loadmodel->isworldmodel)
5541 // clear out any stale submodels or worldmodels lying around
5542 // if we did this clear before now, an error might abort loading and
5543 // leave things in a bad state
5544 Mod_RemoveStaleWorldModels(loadmodel);
5548 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
5553 // LordHavoc: only register submodels if it is the world
5554 // (prevents external bsp models from replacing world submodels with
5556 if (!loadmodel->isworldmodel)
5558 // duplicate the basic information
5559 sprintf(name, "*%i", i);
5560 mod = Mod_FindName(name);
5562 strcpy(mod->name, name);
5563 // textures and memory belong to the main model
5564 mod->texturepool = NULL;
5565 mod->mempool = NULL;
5566 mod->brush.GetPVS = NULL;
5567 mod->brush.FatPVS = NULL;
5568 mod->brush.BoxTouchingPVS = NULL;
5569 mod->brush.BoxTouchingLeafPVS = NULL;
5570 mod->brush.BoxTouchingVisibleLeafs = NULL;
5571 mod->brush.FindBoxClusters = NULL;
5572 mod->brush.LightPoint = NULL;
5573 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5575 mod->brush.submodel = i;
5577 // make the model surface list (used by shadowing/lighting)
5578 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
5579 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
5580 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
5581 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
5582 mod->surfacelist = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
5583 for (j = 0;j < mod->nummodelsurfaces;j++)
5584 mod->surfacelist[j] = mod->firstmodelsurface + j;
5586 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
5587 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
5588 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5589 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5590 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5591 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5592 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5593 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5594 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5595 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5596 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5597 mod->yawmins[2] = mod->normalmins[2];
5598 mod->yawmaxs[2] = mod->normalmaxs[2];
5599 mod->radius = modelradius;
5600 mod->radius2 = modelradius * modelradius;
5602 for (j = 0;j < mod->nummodelsurfaces;j++)
5603 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->surfaceflags & Q3SURFACEFLAG_SKY)
5605 if (j < mod->nummodelsurfaces)
5606 mod->DrawSky = R_Q1BSP_DrawSky;
5610 void Mod_IBSP_Load(model_t *mod, void *buffer, void *bufferend)
5612 int i = LittleLong(((int *)buffer)[1]);
5613 if (i == Q3BSPVERSION)
5614 Mod_Q3BSP_Load(mod,buffer, bufferend);
5615 else if (i == Q2BSPVERSION)
5616 Mod_Q2BSP_Load(mod,buffer, bufferend);
5618 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
5621 void Mod_MAP_Load(model_t *mod, void *buffer, void *bufferend)
5623 Host_Error("Mod_MAP_Load: not yet implemented");