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_picmipworld = {CVAR_SAVE, "r_picmipworld", "1", "whether gl_picmip shall apply to world textures too"};
35 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)"};
36 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)"};
37 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)"};
38 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
39 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
40 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)"};
41 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)"};
42 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)"};
43 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
44 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
45 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
46 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
47 cvar_t mod_q3bsp_lightmapmergepower = {CVAR_SAVE, "mod_q3bsp_lightmapmergepower", "4", "merges the quake3 128x128 lightmap textures into larger lightmap group textures to speed up rendering, 1 = 256x256, 2 = 512x512, 3 = 1024x1024, 4 = 2048x2048, 5 = 4096x4096, ..."};
49 static texture_t mod_q1bsp_texture_solid;
50 static texture_t mod_q1bsp_texture_sky;
51 static texture_t mod_q1bsp_texture_lava;
52 static texture_t mod_q1bsp_texture_slime;
53 static texture_t mod_q1bsp_texture_water;
55 void Mod_BrushInit(void)
57 // Cvar_RegisterVariable(&r_subdivide_size);
58 Cvar_RegisterVariable(&halflifebsp);
59 Cvar_RegisterVariable(&mcbsp);
60 Cvar_RegisterVariable(&r_novis);
61 Cvar_RegisterVariable(&r_lightmaprgba);
62 Cvar_RegisterVariable(&r_picmipworld);
63 Cvar_RegisterVariable(&r_nosurftextures);
64 Cvar_RegisterVariable(&r_subdivisions_tolerance);
65 Cvar_RegisterVariable(&r_subdivisions_mintess);
66 Cvar_RegisterVariable(&r_subdivisions_maxtess);
67 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
68 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
69 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
70 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
71 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
72 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
73 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
74 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
75 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
77 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
78 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
79 mod_q1bsp_texture_solid.surfaceflags = 0;
80 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
82 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
83 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
84 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
85 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
87 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
88 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
89 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
90 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
92 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
93 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
94 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
95 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
97 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
98 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
99 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
100 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
103 static mleaf_t *Mod_Q1BSP_PointInLeaf(model_t *model, const vec3_t p)
110 // LordHavoc: modified to start at first clip node,
111 // in other words: first node of the (sub)model
112 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
114 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
116 return (mleaf_t *)node;
119 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(model_t *model, const vec3_t p, unsigned char *out, int outsize)
123 leaf = Mod_Q1BSP_PointInLeaf(model, p);
126 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
129 memcpy(out, leaf->ambient_sound_level, i);
135 memset(out, 0, outsize);
138 static int Mod_Q1BSP_FindBoxClusters(model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
141 int nodestackindex = 0;
142 mnode_t *node, *nodestack[1024];
143 if (!model->brush.num_pvsclusters)
145 node = model->brush.data_nodes;
151 // node - recurse down the BSP tree
152 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
156 return -1; // ERROR: NAN bounding box!
157 // box is on one side of plane, take that path
158 node = node->children[sides-1];
162 // box crosses plane, take one path and remember the other
163 if (nodestackindex < 1024)
164 nodestack[nodestackindex++] = node->children[0];
165 node = node->children[1];
171 // leaf - add clusterindex to list
172 if (numclusters < maxclusters)
173 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
177 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
181 if (nodestackindex < 1024)
182 nodestack[nodestackindex++] = node->children[0];
183 node = node->children[1];
188 // leaf - add clusterindex to list
189 if (numclusters < maxclusters)
190 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
195 // try another path we didn't take earlier
196 if (nodestackindex == 0)
198 node = nodestack[--nodestackindex];
200 // return number of clusters found (even if more than the maxclusters)
204 static int Mod_Q1BSP_BoxTouchingPVS(model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
206 int nodestackindex = 0;
207 mnode_t *node, *nodestack[1024];
208 if (!model->brush.num_pvsclusters)
210 node = model->brush.data_nodes;
216 // node - recurse down the BSP tree
217 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
221 return -1; // ERROR: NAN bounding box!
222 // box is on one side of plane, take that path
223 node = node->children[sides-1];
227 // box crosses plane, take one path and remember the other
228 if (nodestackindex < 1024)
229 nodestack[nodestackindex++] = node->children[0];
230 node = node->children[1];
236 // leaf - check cluster bit
237 int clusterindex = ((mleaf_t *)node)->clusterindex;
238 if (CHECKPVSBIT(pvs, clusterindex))
240 // it is visible, return immediately with the news
245 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
249 if (nodestackindex < 1024)
250 nodestack[nodestackindex++] = node->children[0];
251 node = node->children[1];
256 // leaf - check cluster bit
257 int clusterindex = ((mleaf_t *)node)->clusterindex;
258 if (CHECKPVSBIT(pvs, clusterindex))
260 // it is visible, return immediately with the news
266 // nothing to see here, try another path we didn't take earlier
267 if (nodestackindex == 0)
269 node = nodestack[--nodestackindex];
275 static int Mod_Q1BSP_BoxTouchingLeafPVS(model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
277 int nodestackindex = 0;
278 mnode_t *node, *nodestack[1024];
279 if (!model->brush.num_leafs)
281 node = model->brush.data_nodes;
287 // node - recurse down the BSP tree
288 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
292 return -1; // ERROR: NAN bounding box!
293 // box is on one side of plane, take that path
294 node = node->children[sides-1];
298 // box crosses plane, take one path and remember the other
299 if (nodestackindex < 1024)
300 nodestack[nodestackindex++] = node->children[0];
301 node = node->children[1];
307 // leaf - check cluster bit
308 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
309 if (CHECKPVSBIT(pvs, clusterindex))
311 // it is visible, return immediately with the news
316 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
320 if (nodestackindex < 1024)
321 nodestack[nodestackindex++] = node->children[0];
322 node = node->children[1];
327 // leaf - check cluster bit
328 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
329 if (CHECKPVSBIT(pvs, clusterindex))
331 // it is visible, return immediately with the news
337 // nothing to see here, try another path we didn't take earlier
338 if (nodestackindex == 0)
340 node = nodestack[--nodestackindex];
346 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
348 int nodestackindex = 0;
349 mnode_t *node, *nodestack[1024];
350 if (!model->brush.num_leafs)
352 node = model->brush.data_nodes;
358 // node - recurse down the BSP tree
359 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
363 return -1; // ERROR: NAN bounding box!
364 // box is on one side of plane, take that path
365 node = node->children[sides-1];
369 // box crosses plane, take one path and remember the other
370 if (nodestackindex < 1024)
371 nodestack[nodestackindex++] = node->children[0];
372 node = node->children[1];
378 // leaf - check if it is visible
379 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
381 // it is visible, return immediately with the news
386 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
390 if (nodestackindex < 1024)
391 nodestack[nodestackindex++] = node->children[0];
392 node = node->children[1];
397 // leaf - check if it is visible
398 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
400 // it is visible, return immediately with the news
406 // nothing to see here, try another path we didn't take earlier
407 if (nodestackindex == 0)
409 node = nodestack[--nodestackindex];
415 typedef struct findnonsolidlocationinfo_s
423 findnonsolidlocationinfo_t;
425 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
427 int i, surfacenum, k, *tri, *mark;
428 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
430 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
432 surface = info->model->data_surfaces + *mark;
433 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
435 for (k = 0;k < surface->num_triangles;k++)
437 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
438 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
439 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
440 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
441 VectorSubtract(vert[1], vert[0], edge[0]);
442 VectorSubtract(vert[2], vert[1], edge[1]);
443 CrossProduct(edge[1], edge[0], facenormal);
444 if (facenormal[0] || facenormal[1] || facenormal[2])
446 VectorNormalize(facenormal);
447 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
448 if (f <= info->bestdist && f >= -info->bestdist)
450 VectorSubtract(vert[0], vert[2], edge[2]);
451 VectorNormalize(edge[0]);
452 VectorNormalize(edge[1]);
453 VectorNormalize(edge[2]);
454 CrossProduct(facenormal, edge[0], edgenormal[0]);
455 CrossProduct(facenormal, edge[1], edgenormal[1]);
456 CrossProduct(facenormal, edge[2], edgenormal[2]);
458 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
459 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
460 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
462 // we got lucky, the center is within the face
463 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
467 if (info->bestdist > dist)
469 info->bestdist = dist;
470 VectorScale(facenormal, (info->radius - -dist), info->nudge);
475 if (info->bestdist > dist)
477 info->bestdist = dist;
478 VectorScale(facenormal, (info->radius - dist), info->nudge);
484 // check which edge or vertex the center is nearest
485 for (i = 0;i < 3;i++)
487 f = DotProduct(info->center, edge[i]);
488 if (f >= DotProduct(vert[0], edge[i])
489 && f <= DotProduct(vert[1], edge[i]))
492 VectorMA(info->center, -f, edge[i], point);
493 dist = sqrt(DotProduct(point, point));
494 if (info->bestdist > dist)
496 info->bestdist = dist;
497 VectorScale(point, (info->radius / dist), info->nudge);
499 // skip both vertex checks
500 // (both are further away than this edge)
505 // not on edge, check first vertex of edge
506 VectorSubtract(info->center, vert[i], point);
507 dist = sqrt(DotProduct(point, point));
508 if (info->bestdist > dist)
510 info->bestdist = dist;
511 VectorScale(point, (info->radius / dist), info->nudge);
523 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
527 float f = PlaneDiff(info->center, node->plane);
528 if (f >= -info->bestdist)
529 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
530 if (f <= info->bestdist)
531 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
535 if (((mleaf_t *)node)->numleafsurfaces)
536 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
540 static void Mod_Q1BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, float radius)
543 findnonsolidlocationinfo_t info;
549 VectorCopy(in, info.center);
550 info.radius = radius;
555 VectorClear(info.nudge);
556 info.bestdist = radius;
557 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
558 VectorAdd(info.center, info.nudge, info.center);
560 while (info.bestdist < radius && ++i < 10);
561 VectorCopy(info.center, out);
564 int Mod_Q1BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
566 switch(nativecontents)
571 return SUPERCONTENTS_SOLID;
573 return SUPERCONTENTS_WATER;
575 return SUPERCONTENTS_SLIME;
577 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
579 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
584 int Mod_Q1BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
586 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
587 return CONTENTS_SOLID;
588 if (supercontents & SUPERCONTENTS_SKY)
590 if (supercontents & SUPERCONTENTS_LAVA)
591 return CONTENTS_LAVA;
592 if (supercontents & SUPERCONTENTS_SLIME)
593 return CONTENTS_SLIME;
594 if (supercontents & SUPERCONTENTS_WATER)
595 return CONTENTS_WATER;
596 return CONTENTS_EMPTY;
599 typedef struct RecursiveHullCheckTraceInfo_s
601 // the hull we're tracing through
604 // the trace structure to fill in
607 // start, end, and end - start (in model space)
612 RecursiveHullCheckTraceInfo_t;
614 // 1/32 epsilon to keep floating point happy
615 #define DIST_EPSILON (0.03125)
617 #define HULLCHECKSTATE_EMPTY 0
618 #define HULLCHECKSTATE_SOLID 1
619 #define HULLCHECKSTATE_DONE 2
621 extern cvar_t collision_prefernudgedfraction;
622 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
624 // status variables, these don't need to be saved on the stack when
625 // recursing... but are because this should be thread-safe
626 // (note: tracing against a bbox is not thread-safe, yet)
631 // variables that need to be stored on the stack when recursing
636 // LordHavoc: a goto! everyone flee in terror... :)
641 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
642 if (!t->trace->startfound)
644 t->trace->startfound = true;
645 t->trace->startsupercontents |= num;
647 if (num & SUPERCONTENTS_LIQUIDSMASK)
648 t->trace->inwater = true;
650 t->trace->inopen = true;
651 if (num & SUPERCONTENTS_SOLID)
652 t->trace->hittexture = &mod_q1bsp_texture_solid;
653 else if (num & SUPERCONTENTS_SKY)
654 t->trace->hittexture = &mod_q1bsp_texture_sky;
655 else if (num & SUPERCONTENTS_LAVA)
656 t->trace->hittexture = &mod_q1bsp_texture_lava;
657 else if (num & SUPERCONTENTS_SLIME)
658 t->trace->hittexture = &mod_q1bsp_texture_slime;
660 t->trace->hittexture = &mod_q1bsp_texture_water;
661 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
662 t->trace->hitsupercontents = num;
663 if (num & t->trace->hitsupercontentsmask)
665 // if the first leaf is solid, set startsolid
666 if (t->trace->allsolid)
667 t->trace->startsolid = true;
668 #if COLLISIONPARANOID >= 3
671 return HULLCHECKSTATE_SOLID;
675 t->trace->allsolid = false;
676 #if COLLISIONPARANOID >= 3
679 return HULLCHECKSTATE_EMPTY;
683 // find the point distances
684 node = t->hull->clipnodes + num;
686 plane = t->hull->planes + node->planenum;
689 t1 = p1[plane->type] - plane->dist;
690 t2 = p2[plane->type] - plane->dist;
694 t1 = DotProduct (plane->normal, p1) - plane->dist;
695 t2 = DotProduct (plane->normal, p2) - plane->dist;
702 #if COLLISIONPARANOID >= 3
705 num = node->children[1];
714 #if COLLISIONPARANOID >= 3
717 num = node->children[0];
723 // the line intersects, find intersection point
724 // LordHavoc: this uses the original trace for maximum accuracy
725 #if COLLISIONPARANOID >= 3
730 t1 = t->start[plane->type] - plane->dist;
731 t2 = t->end[plane->type] - plane->dist;
735 t1 = DotProduct (plane->normal, t->start) - plane->dist;
736 t2 = DotProduct (plane->normal, t->end) - plane->dist;
739 midf = t1 / (t1 - t2);
740 midf = bound(p1f, midf, p2f);
741 VectorMA(t->start, midf, t->dist, mid);
743 // recurse both sides, front side first
744 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
745 // if this side is not empty, return what it is (solid or done)
746 if (ret != HULLCHECKSTATE_EMPTY)
749 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
750 // if other side is not solid, return what it is (empty or done)
751 if (ret != HULLCHECKSTATE_SOLID)
754 // front is air and back is solid, this is the impact point...
757 t->trace->plane.dist = -plane->dist;
758 VectorNegate (plane->normal, t->trace->plane.normal);
762 t->trace->plane.dist = plane->dist;
763 VectorCopy (plane->normal, t->trace->plane.normal);
766 // calculate the true fraction
767 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
768 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
769 midf = t1 / (t1 - t2);
770 t->trace->realfraction = bound(0, midf, 1);
772 // calculate the return fraction which is nudged off the surface a bit
773 midf = (t1 - DIST_EPSILON) / (t1 - t2);
774 t->trace->fraction = bound(0, midf, 1);
776 if (collision_prefernudgedfraction.integer)
777 t->trace->realfraction = t->trace->fraction;
779 #if COLLISIONPARANOID >= 3
782 return HULLCHECKSTATE_DONE;
785 //#if COLLISIONPARANOID < 2
786 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
789 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];
790 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
791 t->trace->startsupercontents |= num;
792 if (num & SUPERCONTENTS_LIQUIDSMASK)
793 t->trace->inwater = true;
795 t->trace->inopen = true;
796 if (num & t->trace->hitsupercontentsmask)
798 t->trace->allsolid = t->trace->startsolid = true;
799 return HULLCHECKSTATE_SOLID;
803 t->trace->allsolid = t->trace->startsolid = false;
804 return HULLCHECKSTATE_EMPTY;
809 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)
811 // this function currently only supports same size start and end
813 RecursiveHullCheckTraceInfo_t rhc;
815 memset(&rhc, 0, sizeof(rhc));
816 memset(trace, 0, sizeof(trace_t));
818 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
819 rhc.trace->fraction = 1;
820 rhc.trace->realfraction = 1;
821 rhc.trace->allsolid = true;
822 VectorSubtract(boxmaxs, boxmins, boxsize);
824 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
825 else if (model->brush.ismcbsp)
827 if (boxsize[2] < 48) // pick the nearest of 40 or 56
828 rhc.hull = &model->brushq1.hulls[2]; // 16x16x40
830 rhc.hull = &model->brushq1.hulls[1]; // 16x16x56
832 else if (model->brush.ishlbsp)
834 // LordHavoc: this has to have a minor tolerance (the .1) because of
835 // minor float precision errors from the box being transformed around
836 if (boxsize[0] < 32.1)
838 if (boxsize[2] < 54) // pick the nearest of 36 or 72
839 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
841 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
844 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
848 // LordHavoc: this has to have a minor tolerance (the .1) because of
849 // minor float precision errors from the box being transformed around
850 if (boxsize[0] < 32.1)
851 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
853 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
855 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
856 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
857 VectorSubtract(rhc.end, rhc.start, rhc.dist);
858 #if COLLISIONPARANOID >= 2
859 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]);
860 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
865 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
866 memset(&testtrace, 0, sizeof(trace_t));
867 rhc.trace = &testtrace;
868 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
869 rhc.trace->fraction = 1;
870 rhc.trace->realfraction = 1;
871 rhc.trace->allsolid = true;
872 VectorCopy(test, rhc.start);
873 VectorCopy(test, rhc.end);
874 VectorClear(rhc.dist);
875 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
876 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
877 if (!trace->startsolid && testtrace.startsolid)
878 Con_Printf(" - ended in solid!\n");
882 if (VectorLength2(rhc.dist))
883 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
885 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
889 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)
893 colplanef_t cbox_planes[6];
894 cbox.supercontents = boxsupercontents;
897 cbox.numtriangles = 0;
898 cbox.planes = cbox_planes;
900 cbox.elements = NULL;
908 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];
909 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];
910 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];
911 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];
912 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];
913 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];
914 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
915 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
916 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
917 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
918 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
919 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
920 memset(trace, 0, sizeof(trace_t));
921 trace->hitsupercontentsmask = hitsupercontentsmask;
923 trace->realfraction = 1;
924 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
926 RecursiveHullCheckTraceInfo_t rhc;
927 static hull_t box_hull;
928 static dclipnode_t box_clipnodes[6];
929 static mplane_t box_planes[6];
930 // fill in a default trace
931 memset(&rhc, 0, sizeof(rhc));
932 memset(trace, 0, sizeof(trace_t));
933 //To keep everything totally uniform, bounding boxes are turned into small
934 //BSP trees instead of being compared directly.
935 // create a temp hull from bounding box sizes
936 box_planes[0].dist = cmaxs[0] - mins[0];
937 box_planes[1].dist = cmins[0] - maxs[0];
938 box_planes[2].dist = cmaxs[1] - mins[1];
939 box_planes[3].dist = cmins[1] - maxs[1];
940 box_planes[4].dist = cmaxs[2] - mins[2];
941 box_planes[5].dist = cmins[2] - maxs[2];
942 #if COLLISIONPARANOID >= 3
943 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]);
946 if (box_hull.clipnodes == NULL)
950 //Set up the planes and clipnodes so that the six floats of a bounding box
951 //can just be stored out and get a proper hull_t structure.
953 box_hull.clipnodes = box_clipnodes;
954 box_hull.planes = box_planes;
955 box_hull.firstclipnode = 0;
956 box_hull.lastclipnode = 5;
958 for (i = 0;i < 6;i++)
960 box_clipnodes[i].planenum = i;
964 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
966 box_clipnodes[i].children[side^1] = i + 1;
968 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
970 box_planes[i].type = i>>1;
971 box_planes[i].normal[i>>1] = 1;
975 // trace a line through the generated clipping hull
976 //rhc.boxsupercontents = boxsupercontents;
977 rhc.hull = &box_hull;
979 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
980 rhc.trace->fraction = 1;
981 rhc.trace->realfraction = 1;
982 rhc.trace->allsolid = true;
983 VectorCopy(start, rhc.start);
984 VectorCopy(end, rhc.end);
985 VectorSubtract(rhc.end, rhc.start, rhc.dist);
986 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
987 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
988 if (rhc.trace->startsupercontents)
989 rhc.trace->startsupercontents = boxsupercontents;
993 static int Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
1002 // find the point distances
1003 mplane_t *plane = node->plane;
1004 if (plane->type < 3)
1006 t1 = p1[plane->type] - plane->dist;
1007 t2 = p2[plane->type] - plane->dist;
1011 t1 = DotProduct (plane->normal, p1) - plane->dist;
1012 t2 = DotProduct (plane->normal, p2) - plane->dist;
1019 node = node->children[1];
1028 node = node->children[0];
1034 midf = t1 / (t1 - t2);
1035 VectorLerp(p1, midf, p2, mid);
1037 // recurse both sides, front side first
1038 // return 2 if empty is followed by solid (hit something)
1039 // do not return 2 if both are solid or both empty,
1040 // or if start is solid and end is empty
1041 // as these degenerate cases usually indicate the eye is in solid and
1042 // should see the target point anyway
1043 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
1046 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
1051 return ((mleaf_t *)node)->clusterindex < 0;
1054 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1056 // this function currently only supports same size start and end
1057 double tracestart[3], traceend[3];
1058 VectorCopy(start, tracestart);
1059 VectorCopy(end, traceend);
1060 return Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend) != 2;
1063 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)
1067 float mid, distz = endz - startz;
1071 return false; // didn't hit anything
1073 switch (node->plane->type)
1076 node = node->children[x < node->plane->dist];
1079 node = node->children[y < node->plane->dist];
1082 side = startz < node->plane->dist;
1083 if ((endz < node->plane->dist) == side)
1085 node = node->children[side];
1088 // found an intersection
1089 mid = node->plane->dist;
1092 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1093 front += startz * node->plane->normal[2];
1094 back += endz * node->plane->normal[2];
1095 side = front < node->plane->dist;
1096 if ((back < node->plane->dist) == side)
1098 node = node->children[side];
1101 // found an intersection
1102 mid = startz + distz * (front - node->plane->dist) / (front - back);
1106 // go down front side
1107 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1108 return true; // hit something
1111 // check for impact on this node
1112 if (node->numsurfaces)
1115 msurface_t *surface;
1117 surface = model->data_surfaces + node->firstsurface;
1118 for (i = 0;i < node->numsurfaces;i++, surface++)
1120 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1121 continue; // no lightmaps
1123 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];
1124 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];
1126 if (ds >= 0 && ds < surface->lightmapinfo->extents[0] && dt >= 0 && dt < surface->lightmapinfo->extents[1])
1128 unsigned char *lightmap;
1129 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;
1130 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1131 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1132 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1133 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1135 lightmap = surface->lightmapinfo->samples + ((dt>>4) * lmwidth + (ds>>4))*3; // LordHavoc: *3 for colored lighting
1137 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1139 scale = r_refdef.lightstylevalue[surface->lightmapinfo->styles[maps]];
1140 r00 += lightmap[ 0] * scale;g00 += lightmap[ 1] * scale;b00 += lightmap[ 2] * scale;
1141 r01 += lightmap[ 3] * scale;g01 += lightmap[ 4] * scale;b01 += lightmap[ 5] * scale;
1142 r10 += lightmap[line3+0] * scale;g10 += lightmap[line3+1] * scale;b10 += lightmap[line3+2] * scale;
1143 r11 += lightmap[line3+3] * scale;g11 += lightmap[line3+4] * scale;b11 += lightmap[line3+5] * scale;
1148 LordHavoc: here's the readable version of the interpolation
1149 code, not quite as easy for the compiler to optimize...
1151 dsfrac is the X position in the lightmap pixel, * 16
1152 dtfrac is the Y position in the lightmap pixel, * 16
1153 r00 is top left corner, r01 is top right corner
1154 r10 is bottom left corner, r11 is bottom right corner
1155 g and b are the same layout.
1156 r0 and r1 are the top and bottom intermediate results
1158 first we interpolate the top two points, to get the top
1161 r0 = (((r01-r00) * dsfrac) >> 4) + r00;
1162 g0 = (((g01-g00) * dsfrac) >> 4) + g00;
1163 b0 = (((b01-b00) * dsfrac) >> 4) + b00;
1165 then we interpolate the bottom two points, to get the
1168 r1 = (((r11-r10) * dsfrac) >> 4) + r10;
1169 g1 = (((g11-g10) * dsfrac) >> 4) + g10;
1170 b1 = (((b11-b10) * dsfrac) >> 4) + b10;
1172 then we interpolate the top and bottom samples to get the
1173 middle sample (the one which was requested)
1175 r = (((r1-r0) * dtfrac) >> 4) + r0;
1176 g = (((g1-g0) * dtfrac) >> 4) + g0;
1177 b = (((b1-b0) * dtfrac) >> 4) + b0;
1180 ambientcolor[0] += (float) ((((((((r11-r10) * dsfrac) >> 4) + r10)-((((r01-r00) * dsfrac) >> 4) + r00)) * dtfrac) >> 4) + ((((r01-r00) * dsfrac) >> 4) + r00)) * (1.0f / 32768.0f);
1181 ambientcolor[1] += (float) ((((((((g11-g10) * dsfrac) >> 4) + g10)-((((g01-g00) * dsfrac) >> 4) + g00)) * dtfrac) >> 4) + ((((g01-g00) * dsfrac) >> 4) + g00)) * (1.0f / 32768.0f);
1182 ambientcolor[2] += (float) ((((((((b11-b10) * dsfrac) >> 4) + b10)-((((b01-b00) * dsfrac) >> 4) + b00)) * dtfrac) >> 4) + ((((b01-b00) * dsfrac) >> 4) + b00)) * (1.0f / 32768.0f);
1183 return true; // success
1188 // go down back side
1189 node = node->children[side ^ 1];
1191 distz = endz - startz;
1196 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1198 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1199 VectorSet(diffusenormal, 0, 0, 1);
1201 if (!model->brushq1.lightdata)
1203 VectorSet(ambientcolor, 1, 1, 1);
1204 VectorSet(diffusecolor, 0, 0, 0);
1208 Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode, p[0], p[1], p[2] + 0.125, p[2] - 65536);
1211 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1214 unsigned char *outstart = out;
1215 while (out < outend)
1219 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1229 Con_Printf("Mod_Q1BSP_DecompressVis: input underrun (during zero-run) on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1232 for (c = *in++;c > 0;c--)
1236 Con_Printf("Mod_Q1BSP_DecompressVis: output overrun on model \"%s\" (decompressed %i of %i output bytes)\n", loadmodel->name, (int)(out - outstart), (int)(outend - outstart));
1247 R_Q1BSP_LoadSplitSky
1249 A sky texture is 256*128, with the right side being a masked overlay
1252 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1255 unsigned solidpixels[128*128], alphapixels[128*128];
1257 // allocate a texture pool if we need it
1258 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1259 loadmodel->texturepool = R_AllocTexturePool();
1261 // if sky isn't the right size, just use it as a solid layer
1262 if (width != 256 || height != 128)
1264 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);
1265 loadmodel->brush.alphaskytexture = NULL;
1269 if (bytesperpixel == 4)
1271 for (i = 0;i < 128;i++)
1273 for (j = 0;j < 128;j++)
1275 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1276 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1282 // make an average value for the back to avoid
1283 // a fringe on the top level
1292 for (i = 0;i < 128;i++)
1294 for (j = 0;j < 128;j++)
1296 rgba.i = palette_complete[src[i*256 + j + 128]];
1302 rgba.b[0] = r/(128*128);
1303 rgba.b[1] = g/(128*128);
1304 rgba.b[2] = b/(128*128);
1306 for (i = 0;i < 128;i++)
1308 for (j = 0;j < 128;j++)
1310 solidpixels[(i*128) + j] = palette_complete[src[i*256 + j + 128]];
1311 alphapixels[(i*128) + j] = (p = src[i*256 + j]) ? palette_complete[p] : rgba.i;
1316 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_RGBA, TEXF_PRECACHE, NULL);
1317 loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_RGBA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1320 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1322 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1323 skinframe_t *skinframe;
1325 texture_t *tx, *tx2, *anims[10], *altanims[10];
1327 unsigned char *data, *mtdata;
1329 char mapname[MAX_QPATH], name[MAX_QPATH];
1331 loadmodel->data_textures = NULL;
1333 // add two slots for notexture walls and notexture liquids
1336 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1337 m->nummiptex = LittleLong (m->nummiptex);
1338 loadmodel->num_textures = m->nummiptex + 2;
1339 loadmodel->num_texturesperskin = loadmodel->num_textures;
1344 loadmodel->num_textures = 2;
1345 loadmodel->num_texturesperskin = loadmodel->num_textures;
1348 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1350 // fill out all slots with notexture
1351 if (cls.state != ca_dedicated)
1352 skinframe = R_SkinFrame_LoadMissing();
1355 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1357 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1360 if (cls.state != ca_dedicated)
1362 tx->numskinframes = 1;
1363 tx->skinframerate = 1;
1364 tx->skinframes[0] = skinframe;
1365 tx->currentskinframe = tx->skinframes[0];
1366 tx->basematerialflags = 0;
1368 if (i == loadmodel->num_textures - 1)
1370 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1371 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1372 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1376 tx->basematerialflags |= MATERIALFLAG_WALL;
1377 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1378 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1380 tx->currentframe = tx;
1386 s = loadmodel->name;
1387 if (!strncasecmp(s, "maps/", 5))
1389 FS_StripExtension(s, mapname, sizeof(mapname));
1391 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1393 // LordHavoc: mostly rewritten map texture loader
1394 for (i = 0;i < m->nummiptex;i++)
1396 dofs[i] = LittleLong(dofs[i]);
1397 if (dofs[i] == -1 || r_nosurftextures.integer)
1399 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1401 // copy name, but only up to 16 characters
1402 // (the output buffer can hold more than this, but the input buffer is
1404 for (j = 0;dmiptex->name[j] && j < 16;j++)
1405 name[j] = dmiptex->name[j];
1408 mtwidth = LittleLong(dmiptex->width);
1409 mtheight = LittleLong(dmiptex->height);
1411 j = LittleLong(dmiptex->offsets[0]);
1415 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1417 Con_Printf("Texture \"%s\" in \"%s\"is corrupt or incomplete\n", dmiptex->name, loadmodel->name);
1420 mtdata = (unsigned char *)dmiptex + j;
1423 if ((mtwidth & 15) || (mtheight & 15))
1424 Con_Printf("warning: texture \"%s\" in \"%s\" is not 16 aligned\n", dmiptex->name, loadmodel->name);
1426 // LordHavoc: force all names to lowercase
1427 for (j = 0;name[j];j++)
1428 if (name[j] >= 'A' && name[j] <= 'Z')
1429 name[j] += 'a' - 'A';
1431 if (Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, true, false, false))
1434 tx = loadmodel->data_textures + i;
1435 strlcpy(tx->name, name, sizeof(tx->name));
1436 tx->width = mtwidth;
1437 tx->height = mtheight;
1441 sprintf(tx->name, "unnamed%i", i);
1442 Con_Printf("warning: unnamed texture in %s, renaming to %s\n", loadmodel->name, tx->name);
1445 if (tx->name[0] == '*')
1447 if (!strncmp(tx->name, "*lava", 5))
1449 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1450 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1452 else if (!strncmp(tx->name, "*slime", 6))
1454 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1455 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1459 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1460 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1463 else if (!strncmp(tx->name, "sky", 3))
1465 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1466 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1470 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1471 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1474 if (cls.state != ca_dedicated)
1476 // LordHavoc: HL sky textures are entirely different than quake
1477 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1479 if (loadmodel->isworldmodel)
1481 data = loadimagepixels(tx->name, false, 0, 0);
1484 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1487 else if (mtdata != NULL)
1488 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1493 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false);
1495 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false);
1498 // did not find external texture, load it from the bsp or wad3
1499 if (loadmodel->brush.ishlbsp)
1501 // internal texture overrides wad
1502 unsigned char *pixels, *freepixels;
1503 pixels = freepixels = NULL;
1505 pixels = W_ConvertWAD3Texture(dmiptex);
1507 pixels = freepixels = W_GetTexture(tx->name);
1510 tx->width = image_width;
1511 tx->height = image_height;
1512 skinframe = R_SkinFrame_LoadInternal(tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, false, pixels, image_width, image_height, 32, NULL, NULL);
1515 Mem_Free(freepixels);
1517 else if (mtdata) // texture included
1518 skinframe = R_SkinFrame_LoadInternal(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, r_fullbrights.integer, mtdata, tx->width, tx->height, 8, NULL, NULL);
1520 // if skinframe is still NULL the "missing" texture will be used
1522 tx->skinframes[0] = skinframe;
1525 tx->basematerialflags = 0;
1526 if (tx->name[0] == '*')
1528 // LordHavoc: some turbulent textures should not be affected by wateralpha
1529 if (strncmp(tx->name,"*lava",5)
1530 && strncmp(tx->name,"*teleport",9)
1531 && strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1532 tx->basematerialflags |= MATERIALFLAG_WATERALPHA | MATERIALFLAG_NOSHADOW;
1533 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1535 else if (!strncmp(tx->name, "sky", 3))
1536 tx->basematerialflags |= MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1538 tx->basematerialflags |= MATERIALFLAG_WALL;
1539 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1540 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1542 // start out with no animation
1543 tx->currentframe = tx;
1544 tx->currentskinframe = tx->skinframes[0];
1548 // sequence the animations
1549 for (i = 0;i < m->nummiptex;i++)
1551 tx = loadmodel->data_textures + i;
1552 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1554 if (tx->anim_total[0] || tx->anim_total[1])
1555 continue; // already sequenced
1557 // find the number of frames in the animation
1558 memset(anims, 0, sizeof(anims));
1559 memset(altanims, 0, sizeof(altanims));
1561 for (j = i;j < m->nummiptex;j++)
1563 tx2 = loadmodel->data_textures + j;
1564 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1568 if (num >= '0' && num <= '9')
1569 anims[num - '0'] = tx2;
1570 else if (num >= 'a' && num <= 'j')
1571 altanims[num - 'a'] = tx2;
1573 Con_Printf("Bad animating texture %s\n", tx->name);
1577 for (j = 0;j < 10;j++)
1584 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1587 for (j = 0;j < max;j++)
1591 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1595 for (j = 0;j < altmax;j++)
1599 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1608 // if there is no alternate animation, duplicate the primary
1609 // animation into the alternate
1611 for (k = 0;k < 10;k++)
1612 altanims[k] = anims[k];
1615 // link together the primary animation
1616 for (j = 0;j < max;j++)
1619 tx2->animated = true;
1620 tx2->anim_total[0] = max;
1621 tx2->anim_total[1] = altmax;
1622 for (k = 0;k < 10;k++)
1624 tx2->anim_frames[0][k] = anims[k];
1625 tx2->anim_frames[1][k] = altanims[k];
1629 // if there really is an alternate anim...
1630 if (anims[0] != altanims[0])
1632 // link together the alternate animation
1633 for (j = 0;j < altmax;j++)
1636 tx2->animated = true;
1637 // the primary/alternate are reversed here
1638 tx2->anim_total[0] = altmax;
1639 tx2->anim_total[1] = max;
1640 for (k = 0;k < 10;k++)
1642 tx2->anim_frames[0][k] = altanims[k];
1643 tx2->anim_frames[1][k] = anims[k];
1650 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1653 unsigned char *in, *out, *data, d;
1654 char litfilename[MAX_QPATH];
1655 char dlitfilename[MAX_QPATH];
1656 fs_offset_t filesize;
1657 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1659 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1660 for (i=0; i<l->filelen; i++)
1661 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1663 else if (loadmodel->brush.ismcbsp)
1665 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1666 memcpy(loadmodel->brushq1.lightdata, mod_base + l->fileofs, l->filelen);
1668 else // LordHavoc: bsp version 29 (normal white lighting)
1670 // LordHavoc: hope is not lost yet, check for a .lit file to load
1671 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1672 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1673 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1674 strlcat (litfilename, ".lit", sizeof (litfilename));
1675 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1676 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1679 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1681 i = LittleLong(((int *)data)[1]);
1684 Con_DPrintf("loaded %s\n", litfilename);
1685 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1686 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1688 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1691 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1693 i = LittleLong(((int *)data)[1]);
1696 Con_DPrintf("loaded %s\n", dlitfilename);
1697 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1698 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1699 loadmodel->brushq3.deluxemapping_modelspace = false;
1700 loadmodel->brushq3.deluxemapping = true;
1709 Con_Printf("Unknown .lit file version (%d)\n", i);
1711 else if (filesize == 8)
1712 Con_Print("Empty .lit file, ignoring\n");
1714 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1721 // LordHavoc: oh well, expand the white lighting data
1724 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1725 in = mod_base + l->fileofs;
1726 out = loadmodel->brushq1.lightdata;
1727 for (i = 0;i < l->filelen;i++)
1737 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1739 loadmodel->brushq1.num_compressedpvs = 0;
1740 loadmodel->brushq1.data_compressedpvs = NULL;
1743 loadmodel->brushq1.num_compressedpvs = l->filelen;
1744 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1745 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1748 // used only for HalfLife maps
1749 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1751 char key[128], value[4096];
1756 if (!COM_ParseToken_Simple(&data, false))
1758 if (com_token[0] != '{')
1762 if (!COM_ParseToken_Simple(&data, false))
1764 if (com_token[0] == '}')
1765 break; // end of worldspawn
1766 if (com_token[0] == '_')
1767 strlcpy(key, com_token + 1, sizeof(key));
1769 strlcpy(key, com_token, sizeof(key));
1770 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1771 key[strlen(key)-1] = 0;
1772 if (!COM_ParseToken_Simple(&data, false))
1774 dpsnprintf(value, sizeof(value), "%s", com_token);
1775 if (!strcmp("wad", key)) // for HalfLife maps
1777 if (loadmodel->brush.ishlbsp)
1780 for (i = 0;i < (int)sizeof(value);i++)
1781 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1785 for (;i < (int)sizeof(value);i++)
1787 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1788 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1790 else if (value[i] == ';' || value[i] == 0)
1794 strlcpy(wadname, "textures/", sizeof(wadname));
1795 strlcat(wadname, &value[j], sizeof(wadname));
1796 W_LoadTextureWadFile(wadname, false);
1808 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1810 loadmodel->brush.entities = NULL;
1813 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1814 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1815 if (loadmodel->brush.ishlbsp)
1816 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1820 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1826 in = (dvertex_t *)(mod_base + l->fileofs);
1827 if (l->filelen % sizeof(*in))
1828 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1829 count = l->filelen / sizeof(*in);
1830 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1832 loadmodel->brushq1.vertexes = out;
1833 loadmodel->brushq1.numvertexes = count;
1835 for ( i=0 ; i<count ; i++, in++, out++)
1837 out->position[0] = LittleFloat(in->point[0]);
1838 out->position[1] = LittleFloat(in->point[1]);
1839 out->position[2] = LittleFloat(in->point[2]);
1843 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1844 // can be used for this
1846 int SB_ReadInt (unsigned char **buffer)
1849 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1855 float SB_ReadFloat (unsigned char **buffer)
1863 u.i = SB_ReadInt (buffer);
1867 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1869 unsigned char *index;
1873 index = (unsigned char *)(mod_base + l->fileofs);
1874 if (l->filelen % (48+4*hullinfo->filehulls))
1875 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1877 count = l->filelen / (48+4*hullinfo->filehulls);
1878 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1880 loadmodel->brushq1.submodels = out;
1881 loadmodel->brush.numsubmodels = count;
1883 for (i = 0; i < count; i++, out++)
1885 // spread out the mins / maxs by a pixel
1886 out->mins[0] = SB_ReadFloat (&index) - 1;
1887 out->mins[1] = SB_ReadFloat (&index) - 1;
1888 out->mins[2] = SB_ReadFloat (&index) - 1;
1889 out->maxs[0] = SB_ReadFloat (&index) + 1;
1890 out->maxs[1] = SB_ReadFloat (&index) + 1;
1891 out->maxs[2] = SB_ReadFloat (&index) + 1;
1892 out->origin[0] = SB_ReadFloat (&index);
1893 out->origin[1] = SB_ReadFloat (&index);
1894 out->origin[2] = SB_ReadFloat (&index);
1895 for (j = 0; j < hullinfo->filehulls; j++)
1896 out->headnode[j] = SB_ReadInt (&index);
1897 out->visleafs = SB_ReadInt (&index);
1898 out->firstface = SB_ReadInt (&index);
1899 out->numfaces = SB_ReadInt (&index);
1903 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1909 in = (dedge_t *)(mod_base + l->fileofs);
1910 if (l->filelen % sizeof(*in))
1911 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1912 count = l->filelen / sizeof(*in);
1913 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1915 loadmodel->brushq1.edges = out;
1916 loadmodel->brushq1.numedges = count;
1918 for ( i=0 ; i<count ; i++, in++, out++)
1920 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1921 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1922 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1924 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);
1931 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1935 int i, j, k, count, miptex;
1937 in = (texinfo_t *)(mod_base + l->fileofs);
1938 if (l->filelen % sizeof(*in))
1939 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1940 count = l->filelen / sizeof(*in);
1941 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1943 loadmodel->brushq1.texinfo = out;
1944 loadmodel->brushq1.numtexinfo = count;
1946 for (i = 0;i < count;i++, in++, out++)
1948 for (k = 0;k < 2;k++)
1949 for (j = 0;j < 4;j++)
1950 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1952 miptex = LittleLong(in->miptex);
1953 out->flags = LittleLong(in->flags);
1955 out->texture = NULL;
1956 if (loadmodel->data_textures)
1958 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1959 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1961 out->texture = loadmodel->data_textures + miptex;
1963 if (out->flags & TEX_SPECIAL)
1965 // if texture chosen is NULL or the shader needs a lightmap,
1966 // force to notexture water shader
1967 if (out->texture == NULL || out->texture->basematerialflags & MATERIALFLAG_WALL)
1968 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1972 // if texture chosen is NULL, force to notexture
1973 if (out->texture == NULL)
1974 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1980 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
1985 mins[0] = mins[1] = mins[2] = 9999;
1986 maxs[0] = maxs[1] = maxs[2] = -9999;
1988 for (i = 0;i < numverts;i++)
1990 for (j = 0;j < 3;j++, v++)
2000 #define MAX_SUBDIVPOLYTRIANGLES 4096
2001 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2003 static int subdivpolyverts, subdivpolytriangles;
2004 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2005 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2007 static int subdivpolylookupvert(vec3_t v)
2010 for (i = 0;i < subdivpolyverts;i++)
2011 if (subdivpolyvert[i][0] == v[0]
2012 && subdivpolyvert[i][1] == v[1]
2013 && subdivpolyvert[i][2] == v[2])
2015 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2016 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2017 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2018 return subdivpolyverts++;
2021 static void SubdividePolygon(int numverts, float *verts)
2023 int i, i1, i2, i3, f, b, c, p;
2024 vec3_t mins, maxs, front[256], back[256];
2025 float m, *pv, *cv, dist[256], frac;
2028 Host_Error("SubdividePolygon: ran out of verts in buffer");
2030 BoundPoly(numverts, verts, mins, maxs);
2032 for (i = 0;i < 3;i++)
2034 m = (mins[i] + maxs[i]) * 0.5;
2035 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2036 if (maxs[i] - m < 8)
2038 if (m - mins[i] < 8)
2042 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2043 dist[c] = cv[i] - m;
2046 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2050 VectorCopy(pv, front[f]);
2055 VectorCopy(pv, back[b]);
2058 if (dist[p] == 0 || dist[c] == 0)
2060 if ((dist[p] > 0) != (dist[c] > 0) )
2063 frac = dist[p] / (dist[p] - dist[c]);
2064 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2065 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2066 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2072 SubdividePolygon(f, front[0]);
2073 SubdividePolygon(b, back[0]);
2077 i1 = subdivpolylookupvert(verts);
2078 i2 = subdivpolylookupvert(verts + 3);
2079 for (i = 2;i < numverts;i++)
2081 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2083 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2087 i3 = subdivpolylookupvert(verts + i * 3);
2088 subdivpolyindex[subdivpolytriangles][0] = i1;
2089 subdivpolyindex[subdivpolytriangles][1] = i2;
2090 subdivpolyindex[subdivpolytriangles][2] = i3;
2092 subdivpolytriangles++;
2096 //Breaks a polygon up along axial 64 unit
2097 //boundaries so that turbulent and sky warps
2098 //can be done reasonably.
2099 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2105 subdivpolytriangles = 0;
2106 subdivpolyverts = 0;
2107 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2108 if (subdivpolytriangles < 1)
2109 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2111 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2112 mesh->num_vertices = subdivpolyverts;
2113 mesh->num_triangles = subdivpolytriangles;
2114 mesh->vertex = (surfvertex_t *)(mesh + 1);
2115 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2116 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2118 for (i = 0;i < mesh->num_triangles;i++)
2119 for (j = 0;j < 3;j++)
2120 mesh->index[i*3+j] = subdivpolyindex[i][j];
2122 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2124 VectorCopy(subdivpolyvert[i], v->v);
2125 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2126 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2131 static qboolean Mod_Q1BSP_AllocLightmapBlock(int *lineused, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2134 int bestx = totalwidth, besty = 0;
2135 // find the left-most space we can find
2136 for (y = 0;y <= totalheight - blockheight;y++)
2139 for (y2 = 0;y2 < blockheight;y2++)
2140 x2 = max(x2, lineused[y+y2]);
2147 // if the best was not good enough, return failure
2148 if (bestx > totalwidth - blockwidth)
2150 // we found a good spot
2155 // now mark the space used
2156 for (y2 = 0;y2 < blockheight;y2++)
2157 lineused[besty+y2] = bestx + blockwidth;
2162 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2165 msurface_t *surface;
2166 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber;
2167 float texmins[2], texmaxs[2], val, lightmaptexcoordscale;
2168 #define LIGHTMAPSIZE 256
2169 rtexture_t *lightmaptexture, *deluxemaptexture;
2170 int lightmap_lineused[LIGHTMAPSIZE];
2172 in = (dface_t *)(mod_base + l->fileofs);
2173 if (l->filelen % sizeof(*in))
2174 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2175 count = l->filelen / sizeof(*in);
2176 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2177 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2179 loadmodel->num_surfaces = count;
2183 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2185 numedges = LittleShort(in->numedges);
2186 totalverts += numedges;
2187 totaltris += numedges - 2;
2190 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2192 lightmaptexture = NULL;
2193 deluxemaptexture = r_texture_blanknormalmap;
2195 lightmaptexcoordscale = 1.0f / (float)LIGHTMAPSIZE;
2199 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2201 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2203 // FIXME: validate edges, texinfo, etc?
2204 firstedge = LittleLong(in->firstedge);
2205 numedges = LittleShort(in->numedges);
2206 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)
2207 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2208 i = LittleShort(in->texinfo);
2209 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2210 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2211 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2212 surface->texture = surface->lightmapinfo->texinfo->texture;
2214 planenum = LittleShort(in->planenum);
2215 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2216 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2218 //surface->flags = surface->texture->flags;
2219 //if (LittleShort(in->side))
2220 // surface->flags |= SURF_PLANEBACK;
2221 //surface->plane = loadmodel->brush.data_planes + planenum;
2223 surface->num_firstvertex = totalverts;
2224 surface->num_vertices = numedges;
2225 surface->num_firsttriangle = totaltris;
2226 surface->num_triangles = numedges - 2;
2227 totalverts += numedges;
2228 totaltris += numedges - 2;
2230 // convert edges back to a normal polygon
2231 for (i = 0;i < surface->num_vertices;i++)
2233 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2236 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2238 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2239 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2240 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2241 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2242 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2243 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2244 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2245 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2248 for (i = 0;i < surface->num_triangles;i++)
2250 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2251 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2252 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2255 // compile additional data about the surface geometry
2256 Mod_BuildNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_normal3f, true);
2257 Mod_BuildTextureVectorsFromNormals(surface->num_firstvertex, surface->num_vertices, surface->num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_texcoordtexture2f, loadmodel->surfmesh.data_normal3f, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle), loadmodel->surfmesh.data_svector3f, loadmodel->surfmesh.data_tvector3f, true);
2258 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2260 // generate surface extents information
2261 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2262 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2263 for (i = 1;i < surface->num_vertices;i++)
2265 for (j = 0;j < 2;j++)
2267 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2268 texmins[j] = min(texmins[j], val);
2269 texmaxs[j] = max(texmaxs[j], val);
2272 for (i = 0;i < 2;i++)
2274 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2275 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2278 smax = surface->lightmapinfo->extents[0] >> 4;
2279 tmax = surface->lightmapinfo->extents[1] >> 4;
2280 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2281 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2284 for (i = 0;i < MAXLIGHTMAPS;i++)
2285 surface->lightmapinfo->styles[i] = in->styles[i];
2286 surface->lightmaptexture = NULL;
2287 surface->deluxemaptexture = r_texture_blanknormalmap;
2288 i = LittleLong(in->lightofs);
2291 surface->lightmapinfo->samples = NULL;
2292 // give non-lightmapped water a 1x white lightmap
2293 if ((surface->texture->basematerialflags & MATERIALFLAG_WATER) && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2295 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2296 surface->lightmapinfo->styles[0] = 0;
2297 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2300 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2301 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2302 else // LordHavoc: white lighting (bsp version 29)
2304 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2305 if (loadmodel->brushq1.nmaplightdata)
2306 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2309 // check if we should apply a lightmap to this
2310 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2312 int i, iu, iv, lightmapx, lightmapy;
2313 float u, v, ubase, vbase, uscale, vscale;
2315 if (ssize > 256 || tsize > 256)
2316 Host_Error("Bad surface extents");
2317 // force lightmap upload on first time seeing the surface
2318 surface->cached_dlight = true;
2319 // stainmap for permanent marks on walls
2320 surface->lightmapinfo->stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2322 memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
2324 // find a place for this lightmap
2325 if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(lightmap_lineused, LIGHTMAPSIZE, LIGHTMAPSIZE, ssize, tsize, &lightmapx, &lightmapy))
2327 // allocate a texture pool if we need it
2328 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
2329 loadmodel->texturepool = R_AllocTexturePool();
2330 // could not find room, make a new lightmap
2331 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), LIGHTMAPSIZE, LIGHTMAPSIZE, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2332 if (loadmodel->brushq1.nmaplightdata)
2333 deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), LIGHTMAPSIZE, LIGHTMAPSIZE, NULL, loadmodel->brushq1.lightmaprgba ? TEXTYPE_RGBA : TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2335 memset(lightmap_lineused, 0, sizeof(lightmap_lineused));
2336 Mod_Q1BSP_AllocLightmapBlock(lightmap_lineused, LIGHTMAPSIZE, LIGHTMAPSIZE, ssize, tsize, &lightmapx, &lightmapy);
2339 surface->lightmaptexture = lightmaptexture;
2340 surface->deluxemaptexture = deluxemaptexture;
2341 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2342 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2344 ubase = lightmapx * lightmaptexcoordscale;
2345 vbase = lightmapy * lightmaptexcoordscale;
2346 uscale = lightmaptexcoordscale;
2347 vscale = lightmaptexcoordscale;
2349 for (i = 0;i < surface->num_vertices;i++)
2351 u = ((DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3]) + 8 - surface->lightmapinfo->texturemins[0]) * (1.0 / 16.0);
2352 v = ((DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3]) + 8 - surface->lightmapinfo->texturemins[1]) * (1.0 / 16.0);
2353 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2354 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2355 // LordHavoc: calc lightmap data offset for vertex lighting to use
2358 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2364 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2367 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2368 node->parent = parent;
2371 // this is a node, recurse to children
2372 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2373 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2374 // combine supercontents of children
2375 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2380 mleaf_t *leaf = (mleaf_t *)node;
2381 // if this is a leaf, calculate supercontents mask from all collidable
2382 // primitives in the leaf (brushes and collision surfaces)
2383 // also flag if the leaf contains any collision surfaces
2384 leaf->combinedsupercontents = 0;
2385 // combine the supercontents values of all brushes in this leaf
2386 for (j = 0;j < leaf->numleafbrushes;j++)
2387 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2388 // check if this leaf contains any collision surfaces (q3 patches)
2389 for (j = 0;j < leaf->numleafsurfaces;j++)
2391 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2392 if (surface->num_collisiontriangles)
2394 leaf->containscollisionsurfaces = true;
2395 leaf->combinedsupercontents |= surface->texture->supercontents;
2401 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2407 in = (dnode_t *)(mod_base + l->fileofs);
2408 if (l->filelen % sizeof(*in))
2409 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2410 count = l->filelen / sizeof(*in);
2411 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2413 loadmodel->brush.data_nodes = out;
2414 loadmodel->brush.num_nodes = count;
2416 for ( i=0 ; i<count ; i++, in++, out++)
2418 for (j=0 ; j<3 ; j++)
2420 out->mins[j] = LittleShort(in->mins[j]);
2421 out->maxs[j] = LittleShort(in->maxs[j]);
2424 p = LittleLong(in->planenum);
2425 out->plane = loadmodel->brush.data_planes + p;
2427 out->firstsurface = LittleShort(in->firstface);
2428 out->numsurfaces = LittleShort(in->numfaces);
2430 for (j=0 ; j<2 ; j++)
2432 p = LittleShort(in->children[j]);
2434 out->children[j] = loadmodel->brush.data_nodes + p;
2436 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + (-1 - p));
2440 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2443 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2449 in = (dleaf_t *)(mod_base + l->fileofs);
2450 if (l->filelen % sizeof(*in))
2451 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2452 count = l->filelen / sizeof(*in);
2453 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2455 loadmodel->brush.data_leafs = out;
2456 loadmodel->brush.num_leafs = count;
2457 // get visleafs from the submodel data
2458 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2459 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2460 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2461 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2463 for ( i=0 ; i<count ; i++, in++, out++)
2465 for (j=0 ; j<3 ; j++)
2467 out->mins[j] = LittleShort(in->mins[j]);
2468 out->maxs[j] = LittleShort(in->maxs[j]);
2471 // FIXME: this function could really benefit from some error checking
2473 out->contents = LittleLong(in->contents);
2475 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + LittleShort(in->firstmarksurface);
2476 out->numleafsurfaces = LittleShort(in->nummarksurfaces);
2477 if (out->firstleafsurface < 0 || LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2479 Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", (int)(out->firstleafsurface - loadmodel->brush.data_leafsurfaces), (int)(out->firstleafsurface + out->numleafsurfaces - loadmodel->brush.data_leafsurfaces), 0, loadmodel->brush.num_leafsurfaces);
2480 out->firstleafsurface = NULL;
2481 out->numleafsurfaces = 0;
2484 out->clusterindex = i - 1;
2485 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2486 out->clusterindex = -1;
2488 p = LittleLong(in->visofs);
2489 // ignore visofs errors on leaf 0 (solid)
2490 if (p >= 0 && out->clusterindex >= 0)
2492 if (p >= loadmodel->brushq1.num_compressedpvs)
2493 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2495 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);
2498 for (j = 0;j < 4;j++)
2499 out->ambient_sound_level[j] = in->ambient_level[j];
2501 // FIXME: Insert caustics here
2505 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2509 const unsigned char *pvs;
2510 // check all liquid leafs to see if they can see into empty leafs, if any
2511 // can we can assume this map supports r_wateralpha
2512 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2514 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && (leaf->clusterindex >= 0 && loadmodel->brush.data_pvsclusters))
2516 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2517 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2518 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2525 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2527 dclipnode_t *in, *out;
2531 in = (dclipnode_t *)(mod_base + l->fileofs);
2532 if (l->filelen % sizeof(*in))
2533 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2534 count = l->filelen / sizeof(*in);
2535 out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2537 loadmodel->brushq1.clipnodes = out;
2538 loadmodel->brushq1.numclipnodes = count;
2540 for (i = 1; i < hullinfo->numhulls; i++)
2542 hull = &loadmodel->brushq1.hulls[i];
2543 hull->clipnodes = out;
2544 hull->firstclipnode = 0;
2545 hull->lastclipnode = count-1;
2546 hull->planes = loadmodel->brush.data_planes;
2547 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2548 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2549 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2550 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2551 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2552 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2553 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2556 for (i=0 ; i<count ; i++, out++, in++)
2558 out->planenum = LittleLong(in->planenum);
2559 out->children[0] = LittleShort(in->children[0]);
2560 out->children[1] = LittleShort(in->children[1]);
2561 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2562 Host_Error("Corrupt clipping hull(out of range planenum)");
2563 if (out->children[0] >= count || out->children[1] >= count)
2564 Host_Error("Corrupt clipping hull(out of range child)");
2568 //Duplicate the drawing hull structure as a clipping hull
2569 static void Mod_Q1BSP_MakeHull0(void)
2576 hull = &loadmodel->brushq1.hulls[0];
2578 in = loadmodel->brush.data_nodes;
2579 out = (dclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(dclipnode_t));
2581 hull->clipnodes = out;
2582 hull->firstclipnode = 0;
2583 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2584 hull->planes = loadmodel->brush.data_planes;
2586 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2588 out->planenum = in->plane - loadmodel->brush.data_planes;
2589 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2590 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2594 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2599 in = (short *)(mod_base + l->fileofs);
2600 if (l->filelen % sizeof(*in))
2601 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2602 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2603 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2605 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2607 j = (unsigned) LittleShort(in[i]);
2608 if (j >= loadmodel->num_surfaces)
2609 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2610 loadmodel->brush.data_leafsurfaces[i] = j;
2614 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2619 in = (int *)(mod_base + l->fileofs);
2620 if (l->filelen % sizeof(*in))
2621 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2622 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2623 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2625 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2626 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2630 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2636 in = (dplane_t *)(mod_base + l->fileofs);
2637 if (l->filelen % sizeof(*in))
2638 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2640 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2641 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2643 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2645 out->normal[0] = LittleFloat(in->normal[0]);
2646 out->normal[1] = LittleFloat(in->normal[1]);
2647 out->normal[2] = LittleFloat(in->normal[2]);
2648 out->dist = LittleFloat(in->dist);
2654 static void Mod_Q1BSP_LoadMapBrushes(void)
2658 int submodel, numbrushes;
2659 qboolean firstbrush;
2660 char *text, *maptext;
2661 char mapfilename[MAX_QPATH];
2662 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2663 strlcat (mapfilename, ".map", sizeof (mapfilename));
2664 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2668 if (!COM_ParseToken_Simple(&data, false))
2673 if (!COM_ParseToken_Simple(&data, false))
2675 if (com_token[0] != '{')
2681 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2684 if (!COM_ParseToken_Simple(&data, false))
2686 if (com_token[0] == '}')
2687 break; // end of entity
2688 if (com_token[0] == '{')
2695 if (submodel > loadmodel->brush.numsubmodels)
2697 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2701 model = loadmodel->brush.submodels[submodel];
2708 if (!COM_ParseToken_Simple(&data, false))
2710 if (com_token[0] == '}')
2711 break; // end of brush
2712 // each brush face should be this format:
2713 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2714 // FIXME: support hl .map format
2715 for (pointnum = 0;pointnum < 3;pointnum++)
2717 COM_ParseToken_Simple(&data, false);
2718 for (componentnum = 0;componentnum < 3;componentnum++)
2720 COM_ParseToken_Simple(&data, false);
2721 point[pointnum][componentnum] = atof(com_token);
2723 COM_ParseToken_Simple(&data, false);
2725 COM_ParseToken_Simple(&data, false);
2726 strlcpy(facetexture, com_token, sizeof(facetexture));
2727 COM_ParseToken_Simple(&data, false);
2728 //scroll_s = atof(com_token);
2729 COM_ParseToken_Simple(&data, false);
2730 //scroll_t = atof(com_token);
2731 COM_ParseToken_Simple(&data, false);
2732 //rotate = atof(com_token);
2733 COM_ParseToken_Simple(&data, false);
2734 //scale_s = atof(com_token);
2735 COM_ParseToken_Simple(&data, false);
2736 //scale_t = atof(com_token);
2737 TriangleNormal(point[0], point[1], point[2], planenormal);
2738 VectorNormalizeDouble(planenormal);
2739 planedist = DotProduct(point[0], planenormal);
2740 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2750 #define MAX_PORTALPOINTS 64
2752 typedef struct portal_s
2755 mnode_t *nodes[2]; // [0] = front side of plane
2756 struct portal_s *next[2];
2758 double points[3*MAX_PORTALPOINTS];
2759 struct portal_s *chain; // all portals are linked into a list
2763 static portal_t *portalchain;
2770 static portal_t *AllocPortal(void)
2773 p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2774 p->chain = portalchain;
2779 static void FreePortal(portal_t *p)
2784 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2786 // process only nodes (leafs already had their box calculated)
2790 // calculate children first
2791 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2792 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2794 // make combined bounding box from children
2795 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2796 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2797 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2798 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2799 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2800 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2803 static void Mod_Q1BSP_FinalizePortals(void)
2805 int i, j, numportals, numpoints;
2806 portal_t *p, *pnext;
2809 mleaf_t *leaf, *endleaf;
2811 // tally up portal and point counts and recalculate bounding boxes for all
2812 // leafs (because qbsp is very sloppy)
2813 leaf = loadmodel->brush.data_leafs;
2814 endleaf = leaf + loadmodel->brush.num_leafs;
2815 for (;leaf < endleaf;leaf++)
2817 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2818 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2825 // note: this check must match the one below or it will usually corrupt memory
2826 // 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
2827 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2830 numpoints += p->numpoints * 2;
2834 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2835 loadmodel->brush.num_portals = numportals;
2836 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2837 loadmodel->brush.num_portalpoints = numpoints;
2838 // clear all leaf portal chains
2839 for (i = 0;i < loadmodel->brush.num_leafs;i++)
2840 loadmodel->brush.data_leafs[i].portals = NULL;
2841 // process all portals in the global portal chain, while freeing them
2842 portal = loadmodel->brush.data_portals;
2843 point = loadmodel->brush.data_portalpoints;
2850 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2852 // note: this check must match the one above or it will usually corrupt memory
2853 // 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
2854 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2856 // first make the back to front portal(forward portal)
2857 portal->points = point;
2858 portal->numpoints = p->numpoints;
2859 portal->plane.dist = p->plane.dist;
2860 VectorCopy(p->plane.normal, portal->plane.normal);
2861 portal->here = (mleaf_t *)p->nodes[1];
2862 portal->past = (mleaf_t *)p->nodes[0];
2864 for (j = 0;j < portal->numpoints;j++)
2866 VectorCopy(p->points + j*3, point->position);
2869 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2870 PlaneClassify(&portal->plane);
2872 // link into leaf's portal chain
2873 portal->next = portal->here->portals;
2874 portal->here->portals = portal;
2876 // advance to next portal
2879 // then make the front to back portal(backward portal)
2880 portal->points = point;
2881 portal->numpoints = p->numpoints;
2882 portal->plane.dist = -p->plane.dist;
2883 VectorNegate(p->plane.normal, portal->plane.normal);
2884 portal->here = (mleaf_t *)p->nodes[0];
2885 portal->past = (mleaf_t *)p->nodes[1];
2887 for (j = portal->numpoints - 1;j >= 0;j--)
2889 VectorCopy(p->points + j*3, point->position);
2892 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2893 PlaneClassify(&portal->plane);
2895 // link into leaf's portal chain
2896 portal->next = portal->here->portals;
2897 portal->here->portals = portal;
2899 // advance to next portal
2902 // add the portal's polygon points to the leaf bounding boxes
2903 for (i = 0;i < 2;i++)
2905 leaf = (mleaf_t *)p->nodes[i];
2906 for (j = 0;j < p->numpoints;j++)
2908 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
2909 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
2910 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
2911 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
2912 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
2913 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
2920 // now recalculate the node bounding boxes from the leafs
2921 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
2929 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
2932 Host_Error("AddPortalToNodes: NULL front node");
2934 Host_Error("AddPortalToNodes: NULL back node");
2935 if (p->nodes[0] || p->nodes[1])
2936 Host_Error("AddPortalToNodes: already included");
2937 // 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
2939 p->nodes[0] = front;
2940 p->next[0] = (portal_t *)front->portals;
2941 front->portals = (mportal_t *)p;
2944 p->next[1] = (portal_t *)back->portals;
2945 back->portals = (mportal_t *)p;
2950 RemovePortalFromNode
2953 static void RemovePortalFromNodes(portal_t *portal)
2957 void **portalpointer;
2959 for (i = 0;i < 2;i++)
2961 node = portal->nodes[i];
2963 portalpointer = (void **) &node->portals;
2966 t = (portal_t *)*portalpointer;
2968 Host_Error("RemovePortalFromNodes: portal not in leaf");
2972 if (portal->nodes[0] == node)
2974 *portalpointer = portal->next[0];
2975 portal->nodes[0] = NULL;
2977 else if (portal->nodes[1] == node)
2979 *portalpointer = portal->next[1];
2980 portal->nodes[1] = NULL;
2983 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2987 if (t->nodes[0] == node)
2988 portalpointer = (void **) &t->next[0];
2989 else if (t->nodes[1] == node)
2990 portalpointer = (void **) &t->next[1];
2992 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
2997 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
2998 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3001 mnode_t *front, *back, *other_node;
3002 mplane_t clipplane, *plane;
3003 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3004 int numfrontpoints, numbackpoints;
3005 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3007 // if a leaf, we're done
3011 plane = node->plane;
3013 front = node->children[0];
3014 back = node->children[1];
3016 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3018 // create the new portal by generating a polygon for the node plane,
3019 // and clipping it by all of the other portals(which came from nodes above this one)
3020 nodeportal = AllocPortal();
3021 nodeportal->plane = *plane;
3023 // TODO: calculate node bounding boxes during recursion and calculate a maximum plane size accordingly to improve precision (as most maps do not need 1 billion unit plane polygons)
3024 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);
3025 nodeportal->numpoints = 4;
3026 side = 0; // shut up compiler warning
3027 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3029 clipplane = portal->plane;
3030 if (portal->nodes[0] == portal->nodes[1])
3031 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3032 if (portal->nodes[0] == node)
3034 else if (portal->nodes[1] == node)
3036 clipplane.dist = -clipplane.dist;
3037 VectorNegate(clipplane.normal, clipplane.normal);
3041 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3043 for (i = 0;i < nodeportal->numpoints*3;i++)
3044 frontpoints[i] = nodeportal->points[i];
3045 PolygonD_Divide(nodeportal->numpoints, frontpoints, clipplane.normal[0], clipplane.normal[1], clipplane.normal[2], clipplane.dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, nodeportal->points, &nodeportal->numpoints, 0, NULL, NULL, NULL);
3046 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3050 if (nodeportal->numpoints < 3)
3052 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3053 nodeportal->numpoints = 0;
3055 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3057 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3058 nodeportal->numpoints = 0;
3061 AddPortalToNodes(nodeportal, front, back);
3063 // split the portals of this node along this node's plane and assign them to the children of this node
3064 // (migrating the portals downward through the tree)
3065 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3067 if (portal->nodes[0] == portal->nodes[1])
3068 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3069 if (portal->nodes[0] == node)
3071 else if (portal->nodes[1] == node)
3074 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3075 nextportal = portal->next[side];
3076 if (!portal->numpoints)
3079 other_node = portal->nodes[!side];
3080 RemovePortalFromNodes(portal);
3082 // cut the portal into two portals, one on each side of the node plane
3083 PolygonD_Divide(portal->numpoints, portal->points, plane->normal[0], plane->normal[1], plane->normal[2], plane->dist, PORTAL_DIST_EPSILON, MAX_PORTALPOINTS, frontpoints, &numfrontpoints, MAX_PORTALPOINTS, backpoints, &numbackpoints, NULL);
3085 if (!numfrontpoints)
3088 AddPortalToNodes(portal, back, other_node);
3090 AddPortalToNodes(portal, other_node, back);
3096 AddPortalToNodes(portal, front, other_node);
3098 AddPortalToNodes(portal, other_node, front);
3102 // the portal is split
3103 splitportal = AllocPortal();
3104 temp = splitportal->chain;
3105 *splitportal = *portal;
3106 splitportal->chain = temp;
3107 for (i = 0;i < numbackpoints*3;i++)
3108 splitportal->points[i] = backpoints[i];
3109 splitportal->numpoints = numbackpoints;
3110 for (i = 0;i < numfrontpoints*3;i++)
3111 portal->points[i] = frontpoints[i];
3112 portal->numpoints = numfrontpoints;
3116 AddPortalToNodes(portal, front, other_node);
3117 AddPortalToNodes(splitportal, back, other_node);
3121 AddPortalToNodes(portal, other_node, front);
3122 AddPortalToNodes(splitportal, other_node, back);
3126 Mod_Q1BSP_RecursiveNodePortals(front);
3127 Mod_Q1BSP_RecursiveNodePortals(back);
3130 static void Mod_Q1BSP_MakePortals(void)
3133 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3134 Mod_Q1BSP_FinalizePortals();
3137 static void Mod_Q1BSP_BuildLightmapUpdateChains(mempool_t *mempool, model_t *model)
3139 int i, j, stylecounts[256], totalcount, remapstyles[256];
3140 msurface_t *surface;
3141 memset(stylecounts, 0, sizeof(stylecounts));
3142 for (i = 0;i < model->nummodelsurfaces;i++)
3144 surface = model->data_surfaces + model->firstmodelsurface + i;
3145 for (j = 0;j < MAXLIGHTMAPS;j++)
3146 stylecounts[surface->lightmapinfo->styles[j]]++;
3149 model->brushq1.light_styles = 0;
3150 for (i = 0;i < 255;i++)
3154 remapstyles[i] = model->brushq1.light_styles++;
3155 totalcount += stylecounts[i] + 1;
3160 model->brushq1.light_style = (unsigned char *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(unsigned char));
3161 model->brushq1.light_stylevalue = (int *)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(int));
3162 model->brushq1.light_styleupdatechains = (msurface_t ***)Mem_Alloc(mempool, model->brushq1.light_styles * sizeof(msurface_t **));
3163 model->brushq1.light_styleupdatechainsbuffer = (msurface_t **)Mem_Alloc(mempool, totalcount * sizeof(msurface_t *));
3164 model->brushq1.light_styles = 0;
3165 for (i = 0;i < 255;i++)
3167 model->brushq1.light_style[model->brushq1.light_styles++] = i;
3169 for (i = 0;i < model->brushq1.light_styles;i++)
3171 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
3172 j += stylecounts[model->brushq1.light_style[i]] + 1;
3174 for (i = 0;i < model->nummodelsurfaces;i++)
3176 surface = model->data_surfaces + model->firstmodelsurface + i;
3177 for (j = 0;j < MAXLIGHTMAPS;j++)
3178 if (surface->lightmapinfo->styles[j] != 255)
3179 *model->brushq1.light_styleupdatechains[remapstyles[surface->lightmapinfo->styles[j]]]++ = surface;
3182 for (i = 0;i < model->brushq1.light_styles;i++)
3184 *model->brushq1.light_styleupdatechains[i] = NULL;
3185 model->brushq1.light_styleupdatechains[i] = model->brushq1.light_styleupdatechainsbuffer + j;
3186 j += stylecounts[model->brushq1.light_style[i]] + 1;
3190 //Returns PVS data for a given point
3191 //(note: can return NULL)
3192 static unsigned char *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
3195 node = model->brush.data_nodes;
3197 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3198 if (((mleaf_t *)node)->clusterindex >= 0)
3199 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3204 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbytes, mnode_t *node)
3208 float d = PlaneDiff(org, node->plane);
3210 node = node->children[0];
3211 else if (d < -radius)
3212 node = node->children[1];
3215 // go down both sides
3216 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3217 node = node->children[1];
3220 // if this leaf is in a cluster, accumulate the pvs bits
3221 if (((mleaf_t *)node)->clusterindex >= 0)
3224 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3225 for (i = 0;i < pvsbytes;i++)
3226 pvsbuffer[i] |= pvs[i];
3230 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3231 //of the given point.
3232 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength)
3234 int bytes = model->brush.num_pvsclusterbytes;
3235 bytes = min(bytes, pvsbufferlength);
3236 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3238 memset(pvsbuffer, 0xFF, bytes);
3241 memset(pvsbuffer, 0, bytes);
3242 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3246 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3251 VectorSubtract(inmaxs, inmins, size);
3252 if (cmodel->brush.ismcbsp)
3255 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3256 else if (size[2] < 48) // pick the nearest of 40 or 56
3257 hull = &cmodel->brushq1.hulls[2]; // 16x16x40
3259 hull = &cmodel->brushq1.hulls[1]; // 16x16x56
3261 else if (cmodel->brush.ishlbsp)
3264 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3265 else if (size[0] <= 32)
3267 if (size[2] < 54) // pick the nearest of 36 or 72
3268 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3270 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3273 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3278 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3279 else if (size[0] <= 32)
3280 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3282 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3284 VectorCopy(inmins, outmins);
3285 VectorAdd(inmins, hull->clip_size, outmaxs);
3288 void Mod_Q1BSP_Load(model_t *mod, void *buffer, void *bufferend)
3293 mempool_t *mainmempool;
3294 float dist, modelyawradius, modelradius, *vec;
3295 msurface_t *surface;
3296 int numshadowmeshtriangles;
3298 hullinfo_t hullinfo;
3300 mod->type = mod_brushq1;
3302 if (!memcmp (buffer, "MCBSPpad", 8))
3304 unsigned char *index;
3306 mod->brush.ismcbsp = true;
3307 mod->brush.ishlbsp = false;
3309 mod_base = (unsigned char*)buffer;
3313 i = SB_ReadInt (&index);
3314 if (i != MCBSPVERSION)
3315 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i)", mod->name, i, MCBSPVERSION);
3318 hullinfo.numhulls = LittleLong(*(int*)index); index += 4;
3319 hullinfo.filehulls = hullinfo.numhulls;
3320 VectorClear (hullinfo.hullsizes[0][0]);
3321 VectorClear (hullinfo.hullsizes[0][1]);
3322 for (i = 1; i < hullinfo.numhulls; i++)
3324 hullinfo.hullsizes[i][0][0] = SB_ReadFloat (&index);
3325 hullinfo.hullsizes[i][0][1] = SB_ReadFloat (&index);
3326 hullinfo.hullsizes[i][0][2] = SB_ReadFloat (&index);
3327 hullinfo.hullsizes[i][1][0] = SB_ReadFloat (&index);
3328 hullinfo.hullsizes[i][1][1] = SB_ReadFloat (&index);
3329 hullinfo.hullsizes[i][1][2] = SB_ReadFloat (&index);
3333 _header.version = 0;
3334 for (i = 0; i < HEADER_LUMPS; i++)
3336 _header.lumps[i].fileofs = SB_ReadInt (&index);
3337 _header.lumps[i].filelen = SB_ReadInt (&index);
3344 header = (dheader_t *)buffer;
3346 i = LittleLong(header->version);
3347 if (i != BSPVERSION && i != 30)
3348 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3349 mod->brush.ishlbsp = i == 30;
3350 mod->brush.ismcbsp = false;
3352 // fill in hull info
3353 VectorClear (hullinfo.hullsizes[0][0]);
3354 VectorClear (hullinfo.hullsizes[0][1]);
3355 if (mod->brush.ishlbsp)
3357 hullinfo.numhulls = 4;
3358 hullinfo.filehulls = 4;
3359 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3360 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3361 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3362 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3363 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3364 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3368 hullinfo.numhulls = 3;
3369 hullinfo.filehulls = 4;
3370 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3371 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3372 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3373 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3377 mod_base = (unsigned char*)buffer;
3378 for (i = 0; i < HEADER_LUMPS; i++)
3380 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3381 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3385 mod->soundfromcenter = true;
3386 mod->TraceBox = Mod_Q1BSP_TraceBox;
3387 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3388 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3389 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3390 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3391 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3392 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3393 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3394 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3395 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3396 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3397 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3398 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3399 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3400 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3402 if (loadmodel->isworldmodel)
3404 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3405 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3410 // store which lightmap format to use
3411 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
3413 mod->brush.qw_md4sum = 0;
3414 mod->brush.qw_md4sum2 = 0;
3415 for (i = 0;i < HEADER_LUMPS;i++)
3417 if (i == LUMP_ENTITIES)
3419 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3420 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3422 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3425 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3426 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3427 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3428 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3429 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3430 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3431 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3432 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3433 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3434 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3435 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3436 // load submodels before leafs because they contain the number of vis leafs
3437 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3438 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3439 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3440 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3442 // check if the map supports transparent water rendering
3443 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3445 if (mod->brushq1.data_compressedpvs)
3446 Mem_Free(mod->brushq1.data_compressedpvs);
3447 mod->brushq1.data_compressedpvs = NULL;
3448 mod->brushq1.num_compressedpvs = 0;
3450 Mod_Q1BSP_MakeHull0();
3451 Mod_Q1BSP_MakePortals();
3453 mod->numframes = 2; // regular and alternate animation
3456 mainmempool = mod->mempool;
3458 // make a single combined shadow mesh to allow optimized shadow volume creation
3459 numshadowmeshtriangles = 0;
3460 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3462 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3463 numshadowmeshtriangles += surface->num_triangles;
3465 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3466 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3467 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, loadmodel->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
3468 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3469 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3471 if (loadmodel->brush.numsubmodels)
3472 loadmodel->brush.submodels = (model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(model_t *));
3474 if (loadmodel->isworldmodel)
3476 // clear out any stale submodels or worldmodels lying around
3477 // if we did this clear before now, an error might abort loading and
3478 // leave things in a bad state
3479 Mod_RemoveStaleWorldModels(loadmodel);
3482 // LordHavoc: to clear the fog around the original quake submodel code, I
3484 // first of all, some background info on the submodels:
3485 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3486 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3487 // now the weird for loop itself:
3488 // the loop functions in an odd way, on each iteration it sets up the
3489 // current 'mod' model (which despite the confusing code IS the model of
3490 // the number i), at the end of the loop it duplicates the model to become
3491 // the next submodel, and loops back to set up the new submodel.
3493 // LordHavoc: now the explanation of my sane way (which works identically):
3494 // set up the world model, then on each submodel copy from the world model
3495 // and set up the submodel with the respective model info.
3496 for (i = 0;i < mod->brush.numsubmodels;i++)
3498 // LordHavoc: this code was originally at the end of this loop, but
3499 // has been transformed to something more readable at the start here.
3504 // LordHavoc: only register submodels if it is the world
3505 // (prevents external bsp models from replacing world submodels with
3507 if (!loadmodel->isworldmodel)
3509 // duplicate the basic information
3510 sprintf(name, "*%i", i);
3511 mod = Mod_FindName(name);
3512 // copy the base model to this one
3514 // rename the clone back to its proper name
3515 strlcpy(mod->name, name, sizeof(mod->name));
3516 // textures and memory belong to the main model
3517 mod->texturepool = NULL;
3518 mod->mempool = NULL;
3521 mod->brush.submodel = i;
3523 if (loadmodel->brush.submodels)
3524 loadmodel->brush.submodels[i] = mod;
3526 bm = &mod->brushq1.submodels[i];
3528 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3529 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3531 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3532 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3535 mod->firstmodelsurface = bm->firstface;
3536 mod->nummodelsurfaces = bm->numfaces;
3538 // make the model surface list (used by shadowing/lighting)
3539 mod->surfacelist = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
3540 for (j = 0;j < mod->nummodelsurfaces;j++)
3541 mod->surfacelist[j] = mod->firstmodelsurface + j;
3543 // this gets altered below if sky is used
3544 mod->DrawSky = NULL;
3545 mod->Draw = R_Q1BSP_Draw;
3546 mod->DrawDepth = R_Q1BSP_DrawDepth;
3547 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3548 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3549 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3550 mod->DrawLight = R_Q1BSP_DrawLight;
3553 mod->brush.TraceLineOfSight = NULL;
3554 mod->brush.GetPVS = NULL;
3555 mod->brush.FatPVS = NULL;
3556 mod->brush.BoxTouchingPVS = NULL;
3557 mod->brush.BoxTouchingLeafPVS = NULL;
3558 mod->brush.BoxTouchingVisibleLeafs = NULL;
3559 mod->brush.FindBoxClusters = NULL;
3560 mod->brush.LightPoint = NULL;
3561 mod->brush.AmbientSoundLevelsForPoint = NULL;
3563 Mod_Q1BSP_BuildLightmapUpdateChains(loadmodel->mempool, mod);
3564 if (mod->nummodelsurfaces)
3566 // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3567 mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3568 mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3571 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3573 // we only need to have a drawsky function if it is used(usually only on world model)
3574 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3575 mod->DrawSky = R_Q1BSP_DrawSky;
3576 // calculate bounding shapes
3577 for (k = 0, vec = (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex);k < surface->num_vertices;k++, vec += 3)
3579 if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3580 if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3581 if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3582 if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3583 if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3584 if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3585 dist = vec[0]*vec[0]+vec[1]*vec[1];
3586 if (modelyawradius < dist)
3587 modelyawradius = dist;
3588 dist += vec[2]*vec[2];
3589 if (modelradius < dist)
3593 modelyawradius = sqrt(modelyawradius);
3594 modelradius = sqrt(modelradius);
3595 mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3596 mod->yawmins[2] = mod->normalmins[2];
3597 mod->yawmaxs[2] = mod->normalmaxs[2];
3598 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3599 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3600 mod->radius = modelradius;
3601 mod->radius2 = modelradius * modelradius;
3605 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3606 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3608 //mod->brushq1.num_visleafs = bm->visleafs;
3611 Mod_Q1BSP_LoadMapBrushes();
3613 //Mod_Q1BSP_ProcessLightList();
3615 if (developer.integer >= 10)
3616 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);
3619 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3623 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3630 in = (void *)(mod_base + l->fileofs);
3631 if (l->filelen % sizeof(*in))
3632 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3633 count = l->filelen / sizeof(*in);
3634 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3637 loadmodel->num = count;
3639 for (i = 0;i < count;i++, in++, out++)
3645 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3652 in = (void *)(mod_base + l->fileofs);
3653 if (l->filelen % sizeof(*in))
3654 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3655 count = l->filelen / sizeof(*in);
3656 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3659 loadmodel->num = count;
3661 for (i = 0;i < count;i++, in++, out++)
3667 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3674 in = (void *)(mod_base + l->fileofs);
3675 if (l->filelen % sizeof(*in))
3676 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3677 count = l->filelen / sizeof(*in);
3678 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3681 loadmodel->num = count;
3683 for (i = 0;i < count;i++, in++, out++)
3689 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3696 in = (void *)(mod_base + l->fileofs);
3697 if (l->filelen % sizeof(*in))
3698 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3699 count = l->filelen / sizeof(*in);
3700 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3703 loadmodel->num = count;
3705 for (i = 0;i < count;i++, in++, out++)
3711 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3718 in = (void *)(mod_base + l->fileofs);
3719 if (l->filelen % sizeof(*in))
3720 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3721 count = l->filelen / sizeof(*in);
3722 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3725 loadmodel->num = count;
3727 for (i = 0;i < count;i++, in++, out++)
3733 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3740 in = (void *)(mod_base + l->fileofs);
3741 if (l->filelen % sizeof(*in))
3742 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3743 count = l->filelen / sizeof(*in);
3744 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3747 loadmodel->num = count;
3749 for (i = 0;i < count;i++, in++, out++)
3755 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3762 in = (void *)(mod_base + l->fileofs);
3763 if (l->filelen % sizeof(*in))
3764 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3765 count = l->filelen / sizeof(*in);
3766 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3769 loadmodel->num = count;
3771 for (i = 0;i < count;i++, in++, out++)
3777 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3784 in = (void *)(mod_base + l->fileofs);
3785 if (l->filelen % sizeof(*in))
3786 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3787 count = l->filelen / sizeof(*in);
3788 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3791 loadmodel->num = count;
3793 for (i = 0;i < count;i++, in++, out++)
3799 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3806 in = (void *)(mod_base + l->fileofs);
3807 if (l->filelen % sizeof(*in))
3808 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3809 count = l->filelen / sizeof(*in);
3810 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3813 loadmodel->num = count;
3815 for (i = 0;i < count;i++, in++, out++)
3821 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3828 in = (void *)(mod_base + l->fileofs);
3829 if (l->filelen % sizeof(*in))
3830 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3831 count = l->filelen / sizeof(*in);
3832 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3835 loadmodel->num = count;
3837 for (i = 0;i < count;i++, in++, out++)
3843 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3850 in = (void *)(mod_base + l->fileofs);
3851 if (l->filelen % sizeof(*in))
3852 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3853 count = l->filelen / sizeof(*in);
3854 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3857 loadmodel->num = count;
3859 for (i = 0;i < count;i++, in++, out++)
3865 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3872 in = (void *)(mod_base + l->fileofs);
3873 if (l->filelen % sizeof(*in))
3874 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3875 count = l->filelen / sizeof(*in);
3876 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3879 loadmodel->num = count;
3881 for (i = 0;i < count;i++, in++, out++)
3887 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3894 in = (void *)(mod_base + l->fileofs);
3895 if (l->filelen % sizeof(*in))
3896 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3897 count = l->filelen / sizeof(*in);
3898 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3901 loadmodel->num = count;
3903 for (i = 0;i < count;i++, in++, out++)
3909 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
3916 in = (void *)(mod_base + l->fileofs);
3917 if (l->filelen % sizeof(*in))
3918 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
3919 count = l->filelen / sizeof(*in);
3920 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3923 loadmodel->num = count;
3925 for (i = 0;i < count;i++, in++, out++)
3931 static void Mod_Q2BSP_LoadAreas(lump_t *l)
3938 in = (void *)(mod_base + l->fileofs);
3939 if (l->filelen % sizeof(*in))
3940 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
3941 count = l->filelen / sizeof(*in);
3942 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3945 loadmodel->num = count;
3947 for (i = 0;i < count;i++, in++, out++)
3953 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
3960 in = (void *)(mod_base + l->fileofs);
3961 if (l->filelen % sizeof(*in))
3962 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
3963 count = l->filelen / sizeof(*in);
3964 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3967 loadmodel->num = count;
3969 for (i = 0;i < count;i++, in++, out++)
3975 static void Mod_Q2BSP_LoadModels(lump_t *l)
3982 in = (void *)(mod_base + l->fileofs);
3983 if (l->filelen % sizeof(*in))
3984 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
3985 count = l->filelen / sizeof(*in);
3986 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3989 loadmodel->num = count;
3991 for (i = 0;i < count;i++, in++, out++)
3997 void static Mod_Q2BSP_Load(model_t *mod, void *buffer, void *bufferend)
4000 q2dheader_t *header;
4002 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4004 mod->type = mod_brushq2;
4006 header = (q2dheader_t *)buffer;
4008 i = LittleLong(header->version);
4009 if (i != Q2BSPVERSION)
4010 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4011 mod->brush.ishlbsp = false;
4012 mod->brush.ismcbsp = false;
4013 if (loadmodel->isworldmodel)
4015 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
4016 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
4019 mod_base = (unsigned char *)header;
4021 // swap all the lumps
4022 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4023 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4025 // store which lightmap format to use
4026 mod->brushq1.lightmaprgba = r_lightmaprgba.integer;
4028 mod->brush.qw_md4sum = 0;
4029 mod->brush.qw_md4sum2 = 0;
4030 for (i = 0;i < Q2HEADER_LUMPS;i++)
4032 if (i == Q2LUMP_ENTITIES)
4034 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4035 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4037 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4040 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4041 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4042 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4043 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4044 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4045 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4046 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4047 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4048 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4049 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4050 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4051 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4052 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4053 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4054 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4055 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4056 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4057 // LordHavoc: must go last because this makes the submodels
4058 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4061 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents);
4062 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents);
4064 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4067 char key[128], value[MAX_INPUTLINE];
4069 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4070 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4071 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4074 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
4075 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4076 data = loadmodel->brush.entities;
4077 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4078 if (data && COM_ParseToken_Simple(&data, false) && com_token[0] == '{')
4082 if (!COM_ParseToken_Simple(&data, false))
4084 if (com_token[0] == '}')
4085 break; // end of worldspawn
4086 if (com_token[0] == '_')
4087 strlcpy(key, com_token + 1, sizeof(key));
4089 strlcpy(key, com_token, sizeof(key));
4090 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4091 key[strlen(key)-1] = 0;
4092 if (!COM_ParseToken_Simple(&data, false))
4094 strlcpy(value, com_token, sizeof(value));
4095 if (!strcmp("gridsize", key))
4097 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4098 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4104 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4110 in = (q3dtexture_t *)(mod_base + l->fileofs);
4111 if (l->filelen % sizeof(*in))
4112 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4113 count = l->filelen / sizeof(*in);
4114 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4116 loadmodel->data_textures = out;
4117 loadmodel->num_textures = count;
4118 loadmodel->num_texturesperskin = loadmodel->num_textures;
4120 for (i = 0;i < count;i++)
4122 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4123 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4124 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4127 if (cls.state == ca_dedicated)
4131 for (i = 0;i < count;i++, in++, out++)
4132 if (Mod_LoadTextureFromQ3Shader(out, out->name, false, true, false))
4135 Con_DPrintf("%s: %i textures missing shaders\n", loadmodel->name, c);
4138 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4144 in = (q3dplane_t *)(mod_base + l->fileofs);
4145 if (l->filelen % sizeof(*in))
4146 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4147 count = l->filelen / sizeof(*in);
4148 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4150 loadmodel->brush.data_planes = out;
4151 loadmodel->brush.num_planes = count;
4153 for (i = 0;i < count;i++, in++, out++)
4155 out->normal[0] = LittleFloat(in->normal[0]);
4156 out->normal[1] = LittleFloat(in->normal[1]);
4157 out->normal[2] = LittleFloat(in->normal[2]);
4158 out->dist = LittleFloat(in->dist);
4163 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4166 q3mbrushside_t *out;
4169 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4170 if (l->filelen % sizeof(*in))
4171 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4172 count = l->filelen / sizeof(*in);
4173 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4175 loadmodel->brush.data_brushsides = out;
4176 loadmodel->brush.num_brushsides = count;
4178 for (i = 0;i < count;i++, in++, out++)
4180 n = LittleLong(in->planeindex);
4181 if (n < 0 || n >= loadmodel->brush.num_planes)
4182 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4183 out->plane = loadmodel->brush.data_planes + n;
4184 n = LittleLong(in->textureindex);
4185 if (n < 0 || n >= loadmodel->num_textures)
4186 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4187 out->texture = loadmodel->data_textures + n;
4191 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4195 int i, j, n, c, count, maxplanes;
4196 colplanef_t *planes;
4198 in = (q3dbrush_t *)(mod_base + l->fileofs);
4199 if (l->filelen % sizeof(*in))
4200 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4201 count = l->filelen / sizeof(*in);
4202 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4204 loadmodel->brush.data_brushes = out;
4205 loadmodel->brush.num_brushes = count;
4210 for (i = 0;i < count;i++, in++, out++)
4212 n = LittleLong(in->firstbrushside);
4213 c = LittleLong(in->numbrushsides);
4214 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4215 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4216 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4217 out->numbrushsides = c;
4218 n = LittleLong(in->textureindex);
4219 if (n < 0 || n >= loadmodel->num_textures)
4220 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4221 out->texture = loadmodel->data_textures + n;
4223 // make a list of mplane_t structs to construct a colbrush from
4224 if (maxplanes < out->numbrushsides)
4226 maxplanes = out->numbrushsides;
4229 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4231 for (j = 0;j < out->numbrushsides;j++)
4233 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4234 planes[j].dist = out->firstbrushside[j].plane->dist;
4235 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4236 planes[j].texture = out->firstbrushside[j].texture;
4238 // make the colbrush from the planes
4239 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4245 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4251 in = (q3deffect_t *)(mod_base + l->fileofs);
4252 if (l->filelen % sizeof(*in))
4253 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4254 count = l->filelen / sizeof(*in);
4255 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4257 loadmodel->brushq3.data_effects = out;
4258 loadmodel->brushq3.num_effects = count;
4260 for (i = 0;i < count;i++, in++, out++)
4262 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4263 n = LittleLong(in->brushindex);
4264 if (n >= loadmodel->brush.num_brushes)
4266 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4269 out->brushindex = n;
4270 out->unknown = LittleLong(in->unknown);
4274 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4279 in = (q3dvertex_t *)(mod_base + l->fileofs);
4280 if (l->filelen % sizeof(*in))
4281 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4282 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4283 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4284 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4285 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4286 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4287 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4289 for (i = 0;i < count;i++, in++)
4291 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4292 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4293 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4294 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4295 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4296 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4297 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4298 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4299 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4300 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4301 // svector/tvector are calculated later in face loading
4302 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4303 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4304 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4305 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4309 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4315 in = (int *)(mod_base + l->fileofs);
4316 if (l->filelen % sizeof(int[3]))
4317 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4318 count = l->filelen / sizeof(*in);
4319 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4321 loadmodel->brushq3.num_triangles = count / 3;
4322 loadmodel->brushq3.data_element3i = out;
4324 for (i = 0;i < count;i++, in++, out++)
4326 *out = LittleLong(*in);
4327 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4329 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4335 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4338 int i, j, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4343 if (cls.state == ca_dedicated)
4345 in = (q3dlightmap_t *)(mod_base + l->fileofs);
4346 if (l->filelen % sizeof(*in))
4347 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4348 count = l->filelen / sizeof(*in);
4349 loadmodel->brushq3.num_originallightmaps = count;
4351 // now check the surfaces to see if any of them index an odd numbered
4352 // lightmap, if so this is not a deluxemapped bsp file
4354 // also check what lightmaps are actually used, because q3map2 sometimes
4355 // (always?) makes an unused one at the end, which
4356 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4357 // reason when only one lightmap is used, which can throw off the
4358 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4359 // to see if the second lightmap is blank, if so it is not deluxemapped.
4360 loadmodel->brushq3.deluxemapping = !(count & 1);
4361 loadmodel->brushq3.deluxemapping_modelspace = true;
4363 if (loadmodel->brushq3.deluxemapping)
4365 int facecount = faceslump->filelen / sizeof(q3dface_t);
4366 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4367 for (i = 0;i < facecount;i++)
4369 j = LittleLong(faces[i].lightmapindex);
4372 endlightmap = max(endlightmap, j + 1);
4373 if ((j & 1) || j + 1 >= count)
4375 loadmodel->brushq3.deluxemapping = false;
4381 if (endlightmap < 2)
4382 loadmodel->brushq3.deluxemapping = false;
4384 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4385 // reason when only one lightmap is used, which can throw off the
4386 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4387 // to see if the second lightmap is blank, if so it is not deluxemapped.
4388 if (endlightmap == 1 && count == 2)
4391 for (i = 0;i < 128*128*3;i++)
4396 // all pixels in the unused lightmap were black...
4397 loadmodel->brushq3.deluxemapping = false;
4401 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4403 // figure out what the most reasonable merge power is within limits
4404 loadmodel->brushq3.num_lightmapmergepower = 0;
4405 for (power = 1;power <= mod_q3bsp_lightmapmergepower.integer && (128 << power) <= gl_max_texture_size && (1 << (power * 2)) < 4 * (count >> loadmodel->brushq3.deluxemapping);power++)
4406 loadmodel->brushq3.num_lightmapmergepower = power;
4407 loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4409 loadmodel->brushq3.num_mergedlightmaps = ((count >> loadmodel->brushq3.deluxemapping) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4410 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4411 if (loadmodel->brushq3.deluxemapping)
4412 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4414 // allocate a texture pool if we need it
4415 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4416 loadmodel->texturepool = R_AllocTexturePool();
4418 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4420 power = loadmodel->brushq3.num_lightmapmergepower;
4422 mask = (1 << power) - 1;
4423 for (i = 0;i < count;i++)
4425 // figure out which merged lightmap texture this fits into
4426 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4427 // if the lightmap has not been allocated yet, create it
4428 if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4430 // create a lightmap only as large as necessary to hold the
4431 // remaining 128x128 blocks
4432 // if there are multiple merged lightmap textures then they will
4433 // all be full size except the last one which may be smaller
4434 // because it only needs to the remaining blocks, and it will often
4435 // be odd sizes like 2048x512 due to only being 25% full or so.
4436 j = (count >> loadmodel->brushq3.deluxemapping) - (lightmapindex << power2);
4437 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4439 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4441 Con_DPrintf("lightmap merge texture #%i is %ix%i (%i of %i used)\n", lightmapindex, mergewidth*128, mergeheight*128, min(j, mergewidth*mergeheight), mergewidth*mergeheight);
4442 loadmodel->brushq3.data_lightmaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), mergewidth * 128, mergeheight * 128, NULL, TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
4443 if (loadmodel->brushq3.data_deluxemaps)
4444 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), mergewidth * 128, mergeheight * 128, NULL, TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
4446 mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / 128;
4447 mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / 128;
4448 j = (i >> loadmodel->brushq3.deluxemapping) & ((1 << power2) - 1);
4449 if (loadmodel->brushq3.deluxemapping && (i & 1))
4450 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], in[i].rgb, (j % mergewidth) * 128, (j / mergewidth) * 128, 128, 128);
4452 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], in[i].rgb, (j % mergewidth) * 128, (j / mergewidth) * 128, 128, 128);
4457 for (i = 0;i < count;i++)
4459 // figure out which merged lightmap texture this fits into
4460 int lightmapindex = i >> loadmodel->brushq3.deluxemapping;
4461 if (loadmodel->brushq3.deluxemapping && (i & 1))
4462 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), 128, 128, in[i].rgb, TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
4464 loadmodel->brushq3.data_lightmaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), 128, 128, in[i].rgb, TEXTYPE_RGB, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
4469 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4471 q3dface_t *in, *oldin;
4472 msurface_t *out, *oldout;
4473 int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, numvertices, numtriangles;
4474 float lightmaptcbase[2], lightmaptcscale[2];
4475 //int *originalelement3i;
4476 //int *originalneighbor3i;
4477 float *originalvertex3f;
4478 //float *originalsvector3f;
4479 //float *originaltvector3f;
4480 float *originalnormal3f;
4481 float *originalcolor4f;
4482 float *originaltexcoordtexture2f;
4483 float *originaltexcoordlightmap2f;
4486 in = (q3dface_t *)(mod_base + l->fileofs);
4487 if (l->filelen % sizeof(*in))
4488 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4489 count = l->filelen / sizeof(*in);
4490 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4492 loadmodel->data_surfaces = out;
4493 loadmodel->num_surfaces = count;
4501 for (;i < count;i++, in++, out++)
4503 // check face type first
4504 type = LittleLong(in->type);
4505 if (type != Q3FACETYPE_POLYGON
4506 && type != Q3FACETYPE_PATCH
4507 && type != Q3FACETYPE_MESH
4508 && type != Q3FACETYPE_FLARE)
4510 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4514 n = LittleLong(in->textureindex);
4515 if (n < 0 || n >= loadmodel->num_textures)
4517 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4520 out->texture = loadmodel->data_textures + n;
4521 n = LittleLong(in->effectindex);
4522 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4524 if (developer.integer >= 100)
4525 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4531 out->effect = loadmodel->brushq3.data_effects + n;
4533 if (cls.state != ca_dedicated)
4535 out->lightmaptexture = NULL;
4536 out->deluxemaptexture = r_texture_blanknormalmap;
4537 n = LittleLong(in->lightmapindex);
4540 else if (n >= loadmodel->brushq3.num_originallightmaps)
4542 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4547 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4548 if (loadmodel->brushq3.deluxemapping)
4549 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4553 firstvertex = LittleLong(in->firstvertex);
4554 numvertices = LittleLong(in->numvertices);
4555 firstelement = LittleLong(in->firstelement);
4556 numtriangles = LittleLong(in->numelements) / 3;
4557 if (numtriangles * 3 != LittleLong(in->numelements))
4559 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));
4562 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4564 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);
4567 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4569 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);
4574 case Q3FACETYPE_POLYGON:
4575 case Q3FACETYPE_MESH:
4576 // no processing necessary
4578 case Q3FACETYPE_PATCH:
4579 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4580 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4581 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))
4583 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4586 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4587 // convert patch to Q3FACETYPE_MESH
4588 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4589 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4590 // bound to user settings
4591 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4592 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4593 // bound to sanity settings
4594 xtess = bound(1, xtess, 1024);
4595 ytess = bound(1, ytess, 1024);
4596 // bound to user limit on vertices
4597 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4604 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4605 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4606 numvertices = finalwidth * finalheight;
4607 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4609 case Q3FACETYPE_FLARE:
4610 if (developer.integer >= 100)
4611 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4615 out->num_vertices = numvertices;
4616 out->num_triangles = numtriangles;
4617 meshvertices += out->num_vertices;
4618 meshtriangles += out->num_triangles;
4624 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4627 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
4629 if (out->num_vertices < 3 || out->num_triangles < 1)
4632 type = LittleLong(in->type);
4633 firstvertex = LittleLong(in->firstvertex);
4634 firstelement = LittleLong(in->firstelement);
4635 out->num_firstvertex = meshvertices;
4636 out->num_firsttriangle = meshtriangles;
4639 case Q3FACETYPE_POLYGON:
4640 case Q3FACETYPE_MESH:
4641 // no processing necessary, except for lightmap merging
4642 for (j = 0;j < out->num_vertices;j++)
4644 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4645 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4646 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4647 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
4648 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
4649 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
4650 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4651 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4652 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4653 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4654 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4655 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4656 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4657 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4659 for (j = 0;j < out->num_triangles*3;j++)
4660 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
4662 case Q3FACETYPE_PATCH:
4663 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4664 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4665 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4666 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
4667 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4668 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4669 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4670 // convert patch to Q3FACETYPE_MESH
4671 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4672 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4673 // bound to user settings
4674 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4675 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4676 // bound to sanity settings
4677 xtess = bound(1, xtess, 1024);
4678 ytess = bound(1, ytess, 1024);
4679 // bound to user limit on vertices
4680 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4687 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4688 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4689 finalvertices = finalwidth * finalheight;
4690 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4691 type = Q3FACETYPE_MESH;
4692 // generate geometry
4693 // (note: normals are skipped because they get recalculated)
4694 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4695 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
4696 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
4697 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
4698 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
4699 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
4700 out->num_triangles = Mod_RemoveDegenerateTriangles(out->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), loadmodel->surfmesh.data_vertex3f);
4701 if (developer.integer >= 100)
4703 if (out->num_triangles < finaltriangles)
4704 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);
4706 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);
4708 // q3map does not put in collision brushes for curves... ugh
4709 // build the lower quality collision geometry
4710 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4711 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4712 // bound to user settings
4713 xtess = bound(r_subdivisions_collision_mintess.integer, xtess, r_subdivisions_collision_maxtess.integer);
4714 ytess = bound(r_subdivisions_collision_mintess.integer, ytess, r_subdivisions_collision_maxtess.integer);
4715 // bound to sanity settings
4716 xtess = bound(1, xtess, 1024);
4717 ytess = bound(1, ytess, 1024);
4718 // bound to user limit on vertices
4719 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4726 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4727 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4728 finalvertices = finalwidth * finalheight;
4729 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4731 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4732 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4733 out->num_collisionvertices = finalvertices;
4734 out->num_collisiontriangles = finaltriangles;
4735 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4736 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
4738 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
4739 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
4741 oldnumtriangles = out->num_triangles;
4742 oldnumtriangles2 = out->num_collisiontriangles;
4743 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
4744 if (developer.integer >= 100)
4745 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);
4750 meshvertices += out->num_vertices;
4751 meshtriangles += out->num_triangles;
4752 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
4753 if ((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
4755 if (invalidelements)
4757 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);
4758 for (j = 0;j < out->num_triangles * 3;j++)
4760 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
4761 if ((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] < out->num_firstvertex || (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] >= out->num_firstvertex + out->num_vertices)
4762 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
4766 // calculate a bounding box
4767 VectorClear(out->mins);
4768 VectorClear(out->maxs);
4769 if (out->num_vertices)
4771 if (cls.state != ca_dedicated && out->lightmaptexture)
4773 // figure out which part of the merged lightmap this fits into
4774 int lightmapindex = LittleLong(in->lightmapindex) >> loadmodel->brushq3.deluxemapping;
4775 int mergewidth = R_TextureWidth(out->lightmaptexture) / 128;
4776 int mergeheight = R_TextureHeight(out->lightmaptexture) / 128;
4777 lightmapindex &= mergewidth * mergeheight - 1;
4778 lightmaptcscale[0] = 1.0f / mergewidth;
4779 lightmaptcscale[1] = 1.0f / mergeheight;
4780 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
4781 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
4782 // modify the lightmap texcoords to match this region of the merged lightmap
4783 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
4785 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
4786 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
4789 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
4790 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
4791 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
4793 out->mins[0] = min(out->mins[0], v[0]);
4794 out->maxs[0] = max(out->maxs[0], v[0]);
4795 out->mins[1] = min(out->mins[1], v[1]);
4796 out->maxs[1] = max(out->maxs[1], v[1]);
4797 out->mins[2] = min(out->mins[2], v[2]);
4798 out->maxs[2] = max(out->maxs[2], v[2]);
4800 out->mins[0] -= 1.0f;
4801 out->mins[1] -= 1.0f;
4802 out->mins[2] -= 1.0f;
4803 out->maxs[0] += 1.0f;
4804 out->maxs[1] += 1.0f;
4805 out->maxs[2] += 1.0f;
4807 // set lightmap styles for consistency with q1bsp
4808 //out->lightmapinfo->styles[0] = 0;
4809 //out->lightmapinfo->styles[1] = 255;
4810 //out->lightmapinfo->styles[2] = 255;
4811 //out->lightmapinfo->styles[3] = 255;
4814 // for per pixel lighting
4815 Mod_BuildTextureVectorsFromNormals(0, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_texcoordtexture2f, loadmodel->surfmesh.data_normal3f, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.data_svector3f, loadmodel->surfmesh.data_tvector3f, true);
4817 // free the no longer needed vertex data
4818 loadmodel->brushq3.num_vertices = 0;
4819 if (loadmodel->brushq3.data_vertex3f)
4820 Mem_Free(loadmodel->brushq3.data_vertex3f);
4821 loadmodel->brushq3.data_vertex3f = NULL;
4822 loadmodel->brushq3.data_normal3f = NULL;
4823 loadmodel->brushq3.data_texcoordtexture2f = NULL;
4824 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
4825 loadmodel->brushq3.data_color4f = NULL;
4826 // free the no longer needed triangle data
4827 loadmodel->brushq3.num_triangles = 0;
4828 if (loadmodel->brushq3.data_element3i)
4829 Mem_Free(loadmodel->brushq3.data_element3i);
4830 loadmodel->brushq3.data_element3i = NULL;
4833 static void Mod_Q3BSP_LoadModels(lump_t *l)
4837 int i, j, n, c, count;
4839 in = (q3dmodel_t *)(mod_base + l->fileofs);
4840 if (l->filelen % sizeof(*in))
4841 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4842 count = l->filelen / sizeof(*in);
4843 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4845 loadmodel->brushq3.data_models = out;
4846 loadmodel->brushq3.num_models = count;
4848 for (i = 0;i < count;i++, in++, out++)
4850 for (j = 0;j < 3;j++)
4852 out->mins[j] = LittleFloat(in->mins[j]);
4853 out->maxs[j] = LittleFloat(in->maxs[j]);
4855 n = LittleLong(in->firstface);
4856 c = LittleLong(in->numfaces);
4857 if (n < 0 || n + c > loadmodel->num_surfaces)
4858 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
4861 n = LittleLong(in->firstbrush);
4862 c = LittleLong(in->numbrushes);
4863 if (n < 0 || n + c > loadmodel->brush.num_brushes)
4864 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
4865 out->firstbrush = n;
4866 out->numbrushes = c;
4870 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
4876 in = (int *)(mod_base + l->fileofs);
4877 if (l->filelen % sizeof(*in))
4878 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4879 count = l->filelen / sizeof(*in);
4880 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4882 loadmodel->brush.data_leafbrushes = out;
4883 loadmodel->brush.num_leafbrushes = count;
4885 for (i = 0;i < count;i++, in++, out++)
4887 n = LittleLong(*in);
4888 if (n < 0 || n >= loadmodel->brush.num_brushes)
4889 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
4894 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
4900 in = (int *)(mod_base + l->fileofs);
4901 if (l->filelen % sizeof(*in))
4902 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4903 count = l->filelen / sizeof(*in);
4904 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4906 loadmodel->brush.data_leafsurfaces = out;
4907 loadmodel->brush.num_leafsurfaces = count;
4909 for (i = 0;i < count;i++, in++, out++)
4911 n = LittleLong(*in);
4912 if (n < 0 || n >= loadmodel->num_surfaces)
4913 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
4918 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
4922 int i, j, n, c, count;
4924 in = (q3dleaf_t *)(mod_base + l->fileofs);
4925 if (l->filelen % sizeof(*in))
4926 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4927 count = l->filelen / sizeof(*in);
4928 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4930 loadmodel->brush.data_leafs = out;
4931 loadmodel->brush.num_leafs = count;
4933 for (i = 0;i < count;i++, in++, out++)
4937 out->clusterindex = LittleLong(in->clusterindex);
4938 out->areaindex = LittleLong(in->areaindex);
4939 for (j = 0;j < 3;j++)
4941 // yes the mins/maxs are ints
4942 out->mins[j] = LittleLong(in->mins[j]) - 1;
4943 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
4945 n = LittleLong(in->firstleafface);
4946 c = LittleLong(in->numleaffaces);
4947 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
4948 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
4949 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
4950 out->numleafsurfaces = c;
4951 n = LittleLong(in->firstleafbrush);
4952 c = LittleLong(in->numleafbrushes);
4953 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
4954 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
4955 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
4956 out->numleafbrushes = c;
4960 static void Mod_Q3BSP_LoadNodes(lump_t *l)
4966 in = (q3dnode_t *)(mod_base + l->fileofs);
4967 if (l->filelen % sizeof(*in))
4968 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4969 count = l->filelen / sizeof(*in);
4970 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4972 loadmodel->brush.data_nodes = out;
4973 loadmodel->brush.num_nodes = count;
4975 for (i = 0;i < count;i++, in++, out++)
4978 n = LittleLong(in->planeindex);
4979 if (n < 0 || n >= loadmodel->brush.num_planes)
4980 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4981 out->plane = loadmodel->brush.data_planes + n;
4982 for (j = 0;j < 2;j++)
4984 n = LittleLong(in->childrenindex[j]);
4987 if (n >= loadmodel->brush.num_nodes)
4988 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
4989 out->children[j] = loadmodel->brush.data_nodes + n;
4994 if (n >= loadmodel->brush.num_leafs)
4995 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
4996 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
4999 for (j = 0;j < 3;j++)
5001 // yes the mins/maxs are ints
5002 out->mins[j] = LittleLong(in->mins[j]) - 1;
5003 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5007 // set the parent pointers
5008 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5011 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5014 q3dlightgrid_t *out;
5017 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5018 if (l->filelen % sizeof(*in))
5019 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5020 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5021 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5022 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5023 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5024 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5025 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5026 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5027 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5028 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5029 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5030 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5031 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5032 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5033 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]);
5034 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]);
5036 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5039 if (l->filelen < count * (int)sizeof(*in))
5040 Host_Error("Mod_Q3BSP_LoadLightGrid: invalid lightgrid lump size %i bytes, should be %i bytes (%ix%ix%i)", l->filelen, (int)(count * sizeof(*in)), loadmodel->brushq3.num_lightgrid_dimensions[0], loadmodel->brushq3.num_lightgrid_dimensions[1], loadmodel->brushq3.num_lightgrid_dimensions[2]);
5041 if (l->filelen != count * (int)sizeof(*in))
5042 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5043 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5044 loadmodel->brushq3.data_lightgrid = out;
5045 loadmodel->brushq3.num_lightgrid = count;
5046 // no swapping or validation necessary
5047 memcpy(out, in, count * (int)sizeof(*out));
5051 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5056 if (l->filelen == 0)
5059 // unvised maps often have cluster indices even without pvs, so check
5060 // leafs to find real number of clusters
5061 loadmodel->brush.num_pvsclusters = 1;
5062 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5063 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5066 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5067 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5068 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5069 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5073 in = (q3dpvs_t *)(mod_base + l->fileofs);
5075 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5077 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5078 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5079 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5080 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5081 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5082 if (l->filelen < totalchains + (int)sizeof(*in))
5083 Host_Error("Mod_Q3BSP_LoadPVS: lump too small ((numclusters = %i) * (chainlength = %i) + sizeof(q3dpvs_t) == %i bytes, lump is %i bytes)", loadmodel->brush.num_pvsclusters, loadmodel->brush.num_pvsclusterbytes, (int)(totalchains + sizeof(*in)), l->filelen);
5085 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5086 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5089 static void Mod_Q3BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5091 int i, j, k, index[3];
5092 float transformed[3], blend1, blend2, blend, stylescale;
5093 q3dlightgrid_t *a, *s;
5095 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5096 stylescale = r_refdef.lightstylevalue[0] * (1.0f / 264.0f);
5098 if (!model->brushq3.num_lightgrid)
5100 ambientcolor[0] = stylescale;
5101 ambientcolor[1] = stylescale;
5102 ambientcolor[2] = stylescale;
5106 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5107 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5108 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5109 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5110 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5111 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5112 index[0] = (int)floor(transformed[0]);
5113 index[1] = (int)floor(transformed[1]);
5114 index[2] = (int)floor(transformed[2]);
5115 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5117 // now lerp the values
5118 VectorClear(diffusenormal);
5119 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5120 for (k = 0;k < 2;k++)
5122 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5123 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5125 for (j = 0;j < 2;j++)
5127 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5128 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5130 for (i = 0;i < 2;i++)
5132 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5133 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5135 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5136 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5137 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5138 // this uses the mod_md3_sin table because the values are
5139 // already in the 0-255 range, the 64+ bias fetches a cosine
5140 // instead of a sine value
5141 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5142 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5143 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5144 //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)));
5149 // normalize the light direction before turning
5150 VectorNormalize(diffusenormal);
5151 //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]);
5154 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const vec3_t point, int markframe)
5159 // find which leaf the point is in
5161 node = node->children[DotProduct(point, node->plane->normal) < node->plane->dist];
5162 // point trace the brushes
5163 leaf = (mleaf_t *)node;
5164 for (i = 0;i < leaf->numleafbrushes;i++)
5166 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5167 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5169 brush->markframe = markframe;
5170 Collision_TracePointBrushFloat(trace, point, brush);
5173 // can't do point traces on curves (they have no thickness)
5176 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)
5178 int i, startside, endside;
5179 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5181 msurface_t *surface;
5184 // walk the tree until we hit a leaf, recursing for any split cases
5187 // abort if this part of the bsp tree can not be hit by this trace
5188 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5190 plane = node->plane;
5191 // axial planes are much more common than non-axial, so an optimized
5192 // axial case pays off here
5193 if (plane->type < 3)
5195 dist1 = start[plane->type] - plane->dist;
5196 dist2 = end[plane->type] - plane->dist;
5200 dist1 = DotProduct(start, plane->normal) - plane->dist;
5201 dist2 = DotProduct(end, plane->normal) - plane->dist;
5203 startside = dist1 < 0;
5204 endside = dist2 < 0;
5205 if (startside == endside)
5207 // most of the time the line fragment is on one side of the plane
5208 node = node->children[startside];
5212 // line crosses node plane, split the line
5213 dist1 = PlaneDiff(linestart, plane);
5214 dist2 = PlaneDiff(lineend, plane);
5215 midfrac = dist1 / (dist1 - dist2);
5216 VectorLerp(linestart, midfrac, lineend, mid);
5217 // take the near side first
5218 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5219 // if we found an impact on the front side, don't waste time
5220 // exploring the far side
5221 if (midfrac <= trace->realfraction)
5222 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5226 // abort if this part of the bsp tree can not be hit by this trace
5227 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5230 nodesegmentmins[0] = min(start[0], end[0]) - 1;
5231 nodesegmentmins[1] = min(start[1], end[1]) - 1;
5232 nodesegmentmins[2] = min(start[2], end[2]) - 1;
5233 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5234 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5235 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5236 // line trace the brushes
5237 leaf = (mleaf_t *)node;
5238 for (i = 0;i < leaf->numleafbrushes;i++)
5240 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5241 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5243 brush->markframe = markframe;
5244 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5247 // can't do point traces on curves (they have no thickness)
5248 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5250 // line trace the curves
5251 for (i = 0;i < leaf->numleafsurfaces;i++)
5253 surface = model->data_surfaces + leaf->firstleafsurface[i];
5254 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5256 surface->collisionmarkframe = markframe;
5257 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5263 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)
5269 msurface_t *surface;
5271 float nodesegmentmins[3], nodesegmentmaxs[3];
5272 // walk the tree until we hit a leaf, recursing for any split cases
5275 // abort if this part of the bsp tree can not be hit by this trace
5276 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5278 plane = node->plane;
5279 // axial planes are much more common than non-axial, so an optimized
5280 // axial case pays off here
5281 if (plane->type < 3)
5283 // this is an axial plane, compare bounding box directly to it and
5284 // recurse sides accordingly
5285 // recurse down node sides
5286 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5287 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5288 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5289 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5293 // this is a non-axial plane, so check if the start and end boxes
5294 // are both on one side of the plane to handle 'diagonal' cases
5295 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5299 // segment crosses plane
5300 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5303 // if sides == 0 then the trace itself is bogus (Not A Number values),
5304 // in this case we simply pretend the trace hit nothing
5306 return; // ERROR: NAN bounding box!
5307 // take whichever side the segment box is on
5308 node = node->children[sides - 1];
5310 // abort if this part of the bsp tree can not be hit by this trace
5311 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5313 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5314 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5315 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5316 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5317 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5318 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5320 leaf = (mleaf_t *)node;
5321 for (i = 0;i < leaf->numleafbrushes;i++)
5323 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5324 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5326 brush->markframe = markframe;
5327 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5330 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5332 for (i = 0;i < leaf->numleafsurfaces;i++)
5334 surface = model->data_surfaces + leaf->firstleafsurface[i];
5335 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5337 surface->collisionmarkframe = markframe;
5338 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);
5344 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)
5347 float segmentmins[3], segmentmaxs[3];
5348 static int markframe = 0;
5349 msurface_t *surface;
5351 memset(trace, 0, sizeof(*trace));
5352 trace->fraction = 1;
5353 trace->realfraction = 1;
5354 trace->hitsupercontentsmask = hitsupercontentsmask;
5355 if (mod_q3bsp_optimizedtraceline.integer && VectorLength2(boxmins) + VectorLength2(boxmaxs) == 0)
5357 if (VectorCompare(start, end))
5360 if (model->brush.submodel)
5362 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5363 if (brush->colbrushf)
5364 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5367 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5372 segmentmins[0] = min(start[0], end[0]) - 1;
5373 segmentmins[1] = min(start[1], end[1]) - 1;
5374 segmentmins[2] = min(start[2], end[2]) - 1;
5375 segmentmaxs[0] = max(start[0], end[0]) + 1;
5376 segmentmaxs[1] = max(start[1], end[1]) + 1;
5377 segmentmaxs[2] = max(start[2], end[2]) + 1;
5378 if (model->brush.submodel)
5380 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5381 if (brush->colbrushf)
5382 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5383 if (mod_q3bsp_curves_collisions.integer)
5384 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5385 if (surface->num_collisiontriangles)
5386 Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5389 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5394 // box trace, performed as brush trace
5395 colbrushf_t *thisbrush_start, *thisbrush_end;
5396 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5397 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5398 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5399 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5400 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5401 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5402 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5403 VectorAdd(start, boxmins, boxstartmins);
5404 VectorAdd(start, boxmaxs, boxstartmaxs);
5405 VectorAdd(end, boxmins, boxendmins);
5406 VectorAdd(end, boxmaxs, boxendmaxs);
5407 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5408 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5409 if (model->brush.submodel)
5411 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5412 if (brush->colbrushf)
5413 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5414 if (mod_q3bsp_curves_collisions.integer)
5415 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5416 if (surface->num_collisiontriangles)
5417 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);
5420 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5424 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
5426 int supercontents = 0;
5427 if (nativecontents & CONTENTSQ3_SOLID)
5428 supercontents |= SUPERCONTENTS_SOLID;
5429 if (nativecontents & CONTENTSQ3_WATER)
5430 supercontents |= SUPERCONTENTS_WATER;
5431 if (nativecontents & CONTENTSQ3_SLIME)
5432 supercontents |= SUPERCONTENTS_SLIME;
5433 if (nativecontents & CONTENTSQ3_LAVA)
5434 supercontents |= SUPERCONTENTS_LAVA;
5435 if (nativecontents & CONTENTSQ3_BODY)
5436 supercontents |= SUPERCONTENTS_BODY;
5437 if (nativecontents & CONTENTSQ3_CORPSE)
5438 supercontents |= SUPERCONTENTS_CORPSE;
5439 if (nativecontents & CONTENTSQ3_NODROP)
5440 supercontents |= SUPERCONTENTS_NODROP;
5441 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5442 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5443 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5444 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5445 if (nativecontents & CONTENTSQ3_DONOTENTER)
5446 supercontents |= SUPERCONTENTS_DONOTENTER;
5447 return supercontents;
5450 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
5452 int nativecontents = 0;
5453 if (supercontents & SUPERCONTENTS_SOLID)
5454 nativecontents |= CONTENTSQ3_SOLID;
5455 if (supercontents & SUPERCONTENTS_WATER)
5456 nativecontents |= CONTENTSQ3_WATER;
5457 if (supercontents & SUPERCONTENTS_SLIME)
5458 nativecontents |= CONTENTSQ3_SLIME;
5459 if (supercontents & SUPERCONTENTS_LAVA)
5460 nativecontents |= CONTENTSQ3_LAVA;
5461 if (supercontents & SUPERCONTENTS_BODY)
5462 nativecontents |= CONTENTSQ3_BODY;
5463 if (supercontents & SUPERCONTENTS_CORPSE)
5464 nativecontents |= CONTENTSQ3_CORPSE;
5465 if (supercontents & SUPERCONTENTS_NODROP)
5466 nativecontents |= CONTENTSQ3_NODROP;
5467 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5468 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5469 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5470 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5471 if (supercontents & SUPERCONTENTS_DONOTENTER)
5472 nativecontents |= CONTENTSQ3_DONOTENTER;
5473 return nativecontents;
5476 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5481 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5482 node = node->children[1];
5484 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5485 if (loadmodel->brush.num_leafs < numleafs)
5486 loadmodel->brush.num_leafs = numleafs;
5489 void Mod_Q3BSP_Load(model_t *mod, void *buffer, void *bufferend)
5491 int i, j, numshadowmeshtriangles;
5492 q3dheader_t *header;
5493 float corner[3], yawradius, modelradius;
5494 msurface_t *surface;
5496 mod->type = mod_brushq3;
5497 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5500 header = (q3dheader_t *)buffer;
5502 i = LittleLong(header->version);
5503 if (i != Q3BSPVERSION)
5504 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5505 mod->brush.ishlbsp = false;
5506 mod->brush.ismcbsp = false;
5507 if (loadmodel->isworldmodel)
5509 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
5510 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
5513 mod->soundfromcenter = true;
5514 mod->TraceBox = Mod_Q3BSP_TraceBox;
5515 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
5516 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5517 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5518 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5519 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5520 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5521 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5522 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5523 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
5524 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5525 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5526 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5527 mod->Draw = R_Q1BSP_Draw;
5528 mod->DrawDepth = R_Q1BSP_DrawDepth;
5529 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5530 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5531 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5532 mod->DrawLight = R_Q1BSP_DrawLight;
5534 mod_base = (unsigned char *)header;
5536 // swap all the lumps
5537 header->ident = LittleLong(header->ident);
5538 header->version = LittleLong(header->version);
5539 for (i = 0;i < Q3HEADER_LUMPS;i++)
5541 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
5542 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
5545 mod->brush.qw_md4sum = 0;
5546 mod->brush.qw_md4sum2 = 0;
5547 for (i = 0;i < Q3HEADER_LUMPS;i++)
5549 if (i == Q3LUMP_ENTITIES)
5551 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5552 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
5554 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5557 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5558 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5559 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5560 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5561 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5562 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5563 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5564 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5565 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
5566 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5567 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5568 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5569 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5570 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5571 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5572 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5573 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5574 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5576 // the MakePortals code works fine on the q3bsp data as well
5577 Mod_Q1BSP_MakePortals();
5579 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
5580 loadmodel->brush.supportwateralpha = true;
5582 // make a single combined shadow mesh to allow optimized shadow volume creation
5583 numshadowmeshtriangles = 0;
5584 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5586 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5587 numshadowmeshtriangles += surface->num_triangles;
5589 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5590 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5591 if (surface->num_triangles > 0)
5592 Mod_ShadowMesh_AddMesh(loadmodel->mempool, loadmodel->brush.shadowmesh, NULL, NULL, NULL, loadmodel->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
5593 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
5594 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5596 loadmodel->brush.num_leafs = 0;
5597 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
5599 if (loadmodel->isworldmodel)
5601 // clear out any stale submodels or worldmodels lying around
5602 // if we did this clear before now, an error might abort loading and
5603 // leave things in a bad state
5604 Mod_RemoveStaleWorldModels(loadmodel);
5608 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
5613 // LordHavoc: only register submodels if it is the world
5614 // (prevents external bsp models from replacing world submodels with
5616 if (!loadmodel->isworldmodel)
5618 // duplicate the basic information
5619 sprintf(name, "*%i", i);
5620 mod = Mod_FindName(name);
5622 strlcpy(mod->name, name, sizeof(mod->name));
5623 // textures and memory belong to the main model
5624 mod->texturepool = NULL;
5625 mod->mempool = NULL;
5626 mod->brush.TraceLineOfSight = NULL;
5627 mod->brush.GetPVS = NULL;
5628 mod->brush.FatPVS = NULL;
5629 mod->brush.BoxTouchingPVS = NULL;
5630 mod->brush.BoxTouchingLeafPVS = NULL;
5631 mod->brush.BoxTouchingVisibleLeafs = NULL;
5632 mod->brush.FindBoxClusters = NULL;
5633 mod->brush.LightPoint = NULL;
5634 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5636 mod->brush.submodel = i;
5638 // make the model surface list (used by shadowing/lighting)
5639 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
5640 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
5641 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
5642 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
5643 mod->surfacelist = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
5644 for (j = 0;j < mod->nummodelsurfaces;j++)
5645 mod->surfacelist[j] = mod->firstmodelsurface + j;
5647 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
5648 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
5649 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5650 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5651 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5652 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5653 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5654 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5655 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5656 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5657 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5658 mod->yawmins[2] = mod->normalmins[2];
5659 mod->yawmaxs[2] = mod->normalmaxs[2];
5660 mod->radius = modelradius;
5661 mod->radius2 = modelradius * modelradius;
5663 for (j = 0;j < mod->nummodelsurfaces;j++)
5664 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->surfaceflags & Q3SURFACEFLAG_SKY)
5666 if (j < mod->nummodelsurfaces)
5667 mod->DrawSky = R_Q1BSP_DrawSky;
5669 mod->DrawSky = NULL;
5673 void Mod_IBSP_Load(model_t *mod, void *buffer, void *bufferend)
5675 int i = LittleLong(((int *)buffer)[1]);
5676 if (i == Q3BSPVERSION)
5677 Mod_Q3BSP_Load(mod,buffer, bufferend);
5678 else if (i == Q2BSPVERSION)
5679 Mod_Q2BSP_Load(mod,buffer, bufferend);
5681 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
5684 void Mod_MAP_Load(model_t *mod, void *buffer, void *bufferend)
5686 Host_Error("Mod_MAP_Load: not yet implemented");
5689 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
5691 // we already have done PVS culling at this point...
5692 // so we don't need to do it again.
5695 vec3_t testorigin, mins, maxs;
5697 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
5698 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
5699 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
5701 if(model->brush.TraceLineOfSight(model, eye, testorigin))
5704 // expand the box a little
5705 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
5706 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
5707 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
5708 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
5709 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
5710 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
5712 for(i = 0; i != numsamples; ++i)
5714 testorigin[0] = lhrandom(mins[0], maxs[0]);
5715 testorigin[1] = lhrandom(mins[1], maxs[1]);
5716 testorigin[2] = lhrandom(mins[2], maxs[2]);
5718 if(model->brush.TraceLineOfSight(model, eye, testorigin))