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, int boxq3surfaceflags, texture_t *boxtexture)
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 cbox_planes[0].supercontents = boxsupercontents;cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
894 cbox_planes[1].supercontents = boxsupercontents;cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
895 cbox_planes[2].supercontents = boxsupercontents;cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
896 cbox_planes[3].supercontents = boxsupercontents;cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
897 cbox_planes[4].supercontents = boxsupercontents;cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
898 cbox_planes[5].supercontents = boxsupercontents;cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
899 memset(trace, 0, sizeof(trace_t));
900 trace->hitsupercontentsmask = hitsupercontentsmask;
902 trace->realfraction = 1;
903 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
905 RecursiveHullCheckTraceInfo_t rhc;
906 static hull_t box_hull;
907 static dclipnode_t box_clipnodes[6];
908 static mplane_t box_planes[6];
909 // fill in a default trace
910 memset(&rhc, 0, sizeof(rhc));
911 memset(trace, 0, sizeof(trace_t));
912 //To keep everything totally uniform, bounding boxes are turned into small
913 //BSP trees instead of being compared directly.
914 // create a temp hull from bounding box sizes
915 box_planes[0].dist = cmaxs[0] - mins[0];
916 box_planes[1].dist = cmins[0] - maxs[0];
917 box_planes[2].dist = cmaxs[1] - mins[1];
918 box_planes[3].dist = cmins[1] - maxs[1];
919 box_planes[4].dist = cmaxs[2] - mins[2];
920 box_planes[5].dist = cmins[2] - maxs[2];
921 #if COLLISIONPARANOID >= 3
922 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]);
925 if (box_hull.clipnodes == NULL)
929 //Set up the planes and clipnodes so that the six floats of a bounding box
930 //can just be stored out and get a proper hull_t structure.
932 box_hull.clipnodes = box_clipnodes;
933 box_hull.planes = box_planes;
934 box_hull.firstclipnode = 0;
935 box_hull.lastclipnode = 5;
937 for (i = 0;i < 6;i++)
939 box_clipnodes[i].planenum = i;
943 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
945 box_clipnodes[i].children[side^1] = i + 1;
947 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
949 box_planes[i].type = i>>1;
950 box_planes[i].normal[i>>1] = 1;
954 // trace a line through the generated clipping hull
955 //rhc.boxsupercontents = boxsupercontents;
956 rhc.hull = &box_hull;
958 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
959 rhc.trace->fraction = 1;
960 rhc.trace->realfraction = 1;
961 rhc.trace->allsolid = true;
962 VectorCopy(start, rhc.start);
963 VectorCopy(end, rhc.end);
964 VectorSubtract(rhc.end, rhc.start, rhc.dist);
965 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
966 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
967 if (rhc.trace->startsupercontents)
968 rhc.trace->startsupercontents = boxsupercontents;
972 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)
974 int side, distz = endz - startz;
980 return false; // didn't hit anything
982 switch (node->plane->type)
985 node = node->children[x < node->plane->dist];
988 node = node->children[y < node->plane->dist];
991 side = startz < node->plane->dist;
992 if ((endz < node->plane->dist) == side)
994 node = node->children[side];
997 // found an intersection
998 mid = node->plane->dist;
1001 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1002 front += startz * node->plane->normal[2];
1003 back += endz * node->plane->normal[2];
1004 side = front < node->plane->dist;
1005 if ((back < node->plane->dist) == side)
1007 node = node->children[side];
1010 // found an intersection
1011 mid = startz + distz * (front - node->plane->dist) / (front - back);
1015 // go down front side
1016 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1017 return true; // hit something
1020 // check for impact on this node
1021 if (node->numsurfaces)
1024 msurface_t *surface;
1026 surface = model->data_surfaces + node->firstsurface;
1027 for (i = 0;i < node->numsurfaces;i++, surface++)
1029 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1030 continue; // no lightmaps
1032 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];
1033 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];
1035 if (ds >= 0 && ds < surface->lightmapinfo->extents[0] && dt >= 0 && dt < surface->lightmapinfo->extents[1])
1037 unsigned char *lightmap;
1038 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;
1039 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1040 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1041 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1042 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1044 lightmap = surface->lightmapinfo->samples + ((dt>>4) * lmwidth + (ds>>4))*3; // LordHavoc: *3 for colored lighting
1046 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1048 scale = r_refdef.lightstylevalue[surface->lightmapinfo->styles[maps]];
1049 r00 += lightmap[ 0] * scale;g00 += lightmap[ 1] * scale;b00 += lightmap[ 2] * scale;
1050 r01 += lightmap[ 3] * scale;g01 += lightmap[ 4] * scale;b01 += lightmap[ 5] * scale;
1051 r10 += lightmap[line3+0] * scale;g10 += lightmap[line3+1] * scale;b10 += lightmap[line3+2] * scale;
1052 r11 += lightmap[line3+3] * scale;g11 += lightmap[line3+4] * scale;b11 += lightmap[line3+5] * scale;
1057 LordHavoc: here's the readable version of the interpolation
1058 code, not quite as easy for the compiler to optimize...
1060 dsfrac is the X position in the lightmap pixel, * 16
1061 dtfrac is the Y position in the lightmap pixel, * 16
1062 r00 is top left corner, r01 is top right corner
1063 r10 is bottom left corner, r11 is bottom right corner
1064 g and b are the same layout.
1065 r0 and r1 are the top and bottom intermediate results
1067 first we interpolate the top two points, to get the top
1070 r0 = (((r01-r00) * dsfrac) >> 4) + r00;
1071 g0 = (((g01-g00) * dsfrac) >> 4) + g00;
1072 b0 = (((b01-b00) * dsfrac) >> 4) + b00;
1074 then we interpolate the bottom two points, to get the
1077 r1 = (((r11-r10) * dsfrac) >> 4) + r10;
1078 g1 = (((g11-g10) * dsfrac) >> 4) + g10;
1079 b1 = (((b11-b10) * dsfrac) >> 4) + b10;
1081 then we interpolate the top and bottom samples to get the
1082 middle sample (the one which was requested)
1084 r = (((r1-r0) * dtfrac) >> 4) + r0;
1085 g = (((g1-g0) * dtfrac) >> 4) + g0;
1086 b = (((b1-b0) * dtfrac) >> 4) + b0;
1089 ambientcolor[0] += (float) ((((((((r11-r10) * dsfrac) >> 4) + r10)-((((r01-r00) * dsfrac) >> 4) + r00)) * dtfrac) >> 4) + ((((r01-r00) * dsfrac) >> 4) + r00)) * (1.0f / 32768.0f);
1090 ambientcolor[1] += (float) ((((((((g11-g10) * dsfrac) >> 4) + g10)-((((g01-g00) * dsfrac) >> 4) + g00)) * dtfrac) >> 4) + ((((g01-g00) * dsfrac) >> 4) + g00)) * (1.0f / 32768.0f);
1091 ambientcolor[2] += (float) ((((((((b11-b10) * dsfrac) >> 4) + b10)-((((b01-b00) * dsfrac) >> 4) + b00)) * dtfrac) >> 4) + ((((b01-b00) * dsfrac) >> 4) + b00)) * (1.0f / 32768.0f);
1092 return true; // success
1097 // go down back side
1098 node = node->children[side ^ 1];
1100 distz = endz - startz;
1105 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1107 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);
1108 VectorSet(diffusenormal, 0, 0, -1);
1111 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1114 unsigned char *outstart = out;
1115 while (out < outend)
1119 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
1129 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);
1132 for (c = *in++;c > 0;c--)
1136 Con_Printf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, out - outstart, outend - outstart);
1147 R_Q1BSP_LoadSplitSky
1149 A sky texture is 256*128, with the right side being a masked overlay
1152 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1155 unsigned solidpixels[128*128], alphapixels[128*128];
1157 // if sky isn't the right size, just use it as a solid layer
1158 if (width != 256 || height != 128)
1160 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);
1161 loadmodel->brush.alphaskytexture = NULL;
1165 if (bytesperpixel == 4)
1167 for (i = 0;i < 128;i++)
1169 for (j = 0;j < 128;j++)
1171 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1172 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1178 // make an average value for the back to avoid
1179 // a fringe on the top level
1188 for (i = 0;i < 128;i++)
1190 for (j = 0;j < 128;j++)
1192 rgba.i = palette_complete[src[i*256 + j + 128]];
1198 rgba.b[0] = r/(128*128);
1199 rgba.b[1] = g/(128*128);
1200 rgba.b[2] = b/(128*128);
1202 for (i = 0;i < 128;i++)
1204 for (j = 0;j < 128;j++)
1206 solidpixels[(i*128) + j] = palette_complete[src[i*256 + j + 128]];
1207 alphapixels[(i*128) + j] = (p = src[i*256 + j]) ? palette_complete[p] : rgba.i;
1212 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_RGBA, TEXF_PRECACHE, NULL);
1213 loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_RGBA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1216 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1218 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1220 texture_t *tx, *tx2, *anims[10], *altanims[10];
1222 unsigned char *data, *mtdata;
1223 char name[MAX_QPATH];
1225 loadmodel->data_textures = NULL;
1227 // add two slots for notexture walls and notexture liquids
1230 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1231 m->nummiptex = LittleLong (m->nummiptex);
1232 loadmodel->num_textures = m->nummiptex + 2;
1237 loadmodel->num_textures = 2;
1240 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1242 // fill out all slots with notexture
1243 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1245 strcpy(tx->name, "NO TEXTURE FOUND");
1248 tx->skin.base = r_texture_notexture;
1249 tx->basematerialflags = 0;
1250 if (i == loadmodel->num_textures - 1)
1252 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES;
1253 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1254 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1258 tx->basematerialflags |= MATERIALFLAG_WALL;
1259 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1260 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1262 tx->currentframe = tx;
1268 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1270 // LordHavoc: mostly rewritten map texture loader
1271 for (i = 0;i < m->nummiptex;i++)
1273 dofs[i] = LittleLong(dofs[i]);
1274 if (dofs[i] == -1 || r_nosurftextures.integer)
1276 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1278 // make sure name is no more than 15 characters
1279 for (j = 0;dmiptex->name[j] && j < 15;j++)
1280 name[j] = dmiptex->name[j];
1283 mtwidth = LittleLong(dmiptex->width);
1284 mtheight = LittleLong(dmiptex->height);
1286 j = LittleLong(dmiptex->offsets[0]);
1290 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1292 Con_Printf("Texture \"%s\" in \"%s\"is corrupt or incomplete\n", dmiptex->name, loadmodel->name);
1295 mtdata = (unsigned char *)dmiptex + j;
1298 if ((mtwidth & 15) || (mtheight & 15))
1299 Con_Printf("warning: texture \"%s\" in \"%s\" is not 16 aligned\n", dmiptex->name, loadmodel->name);
1301 // LordHavoc: force all names to lowercase
1302 for (j = 0;name[j];j++)
1303 if (name[j] >= 'A' && name[j] <= 'Z')
1304 name[j] += 'a' - 'A';
1306 tx = loadmodel->data_textures + i;
1307 strcpy(tx->name, name);
1308 tx->width = mtwidth;
1309 tx->height = mtheight;
1313 sprintf(tx->name, "unnamed%i", i);
1314 Con_Printf("warning: unnamed texture in %s, renaming to %s\n", loadmodel->name, tx->name);
1317 if (cls.state != ca_dedicated)
1319 // LordHavoc: HL sky textures are entirely different than quake
1320 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1322 if (loadmodel->isworldmodel)
1324 data = loadimagepixels(tx->name, false, 0, 0);
1327 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1330 else if (mtdata != NULL)
1331 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1336 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))
1338 // did not find external texture, load it from the bsp or wad3
1339 if (loadmodel->brush.ishlbsp)
1341 // internal texture overrides wad
1342 unsigned char *pixels, *freepixels;
1343 pixels = freepixels = NULL;
1345 pixels = W_ConvertWAD3Texture(dmiptex);
1347 pixels = freepixels = W_GetTexture(tx->name);
1350 tx->width = image_width;
1351 tx->height = image_height;
1352 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);
1355 Mem_Free(freepixels);
1357 else if (mtdata) // texture included
1358 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);
1361 if (tx->skin.base == NULL)
1366 tx->skin.base = r_texture_notexture;
1370 tx->basematerialflags = 0;
1371 if (tx->name[0] == '*')
1373 // LordHavoc: some turbulent textures should not be affected by wateralpha
1374 if (strncmp(tx->name,"*lava",5)
1375 && strncmp(tx->name,"*teleport",9)
1376 && strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1377 tx->basematerialflags |= MATERIALFLAG_WATERALPHA;
1378 if (!strncmp(tx->name, "*lava", 5))
1380 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1381 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1383 else if (!strncmp(tx->name, "*slime", 6))
1385 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1386 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1390 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1391 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1393 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES;
1395 else if (tx->name[0] == 's' && tx->name[1] == 'k' && tx->name[2] == 'y')
1397 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1398 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1399 tx->basematerialflags |= MATERIALFLAG_SKY;
1403 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1404 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1405 tx->basematerialflags |= MATERIALFLAG_WALL;
1408 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
1410 // start out with no animation
1411 tx->currentframe = tx;
1414 // sequence the animations
1415 for (i = 0;i < m->nummiptex;i++)
1417 tx = loadmodel->data_textures + i;
1418 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1420 if (tx->anim_total[0] || tx->anim_total[1])
1421 continue; // already sequenced
1423 // find the number of frames in the animation
1424 memset(anims, 0, sizeof(anims));
1425 memset(altanims, 0, sizeof(altanims));
1427 for (j = i;j < m->nummiptex;j++)
1429 tx2 = loadmodel->data_textures + j;
1430 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1434 if (num >= '0' && num <= '9')
1435 anims[num - '0'] = tx2;
1436 else if (num >= 'a' && num <= 'j')
1437 altanims[num - 'a'] = tx2;
1439 Con_Printf("Bad animating texture %s\n", tx->name);
1443 for (j = 0;j < 10;j++)
1450 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1453 for (j = 0;j < max;j++)
1457 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1461 for (j = 0;j < altmax;j++)
1465 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1474 // if there is no alternate animation, duplicate the primary
1475 // animation into the alternate
1477 for (k = 0;k < 10;k++)
1478 altanims[k] = anims[k];
1481 // link together the primary animation
1482 for (j = 0;j < max;j++)
1485 tx2->animated = true;
1486 tx2->anim_total[0] = max;
1487 tx2->anim_total[1] = altmax;
1488 for (k = 0;k < 10;k++)
1490 tx2->anim_frames[0][k] = anims[k];
1491 tx2->anim_frames[1][k] = altanims[k];
1495 // if there really is an alternate anim...
1496 if (anims[0] != altanims[0])
1498 // link together the alternate animation
1499 for (j = 0;j < altmax;j++)
1502 tx2->animated = true;
1503 // the primary/alternate are reversed here
1504 tx2->anim_total[0] = altmax;
1505 tx2->anim_total[1] = max;
1506 for (k = 0;k < 10;k++)
1508 tx2->anim_frames[0][k] = altanims[k];
1509 tx2->anim_frames[1][k] = anims[k];
1516 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1519 unsigned char *in, *out, *data, d;
1520 char litfilename[MAX_QPATH];
1521 char dlitfilename[MAX_QPATH];
1522 fs_offset_t filesize;
1523 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1525 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1526 for (i=0; i<l->filelen; i++)
1527 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1529 else if (loadmodel->brush.ismcbsp)
1531 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1532 memcpy(loadmodel->brushq1.lightdata, mod_base + l->fileofs, l->filelen);
1534 else // LordHavoc: bsp version 29 (normal white lighting)
1536 // LordHavoc: hope is not lost yet, check for a .lit file to load
1537 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1538 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1539 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1540 strlcat (litfilename, ".lit", sizeof (litfilename));
1541 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1542 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1545 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1547 i = LittleLong(((int *)data)[1]);
1550 Con_DPrintf("loaded %s\n", litfilename);
1551 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1552 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1554 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1557 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1559 i = LittleLong(((int *)data)[1]);
1562 Con_DPrintf("loaded %s\n", dlitfilename);
1563 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1564 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1565 loadmodel->brushq3.deluxemapping_modelspace = false;
1566 loadmodel->brushq3.deluxemapping = true;
1575 Con_Printf("Unknown .lit file version (%d)\n", i);
1577 else if (filesize == 8)
1578 Con_Print("Empty .lit file, ignoring\n");
1580 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", filesize, 8 + l->filelen * 3);
1587 // LordHavoc: oh well, expand the white lighting data
1590 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1591 in = mod_base + l->fileofs;
1592 out = loadmodel->brushq1.lightdata;
1593 for (i = 0;i < l->filelen;i++)
1603 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1605 loadmodel->brushq1.num_compressedpvs = 0;
1606 loadmodel->brushq1.data_compressedpvs = NULL;
1609 loadmodel->brushq1.num_compressedpvs = l->filelen;
1610 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1611 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1614 // used only for HalfLife maps
1615 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1617 char key[128], value[4096];
1622 if (!COM_ParseToken(&data, false))
1624 if (com_token[0] != '{')
1628 if (!COM_ParseToken(&data, false))
1630 if (com_token[0] == '}')
1631 break; // end of worldspawn
1632 if (com_token[0] == '_')
1633 strcpy(key, com_token + 1);
1635 strcpy(key, com_token);
1636 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1637 key[strlen(key)-1] = 0;
1638 if (!COM_ParseToken(&data, false))
1640 dpsnprintf(value, sizeof(value), "%s", com_token);
1641 if (!strcmp("wad", key)) // for HalfLife maps
1643 if (loadmodel->brush.ishlbsp)
1646 for (i = 0;i < (int)sizeof(value);i++)
1647 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1651 for (;i < (int)sizeof(value);i++)
1653 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1654 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1656 else if (value[i] == ';' || value[i] == 0)
1660 strcpy(wadname, "textures/");
1661 strcat(wadname, &value[j]);
1662 W_LoadTextureWadFile(wadname, false);
1674 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1676 loadmodel->brush.entities = NULL;
1679 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1680 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1681 if (loadmodel->brush.ishlbsp)
1682 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1686 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1692 in = (dvertex_t *)(mod_base + l->fileofs);
1693 if (l->filelen % sizeof(*in))
1694 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1695 count = l->filelen / sizeof(*in);
1696 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1698 loadmodel->brushq1.vertexes = out;
1699 loadmodel->brushq1.numvertexes = count;
1701 for ( i=0 ; i<count ; i++, in++, out++)
1703 out->position[0] = LittleFloat(in->point[0]);
1704 out->position[1] = LittleFloat(in->point[1]);
1705 out->position[2] = LittleFloat(in->point[2]);
1709 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1710 // can be used for this
1712 int SB_ReadInt (unsigned char **buffer)
1715 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1721 float SB_ReadFloat (unsigned char **buffer)
1729 u.i = SB_ReadInt (buffer);
1733 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1735 unsigned char *index;
1739 index = (unsigned char *)(mod_base + l->fileofs);
1740 if (l->filelen % (48+4*hullinfo->filehulls))
1741 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1743 count = l->filelen / (48+4*hullinfo->filehulls);
1744 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1746 loadmodel->brushq1.submodels = out;
1747 loadmodel->brush.numsubmodels = count;
1749 for (i = 0; i < count; i++, out++)
1751 // spread out the mins / maxs by a pixel
1752 out->mins[0] = SB_ReadFloat (&index) - 1;
1753 out->mins[1] = SB_ReadFloat (&index) - 1;
1754 out->mins[2] = SB_ReadFloat (&index) - 1;
1755 out->maxs[0] = SB_ReadFloat (&index) + 1;
1756 out->maxs[1] = SB_ReadFloat (&index) + 1;
1757 out->maxs[2] = SB_ReadFloat (&index) + 1;
1758 out->origin[0] = SB_ReadFloat (&index);
1759 out->origin[1] = SB_ReadFloat (&index);
1760 out->origin[2] = SB_ReadFloat (&index);
1761 for (j = 0; j < hullinfo->filehulls; j++)
1762 out->headnode[j] = SB_ReadInt (&index);
1763 out->visleafs = SB_ReadInt (&index);
1764 out->firstface = SB_ReadInt (&index);
1765 out->numfaces = SB_ReadInt (&index);
1769 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1775 in = (dedge_t *)(mod_base + l->fileofs);
1776 if (l->filelen % sizeof(*in))
1777 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1778 count = l->filelen / sizeof(*in);
1779 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1781 loadmodel->brushq1.edges = out;
1782 loadmodel->brushq1.numedges = count;
1784 for ( i=0 ; i<count ; i++, in++, out++)
1786 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1787 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1788 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1790 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);
1797 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1801 int i, j, k, count, miptex;
1803 in = (texinfo_t *)(mod_base + l->fileofs);
1804 if (l->filelen % sizeof(*in))
1805 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1806 count = l->filelen / sizeof(*in);
1807 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1809 loadmodel->brushq1.texinfo = out;
1810 loadmodel->brushq1.numtexinfo = count;
1812 for (i = 0;i < count;i++, in++, out++)
1814 for (k = 0;k < 2;k++)
1815 for (j = 0;j < 4;j++)
1816 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1818 miptex = LittleLong(in->miptex);
1819 out->flags = LittleLong(in->flags);
1821 out->texture = NULL;
1822 if (loadmodel->data_textures)
1824 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1825 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1827 out->texture = loadmodel->data_textures + miptex;
1829 if (out->flags & TEX_SPECIAL)
1831 // if texture chosen is NULL or the shader needs a lightmap,
1832 // force to notexture water shader
1833 if (out->texture == NULL || out->texture->basematerialflags & MATERIALFLAG_WALL)
1834 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1838 // if texture chosen is NULL, force to notexture
1839 if (out->texture == NULL)
1840 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1846 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1851 mins[0] = mins[1] = mins[2] = 9999;
1852 maxs[0] = maxs[1] = maxs[2] = -9999;
1854 for (i = 0;i < numverts;i++)
1856 for (j = 0;j < 3;j++, v++)
1866 #define MAX_SUBDIVPOLYTRIANGLES 4096
1867 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
1869 static int subdivpolyverts, subdivpolytriangles;
1870 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
1871 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
1873 static int subdivpolylookupvert(vec3_t v)
1876 for (i = 0;i < subdivpolyverts;i++)
1877 if (subdivpolyvert[i][0] == v[0]
1878 && subdivpolyvert[i][1] == v[1]
1879 && subdivpolyvert[i][2] == v[2])
1881 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
1882 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
1883 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
1884 return subdivpolyverts++;
1887 static void SubdividePolygon(int numverts, float *verts)
1889 int i, i1, i2, i3, f, b, c, p;
1890 vec3_t mins, maxs, front[256], back[256];
1891 float m, *pv, *cv, dist[256], frac;
1894 Host_Error("SubdividePolygon: ran out of verts in buffer");
1896 BoundPoly(numverts, verts, mins, maxs);
1898 for (i = 0;i < 3;i++)
1900 m = (mins[i] + maxs[i]) * 0.5;
1901 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
1902 if (maxs[i] - m < 8)
1904 if (m - mins[i] < 8)
1908 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
1909 dist[c] = cv[i] - m;
1912 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
1916 VectorCopy(pv, front[f]);
1921 VectorCopy(pv, back[b]);
1924 if (dist[p] == 0 || dist[c] == 0)
1926 if ((dist[p] > 0) != (dist[c] > 0) )
1929 frac = dist[p] / (dist[p] - dist[c]);
1930 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
1931 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
1932 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
1938 SubdividePolygon(f, front[0]);
1939 SubdividePolygon(b, back[0]);
1943 i1 = subdivpolylookupvert(verts);
1944 i2 = subdivpolylookupvert(verts + 3);
1945 for (i = 2;i < numverts;i++)
1947 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
1949 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
1953 i3 = subdivpolylookupvert(verts + i * 3);
1954 subdivpolyindex[subdivpolytriangles][0] = i1;
1955 subdivpolyindex[subdivpolytriangles][1] = i2;
1956 subdivpolyindex[subdivpolytriangles][2] = i3;
1958 subdivpolytriangles++;
1962 //Breaks a polygon up along axial 64 unit
1963 //boundaries so that turbulent and sky warps
1964 //can be done reasonably.
1965 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
1971 subdivpolytriangles = 0;
1972 subdivpolyverts = 0;
1973 SubdividePolygon(surface->num_vertices, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex));
1974 if (subdivpolytriangles < 1)
1975 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
1977 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
1978 mesh->num_vertices = subdivpolyverts;
1979 mesh->num_triangles = subdivpolytriangles;
1980 mesh->vertex = (surfvertex_t *)(mesh + 1);
1981 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
1982 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
1984 for (i = 0;i < mesh->num_triangles;i++)
1985 for (j = 0;j < 3;j++)
1986 mesh->index[i*3+j] = subdivpolyindex[i][j];
1988 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
1990 VectorCopy(subdivpolyvert[i], v->v);
1991 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
1992 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
1997 static qboolean Mod_Q1BSP_AllocLightmapBlock(int *lineused, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2000 int bestx = totalwidth, besty = 0;
2001 // find the left-most space we can find
2002 for (y = 0;y <= totalheight - blockheight;y++)
2005 for (y2 = 0;y2 < blockheight;y2++)
2006 x2 = max(x2, lineused[y+y2]);
2013 // if the best was not good enough, return failure
2014 if (bestx > totalwidth - blockwidth)
2016 // we found a good spot
2021 // now mark the space used
2022 for (y2 = 0;y2 < blockheight;y2++)
2023 lineused[besty+y2] = bestx + blockwidth;
2028 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2031 msurface_t *surface;
2032 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber;
2033 float texmins[2], texmaxs[2], val, lightmaptexcoordscale;
2034 #define LIGHTMAPSIZE 256
2035 rtexture_t *lightmaptexture, *deluxemaptexture;
2036 int lightmap_lineused[LIGHTMAPSIZE];
2038 in = (dface_t *)(mod_base + l->fileofs);
2039 if (l->filelen % sizeof(*in))
2040 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2041 count = l->filelen / sizeof(*in);
2042 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2043 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2045 loadmodel->num_surfaces = count;
2049 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2051 numedges = LittleShort(in->numedges);
2052 totalverts += numedges;
2053 totaltris += numedges - 2;
2056 // TODO: split up into multiple meshes as needed to avoid exceeding 65536
2058 loadmodel->nummeshes = 1;
2059 loadmodel->meshlist = (surfmesh_t **)Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *));
2060 loadmodel->meshlist[0] = Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2062 lightmaptexture = NULL;
2063 deluxemaptexture = r_texture_blanknormalmap;
2065 lightmaptexcoordscale = 1.0f / (float)LIGHTMAPSIZE;
2069 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2071 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2073 // FIXME: validate edges, texinfo, etc?
2074 firstedge = LittleLong(in->firstedge);
2075 numedges = LittleShort(in->numedges);
2076 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)
2077 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2078 i = LittleShort(in->texinfo);
2079 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2080 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2081 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2082 surface->texture = surface->lightmapinfo->texinfo->texture;
2084 planenum = LittleShort(in->planenum);
2085 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2086 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2088 //surface->flags = surface->texture->flags;
2089 //if (LittleShort(in->side))
2090 // surface->flags |= SURF_PLANEBACK;
2091 //surface->plane = loadmodel->brush.data_planes + planenum;
2093 surface->groupmesh = loadmodel->meshlist[0];
2094 surface->num_firstvertex = totalverts;
2095 surface->num_vertices = numedges;
2096 surface->num_firsttriangle = totaltris;
2097 surface->num_triangles = numedges - 2;
2098 totalverts += numedges;
2099 totaltris += numedges - 2;
2101 // convert edges back to a normal polygon
2102 for (i = 0;i < surface->num_vertices;i++)
2104 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2107 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2109 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2110 s = DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2111 t = DotProduct(((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2112 (surface->groupmesh->data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2113 (surface->groupmesh->data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2114 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2115 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2116 (surface->groupmesh->data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2119 for (i = 0;i < surface->num_triangles;i++)
2121 (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2122 (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2123 (surface->groupmesh->data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2126 // compile additional data about the surface geometry
2127 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);
2128 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex));
2130 // generate surface extents information
2131 texmins[0] = texmaxs[0] = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2132 texmins[1] = texmaxs[1] = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2133 for (i = 1;i < surface->num_vertices;i++)
2135 for (j = 0;j < 2;j++)
2137 val = DotProduct((surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2138 texmins[j] = min(texmins[j], val);
2139 texmaxs[j] = max(texmaxs[j], val);
2142 for (i = 0;i < 2;i++)
2144 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2145 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2148 smax = surface->lightmapinfo->extents[0] >> 4;
2149 tmax = surface->lightmapinfo->extents[1] >> 4;
2150 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2151 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2154 for (i = 0;i < MAXLIGHTMAPS;i++)
2155 surface->lightmapinfo->styles[i] = in->styles[i];
2156 surface->lightmaptexture = NULL;
2157 surface->deluxemaptexture = r_texture_blanknormalmap;
2158 i = LittleLong(in->lightofs);
2161 surface->lightmapinfo->samples = NULL;
2162 // give non-lightmapped water a 1x white lightmap
2163 if ((surface->texture->basematerialflags & MATERIALFLAG_WATER) && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2165 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2166 surface->lightmapinfo->styles[0] = 0;
2167 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2170 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2171 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2172 else // LordHavoc: white lighting (bsp version 29)
2174 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2175 if (loadmodel->brushq1.nmaplightdata)
2176 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2179 // check if we should apply a lightmap to this
2180 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2182 int i, iu, iv, lightmapx, lightmapy;
2183 float u, v, ubase, vbase, uscale, vscale;
2185 if (ssize > 256 || tsize > 256)
2186 Host_Error("Bad surface extents");
2187 // force lightmap upload on first time seeing the surface
2188 surface->cached_dlight = true;
2189 // stainmap for permanent marks on walls
2190 surface->lightmapinfo->stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2192 memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
2194 // find a place for this lightmap
2195 if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(lightmap_lineused, LIGHTMAPSIZE, LIGHTMAPSIZE, ssize, tsize, &lightmapx, &lightmapy))
2197 // could not find room, make a new lightmap
2198 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), LIGHTMAPSIZE, LIGHTMAPSIZE, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2199 if (loadmodel->brushq1.nmaplightdata)
2200 deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), LIGHTMAPSIZE, LIGHTMAPSIZE, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2202 memset(lightmap_lineused, 0, sizeof(lightmap_lineused));
2203 Mod_Q1BSP_AllocLightmapBlock(lightmap_lineused, LIGHTMAPSIZE, LIGHTMAPSIZE, ssize, tsize, &lightmapx, &lightmapy);
2206 surface->lightmaptexture = lightmaptexture;
2207 surface->deluxemaptexture = deluxemaptexture;
2208 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2209 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2211 ubase = lightmapx * lightmaptexcoordscale;
2212 vbase = lightmapy * lightmaptexcoordscale;
2213 uscale = lightmaptexcoordscale;
2214 vscale = lightmaptexcoordscale;
2216 for (i = 0;i < surface->num_vertices;i++)
2218 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);
2219 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);
2220 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2221 (surface->groupmesh->data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2222 // LordHavoc: calc lightmap data offset for vertex lighting to use
2225 (surface->groupmesh->data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2231 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2234 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2235 node->parent = parent;
2238 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2239 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2243 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2249 in = (dnode_t *)(mod_base + l->fileofs);
2250 if (l->filelen % sizeof(*in))
2251 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2252 count = l->filelen / sizeof(*in);
2253 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2255 loadmodel->brush.data_nodes = out;
2256 loadmodel->brush.num_nodes = count;
2258 for ( i=0 ; i<count ; i++, in++, out++)
2260 for (j=0 ; j<3 ; j++)
2262 out->mins[j] = LittleShort(in->mins[j]);
2263 out->maxs[j] = LittleShort(in->maxs[j]);
2266 p = LittleLong(in->planenum);
2267 out->plane = loadmodel->brush.data_planes + p;
2269 out->firstsurface = LittleShort(in->firstface);
2270 out->numsurfaces = LittleShort(in->numfaces);
2272 for (j=0 ; j<2 ; j++)
2274 p = LittleShort(in->children[j]);
2276 out->children[j] = loadmodel->brush.data_nodes + p;
2278 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + (-1 - p));
2282 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2285 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2291 in = (dleaf_t *)(mod_base + l->fileofs);
2292 if (l->filelen % sizeof(*in))
2293 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2294 count = l->filelen / sizeof(*in);
2295 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2297 loadmodel->brush.data_leafs = out;
2298 loadmodel->brush.num_leafs = count;
2299 // get visleafs from the submodel data
2300 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2301 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2302 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2303 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2305 for ( i=0 ; i<count ; i++, in++, out++)
2307 for (j=0 ; j<3 ; j++)
2309 out->mins[j] = LittleShort(in->mins[j]);
2310 out->maxs[j] = LittleShort(in->maxs[j]);
2313 // FIXME: this function could really benefit from some error checking
2315 out->contents = LittleLong(in->contents);
2317 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + LittleShort(in->firstmarksurface);
2318 out->numleafsurfaces = LittleShort(in->nummarksurfaces);
2319 if (out->firstleafsurface < 0 || LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2321 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);
2322 out->firstleafsurface = NULL;
2323 out->numleafsurfaces = 0;
2326 out->clusterindex = i - 1;
2327 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2328 out->clusterindex = -1;
2330 p = LittleLong(in->visofs);
2331 // ignore visofs errors on leaf 0 (solid)
2332 if (p >= 0 && out->clusterindex >= 0)
2334 if (p >= loadmodel->brushq1.num_compressedpvs)
2335 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2337 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);
2340 for (j = 0;j < 4;j++)
2341 out->ambient_sound_level[j] = in->ambient_level[j];
2343 // FIXME: Insert caustics here
2347 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2349 dclipnode_t *in, *out;
2353 in = (dclipnode_t *)(mod_base + l->fileofs);
2354 if (l->filelen % sizeof(*in))
2355 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2356 count = l->filelen / sizeof(*in);
2357 out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2359 loadmodel->brushq1.clipnodes = out;
2360 loadmodel->brushq1.numclipnodes = count;
2362 for (i = 1; i < hullinfo->numhulls; i++)
2364 hull = &loadmodel->brushq1.hulls[i];
2365 hull->clipnodes = out;
2366 hull->firstclipnode = 0;
2367 hull->lastclipnode = count-1;
2368 hull->planes = loadmodel->brush.data_planes;
2369 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2370 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2371 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2372 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2373 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2374 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2375 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2378 for (i=0 ; i<count ; i++, out++, in++)
2380 out->planenum = LittleLong(in->planenum);
2381 out->children[0] = LittleShort(in->children[0]);
2382 out->children[1] = LittleShort(in->children[1]);
2383 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2384 Host_Error("Corrupt clipping hull(out of range planenum)");
2385 if (out->children[0] >= count || out->children[1] >= count)
2386 Host_Error("Corrupt clipping hull(out of range child)");
2390 //Duplicate the drawing hull structure as a clipping hull
2391 static void Mod_Q1BSP_MakeHull0(void)
2398 hull = &loadmodel->brushq1.hulls[0];
2400 in = loadmodel->brush.data_nodes;
2401 out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(dclipnode_t));
2403 hull->clipnodes = out;
2404 hull->firstclipnode = 0;
2405 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2406 hull->planes = loadmodel->brush.data_planes;
2408 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2410 out->planenum = in->plane - loadmodel->brush.data_planes;
2411 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2412 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2416 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2421 in = (short *)(mod_base + l->fileofs);
2422 if (l->filelen % sizeof(*in))
2423 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2424 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2425 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2427 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2429 j = (unsigned) LittleShort(in[i]);
2430 if (j >= loadmodel->num_surfaces)
2431 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2432 loadmodel->brush.data_leafsurfaces[i] = j;
2436 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2441 in = (int *)(mod_base + l->fileofs);
2442 if (l->filelen % sizeof(*in))
2443 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2444 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2445 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2447 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2448 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2452 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2458 in = (dplane_t *)(mod_base + l->fileofs);
2459 if (l->filelen % sizeof(*in))
2460 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2462 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2463 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2465 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2467 out->normal[0] = LittleFloat(in->normal[0]);
2468 out->normal[1] = LittleFloat(in->normal[1]);
2469 out->normal[2] = LittleFloat(in->normal[2]);
2470 out->dist = LittleFloat(in->dist);
2476 static void Mod_Q1BSP_LoadMapBrushes(void)
2480 int submodel, numbrushes;
2481 qboolean firstbrush;
2482 char *text, *maptext;
2483 char mapfilename[MAX_QPATH];
2484 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2485 strlcat (mapfilename, ".map", sizeof (mapfilename));
2486 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2490 if (!COM_ParseToken(&data, false))
2495 if (!COM_ParseToken(&data, false))
2497 if (com_token[0] != '{')
2503 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2506 if (!COM_ParseToken(&data, false))
2508 if (com_token[0] == '}')
2509 break; // end of entity
2510 if (com_token[0] == '{')
2517 if (submodel > loadmodel->brush.numsubmodels)
2519 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2523 model = loadmodel->brush.submodels[submodel];
2530 if (!COM_ParseToken(&data, false))
2532 if (com_token[0] == '}')
2533 break; // end of brush
2534 // each brush face should be this format:
2535 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2536 // FIXME: support hl .map format
2537 for (pointnum = 0;pointnum < 3;pointnum++)
2539 COM_ParseToken(&data, false);
2540 for (componentnum = 0;componentnum < 3;componentnum++)
2542 COM_ParseToken(&data, false);
2543 point[pointnum][componentnum] = atof(com_token);
2545 COM_ParseToken(&data, false);
2547 COM_ParseToken(&data, false);
2548 strlcpy(facetexture, com_token, sizeof(facetexture));
2549 COM_ParseToken(&data, false);
2550 //scroll_s = atof(com_token);
2551 COM_ParseToken(&data, false);
2552 //scroll_t = atof(com_token);
2553 COM_ParseToken(&data, false);
2554 //rotate = atof(com_token);
2555 COM_ParseToken(&data, false);
2556 //scale_s = atof(com_token);
2557 COM_ParseToken(&data, false);
2558 //scale_t = atof(com_token);
2559 TriangleNormal(point[0], point[1], point[2], planenormal);
2560 VectorNormalizeDouble(planenormal);
2561 planedist = DotProduct(point[0], planenormal);
2562 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2572 #define MAX_PORTALPOINTS 64
2574 typedef struct portal_s
2577 mnode_t *nodes[2]; // [0] = front side of plane
2578 struct portal_s *next[2];
2580 double points[3*MAX_PORTALPOINTS];
2581 struct portal_s *chain; // all portals are linked into a list
2585 static portal_t *portalchain;
2592 static portal_t *AllocPortal(void)
2595 p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2596 p->chain = portalchain;
2601 static void FreePortal(portal_t *p)
2606 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2608 // process only nodes (leafs already had their box calculated)
2612 // calculate children first
2613 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2614 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2616 // make combined bounding box from children
2617 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2618 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2619 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2620 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2621 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2622 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2625 static void Mod_Q1BSP_FinalizePortals(void)
2627 int i, j, numportals, numpoints;
2628 portal_t *p, *pnext;
2631 mleaf_t *leaf, *endleaf;
2633 // tally up portal and point counts and recalculate bounding boxes for all
2634 // leafs (because qbsp is very sloppy)
2635 leaf = loadmodel->brush.data_leafs;
2636 endleaf = leaf + loadmodel->brush.num_leafs;
2637 for (;leaf < endleaf;leaf++)
2639 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2640 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2647 // note: this check must match the one below or it will usually corrupt memory
2648 // 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
2649 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2652 numpoints += p->numpoints * 2;
2656 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2657 loadmodel->brush.num_portals = numportals;
2658 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2659 loadmodel->brush.num_portalpoints = numpoints;
2660 // clear all leaf portal chains
2661 for (i = 0;i < loadmodel->brush.num_leafs;i++)
2662 loadmodel->brush.data_leafs[i].portals = NULL;
2663 // process all portals in the global portal chain, while freeing them
2664 portal = loadmodel->brush.data_portals;
2665 point = loadmodel->brush.data_portalpoints;
2672 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2674 // note: this check must match the one above or it will usually corrupt memory
2675 // 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
2676 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2678 // first make the back to front portal(forward portal)
2679 portal->points = point;
2680 portal->numpoints = p->numpoints;
2681 portal->plane.dist = p->plane.dist;
2682 VectorCopy(p->plane.normal, portal->plane.normal);
2683 portal->here = (mleaf_t *)p->nodes[1];
2684 portal->past = (mleaf_t *)p->nodes[0];
2686 for (j = 0;j < portal->numpoints;j++)
2688 VectorCopy(p->points + j*3, point->position);
2691 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2692 PlaneClassify(&portal->plane);
2694 // link into leaf's portal chain
2695 portal->next = portal->here->portals;
2696 portal->here->portals = portal;
2698 // advance to next portal
2701 // then make the front to back portal(backward portal)
2702 portal->points = point;
2703 portal->numpoints = p->numpoints;
2704 portal->plane.dist = -p->plane.dist;
2705 VectorNegate(p->plane.normal, portal->plane.normal);
2706 portal->here = (mleaf_t *)p->nodes[0];
2707 portal->past = (mleaf_t *)p->nodes[1];
2709 for (j = portal->numpoints - 1;j >= 0;j--)
2711 VectorCopy(p->points + j*3, point->position);
2714 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2715 PlaneClassify(&portal->plane);
2717 // link into leaf's portal chain
2718 portal->next = portal->here->portals;
2719 portal->here->portals = portal;
2721 // advance to next portal
2724 // add the portal's polygon points to the leaf bounding boxes
2725 for (i = 0;i < 2;i++)
2727 leaf = (mleaf_t *)p->nodes[i];
2728 for (j = 0;j < p->numpoints;j++)
2730 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
2731 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
2732 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
2733 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
2734 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
2735 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
2742 // now recalculate the node bounding boxes from the leafs
2743 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
2751 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2754 Host_Error("AddPortalToNodes: NULL front node");
2756 Host_Error("AddPortalToNodes: NULL back node");
2757 if (p->nodes[0] || p->nodes[1])
2758 Host_Error("AddPortalToNodes: already included");
2759 // 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
2761 p->nodes[0] = front;
2762 p->next[0] = (portal_t *)front->portals;
2763 front->portals = (mportal_t *)p;
2766 p->next[1] = (portal_t *)back->portals;
2767 back->portals = (mportal_t *)p;
2772 RemovePortalFromNode
2775 static void RemovePortalFromNodes(portal_t *portal)
2779 void **portalpointer;
2781 for (i = 0;i < 2;i++)
2783 node = portal->nodes[i];
2785 portalpointer = (void **) &node->portals;
2788 t = (portal_t *)*portalpointer;
2790 Host_Error("RemovePortalFromNodes: portal not in leaf");
2794 if (portal->nodes[0] == node)
2796 *portalpointer = portal->next[0];
2797 portal->nodes[0] = NULL;
2799 else if (portal->nodes[1] == node)
2801 *portalpointer = portal->next[1];
2802 portal->nodes[1] = NULL;
2805 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2809 if (t->nodes[0] == node)
2810 portalpointer = (void **) &t->next[0];
2811 else if (t->nodes[1] == node)
2812 portalpointer = (void **) &t->next[1];
2814 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2819 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
2822 mnode_t *front, *back, *other_node;
2823 mplane_t clipplane, *plane;
2824 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
2825 int numfrontpoints, numbackpoints;
2826 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
2828 // if a leaf, we're done
2832 plane = node->plane;
2834 front = node->children[0];
2835 back = node->children[1];
2837 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
2839 // create the new portal by generating a polygon for the node plane,
2840 // and clipping it by all of the other portals(which came from nodes above this one)
2841 nodeportal = AllocPortal();
2842 nodeportal->plane = *plane;
2844 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);
2845 nodeportal->numpoints = 4;
2846 side = 0; // shut up compiler warning
2847 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
2849 clipplane = portal->plane;
2850 if (portal->nodes[0] == portal->nodes[1])
2851 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
2852 if (portal->nodes[0] == node)
2854 else if (portal->nodes[1] == node)
2856 clipplane.dist = -clipplane.dist;
2857 VectorNegate(clipplane.normal, clipplane.normal);
2861 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2863 for (i = 0;i < nodeportal->numpoints*3;i++)
2864 frontpoints[i] = nodeportal->points[i];
2865 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);
2866 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
2870 if (nodeportal->numpoints < 3)
2872 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
2873 nodeportal->numpoints = 0;
2875 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
2877 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
2878 nodeportal->numpoints = 0;
2881 AddPortalToNodes(nodeportal, front, back);
2883 // split the portals of this node along this node's plane and assign them to the children of this node
2884 // (migrating the portals downward through the tree)
2885 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
2887 if (portal->nodes[0] == portal->nodes[1])
2888 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
2889 if (portal->nodes[0] == node)
2891 else if (portal->nodes[1] == node)
2894 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
2895 nextportal = portal->next[side];
2896 if (!portal->numpoints)
2899 other_node = portal->nodes[!side];
2900 RemovePortalFromNodes(portal);
2902 // cut the portal into two portals, one on each side of the node plane
2903 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);
2905 if (!numfrontpoints)
2908 AddPortalToNodes(portal, back, other_node);
2910 AddPortalToNodes(portal, other_node, back);
2916 AddPortalToNodes(portal, front, other_node);
2918 AddPortalToNodes(portal, other_node, front);
2922 // the portal is split
2923 splitportal = AllocPortal();
2924 temp = splitportal->chain;
2925 *splitportal = *portal;
2926 splitportal->chain = temp;
2927 for (i = 0;i < numbackpoints*3;i++)
2928 splitportal->points[i] = backpoints[i];
2929 splitportal->numpoints = numbackpoints;
2930 for (i = 0;i < numfrontpoints*3;i++)
2931 portal->points[i] = frontpoints[i];
2932 portal->numpoints = numfrontpoints;
2936 AddPortalToNodes(portal, front, other_node);
2937 AddPortalToNodes(splitportal, back, other_node);
2941 AddPortalToNodes(portal, other_node, front);
2942 AddPortalToNodes(splitportal, other_node, back);
2946 Mod_Q1BSP_RecursiveNodePortals(front);
2947 Mod_Q1BSP_RecursiveNodePortals(back);
2950 static void Mod_Q1BSP_MakePortals(void)
2953 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
2954 Mod_Q1BSP_FinalizePortals();
2957 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
2959 int i, j, stylecounts[256], totalcount, remapstyles[256];
2960 msurface_t *surface;
2961 memset(stylecounts, 0, sizeof(stylecounts));
2962 for (i = 0;i < model->nummodelsurfaces;i++)
2964 surface = model->data_surfaces + model->firstmodelsurface + i;
2965 for (j = 0;j < MAXLIGHTMAPS;j++)
2966 stylecounts[surface->lightmapinfo->styles[j]]++;
2969 model->brushq1.light_styles = 0;
2970 for (i = 0;i < 255;i++)
2974 remapstyles[i] = model->brushq1.light_styles++;
2975 totalcount += stylecounts[i] + 1;
2980 model->brushq1.light_style = (unsigned char *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(unsigned char));
2981 model->brushq1.light_stylevalue = (int *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
2982 model->brushq1.light_styleupdatechains = (msurface_t ***)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
2983 model->brushq1.light_styleupdatechainsbuffer = (msurface_t **)Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
2984 model->brushq1.light_styles = 0;
2985 for (i = 0;i < 255;i++)
2987 model->brushq1.light_style[model->brushq1.light_styles++] = i;
2989 for (i = 0;i < model->brushq1.light_styles;i++)
2991 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
2992 j += stylecounts[model->brushq1.light_style[i]] + 1;
2994 for (i = 0;i < model->nummodelsurfaces;i++)
2996 surface = model->data_surfaces + model->firstmodelsurface + i;
2997 for (j = 0;j < MAXLIGHTMAPS;j++)
2998 if (surface->lightmapinfo->styles[j] != 255)
2999 *model->brushq1.light_styleupdatechains[remapstyles[surface->lightmapinfo->styles[j]]]++ = surface;
3002 for (i = 0;i < model->brushq1.light_styles;i++)
3004 *model->brushq1.light_styleupdatechains[i] = NULL;
3005 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
3006 j += stylecounts[model->brushq1.light_style[i]] + 1;
3010 //Returns PVS data for a given point
3011 //(note: can return NULL)
3012 static unsigned char *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
3015 node = model->brush.data_nodes;
3017 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3018 if (((mleaf_t *)node)->clusterindex >= 0)
3019 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3024 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbytes, mnode_t *node)
3028 float d = PlaneDiff(org, node->plane);
3030 node = node->children[0];
3031 else if (d < -radius)
3032 node = node->children[1];
3035 // go down both sides
3036 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3037 node = node->children[1];
3040 // if this leaf is in a cluster, accumulate the pvs bits
3041 if (((mleaf_t *)node)->clusterindex >= 0)
3044 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3045 for (i = 0;i < pvsbytes;i++)
3046 pvsbuffer[i] |= pvs[i];
3050 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3051 //of the given point.
3052 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength)
3054 int bytes = model->brush.num_pvsclusterbytes;
3055 bytes = min(bytes, pvsbufferlength);
3056 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3058 memset(pvsbuffer, 0xFF, bytes);
3061 memset(pvsbuffer, 0, bytes);
3062 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3066 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3071 VectorSubtract(inmaxs, inmins, size);
3072 if (cmodel->brush.ismcbsp)
3075 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3076 else if (size[2] < 48) // pick the nearest of 40 or 56
3077 hull = &cmodel->brushq1.hulls[2]; // 16x16x40
3079 hull = &cmodel->brushq1.hulls[1]; // 16x16x56
3081 else if (cmodel->brush.ishlbsp)
3084 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3085 else if (size[0] <= 32)
3087 if (size[2] < 54) // pick the nearest of 36 or 72
3088 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3090 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3093 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3098 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3099 else if (size[0] <= 32)
3100 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3102 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3104 VectorCopy(inmins, outmins);
3105 VectorAdd(inmins, hull->clip_size, outmaxs);
3108 void Mod_Q1BSP_Load(model_t *mod, void *buffer, void *bufferend)
3113 mempool_t *mainmempool;
3114 float dist, modelyawradius, modelradius, *vec;
3115 msurface_t *surface;
3116 int numshadowmeshtriangles;
3118 hullinfo_t hullinfo;
3120 mod->type = mod_brushq1;
3122 if (!memcmp (buffer, "MCBSPpad", 8))
3124 unsigned char *index;
3126 mod->brush.ismcbsp = true;
3127 mod->brush.ishlbsp = false;
3129 mod_base = (unsigned char*)buffer;
3133 i = SB_ReadInt (&index);
3134 if (i != MCBSPVERSION)
3135 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i)", mod->name, i, MCBSPVERSION);
3138 hullinfo.numhulls = LittleLong(*(int*)index); index += 4;
3139 hullinfo.filehulls = hullinfo.numhulls;
3140 VectorClear (hullinfo.hullsizes[0][0]);
3141 VectorClear (hullinfo.hullsizes[0][1]);
3142 for (i = 1; i < hullinfo.numhulls; i++)
3144 hullinfo.hullsizes[i][0][0] = SB_ReadFloat (&index);
3145 hullinfo.hullsizes[i][0][1] = SB_ReadFloat (&index);
3146 hullinfo.hullsizes[i][0][2] = SB_ReadFloat (&index);
3147 hullinfo.hullsizes[i][1][0] = SB_ReadFloat (&index);
3148 hullinfo.hullsizes[i][1][1] = SB_ReadFloat (&index);
3149 hullinfo.hullsizes[i][1][2] = SB_ReadFloat (&index);
3153 _header.version = 0;
3154 for (i = 0; i < HEADER_LUMPS; i++)
3156 _header.lumps[i].fileofs = SB_ReadInt (&index);
3157 _header.lumps[i].filelen = SB_ReadInt (&index);
3164 header = (dheader_t *)buffer;
3166 i = LittleLong(header->version);
3167 if (i != BSPVERSION && i != 30)
3168 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3169 mod->brush.ishlbsp = i == 30;
3170 mod->brush.ismcbsp = false;
3172 // fill in hull info
3173 VectorClear (hullinfo.hullsizes[0][0]);
3174 VectorClear (hullinfo.hullsizes[0][1]);
3175 if (mod->brush.ishlbsp)
3177 hullinfo.numhulls = 4;
3178 hullinfo.filehulls = 4;
3179 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3180 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3181 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3182 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3183 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3184 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3188 hullinfo.numhulls = 3;
3189 hullinfo.filehulls = 4;
3190 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3191 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3192 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3193 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3197 mod_base = (unsigned char*)buffer;
3198 for (i = 0; i < HEADER_LUMPS; i++)
3200 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3201 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3205 mod->soundfromcenter = true;
3206 mod->TraceBox = Mod_Q1BSP_TraceBox;
3207 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3208 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3209 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3210 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3211 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3212 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3213 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3214 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3215 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3216 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3217 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3218 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3219 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3221 if (loadmodel->isworldmodel)
3223 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3224 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3229 // store which lightmap format to use
3230 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3232 mod->brush.qw_md4sum = 0;
3233 mod->brush.qw_md4sum2 = 0;
3234 for (i = 0;i < HEADER_LUMPS;i++)
3236 if (i == LUMP_ENTITIES)
3238 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3239 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3241 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3244 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3245 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3246 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3247 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3248 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3249 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3250 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3251 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3252 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3253 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3254 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3255 // load submodels before leafs because they contain the number of vis leafs
3256 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3257 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3258 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3259 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3261 if (!mod->brushq1.lightdata)
3262 mod->brush.LightPoint = NULL;
3264 if (mod->brushq1.data_compressedpvs)
3265 Mem_Free(mod->brushq1.data_compressedpvs);
3266 mod->brushq1.data_compressedpvs = NULL;
3267 mod->brushq1.num_compressedpvs = 0;
3269 Mod_Q1BSP_MakeHull0();
3270 Mod_Q1BSP_MakePortals();
3272 mod->numframes = 2; // regular and alternate animation
3275 mainmempool = mod->mempool;
3277 // make a single combined shadow mesh to allow optimized shadow volume creation
3278 numshadowmeshtriangles = 0;
3279 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3281 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3282 numshadowmeshtriangles += surface->num_triangles;
3284 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3285 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3286 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));
3287 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
3288 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3290 if (loadmodel->brush.numsubmodels)
3291 loadmodel->brush.submodels = (model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(model_t *));
3293 if (loadmodel->isworldmodel)
3295 // clear out any stale submodels or worldmodels lying around
3296 // if we did this clear before now, an error might abort loading and
3297 // leave things in a bad state
3298 Mod_RemoveStaleWorldModels(loadmodel);
3301 // LordHavoc: to clear the fog around the original quake submodel code, I
3303 // first of all, some background info on the submodels:
3304 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3305 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3306 // now the weird for loop itself:
3307 // the loop functions in an odd way, on each iteration it sets up the
3308 // current 'mod' model (which despite the confusing code IS the model of
3309 // the number i), at the end of the loop it duplicates the model to become
3310 // the next submodel, and loops back to set up the new submodel.
3312 // LordHavoc: now the explanation of my sane way (which works identically):
3313 // set up the world model, then on each submodel copy from the world model
3314 // and set up the submodel with the respective model info.
3315 for (i = 0;i < mod->brush.numsubmodels;i++)
3317 // LordHavoc: this code was originally at the end of this loop, but
3318 // has been transformed to something more readable at the start here.
3323 // LordHavoc: only register submodels if it is the world
3324 // (prevents external bsp models from replacing world submodels with
3326 if (!loadmodel->isworldmodel)
3328 // duplicate the basic information
3329 sprintf(name, "*%i", i);
3330 mod = Mod_FindName(name);
3331 // copy the base model to this one
3333 // rename the clone back to its proper name
3334 strcpy(mod->name, name);
3335 // textures and memory belong to the main model
3336 mod->texturepool = NULL;
3337 mod->mempool = NULL;
3340 mod->brush.submodel = i;
3342 if (loadmodel->brush.submodels)
3343 loadmodel->brush.submodels[i] = mod;
3345 bm = &mod->brushq1.submodels[i];
3347 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3348 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3350 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3351 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3354 mod->firstmodelsurface = bm->firstface;
3355 mod->nummodelsurfaces = bm->numfaces;
3357 // make the model surface list (used by shadowing/lighting)
3358 mod->surfacelist = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
3359 for (j = 0;j < mod->nummodelsurfaces;j++)
3360 mod->surfacelist[j] = mod->firstmodelsurface + j;
3362 // this gets altered below if sky is used
3363 mod->DrawSky = NULL;
3364 mod->Draw = R_Q1BSP_Draw;
3365 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3366 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3367 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3368 mod->DrawLight = R_Q1BSP_DrawLight;
3371 mod->brush.GetPVS = NULL;
3372 mod->brush.FatPVS = NULL;
3373 mod->brush.BoxTouchingPVS = NULL;
3374 mod->brush.BoxTouchingLeafPVS = NULL;
3375 mod->brush.BoxTouchingVisibleLeafs = NULL;
3376 mod->brush.FindBoxClusters = NULL;
3377 mod->brush.LightPoint = NULL;
3378 mod->brush.AmbientSoundLevelsForPoint = NULL;
3380 Mod_Q1BSP_BuildLightmapUpdateChains(loadmodel->mempool, mod);
3381 if (mod->nummodelsurfaces)
3383 // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3384 mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3385 mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3388 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3390 // we only need to have a drawsky function if it is used(usually only on world model)
3391 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3392 mod->DrawSky = R_Q1BSP_DrawSky;
3393 // calculate bounding shapes
3394 for (k = 0, vec = (surface->groupmesh->data_vertex3f + 3 * surface->num_firstvertex);k < surface->num_vertices;k++, vec += 3)
3396 if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3397 if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3398 if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3399 if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3400 if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3401 if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3402 dist = vec[0]*vec[0]+vec[1]*vec[1];
3403 if (modelyawradius < dist)
3404 modelyawradius = dist;
3405 dist += vec[2]*vec[2];
3406 if (modelradius < dist)
3410 modelyawradius = sqrt(modelyawradius);
3411 modelradius = sqrt(modelradius);
3412 mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3413 mod->yawmins[2] = mod->normalmins[2];
3414 mod->yawmaxs[2] = mod->normalmaxs[2];
3415 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3416 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3417 mod->radius = modelradius;
3418 mod->radius2 = modelradius * modelradius;
3422 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3423 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3425 //mod->brushq1.num_visleafs = bm->visleafs;
3428 Mod_Q1BSP_LoadMapBrushes();
3430 //Mod_Q1BSP_ProcessLightList();
3432 if (developer.integer >= 10)
3433 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);
3436 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3440 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3447 in = (void *)(mod_base + l->fileofs);
3448 if (l->filelen % sizeof(*in))
3449 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3450 count = l->filelen / sizeof(*in);
3451 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3454 loadmodel->num = count;
3456 for (i = 0;i < count;i++, in++, out++)
3462 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3469 in = (void *)(mod_base + l->fileofs);
3470 if (l->filelen % sizeof(*in))
3471 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3472 count = l->filelen / sizeof(*in);
3473 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3476 loadmodel->num = count;
3478 for (i = 0;i < count;i++, in++, out++)
3484 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3491 in = (void *)(mod_base + l->fileofs);
3492 if (l->filelen % sizeof(*in))
3493 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3494 count = l->filelen / sizeof(*in);
3495 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3498 loadmodel->num = count;
3500 for (i = 0;i < count;i++, in++, out++)
3506 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3513 in = (void *)(mod_base + l->fileofs);
3514 if (l->filelen % sizeof(*in))
3515 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3516 count = l->filelen / sizeof(*in);
3517 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3520 loadmodel->num = count;
3522 for (i = 0;i < count;i++, in++, out++)
3528 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3535 in = (void *)(mod_base + l->fileofs);
3536 if (l->filelen % sizeof(*in))
3537 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3538 count = l->filelen / sizeof(*in);
3539 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3542 loadmodel->num = count;
3544 for (i = 0;i < count;i++, in++, out++)
3550 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3557 in = (void *)(mod_base + l->fileofs);
3558 if (l->filelen % sizeof(*in))
3559 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3560 count = l->filelen / sizeof(*in);
3561 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3564 loadmodel->num = count;
3566 for (i = 0;i < count;i++, in++, out++)
3572 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3579 in = (void *)(mod_base + l->fileofs);
3580 if (l->filelen % sizeof(*in))
3581 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3582 count = l->filelen / sizeof(*in);
3583 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3586 loadmodel->num = count;
3588 for (i = 0;i < count;i++, in++, out++)
3594 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3601 in = (void *)(mod_base + l->fileofs);
3602 if (l->filelen % sizeof(*in))
3603 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3604 count = l->filelen / sizeof(*in);
3605 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3608 loadmodel->num = count;
3610 for (i = 0;i < count;i++, in++, out++)
3616 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3623 in = (void *)(mod_base + l->fileofs);
3624 if (l->filelen % sizeof(*in))
3625 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3626 count = l->filelen / sizeof(*in);
3627 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3630 loadmodel->num = count;
3632 for (i = 0;i < count;i++, in++, out++)
3638 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3645 in = (void *)(mod_base + l->fileofs);
3646 if (l->filelen % sizeof(*in))
3647 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3648 count = l->filelen / sizeof(*in);
3649 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3652 loadmodel->num = count;
3654 for (i = 0;i < count;i++, in++, out++)
3660 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3667 in = (void *)(mod_base + l->fileofs);
3668 if (l->filelen % sizeof(*in))
3669 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3670 count = l->filelen / sizeof(*in);
3671 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3674 loadmodel->num = count;
3676 for (i = 0;i < count;i++, in++, out++)
3682 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3689 in = (void *)(mod_base + l->fileofs);
3690 if (l->filelen % sizeof(*in))
3691 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3692 count = l->filelen / sizeof(*in);
3693 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3696 loadmodel->num = count;
3698 for (i = 0;i < count;i++, in++, out++)
3704 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3711 in = (void *)(mod_base + l->fileofs);
3712 if (l->filelen % sizeof(*in))
3713 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3714 count = l->filelen / sizeof(*in);
3715 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3718 loadmodel->num = count;
3720 for (i = 0;i < count;i++, in++, out++)
3726 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
3733 in = (void *)(mod_base + l->fileofs);
3734 if (l->filelen % sizeof(*in))
3735 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3736 count = l->filelen / sizeof(*in);
3737 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3740 loadmodel->num = count;
3742 for (i = 0;i < count;i++, in++, out++)
3748 static void Mod_Q2BSP_LoadAreas(lump_t *l)
3755 in = (void *)(mod_base + l->fileofs);
3756 if (l->filelen % sizeof(*in))
3757 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
3758 count = l->filelen / sizeof(*in);
3759 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3762 loadmodel->num = count;
3764 for (i = 0;i < count;i++, in++, out++)
3770 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
3777 in = (void *)(mod_base + l->fileofs);
3778 if (l->filelen % sizeof(*in))
3779 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
3780 count = l->filelen / sizeof(*in);
3781 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3784 loadmodel->num = count;
3786 for (i = 0;i < count;i++, in++, out++)
3792 static void Mod_Q2BSP_LoadModels(lump_t *l)
3799 in = (void *)(mod_base + l->fileofs);
3800 if (l->filelen % sizeof(*in))
3801 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
3802 count = l->filelen / sizeof(*in);
3803 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3806 loadmodel->num = count;
3808 for (i = 0;i < count;i++, in++, out++)
3814 void static Mod_Q2BSP_Load(model_t *mod, void *buffer, void *bufferend)
3817 q2dheader_t *header;
3819 Host_Error("Mod_Q2BSP_Load: not yet implemented");
3821 mod->type = mod_brushq2;
3823 header = (q2dheader_t *)buffer;
3825 i = LittleLong(header->version);
3826 if (i != Q2BSPVERSION)
3827 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
3828 mod->brush.ishlbsp = false;
3829 mod->brush.ismcbsp = false;
3830 if (loadmodel->isworldmodel)
3832 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3833 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3836 mod_base = (unsigned char *)header;
3838 // swap all the lumps
3839 for (i = 0;i < (int) sizeof(*header) / 4;i++)
3840 ((int *)header)[i] = LittleLong(((int *)header)[i]);
3842 // store which lightmap format to use
3843 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3845 mod->brush.qw_md4sum = 0;
3846 mod->brush.qw_md4sum2 = 0;
3847 for (i = 0;i < Q2HEADER_LUMPS;i++)
3849 if (i == Q2LUMP_ENTITIES)
3851 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3852 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
3854 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3857 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
3858 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
3859 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
3860 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
3861 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
3862 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
3863 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
3864 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
3865 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
3866 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
3867 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
3868 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
3869 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
3870 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
3871 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
3872 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
3873 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
3874 // LordHavoc: must go last because this makes the submodels
3875 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
3878 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents);
3879 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents);
3881 static void Mod_Q3BSP_LoadEntities(lump_t *l)
3884 char key[128], value[MAX_INPUTLINE];
3886 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
3887 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
3888 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
3891 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
3892 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
3893 data = loadmodel->brush.entities;
3894 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
3895 if (data && COM_ParseToken(&data, false) && com_token[0] == '{')
3899 if (!COM_ParseToken(&data, false))
3901 if (com_token[0] == '}')
3902 break; // end of worldspawn
3903 if (com_token[0] == '_')
3904 strcpy(key, com_token + 1);
3906 strcpy(key, com_token);
3907 while (key[strlen(key)-1] == ' ') // remove trailing spaces
3908 key[strlen(key)-1] = 0;
3909 if (!COM_ParseToken(&data, false))
3911 strcpy(value, com_token);
3912 if (!strcmp("gridsize", key))
3914 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
3915 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
3921 static void Mod_Q3BSP_LoadTextures(lump_t *l)
3930 int flags, flags2, numparameters, passnumber;
3931 char shadername[Q3PATHLENGTH];
3932 char sky[Q3PATHLENGTH];
3933 char firstpasstexturename[Q3PATHLENGTH];
3934 char parameter[4][Q3PATHLENGTH];
3936 in = (q3dtexture_t *)(mod_base + l->fileofs);
3937 if (l->filelen % sizeof(*in))
3938 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
3939 count = l->filelen / sizeof(*in);
3940 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3942 loadmodel->data_textures = out;
3943 loadmodel->num_textures = count;
3945 for (i = 0;i < count;i++, in++, out++)
3947 strlcpy (out->name, in->name, sizeof (out->name));
3948 out->surfaceflags = LittleLong(in->surfaceflags);
3949 out->supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in->contents));
3950 out->surfaceparms = -1;
3953 // do a quick parse of shader files to get surfaceparms
3954 if ((search = FS_Search("scripts/*.shader", true, false)))
3956 for (i = 0;i < search->numfilenames;i++)
3958 if ((f = (char *)FS_LoadFile(search->filenames[i], tempmempool, false, NULL)))
3961 while (COM_ParseToken(&text, false))
3963 strlcpy (shadername, com_token, sizeof (shadername));
3968 firstpasstexturename[0] = 0;
3969 if (COM_ParseToken(&text, false) && !strcasecmp(com_token, "{"))
3971 while (COM_ParseToken(&text, false))
3973 if (!strcasecmp(com_token, "}"))
3975 else if (!strcasecmp(com_token, "{"))
3977 while (COM_ParseToken(&text, false))
3979 if (!strcasecmp(com_token, "}"))
3981 if (!strcasecmp(com_token, "\n"))
3984 for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
3988 strlcpy(parameter[j], com_token, sizeof(parameter[j]));
3989 numparameters = j + 1;
3991 if (!COM_ParseToken(&text, true))
3994 if (developer.integer >= 100)
3996 Con_Printf("%s %i: ", shadername, passnumber);
3997 for (j = 0;j < numparameters;j++)
3998 Con_Printf(" %s", parameter[j]);
4001 if (passnumber == 0 && numparameters >= 1)
4003 if (!strcasecmp(parameter[0], "blendfunc") && (flags & Q3SURFACEPARM_TRANS))
4005 if (numparameters == 2 && !strcasecmp(parameter[1], "add"))
4006 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
4007 else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_one") && !strcasecmp(parameter[2], "gl_one"))
4008 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
4009 else if (numparameters == 3 && !strcasecmp(parameter[1], "gl_src_alpha") && !strcasecmp(parameter[2], "gl_one"))
4010 flags2 |= Q3TEXTUREFLAG_ADDITIVE;
4012 else if (numparameters >= 2 && (!strcasecmp(parameter[0], "map") || !strcasecmp(parameter[0], "clampmap")))
4013 strlcpy(firstpasstexturename, parameter[1], sizeof(firstpasstexturename));
4014 else if (numparameters >= 3 && !strcasecmp(parameter[0], "animmap"))
4015 strlcpy(firstpasstexturename, parameter[2], sizeof(firstpasstexturename));
4016 else if (numparameters >= 2 && !strcasecmp(parameter[0], "alphafunc"))
4017 flags2 |= Q3TEXTUREFLAG_ALPHATEST;
4019 // break out a level if it was }
4020 if (!strcasecmp(com_token, "}"))
4027 for (j = 0;strcasecmp(com_token, "\n") && strcasecmp(com_token, "}");j++)
4031 strlcpy(parameter[j], com_token, sizeof(parameter[j]));
4032 numparameters = j + 1;
4034 if (!COM_ParseToken(&text, true))
4037 if (i == 0 && !strcasecmp(com_token, "}"))
4039 if (developer.integer >= 100)
4041 Con_Printf("%s: ", shadername);
4042 for (j = 0;j < numparameters;j++)
4043 Con_Printf(" %s", parameter[j]);
4046 if (numparameters < 1)
4048 if (!strcasecmp(parameter[0], "surfaceparm") && numparameters >= 2)
4050 if (!strcasecmp(parameter[1], "alphashadow"))
4051 flags |= Q3SURFACEPARM_ALPHASHADOW;
4052 else if (!strcasecmp(parameter[1], "areaportal"))
4053 flags |= Q3SURFACEPARM_AREAPORTAL;
4054 else if (!strcasecmp(parameter[1], "clusterportal"))
4055 flags |= Q3SURFACEPARM_CLUSTERPORTAL;
4056 else if (!strcasecmp(parameter[1], "detail"))
4057 flags |= Q3SURFACEPARM_DETAIL;
4058 else if (!strcasecmp(parameter[1], "donotenter"))
4059 flags |= Q3SURFACEPARM_DONOTENTER;
4060 else if (!strcasecmp(parameter[1], "fog"))
4061 flags |= Q3SURFACEPARM_FOG;
4062 else if (!strcasecmp(parameter[1], "lava"))
4063 flags |= Q3SURFACEPARM_LAVA;
4064 else if (!strcasecmp(parameter[1], "lightfilter"))
4065 flags |= Q3SURFACEPARM_LIGHTFILTER;
4066 else if (!strcasecmp(parameter[1], "metalsteps"))
4067 flags |= Q3SURFACEPARM_METALSTEPS;
4068 else if (!strcasecmp(parameter[1], "nodamage"))
4069 flags |= Q3SURFACEPARM_NODAMAGE;
4070 else if (!strcasecmp(parameter[1], "nodlight"))
4071 flags |= Q3SURFACEPARM_NODLIGHT;
4072 else if (!strcasecmp(parameter[1], "nodraw"))
4073 flags |= Q3SURFACEPARM_NODRAW;
4074 else if (!strcasecmp(parameter[1], "nodrop"))
4075 flags |= Q3SURFACEPARM_NODROP;
4076 else if (!strcasecmp(parameter[1], "noimpact"))
4077 flags |= Q3SURFACEPARM_NOIMPACT;
4078 else if (!strcasecmp(parameter[1], "nolightmap"))
4079 flags |= Q3SURFACEPARM_NOLIGHTMAP;
4080 else if (!strcasecmp(parameter[1], "nomarks"))
4081 flags |= Q3SURFACEPARM_NOMARKS;
4082 else if (!strcasecmp(parameter[1], "nomipmaps"))
4083 flags |= Q3SURFACEPARM_NOMIPMAPS;
4084 else if (!strcasecmp(parameter[1], "nonsolid"))
4085 flags |= Q3SURFACEPARM_NONSOLID;
4086 else if (!strcasecmp(parameter[1], "origin"))
4087 flags |= Q3SURFACEPARM_ORIGIN;
4088 else if (!strcasecmp(parameter[1], "playerclip"))
4089 flags |= Q3SURFACEPARM_PLAYERCLIP;
4090 else if (!strcasecmp(parameter[1], "sky"))
4091 flags |= Q3SURFACEPARM_SKY;
4092 else if (!strcasecmp(parameter[1], "slick"))
4093 flags |= Q3SURFACEPARM_SLICK;
4094 else if (!strcasecmp(parameter[1], "slime"))
4095 flags |= Q3SURFACEPARM_SLIME;
4096 else if (!strcasecmp(parameter[1], "structural"))
4097 flags |= Q3SURFACEPARM_STRUCTURAL;
4098 else if (!strcasecmp(parameter[1], "trans"))
4099 flags |= Q3SURFACEPARM_TRANS;
4100 else if (!strcasecmp(parameter[1], "water"))
4101 flags |= Q3SURFACEPARM_WATER;
4102 else if (!strcasecmp(parameter[1], "pointlight"))
4103 flags |= Q3SURFACEPARM_POINTLIGHT;
4105 Con_Printf("%s parsing warning: unknown surfaceparm \"%s\"\n", search->filenames[i], parameter[1]);
4107 else if (!strcasecmp(parameter[0], "sky") && numparameters >= 2)
4108 strlcpy(sky, parameter[1], sizeof(sky));
4109 else if (!strcasecmp(parameter[0], "skyparms") && numparameters >= 2)
4111 if (!atoi(parameter[1]) && strcasecmp(parameter[1], "-"))
4112 strlcpy(sky, parameter[1], sizeof(sky));
4114 else if (!strcasecmp(parameter[0], "cull") && numparameters >= 2)
4116 if (!strcasecmp(parameter[1], "disable") || !strcasecmp(parameter[1], "none") || !strcasecmp(parameter[1], "twosided"))
4117 flags2 |= Q3TEXTUREFLAG_TWOSIDED;
4119 else if (!strcasecmp(parameter[0], "nomipmaps"))
4120 flags2 |= Q3TEXTUREFLAG_NOMIPMAPS;
4121 else if (!strcasecmp(parameter[0], "nopicmip"))
4122 flags2 |= Q3TEXTUREFLAG_NOPICMIP;
4123 else if (!strcasecmp(parameter[0], "deformvertexes") && numparameters >= 2)
4125 if (!strcasecmp(parameter[1], "autosprite") && numparameters == 2)
4126 flags2 |= Q3TEXTUREFLAG_AUTOSPRITE;
4127 if (!strcasecmp(parameter[1], "autosprite2") && numparameters == 2)
4128 flags2 |= Q3TEXTUREFLAG_AUTOSPRITE2;
4131 // add shader to list (shadername and flags)
4132 // actually here we just poke into the texture settings
4133 for (j = 0, out = loadmodel->data_textures;j < loadmodel->num_textures;j++, out++)
4135 if (!strcasecmp(out->name, shadername))
4137 out->surfaceparms = flags;
4138 out->textureflags = flags2;
4139 out->basematerialflags = 0;
4140 if (out->surfaceparms & Q3SURFACEPARM_NODRAW)
4141 out->basematerialflags |= MATERIALFLAG_NODRAW;
4142 else if (out->surfaceparms & Q3SURFACEPARM_SKY)
4143 out->basematerialflags |= MATERIALFLAG_SKY;
4144 else if (out->surfaceparms & Q3SURFACEPARM_LAVA)
4145 out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_FULLBRIGHT;
4146 else if (out->surfaceparms & Q3SURFACEPARM_SLIME)
4147 out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_WATERALPHA;
4148 else if (out->surfaceparms & Q3SURFACEPARM_WATER)
4149 out->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_WATERALPHA;
4151 out->basematerialflags |= MATERIALFLAG_WALL;
4152 if (out->textureflags & Q3TEXTUREFLAG_ALPHATEST)
4154 // FIXME: support alpha test?
4155 out->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
4157 else if (out->surfaceparms & Q3SURFACEPARM_TRANS)
4159 if (out->textureflags & Q3TEXTUREFLAG_ADDITIVE)
4160 out->basematerialflags |= MATERIALFLAG_ADD | MATERIALFLAG_TRANSPARENT;
4162 out->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_TRANSPARENT;
4164 strlcpy(out->firstpasstexturename, firstpasstexturename, sizeof(out->firstpasstexturename));
4165 if ((flags & Q3SURFACEPARM_SKY) && sky[0])
4167 // quake3 seems to append a _ to the skybox name, so this must do so as well
4168 dpsnprintf(loadmodel->brush.skybox, sizeof(loadmodel->brush.skybox), "%s_", sky);
4175 Con_Printf("%s parsing error - expected \"{\", found \"%s\"\n", search->filenames[i], com_token);
4186 for (j = 0, out = loadmodel->data_textures;j < loadmodel->num_textures;j++, out++)
4188 if (out->surfaceparms == -1)
4191 Con_DPrintf("%s: No shader found for texture \"%s\"\n", loadmodel->name, out->name);
4192 out->surfaceparms = 0;
4193 if (out->surfaceflags & Q3SURFACEFLAG_NODRAW)
4194 out->basematerialflags |= MATERIALFLAG_NODRAW;
4195 else if (out->surfaceflags & Q3SURFACEFLAG_SKY)
4196 out->basematerialflags |= MATERIALFLAG_SKY;
4198 out->basematerialflags |= MATERIALFLAG_WALL;
4199 // these are defaults
4200 //if (!strncmp(out->name, "textures/skies/", 15))
4201 // out->surfaceparms |= Q3SURFACEPARM_SKY;
4202 //if (!strcmp(out->name, "caulk") || !strcmp(out->name, "common/caulk") || !strcmp(out->name, "textures/common/caulk")
4203 // || !strcmp(out->name, "nodraw") || !strcmp(out->name, "common/nodraw") || !strcmp(out->name, "textures/common/nodraw"))
4204 // out->surfaceparms |= Q3SURFACEPARM_NODRAW;
4205 //if (R_TextureHasAlpha(out->skin.base))
4206 // out->surfaceparms |= Q3SURFACEPARM_TRANS;
4208 if (cls.state != ca_dedicated)
4209 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))
4210 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))
4211 Con_Printf("%s: texture loading for shader \"%s\" failed (first layer \"%s\" not found either)\n", loadmodel->name, out->name, out->firstpasstexturename);
4213 out->currentframe = out;
4216 Con_DPrintf("%s: %i textures missing shaders\n", loadmodel->name, c);
4219 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4225 in = (q3dplane_t *)(mod_base + l->fileofs);
4226 if (l->filelen % sizeof(*in))
4227 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4228 count = l->filelen / sizeof(*in);
4229 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4231 loadmodel->brush.data_planes = out;
4232 loadmodel->brush.num_planes = count;
4234 for (i = 0;i < count;i++, in++, out++)
4236 out->normal[0] = LittleFloat(in->normal[0]);
4237 out->normal[1] = LittleFloat(in->normal[1]);
4238 out->normal[2] = LittleFloat(in->normal[2]);
4239 out->dist = LittleFloat(in->dist);
4244 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4247 q3mbrushside_t *out;
4250 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4251 if (l->filelen % sizeof(*in))
4252 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4253 count = l->filelen / sizeof(*in);
4254 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4256 loadmodel->brush.data_brushsides = out;
4257 loadmodel->brush.num_brushsides = count;
4259 for (i = 0;i < count;i++, in++, out++)
4261 n = LittleLong(in->planeindex);
4262 if (n < 0 || n >= loadmodel->brush.num_planes)
4263 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4264 out->plane = loadmodel->brush.data_planes + n;
4265 n = LittleLong(in->textureindex);
4266 if (n < 0 || n >= loadmodel->num_textures)
4267 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4268 out->texture = loadmodel->data_textures + n;
4272 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4276 int i, j, n, c, count, maxplanes;
4277 colplanef_t *planes;
4279 in = (q3dbrush_t *)(mod_base + l->fileofs);
4280 if (l->filelen % sizeof(*in))
4281 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4282 count = l->filelen / sizeof(*in);
4283 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4285 loadmodel->brush.data_brushes = out;
4286 loadmodel->brush.num_brushes = count;
4291 for (i = 0;i < count;i++, in++, out++)
4293 n = LittleLong(in->firstbrushside);
4294 c = LittleLong(in->numbrushsides);
4295 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4296 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4297 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4298 out->numbrushsides = c;
4299 n = LittleLong(in->textureindex);
4300 if (n < 0 || n >= loadmodel->num_textures)
4301 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4302 out->texture = loadmodel->data_textures + n;
4304 // make a list of mplane_t structs to construct a colbrush from
4305 if (maxplanes < out->numbrushsides)
4307 maxplanes = out->numbrushsides;
4310 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4312 for (j = 0;j < out->numbrushsides;j++)
4314 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4315 planes[j].dist = out->firstbrushside[j].plane->dist;
4316 planes[j].supercontents = out->firstbrushside[j].texture->supercontents;
4317 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4318 planes[j].texture = out->firstbrushside[j].texture;
4320 // make the colbrush from the planes
4321 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes);
4327 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4333 in = (q3deffect_t *)(mod_base + l->fileofs);
4334 if (l->filelen % sizeof(*in))
4335 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4336 count = l->filelen / sizeof(*in);
4337 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4339 loadmodel->brushq3.data_effects = out;
4340 loadmodel->brushq3.num_effects = count;
4342 for (i = 0;i < count;i++, in++, out++)
4344 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4345 n = LittleLong(in->brushindex);
4346 if (n >= loadmodel->brush.num_brushes)
4348 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4351 out->brushindex = n;
4352 out->unknown = LittleLong(in->unknown);
4356 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4361 in = (q3dvertex_t *)(mod_base + l->fileofs);
4362 if (l->filelen % sizeof(*in))
4363 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4364 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4365 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 2 + 2 + 4)));
4366 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_vertex3f + count * 3;
4367 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4368 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4370 for (i = 0;i < count;i++, in++)
4372 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4373 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4374 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4375 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4376 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4377 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4378 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4379 // svector/tvector are calculated later in face loading
4380 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4381 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4382 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4383 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4387 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4393 in = (int *)(mod_base + l->fileofs);
4394 if (l->filelen % sizeof(int[3]))
4395 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4396 count = l->filelen / sizeof(*in);
4397 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4399 loadmodel->brushq3.num_triangles = count / 3;
4400 loadmodel->brushq3.data_element3i = out;
4402 for (i = 0;i < count;i++, in++, out++)
4404 *out = LittleLong(*in);
4405 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4407 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4413 static void Mod_Q3BSP_LoadLightmaps(lump_t *l)
4421 in = (q3dlightmap_t *)(mod_base + l->fileofs);
4422 if (l->filelen % sizeof(*in))
4423 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4424 count = l->filelen / sizeof(*in);
4425 out = (rtexture_t **)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4427 loadmodel->brushq3.data_lightmaps = out;
4428 loadmodel->brushq3.num_lightmaps = count;
4430 loadmodel->brushq3.deluxemapping_modelspace = false;
4431 for (i = 0;i < count;i++, in++, out++)
4433 // if this may be a deluxemap, check if it's in modelspace or not
4434 if ((i & 1) && !loadmodel->brushq3.deluxemapping_modelspace)
4437 unsigned char *b = in->rgb;
4438 for (j = 2;j < 128*128*3;j += 3)
4440 // if this is definitely negative Z, it is not facing outward,
4441 // and thus must be in modelspace, as negative Z would never
4442 // occur in tangentspace
4445 loadmodel->brushq3.deluxemapping_modelspace = true;
4450 *out = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", i), 128, 128, in->rgb, TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
4454 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4456 q3dface_t *in, *oldin;
4457 msurface_t *out, *oldout;
4458 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;
4459 //int *originalelement3i;
4460 //int *originalneighbor3i;
4461 float *originalvertex3f;
4462 //float *originalsvector3f;
4463 //float *originaltvector3f;
4464 //float *originalnormal3f;
4465 float *originalcolor4f;
4466 float *originaltexcoordtexture2f;
4467 float *originaltexcoordlightmap2f;
4469 surfmesh_t *mesh, *tempmeshlist[1024];
4471 in = (q3dface_t *)(mod_base + l->fileofs);
4472 if (l->filelen % sizeof(*in))
4473 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4474 count = l->filelen / sizeof(*in);
4475 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4477 loadmodel->data_surfaces = out;
4478 loadmodel->num_surfaces = count;
4480 // deluxemapped q3bsp files have an even number of lightmaps, and surfaces
4481 // always index even numbered ones (0, 2, 4, ...), the odd numbered
4482 // lightmaps are the deluxemaps (light direction textures), so if we
4483 // encounter any odd numbered lightmaps it is not a deluxemapped bsp, it
4484 // is also not a deluxemapped bsp if it has an odd number of lightmaps or
4486 loadmodel->brushq3.deluxemapping = true;
4487 if (loadmodel->brushq3.num_lightmaps >= 2 && !(loadmodel->brushq3.num_lightmaps & 1))
4489 for (i = 0;i < count;i++)
4491 n = LittleLong(in[i].lightmapindex);
4492 if (n >= 0 && ((n & 1) || n + 1 >= loadmodel->brushq3.num_lightmaps))
4494 loadmodel->brushq3.deluxemapping = false;
4500 loadmodel->brushq3.deluxemapping = false;
4501 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4504 for (meshnum = 0;i < count;meshnum++)
4511 for (;i < count;i++, in++, out++)
4513 // check face type first
4514 type = LittleLong(in->type);
4515 if (type != Q3FACETYPE_POLYGON
4516 && type != Q3FACETYPE_PATCH
4517 && type != Q3FACETYPE_MESH
4518 && type != Q3FACETYPE_FLARE)
4520 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4524 n = LittleLong(in->textureindex);
4525 if (n < 0 || n >= loadmodel->num_textures)
4527 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4530 out->texture = loadmodel->data_textures + n;
4531 n = LittleLong(in->effectindex);
4532 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4534 if (developer.integer >= 100)
4535 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4541 out->effect = loadmodel->brushq3.data_effects + n;
4542 n = LittleLong(in->lightmapindex);
4543 if (n >= loadmodel->brushq3.num_lightmaps)
4545 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_lightmaps);
4552 out->lightmaptexture = NULL;
4553 out->deluxemaptexture = r_texture_blanknormalmap;
4557 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n];
4558 if (loadmodel->brushq3.deluxemapping)
4559 out->deluxemaptexture = loadmodel->brushq3.data_lightmaps[n+1];
4561 out->deluxemaptexture = r_texture_blanknormalmap;
4564 firstvertex = LittleLong(in->firstvertex);
4565 numvertices = LittleLong(in->numvertices);
4566 firstelement = LittleLong(in->firstelement);
4567 numtriangles = LittleLong(in->numelements) / 3;
4568 if (numtriangles * 3 != LittleLong(in->numelements))
4570 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));
4573 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4575 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);
4578 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4580 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);
4585 case Q3FACETYPE_POLYGON:
4586 case Q3FACETYPE_MESH:
4587 // no processing necessary
4589 case Q3FACETYPE_PATCH:
4590 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4591 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4592 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))
4594 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4597 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4598 // convert patch to Q3FACETYPE_MESH
4599 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4600 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4601 // bound to user settings
4602 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4603 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4604 // bound to sanity settings
4605 xtess = bound(1, xtess, 1024);
4606 ytess = bound(1, ytess, 1024);
4607 // bound to user limit on vertices
4608 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4615 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4616 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4617 numvertices = finalwidth * finalheight;
4618 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4620 case Q3FACETYPE_FLARE:
4621 if (developer.integer >= 100)
4622 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4626 out->num_vertices = numvertices;
4627 out->num_triangles = numtriangles;
4628 if (meshvertices + out->num_vertices > 65536)
4630 meshvertices += out->num_vertices;
4631 meshtriangles += out->num_triangles;
4637 mesh = tempmeshlist[meshnum] = Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4640 for (;i < count && meshvertices + out->num_vertices <= mesh->num_vertices;i++, in++, out++)
4642 if (out->num_vertices < 3 || out->num_triangles < 1)
4645 type = LittleLong(in->type);
4646 firstvertex = LittleLong(in->firstvertex);
4647 firstelement = LittleLong(in->firstelement);
4648 out->groupmesh = mesh;
4649 out->num_firstvertex = meshvertices;
4650 out->num_firsttriangle = meshtriangles;
4653 case Q3FACETYPE_POLYGON:
4654 case Q3FACETYPE_MESH:
4655 // no processing necessary
4656 for (j = 0;j < out->num_vertices;j++)
4658 (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4659 (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4660 (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4661 (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4662 (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4663 (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4664 (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4665 (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4666 (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4667 (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4668 (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4670 for (j = 0;j < out->num_triangles*3;j++)
4671 (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
4673 case Q3FACETYPE_PATCH:
4674 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4675 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4676 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4677 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4678 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4679 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4680 // convert patch to Q3FACETYPE_MESH
4681 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4682 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4683 // bound to user settings
4684 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4685 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4686 // bound to sanity settings
4687 xtess = bound(1, xtess, 1024);
4688 ytess = bound(1, ytess, 1024);
4689 // bound to user limit on vertices
4690 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4697 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4698 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4699 finalvertices = finalwidth * finalheight;
4700 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4701 type = Q3FACETYPE_MESH;
4702 // generate geometry
4703 // (note: normals are skipped because they get recalculated)
4704 Q3PatchTesselateFloat(3, sizeof(float[3]), (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4705 Q3PatchTesselateFloat(2, sizeof(float[2]), (out->groupmesh->data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
4706 Q3PatchTesselateFloat(2, sizeof(float[2]), (out->groupmesh->data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
4707 Q3PatchTesselateFloat(4, sizeof(float[4]), (out->groupmesh->data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
4708 Q3PatchTriangleElements((out->groupmesh->data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
4709 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);
4710 if (developer.integer >= 100)
4712 if (out->num_triangles < finaltriangles)
4713 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);
4715 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);
4717 // q3map does not put in collision brushes for curves... ugh
4718 // build the lower quality collision geometry
4719 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4720 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4721 // bound to user settings
4722 xtess = bound(r_subdivisions_collision_mintess.integer, xtess, r_subdivisions_collision_maxtess.integer);
4723 ytess = bound(r_subdivisions_collision_mintess.integer, ytess, r_subdivisions_collision_maxtess.integer);
4724 // bound to sanity settings
4725 xtess = bound(1, xtess, 1024);
4726 ytess = bound(1, ytess, 1024);
4727 // bound to user limit on vertices
4728 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4735 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4736 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4737 finalvertices = finalwidth * finalheight;
4738 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4740 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4741 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4742 out->num_collisionvertices = finalvertices;
4743 out->num_collisiontriangles = finaltriangles;
4744 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4745 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
4747 //Mod_SnapVertices(3, out->num_vertices, (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), 0.25);
4748 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
4750 oldnumtriangles = out->num_triangles;
4751 oldnumtriangles2 = out->num_collisiontriangles;
4752 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
4753 if (developer.integer >= 100)
4754 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);
4759 meshvertices += out->num_vertices;
4760 meshtriangles += out->num_triangles;
4761 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
4762 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)
4764 if (invalidelements)
4766 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);
4767 for (j = 0;j < out->num_triangles * 3;j++)
4769 Con_Printf(" %i", (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
4770 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)
4771 (out->groupmesh->data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
4775 // for per pixel lighting
4776 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);
4777 // calculate a bounding box
4778 VectorClear(out->mins);
4779 VectorClear(out->maxs);
4780 if (out->num_vertices)
4782 VectorCopy((out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), out->mins);
4783 VectorCopy((out->groupmesh->data_vertex3f + 3 * out->num_firstvertex), out->maxs);
4784 for (j = 1, v = (out->groupmesh->data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
4786 out->mins[0] = min(out->mins[0], v[0]);
4787 out->maxs[0] = max(out->maxs[0], v[0]);
4788 out->mins[1] = min(out->mins[1], v[1]);
4789 out->maxs[1] = max(out->maxs[1], v[1]);
4790 out->mins[2] = min(out->mins[2], v[2]);
4791 out->maxs[2] = max(out->maxs[2], v[2]);
4793 out->mins[0] -= 1.0f;
4794 out->mins[1] -= 1.0f;
4795 out->mins[2] -= 1.0f;
4796 out->maxs[0] += 1.0f;
4797 out->maxs[1] += 1.0f;
4798 out->maxs[2] += 1.0f;
4800 // set lightmap styles for consistency with q1bsp
4801 //out->lightmapinfo->styles[0] = 0;
4802 //out->lightmapinfo->styles[1] = 255;
4803 //out->lightmapinfo->styles[2] = 255;
4804 //out->lightmapinfo->styles[3] = 255;
4808 // now store the completed list of meshes
4809 loadmodel->nummeshes = meshnum;
4810 if (loadmodel->nummeshes)
4812 loadmodel->meshlist = (surfmesh_t **)Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4813 memcpy(loadmodel->meshlist, tempmeshlist, sizeof(surfmesh_t *) * loadmodel->nummeshes);
4816 // free the no longer needed vertex data
4817 loadmodel->brushq3.num_vertices = 0;
4818 Mem_Free(loadmodel->brushq3.data_vertex3f);
4819 loadmodel->brushq3.data_vertex3f = NULL;
4820 loadmodel->brushq3.data_texcoordtexture2f = NULL;
4821 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
4822 loadmodel->brushq3.data_color4f = NULL;
4823 // free the no longer needed triangle data
4824 loadmodel->brushq3.num_triangles = 0;
4825 Mem_Free(loadmodel->brushq3.data_element3i);
4826 loadmodel->brushq3.data_element3i = NULL;
4829 static void Mod_Q3BSP_LoadModels(lump_t *l)
4833 int i, j, n, c, count;
4835 in = (q3dmodel_t *)(mod_base + l->fileofs);
4836 if (l->filelen % sizeof(*in))
4837 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4838 count = l->filelen / sizeof(*in);
4839 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4841 loadmodel->brushq3.data_models = out;
4842 loadmodel->brushq3.num_models = count;
4844 for (i = 0;i < count;i++, in++, out++)
4846 for (j = 0;j < 3;j++)
4848 out->mins[j] = LittleFloat(in->mins[j]);
4849 out->maxs[j] = LittleFloat(in->maxs[j]);
4851 n = LittleLong(in->firstface);
4852 c = LittleLong(in->numfaces);
4853 if (n < 0 || n + c > loadmodel->num_surfaces)
4854 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
4857 n = LittleLong(in->firstbrush);
4858 c = LittleLong(in->numbrushes);
4859 if (n < 0 || n + c > loadmodel->brush.num_brushes)
4860 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
4861 out->firstbrush = n;
4862 out->numbrushes = c;
4866 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
4872 in = (int *)(mod_base + l->fileofs);
4873 if (l->filelen % sizeof(*in))
4874 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4875 count = l->filelen / sizeof(*in);
4876 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4878 loadmodel->brush.data_leafbrushes = out;
4879 loadmodel->brush.num_leafbrushes = count;
4881 for (i = 0;i < count;i++, in++, out++)
4883 n = LittleLong(*in);
4884 if (n < 0 || n >= loadmodel->brush.num_brushes)
4885 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
4890 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
4896 in = (int *)(mod_base + l->fileofs);
4897 if (l->filelen % sizeof(*in))
4898 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4899 count = l->filelen / sizeof(*in);
4900 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4902 loadmodel->brush.data_leafsurfaces = out;
4903 loadmodel->brush.num_leafsurfaces = count;
4905 for (i = 0;i < count;i++, in++, out++)
4907 n = LittleLong(*in);
4908 if (n < 0 || n >= loadmodel->num_surfaces)
4909 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
4914 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
4918 int i, j, n, c, count;
4920 in = (q3dleaf_t *)(mod_base + l->fileofs);
4921 if (l->filelen % sizeof(*in))
4922 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4923 count = l->filelen / sizeof(*in);
4924 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4926 loadmodel->brush.data_leafs = out;
4927 loadmodel->brush.num_leafs = count;
4929 for (i = 0;i < count;i++, in++, out++)
4933 out->clusterindex = LittleLong(in->clusterindex);
4934 out->areaindex = LittleLong(in->areaindex);
4935 for (j = 0;j < 3;j++)
4937 // yes the mins/maxs are ints
4938 out->mins[j] = LittleLong(in->mins[j]) - 1;
4939 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4941 n = LittleLong(in->firstleafface);
4942 c = LittleLong(in->numleaffaces);
4943 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
4944 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
4945 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
4946 out->numleafsurfaces = c;
4947 n = LittleLong(in->firstleafbrush);
4948 c = LittleLong(in->numleafbrushes);
4949 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
4950 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
4951 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
4952 out->numleafbrushes = c;
4956 static void Mod_Q3BSP_LoadNodes(lump_t *l)
4962 in = (q3dnode_t *)(mod_base + l->fileofs);
4963 if (l->filelen % sizeof(*in))
4964 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4965 count = l->filelen / sizeof(*in);
4966 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4968 loadmodel->brush.data_nodes = out;
4969 loadmodel->brush.num_nodes = count;
4971 for (i = 0;i < count;i++, in++, out++)
4974 n = LittleLong(in->planeindex);
4975 if (n < 0 || n >= loadmodel->brush.num_planes)
4976 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4977 out->plane = loadmodel->brush.data_planes + n;
4978 for (j = 0;j < 2;j++)
4980 n = LittleLong(in->childrenindex[j]);
4983 if (n >= loadmodel->brush.num_nodes)
4984 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
4985 out->children[j] = loadmodel->brush.data_nodes + n;
4990 if (n >= loadmodel->brush.num_leafs)
4991 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
4992 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
4995 for (j = 0;j < 3;j++)
4997 // yes the mins/maxs are ints
4998 out->mins[j] = LittleLong(in->mins[j]) - 1;
4999 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5003 // set the parent pointers
5004 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5007 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5010 q3dlightgrid_t *out;
5013 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5014 if (l->filelen % sizeof(*in))
5015 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5016 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5017 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5018 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5019 loadmodel->brushq3.num_lightgrid_imins[0] = ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5020 loadmodel->brushq3.num_lightgrid_imins[1] = ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5021 loadmodel->brushq3.num_lightgrid_imins[2] = ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5022 loadmodel->brushq3.num_lightgrid_imaxs[0] = floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5023 loadmodel->brushq3.num_lightgrid_imaxs[1] = floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5024 loadmodel->brushq3.num_lightgrid_imaxs[2] = floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5025 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5026 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5027 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5028 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5029 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]);
5030 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]);
5032 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5035 if (l->filelen < count * (int)sizeof(*in))
5036 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]);
5037 if (l->filelen != count * (int)sizeof(*in))
5038 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i", count * sizeof(*in), l->filelen);
5039 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5040 loadmodel->brushq3.data_lightgrid = out;
5041 loadmodel->brushq3.num_lightgrid = count;
5042 // no swapping or validation necessary
5043 memcpy(out, in, count * (int)sizeof(*out));
5047 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5052 if (l->filelen == 0)
5055 // unvised maps often have cluster indices even without pvs, so check
5056 // leafs to find real number of clusters
5057 loadmodel->brush.num_pvsclusters = 1;
5058 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5059 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5062 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5063 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5064 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5065 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5069 in = (q3dpvs_t *)(mod_base + l->fileofs);
5071 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5073 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5074 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5075 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5076 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5077 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5078 if (l->filelen < totalchains + (int)sizeof(*in))
5079 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);
5081 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5082 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5085 static void Mod_Q3BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5087 int i, j, k, index[3];
5088 float transformed[3], blend1, blend2, blend, yaw, pitch, sinpitch;
5089 q3dlightgrid_t *a, *s;
5090 if (!model->brushq3.num_lightgrid)
5092 ambientcolor[0] = 1;
5093 ambientcolor[1] = 1;
5094 ambientcolor[2] = 1;
5097 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5098 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5099 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5100 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5101 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5102 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5103 index[0] = (int)floor(transformed[0]);
5104 index[1] = (int)floor(transformed[1]);
5105 index[2] = (int)floor(transformed[2]);
5106 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5107 // now lerp the values
5108 VectorClear(diffusenormal);
5109 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5110 for (k = 0;k < 2;k++)
5112 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5113 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5115 for (j = 0;j < 2;j++)
5117 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5118 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5120 for (i = 0;i < 2;i++)
5122 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0])));
5123 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5125 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5126 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5127 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5128 pitch = s->diffusepitch * M_PI / 128;
5129 yaw = s->diffuseyaw * M_PI / 128;
5130 sinpitch = sin(pitch);
5131 diffusenormal[0] += blend * (cos(yaw) * sinpitch);
5132 diffusenormal[1] += blend * (sin(yaw) * sinpitch);
5133 diffusenormal[2] += blend * (cos(pitch));
5134 //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)));
5138 VectorNormalize(diffusenormal);
5139 //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]);
5142 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const vec3_t point, int markframe)
5147 // find which leaf the point is in
5149 node = node->children[DotProduct(point, node->plane->normal) < node->plane->dist];
5150 // point trace the brushes
5151 leaf = (mleaf_t *)node;
5152 for (i = 0;i < leaf->numleafbrushes;i++)
5154 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5155 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5157 brush->markframe = markframe;
5158 Collision_TracePointBrushFloat(trace, point, brush);
5161 // can't do point traces on curves (they have no thickness)
5164 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)
5166 int i, startside, endside;
5167 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5169 msurface_t *surface;
5172 // walk the tree until we hit a leaf, recursing for any split cases
5175 plane = node->plane;
5176 // axial planes are much more common than non-axial, so an optimized
5177 // axial case pays off here
5178 if (plane->type < 3)
5180 dist1 = start[plane->type] - plane->dist;
5181 dist2 = end[plane->type] - plane->dist;
5185 dist1 = DotProduct(start, plane->normal) - plane->dist;
5186 dist2 = DotProduct(end, plane->normal) - plane->dist;
5188 startside = dist1 < 0;
5189 endside = dist2 < 0;
5190 if (startside == endside)
5192 // most of the time the line fragment is on one side of the plane
5193 node = node->children[startside];
5197 // line crosses node plane, split the line
5198 dist1 = PlaneDiff(linestart, plane);
5199 dist2 = PlaneDiff(lineend, plane);
5200 midfrac = dist1 / (dist1 - dist2);
5201 VectorLerp(linestart, midfrac, lineend, mid);
5202 // take the near side first
5203 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5204 // if we found an impact on the front side, don't waste time
5205 // exploring the far side
5206 if (midfrac <= trace->realfraction)
5207 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5212 nodesegmentmins[0] = min(start[0], end[0]) - 1;
5213 nodesegmentmins[1] = min(start[1], end[1]) - 1;
5214 nodesegmentmins[2] = min(start[2], end[2]) - 1;
5215 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5216 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5217 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5218 // line trace the brushes
5219 leaf = (mleaf_t *)node;
5220 for (i = 0;i < leaf->numleafbrushes;i++)
5222 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5223 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5225 brush->markframe = markframe;
5226 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5229 // can't do point traces on curves (they have no thickness)
5230 if (mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5232 // line trace the curves
5233 for (i = 0;i < leaf->numleafsurfaces;i++)
5235 surface = model->data_surfaces + leaf->firstleafsurface[i];
5236 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5238 surface->collisionmarkframe = markframe;
5239 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5245 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)
5251 msurface_t *surface;
5253 float nodesegmentmins[3], nodesegmentmaxs[3];
5254 // walk the tree until we hit a leaf, recursing for any split cases
5257 plane = node->plane;
5258 // axial planes are much more common than non-axial, so an optimized
5259 // axial case pays off here
5260 if (plane->type < 3)
5262 // this is an axial plane, compare bounding box directly to it and
5263 // recurse sides accordingly
5264 // recurse down node sides
5265 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5266 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5267 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5268 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5272 // this is a non-axial plane, so check if the start and end boxes
5273 // are both on one side of the plane to handle 'diagonal' cases
5274 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5278 // segment crosses plane
5279 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5282 // if sides == 0 then the trace itself is bogus (Not A Number values),
5283 // in this case we simply pretend the trace hit nothing
5285 return; // ERROR: NAN bounding box!
5286 // take whichever side the segment box is on
5287 node = node->children[sides - 1];
5289 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5290 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5291 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5292 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5293 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5294 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5296 leaf = (mleaf_t *)node;
5297 for (i = 0;i < leaf->numleafbrushes;i++)
5299 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5300 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5302 brush->markframe = markframe;
5303 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5306 if (mod_q3bsp_curves_collisions.integer)
5308 for (i = 0;i < leaf->numleafsurfaces;i++)
5310 surface = model->data_surfaces + leaf->firstleafsurface[i];
5311 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5313 surface->collisionmarkframe = markframe;
5314 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);
5320 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)
5323 float segmentmins[3], segmentmaxs[3];
5324 static int markframe = 0;
5325 msurface_t *surface;
5327 memset(trace, 0, sizeof(*trace));
5328 trace->fraction = 1;
5329 trace->realfraction = 1;
5330 trace->hitsupercontentsmask = hitsupercontentsmask;
5331 if (mod_q3bsp_optimizedtraceline.integer && VectorLength2(boxmins) + VectorLength2(boxmaxs) == 0)
5333 if (VectorCompare(start, end))
5336 if (model->brush.submodel)
5338 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5339 if (brush->colbrushf)
5340 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5343 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5348 segmentmins[0] = min(start[0], end[0]) - 1;
5349 segmentmins[1] = min(start[1], end[1]) - 1;
5350 segmentmins[2] = min(start[2], end[2]) - 1;
5351 segmentmaxs[0] = max(start[0], end[0]) + 1;
5352 segmentmaxs[1] = max(start[1], end[1]) + 1;
5353 segmentmaxs[2] = max(start[2], end[2]) + 1;
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_TraceLineBrushFloat(trace, start, 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_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5365 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5370 // box trace, performed as brush trace
5371 colbrushf_t *thisbrush_start, *thisbrush_end;
5372 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5373 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5374 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5375 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5376 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5377 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5378 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5379 VectorAdd(start, boxmins, boxstartmins);
5380 VectorAdd(start, boxmaxs, boxstartmaxs);
5381 VectorAdd(end, boxmins, boxendmins);
5382 VectorAdd(end, boxmaxs, boxendmaxs);
5383 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5384 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5385 if (model->brush.submodel)
5387 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5388 if (brush->colbrushf)
5389 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5390 if (mod_q3bsp_curves_collisions.integer)
5391 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5392 if (surface->num_collisiontriangles)
5393 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);
5396 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5400 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
5402 int supercontents = 0;
5403 if (nativecontents & CONTENTSQ3_SOLID)
5404 supercontents |= SUPERCONTENTS_SOLID;
5405 if (nativecontents & CONTENTSQ3_WATER)
5406 supercontents |= SUPERCONTENTS_WATER;
5407 if (nativecontents & CONTENTSQ3_SLIME)
5408 supercontents |= SUPERCONTENTS_SLIME;
5409 if (nativecontents & CONTENTSQ3_LAVA)
5410 supercontents |= SUPERCONTENTS_LAVA;
5411 if (nativecontents & CONTENTSQ3_BODY)
5412 supercontents |= SUPERCONTENTS_BODY;
5413 if (nativecontents & CONTENTSQ3_CORPSE)
5414 supercontents |= SUPERCONTENTS_CORPSE;
5415 if (nativecontents & CONTENTSQ3_NODROP)
5416 supercontents |= SUPERCONTENTS_NODROP;
5417 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5418 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5419 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5420 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5421 if (nativecontents & CONTENTSQ3_DONOTENTER)
5422 supercontents |= SUPERCONTENTS_DONOTENTER;
5423 return supercontents;
5426 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
5428 int nativecontents = 0;
5429 if (supercontents & SUPERCONTENTS_SOLID)
5430 nativecontents |= CONTENTSQ3_SOLID;
5431 if (supercontents & SUPERCONTENTS_WATER)
5432 nativecontents |= CONTENTSQ3_WATER;
5433 if (supercontents & SUPERCONTENTS_SLIME)
5434 nativecontents |= CONTENTSQ3_SLIME;
5435 if (supercontents & SUPERCONTENTS_LAVA)
5436 nativecontents |= CONTENTSQ3_LAVA;
5437 if (supercontents & SUPERCONTENTS_BODY)
5438 nativecontents |= CONTENTSQ3_BODY;
5439 if (supercontents & SUPERCONTENTS_CORPSE)
5440 nativecontents |= CONTENTSQ3_CORPSE;
5441 if (supercontents & SUPERCONTENTS_NODROP)
5442 nativecontents |= CONTENTSQ3_NODROP;
5443 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5444 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5445 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5446 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5447 if (supercontents & SUPERCONTENTS_DONOTENTER)
5448 nativecontents |= CONTENTSQ3_DONOTENTER;
5449 return nativecontents;
5452 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5457 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5458 node = node->children[1];
5460 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5461 if (loadmodel->brush.num_leafs < numleafs)
5462 loadmodel->brush.num_leafs = numleafs;
5465 void Mod_Q3BSP_Load(model_t *mod, void *buffer, void *bufferend)
5467 int i, j, numshadowmeshtriangles;
5468 q3dheader_t *header;
5469 float corner[3], yawradius, modelradius;
5470 msurface_t *surface;
5472 mod->type = mod_brushq3;
5473 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5476 header = (q3dheader_t *)buffer;
5478 i = LittleLong(header->version);
5479 if (i != Q3BSPVERSION)
5480 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5481 mod->brush.ishlbsp = false;
5482 mod->brush.ismcbsp = false;
5483 if (loadmodel->isworldmodel)
5485 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
5486 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
5489 mod->soundfromcenter = true;
5490 mod->TraceBox = Mod_Q3BSP_TraceBox;
5491 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5492 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5493 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5494 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5495 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5496 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5497 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5498 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
5499 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5500 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5501 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5502 mod->Draw = R_Q1BSP_Draw;
5503 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5504 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5505 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5506 mod->DrawLight = R_Q1BSP_DrawLight;
5508 mod_base = (unsigned char *)header;
5510 // swap all the lumps
5511 header->ident = LittleLong(header->ident);
5512 header->version = LittleLong(header->version);
5513 for (i = 0;i < Q3HEADER_LUMPS;i++)
5515 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
5516 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
5519 mod->brush.qw_md4sum = 0;
5520 mod->brush.qw_md4sum2 = 0;
5521 for (i = 0;i < Q3HEADER_LUMPS;i++)
5523 if (i == Q3LUMP_ENTITIES)
5525 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5526 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
5528 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5531 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5532 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5533 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5534 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5535 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5536 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5537 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5538 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5539 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS]);
5540 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5541 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5542 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5543 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5544 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5545 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5546 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5547 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5548 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5550 // the MakePortals code works fine on the q3bsp data as well
5551 Mod_Q1BSP_MakePortals();
5553 // make a single combined shadow mesh to allow optimized shadow volume creation
5554 numshadowmeshtriangles = 0;
5555 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5557 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5558 numshadowmeshtriangles += surface->num_triangles;
5560 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5561 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5562 if (surface->groupmesh)
5563 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));
5564 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true);
5565 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5567 loadmodel->brush.num_leafs = 0;
5568 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
5570 if (loadmodel->isworldmodel)
5572 // clear out any stale submodels or worldmodels lying around
5573 // if we did this clear before now, an error might abort loading and
5574 // leave things in a bad state
5575 Mod_RemoveStaleWorldModels(loadmodel);
5579 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
5584 // LordHavoc: only register submodels if it is the world
5585 // (prevents external bsp models from replacing world submodels with
5587 if (!loadmodel->isworldmodel)
5589 // duplicate the basic information
5590 sprintf(name, "*%i", i);
5591 mod = Mod_FindName(name);
5593 strcpy(mod->name, name);
5594 // textures and memory belong to the main model
5595 mod->texturepool = NULL;
5596 mod->mempool = NULL;
5597 mod->brush.GetPVS = NULL;
5598 mod->brush.FatPVS = NULL;
5599 mod->brush.BoxTouchingPVS = NULL;
5600 mod->brush.BoxTouchingLeafPVS = NULL;
5601 mod->brush.BoxTouchingVisibleLeafs = NULL;
5602 mod->brush.FindBoxClusters = NULL;
5603 mod->brush.LightPoint = NULL;
5604 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5606 mod->brush.submodel = i;
5608 // make the model surface list (used by shadowing/lighting)
5609 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
5610 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
5611 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
5612 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
5613 mod->surfacelist = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
5614 for (j = 0;j < mod->nummodelsurfaces;j++)
5615 mod->surfacelist[j] = mod->firstmodelsurface + j;
5617 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
5618 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
5619 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5620 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5621 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5622 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5623 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5624 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5625 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5626 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5627 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5628 mod->yawmins[2] = mod->normalmins[2];
5629 mod->yawmaxs[2] = mod->normalmaxs[2];
5630 mod->radius = modelradius;
5631 mod->radius2 = modelradius * modelradius;
5633 for (j = 0;j < mod->nummodelsurfaces;j++)
5634 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->surfaceflags & Q3SURFACEFLAG_SKY)
5636 if (j < mod->nummodelsurfaces)
5637 mod->DrawSky = R_Q1BSP_DrawSky;
5641 void Mod_IBSP_Load(model_t *mod, void *buffer, void *bufferend)
5643 int i = LittleLong(((int *)buffer)[1]);
5644 if (i == Q3BSPVERSION)
5645 Mod_Q3BSP_Load(mod,buffer, bufferend);
5646 else if (i == Q2BSPVERSION)
5647 Mod_Q2BSP_Load(mod,buffer, bufferend);
5649 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
5652 void Mod_MAP_Load(model_t *mod, void *buffer, void *bufferend)
5654 Host_Error("Mod_MAP_Load: not yet implemented");