2 Copyright (C) 1996-1997 Id Software, Inc.
4 This program is free software; you can redistribute it and/or
5 modify it under the terms of the GNU General Public License
6 as published by the Free Software Foundation; either version 2
7 of the License, or (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
13 See the GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128", "how large water polygons should be (smaller values produce more polygons which give better warping effects)"};
30 cvar_t halflifebsp = {0, "halflifebsp", "0", "indicates the current map is hlbsp format (useful to know because of different bounding box sizes)"};
31 cvar_t mcbsp = {0, "mcbsp", "0", "indicates the current map is mcbsp format (useful to know because of different bounding box sizes)"};
32 cvar_t r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
33 cvar_t r_picmipworld = {CVAR_SAVE, "r_picmipworld", "1", "whether gl_picmip shall apply to world textures too"};
34 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0", "pretends there was no texture lump found in the q1bsp/hlbsp loading (useful for debugging this rare case)"};
35 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4", "maximum error tolerance on curve subdivision for rendering purposes (in other words, the curves will be given as many polygons as necessary to represent curves at this quality)"};
36 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "1", "minimum number of subdivisions (values above 1 will smooth curves that don't need it)"};
37 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
38 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
39 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15", "maximum error tolerance on curve subdivision for collision purposes (usually a larger error tolerance than for rendering)"};
40 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "1", "minimum number of subdivisions (values above 1 will smooth curves that don't need it)"};
41 cvar_t r_subdivisions_collision_maxtess = {0, "r_subdivisions_collision_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
42 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
43 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
44 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
45 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
46 cvar_t mod_q3bsp_lightmapmergepower = {CVAR_SAVE, "mod_q3bsp_lightmapmergepower", "4", "merges the quake3 128x128 lightmap textures into larger lightmap group textures to speed up rendering, 1 = 256x256, 2 = 512x512, 3 = 1024x1024, 4 = 2048x2048, 5 = 4096x4096, ..."};
48 static texture_t mod_q1bsp_texture_solid;
49 static texture_t mod_q1bsp_texture_sky;
50 static texture_t mod_q1bsp_texture_lava;
51 static texture_t mod_q1bsp_texture_slime;
52 static texture_t mod_q1bsp_texture_water;
54 void Mod_BrushInit(void)
56 // Cvar_RegisterVariable(&r_subdivide_size);
57 Cvar_RegisterVariable(&halflifebsp);
58 Cvar_RegisterVariable(&mcbsp);
59 Cvar_RegisterVariable(&r_novis);
60 Cvar_RegisterVariable(&r_picmipworld);
61 Cvar_RegisterVariable(&r_nosurftextures);
62 Cvar_RegisterVariable(&r_subdivisions_tolerance);
63 Cvar_RegisterVariable(&r_subdivisions_mintess);
64 Cvar_RegisterVariable(&r_subdivisions_maxtess);
65 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
66 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
67 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
68 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
69 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
70 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
71 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
72 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
73 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
75 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
76 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
77 mod_q1bsp_texture_solid.surfaceflags = 0;
78 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
80 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
81 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
82 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
83 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
85 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
86 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
87 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
88 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
90 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
91 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
92 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
93 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
95 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
96 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
97 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
98 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
101 static mleaf_t *Mod_Q1BSP_PointInLeaf(model_t *model, const vec3_t p)
108 // LordHavoc: modified to start at first clip node,
109 // in other words: first node of the (sub)model
110 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
112 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
114 return (mleaf_t *)node;
117 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(model_t *model, const vec3_t p, unsigned char *out, int outsize)
121 leaf = Mod_Q1BSP_PointInLeaf(model, p);
124 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
127 memcpy(out, leaf->ambient_sound_level, i);
133 memset(out, 0, outsize);
136 static int Mod_Q1BSP_FindBoxClusters(model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
139 int nodestackindex = 0;
140 mnode_t *node, *nodestack[1024];
141 if (!model->brush.num_pvsclusters)
143 node = model->brush.data_nodes;
149 // node - recurse down the BSP tree
150 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
154 return -1; // ERROR: NAN bounding box!
155 // box is on one side of plane, take that path
156 node = node->children[sides-1];
160 // box crosses plane, take one path and remember the other
161 if (nodestackindex < 1024)
162 nodestack[nodestackindex++] = node->children[0];
163 node = node->children[1];
169 // leaf - add clusterindex to list
170 if (numclusters < maxclusters)
171 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
175 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
179 if (nodestackindex < 1024)
180 nodestack[nodestackindex++] = node->children[0];
181 node = node->children[1];
186 // leaf - add clusterindex to list
187 if (numclusters < maxclusters)
188 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
193 // try another path we didn't take earlier
194 if (nodestackindex == 0)
196 node = nodestack[--nodestackindex];
198 // return number of clusters found (even if more than the maxclusters)
202 static int Mod_Q1BSP_BoxTouchingPVS(model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
204 int nodestackindex = 0;
205 mnode_t *node, *nodestack[1024];
206 if (!model->brush.num_pvsclusters)
208 node = model->brush.data_nodes;
214 // node - recurse down the BSP tree
215 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
219 return -1; // ERROR: NAN bounding box!
220 // box is on one side of plane, take that path
221 node = node->children[sides-1];
225 // box crosses plane, take one path and remember the other
226 if (nodestackindex < 1024)
227 nodestack[nodestackindex++] = node->children[0];
228 node = node->children[1];
234 // leaf - check cluster bit
235 int clusterindex = ((mleaf_t *)node)->clusterindex;
236 if (CHECKPVSBIT(pvs, clusterindex))
238 // it is visible, return immediately with the news
243 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
247 if (nodestackindex < 1024)
248 nodestack[nodestackindex++] = node->children[0];
249 node = node->children[1];
254 // leaf - check cluster bit
255 int clusterindex = ((mleaf_t *)node)->clusterindex;
256 if (CHECKPVSBIT(pvs, clusterindex))
258 // it is visible, return immediately with the news
264 // nothing to see here, try another path we didn't take earlier
265 if (nodestackindex == 0)
267 node = nodestack[--nodestackindex];
273 static int Mod_Q1BSP_BoxTouchingLeafPVS(model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
275 int nodestackindex = 0;
276 mnode_t *node, *nodestack[1024];
277 if (!model->brush.num_leafs)
279 node = model->brush.data_nodes;
285 // node - recurse down the BSP tree
286 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
290 return -1; // ERROR: NAN bounding box!
291 // box is on one side of plane, take that path
292 node = node->children[sides-1];
296 // box crosses plane, take one path and remember the other
297 if (nodestackindex < 1024)
298 nodestack[nodestackindex++] = node->children[0];
299 node = node->children[1];
305 // leaf - check cluster bit
306 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
307 if (CHECKPVSBIT(pvs, clusterindex))
309 // it is visible, return immediately with the news
314 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
318 if (nodestackindex < 1024)
319 nodestack[nodestackindex++] = node->children[0];
320 node = node->children[1];
325 // leaf - check cluster bit
326 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
327 if (CHECKPVSBIT(pvs, clusterindex))
329 // it is visible, return immediately with the news
335 // nothing to see here, try another path we didn't take earlier
336 if (nodestackindex == 0)
338 node = nodestack[--nodestackindex];
344 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
346 int nodestackindex = 0;
347 mnode_t *node, *nodestack[1024];
348 if (!model->brush.num_leafs)
350 node = model->brush.data_nodes;
356 // node - recurse down the BSP tree
357 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
361 return -1; // ERROR: NAN bounding box!
362 // box is on one side of plane, take that path
363 node = node->children[sides-1];
367 // box crosses plane, take one path and remember the other
368 if (nodestackindex < 1024)
369 nodestack[nodestackindex++] = node->children[0];
370 node = node->children[1];
376 // leaf - check if it is visible
377 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
379 // it is visible, return immediately with the news
384 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
388 if (nodestackindex < 1024)
389 nodestack[nodestackindex++] = node->children[0];
390 node = node->children[1];
395 // leaf - check if it is visible
396 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
398 // it is visible, return immediately with the news
404 // nothing to see here, try another path we didn't take earlier
405 if (nodestackindex == 0)
407 node = nodestack[--nodestackindex];
413 typedef struct findnonsolidlocationinfo_s
421 findnonsolidlocationinfo_t;
423 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
425 int i, surfacenum, k, *tri, *mark;
426 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
428 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
430 surface = info->model->data_surfaces + *mark;
431 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
433 for (k = 0;k < surface->num_triangles;k++)
435 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
436 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
437 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
438 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
439 VectorSubtract(vert[1], vert[0], edge[0]);
440 VectorSubtract(vert[2], vert[1], edge[1]);
441 CrossProduct(edge[1], edge[0], facenormal);
442 if (facenormal[0] || facenormal[1] || facenormal[2])
444 VectorNormalize(facenormal);
445 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
446 if (f <= info->bestdist && f >= -info->bestdist)
448 VectorSubtract(vert[0], vert[2], edge[2]);
449 VectorNormalize(edge[0]);
450 VectorNormalize(edge[1]);
451 VectorNormalize(edge[2]);
452 CrossProduct(facenormal, edge[0], edgenormal[0]);
453 CrossProduct(facenormal, edge[1], edgenormal[1]);
454 CrossProduct(facenormal, edge[2], edgenormal[2]);
456 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
457 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
458 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
460 // we got lucky, the center is within the face
461 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
465 if (info->bestdist > dist)
467 info->bestdist = dist;
468 VectorScale(facenormal, (info->radius - -dist), info->nudge);
473 if (info->bestdist > dist)
475 info->bestdist = dist;
476 VectorScale(facenormal, (info->radius - dist), info->nudge);
482 // check which edge or vertex the center is nearest
483 for (i = 0;i < 3;i++)
485 f = DotProduct(info->center, edge[i]);
486 if (f >= DotProduct(vert[0], edge[i])
487 && f <= DotProduct(vert[1], edge[i]))
490 VectorMA(info->center, -f, edge[i], point);
491 dist = sqrt(DotProduct(point, point));
492 if (info->bestdist > dist)
494 info->bestdist = dist;
495 VectorScale(point, (info->radius / dist), info->nudge);
497 // skip both vertex checks
498 // (both are further away than this edge)
503 // not on edge, check first vertex of edge
504 VectorSubtract(info->center, vert[i], point);
505 dist = sqrt(DotProduct(point, point));
506 if (info->bestdist > dist)
508 info->bestdist = dist;
509 VectorScale(point, (info->radius / dist), info->nudge);
521 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
525 float f = PlaneDiff(info->center, node->plane);
526 if (f >= -info->bestdist)
527 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
528 if (f <= info->bestdist)
529 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
533 if (((mleaf_t *)node)->numleafsurfaces)
534 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
538 static void Mod_Q1BSP_FindNonSolidLocation(model_t *model, const vec3_t in, vec3_t out, float radius)
541 findnonsolidlocationinfo_t info;
547 VectorCopy(in, info.center);
548 info.radius = radius;
553 VectorClear(info.nudge);
554 info.bestdist = radius;
555 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
556 VectorAdd(info.center, info.nudge, info.center);
558 while (info.bestdist < radius && ++i < 10);
559 VectorCopy(info.center, out);
562 int Mod_Q1BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
564 switch(nativecontents)
569 return SUPERCONTENTS_SOLID;
571 return SUPERCONTENTS_WATER;
573 return SUPERCONTENTS_SLIME;
575 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
577 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
582 int Mod_Q1BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
584 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
585 return CONTENTS_SOLID;
586 if (supercontents & SUPERCONTENTS_SKY)
588 if (supercontents & SUPERCONTENTS_LAVA)
589 return CONTENTS_LAVA;
590 if (supercontents & SUPERCONTENTS_SLIME)
591 return CONTENTS_SLIME;
592 if (supercontents & SUPERCONTENTS_WATER)
593 return CONTENTS_WATER;
594 return CONTENTS_EMPTY;
597 typedef struct RecursiveHullCheckTraceInfo_s
599 // the hull we're tracing through
602 // the trace structure to fill in
605 // start, end, and end - start (in model space)
610 RecursiveHullCheckTraceInfo_t;
612 // 1/32 epsilon to keep floating point happy
613 #define DIST_EPSILON (0.03125)
615 #define HULLCHECKSTATE_EMPTY 0
616 #define HULLCHECKSTATE_SOLID 1
617 #define HULLCHECKSTATE_DONE 2
619 extern cvar_t collision_prefernudgedfraction;
620 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
622 // status variables, these don't need to be saved on the stack when
623 // recursing... but are because this should be thread-safe
624 // (note: tracing against a bbox is not thread-safe, yet)
629 // variables that need to be stored on the stack when recursing
634 // LordHavoc: a goto! everyone flee in terror... :)
639 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
640 if (!t->trace->startfound)
642 t->trace->startfound = true;
643 t->trace->startsupercontents |= num;
645 if (num & SUPERCONTENTS_LIQUIDSMASK)
646 t->trace->inwater = true;
648 t->trace->inopen = true;
649 if (num & SUPERCONTENTS_SOLID)
650 t->trace->hittexture = &mod_q1bsp_texture_solid;
651 else if (num & SUPERCONTENTS_SKY)
652 t->trace->hittexture = &mod_q1bsp_texture_sky;
653 else if (num & SUPERCONTENTS_LAVA)
654 t->trace->hittexture = &mod_q1bsp_texture_lava;
655 else if (num & SUPERCONTENTS_SLIME)
656 t->trace->hittexture = &mod_q1bsp_texture_slime;
658 t->trace->hittexture = &mod_q1bsp_texture_water;
659 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
660 t->trace->hitsupercontents = num;
661 if (num & t->trace->hitsupercontentsmask)
663 // if the first leaf is solid, set startsolid
664 if (t->trace->allsolid)
665 t->trace->startsolid = true;
666 #if COLLISIONPARANOID >= 3
669 return HULLCHECKSTATE_SOLID;
673 t->trace->allsolid = false;
674 #if COLLISIONPARANOID >= 3
677 return HULLCHECKSTATE_EMPTY;
681 // find the point distances
682 node = t->hull->clipnodes + num;
684 plane = t->hull->planes + node->planenum;
687 t1 = p1[plane->type] - plane->dist;
688 t2 = p2[plane->type] - plane->dist;
692 t1 = DotProduct (plane->normal, p1) - plane->dist;
693 t2 = DotProduct (plane->normal, p2) - plane->dist;
700 #if COLLISIONPARANOID >= 3
703 num = node->children[1];
712 #if COLLISIONPARANOID >= 3
715 num = node->children[0];
721 // the line intersects, find intersection point
722 // LordHavoc: this uses the original trace for maximum accuracy
723 #if COLLISIONPARANOID >= 3
728 t1 = t->start[plane->type] - plane->dist;
729 t2 = t->end[plane->type] - plane->dist;
733 t1 = DotProduct (plane->normal, t->start) - plane->dist;
734 t2 = DotProduct (plane->normal, t->end) - plane->dist;
737 midf = t1 / (t1 - t2);
738 midf = bound(p1f, midf, p2f);
739 VectorMA(t->start, midf, t->dist, mid);
741 // recurse both sides, front side first
742 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
743 // if this side is not empty, return what it is (solid or done)
744 if (ret != HULLCHECKSTATE_EMPTY)
747 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
748 // if other side is not solid, return what it is (empty or done)
749 if (ret != HULLCHECKSTATE_SOLID)
752 // front is air and back is solid, this is the impact point...
755 t->trace->plane.dist = -plane->dist;
756 VectorNegate (plane->normal, t->trace->plane.normal);
760 t->trace->plane.dist = plane->dist;
761 VectorCopy (plane->normal, t->trace->plane.normal);
764 // calculate the true fraction
765 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
766 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
767 midf = t1 / (t1 - t2);
768 t->trace->realfraction = bound(0, midf, 1);
770 // calculate the return fraction which is nudged off the surface a bit
771 midf = (t1 - DIST_EPSILON) / (t1 - t2);
772 t->trace->fraction = bound(0, midf, 1);
774 if (collision_prefernudgedfraction.integer)
775 t->trace->realfraction = t->trace->fraction;
777 #if COLLISIONPARANOID >= 3
780 return HULLCHECKSTATE_DONE;
783 //#if COLLISIONPARANOID < 2
784 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
787 mclipnode_t *nodes = t->hull->clipnodes;
788 mplane_t *planes = t->hull->planes;
790 VectorCopy(t->start, point);
793 plane = planes + nodes[num].planenum;
794 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
796 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
797 t->trace->startsupercontents |= num;
798 if (num & SUPERCONTENTS_LIQUIDSMASK)
799 t->trace->inwater = true;
801 t->trace->inopen = true;
802 if (num & t->trace->hitsupercontentsmask)
804 t->trace->allsolid = t->trace->startsolid = true;
805 return HULLCHECKSTATE_SOLID;
809 t->trace->allsolid = t->trace->startsolid = false;
810 return HULLCHECKSTATE_EMPTY;
815 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)
817 // this function currently only supports same size start and end
819 RecursiveHullCheckTraceInfo_t rhc;
821 memset(&rhc, 0, sizeof(rhc));
822 memset(trace, 0, sizeof(trace_t));
824 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
825 rhc.trace->fraction = 1;
826 rhc.trace->realfraction = 1;
827 rhc.trace->allsolid = true;
828 VectorSubtract(boxmaxs, boxmins, boxsize);
830 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
831 else if (model->brush.ismcbsp)
837 vdist = 0; // shut up compiler warning
839 // find the closest hull size (this algorithm probably sucks, a qc field to override it might be in order...)
840 for (i = 1; i < model->brushq1.numhulls; i++)
842 dist = fabs(model->brushq1.hulls[i].clip_size[0] - boxsize[0]) +
843 fabs(model->brushq1.hulls[i].clip_size[1] - boxsize[1]) +
844 fabs(model->brushq1.hulls[i].clip_size[2] - boxsize[2]) * 0.25;
846 if (!vdisti || dist < vdist)
852 rhc.hull = &model->brushq1.hulls[vdisti];
854 else if (model->brush.ishlbsp)
856 // LordHavoc: this has to have a minor tolerance (the .1) because of
857 // minor float precision errors from the box being transformed around
858 if (boxsize[0] < 32.1)
860 if (boxsize[2] < 54) // pick the nearest of 36 or 72
861 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
863 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
866 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
870 // LordHavoc: this has to have a minor tolerance (the .1) because of
871 // minor float precision errors from the box being transformed around
872 if (boxsize[0] < 32.1)
873 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
875 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
877 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
878 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
879 VectorSubtract(rhc.end, rhc.start, rhc.dist);
880 #if COLLISIONPARANOID >= 2
881 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]);
882 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
887 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
888 memset(&testtrace, 0, sizeof(trace_t));
889 rhc.trace = &testtrace;
890 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
891 rhc.trace->fraction = 1;
892 rhc.trace->realfraction = 1;
893 rhc.trace->allsolid = true;
894 VectorCopy(test, rhc.start);
895 VectorCopy(test, rhc.end);
896 VectorClear(rhc.dist);
897 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
898 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
899 if (!trace->startsolid && testtrace.startsolid)
900 Con_Printf(" - ended in solid!\n");
904 if (VectorLength2(rhc.dist))
905 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
907 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
911 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
915 mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
916 mplane_t *planes = model->brushq1.hulls[0].planes;
919 plane = planes + nodes[num].planenum;
920 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
922 return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
925 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)
929 colplanef_t cbox_planes[6];
930 cbox.supercontents = boxsupercontents;
933 cbox.numtriangles = 0;
934 cbox.planes = cbox_planes;
936 cbox.elements = NULL;
944 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];
945 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];
946 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];
947 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];
948 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];
949 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];
950 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
951 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
952 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
953 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
954 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
955 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
956 memset(trace, 0, sizeof(trace_t));
957 trace->hitsupercontentsmask = hitsupercontentsmask;
959 trace->realfraction = 1;
960 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
962 RecursiveHullCheckTraceInfo_t rhc;
963 static hull_t box_hull;
964 static mclipnode_t box_clipnodes[6];
965 static mplane_t box_planes[6];
966 // fill in a default trace
967 memset(&rhc, 0, sizeof(rhc));
968 memset(trace, 0, sizeof(trace_t));
969 //To keep everything totally uniform, bounding boxes are turned into small
970 //BSP trees instead of being compared directly.
971 // create a temp hull from bounding box sizes
972 box_planes[0].dist = cmaxs[0] - mins[0];
973 box_planes[1].dist = cmins[0] - maxs[0];
974 box_planes[2].dist = cmaxs[1] - mins[1];
975 box_planes[3].dist = cmins[1] - maxs[1];
976 box_planes[4].dist = cmaxs[2] - mins[2];
977 box_planes[5].dist = cmins[2] - maxs[2];
978 #if COLLISIONPARANOID >= 3
979 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]);
982 if (box_hull.clipnodes == NULL)
986 //Set up the planes and clipnodes so that the six floats of a bounding box
987 //can just be stored out and get a proper hull_t structure.
989 box_hull.clipnodes = box_clipnodes;
990 box_hull.planes = box_planes;
991 box_hull.firstclipnode = 0;
992 box_hull.lastclipnode = 5;
994 for (i = 0;i < 6;i++)
996 box_clipnodes[i].planenum = i;
1000 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1002 box_clipnodes[i].children[side^1] = i + 1;
1004 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1006 box_planes[i].type = i>>1;
1007 box_planes[i].normal[i>>1] = 1;
1011 // trace a line through the generated clipping hull
1012 //rhc.boxsupercontents = boxsupercontents;
1013 rhc.hull = &box_hull;
1015 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1016 rhc.trace->fraction = 1;
1017 rhc.trace->realfraction = 1;
1018 rhc.trace->allsolid = true;
1019 VectorCopy(start, rhc.start);
1020 VectorCopy(end, rhc.end);
1021 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1022 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1023 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1024 if (rhc.trace->startsupercontents)
1025 rhc.trace->startsupercontents = boxsupercontents;
1029 static int Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
1032 double midf, mid[3];
1038 // find the point distances
1039 mplane_t *plane = node->plane;
1040 if (plane->type < 3)
1042 t1 = p1[plane->type] - plane->dist;
1043 t2 = p2[plane->type] - plane->dist;
1047 t1 = DotProduct (plane->normal, p1) - plane->dist;
1048 t2 = DotProduct (plane->normal, p2) - plane->dist;
1055 node = node->children[1];
1064 node = node->children[0];
1070 midf = t1 / (t1 - t2);
1071 VectorLerp(p1, midf, p2, mid);
1073 // recurse both sides, front side first
1074 // return 2 if empty is followed by solid (hit something)
1075 // do not return 2 if both are solid or both empty,
1076 // or if start is solid and end is empty
1077 // as these degenerate cases usually indicate the eye is in solid and
1078 // should see the target point anyway
1079 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
1082 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
1087 return ((mleaf_t *)node)->clusterindex < 0;
1090 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1092 // this function currently only supports same size start and end
1093 double tracestart[3], traceend[3];
1094 VectorCopy(start, tracestart);
1095 VectorCopy(end, traceend);
1096 return Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend) != 2;
1099 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)
1103 float mid, distz = endz - startz;
1107 return false; // didn't hit anything
1109 switch (node->plane->type)
1112 node = node->children[x < node->plane->dist];
1115 node = node->children[y < node->plane->dist];
1118 side = startz < node->plane->dist;
1119 if ((endz < node->plane->dist) == side)
1121 node = node->children[side];
1124 // found an intersection
1125 mid = node->plane->dist;
1128 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1129 front += startz * node->plane->normal[2];
1130 back += endz * node->plane->normal[2];
1131 side = front < node->plane->dist;
1132 if ((back < node->plane->dist) == side)
1134 node = node->children[side];
1137 // found an intersection
1138 mid = startz + distz * (front - node->plane->dist) / (front - back);
1142 // go down front side
1143 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1144 return true; // hit something
1147 // check for impact on this node
1148 if (node->numsurfaces)
1150 int i, dsi, dti, lmwidth, lmheight;
1152 msurface_t *surface;
1153 unsigned char *lightmap;
1154 int maps, line3, size3;
1157 float scale, w, w00, w01, w10, w11;
1159 surface = model->data_surfaces + node->firstsurface;
1160 for (i = 0;i < node->numsurfaces;i++, surface++)
1162 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1163 continue; // no lightmaps
1165 // location we want to sample in the lightmap
1166 ds = ((x * surface->lightmapinfo->texinfo->vecs[0][0] + y * surface->lightmapinfo->texinfo->vecs[0][1] + mid * surface->lightmapinfo->texinfo->vecs[0][2] + surface->lightmapinfo->texinfo->vecs[0][3]) - surface->lightmapinfo->texturemins[0]) * 0.0625f;
1167 dt = ((x * surface->lightmapinfo->texinfo->vecs[1][0] + y * surface->lightmapinfo->texinfo->vecs[1][1] + mid * surface->lightmapinfo->texinfo->vecs[1][2] + surface->lightmapinfo->texinfo->vecs[1][3]) - surface->lightmapinfo->texturemins[1]) * 0.0625f;
1172 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1173 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1176 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1178 // calculate bilinear interpolation factors
1179 // and also multiply by fixedpoint conversion factors
1182 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1183 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1184 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1185 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1187 // values for pointer math
1188 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1189 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1191 // look up the pixel
1192 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1194 // bilinear filter each lightmap style, and sum them
1195 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1197 scale = r_refdef.lightstylevalue[surface->lightmapinfo->styles[maps]];
1198 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1199 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1200 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1201 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1205 return true; // success
1210 // go down back side
1211 node = node->children[side ^ 1];
1213 distz = endz - startz;
1218 void Mod_Q1BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1220 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1221 VectorSet(diffusenormal, 0, 0, 1);
1223 if (!model->brushq1.lightdata)
1225 VectorSet(ambientcolor, 1, 1, 1);
1226 VectorSet(diffusecolor, 0, 0, 0);
1230 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);
1233 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1236 unsigned char *outstart = out;
1237 while (out < outend)
1241 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));
1251 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));
1254 for (c = *in++;c > 0;c--)
1258 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));
1269 R_Q1BSP_LoadSplitSky
1271 A sky texture is 256*128, with the right side being a masked overlay
1274 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1277 unsigned solidpixels[128*128], alphapixels[128*128];
1279 // allocate a texture pool if we need it
1280 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1281 loadmodel->texturepool = R_AllocTexturePool();
1283 if (bytesperpixel == 4)
1285 for (i = 0;i < 128;i++)
1287 for (j = 0;j < 128;j++)
1289 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1290 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1296 // make an average value for the back to avoid
1297 // a fringe on the top level
1306 for (i = 0;i < 128;i++)
1308 for (j = 0;j < 128;j++)
1310 p = src[i*256 + j + 128];
1311 r += palette_rgb[p][0];
1312 g += palette_rgb[p][1];
1313 b += palette_rgb[p][2];
1316 bgra.b[2] = r/(128*128);
1317 bgra.b[1] = g/(128*128);
1318 bgra.b[0] = b/(128*128);
1320 for (i = 0;i < 128;i++)
1322 for (j = 0;j < 128;j++)
1324 solidpixels[(i*128) + j] = palette_bgra_complete[src[i*256 + j + 128]];
1326 alphapixels[(i*128) + j] = p ? palette_bgra_complete[p] : bgra.i;
1331 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1332 loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1335 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1337 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1338 skinframe_t *skinframe;
1340 texture_t *tx, *tx2, *anims[10], *altanims[10];
1342 unsigned char *data, *mtdata;
1344 char mapname[MAX_QPATH], name[MAX_QPATH];
1346 loadmodel->data_textures = NULL;
1348 // add two slots for notexture walls and notexture liquids
1351 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1352 m->nummiptex = LittleLong (m->nummiptex);
1353 loadmodel->num_textures = m->nummiptex + 2;
1354 loadmodel->num_texturesperskin = loadmodel->num_textures;
1359 loadmodel->num_textures = 2;
1360 loadmodel->num_texturesperskin = loadmodel->num_textures;
1363 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1365 // fill out all slots with notexture
1366 if (cls.state != ca_dedicated)
1367 skinframe = R_SkinFrame_LoadMissing();
1370 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1372 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1375 if (cls.state != ca_dedicated)
1377 tx->numskinframes = 1;
1378 tx->skinframerate = 1;
1379 tx->skinframes[0] = skinframe;
1380 tx->currentskinframe = tx->skinframes[0];
1381 tx->basematerialflags = 0;
1383 if (i == loadmodel->num_textures - 1)
1385 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1386 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1387 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1391 tx->basematerialflags |= MATERIALFLAG_WALL;
1392 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1393 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1395 tx->currentframe = tx;
1397 // clear water settings
1400 tx->refractfactor = 1;
1401 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1402 tx->reflectfactor = 1;
1403 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1408 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1412 s = loadmodel->name;
1413 if (!strncasecmp(s, "maps/", 5))
1415 FS_StripExtension(s, mapname, sizeof(mapname));
1417 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1419 // LordHavoc: mostly rewritten map texture loader
1420 for (i = 0;i < m->nummiptex;i++)
1422 dofs[i] = LittleLong(dofs[i]);
1423 if (r_nosurftextures.integer)
1427 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1430 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1432 // copy name, but only up to 16 characters
1433 // (the output buffer can hold more than this, but the input buffer is
1435 for (j = 0;dmiptex->name[j] && j < 16;j++)
1436 name[j] = dmiptex->name[j];
1441 sprintf(name, "unnamed%i", i);
1442 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1445 mtwidth = LittleLong(dmiptex->width);
1446 mtheight = LittleLong(dmiptex->height);
1448 j = LittleLong(dmiptex->offsets[0]);
1452 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1454 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1457 mtdata = (unsigned char *)dmiptex + j;
1460 if ((mtwidth & 15) || (mtheight & 15))
1461 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1463 // LordHavoc: force all names to lowercase
1464 for (j = 0;name[j];j++)
1465 if (name[j] >= 'A' && name[j] <= 'Z')
1466 name[j] += 'a' - 'A';
1468 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, true, false, false))
1471 tx = loadmodel->data_textures + i;
1472 strlcpy(tx->name, name, sizeof(tx->name));
1473 tx->width = mtwidth;
1474 tx->height = mtheight;
1476 if (tx->name[0] == '*')
1478 if (!strncmp(tx->name, "*lava", 5))
1480 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1481 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1483 else if (!strncmp(tx->name, "*slime", 6))
1485 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1486 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1490 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1491 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1494 else if (!strncmp(tx->name, "sky", 3))
1496 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1497 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1501 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1502 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1505 if (cls.state != ca_dedicated)
1507 // LordHavoc: HL sky textures are entirely different than quake
1508 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1510 if (loadmodel->isworldmodel)
1512 data = loadimagepixelsbgra(tx->name, false, false);
1513 if (data && image_width == 256 && image_height == 128)
1515 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1518 else if (mtdata != NULL)
1519 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1524 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1526 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1529 // did not find external texture, load it from the bsp or wad3
1530 if (loadmodel->brush.ishlbsp)
1532 // internal texture overrides wad
1533 unsigned char *pixels, *freepixels;
1534 pixels = freepixels = NULL;
1536 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1538 pixels = freepixels = W_GetTextureBGRA(tx->name);
1541 tx->width = image_width;
1542 tx->height = image_height;
1543 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1546 Mem_Free(freepixels);
1548 else if (mtdata) // texture included
1549 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1551 // if skinframe is still NULL the "missing" texture will be used
1553 tx->skinframes[0] = skinframe;
1556 tx->basematerialflags = 0;
1557 if (tx->name[0] == '*')
1559 // LordHavoc: some turbulent textures should not be affected by wateralpha
1560 if (strncmp(tx->name,"*lava",5)
1561 && strncmp(tx->name,"*teleport",9)
1562 && strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1563 tx->basematerialflags |= MATERIALFLAG_WATERALPHA | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERSHADER;
1564 tx->basematerialflags |= MATERIALFLAG_WATER | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1566 else if (!strncmp(tx->name, "sky", 3))
1567 tx->basematerialflags |= MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1569 tx->basematerialflags |= MATERIALFLAG_WALL;
1570 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1571 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1573 // start out with no animation
1574 tx->currentframe = tx;
1575 tx->currentskinframe = tx->skinframes[0];
1579 // sequence the animations
1580 for (i = 0;i < m->nummiptex;i++)
1582 tx = loadmodel->data_textures + i;
1583 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1585 if (tx->anim_total[0] || tx->anim_total[1])
1586 continue; // already sequenced
1588 // find the number of frames in the animation
1589 memset(anims, 0, sizeof(anims));
1590 memset(altanims, 0, sizeof(altanims));
1592 for (j = i;j < m->nummiptex;j++)
1594 tx2 = loadmodel->data_textures + j;
1595 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1599 if (num >= '0' && num <= '9')
1600 anims[num - '0'] = tx2;
1601 else if (num >= 'a' && num <= 'j')
1602 altanims[num - 'a'] = tx2;
1604 Con_Printf("Bad animating texture %s\n", tx->name);
1608 for (j = 0;j < 10;j++)
1615 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1618 for (j = 0;j < max;j++)
1622 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1626 for (j = 0;j < altmax;j++)
1630 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1639 // if there is no alternate animation, duplicate the primary
1640 // animation into the alternate
1642 for (k = 0;k < 10;k++)
1643 altanims[k] = anims[k];
1646 // link together the primary animation
1647 for (j = 0;j < max;j++)
1650 tx2->animated = true;
1651 tx2->anim_total[0] = max;
1652 tx2->anim_total[1] = altmax;
1653 for (k = 0;k < 10;k++)
1655 tx2->anim_frames[0][k] = anims[k];
1656 tx2->anim_frames[1][k] = altanims[k];
1660 // if there really is an alternate anim...
1661 if (anims[0] != altanims[0])
1663 // link together the alternate animation
1664 for (j = 0;j < altmax;j++)
1667 tx2->animated = true;
1668 // the primary/alternate are reversed here
1669 tx2->anim_total[0] = altmax;
1670 tx2->anim_total[1] = max;
1671 for (k = 0;k < 10;k++)
1673 tx2->anim_frames[0][k] = altanims[k];
1674 tx2->anim_frames[1][k] = anims[k];
1681 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1684 unsigned char *in, *out, *data, d;
1685 char litfilename[MAX_QPATH];
1686 char dlitfilename[MAX_QPATH];
1687 fs_offset_t filesize;
1688 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1690 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1691 for (i=0; i<l->filelen; i++)
1692 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1694 else if (loadmodel->brush.ismcbsp)
1696 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1697 memcpy(loadmodel->brushq1.lightdata, mod_base + l->fileofs, l->filelen);
1699 else // LordHavoc: bsp version 29 (normal white lighting)
1701 // LordHavoc: hope is not lost yet, check for a .lit file to load
1702 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1703 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1704 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1705 strlcat (litfilename, ".lit", sizeof (litfilename));
1706 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1707 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1710 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1712 i = LittleLong(((int *)data)[1]);
1715 Con_DPrintf("loaded %s\n", litfilename);
1716 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1717 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1719 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1722 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1724 i = LittleLong(((int *)data)[1]);
1727 Con_DPrintf("loaded %s\n", dlitfilename);
1728 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1729 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1730 loadmodel->brushq3.deluxemapping_modelspace = false;
1731 loadmodel->brushq3.deluxemapping = true;
1740 Con_Printf("Unknown .lit file version (%d)\n", i);
1742 else if (filesize == 8)
1743 Con_Print("Empty .lit file, ignoring\n");
1745 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1752 // LordHavoc: oh well, expand the white lighting data
1755 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1756 in = mod_base + l->fileofs;
1757 out = loadmodel->brushq1.lightdata;
1758 for (i = 0;i < l->filelen;i++)
1768 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1770 loadmodel->brushq1.num_compressedpvs = 0;
1771 loadmodel->brushq1.data_compressedpvs = NULL;
1774 loadmodel->brushq1.num_compressedpvs = l->filelen;
1775 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1776 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1779 // used only for HalfLife maps
1780 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1782 char key[128], value[4096];
1787 if (!COM_ParseToken_Simple(&data, false, false))
1789 if (com_token[0] != '{')
1793 if (!COM_ParseToken_Simple(&data, false, false))
1795 if (com_token[0] == '}')
1796 break; // end of worldspawn
1797 if (com_token[0] == '_')
1798 strlcpy(key, com_token + 1, sizeof(key));
1800 strlcpy(key, com_token, sizeof(key));
1801 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1802 key[strlen(key)-1] = 0;
1803 if (!COM_ParseToken_Simple(&data, false, false))
1805 dpsnprintf(value, sizeof(value), "%s", com_token);
1806 if (!strcmp("wad", key)) // for HalfLife maps
1808 if (loadmodel->brush.ishlbsp)
1811 for (i = 0;i < (int)sizeof(value);i++)
1812 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1816 for (;i < (int)sizeof(value);i++)
1818 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1819 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1821 else if (value[i] == ';' || value[i] == 0)
1825 strlcpy(wadname, "textures/", sizeof(wadname));
1826 strlcat(wadname, &value[j], sizeof(wadname));
1827 W_LoadTextureWadFile(wadname, false);
1839 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1841 loadmodel->brush.entities = NULL;
1844 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1845 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1846 if (loadmodel->brush.ishlbsp)
1847 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1851 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1857 in = (dvertex_t *)(mod_base + l->fileofs);
1858 if (l->filelen % sizeof(*in))
1859 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1860 count = l->filelen / sizeof(*in);
1861 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1863 loadmodel->brushq1.vertexes = out;
1864 loadmodel->brushq1.numvertexes = count;
1866 for ( i=0 ; i<count ; i++, in++, out++)
1868 out->position[0] = LittleFloat(in->point[0]);
1869 out->position[1] = LittleFloat(in->point[1]);
1870 out->position[2] = LittleFloat(in->point[2]);
1874 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1875 // can be used for this
1877 int SB_ReadInt (unsigned char **buffer)
1880 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1886 float SB_ReadFloat (unsigned char **buffer)
1894 u.i = SB_ReadInt (buffer);
1898 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1900 unsigned char *index;
1904 index = (unsigned char *)(mod_base + l->fileofs);
1905 if (l->filelen % (48+4*hullinfo->filehulls))
1906 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1908 count = l->filelen / (48+4*hullinfo->filehulls);
1909 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1911 loadmodel->brushq1.submodels = out;
1912 loadmodel->brush.numsubmodels = count;
1914 for (i = 0; i < count; i++, out++)
1916 // spread out the mins / maxs by a pixel
1917 out->mins[0] = SB_ReadFloat (&index) - 1;
1918 out->mins[1] = SB_ReadFloat (&index) - 1;
1919 out->mins[2] = SB_ReadFloat (&index) - 1;
1920 out->maxs[0] = SB_ReadFloat (&index) + 1;
1921 out->maxs[1] = SB_ReadFloat (&index) + 1;
1922 out->maxs[2] = SB_ReadFloat (&index) + 1;
1923 out->origin[0] = SB_ReadFloat (&index);
1924 out->origin[1] = SB_ReadFloat (&index);
1925 out->origin[2] = SB_ReadFloat (&index);
1926 for (j = 0; j < hullinfo->filehulls; j++)
1927 out->headnode[j] = SB_ReadInt (&index);
1928 out->visleafs = SB_ReadInt (&index);
1929 out->firstface = SB_ReadInt (&index);
1930 out->numfaces = SB_ReadInt (&index);
1934 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1940 in = (dedge_t *)(mod_base + l->fileofs);
1941 if (l->filelen % sizeof(*in))
1942 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1943 count = l->filelen / sizeof(*in);
1944 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1946 loadmodel->brushq1.edges = out;
1947 loadmodel->brushq1.numedges = count;
1949 for ( i=0 ; i<count ; i++, in++, out++)
1951 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1952 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1953 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1955 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);
1962 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1966 int i, j, k, count, miptex;
1968 in = (texinfo_t *)(mod_base + l->fileofs);
1969 if (l->filelen % sizeof(*in))
1970 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1971 count = l->filelen / sizeof(*in);
1972 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1974 loadmodel->brushq1.texinfo = out;
1975 loadmodel->brushq1.numtexinfo = count;
1977 for (i = 0;i < count;i++, in++, out++)
1979 for (k = 0;k < 2;k++)
1980 for (j = 0;j < 4;j++)
1981 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1983 miptex = LittleLong(in->miptex);
1984 out->flags = LittleLong(in->flags);
1986 out->texture = NULL;
1987 if (loadmodel->data_textures)
1989 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1990 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1992 out->texture = loadmodel->data_textures + miptex;
1994 if (out->flags & TEX_SPECIAL)
1996 // if texture chosen is NULL or the shader needs a lightmap,
1997 // force to notexture water shader
1998 if (out->texture == NULL || out->texture->basematerialflags & MATERIALFLAG_WALL)
1999 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2003 // if texture chosen is NULL, force to notexture
2004 if (out->texture == NULL)
2005 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2011 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2016 mins[0] = mins[1] = mins[2] = 9999;
2017 maxs[0] = maxs[1] = maxs[2] = -9999;
2019 for (i = 0;i < numverts;i++)
2021 for (j = 0;j < 3;j++, v++)
2031 #define MAX_SUBDIVPOLYTRIANGLES 4096
2032 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2034 static int subdivpolyverts, subdivpolytriangles;
2035 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2036 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2038 static int subdivpolylookupvert(vec3_t v)
2041 for (i = 0;i < subdivpolyverts;i++)
2042 if (subdivpolyvert[i][0] == v[0]
2043 && subdivpolyvert[i][1] == v[1]
2044 && subdivpolyvert[i][2] == v[2])
2046 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2047 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2048 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2049 return subdivpolyverts++;
2052 static void SubdividePolygon(int numverts, float *verts)
2054 int i, i1, i2, i3, f, b, c, p;
2055 vec3_t mins, maxs, front[256], back[256];
2056 float m, *pv, *cv, dist[256], frac;
2059 Host_Error("SubdividePolygon: ran out of verts in buffer");
2061 BoundPoly(numverts, verts, mins, maxs);
2063 for (i = 0;i < 3;i++)
2065 m = (mins[i] + maxs[i]) * 0.5;
2066 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2067 if (maxs[i] - m < 8)
2069 if (m - mins[i] < 8)
2073 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2074 dist[c] = cv[i] - m;
2077 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2081 VectorCopy(pv, front[f]);
2086 VectorCopy(pv, back[b]);
2089 if (dist[p] == 0 || dist[c] == 0)
2091 if ((dist[p] > 0) != (dist[c] > 0) )
2094 frac = dist[p] / (dist[p] - dist[c]);
2095 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2096 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2097 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2103 SubdividePolygon(f, front[0]);
2104 SubdividePolygon(b, back[0]);
2108 i1 = subdivpolylookupvert(verts);
2109 i2 = subdivpolylookupvert(verts + 3);
2110 for (i = 2;i < numverts;i++)
2112 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2114 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2118 i3 = subdivpolylookupvert(verts + i * 3);
2119 subdivpolyindex[subdivpolytriangles][0] = i1;
2120 subdivpolyindex[subdivpolytriangles][1] = i2;
2121 subdivpolyindex[subdivpolytriangles][2] = i3;
2123 subdivpolytriangles++;
2127 //Breaks a polygon up along axial 64 unit
2128 //boundaries so that turbulent and sky warps
2129 //can be done reasonably.
2130 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2136 subdivpolytriangles = 0;
2137 subdivpolyverts = 0;
2138 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2139 if (subdivpolytriangles < 1)
2140 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2142 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2143 mesh->num_vertices = subdivpolyverts;
2144 mesh->num_triangles = subdivpolytriangles;
2145 mesh->vertex = (surfvertex_t *)(mesh + 1);
2146 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2147 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2149 for (i = 0;i < mesh->num_triangles;i++)
2150 for (j = 0;j < 3;j++)
2151 mesh->index[i*3+j] = subdivpolyindex[i][j];
2153 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2155 VectorCopy(subdivpolyvert[i], v->v);
2156 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2157 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2162 /* Maximum size of a single LM */
2163 #define MAX_SINGLE_LM_SIZE 256
2171 struct alloc_lm_state
2174 struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2177 static void init_alloc_lm_state (struct alloc_lm_state* state)
2181 state->currentY = 0;
2182 for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2184 state->rows[r].currentX = 0;
2185 state->rows[r].rowY = -1;
2189 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2191 struct alloc_lm_row* row;
2194 row = &(state->rows[blockheight]);
2195 if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2197 if (state->currentY + blockheight <= totalheight)
2199 row->rowY = state->currentY;
2201 state->currentY += blockheight;
2205 /* See if we can stuff the block into a higher row */
2207 for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2209 if ((state->rows[r].rowY >= 0)
2210 && (state->rows[r].currentX + blockwidth <= totalwidth))
2212 row = &(state->rows[r]);
2216 if (row == NULL) return false;
2220 *outx = row->currentX;
2221 row->currentX += blockwidth;
2226 extern cvar_t gl_max_size;
2227 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2230 msurface_t *surface;
2231 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2232 float texmins[2], texmaxs[2], val;
2233 rtexture_t *lightmaptexture, *deluxemaptexture;
2235 in = (dface_t *)(mod_base + l->fileofs);
2236 if (l->filelen % sizeof(*in))
2237 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2238 count = l->filelen / sizeof(*in);
2239 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2240 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2242 loadmodel->num_surfaces = count;
2246 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2248 numedges = (unsigned short)LittleShort(in->numedges);
2249 totalverts += numedges;
2250 totaltris += numedges - 2;
2253 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2255 lightmaptexture = NULL;
2256 deluxemaptexture = r_texture_blanknormalmap;
2258 lightmapsize = max(256, gl_max_size.integer);
2259 totallightmapsamples = 0;
2263 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2265 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2267 // FIXME: validate edges, texinfo, etc?
2268 firstedge = LittleLong(in->firstedge);
2269 numedges = (unsigned short)LittleShort(in->numedges);
2270 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)
2271 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2272 i = (unsigned short)LittleShort(in->texinfo);
2273 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2274 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2275 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2276 surface->texture = surface->lightmapinfo->texinfo->texture;
2278 planenum = (unsigned short)LittleShort(in->planenum);
2279 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2280 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2282 //surface->flags = surface->texture->flags;
2283 //if (LittleShort(in->side))
2284 // surface->flags |= SURF_PLANEBACK;
2285 //surface->plane = loadmodel->brush.data_planes + planenum;
2287 surface->num_firstvertex = totalverts;
2288 surface->num_vertices = numedges;
2289 surface->num_firsttriangle = totaltris;
2290 surface->num_triangles = numedges - 2;
2291 totalverts += numedges;
2292 totaltris += numedges - 2;
2294 // convert edges back to a normal polygon
2295 for (i = 0;i < surface->num_vertices;i++)
2297 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2300 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2302 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2303 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2304 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2305 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2306 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2307 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2308 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2309 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2312 for (i = 0;i < surface->num_triangles;i++)
2314 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2315 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2316 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2319 // compile additional data about the surface geometry
2320 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);
2321 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);
2322 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2324 // generate surface extents information
2325 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2326 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2327 for (i = 1;i < surface->num_vertices;i++)
2329 for (j = 0;j < 2;j++)
2331 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2332 texmins[j] = min(texmins[j], val);
2333 texmaxs[j] = max(texmaxs[j], val);
2336 for (i = 0;i < 2;i++)
2338 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2339 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2342 smax = surface->lightmapinfo->extents[0] >> 4;
2343 tmax = surface->lightmapinfo->extents[1] >> 4;
2344 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2345 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2348 for (i = 0;i < MAXLIGHTMAPS;i++)
2349 surface->lightmapinfo->styles[i] = in->styles[i];
2350 surface->lightmaptexture = NULL;
2351 surface->deluxemaptexture = r_texture_blanknormalmap;
2352 i = LittleLong(in->lightofs);
2355 surface->lightmapinfo->samples = NULL;
2356 // give non-lightmapped water a 1x white lightmap
2357 if ((surface->texture->basematerialflags & MATERIALFLAG_WATER) && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2359 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2360 surface->lightmapinfo->styles[0] = 0;
2361 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2364 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2365 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2366 else // LordHavoc: white lighting (bsp version 29)
2368 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2369 if (loadmodel->brushq1.nmaplightdata)
2370 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2373 // check if we should apply a lightmap to this
2374 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2376 if (ssize > 256 || tsize > 256)
2377 Host_Error("Bad surface extents");
2379 if (lightmapsize < ssize)
2380 lightmapsize = ssize;
2381 if (lightmapsize < tsize)
2382 lightmapsize = tsize;
2384 totallightmapsamples += ssize*tsize;
2386 // force lightmap upload on first time seeing the surface
2388 // additionally this is used by the later code to see if a
2389 // lightmap is needed on this surface (rather than duplicating the
2391 surface->cached_dlight = true;
2395 // small maps (such as ammo boxes especially) don't need big lightmap
2396 // textures, so this code tries to guess a good size based on
2397 // totallightmapsamples (size of the lightmaps lump basically), as well as
2398 // trying to max out the gl_max_size if there is a lot of lightmap data to
2400 // additionally, never choose a lightmapsize that is smaller than the
2401 // largest surface encountered (as it would fail)
2403 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2406 // now that we've decided the lightmap texture size, we can do the rest
2407 if (cls.state != ca_dedicated)
2409 struct alloc_lm_state allocState;
2411 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2413 int i, iu, iv, lightmapx, lightmapy;
2414 float u, v, ubase, vbase, uscale, vscale;
2416 smax = surface->lightmapinfo->extents[0] >> 4;
2417 tmax = surface->lightmapinfo->extents[1] >> 4;
2418 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2419 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2421 // stainmap for permanent marks on walls
2422 surface->lightmapinfo->stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2424 memset(surface->lightmapinfo->stainsamples, 255, ssize * tsize * 3);
2426 if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2428 // allocate a texture pool if we need it
2429 if (loadmodel->texturepool == NULL)
2430 loadmodel->texturepool = R_AllocTexturePool();
2431 // could not find room, make a new lightmap
2432 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2433 if (loadmodel->brushq1.nmaplightdata)
2434 deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2436 init_alloc_lm_state (&allocState);
2437 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2439 surface->lightmaptexture = lightmaptexture;
2440 surface->deluxemaptexture = deluxemaptexture;
2441 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2442 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2444 uscale = 1.0f / (float)lightmapsize;
2445 vscale = 1.0f / (float)lightmapsize;
2446 ubase = lightmapx * uscale;
2447 vbase = lightmapy * vscale;
2449 for (i = 0;i < surface->num_vertices;i++)
2451 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);
2452 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);
2453 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2454 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2455 // LordHavoc: calc lightmap data offset for vertex lighting to use
2458 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2465 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2468 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2469 node->parent = parent;
2472 // this is a node, recurse to children
2473 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2474 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2475 // combine supercontents of children
2476 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2481 mleaf_t *leaf = (mleaf_t *)node;
2482 // if this is a leaf, calculate supercontents mask from all collidable
2483 // primitives in the leaf (brushes and collision surfaces)
2484 // also flag if the leaf contains any collision surfaces
2485 leaf->combinedsupercontents = 0;
2486 // combine the supercontents values of all brushes in this leaf
2487 for (j = 0;j < leaf->numleafbrushes;j++)
2488 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2489 // check if this leaf contains any collision surfaces (q3 patches)
2490 for (j = 0;j < leaf->numleafsurfaces;j++)
2492 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2493 if (surface->num_collisiontriangles)
2495 leaf->containscollisionsurfaces = true;
2496 leaf->combinedsupercontents |= surface->texture->supercontents;
2502 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2508 in = (dnode_t *)(mod_base + l->fileofs);
2509 if (l->filelen % sizeof(*in))
2510 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2511 count = l->filelen / sizeof(*in);
2512 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2514 loadmodel->brush.data_nodes = out;
2515 loadmodel->brush.num_nodes = count;
2517 for ( i=0 ; i<count ; i++, in++, out++)
2519 for (j=0 ; j<3 ; j++)
2521 out->mins[j] = LittleShort(in->mins[j]);
2522 out->maxs[j] = LittleShort(in->maxs[j]);
2525 p = LittleLong(in->planenum);
2526 out->plane = loadmodel->brush.data_planes + p;
2528 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2529 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2531 for (j=0 ; j<2 ; j++)
2533 // LordHavoc: this code supports broken bsp files produced by
2534 // arguire qbsp which can produce more than 32768 nodes, any value
2535 // below count is assumed to be a node number, any other value is
2536 // assumed to be a leaf number
2537 p = (unsigned short)LittleShort(in->children[j]);
2540 if (p < loadmodel->brush.num_nodes)
2541 out->children[j] = loadmodel->brush.data_nodes + p;
2544 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2545 // map it to the solid leaf
2546 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2551 // note this uses 65535 intentionally, -1 is leaf 0
2553 if (p < loadmodel->brush.num_leafs)
2554 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2557 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2558 // map it to the solid leaf
2559 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2565 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2568 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2574 in = (dleaf_t *)(mod_base + l->fileofs);
2575 if (l->filelen % sizeof(*in))
2576 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2577 count = l->filelen / sizeof(*in);
2578 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2580 loadmodel->brush.data_leafs = out;
2581 loadmodel->brush.num_leafs = count;
2582 // get visleafs from the submodel data
2583 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2584 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2585 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2586 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2588 for ( i=0 ; i<count ; i++, in++, out++)
2590 for (j=0 ; j<3 ; j++)
2592 out->mins[j] = LittleShort(in->mins[j]);
2593 out->maxs[j] = LittleShort(in->maxs[j]);
2596 // FIXME: this function could really benefit from some error checking
2598 out->contents = LittleLong(in->contents);
2600 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2601 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2602 if (out->firstleafsurface < 0 || (unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2604 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);
2605 out->firstleafsurface = NULL;
2606 out->numleafsurfaces = 0;
2609 out->clusterindex = i - 1;
2610 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2611 out->clusterindex = -1;
2613 p = LittleLong(in->visofs);
2614 // ignore visofs errors on leaf 0 (solid)
2615 if (p >= 0 && out->clusterindex >= 0)
2617 if (p >= loadmodel->brushq1.num_compressedpvs)
2618 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2620 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);
2623 for (j = 0;j < 4;j++)
2624 out->ambient_sound_level[j] = in->ambient_level[j];
2626 // FIXME: Insert caustics here
2630 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2634 const unsigned char *pvs;
2635 // check all liquid leafs to see if they can see into empty leafs, if any
2636 // can we can assume this map supports r_wateralpha
2637 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2639 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && (leaf->clusterindex >= 0 && loadmodel->brush.data_pvsclusters))
2641 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2642 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2643 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2650 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2657 in = (dclipnode_t *)(mod_base + l->fileofs);
2658 if (l->filelen % sizeof(*in))
2659 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2660 count = l->filelen / sizeof(*in);
2661 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2663 loadmodel->brushq1.clipnodes = out;
2664 loadmodel->brushq1.numclipnodes = count;
2666 for (i = 1; i < hullinfo->numhulls; i++)
2668 hull = &loadmodel->brushq1.hulls[i];
2669 hull->clipnodes = out;
2670 hull->firstclipnode = 0;
2671 hull->lastclipnode = count-1;
2672 hull->planes = loadmodel->brush.data_planes;
2673 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2674 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2675 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2676 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2677 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2678 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2679 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2682 for (i=0 ; i<count ; i++, out++, in++)
2684 out->planenum = LittleLong(in->planenum);
2685 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2686 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2687 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2688 if (out->children[0] >= count)
2689 out->children[0] -= 65536;
2690 if (out->children[1] >= count)
2691 out->children[1] -= 65536;
2692 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2693 Host_Error("Corrupt clipping hull(out of range planenum)");
2697 //Duplicate the drawing hull structure as a clipping hull
2698 static void Mod_Q1BSP_MakeHull0(void)
2705 hull = &loadmodel->brushq1.hulls[0];
2707 in = loadmodel->brush.data_nodes;
2708 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2710 hull->clipnodes = out;
2711 hull->firstclipnode = 0;
2712 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2713 hull->planes = loadmodel->brush.data_planes;
2715 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2717 out->planenum = in->plane - loadmodel->brush.data_planes;
2718 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2719 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2723 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2728 in = (short *)(mod_base + l->fileofs);
2729 if (l->filelen % sizeof(*in))
2730 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2731 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2732 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2734 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2736 j = (unsigned short) LittleShort(in[i]);
2737 if (j >= loadmodel->num_surfaces)
2738 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2739 loadmodel->brush.data_leafsurfaces[i] = j;
2743 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2748 in = (int *)(mod_base + l->fileofs);
2749 if (l->filelen % sizeof(*in))
2750 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2751 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2752 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2754 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2755 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2759 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2765 in = (dplane_t *)(mod_base + l->fileofs);
2766 if (l->filelen % sizeof(*in))
2767 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2769 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2770 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2772 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2774 out->normal[0] = LittleFloat(in->normal[0]);
2775 out->normal[1] = LittleFloat(in->normal[1]);
2776 out->normal[2] = LittleFloat(in->normal[2]);
2777 out->dist = LittleFloat(in->dist);
2783 static void Mod_Q1BSP_LoadMapBrushes(void)
2787 int submodel, numbrushes;
2788 qboolean firstbrush;
2789 char *text, *maptext;
2790 char mapfilename[MAX_QPATH];
2791 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2792 strlcat (mapfilename, ".map", sizeof (mapfilename));
2793 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2797 if (!COM_ParseToken_Simple(&data, false, false))
2802 if (!COM_ParseToken_Simple(&data, false, false))
2804 if (com_token[0] != '{')
2810 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2813 if (!COM_ParseToken_Simple(&data, false, false))
2815 if (com_token[0] == '}')
2816 break; // end of entity
2817 if (com_token[0] == '{')
2824 if (submodel > loadmodel->brush.numsubmodels)
2826 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2830 model = loadmodel->brush.submodels[submodel];
2837 if (!COM_ParseToken_Simple(&data, false, false))
2839 if (com_token[0] == '}')
2840 break; // end of brush
2841 // each brush face should be this format:
2842 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2843 // FIXME: support hl .map format
2844 for (pointnum = 0;pointnum < 3;pointnum++)
2846 COM_ParseToken_Simple(&data, false, false);
2847 for (componentnum = 0;componentnum < 3;componentnum++)
2849 COM_ParseToken_Simple(&data, false, false);
2850 point[pointnum][componentnum] = atof(com_token);
2852 COM_ParseToken_Simple(&data, false, false);
2854 COM_ParseToken_Simple(&data, false, false);
2855 strlcpy(facetexture, com_token, sizeof(facetexture));
2856 COM_ParseToken_Simple(&data, false, false);
2857 //scroll_s = atof(com_token);
2858 COM_ParseToken_Simple(&data, false, false);
2859 //scroll_t = atof(com_token);
2860 COM_ParseToken_Simple(&data, false, false);
2861 //rotate = atof(com_token);
2862 COM_ParseToken_Simple(&data, false, false);
2863 //scale_s = atof(com_token);
2864 COM_ParseToken_Simple(&data, false, false);
2865 //scale_t = atof(com_token);
2866 TriangleNormal(point[0], point[1], point[2], planenormal);
2867 VectorNormalizeDouble(planenormal);
2868 planedist = DotProduct(point[0], planenormal);
2869 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2879 #define MAX_PORTALPOINTS 64
2881 typedef struct portal_s
2884 mnode_t *nodes[2]; // [0] = front side of plane
2885 struct portal_s *next[2];
2887 double points[3*MAX_PORTALPOINTS];
2888 struct portal_s *chain; // all portals are linked into a list
2892 static portal_t *portalchain;
2899 static portal_t *AllocPortal(void)
2902 p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2903 p->chain = portalchain;
2908 static void FreePortal(portal_t *p)
2913 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2915 // process only nodes (leafs already had their box calculated)
2919 // calculate children first
2920 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2921 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2923 // make combined bounding box from children
2924 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2925 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2926 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2927 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2928 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2929 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2932 static void Mod_Q1BSP_FinalizePortals(void)
2934 int i, j, numportals, numpoints;
2935 portal_t *p, *pnext;
2938 mleaf_t *leaf, *endleaf;
2940 // tally up portal and point counts and recalculate bounding boxes for all
2941 // leafs (because qbsp is very sloppy)
2942 leaf = loadmodel->brush.data_leafs;
2943 endleaf = leaf + loadmodel->brush.num_leafs;
2944 for (;leaf < endleaf;leaf++)
2946 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2947 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2954 // note: this check must match the one below or it will usually corrupt memory
2955 // 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
2956 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2959 numpoints += p->numpoints * 2;
2963 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2964 loadmodel->brush.num_portals = numportals;
2965 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2966 loadmodel->brush.num_portalpoints = numpoints;
2967 // clear all leaf portal chains
2968 for (i = 0;i < loadmodel->brush.num_leafs;i++)
2969 loadmodel->brush.data_leafs[i].portals = NULL;
2970 // process all portals in the global portal chain, while freeing them
2971 portal = loadmodel->brush.data_portals;
2972 point = loadmodel->brush.data_portalpoints;
2979 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2981 // note: this check must match the one above or it will usually corrupt memory
2982 // 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
2983 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2985 // first make the back to front portal(forward portal)
2986 portal->points = point;
2987 portal->numpoints = p->numpoints;
2988 portal->plane.dist = p->plane.dist;
2989 VectorCopy(p->plane.normal, portal->plane.normal);
2990 portal->here = (mleaf_t *)p->nodes[1];
2991 portal->past = (mleaf_t *)p->nodes[0];
2993 for (j = 0;j < portal->numpoints;j++)
2995 VectorCopy(p->points + j*3, point->position);
2998 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
2999 PlaneClassify(&portal->plane);
3001 // link into leaf's portal chain
3002 portal->next = portal->here->portals;
3003 portal->here->portals = portal;
3005 // advance to next portal
3008 // then make the front to back portal(backward portal)
3009 portal->points = point;
3010 portal->numpoints = p->numpoints;
3011 portal->plane.dist = -p->plane.dist;
3012 VectorNegate(p->plane.normal, portal->plane.normal);
3013 portal->here = (mleaf_t *)p->nodes[0];
3014 portal->past = (mleaf_t *)p->nodes[1];
3016 for (j = portal->numpoints - 1;j >= 0;j--)
3018 VectorCopy(p->points + j*3, point->position);
3021 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3022 PlaneClassify(&portal->plane);
3024 // link into leaf's portal chain
3025 portal->next = portal->here->portals;
3026 portal->here->portals = portal;
3028 // advance to next portal
3031 // add the portal's polygon points to the leaf bounding boxes
3032 for (i = 0;i < 2;i++)
3034 leaf = (mleaf_t *)p->nodes[i];
3035 for (j = 0;j < p->numpoints;j++)
3037 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3038 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3039 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3040 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3041 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3042 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3049 // now recalculate the node bounding boxes from the leafs
3050 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
3058 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3061 Host_Error("AddPortalToNodes: NULL front node");
3063 Host_Error("AddPortalToNodes: NULL back node");
3064 if (p->nodes[0] || p->nodes[1])
3065 Host_Error("AddPortalToNodes: already included");
3066 // 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
3068 p->nodes[0] = front;
3069 p->next[0] = (portal_t *)front->portals;
3070 front->portals = (mportal_t *)p;
3073 p->next[1] = (portal_t *)back->portals;
3074 back->portals = (mportal_t *)p;
3079 RemovePortalFromNode
3082 static void RemovePortalFromNodes(portal_t *portal)
3086 void **portalpointer;
3088 for (i = 0;i < 2;i++)
3090 node = portal->nodes[i];
3092 portalpointer = (void **) &node->portals;
3095 t = (portal_t *)*portalpointer;
3097 Host_Error("RemovePortalFromNodes: portal not in leaf");
3101 if (portal->nodes[0] == node)
3103 *portalpointer = portal->next[0];
3104 portal->nodes[0] = NULL;
3106 else if (portal->nodes[1] == node)
3108 *portalpointer = portal->next[1];
3109 portal->nodes[1] = NULL;
3112 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3116 if (t->nodes[0] == node)
3117 portalpointer = (void **) &t->next[0];
3118 else if (t->nodes[1] == node)
3119 portalpointer = (void **) &t->next[1];
3121 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3126 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3127 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3130 mnode_t *front, *back, *other_node;
3131 mplane_t clipplane, *plane;
3132 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3133 int numfrontpoints, numbackpoints;
3134 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3136 // if a leaf, we're done
3140 plane = node->plane;
3142 front = node->children[0];
3143 back = node->children[1];
3145 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3147 // create the new portal by generating a polygon for the node plane,
3148 // and clipping it by all of the other portals(which came from nodes above this one)
3149 nodeportal = AllocPortal();
3150 nodeportal->plane = *plane;
3152 // 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)
3153 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);
3154 nodeportal->numpoints = 4;
3155 side = 0; // shut up compiler warning
3156 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3158 clipplane = portal->plane;
3159 if (portal->nodes[0] == portal->nodes[1])
3160 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3161 if (portal->nodes[0] == node)
3163 else if (portal->nodes[1] == node)
3165 clipplane.dist = -clipplane.dist;
3166 VectorNegate(clipplane.normal, clipplane.normal);
3170 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3172 for (i = 0;i < nodeportal->numpoints*3;i++)
3173 frontpoints[i] = nodeportal->points[i];
3174 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);
3175 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3179 if (nodeportal->numpoints < 3)
3181 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3182 nodeportal->numpoints = 0;
3184 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3186 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3187 nodeportal->numpoints = 0;
3190 AddPortalToNodes(nodeportal, front, back);
3192 // split the portals of this node along this node's plane and assign them to the children of this node
3193 // (migrating the portals downward through the tree)
3194 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3196 if (portal->nodes[0] == portal->nodes[1])
3197 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3198 if (portal->nodes[0] == node)
3200 else if (portal->nodes[1] == node)
3203 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3204 nextportal = portal->next[side];
3205 if (!portal->numpoints)
3208 other_node = portal->nodes[!side];
3209 RemovePortalFromNodes(portal);
3211 // cut the portal into two portals, one on each side of the node plane
3212 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);
3214 if (!numfrontpoints)
3217 AddPortalToNodes(portal, back, other_node);
3219 AddPortalToNodes(portal, other_node, back);
3225 AddPortalToNodes(portal, front, other_node);
3227 AddPortalToNodes(portal, other_node, front);
3231 // the portal is split
3232 splitportal = AllocPortal();
3233 temp = splitportal->chain;
3234 *splitportal = *portal;
3235 splitportal->chain = temp;
3236 for (i = 0;i < numbackpoints*3;i++)
3237 splitportal->points[i] = backpoints[i];
3238 splitportal->numpoints = numbackpoints;
3239 for (i = 0;i < numfrontpoints*3;i++)
3240 portal->points[i] = frontpoints[i];
3241 portal->numpoints = numfrontpoints;
3245 AddPortalToNodes(portal, front, other_node);
3246 AddPortalToNodes(splitportal, back, other_node);
3250 AddPortalToNodes(portal, other_node, front);
3251 AddPortalToNodes(splitportal, other_node, back);
3255 Mod_Q1BSP_RecursiveNodePortals(front);
3256 Mod_Q1BSP_RecursiveNodePortals(back);
3259 static void Mod_Q1BSP_MakePortals(void)
3262 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3263 Mod_Q1BSP_FinalizePortals();
3266 //Returns PVS data for a given point
3267 //(note: can return NULL)
3268 static unsigned char *Mod_Q1BSP_GetPVS(model_t *model, const vec3_t p)
3271 node = model->brush.data_nodes;
3273 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3274 if (((mleaf_t *)node)->clusterindex >= 0)
3275 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3280 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbytes, mnode_t *node)
3284 float d = PlaneDiff(org, node->plane);
3286 node = node->children[0];
3287 else if (d < -radius)
3288 node = node->children[1];
3291 // go down both sides
3292 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3293 node = node->children[1];
3296 // if this leaf is in a cluster, accumulate the pvs bits
3297 if (((mleaf_t *)node)->clusterindex >= 0)
3300 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3301 for (i = 0;i < pvsbytes;i++)
3302 pvsbuffer[i] |= pvs[i];
3306 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3307 //of the given point.
3308 static int Mod_Q1BSP_FatPVS(model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3310 int bytes = model->brush.num_pvsclusterbytes;
3311 bytes = min(bytes, pvsbufferlength);
3312 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3314 memset(pvsbuffer, 0xFF, bytes);
3318 memset(pvsbuffer, 0, bytes);
3319 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3323 static void Mod_Q1BSP_RoundUpToHullSize(model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3328 VectorSubtract(inmaxs, inmins, size);
3329 if (cmodel->brush.ismcbsp)
3332 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3333 else if (size[2] < 48) // pick the nearest of 40 or 56
3334 hull = &cmodel->brushq1.hulls[2]; // 16x16x40
3336 hull = &cmodel->brushq1.hulls[1]; // 16x16x56
3338 else if (cmodel->brush.ishlbsp)
3341 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3342 else if (size[0] <= 32)
3344 if (size[2] < 54) // pick the nearest of 36 or 72
3345 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3347 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3350 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3355 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3356 else if (size[0] <= 32)
3357 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3359 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3361 VectorCopy(inmins, outmins);
3362 VectorAdd(inmins, hull->clip_size, outmaxs);
3365 void Mod_Q1BSP_Load(model_t *mod, void *buffer, void *bufferend)
3370 mempool_t *mainmempool;
3371 float dist, modelyawradius, modelradius, *vec;
3372 msurface_t *surface;
3373 int numshadowmeshtriangles;
3375 hullinfo_t hullinfo;
3376 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3377 model_brush_lightstyleinfo_t styleinfo[256];
3378 unsigned char *datapointer;
3380 mod->modeldatatypestring = "Q1BSP";
3382 mod->type = mod_brushq1;
3384 if (!memcmp (buffer, "MCBSPpad", 8))
3386 unsigned char *index;
3388 mod->brush.ismcbsp = true;
3389 mod->brush.ishlbsp = false;
3391 mod_base = (unsigned char*)buffer;
3395 i = SB_ReadInt (&index);
3396 if (i != MCBSPVERSION)
3397 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i)", mod->name, i, MCBSPVERSION);
3400 hullinfo.numhulls = SB_ReadInt (&index);
3401 hullinfo.filehulls = hullinfo.numhulls;
3402 mod->brushq1.numhulls = hullinfo.numhulls;
3404 VectorClear (hullinfo.hullsizes[0][0]);
3405 VectorClear (hullinfo.hullsizes[0][1]);
3406 for (i = 1; i < hullinfo.numhulls; i++)
3408 hullinfo.hullsizes[i][0][0] = SB_ReadFloat (&index);
3409 hullinfo.hullsizes[i][0][1] = SB_ReadFloat (&index);
3410 hullinfo.hullsizes[i][0][2] = SB_ReadFloat (&index);
3411 hullinfo.hullsizes[i][1][0] = SB_ReadFloat (&index);
3412 hullinfo.hullsizes[i][1][1] = SB_ReadFloat (&index);
3413 hullinfo.hullsizes[i][1][2] = SB_ReadFloat (&index);
3417 _header.version = 0;
3418 for (i = 0; i < HEADER_LUMPS; i++)
3420 _header.lumps[i].fileofs = SB_ReadInt (&index);
3421 _header.lumps[i].filelen = SB_ReadInt (&index);
3428 header = (dheader_t *)buffer;
3430 i = LittleLong(header->version);
3431 if (i != BSPVERSION && i != 30)
3432 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3433 mod->brush.ishlbsp = i == 30;
3434 mod->brush.ismcbsp = false;
3436 // fill in hull info
3437 VectorClear (hullinfo.hullsizes[0][0]);
3438 VectorClear (hullinfo.hullsizes[0][1]);
3439 if (mod->brush.ishlbsp)
3441 mod->modeldatatypestring = "HLBSP";
3443 hullinfo.numhulls = 4;
3444 hullinfo.filehulls = 4;
3445 mod->brushq1.numhulls = 4;
3446 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3447 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3448 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3449 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3450 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3451 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3455 hullinfo.numhulls = 3;
3456 hullinfo.filehulls = 4;
3457 mod->brushq1.numhulls = 3;
3458 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3459 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3460 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3461 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3465 mod_base = (unsigned char*)buffer;
3466 for (i = 0; i < HEADER_LUMPS; i++)
3468 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3469 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3473 mod->soundfromcenter = true;
3474 mod->TraceBox = Mod_Q1BSP_TraceBox;
3475 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3476 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3477 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3478 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3479 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3480 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3481 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3482 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3483 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3484 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3485 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3486 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3487 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3488 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3489 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3491 if (loadmodel->isworldmodel)
3493 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3494 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
3499 mod->brush.qw_md4sum = 0;
3500 mod->brush.qw_md4sum2 = 0;
3501 for (i = 0;i < HEADER_LUMPS;i++)
3503 if (i == LUMP_ENTITIES)
3505 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3506 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3508 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3511 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3512 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3513 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3514 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3515 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3516 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3517 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3518 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3519 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3520 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3521 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3522 // load submodels before leafs because they contain the number of vis leafs
3523 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3524 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3525 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3526 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3528 // check if the map supports transparent water rendering
3529 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3531 if (mod->brushq1.data_compressedpvs)
3532 Mem_Free(mod->brushq1.data_compressedpvs);
3533 mod->brushq1.data_compressedpvs = NULL;
3534 mod->brushq1.num_compressedpvs = 0;
3536 Mod_Q1BSP_MakeHull0();
3537 Mod_Q1BSP_MakePortals();
3539 mod->numframes = 2; // regular and alternate animation
3542 mainmempool = mod->mempool;
3544 // make a single combined shadow mesh to allow optimized shadow volume creation
3545 numshadowmeshtriangles = 0;
3546 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3548 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3549 numshadowmeshtriangles += surface->num_triangles;
3551 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3552 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3553 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));
3554 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3555 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3557 if (loadmodel->brush.numsubmodels)
3558 loadmodel->brush.submodels = (model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(model_t *));
3560 // LordHavoc: to clear the fog around the original quake submodel code, I
3562 // first of all, some background info on the submodels:
3563 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3564 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3565 // now the weird for loop itself:
3566 // the loop functions in an odd way, on each iteration it sets up the
3567 // current 'mod' model (which despite the confusing code IS the model of
3568 // the number i), at the end of the loop it duplicates the model to become
3569 // the next submodel, and loops back to set up the new submodel.
3571 // LordHavoc: now the explanation of my sane way (which works identically):
3572 // set up the world model, then on each submodel copy from the world model
3573 // and set up the submodel with the respective model info.
3574 totalstylesurfaces = 0;
3576 for (i = 0;i < mod->brush.numsubmodels;i++)
3578 memset(stylecounts, 0, sizeof(stylecounts));
3579 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3581 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3582 for (j = 0;j < MAXLIGHTMAPS;j++)
3583 stylecounts[surface->lightmapinfo->styles[j]]++;
3585 for (k = 0;k < 255;k++)
3589 totalstylesurfaces += stylecounts[k];
3592 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3593 for (i = 0;i < mod->brush.numsubmodels;i++)
3595 // LordHavoc: this code was originally at the end of this loop, but
3596 // has been transformed to something more readable at the start here.
3601 // LordHavoc: only register submodels if it is the world
3602 // (prevents external bsp models from replacing world submodels with
3604 if (!loadmodel->isworldmodel)
3606 // duplicate the basic information
3607 sprintf(name, "*%i", i);
3608 mod = Mod_FindName(name);
3609 // copy the base model to this one
3611 // rename the clone back to its proper name
3612 strlcpy(mod->name, name, sizeof(mod->name));
3613 // textures and memory belong to the main model
3614 mod->texturepool = NULL;
3615 mod->mempool = NULL;
3618 mod->brush.submodel = i;
3620 if (loadmodel->brush.submodels)
3621 loadmodel->brush.submodels[i] = mod;
3623 bm = &mod->brushq1.submodels[i];
3625 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3626 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3628 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3629 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3632 mod->firstmodelsurface = bm->firstface;
3633 mod->nummodelsurfaces = bm->numfaces;
3635 // make the model surface list (used by shadowing/lighting)
3636 mod->surfacelist = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3637 for (j = 0;j < mod->nummodelsurfaces;j++)
3638 mod->surfacelist[j] = mod->firstmodelsurface + j;
3640 // this gets altered below if sky or water is used
3641 mod->DrawSky = NULL;
3642 mod->DrawAddWaterPlanes = NULL;
3643 mod->Draw = R_Q1BSP_Draw;
3644 mod->DrawDepth = R_Q1BSP_DrawDepth;
3645 mod->DrawDebug = R_Q1BSP_DrawDebug;
3646 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3647 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3648 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3649 mod->DrawLight = R_Q1BSP_DrawLight;
3652 mod->brush.TraceLineOfSight = NULL;
3653 mod->brush.GetPVS = NULL;
3654 mod->brush.FatPVS = NULL;
3655 mod->brush.BoxTouchingPVS = NULL;
3656 mod->brush.BoxTouchingLeafPVS = NULL;
3657 mod->brush.BoxTouchingVisibleLeafs = NULL;
3658 mod->brush.FindBoxClusters = NULL;
3659 mod->brush.LightPoint = NULL;
3660 mod->brush.AmbientSoundLevelsForPoint = NULL;
3662 if (mod->nummodelsurfaces)
3664 // LordHavoc: calculate bmodel bounding box rather than trusting what it says
3665 mod->normalmins[0] = mod->normalmins[1] = mod->normalmins[2] = 1000000000.0f;
3666 mod->normalmaxs[0] = mod->normalmaxs[1] = mod->normalmaxs[2] = -1000000000.0f;
3669 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3671 // we only need to have a drawsky function if it is used(usually only on world model)
3672 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3673 mod->DrawSky = R_Q1BSP_DrawSky;
3674 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3675 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3676 // calculate bounding shapes
3677 for (k = 0, vec = (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex);k < surface->num_vertices;k++, vec += 3)
3679 if (mod->normalmins[0] > vec[0]) mod->normalmins[0] = vec[0];
3680 if (mod->normalmins[1] > vec[1]) mod->normalmins[1] = vec[1];
3681 if (mod->normalmins[2] > vec[2]) mod->normalmins[2] = vec[2];
3682 if (mod->normalmaxs[0] < vec[0]) mod->normalmaxs[0] = vec[0];
3683 if (mod->normalmaxs[1] < vec[1]) mod->normalmaxs[1] = vec[1];
3684 if (mod->normalmaxs[2] < vec[2]) mod->normalmaxs[2] = vec[2];
3685 dist = vec[0]*vec[0]+vec[1]*vec[1];
3686 if (modelyawradius < dist)
3687 modelyawradius = dist;
3688 dist += vec[2]*vec[2];
3689 if (modelradius < dist)
3693 modelyawradius = sqrt(modelyawradius);
3694 modelradius = sqrt(modelradius);
3695 mod->yawmins[0] = mod->yawmins[1] = - (mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius);
3696 mod->yawmins[2] = mod->normalmins[2];
3697 mod->yawmaxs[2] = mod->normalmaxs[2];
3698 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3699 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3700 mod->radius = modelradius;
3701 mod->radius2 = modelradius * modelradius;
3703 // build lightstyle update chains
3704 // (used to rapidly mark surface->cached_dlight on many surfaces
3705 // when d_lightstylevalue changes)
3706 memset(stylecounts, 0, sizeof(stylecounts));
3707 for (k = 0;k < mod->nummodelsurfaces;k++)
3709 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3710 for (j = 0;j < MAXLIGHTMAPS;j++)
3711 stylecounts[surface->lightmapinfo->styles[j]]++;
3713 mod->brushq1.num_lightstyles = 0;
3714 for (k = 0;k < 255;k++)
3718 styleinfo[mod->brushq1.num_lightstyles].style = k;
3719 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3720 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3721 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3722 remapstyles[k] = mod->brushq1.num_lightstyles;
3723 mod->brushq1.num_lightstyles++;
3726 for (k = 0;k < mod->nummodelsurfaces;k++)
3728 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3729 for (j = 0;j < MAXLIGHTMAPS;j++)
3731 if (surface->lightmapinfo->styles[j] != 255)
3733 int r = remapstyles[surface->lightmapinfo->styles[j]];
3734 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3738 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3739 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3743 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3744 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3746 //mod->brushq1.num_visleafs = bm->visleafs;
3749 Mod_Q1BSP_LoadMapBrushes();
3751 //Mod_Q1BSP_ProcessLightList();
3753 if (developer.integer >= 10)
3754 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);
3757 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3761 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3768 in = (void *)(mod_base + l->fileofs);
3769 if (l->filelen % sizeof(*in))
3770 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3771 count = l->filelen / sizeof(*in);
3772 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3775 loadmodel->num = count;
3777 for (i = 0;i < count;i++, in++, out++)
3783 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3790 in = (void *)(mod_base + l->fileofs);
3791 if (l->filelen % sizeof(*in))
3792 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3793 count = l->filelen / sizeof(*in);
3794 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3797 loadmodel->num = count;
3799 for (i = 0;i < count;i++, in++, out++)
3805 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3812 in = (void *)(mod_base + l->fileofs);
3813 if (l->filelen % sizeof(*in))
3814 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3815 count = l->filelen / sizeof(*in);
3816 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3819 loadmodel->num = count;
3821 for (i = 0;i < count;i++, in++, out++)
3827 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3834 in = (void *)(mod_base + l->fileofs);
3835 if (l->filelen % sizeof(*in))
3836 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3837 count = l->filelen / sizeof(*in);
3838 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3841 loadmodel->num = count;
3843 for (i = 0;i < count;i++, in++, out++)
3849 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3856 in = (void *)(mod_base + l->fileofs);
3857 if (l->filelen % sizeof(*in))
3858 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3859 count = l->filelen / sizeof(*in);
3860 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3863 loadmodel->num = count;
3865 for (i = 0;i < count;i++, in++, out++)
3871 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3878 in = (void *)(mod_base + l->fileofs);
3879 if (l->filelen % sizeof(*in))
3880 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3881 count = l->filelen / sizeof(*in);
3882 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3885 loadmodel->num = count;
3887 for (i = 0;i < count;i++, in++, out++)
3893 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3900 in = (void *)(mod_base + l->fileofs);
3901 if (l->filelen % sizeof(*in))
3902 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3903 count = l->filelen / sizeof(*in);
3904 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3907 loadmodel->num = count;
3909 for (i = 0;i < count;i++, in++, out++)
3915 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3922 in = (void *)(mod_base + l->fileofs);
3923 if (l->filelen % sizeof(*in))
3924 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3925 count = l->filelen / sizeof(*in);
3926 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3929 loadmodel->num = count;
3931 for (i = 0;i < count;i++, in++, out++)
3937 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3944 in = (void *)(mod_base + l->fileofs);
3945 if (l->filelen % sizeof(*in))
3946 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3947 count = l->filelen / sizeof(*in);
3948 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3951 loadmodel->num = count;
3953 for (i = 0;i < count;i++, in++, out++)
3959 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3966 in = (void *)(mod_base + l->fileofs);
3967 if (l->filelen % sizeof(*in))
3968 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3969 count = l->filelen / sizeof(*in);
3970 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3973 loadmodel->num = count;
3975 for (i = 0;i < count;i++, in++, out++)
3981 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3988 in = (void *)(mod_base + l->fileofs);
3989 if (l->filelen % sizeof(*in))
3990 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3991 count = l->filelen / sizeof(*in);
3992 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3995 loadmodel->num = count;
3997 for (i = 0;i < count;i++, in++, out++)
4003 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
4010 in = (void *)(mod_base + l->fileofs);
4011 if (l->filelen % sizeof(*in))
4012 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
4013 count = l->filelen / sizeof(*in);
4014 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4017 loadmodel->num = count;
4019 for (i = 0;i < count;i++, in++, out++)
4025 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4032 in = (void *)(mod_base + l->fileofs);
4033 if (l->filelen % sizeof(*in))
4034 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4035 count = l->filelen / sizeof(*in);
4036 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4039 loadmodel->num = count;
4041 for (i = 0;i < count;i++, in++, out++)
4047 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4054 in = (void *)(mod_base + l->fileofs);
4055 if (l->filelen % sizeof(*in))
4056 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4057 count = l->filelen / sizeof(*in);
4058 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4061 loadmodel->num = count;
4063 for (i = 0;i < count;i++, in++, out++)
4069 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4076 in = (void *)(mod_base + l->fileofs);
4077 if (l->filelen % sizeof(*in))
4078 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4079 count = l->filelen / sizeof(*in);
4080 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4083 loadmodel->num = count;
4085 for (i = 0;i < count;i++, in++, out++)
4091 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4098 in = (void *)(mod_base + l->fileofs);
4099 if (l->filelen % sizeof(*in))
4100 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4101 count = l->filelen / sizeof(*in);
4102 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4105 loadmodel->num = count;
4107 for (i = 0;i < count;i++, in++, out++)
4113 static void Mod_Q2BSP_LoadModels(lump_t *l)
4120 in = (void *)(mod_base + l->fileofs);
4121 if (l->filelen % sizeof(*in))
4122 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4123 count = l->filelen / sizeof(*in);
4124 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4127 loadmodel->num = count;
4129 for (i = 0;i < count;i++, in++, out++)
4135 void static Mod_Q2BSP_Load(model_t *mod, void *buffer, void *bufferend)
4138 q2dheader_t *header;
4140 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4142 mod->modeldatatypestring = "Q2BSP";
4144 mod->type = mod_brushq2;
4146 header = (q2dheader_t *)buffer;
4148 i = LittleLong(header->version);
4149 if (i != Q2BSPVERSION)
4150 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4151 mod->brush.ishlbsp = false;
4152 mod->brush.ismcbsp = false;
4153 if (loadmodel->isworldmodel)
4155 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
4156 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
4159 mod_base = (unsigned char *)header;
4161 // swap all the lumps
4162 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4163 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4165 mod->brush.qw_md4sum = 0;
4166 mod->brush.qw_md4sum2 = 0;
4167 for (i = 0;i < Q2HEADER_LUMPS;i++)
4169 if (i == Q2LUMP_ENTITIES)
4171 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4172 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4174 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4177 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4178 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4179 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4180 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4181 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4182 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4183 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4184 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4185 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4186 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4187 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4188 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4189 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4190 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4191 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4192 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4193 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4194 // LordHavoc: must go last because this makes the submodels
4195 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4198 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents);
4199 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents);
4201 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4204 char key[128], value[MAX_INPUTLINE];
4206 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4207 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4208 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4211 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
4212 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4213 data = loadmodel->brush.entities;
4214 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4215 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4219 if (!COM_ParseToken_Simple(&data, false, false))
4221 if (com_token[0] == '}')
4222 break; // end of worldspawn
4223 if (com_token[0] == '_')
4224 strlcpy(key, com_token + 1, sizeof(key));
4226 strlcpy(key, com_token, sizeof(key));
4227 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4228 key[strlen(key)-1] = 0;
4229 if (!COM_ParseToken_Simple(&data, false, false))
4231 strlcpy(value, com_token, sizeof(value));
4232 if (!strcmp("gridsize", key))
4234 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4235 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4241 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4247 in = (q3dtexture_t *)(mod_base + l->fileofs);
4248 if (l->filelen % sizeof(*in))
4249 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4250 count = l->filelen / sizeof(*in);
4251 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4253 loadmodel->data_textures = out;
4254 loadmodel->num_textures = count;
4255 loadmodel->num_texturesperskin = loadmodel->num_textures;
4257 for (i = 0;i < count;i++)
4259 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4260 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4261 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4264 if (cls.state == ca_dedicated)
4268 for (i = 0;i < count;i++, in++, out++)
4269 if (!Mod_LoadTextureFromQ3Shader(out, out->name, false, true, false))
4272 Con_DPrintf("%s: %i textures missing shaders\n", loadmodel->name, c);
4275 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4281 in = (q3dplane_t *)(mod_base + l->fileofs);
4282 if (l->filelen % sizeof(*in))
4283 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4284 count = l->filelen / sizeof(*in);
4285 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4287 loadmodel->brush.data_planes = out;
4288 loadmodel->brush.num_planes = count;
4290 for (i = 0;i < count;i++, in++, out++)
4292 out->normal[0] = LittleFloat(in->normal[0]);
4293 out->normal[1] = LittleFloat(in->normal[1]);
4294 out->normal[2] = LittleFloat(in->normal[2]);
4295 out->dist = LittleFloat(in->dist);
4300 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4303 q3mbrushside_t *out;
4306 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4307 if (l->filelen % sizeof(*in))
4308 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4309 count = l->filelen / sizeof(*in);
4310 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4312 loadmodel->brush.data_brushsides = out;
4313 loadmodel->brush.num_brushsides = count;
4315 for (i = 0;i < count;i++, in++, out++)
4317 n = LittleLong(in->planeindex);
4318 if (n < 0 || n >= loadmodel->brush.num_planes)
4319 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4320 out->plane = loadmodel->brush.data_planes + n;
4321 n = LittleLong(in->textureindex);
4322 if (n < 0 || n >= loadmodel->num_textures)
4323 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4324 out->texture = loadmodel->data_textures + n;
4328 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4332 int i, j, n, c, count, maxplanes;
4333 colplanef_t *planes;
4335 in = (q3dbrush_t *)(mod_base + l->fileofs);
4336 if (l->filelen % sizeof(*in))
4337 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4338 count = l->filelen / sizeof(*in);
4339 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4341 loadmodel->brush.data_brushes = out;
4342 loadmodel->brush.num_brushes = count;
4347 for (i = 0;i < count;i++, in++, out++)
4349 n = LittleLong(in->firstbrushside);
4350 c = LittleLong(in->numbrushsides);
4351 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4352 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4353 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4354 out->numbrushsides = c;
4355 n = LittleLong(in->textureindex);
4356 if (n < 0 || n >= loadmodel->num_textures)
4357 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4358 out->texture = loadmodel->data_textures + n;
4360 // make a list of mplane_t structs to construct a colbrush from
4361 if (maxplanes < out->numbrushsides)
4363 maxplanes = out->numbrushsides;
4366 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4368 for (j = 0;j < out->numbrushsides;j++)
4370 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4371 planes[j].dist = out->firstbrushside[j].plane->dist;
4372 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4373 planes[j].texture = out->firstbrushside[j].texture;
4375 // make the colbrush from the planes
4376 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4382 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4388 in = (q3deffect_t *)(mod_base + l->fileofs);
4389 if (l->filelen % sizeof(*in))
4390 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4391 count = l->filelen / sizeof(*in);
4392 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4394 loadmodel->brushq3.data_effects = out;
4395 loadmodel->brushq3.num_effects = count;
4397 for (i = 0;i < count;i++, in++, out++)
4399 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4400 n = LittleLong(in->brushindex);
4401 if (n >= loadmodel->brush.num_brushes)
4403 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4406 out->brushindex = n;
4407 out->unknown = LittleLong(in->unknown);
4411 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4416 in = (q3dvertex_t *)(mod_base + l->fileofs);
4417 if (l->filelen % sizeof(*in))
4418 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4419 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4420 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4421 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4422 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4423 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4424 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4426 for (i = 0;i < count;i++, in++)
4428 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4429 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4430 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4431 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4432 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4433 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4434 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4435 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4436 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4437 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4438 // svector/tvector are calculated later in face loading
4439 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4440 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4441 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4442 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4446 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4452 in = (int *)(mod_base + l->fileofs);
4453 if (l->filelen % sizeof(int[3]))
4454 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4455 count = l->filelen / sizeof(*in);
4456 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4458 loadmodel->brushq3.num_triangles = count / 3;
4459 loadmodel->brushq3.data_element3i = out;
4461 for (i = 0;i < count;i++, in++, out++)
4463 *out = LittleLong(*in);
4464 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4466 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4472 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4475 int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4477 unsigned char convertedpixels[128*128*4];
4481 if (cls.state == ca_dedicated)
4483 in = (q3dlightmap_t *)(mod_base + l->fileofs);
4484 if (l->filelen % sizeof(*in))
4485 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4486 count = l->filelen / sizeof(*in);
4487 loadmodel->brushq3.num_originallightmaps = count;
4489 // now check the surfaces to see if any of them index an odd numbered
4490 // lightmap, if so this is not a deluxemapped bsp file
4492 // also check what lightmaps are actually used, because q3map2 sometimes
4493 // (always?) makes an unused one at the end, which
4494 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4495 // reason when only one lightmap is used, which can throw off the
4496 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4497 // to see if the second lightmap is blank, if so it is not deluxemapped.
4498 loadmodel->brushq3.deluxemapping = !(count & 1);
4499 loadmodel->brushq3.deluxemapping_modelspace = true;
4501 if (loadmodel->brushq3.deluxemapping)
4503 int facecount = faceslump->filelen / sizeof(q3dface_t);
4504 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4505 for (i = 0;i < facecount;i++)
4507 j = LittleLong(faces[i].lightmapindex);
4510 endlightmap = max(endlightmap, j + 1);
4511 if ((j & 1) || j + 1 >= count)
4513 loadmodel->brushq3.deluxemapping = false;
4520 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4521 // reason when only one lightmap is used, which can throw off the
4522 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4523 // to see if the second lightmap is blank, if so it is not deluxemapped.
4525 // further research has shown q3map2 sometimes creates a deluxemap and two
4526 // blank lightmaps, which must be handled properly as well
4527 if (endlightmap == 1 && count > 1)
4530 for (i = 0;i < 128*128*3;i++)
4535 // all pixels in the unused lightmap were black...
4536 loadmodel->brushq3.deluxemapping = false;
4540 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4542 // figure out what the most reasonable merge power is within limits
4543 loadmodel->brushq3.num_lightmapmergepower = 0;
4544 for (power = 1;power <= mod_q3bsp_lightmapmergepower.integer && (128 << power) <= gl_max_texture_size && (1 << (power * 2)) < 4 * (count >> loadmodel->brushq3.deluxemapping);power++)
4545 loadmodel->brushq3.num_lightmapmergepower = power;
4546 loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4548 loadmodel->brushq3.num_mergedlightmaps = ((count >> loadmodel->brushq3.deluxemapping) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4549 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4550 if (loadmodel->brushq3.deluxemapping)
4551 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4553 // allocate a texture pool if we need it
4554 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4555 loadmodel->texturepool = R_AllocTexturePool();
4557 power = loadmodel->brushq3.num_lightmapmergepower;
4559 mask = (1 << power) - 1;
4560 for (i = 0;i < count;i++)
4562 // figure out which merged lightmap texture this fits into
4563 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4564 for (k = 0;k < 128*128;k++)
4566 convertedpixels[k*4+2] = in[i].rgb[k*3+0];
4567 convertedpixels[k*4+1] = in[i].rgb[k*3+1];
4568 convertedpixels[k*4+0] = in[i].rgb[k*3+2];
4569 convertedpixels[k*4+3] = 255;
4571 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4573 // if the lightmap has not been allocated yet, create it
4574 if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4576 // create a lightmap only as large as necessary to hold the
4577 // remaining 128x128 blocks
4578 // if there are multiple merged lightmap textures then they will
4579 // all be full size except the last one which may be smaller
4580 // because it only needs to the remaining blocks, and it will often
4581 // be odd sizes like 2048x512 due to only being 25% full or so.
4582 j = (count >> loadmodel->brushq3.deluxemapping) - (lightmapindex << power2);
4583 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4585 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4587 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);
4588 loadmodel->brushq3.data_lightmaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), mergewidth * 128, mergeheight * 128, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), NULL);
4589 if (loadmodel->brushq3.data_deluxemaps)
4590 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), mergewidth * 128, mergeheight * 128, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), NULL);
4592 mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / 128;
4593 mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / 128;
4594 j = (i >> loadmodel->brushq3.deluxemapping) & ((1 << power2) - 1);
4595 if (loadmodel->brushq3.deluxemapping && (i & 1))
4596 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * 128, (j / mergewidth) * 128, 128, 128);
4598 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * 128, (j / mergewidth) * 128, 128, 128);
4602 // figure out which merged lightmap texture this fits into
4603 if (loadmodel->brushq3.deluxemapping && (i & 1))
4604 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), 128, 128, convertedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), NULL);
4606 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), 128, 128, convertedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), NULL);
4611 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4613 q3dface_t *in, *oldin;
4614 msurface_t *out, *oldout;
4615 int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, numvertices, numtriangles;
4616 float lightmaptcbase[2], lightmaptcscale[2];
4617 //int *originalelement3i;
4618 //int *originalneighbor3i;
4619 float *originalvertex3f;
4620 //float *originalsvector3f;
4621 //float *originaltvector3f;
4622 float *originalnormal3f;
4623 float *originalcolor4f;
4624 float *originaltexcoordtexture2f;
4625 float *originaltexcoordlightmap2f;
4628 in = (q3dface_t *)(mod_base + l->fileofs);
4629 if (l->filelen % sizeof(*in))
4630 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4631 count = l->filelen / sizeof(*in);
4632 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4634 loadmodel->data_surfaces = out;
4635 loadmodel->num_surfaces = count;
4643 for (;i < count;i++, in++, out++)
4645 // check face type first
4646 type = LittleLong(in->type);
4647 if (type != Q3FACETYPE_POLYGON
4648 && type != Q3FACETYPE_PATCH
4649 && type != Q3FACETYPE_MESH
4650 && type != Q3FACETYPE_FLARE)
4652 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4656 n = LittleLong(in->textureindex);
4657 if (n < 0 || n >= loadmodel->num_textures)
4659 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4662 out->texture = loadmodel->data_textures + n;
4663 n = LittleLong(in->effectindex);
4664 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4666 if (developer.integer >= 100)
4667 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4673 out->effect = loadmodel->brushq3.data_effects + n;
4675 if (cls.state != ca_dedicated)
4677 out->lightmaptexture = NULL;
4678 out->deluxemaptexture = r_texture_blanknormalmap;
4679 n = LittleLong(in->lightmapindex);
4682 else if (n >= loadmodel->brushq3.num_originallightmaps)
4684 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4689 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4690 if (loadmodel->brushq3.deluxemapping)
4691 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4695 firstvertex = LittleLong(in->firstvertex);
4696 numvertices = LittleLong(in->numvertices);
4697 firstelement = LittleLong(in->firstelement);
4698 numtriangles = LittleLong(in->numelements) / 3;
4699 if (numtriangles * 3 != LittleLong(in->numelements))
4701 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));
4704 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4706 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);
4709 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4711 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);
4716 case Q3FACETYPE_POLYGON:
4717 case Q3FACETYPE_MESH:
4718 // no processing necessary
4720 case Q3FACETYPE_PATCH:
4721 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4722 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4723 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))
4725 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4728 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4729 // convert patch to Q3FACETYPE_MESH
4730 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4731 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4732 // bound to user settings
4733 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4734 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4735 // bound to sanity settings
4736 xtess = bound(1, xtess, 1024);
4737 ytess = bound(1, ytess, 1024);
4738 // bound to user limit on vertices
4739 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4746 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4747 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4748 numvertices = finalwidth * finalheight;
4749 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4751 case Q3FACETYPE_FLARE:
4752 if (developer.integer >= 100)
4753 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4757 out->num_vertices = numvertices;
4758 out->num_triangles = numtriangles;
4759 meshvertices += out->num_vertices;
4760 meshtriangles += out->num_triangles;
4766 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4769 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
4771 if (out->num_vertices < 3 || out->num_triangles < 1)
4774 type = LittleLong(in->type);
4775 firstvertex = LittleLong(in->firstvertex);
4776 firstelement = LittleLong(in->firstelement);
4777 out->num_firstvertex = meshvertices;
4778 out->num_firsttriangle = meshtriangles;
4781 case Q3FACETYPE_POLYGON:
4782 case Q3FACETYPE_MESH:
4783 // no processing necessary, except for lightmap merging
4784 for (j = 0;j < out->num_vertices;j++)
4786 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4787 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4788 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4789 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
4790 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
4791 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
4792 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4793 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4794 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4795 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4796 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4797 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4798 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4799 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4801 for (j = 0;j < out->num_triangles*3;j++)
4802 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
4804 case Q3FACETYPE_PATCH:
4805 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4806 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4807 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4808 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
4809 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4810 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4811 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4812 // convert patch to Q3FACETYPE_MESH
4813 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4814 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4815 // bound to user settings
4816 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4817 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4818 // bound to sanity settings
4819 xtess = bound(1, xtess, 1024);
4820 ytess = bound(1, ytess, 1024);
4821 // bound to user limit on vertices
4822 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4829 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4830 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4831 finalvertices = finalwidth * finalheight;
4832 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4833 type = Q3FACETYPE_MESH;
4834 // generate geometry
4835 // (note: normals are skipped because they get recalculated)
4836 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4837 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
4838 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
4839 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
4840 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
4841 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
4842 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);
4843 if (developer.integer >= 100)
4845 if (out->num_triangles < finaltriangles)
4846 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);
4848 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);
4850 // q3map does not put in collision brushes for curves... ugh
4851 // build the lower quality collision geometry
4852 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4853 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4854 // bound to user settings
4855 xtess = bound(r_subdivisions_collision_mintess.integer, xtess, r_subdivisions_collision_maxtess.integer);
4856 ytess = bound(r_subdivisions_collision_mintess.integer, ytess, r_subdivisions_collision_maxtess.integer);
4857 // bound to sanity settings
4858 xtess = bound(1, xtess, 1024);
4859 ytess = bound(1, ytess, 1024);
4860 // bound to user limit on vertices
4861 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4868 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4869 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4870 finalvertices = finalwidth * finalheight;
4871 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4873 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4874 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4875 out->num_collisionvertices = finalvertices;
4876 out->num_collisiontriangles = finaltriangles;
4877 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4878 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
4880 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
4881 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
4883 oldnumtriangles = out->num_triangles;
4884 oldnumtriangles2 = out->num_collisiontriangles;
4885 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
4886 if (developer.integer >= 100)
4887 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);
4892 meshvertices += out->num_vertices;
4893 meshtriangles += out->num_triangles;
4894 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
4895 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)
4897 if (invalidelements)
4899 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);
4900 for (j = 0;j < out->num_triangles * 3;j++)
4902 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
4903 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)
4904 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
4908 // calculate a bounding box
4909 VectorClear(out->mins);
4910 VectorClear(out->maxs);
4911 if (out->num_vertices)
4913 if (cls.state != ca_dedicated && out->lightmaptexture)
4915 // figure out which part of the merged lightmap this fits into
4916 int lightmapindex = LittleLong(in->lightmapindex) >> loadmodel->brushq3.deluxemapping;
4917 int mergewidth = R_TextureWidth(out->lightmaptexture) / 128;
4918 int mergeheight = R_TextureHeight(out->lightmaptexture) / 128;
4919 lightmapindex &= mergewidth * mergeheight - 1;
4920 lightmaptcscale[0] = 1.0f / mergewidth;
4921 lightmaptcscale[1] = 1.0f / mergeheight;
4922 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
4923 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
4924 // modify the lightmap texcoords to match this region of the merged lightmap
4925 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
4927 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
4928 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
4931 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
4932 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
4933 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
4935 out->mins[0] = min(out->mins[0], v[0]);
4936 out->maxs[0] = max(out->maxs[0], v[0]);
4937 out->mins[1] = min(out->mins[1], v[1]);
4938 out->maxs[1] = max(out->maxs[1], v[1]);
4939 out->mins[2] = min(out->mins[2], v[2]);
4940 out->maxs[2] = max(out->maxs[2], v[2]);
4942 out->mins[0] -= 1.0f;
4943 out->mins[1] -= 1.0f;
4944 out->mins[2] -= 1.0f;
4945 out->maxs[0] += 1.0f;
4946 out->maxs[1] += 1.0f;
4947 out->maxs[2] += 1.0f;
4949 // set lightmap styles for consistency with q1bsp
4950 //out->lightmapinfo->styles[0] = 0;
4951 //out->lightmapinfo->styles[1] = 255;
4952 //out->lightmapinfo->styles[2] = 255;
4953 //out->lightmapinfo->styles[3] = 255;
4956 // for per pixel lighting
4957 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);
4959 // free the no longer needed vertex data
4960 loadmodel->brushq3.num_vertices = 0;
4961 if (loadmodel->brushq3.data_vertex3f)
4962 Mem_Free(loadmodel->brushq3.data_vertex3f);
4963 loadmodel->brushq3.data_vertex3f = NULL;
4964 loadmodel->brushq3.data_normal3f = NULL;
4965 loadmodel->brushq3.data_texcoordtexture2f = NULL;
4966 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
4967 loadmodel->brushq3.data_color4f = NULL;
4968 // free the no longer needed triangle data
4969 loadmodel->brushq3.num_triangles = 0;
4970 if (loadmodel->brushq3.data_element3i)
4971 Mem_Free(loadmodel->brushq3.data_element3i);
4972 loadmodel->brushq3.data_element3i = NULL;
4975 static void Mod_Q3BSP_LoadModels(lump_t *l)
4979 int i, j, n, c, count;
4981 in = (q3dmodel_t *)(mod_base + l->fileofs);
4982 if (l->filelen % sizeof(*in))
4983 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4984 count = l->filelen / sizeof(*in);
4985 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4987 loadmodel->brushq3.data_models = out;
4988 loadmodel->brushq3.num_models = count;
4990 for (i = 0;i < count;i++, in++, out++)
4992 for (j = 0;j < 3;j++)
4994 out->mins[j] = LittleFloat(in->mins[j]);
4995 out->maxs[j] = LittleFloat(in->maxs[j]);
4997 n = LittleLong(in->firstface);
4998 c = LittleLong(in->numfaces);
4999 if (n < 0 || n + c > loadmodel->num_surfaces)
5000 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5003 n = LittleLong(in->firstbrush);
5004 c = LittleLong(in->numbrushes);
5005 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5006 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5007 out->firstbrush = n;
5008 out->numbrushes = c;
5012 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5018 in = (int *)(mod_base + l->fileofs);
5019 if (l->filelen % sizeof(*in))
5020 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5021 count = l->filelen / sizeof(*in);
5022 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5024 loadmodel->brush.data_leafbrushes = out;
5025 loadmodel->brush.num_leafbrushes = count;
5027 for (i = 0;i < count;i++, in++, out++)
5029 n = LittleLong(*in);
5030 if (n < 0 || n >= loadmodel->brush.num_brushes)
5031 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5036 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5042 in = (int *)(mod_base + l->fileofs);
5043 if (l->filelen % sizeof(*in))
5044 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5045 count = l->filelen / sizeof(*in);
5046 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5048 loadmodel->brush.data_leafsurfaces = out;
5049 loadmodel->brush.num_leafsurfaces = count;
5051 for (i = 0;i < count;i++, in++, out++)
5053 n = LittleLong(*in);
5054 if (n < 0 || n >= loadmodel->num_surfaces)
5055 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5060 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5064 int i, j, n, c, count;
5066 in = (q3dleaf_t *)(mod_base + l->fileofs);
5067 if (l->filelen % sizeof(*in))
5068 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5069 count = l->filelen / sizeof(*in);
5070 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5072 loadmodel->brush.data_leafs = out;
5073 loadmodel->brush.num_leafs = count;
5075 for (i = 0;i < count;i++, in++, out++)
5079 out->clusterindex = LittleLong(in->clusterindex);
5080 out->areaindex = LittleLong(in->areaindex);
5081 for (j = 0;j < 3;j++)
5083 // yes the mins/maxs are ints
5084 out->mins[j] = LittleLong(in->mins[j]) - 1;
5085 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5087 n = LittleLong(in->firstleafface);
5088 c = LittleLong(in->numleaffaces);
5089 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5090 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5091 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5092 out->numleafsurfaces = c;
5093 n = LittleLong(in->firstleafbrush);
5094 c = LittleLong(in->numleafbrushes);
5095 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5096 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5097 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5098 out->numleafbrushes = c;
5102 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5108 in = (q3dnode_t *)(mod_base + l->fileofs);
5109 if (l->filelen % sizeof(*in))
5110 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5111 count = l->filelen / sizeof(*in);
5112 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5114 loadmodel->brush.data_nodes = out;
5115 loadmodel->brush.num_nodes = count;
5117 for (i = 0;i < count;i++, in++, out++)
5120 n = LittleLong(in->planeindex);
5121 if (n < 0 || n >= loadmodel->brush.num_planes)
5122 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5123 out->plane = loadmodel->brush.data_planes + n;
5124 for (j = 0;j < 2;j++)
5126 n = LittleLong(in->childrenindex[j]);
5129 if (n >= loadmodel->brush.num_nodes)
5130 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5131 out->children[j] = loadmodel->brush.data_nodes + n;
5136 if (n >= loadmodel->brush.num_leafs)
5137 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5138 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5141 for (j = 0;j < 3;j++)
5143 // yes the mins/maxs are ints
5144 out->mins[j] = LittleLong(in->mins[j]) - 1;
5145 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5149 // set the parent pointers
5150 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5153 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5156 q3dlightgrid_t *out;
5159 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5160 if (l->filelen % sizeof(*in))
5161 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5162 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5163 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5164 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5165 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5166 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5167 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5168 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5169 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5170 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5171 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5172 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5173 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5174 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5175 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]);
5176 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]);
5178 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5181 if (l->filelen < count * (int)sizeof(*in))
5182 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]);
5183 if (l->filelen != count * (int)sizeof(*in))
5184 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5185 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5186 loadmodel->brushq3.data_lightgrid = out;
5187 loadmodel->brushq3.num_lightgrid = count;
5188 // no swapping or validation necessary
5189 memcpy(out, in, count * (int)sizeof(*out));
5193 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5198 if (l->filelen == 0)
5201 // unvised maps often have cluster indices even without pvs, so check
5202 // leafs to find real number of clusters
5203 loadmodel->brush.num_pvsclusters = 1;
5204 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5205 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5208 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5209 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5210 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5211 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5215 in = (q3dpvs_t *)(mod_base + l->fileofs);
5217 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5219 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5220 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5221 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5222 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5223 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5224 if (l->filelen < totalchains + (int)sizeof(*in))
5225 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);
5227 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5228 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5231 static void Mod_Q3BSP_LightPoint(model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5233 int i, j, k, index[3];
5234 float transformed[3], blend1, blend2, blend, stylescale;
5235 q3dlightgrid_t *a, *s;
5237 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5238 stylescale = r_refdef.rtlightstylevalue[0];
5240 if (!model->brushq3.num_lightgrid)
5242 ambientcolor[0] = stylescale;
5243 ambientcolor[1] = stylescale;
5244 ambientcolor[2] = stylescale;
5248 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5249 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5250 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5251 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5252 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5253 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5254 index[0] = (int)floor(transformed[0]);
5255 index[1] = (int)floor(transformed[1]);
5256 index[2] = (int)floor(transformed[2]);
5257 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5259 // now lerp the values
5260 VectorClear(diffusenormal);
5261 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5262 for (k = 0;k < 2;k++)
5264 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5265 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5267 for (j = 0;j < 2;j++)
5269 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5270 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5272 for (i = 0;i < 2;i++)
5274 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5275 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5277 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5278 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5279 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5280 // this uses the mod_md3_sin table because the values are
5281 // already in the 0-255 range, the 64+ bias fetches a cosine
5282 // instead of a sine value
5283 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5284 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5285 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5286 //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)));
5291 // normalize the light direction before turning
5292 VectorNormalize(diffusenormal);
5293 //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]);
5296 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, model_t *model, mnode_t *node, const vec3_t point, int markframe)
5301 // find which leaf the point is in
5303 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5304 // point trace the brushes
5305 leaf = (mleaf_t *)node;
5306 for (i = 0;i < leaf->numleafbrushes;i++)
5308 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5309 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5311 brush->markframe = markframe;
5312 Collision_TracePointBrushFloat(trace, point, brush);
5315 // can't do point traces on curves (they have no thickness)
5318 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)
5320 int i, startside, endside;
5321 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5323 msurface_t *surface;
5326 // walk the tree until we hit a leaf, recursing for any split cases
5329 // abort if this part of the bsp tree can not be hit by this trace
5330 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5332 plane = node->plane;
5333 // axial planes are much more common than non-axial, so an optimized
5334 // axial case pays off here
5335 if (plane->type < 3)
5337 dist1 = start[plane->type] - plane->dist;
5338 dist2 = end[plane->type] - plane->dist;
5342 dist1 = DotProduct(start, plane->normal) - plane->dist;
5343 dist2 = DotProduct(end, plane->normal) - plane->dist;
5345 startside = dist1 < 0;
5346 endside = dist2 < 0;
5347 if (startside == endside)
5349 // most of the time the line fragment is on one side of the plane
5350 node = node->children[startside];
5354 // line crosses node plane, split the line
5355 dist1 = PlaneDiff(linestart, plane);
5356 dist2 = PlaneDiff(lineend, plane);
5357 midfrac = dist1 / (dist1 - dist2);
5358 VectorLerp(linestart, midfrac, lineend, mid);
5359 // take the near side first
5360 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5361 // if we found an impact on the front side, don't waste time
5362 // exploring the far side
5363 if (midfrac <= trace->realfraction)
5364 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5368 // abort if this part of the bsp tree can not be hit by this trace
5369 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5372 nodesegmentmins[0] = min(start[0], end[0]) - 1;
5373 nodesegmentmins[1] = min(start[1], end[1]) - 1;
5374 nodesegmentmins[2] = min(start[2], end[2]) - 1;
5375 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5376 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5377 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5378 // line trace the brushes
5379 leaf = (mleaf_t *)node;
5380 for (i = 0;i < leaf->numleafbrushes;i++)
5382 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5383 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5385 brush->markframe = markframe;
5386 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5389 // can't do point traces on curves (they have no thickness)
5390 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5392 // line trace the curves
5393 for (i = 0;i < leaf->numleafsurfaces;i++)
5395 surface = model->data_surfaces + leaf->firstleafsurface[i];
5396 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5398 surface->collisionmarkframe = markframe;
5399 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5405 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)
5411 msurface_t *surface;
5413 float nodesegmentmins[3], nodesegmentmaxs[3];
5414 // walk the tree until we hit a leaf, recursing for any split cases
5417 // abort if this part of the bsp tree can not be hit by this trace
5418 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5420 plane = node->plane;
5421 // axial planes are much more common than non-axial, so an optimized
5422 // axial case pays off here
5423 if (plane->type < 3)
5425 // this is an axial plane, compare bounding box directly to it and
5426 // recurse sides accordingly
5427 // recurse down node sides
5428 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5429 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5430 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5431 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5435 // this is a non-axial plane, so check if the start and end boxes
5436 // are both on one side of the plane to handle 'diagonal' cases
5437 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5441 // segment crosses plane
5442 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5445 // if sides == 0 then the trace itself is bogus (Not A Number values),
5446 // in this case we simply pretend the trace hit nothing
5448 return; // ERROR: NAN bounding box!
5449 // take whichever side the segment box is on
5450 node = node->children[sides - 1];
5452 // abort if this part of the bsp tree can not be hit by this trace
5453 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5455 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5456 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5457 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5458 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5459 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5460 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5462 leaf = (mleaf_t *)node;
5463 for (i = 0;i < leaf->numleafbrushes;i++)
5465 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5466 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5468 brush->markframe = markframe;
5469 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5472 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5474 for (i = 0;i < leaf->numleafsurfaces;i++)
5476 surface = model->data_surfaces + leaf->firstleafsurface[i];
5477 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5479 surface->collisionmarkframe = markframe;
5480 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);
5486 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)
5489 float segmentmins[3], segmentmaxs[3];
5490 static int markframe = 0;
5491 msurface_t *surface;
5493 memset(trace, 0, sizeof(*trace));
5494 trace->fraction = 1;
5495 trace->realfraction = 1;
5496 trace->hitsupercontentsmask = hitsupercontentsmask;
5497 if (mod_q3bsp_optimizedtraceline.integer && VectorLength2(boxmins) + VectorLength2(boxmaxs) == 0)
5499 if (VectorCompare(start, end))
5502 if (model->brush.submodel)
5504 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5505 if (brush->colbrushf)
5506 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5509 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5514 segmentmins[0] = min(start[0], end[0]) - 1;
5515 segmentmins[1] = min(start[1], end[1]) - 1;
5516 segmentmins[2] = min(start[2], end[2]) - 1;
5517 segmentmaxs[0] = max(start[0], end[0]) + 1;
5518 segmentmaxs[1] = max(start[1], end[1]) + 1;
5519 segmentmaxs[2] = max(start[2], end[2]) + 1;
5520 if (model->brush.submodel)
5522 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5523 if (brush->colbrushf)
5524 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5525 if (mod_q3bsp_curves_collisions.integer)
5526 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5527 if (surface->num_collisiontriangles)
5528 Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5531 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5536 // box trace, performed as brush trace
5537 colbrushf_t *thisbrush_start, *thisbrush_end;
5538 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5539 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5540 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5541 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5542 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5543 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5544 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5545 VectorAdd(start, boxmins, boxstartmins);
5546 VectorAdd(start, boxmaxs, boxstartmaxs);
5547 VectorAdd(end, boxmins, boxendmins);
5548 VectorAdd(end, boxmaxs, boxendmaxs);
5549 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5550 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5551 if (model->brush.submodel)
5553 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5554 if (brush->colbrushf)
5555 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5556 if (mod_q3bsp_curves_collisions.integer)
5557 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5558 if (surface->num_collisiontriangles)
5559 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);
5562 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5566 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5569 int supercontents = 0;
5571 // test if the point is inside each brush
5572 if (model->brush.submodel)
5574 // submodels are effectively one leaf
5575 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5576 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5577 supercontents |= brush->colbrushf->supercontents;
5581 mnode_t *node = model->brush.data_nodes;
5583 // find which leaf the point is in
5585 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5586 leaf = (mleaf_t *)node;
5587 // now check the brushes in the leaf
5588 for (i = 0;i < leaf->numleafbrushes;i++)
5590 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5591 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5592 supercontents |= brush->colbrushf->supercontents;
5595 return supercontents;
5598 static int Mod_Q3BSP_SuperContentsFromNativeContents(model_t *model, int nativecontents)
5600 int supercontents = 0;
5601 if (nativecontents & CONTENTSQ3_SOLID)
5602 supercontents |= SUPERCONTENTS_SOLID;
5603 if (nativecontents & CONTENTSQ3_WATER)
5604 supercontents |= SUPERCONTENTS_WATER;
5605 if (nativecontents & CONTENTSQ3_SLIME)
5606 supercontents |= SUPERCONTENTS_SLIME;
5607 if (nativecontents & CONTENTSQ3_LAVA)
5608 supercontents |= SUPERCONTENTS_LAVA;
5609 if (nativecontents & CONTENTSQ3_BODY)
5610 supercontents |= SUPERCONTENTS_BODY;
5611 if (nativecontents & CONTENTSQ3_CORPSE)
5612 supercontents |= SUPERCONTENTS_CORPSE;
5613 if (nativecontents & CONTENTSQ3_NODROP)
5614 supercontents |= SUPERCONTENTS_NODROP;
5615 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5616 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5617 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5618 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5619 if (nativecontents & CONTENTSQ3_DONOTENTER)
5620 supercontents |= SUPERCONTENTS_DONOTENTER;
5621 return supercontents;
5624 static int Mod_Q3BSP_NativeContentsFromSuperContents(model_t *model, int supercontents)
5626 int nativecontents = 0;
5627 if (supercontents & SUPERCONTENTS_SOLID)
5628 nativecontents |= CONTENTSQ3_SOLID;
5629 if (supercontents & SUPERCONTENTS_WATER)
5630 nativecontents |= CONTENTSQ3_WATER;
5631 if (supercontents & SUPERCONTENTS_SLIME)
5632 nativecontents |= CONTENTSQ3_SLIME;
5633 if (supercontents & SUPERCONTENTS_LAVA)
5634 nativecontents |= CONTENTSQ3_LAVA;
5635 if (supercontents & SUPERCONTENTS_BODY)
5636 nativecontents |= CONTENTSQ3_BODY;
5637 if (supercontents & SUPERCONTENTS_CORPSE)
5638 nativecontents |= CONTENTSQ3_CORPSE;
5639 if (supercontents & SUPERCONTENTS_NODROP)
5640 nativecontents |= CONTENTSQ3_NODROP;
5641 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5642 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5643 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5644 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5645 if (supercontents & SUPERCONTENTS_DONOTENTER)
5646 nativecontents |= CONTENTSQ3_DONOTENTER;
5647 return nativecontents;
5650 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5655 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5656 node = node->children[1];
5658 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5659 if (loadmodel->brush.num_leafs < numleafs)
5660 loadmodel->brush.num_leafs = numleafs;
5663 void Mod_Q3BSP_Load(model_t *mod, void *buffer, void *bufferend)
5665 int i, j, numshadowmeshtriangles;
5666 q3dheader_t *header;
5667 float corner[3], yawradius, modelradius;
5668 msurface_t *surface;
5670 mod->modeldatatypestring = "Q3BSP";
5672 mod->type = mod_brushq3;
5673 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5676 header = (q3dheader_t *)buffer;
5678 i = LittleLong(header->version);
5679 if (i != Q3BSPVERSION)
5680 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5681 mod->brush.ishlbsp = false;
5682 mod->brush.ismcbsp = false;
5683 if (loadmodel->isworldmodel)
5685 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
5686 Cvar_SetValue("mcbsp", mod->brush.ismcbsp);
5689 mod->soundfromcenter = true;
5690 mod->TraceBox = Mod_Q3BSP_TraceBox;
5691 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
5692 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
5693 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5694 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5695 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5696 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5697 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5698 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5699 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5700 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
5701 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5702 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5703 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5704 mod->Draw = R_Q1BSP_Draw;
5705 mod->DrawDepth = R_Q1BSP_DrawDepth;
5706 mod->DrawDebug = R_Q1BSP_DrawDebug;
5707 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5708 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5709 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5710 mod->DrawLight = R_Q1BSP_DrawLight;
5711 mod->DrawAddWaterPlanes = NULL;
5713 mod_base = (unsigned char *)header;
5715 // swap all the lumps
5716 header->ident = LittleLong(header->ident);
5717 header->version = LittleLong(header->version);
5718 for (i = 0;i < Q3HEADER_LUMPS;i++)
5720 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
5721 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
5724 mod->brush.qw_md4sum = 0;
5725 mod->brush.qw_md4sum2 = 0;
5726 for (i = 0;i < Q3HEADER_LUMPS;i++)
5728 if (i == Q3LUMP_ENTITIES)
5730 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5731 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
5733 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5736 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5737 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5738 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5739 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5740 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5741 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5742 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5743 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5744 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
5745 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5746 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5747 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5748 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5749 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5750 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5751 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5752 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5753 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5755 // the MakePortals code works fine on the q3bsp data as well
5756 Mod_Q1BSP_MakePortals();
5758 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
5759 loadmodel->brush.supportwateralpha = true;
5761 // make a single combined shadow mesh to allow optimized shadow volume creation
5762 numshadowmeshtriangles = 0;
5763 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5765 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5766 numshadowmeshtriangles += surface->num_triangles;
5768 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5769 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5770 if (surface->num_triangles > 0)
5771 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));
5772 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
5773 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5775 loadmodel->brush.num_leafs = 0;
5776 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
5779 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
5784 // LordHavoc: only register submodels if it is the world
5785 // (prevents external bsp models from replacing world submodels with
5787 if (!loadmodel->isworldmodel)
5789 // duplicate the basic information
5790 sprintf(name, "*%i", i);
5791 mod = Mod_FindName(name);
5793 strlcpy(mod->name, name, sizeof(mod->name));
5794 // textures and memory belong to the main model
5795 mod->texturepool = NULL;
5796 mod->mempool = NULL;
5797 mod->brush.TraceLineOfSight = NULL;
5798 mod->brush.GetPVS = NULL;
5799 mod->brush.FatPVS = NULL;
5800 mod->brush.BoxTouchingPVS = NULL;
5801 mod->brush.BoxTouchingLeafPVS = NULL;
5802 mod->brush.BoxTouchingVisibleLeafs = NULL;
5803 mod->brush.FindBoxClusters = NULL;
5804 mod->brush.LightPoint = NULL;
5805 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5807 mod->brush.submodel = i;
5809 // make the model surface list (used by shadowing/lighting)
5810 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
5811 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
5812 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
5813 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
5814 mod->surfacelist = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
5815 for (j = 0;j < mod->nummodelsurfaces;j++)
5816 mod->surfacelist[j] = mod->firstmodelsurface + j;
5818 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
5819 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
5820 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5821 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5822 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5823 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5824 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5825 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5826 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5827 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5828 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5829 mod->yawmins[2] = mod->normalmins[2];
5830 mod->yawmaxs[2] = mod->normalmaxs[2];
5831 mod->radius = modelradius;
5832 mod->radius2 = modelradius * modelradius;
5834 for (j = 0;j < mod->nummodelsurfaces;j++)
5835 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
5837 if (j < mod->nummodelsurfaces)
5838 mod->DrawSky = R_Q1BSP_DrawSky;
5840 mod->DrawSky = NULL;
5842 for (j = 0;j < mod->nummodelsurfaces;j++)
5843 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
5845 if (j < mod->nummodelsurfaces)
5846 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
5848 mod->DrawAddWaterPlanes = NULL;
5852 void Mod_IBSP_Load(model_t *mod, void *buffer, void *bufferend)
5854 int i = LittleLong(((int *)buffer)[1]);
5855 if (i == Q3BSPVERSION)
5856 Mod_Q3BSP_Load(mod,buffer, bufferend);
5857 else if (i == Q2BSPVERSION)
5858 Mod_Q2BSP_Load(mod,buffer, bufferend);
5860 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
5863 void Mod_MAP_Load(model_t *mod, void *buffer, void *bufferend)
5865 Host_Error("Mod_MAP_Load: not yet implemented");
5868 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
5870 // we already have done PVS culling at this point...
5871 // so we don't need to do it again.
5874 vec3_t testorigin, mins, maxs;
5876 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
5877 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
5878 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
5880 if(model->brush.TraceLineOfSight(model, eye, testorigin))
5883 // expand the box a little
5884 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
5885 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
5886 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
5887 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
5888 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
5889 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
5891 for(i = 0; i != numsamples; ++i)
5893 testorigin[0] = lhrandom(mins[0], maxs[0]);
5894 testorigin[1] = lhrandom(mins[1], maxs[1]);
5895 testorigin[2] = lhrandom(mins[2], maxs[2]);
5897 if(model->brush.TraceLineOfSight(model, eye, testorigin))