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 r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
32 cvar_t r_picmipworld = {CVAR_SAVE, "r_picmipworld", "1", "whether gl_picmip shall apply to world textures too"};
33 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)"};
34 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)"};
35 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)"};
36 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
37 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
38 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)"};
39 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)"};
40 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)"};
41 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
42 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
43 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
44 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
45 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, ..."};
47 static texture_t mod_q1bsp_texture_solid;
48 static texture_t mod_q1bsp_texture_sky;
49 static texture_t mod_q1bsp_texture_lava;
50 static texture_t mod_q1bsp_texture_slime;
51 static texture_t mod_q1bsp_texture_water;
53 void Mod_BrushInit(void)
55 // Cvar_RegisterVariable(&r_subdivide_size);
56 Cvar_RegisterVariable(&halflifebsp);
57 Cvar_RegisterVariable(&r_novis);
58 Cvar_RegisterVariable(&r_picmipworld);
59 Cvar_RegisterVariable(&r_nosurftextures);
60 Cvar_RegisterVariable(&r_subdivisions_tolerance);
61 Cvar_RegisterVariable(&r_subdivisions_mintess);
62 Cvar_RegisterVariable(&r_subdivisions_maxtess);
63 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
64 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
65 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
66 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
67 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
68 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
69 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
70 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
71 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
73 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
74 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
75 mod_q1bsp_texture_solid.surfaceflags = 0;
76 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
78 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
79 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
80 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
81 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
83 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
84 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
85 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
86 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
88 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
89 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
90 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
91 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
93 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
94 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
95 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
96 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
99 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
106 // LordHavoc: modified to start at first clip node,
107 // in other words: first node of the (sub)model
108 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
110 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
112 return (mleaf_t *)node;
115 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
119 leaf = Mod_Q1BSP_PointInLeaf(model, p);
122 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
125 memcpy(out, leaf->ambient_sound_level, i);
131 memset(out, 0, outsize);
134 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
137 int nodestackindex = 0;
138 mnode_t *node, *nodestack[1024];
139 if (!model->brush.num_pvsclusters)
141 node = model->brush.data_nodes;
147 // node - recurse down the BSP tree
148 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
152 return -1; // ERROR: NAN bounding box!
153 // box is on one side of plane, take that path
154 node = node->children[sides-1];
158 // box crosses plane, take one path and remember the other
159 if (nodestackindex < 1024)
160 nodestack[nodestackindex++] = node->children[0];
161 node = node->children[1];
167 // leaf - add clusterindex to list
168 if (numclusters < maxclusters)
169 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
173 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
177 if (nodestackindex < 1024)
178 nodestack[nodestackindex++] = node->children[0];
179 node = node->children[1];
184 // leaf - add clusterindex to list
185 if (numclusters < maxclusters)
186 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
191 // try another path we didn't take earlier
192 if (nodestackindex == 0)
194 node = nodestack[--nodestackindex];
196 // return number of clusters found (even if more than the maxclusters)
200 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
202 int nodestackindex = 0;
203 mnode_t *node, *nodestack[1024];
204 if (!model->brush.num_pvsclusters)
206 node = model->brush.data_nodes;
212 // node - recurse down the BSP tree
213 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
217 return -1; // ERROR: NAN bounding box!
218 // box is on one side of plane, take that path
219 node = node->children[sides-1];
223 // box crosses plane, take one path and remember the other
224 if (nodestackindex < 1024)
225 nodestack[nodestackindex++] = node->children[0];
226 node = node->children[1];
232 // leaf - check cluster bit
233 int clusterindex = ((mleaf_t *)node)->clusterindex;
234 if (CHECKPVSBIT(pvs, clusterindex))
236 // it is visible, return immediately with the news
241 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
245 if (nodestackindex < 1024)
246 nodestack[nodestackindex++] = node->children[0];
247 node = node->children[1];
252 // leaf - check cluster bit
253 int clusterindex = ((mleaf_t *)node)->clusterindex;
254 if (CHECKPVSBIT(pvs, clusterindex))
256 // it is visible, return immediately with the news
262 // nothing to see here, try another path we didn't take earlier
263 if (nodestackindex == 0)
265 node = nodestack[--nodestackindex];
271 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
273 int nodestackindex = 0;
274 mnode_t *node, *nodestack[1024];
275 if (!model->brush.num_leafs)
277 node = model->brush.data_nodes;
283 // node - recurse down the BSP tree
284 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
288 return -1; // ERROR: NAN bounding box!
289 // box is on one side of plane, take that path
290 node = node->children[sides-1];
294 // box crosses plane, take one path and remember the other
295 if (nodestackindex < 1024)
296 nodestack[nodestackindex++] = node->children[0];
297 node = node->children[1];
303 // leaf - check cluster bit
304 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
305 if (CHECKPVSBIT(pvs, clusterindex))
307 // it is visible, return immediately with the news
312 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
316 if (nodestackindex < 1024)
317 nodestack[nodestackindex++] = node->children[0];
318 node = node->children[1];
323 // leaf - check cluster bit
324 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
325 if (CHECKPVSBIT(pvs, clusterindex))
327 // it is visible, return immediately with the news
333 // nothing to see here, try another path we didn't take earlier
334 if (nodestackindex == 0)
336 node = nodestack[--nodestackindex];
342 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
344 int nodestackindex = 0;
345 mnode_t *node, *nodestack[1024];
346 if (!model->brush.num_leafs)
348 node = model->brush.data_nodes;
354 // node - recurse down the BSP tree
355 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
359 return -1; // ERROR: NAN bounding box!
360 // box is on one side of plane, take that path
361 node = node->children[sides-1];
365 // box crosses plane, take one path and remember the other
366 if (nodestackindex < 1024)
367 nodestack[nodestackindex++] = node->children[0];
368 node = node->children[1];
374 // leaf - check if it is visible
375 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
377 // it is visible, return immediately with the news
382 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
386 if (nodestackindex < 1024)
387 nodestack[nodestackindex++] = node->children[0];
388 node = node->children[1];
393 // leaf - check if it is visible
394 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
396 // it is visible, return immediately with the news
402 // nothing to see here, try another path we didn't take earlier
403 if (nodestackindex == 0)
405 node = nodestack[--nodestackindex];
411 typedef struct findnonsolidlocationinfo_s
419 findnonsolidlocationinfo_t;
421 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
423 int i, surfacenum, k, *tri, *mark;
424 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
426 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
428 surface = info->model->data_surfaces + *mark;
429 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
431 for (k = 0;k < surface->num_triangles;k++)
433 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
434 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
435 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
436 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
437 VectorSubtract(vert[1], vert[0], edge[0]);
438 VectorSubtract(vert[2], vert[1], edge[1]);
439 CrossProduct(edge[1], edge[0], facenormal);
440 if (facenormal[0] || facenormal[1] || facenormal[2])
442 VectorNormalize(facenormal);
443 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
444 if (f <= info->bestdist && f >= -info->bestdist)
446 VectorSubtract(vert[0], vert[2], edge[2]);
447 VectorNormalize(edge[0]);
448 VectorNormalize(edge[1]);
449 VectorNormalize(edge[2]);
450 CrossProduct(facenormal, edge[0], edgenormal[0]);
451 CrossProduct(facenormal, edge[1], edgenormal[1]);
452 CrossProduct(facenormal, edge[2], edgenormal[2]);
454 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
455 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
456 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
458 // we got lucky, the center is within the face
459 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
463 if (info->bestdist > dist)
465 info->bestdist = dist;
466 VectorScale(facenormal, (info->radius - -dist), info->nudge);
471 if (info->bestdist > dist)
473 info->bestdist = dist;
474 VectorScale(facenormal, (info->radius - dist), info->nudge);
480 // check which edge or vertex the center is nearest
481 for (i = 0;i < 3;i++)
483 f = DotProduct(info->center, edge[i]);
484 if (f >= DotProduct(vert[0], edge[i])
485 && f <= DotProduct(vert[1], edge[i]))
488 VectorMA(info->center, -f, edge[i], point);
489 dist = sqrt(DotProduct(point, point));
490 if (info->bestdist > dist)
492 info->bestdist = dist;
493 VectorScale(point, (info->radius / dist), info->nudge);
495 // skip both vertex checks
496 // (both are further away than this edge)
501 // not on edge, check first vertex of edge
502 VectorSubtract(info->center, vert[i], point);
503 dist = sqrt(DotProduct(point, point));
504 if (info->bestdist > dist)
506 info->bestdist = dist;
507 VectorScale(point, (info->radius / dist), info->nudge);
519 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
523 float f = PlaneDiff(info->center, node->plane);
524 if (f >= -info->bestdist)
525 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
526 if (f <= info->bestdist)
527 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
531 if (((mleaf_t *)node)->numleafsurfaces)
532 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
536 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
539 findnonsolidlocationinfo_t info;
545 VectorCopy(in, info.center);
546 info.radius = radius;
551 VectorClear(info.nudge);
552 info.bestdist = radius;
553 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
554 VectorAdd(info.center, info.nudge, info.center);
556 while (info.bestdist < radius && ++i < 10);
557 VectorCopy(info.center, out);
560 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
562 switch(nativecontents)
567 return SUPERCONTENTS_SOLID;
569 return SUPERCONTENTS_WATER;
571 return SUPERCONTENTS_SLIME;
573 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
575 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
580 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
582 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
583 return CONTENTS_SOLID;
584 if (supercontents & SUPERCONTENTS_SKY)
586 if (supercontents & SUPERCONTENTS_LAVA)
587 return CONTENTS_LAVA;
588 if (supercontents & SUPERCONTENTS_SLIME)
589 return CONTENTS_SLIME;
590 if (supercontents & SUPERCONTENTS_WATER)
591 return CONTENTS_WATER;
592 return CONTENTS_EMPTY;
595 typedef struct RecursiveHullCheckTraceInfo_s
597 // the hull we're tracing through
600 // the trace structure to fill in
603 // start, end, and end - start (in model space)
608 RecursiveHullCheckTraceInfo_t;
610 // 1/32 epsilon to keep floating point happy
611 #define DIST_EPSILON (0.03125)
613 #define HULLCHECKSTATE_EMPTY 0
614 #define HULLCHECKSTATE_SOLID 1
615 #define HULLCHECKSTATE_DONE 2
617 extern cvar_t collision_prefernudgedfraction;
618 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
620 // status variables, these don't need to be saved on the stack when
621 // recursing... but are because this should be thread-safe
622 // (note: tracing against a bbox is not thread-safe, yet)
627 // variables that need to be stored on the stack when recursing
632 // LordHavoc: a goto! everyone flee in terror... :)
637 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
638 if (!t->trace->startfound)
640 t->trace->startfound = true;
641 t->trace->startsupercontents |= num;
643 if (num & SUPERCONTENTS_LIQUIDSMASK)
644 t->trace->inwater = true;
646 t->trace->inopen = true;
647 if (num & SUPERCONTENTS_SOLID)
648 t->trace->hittexture = &mod_q1bsp_texture_solid;
649 else if (num & SUPERCONTENTS_SKY)
650 t->trace->hittexture = &mod_q1bsp_texture_sky;
651 else if (num & SUPERCONTENTS_LAVA)
652 t->trace->hittexture = &mod_q1bsp_texture_lava;
653 else if (num & SUPERCONTENTS_SLIME)
654 t->trace->hittexture = &mod_q1bsp_texture_slime;
656 t->trace->hittexture = &mod_q1bsp_texture_water;
657 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
658 t->trace->hitsupercontents = num;
659 if (num & t->trace->hitsupercontentsmask)
661 // if the first leaf is solid, set startsolid
662 if (t->trace->allsolid)
663 t->trace->startsolid = true;
664 #if COLLISIONPARANOID >= 3
667 return HULLCHECKSTATE_SOLID;
671 t->trace->allsolid = false;
672 #if COLLISIONPARANOID >= 3
675 return HULLCHECKSTATE_EMPTY;
679 // find the point distances
680 node = t->hull->clipnodes + num;
682 plane = t->hull->planes + node->planenum;
685 t1 = p1[plane->type] - plane->dist;
686 t2 = p2[plane->type] - plane->dist;
690 t1 = DotProduct (plane->normal, p1) - plane->dist;
691 t2 = DotProduct (plane->normal, p2) - plane->dist;
698 #if COLLISIONPARANOID >= 3
701 num = node->children[1];
710 #if COLLISIONPARANOID >= 3
713 num = node->children[0];
719 // the line intersects, find intersection point
720 // LordHavoc: this uses the original trace for maximum accuracy
721 #if COLLISIONPARANOID >= 3
726 t1 = t->start[plane->type] - plane->dist;
727 t2 = t->end[plane->type] - plane->dist;
731 t1 = DotProduct (plane->normal, t->start) - plane->dist;
732 t2 = DotProduct (plane->normal, t->end) - plane->dist;
735 midf = t1 / (t1 - t2);
736 midf = bound(p1f, midf, p2f);
737 VectorMA(t->start, midf, t->dist, mid);
739 // recurse both sides, front side first
740 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
741 // if this side is not empty, return what it is (solid or done)
742 if (ret != HULLCHECKSTATE_EMPTY)
745 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
746 // if other side is not solid, return what it is (empty or done)
747 if (ret != HULLCHECKSTATE_SOLID)
750 // front is air and back is solid, this is the impact point...
753 t->trace->plane.dist = -plane->dist;
754 VectorNegate (plane->normal, t->trace->plane.normal);
758 t->trace->plane.dist = plane->dist;
759 VectorCopy (plane->normal, t->trace->plane.normal);
762 // calculate the true fraction
763 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
764 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
765 midf = t1 / (t1 - t2);
766 t->trace->realfraction = bound(0, midf, 1);
768 // calculate the return fraction which is nudged off the surface a bit
769 midf = (t1 - DIST_EPSILON) / (t1 - t2);
770 t->trace->fraction = bound(0, midf, 1);
772 if (collision_prefernudgedfraction.integer)
773 t->trace->realfraction = t->trace->fraction;
775 #if COLLISIONPARANOID >= 3
778 return HULLCHECKSTATE_DONE;
781 //#if COLLISIONPARANOID < 2
782 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
785 mclipnode_t *nodes = t->hull->clipnodes;
786 mplane_t *planes = t->hull->planes;
788 VectorCopy(t->start, point);
791 plane = planes + nodes[num].planenum;
792 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
794 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
795 t->trace->startsupercontents |= num;
796 if (num & SUPERCONTENTS_LIQUIDSMASK)
797 t->trace->inwater = true;
799 t->trace->inopen = true;
800 if (num & t->trace->hitsupercontentsmask)
802 t->trace->allsolid = t->trace->startsolid = true;
803 return HULLCHECKSTATE_SOLID;
807 t->trace->allsolid = t->trace->startsolid = false;
808 return HULLCHECKSTATE_EMPTY;
813 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)
815 // this function currently only supports same size start and end
817 RecursiveHullCheckTraceInfo_t rhc;
819 memset(&rhc, 0, sizeof(rhc));
820 memset(trace, 0, sizeof(trace_t));
822 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
823 rhc.trace->fraction = 1;
824 rhc.trace->realfraction = 1;
825 rhc.trace->allsolid = true;
826 VectorSubtract(boxmaxs, boxmins, boxsize);
828 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
829 else if (model->brush.ishlbsp)
831 // LordHavoc: this has to have a minor tolerance (the .1) because of
832 // minor float precision errors from the box being transformed around
833 if (boxsize[0] < 32.1)
835 if (boxsize[2] < 54) // pick the nearest of 36 or 72
836 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
838 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
841 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
845 // LordHavoc: this has to have a minor tolerance (the .1) because of
846 // minor float precision errors from the box being transformed around
847 if (boxsize[0] < 32.1)
848 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
850 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
852 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
853 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
854 VectorSubtract(rhc.end, rhc.start, rhc.dist);
855 #if COLLISIONPARANOID >= 2
856 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]);
857 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
862 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
863 memset(&testtrace, 0, sizeof(trace_t));
864 rhc.trace = &testtrace;
865 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
866 rhc.trace->fraction = 1;
867 rhc.trace->realfraction = 1;
868 rhc.trace->allsolid = true;
869 VectorCopy(test, rhc.start);
870 VectorCopy(test, rhc.end);
871 VectorClear(rhc.dist);
872 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
873 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
874 if (!trace->startsolid && testtrace.startsolid)
875 Con_Printf(" - ended in solid!\n");
879 if (VectorLength2(rhc.dist))
880 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
882 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
886 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
888 int num = model->brushq1.hulls[0].firstclipnode;
890 mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
891 mplane_t *planes = model->brushq1.hulls[0].planes;
894 plane = planes + nodes[num].planenum;
895 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
897 return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
900 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)
904 colplanef_t cbox_planes[6];
905 cbox.supercontents = boxsupercontents;
908 cbox.numtriangles = 0;
909 cbox.planes = cbox_planes;
911 cbox.elements = NULL;
919 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];
920 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];
921 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];
922 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];
923 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];
924 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];
925 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
926 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
927 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
928 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
929 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
930 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
931 memset(trace, 0, sizeof(trace_t));
932 trace->hitsupercontentsmask = hitsupercontentsmask;
934 trace->realfraction = 1;
935 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
937 RecursiveHullCheckTraceInfo_t rhc;
938 static hull_t box_hull;
939 static mclipnode_t box_clipnodes[6];
940 static mplane_t box_planes[6];
941 // fill in a default trace
942 memset(&rhc, 0, sizeof(rhc));
943 memset(trace, 0, sizeof(trace_t));
944 //To keep everything totally uniform, bounding boxes are turned into small
945 //BSP trees instead of being compared directly.
946 // create a temp hull from bounding box sizes
947 box_planes[0].dist = cmaxs[0] - mins[0];
948 box_planes[1].dist = cmins[0] - maxs[0];
949 box_planes[2].dist = cmaxs[1] - mins[1];
950 box_planes[3].dist = cmins[1] - maxs[1];
951 box_planes[4].dist = cmaxs[2] - mins[2];
952 box_planes[5].dist = cmins[2] - maxs[2];
953 #if COLLISIONPARANOID >= 3
954 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]);
957 if (box_hull.clipnodes == NULL)
961 //Set up the planes and clipnodes so that the six floats of a bounding box
962 //can just be stored out and get a proper hull_t structure.
964 box_hull.clipnodes = box_clipnodes;
965 box_hull.planes = box_planes;
966 box_hull.firstclipnode = 0;
967 box_hull.lastclipnode = 5;
969 for (i = 0;i < 6;i++)
971 box_clipnodes[i].planenum = i;
975 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
977 box_clipnodes[i].children[side^1] = i + 1;
979 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
981 box_planes[i].type = i>>1;
982 box_planes[i].normal[i>>1] = 1;
986 // trace a line through the generated clipping hull
987 //rhc.boxsupercontents = boxsupercontents;
988 rhc.hull = &box_hull;
990 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
991 rhc.trace->fraction = 1;
992 rhc.trace->realfraction = 1;
993 rhc.trace->allsolid = true;
994 VectorCopy(start, rhc.start);
995 VectorCopy(end, rhc.end);
996 VectorSubtract(rhc.end, rhc.start, rhc.dist);
997 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
998 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
999 if (rhc.trace->startsupercontents)
1000 rhc.trace->startsupercontents = boxsupercontents;
1004 static int Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
1007 double midf, mid[3];
1013 // find the point distances
1014 mplane_t *plane = node->plane;
1015 if (plane->type < 3)
1017 t1 = p1[plane->type] - plane->dist;
1018 t2 = p2[plane->type] - plane->dist;
1022 t1 = DotProduct (plane->normal, p1) - plane->dist;
1023 t2 = DotProduct (plane->normal, p2) - plane->dist;
1030 node = node->children[1];
1039 node = node->children[0];
1045 midf = t1 / (t1 - t2);
1046 VectorLerp(p1, midf, p2, mid);
1048 // recurse both sides, front side first
1049 // return 2 if empty is followed by solid (hit something)
1050 // do not return 2 if both are solid or both empty,
1051 // or if start is solid and end is empty
1052 // as these degenerate cases usually indicate the eye is in solid and
1053 // should see the target point anyway
1054 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
1057 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
1062 return ((mleaf_t *)node)->clusterindex < 0;
1065 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1067 // this function currently only supports same size start and end
1068 double tracestart[3], traceend[3];
1069 VectorCopy(start, tracestart);
1070 VectorCopy(end, traceend);
1071 return Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend) != 2;
1074 static int Mod_Q1BSP_LightPoint_RecursiveBSPNode(dp_model_t *model, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal, const mnode_t *node, float x, float y, float startz, float endz)
1078 float mid, distz = endz - startz;
1082 return false; // didn't hit anything
1084 switch (node->plane->type)
1087 node = node->children[x < node->plane->dist];
1090 node = node->children[y < node->plane->dist];
1093 side = startz < node->plane->dist;
1094 if ((endz < node->plane->dist) == side)
1096 node = node->children[side];
1099 // found an intersection
1100 mid = node->plane->dist;
1103 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1104 front += startz * node->plane->normal[2];
1105 back += endz * node->plane->normal[2];
1106 side = front < node->plane->dist;
1107 if ((back < node->plane->dist) == side)
1109 node = node->children[side];
1112 // found an intersection
1113 mid = startz + distz * (front - node->plane->dist) / (front - back);
1117 // go down front side
1118 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1119 return true; // hit something
1122 // check for impact on this node
1123 if (node->numsurfaces)
1125 int i, dsi, dti, lmwidth, lmheight;
1127 msurface_t *surface;
1128 unsigned char *lightmap;
1129 int maps, line3, size3;
1132 float scale, w, w00, w01, w10, w11;
1134 surface = model->data_surfaces + node->firstsurface;
1135 for (i = 0;i < node->numsurfaces;i++, surface++)
1137 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1138 continue; // no lightmaps
1140 // location we want to sample in the lightmap
1141 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;
1142 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;
1147 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1148 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1151 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1153 // calculate bilinear interpolation factors
1154 // and also multiply by fixedpoint conversion factors
1157 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1158 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1159 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1160 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1162 // values for pointer math
1163 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1164 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1166 // look up the pixel
1167 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1169 // bilinear filter each lightmap style, and sum them
1170 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1172 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1173 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1174 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1175 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1176 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1180 return true; // success
1185 // go down back side
1186 node = node->children[side ^ 1];
1188 distz = endz - startz;
1193 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1195 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1196 VectorSet(diffusenormal, 0, 0, 1);
1198 if (!model->brushq1.lightdata)
1200 VectorSet(ambientcolor, 1, 1, 1);
1201 VectorSet(diffusecolor, 0, 0, 0);
1205 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);
1208 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1211 unsigned char *outstart = out;
1212 while (out < outend)
1216 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));
1226 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));
1229 for (c = *in++;c > 0;c--)
1233 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));
1244 R_Q1BSP_LoadSplitSky
1246 A sky texture is 256*128, with the right side being a masked overlay
1249 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1252 unsigned solidpixels[128*128], alphapixels[128*128];
1254 // allocate a texture pool if we need it
1255 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1256 loadmodel->texturepool = R_AllocTexturePool();
1258 if (bytesperpixel == 4)
1260 for (i = 0;i < 128;i++)
1262 for (j = 0;j < 128;j++)
1264 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1265 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1271 // make an average value for the back to avoid
1272 // a fringe on the top level
1281 for (i = 0;i < 128;i++)
1283 for (j = 0;j < 128;j++)
1285 p = src[i*256 + j + 128];
1286 r += palette_rgb[p][0];
1287 g += palette_rgb[p][1];
1288 b += palette_rgb[p][2];
1291 bgra.b[2] = r/(128*128);
1292 bgra.b[1] = g/(128*128);
1293 bgra.b[0] = b/(128*128);
1295 for (i = 0;i < 128;i++)
1297 for (j = 0;j < 128;j++)
1299 solidpixels[(i*128) + j] = palette_bgra_complete[src[i*256 + j + 128]];
1301 alphapixels[(i*128) + j] = p ? palette_bgra_complete[p] : bgra.i;
1306 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1307 loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1310 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1312 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1313 skinframe_t *skinframe;
1315 texture_t *tx, *tx2, *anims[10], *altanims[10];
1317 unsigned char *data, *mtdata;
1319 char mapname[MAX_QPATH], name[MAX_QPATH];
1320 unsigned char zero[4];
1322 memset(zero, 0, sizeof(zero));
1324 loadmodel->data_textures = NULL;
1326 // add two slots for notexture walls and notexture liquids
1329 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1330 m->nummiptex = LittleLong (m->nummiptex);
1331 loadmodel->num_textures = m->nummiptex + 2;
1332 loadmodel->num_texturesperskin = loadmodel->num_textures;
1337 loadmodel->num_textures = 2;
1338 loadmodel->num_texturesperskin = loadmodel->num_textures;
1341 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1343 // fill out all slots with notexture
1344 if (cls.state != ca_dedicated)
1345 skinframe = R_SkinFrame_LoadMissing();
1348 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1350 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1353 if (cls.state != ca_dedicated)
1355 tx->numskinframes = 1;
1356 tx->skinframerate = 1;
1357 tx->skinframes[0] = skinframe;
1358 tx->currentskinframe = tx->skinframes[0];
1359 tx->basematerialflags = 0;
1361 tx->basematerialflags = MATERIALFLAG_WALL;
1362 if (i == loadmodel->num_textures - 1)
1364 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1365 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1366 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1370 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1371 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1373 tx->currentframe = tx;
1375 // clear water settings
1378 tx->refractfactor = 1;
1379 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1380 tx->reflectfactor = 1;
1381 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1382 tx->r_water_wateralpha = 1;
1387 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1391 s = loadmodel->name;
1392 if (!strncasecmp(s, "maps/", 5))
1394 FS_StripExtension(s, mapname, sizeof(mapname));
1396 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1398 // LordHavoc: mostly rewritten map texture loader
1399 for (i = 0;i < m->nummiptex;i++)
1401 dofs[i] = LittleLong(dofs[i]);
1402 if (r_nosurftextures.integer)
1406 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1409 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1411 // copy name, but only up to 16 characters
1412 // (the output buffer can hold more than this, but the input buffer is
1414 for (j = 0;dmiptex->name[j] && j < 16;j++)
1415 name[j] = dmiptex->name[j];
1420 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1421 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1424 mtwidth = LittleLong(dmiptex->width);
1425 mtheight = LittleLong(dmiptex->height);
1427 j = LittleLong(dmiptex->offsets[0]);
1431 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1433 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1436 mtdata = (unsigned char *)dmiptex + j;
1439 if ((mtwidth & 15) || (mtheight & 15))
1440 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1442 // LordHavoc: force all names to lowercase
1443 for (j = 0;name[j];j++)
1444 if (name[j] >= 'A' && name[j] <= 'Z')
1445 name[j] += 'a' - 'A';
1447 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1450 tx = loadmodel->data_textures + i;
1451 strlcpy(tx->name, name, sizeof(tx->name));
1452 tx->width = mtwidth;
1453 tx->height = mtheight;
1455 if (tx->name[0] == '*')
1457 if (!strncmp(tx->name, "*lava", 5))
1459 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1460 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1462 else if (!strncmp(tx->name, "*slime", 6))
1464 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1465 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1469 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1470 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1473 else if (!strncmp(tx->name, "sky", 3))
1475 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1476 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1480 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1481 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1484 if (cls.state != ca_dedicated)
1486 // LordHavoc: HL sky textures are entirely different than quake
1487 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1489 if (loadmodel->isworldmodel)
1491 data = loadimagepixelsbgra(tx->name, false, false);
1492 if (data && image_width == 256 && image_height == 128)
1494 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1497 else if (mtdata != NULL)
1498 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1503 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);
1505 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);
1508 // did not find external texture, load it from the bsp or wad3
1509 if (loadmodel->brush.ishlbsp)
1511 // internal texture overrides wad
1512 unsigned char *pixels, *freepixels;
1513 pixels = freepixels = NULL;
1515 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1517 pixels = freepixels = W_GetTextureBGRA(tx->name);
1520 tx->width = image_width;
1521 tx->height = image_height;
1522 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1525 Mem_Free(freepixels);
1527 else if (mtdata) // texture included
1528 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);
1530 // if skinframe is still NULL the "missing" texture will be used
1532 tx->skinframes[0] = skinframe;
1535 tx->basematerialflags = MATERIALFLAG_WALL;
1536 if (tx->name[0] == '*')
1538 // LordHavoc: some turbulent textures should not be affected by wateralpha
1539 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1541 // replace the texture with transparent black
1542 Vector4Set(zero, 128, 128, 128, 128);
1543 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1544 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1546 else if (!strncmp(tx->name,"*lava",5)
1547 || !strncmp(tx->name,"*teleport",9)
1548 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1549 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1551 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1552 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1553 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1555 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1557 // replace the texture with black
1558 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1559 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1561 else if (!strncmp(tx->name, "sky", 3))
1562 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1563 else if (!strcmp(tx->name, "caulk"))
1564 tx->basematerialflags = MATERIALFLAG_NODRAW;
1565 else if (tx->skinframes[0] && tx->skinframes[0]->fog)
1566 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1568 // start out with no animation
1569 tx->currentframe = tx;
1570 tx->currentskinframe = tx->skinframes[0];
1574 // sequence the animations
1575 for (i = 0;i < m->nummiptex;i++)
1577 tx = loadmodel->data_textures + i;
1578 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1580 if (tx->anim_total[0] || tx->anim_total[1])
1581 continue; // already sequenced
1583 // find the number of frames in the animation
1584 memset(anims, 0, sizeof(anims));
1585 memset(altanims, 0, sizeof(altanims));
1587 for (j = i;j < m->nummiptex;j++)
1589 tx2 = loadmodel->data_textures + j;
1590 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1594 if (num >= '0' && num <= '9')
1595 anims[num - '0'] = tx2;
1596 else if (num >= 'a' && num <= 'j')
1597 altanims[num - 'a'] = tx2;
1599 Con_Printf("Bad animating texture %s\n", tx->name);
1603 for (j = 0;j < 10;j++)
1610 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1613 for (j = 0;j < max;j++)
1617 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1621 for (j = 0;j < altmax;j++)
1625 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1634 // if there is no alternate animation, duplicate the primary
1635 // animation into the alternate
1637 for (k = 0;k < 10;k++)
1638 altanims[k] = anims[k];
1641 // link together the primary animation
1642 for (j = 0;j < max;j++)
1645 tx2->animated = true;
1646 tx2->anim_total[0] = max;
1647 tx2->anim_total[1] = altmax;
1648 for (k = 0;k < 10;k++)
1650 tx2->anim_frames[0][k] = anims[k];
1651 tx2->anim_frames[1][k] = altanims[k];
1655 // if there really is an alternate anim...
1656 if (anims[0] != altanims[0])
1658 // link together the alternate animation
1659 for (j = 0;j < altmax;j++)
1662 tx2->animated = true;
1663 // the primary/alternate are reversed here
1664 tx2->anim_total[0] = altmax;
1665 tx2->anim_total[1] = max;
1666 for (k = 0;k < 10;k++)
1668 tx2->anim_frames[0][k] = altanims[k];
1669 tx2->anim_frames[1][k] = anims[k];
1676 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1679 unsigned char *in, *out, *data, d;
1680 char litfilename[MAX_QPATH];
1681 char dlitfilename[MAX_QPATH];
1682 fs_offset_t filesize;
1683 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1685 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1686 for (i=0; i<l->filelen; i++)
1687 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1689 else // LordHavoc: bsp version 29 (normal white lighting)
1691 // LordHavoc: hope is not lost yet, check for a .lit file to load
1692 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1693 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1694 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1695 strlcat (litfilename, ".lit", sizeof (litfilename));
1696 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1697 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1700 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1702 i = LittleLong(((int *)data)[1]);
1705 if (developer_loading.integer)
1706 Con_Printf("loaded %s\n", litfilename);
1707 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1708 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1710 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1713 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1715 i = LittleLong(((int *)data)[1]);
1718 if (developer_loading.integer)
1719 Con_Printf("loaded %s\n", dlitfilename);
1720 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1721 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1722 loadmodel->brushq3.deluxemapping_modelspace = false;
1723 loadmodel->brushq3.deluxemapping = true;
1732 Con_Printf("Unknown .lit file version (%d)\n", i);
1734 else if (filesize == 8)
1735 Con_Print("Empty .lit file, ignoring\n");
1737 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1744 // LordHavoc: oh well, expand the white lighting data
1747 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1748 in = mod_base + l->fileofs;
1749 out = loadmodel->brushq1.lightdata;
1750 for (i = 0;i < l->filelen;i++)
1760 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1762 loadmodel->brushq1.num_compressedpvs = 0;
1763 loadmodel->brushq1.data_compressedpvs = NULL;
1766 loadmodel->brushq1.num_compressedpvs = l->filelen;
1767 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1768 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1771 // used only for HalfLife maps
1772 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1774 char key[128], value[4096];
1779 if (!COM_ParseToken_Simple(&data, false, false))
1781 if (com_token[0] != '{')
1785 if (!COM_ParseToken_Simple(&data, false, false))
1787 if (com_token[0] == '}')
1788 break; // end of worldspawn
1789 if (com_token[0] == '_')
1790 strlcpy(key, com_token + 1, sizeof(key));
1792 strlcpy(key, com_token, sizeof(key));
1793 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1794 key[strlen(key)-1] = 0;
1795 if (!COM_ParseToken_Simple(&data, false, false))
1797 dpsnprintf(value, sizeof(value), "%s", com_token);
1798 if (!strcmp("wad", key)) // for HalfLife maps
1800 if (loadmodel->brush.ishlbsp)
1803 for (i = 0;i < (int)sizeof(value);i++)
1804 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1808 for (;i < (int)sizeof(value);i++)
1810 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1811 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1813 else if (value[i] == ';' || value[i] == 0)
1817 strlcpy(wadname, "textures/", sizeof(wadname));
1818 strlcat(wadname, &value[j], sizeof(wadname));
1819 W_LoadTextureWadFile(wadname, false);
1831 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1833 loadmodel->brush.entities = NULL;
1836 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1837 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1838 if (loadmodel->brush.ishlbsp)
1839 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1843 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1849 in = (dvertex_t *)(mod_base + l->fileofs);
1850 if (l->filelen % sizeof(*in))
1851 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1852 count = l->filelen / sizeof(*in);
1853 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1855 loadmodel->brushq1.vertexes = out;
1856 loadmodel->brushq1.numvertexes = count;
1858 for ( i=0 ; i<count ; i++, in++, out++)
1860 out->position[0] = LittleFloat(in->point[0]);
1861 out->position[1] = LittleFloat(in->point[1]);
1862 out->position[2] = LittleFloat(in->point[2]);
1866 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1867 // can be used for this
1869 int SB_ReadInt (unsigned char **buffer)
1872 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1878 float SB_ReadFloat (unsigned char **buffer)
1886 u.i = SB_ReadInt (buffer);
1890 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1892 unsigned char *index;
1896 index = (unsigned char *)(mod_base + l->fileofs);
1897 if (l->filelen % (48+4*hullinfo->filehulls))
1898 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1900 count = l->filelen / (48+4*hullinfo->filehulls);
1901 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1903 loadmodel->brushq1.submodels = out;
1904 loadmodel->brush.numsubmodels = count;
1906 for (i = 0; i < count; i++, out++)
1908 // spread out the mins / maxs by a pixel
1909 out->mins[0] = SB_ReadFloat (&index) - 1;
1910 out->mins[1] = SB_ReadFloat (&index) - 1;
1911 out->mins[2] = SB_ReadFloat (&index) - 1;
1912 out->maxs[0] = SB_ReadFloat (&index) + 1;
1913 out->maxs[1] = SB_ReadFloat (&index) + 1;
1914 out->maxs[2] = SB_ReadFloat (&index) + 1;
1915 out->origin[0] = SB_ReadFloat (&index);
1916 out->origin[1] = SB_ReadFloat (&index);
1917 out->origin[2] = SB_ReadFloat (&index);
1918 for (j = 0; j < hullinfo->filehulls; j++)
1919 out->headnode[j] = SB_ReadInt (&index);
1920 out->visleafs = SB_ReadInt (&index);
1921 out->firstface = SB_ReadInt (&index);
1922 out->numfaces = SB_ReadInt (&index);
1926 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1932 in = (dedge_t *)(mod_base + l->fileofs);
1933 if (l->filelen % sizeof(*in))
1934 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1935 count = l->filelen / sizeof(*in);
1936 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1938 loadmodel->brushq1.edges = out;
1939 loadmodel->brushq1.numedges = count;
1941 for ( i=0 ; i<count ; i++, in++, out++)
1943 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1944 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1945 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1947 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);
1954 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1958 int i, j, k, count, miptex;
1960 in = (texinfo_t *)(mod_base + l->fileofs);
1961 if (l->filelen % sizeof(*in))
1962 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1963 count = l->filelen / sizeof(*in);
1964 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1966 loadmodel->brushq1.texinfo = out;
1967 loadmodel->brushq1.numtexinfo = count;
1969 for (i = 0;i < count;i++, in++, out++)
1971 for (k = 0;k < 2;k++)
1972 for (j = 0;j < 4;j++)
1973 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1975 miptex = LittleLong(in->miptex);
1976 out->flags = LittleLong(in->flags);
1978 out->texture = NULL;
1979 if (loadmodel->data_textures)
1981 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1982 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1984 out->texture = loadmodel->data_textures + miptex;
1986 if (out->flags & TEX_SPECIAL)
1988 // if texture chosen is NULL or the shader needs a lightmap,
1989 // force to notexture water shader
1990 if (out->texture == NULL)
1991 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1995 // if texture chosen is NULL, force to notexture
1996 if (out->texture == NULL)
1997 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2003 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2008 mins[0] = mins[1] = mins[2] = 9999;
2009 maxs[0] = maxs[1] = maxs[2] = -9999;
2011 for (i = 0;i < numverts;i++)
2013 for (j = 0;j < 3;j++, v++)
2023 #define MAX_SUBDIVPOLYTRIANGLES 4096
2024 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2026 static int subdivpolyverts, subdivpolytriangles;
2027 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2028 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2030 static int subdivpolylookupvert(vec3_t v)
2033 for (i = 0;i < subdivpolyverts;i++)
2034 if (subdivpolyvert[i][0] == v[0]
2035 && subdivpolyvert[i][1] == v[1]
2036 && subdivpolyvert[i][2] == v[2])
2038 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2039 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2040 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2041 return subdivpolyverts++;
2044 static void SubdividePolygon(int numverts, float *verts)
2046 int i, i1, i2, i3, f, b, c, p;
2047 vec3_t mins, maxs, front[256], back[256];
2048 float m, *pv, *cv, dist[256], frac;
2051 Host_Error("SubdividePolygon: ran out of verts in buffer");
2053 BoundPoly(numverts, verts, mins, maxs);
2055 for (i = 0;i < 3;i++)
2057 m = (mins[i] + maxs[i]) * 0.5;
2058 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2059 if (maxs[i] - m < 8)
2061 if (m - mins[i] < 8)
2065 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2066 dist[c] = cv[i] - m;
2069 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2073 VectorCopy(pv, front[f]);
2078 VectorCopy(pv, back[b]);
2081 if (dist[p] == 0 || dist[c] == 0)
2083 if ((dist[p] > 0) != (dist[c] > 0) )
2086 frac = dist[p] / (dist[p] - dist[c]);
2087 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2088 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2089 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2095 SubdividePolygon(f, front[0]);
2096 SubdividePolygon(b, back[0]);
2100 i1 = subdivpolylookupvert(verts);
2101 i2 = subdivpolylookupvert(verts + 3);
2102 for (i = 2;i < numverts;i++)
2104 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2106 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2110 i3 = subdivpolylookupvert(verts + i * 3);
2111 subdivpolyindex[subdivpolytriangles][0] = i1;
2112 subdivpolyindex[subdivpolytriangles][1] = i2;
2113 subdivpolyindex[subdivpolytriangles][2] = i3;
2115 subdivpolytriangles++;
2119 //Breaks a polygon up along axial 64 unit
2120 //boundaries so that turbulent and sky warps
2121 //can be done reasonably.
2122 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2128 subdivpolytriangles = 0;
2129 subdivpolyverts = 0;
2130 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2131 if (subdivpolytriangles < 1)
2132 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2134 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2135 mesh->num_vertices = subdivpolyverts;
2136 mesh->num_triangles = subdivpolytriangles;
2137 mesh->vertex = (surfvertex_t *)(mesh + 1);
2138 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2139 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2141 for (i = 0;i < mesh->num_triangles;i++)
2142 for (j = 0;j < 3;j++)
2143 mesh->index[i*3+j] = subdivpolyindex[i][j];
2145 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2147 VectorCopy(subdivpolyvert[i], v->v);
2148 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2149 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2154 /* Maximum size of a single LM */
2155 #define MAX_SINGLE_LM_SIZE 256
2163 struct alloc_lm_state
2166 struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2169 static void init_alloc_lm_state (struct alloc_lm_state* state)
2173 state->currentY = 0;
2174 for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2176 state->rows[r].currentX = 0;
2177 state->rows[r].rowY = -1;
2181 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2183 struct alloc_lm_row* row;
2186 row = &(state->rows[blockheight]);
2187 if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2189 if (state->currentY + blockheight <= totalheight)
2191 row->rowY = state->currentY;
2193 state->currentY += blockheight;
2197 /* See if we can stuff the block into a higher row */
2199 for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2201 if ((state->rows[r].rowY >= 0)
2202 && (state->rows[r].currentX + blockwidth <= totalwidth))
2204 row = &(state->rows[r]);
2208 if (row == NULL) return false;
2212 *outx = row->currentX;
2213 row->currentX += blockwidth;
2218 extern cvar_t gl_max_size;
2219 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2222 msurface_t *surface;
2223 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2224 float texmins[2], texmaxs[2], val;
2225 rtexture_t *lightmaptexture, *deluxemaptexture;
2227 in = (dface_t *)(mod_base + l->fileofs);
2228 if (l->filelen % sizeof(*in))
2229 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2230 count = l->filelen / sizeof(*in);
2231 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2232 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2234 loadmodel->num_surfaces = count;
2238 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2240 numedges = (unsigned short)LittleShort(in->numedges);
2241 totalverts += numedges;
2242 totaltris += numedges - 2;
2245 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2247 lightmaptexture = NULL;
2248 deluxemaptexture = r_texture_blanknormalmap;
2250 lightmapsize = max(256, gl_max_size.integer);
2251 totallightmapsamples = 0;
2255 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2257 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2259 // FIXME: validate edges, texinfo, etc?
2260 firstedge = LittleLong(in->firstedge);
2261 numedges = (unsigned short)LittleShort(in->numedges);
2262 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)
2263 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2264 i = (unsigned short)LittleShort(in->texinfo);
2265 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2266 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2267 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2268 surface->texture = surface->lightmapinfo->texinfo->texture;
2270 planenum = (unsigned short)LittleShort(in->planenum);
2271 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2272 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2274 //surface->flags = surface->texture->flags;
2275 //if (LittleShort(in->side))
2276 // surface->flags |= SURF_PLANEBACK;
2277 //surface->plane = loadmodel->brush.data_planes + planenum;
2279 surface->num_firstvertex = totalverts;
2280 surface->num_vertices = numedges;
2281 surface->num_firsttriangle = totaltris;
2282 surface->num_triangles = numedges - 2;
2283 totalverts += numedges;
2284 totaltris += numedges - 2;
2286 // convert edges back to a normal polygon
2287 for (i = 0;i < surface->num_vertices;i++)
2289 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2292 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2294 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2295 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2296 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2297 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2298 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2299 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2300 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2301 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2304 for (i = 0;i < surface->num_triangles;i++)
2306 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2307 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2308 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2311 // compile additional data about the surface geometry
2312 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);
2313 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);
2314 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2316 // generate surface extents information
2317 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2318 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2319 for (i = 1;i < surface->num_vertices;i++)
2321 for (j = 0;j < 2;j++)
2323 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2324 texmins[j] = min(texmins[j], val);
2325 texmaxs[j] = max(texmaxs[j], val);
2328 for (i = 0;i < 2;i++)
2330 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2331 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2334 smax = surface->lightmapinfo->extents[0] >> 4;
2335 tmax = surface->lightmapinfo->extents[1] >> 4;
2336 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2337 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2340 for (i = 0;i < MAXLIGHTMAPS;i++)
2341 surface->lightmapinfo->styles[i] = in->styles[i];
2342 surface->lightmaptexture = NULL;
2343 surface->deluxemaptexture = r_texture_blanknormalmap;
2344 i = LittleLong(in->lightofs);
2347 surface->lightmapinfo->samples = NULL;
2348 // give non-lightmapped water a 1x white lightmap
2349 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2351 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2352 surface->lightmapinfo->styles[0] = 0;
2353 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2356 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2357 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2358 else // LordHavoc: white lighting (bsp version 29)
2360 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2361 if (loadmodel->brushq1.nmaplightdata)
2362 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2365 // check if we should apply a lightmap to this
2366 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2368 if (ssize > 256 || tsize > 256)
2369 Host_Error("Bad surface extents");
2371 if (lightmapsize < ssize)
2372 lightmapsize = ssize;
2373 if (lightmapsize < tsize)
2374 lightmapsize = tsize;
2376 totallightmapsamples += ssize*tsize;
2378 // force lightmap upload on first time seeing the surface
2380 // additionally this is used by the later code to see if a
2381 // lightmap is needed on this surface (rather than duplicating the
2383 surface->cached_dlight = true;
2387 // small maps (such as ammo boxes especially) don't need big lightmap
2388 // textures, so this code tries to guess a good size based on
2389 // totallightmapsamples (size of the lightmaps lump basically), as well as
2390 // trying to max out the gl_max_size if there is a lot of lightmap data to
2392 // additionally, never choose a lightmapsize that is smaller than the
2393 // largest surface encountered (as it would fail)
2395 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2398 // now that we've decided the lightmap texture size, we can do the rest
2399 if (cls.state != ca_dedicated)
2401 struct alloc_lm_state allocState;
2403 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2405 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2406 float u, v, ubase, vbase, uscale, vscale;
2408 smax = surface->lightmapinfo->extents[0] >> 4;
2409 tmax = surface->lightmapinfo->extents[1] >> 4;
2410 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2411 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2413 if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2415 // allocate a texture pool if we need it
2416 if (loadmodel->texturepool == NULL)
2417 loadmodel->texturepool = R_AllocTexturePool();
2418 // could not find room, make a new lightmap
2419 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2420 if (loadmodel->brushq1.nmaplightdata)
2421 deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2423 init_alloc_lm_state (&allocState);
2424 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2426 surface->lightmaptexture = lightmaptexture;
2427 surface->deluxemaptexture = deluxemaptexture;
2428 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2429 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2431 uscale = 1.0f / (float)lightmapsize;
2432 vscale = 1.0f / (float)lightmapsize;
2433 ubase = lightmapx * uscale;
2434 vbase = lightmapy * vscale;
2436 for (i = 0;i < surface->num_vertices;i++)
2438 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);
2439 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);
2440 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2441 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2442 // LordHavoc: calc lightmap data offset for vertex lighting to use
2445 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2450 if (cl_stainmaps.integer)
2452 // allocate stainmaps for permanent marks on walls
2453 int stainmapsize = 0;
2454 unsigned char *stainsamples = NULL;
2455 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2457 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2458 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2459 stainmapsize += ssize * tsize * 3;
2461 // allocate and clear to white
2462 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2463 memset(stainsamples, 255, stainmapsize);
2465 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2467 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2468 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2469 surface->lightmapinfo->stainsamples = stainsamples;
2470 stainsamples += ssize * tsize * 3;
2475 // generate ushort elements array if possible
2476 if (loadmodel->surfmesh.data_element3s)
2477 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2478 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2481 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2484 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2485 node->parent = parent;
2488 // this is a node, recurse to children
2489 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2490 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2491 // combine supercontents of children
2492 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2497 mleaf_t *leaf = (mleaf_t *)node;
2498 // if this is a leaf, calculate supercontents mask from all collidable
2499 // primitives in the leaf (brushes and collision surfaces)
2500 // also flag if the leaf contains any collision surfaces
2501 leaf->combinedsupercontents = 0;
2502 // combine the supercontents values of all brushes in this leaf
2503 for (j = 0;j < leaf->numleafbrushes;j++)
2504 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2505 // check if this leaf contains any collision surfaces (q3 patches)
2506 for (j = 0;j < leaf->numleafsurfaces;j++)
2508 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2509 if (surface->num_collisiontriangles)
2511 leaf->containscollisionsurfaces = true;
2512 leaf->combinedsupercontents |= surface->texture->supercontents;
2518 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2524 in = (dnode_t *)(mod_base + l->fileofs);
2525 if (l->filelen % sizeof(*in))
2526 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2527 count = l->filelen / sizeof(*in);
2528 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2530 loadmodel->brush.data_nodes = out;
2531 loadmodel->brush.num_nodes = count;
2533 for ( i=0 ; i<count ; i++, in++, out++)
2535 for (j=0 ; j<3 ; j++)
2537 out->mins[j] = LittleShort(in->mins[j]);
2538 out->maxs[j] = LittleShort(in->maxs[j]);
2541 p = LittleLong(in->planenum);
2542 out->plane = loadmodel->brush.data_planes + p;
2544 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2545 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2547 for (j=0 ; j<2 ; j++)
2549 // LordHavoc: this code supports broken bsp files produced by
2550 // arguire qbsp which can produce more than 32768 nodes, any value
2551 // below count is assumed to be a node number, any other value is
2552 // assumed to be a leaf number
2553 p = (unsigned short)LittleShort(in->children[j]);
2556 if (p < loadmodel->brush.num_nodes)
2557 out->children[j] = loadmodel->brush.data_nodes + p;
2560 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2561 // map it to the solid leaf
2562 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2567 // note this uses 65535 intentionally, -1 is leaf 0
2569 if (p < loadmodel->brush.num_leafs)
2570 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2573 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2574 // map it to the solid leaf
2575 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2581 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2584 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2590 in = (dleaf_t *)(mod_base + l->fileofs);
2591 if (l->filelen % sizeof(*in))
2592 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2593 count = l->filelen / sizeof(*in);
2594 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2596 loadmodel->brush.data_leafs = out;
2597 loadmodel->brush.num_leafs = count;
2598 // get visleafs from the submodel data
2599 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2600 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2601 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2602 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2604 for ( i=0 ; i<count ; i++, in++, out++)
2606 for (j=0 ; j<3 ; j++)
2608 out->mins[j] = LittleShort(in->mins[j]);
2609 out->maxs[j] = LittleShort(in->maxs[j]);
2612 // FIXME: this function could really benefit from some error checking
2614 out->contents = LittleLong(in->contents);
2616 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2617 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2618 if (out->firstleafsurface < 0 || (unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2620 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);
2621 out->firstleafsurface = NULL;
2622 out->numleafsurfaces = 0;
2625 out->clusterindex = i - 1;
2626 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2627 out->clusterindex = -1;
2629 p = LittleLong(in->visofs);
2630 // ignore visofs errors on leaf 0 (solid)
2631 if (p >= 0 && out->clusterindex >= 0)
2633 if (p >= loadmodel->brushq1.num_compressedpvs)
2634 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2636 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);
2639 for (j = 0;j < 4;j++)
2640 out->ambient_sound_level[j] = in->ambient_level[j];
2642 // FIXME: Insert caustics here
2646 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2650 const unsigned char *pvs;
2651 // if there's no vis data, assume supported (because everything is visible all the time)
2652 if (!loadmodel->brush.data_pvsclusters)
2654 // check all liquid leafs to see if they can see into empty leafs, if any
2655 // can we can assume this map supports r_wateralpha
2656 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2658 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2660 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2661 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2662 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2669 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2676 in = (dclipnode_t *)(mod_base + l->fileofs);
2677 if (l->filelen % sizeof(*in))
2678 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2679 count = l->filelen / sizeof(*in);
2680 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2682 loadmodel->brushq1.clipnodes = out;
2683 loadmodel->brushq1.numclipnodes = count;
2685 for (i = 1; i < MAX_MAP_HULLS; i++)
2687 hull = &loadmodel->brushq1.hulls[i];
2688 hull->clipnodes = out;
2689 hull->firstclipnode = 0;
2690 hull->lastclipnode = count-1;
2691 hull->planes = loadmodel->brush.data_planes;
2692 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2693 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2694 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2695 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2696 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2697 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2698 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2701 for (i=0 ; i<count ; i++, out++, in++)
2703 out->planenum = LittleLong(in->planenum);
2704 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2705 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2706 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2707 if (out->children[0] >= count)
2708 out->children[0] -= 65536;
2709 if (out->children[1] >= count)
2710 out->children[1] -= 65536;
2711 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2712 Host_Error("Corrupt clipping hull(out of range planenum)");
2716 //Duplicate the drawing hull structure as a clipping hull
2717 static void Mod_Q1BSP_MakeHull0(void)
2724 hull = &loadmodel->brushq1.hulls[0];
2726 in = loadmodel->brush.data_nodes;
2727 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2729 hull->clipnodes = out;
2730 hull->firstclipnode = 0;
2731 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2732 hull->planes = loadmodel->brush.data_planes;
2734 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2736 out->planenum = in->plane - loadmodel->brush.data_planes;
2737 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2738 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2742 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2747 in = (short *)(mod_base + l->fileofs);
2748 if (l->filelen % sizeof(*in))
2749 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2750 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2751 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2753 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2755 j = (unsigned short) LittleShort(in[i]);
2756 if (j >= loadmodel->num_surfaces)
2757 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2758 loadmodel->brush.data_leafsurfaces[i] = j;
2762 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2767 in = (int *)(mod_base + l->fileofs);
2768 if (l->filelen % sizeof(*in))
2769 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2770 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2771 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2773 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2774 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2778 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2784 in = (dplane_t *)(mod_base + l->fileofs);
2785 if (l->filelen % sizeof(*in))
2786 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2788 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2789 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2791 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2793 out->normal[0] = LittleFloat(in->normal[0]);
2794 out->normal[1] = LittleFloat(in->normal[1]);
2795 out->normal[2] = LittleFloat(in->normal[2]);
2796 out->dist = LittleFloat(in->dist);
2802 static void Mod_Q1BSP_LoadMapBrushes(void)
2806 int submodel, numbrushes;
2807 qboolean firstbrush;
2808 char *text, *maptext;
2809 char mapfilename[MAX_QPATH];
2810 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2811 strlcat (mapfilename, ".map", sizeof (mapfilename));
2812 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2816 if (!COM_ParseToken_Simple(&data, false, false))
2821 if (!COM_ParseToken_Simple(&data, false, false))
2823 if (com_token[0] != '{')
2829 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2832 if (!COM_ParseToken_Simple(&data, false, false))
2834 if (com_token[0] == '}')
2835 break; // end of entity
2836 if (com_token[0] == '{')
2843 if (submodel > loadmodel->brush.numsubmodels)
2845 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2849 model = loadmodel->brush.submodels[submodel];
2856 if (!COM_ParseToken_Simple(&data, false, false))
2858 if (com_token[0] == '}')
2859 break; // end of brush
2860 // each brush face should be this format:
2861 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2862 // FIXME: support hl .map format
2863 for (pointnum = 0;pointnum < 3;pointnum++)
2865 COM_ParseToken_Simple(&data, false, false);
2866 for (componentnum = 0;componentnum < 3;componentnum++)
2868 COM_ParseToken_Simple(&data, false, false);
2869 point[pointnum][componentnum] = atof(com_token);
2871 COM_ParseToken_Simple(&data, false, false);
2873 COM_ParseToken_Simple(&data, false, false);
2874 strlcpy(facetexture, com_token, sizeof(facetexture));
2875 COM_ParseToken_Simple(&data, false, false);
2876 //scroll_s = atof(com_token);
2877 COM_ParseToken_Simple(&data, false, false);
2878 //scroll_t = atof(com_token);
2879 COM_ParseToken_Simple(&data, false, false);
2880 //rotate = atof(com_token);
2881 COM_ParseToken_Simple(&data, false, false);
2882 //scale_s = atof(com_token);
2883 COM_ParseToken_Simple(&data, false, false);
2884 //scale_t = atof(com_token);
2885 TriangleNormal(point[0], point[1], point[2], planenormal);
2886 VectorNormalizeDouble(planenormal);
2887 planedist = DotProduct(point[0], planenormal);
2888 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2898 #define MAX_PORTALPOINTS 64
2900 typedef struct portal_s
2903 mnode_t *nodes[2]; // [0] = front side of plane
2904 struct portal_s *next[2];
2906 double points[3*MAX_PORTALPOINTS];
2907 struct portal_s *chain; // all portals are linked into a list
2911 static portal_t *portalchain;
2918 static portal_t *AllocPortal(void)
2921 p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2922 p->chain = portalchain;
2927 static void FreePortal(portal_t *p)
2932 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2934 // process only nodes (leafs already had their box calculated)
2938 // calculate children first
2939 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2940 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2942 // make combined bounding box from children
2943 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2944 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2945 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2946 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2947 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2948 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2951 static void Mod_Q1BSP_FinalizePortals(void)
2953 int i, j, numportals, numpoints;
2954 portal_t *p, *pnext;
2957 mleaf_t *leaf, *endleaf;
2959 // tally up portal and point counts and recalculate bounding boxes for all
2960 // leafs (because qbsp is very sloppy)
2961 leaf = loadmodel->brush.data_leafs;
2962 endleaf = leaf + loadmodel->brush.num_leafs;
2963 for (;leaf < endleaf;leaf++)
2965 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2966 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2973 // note: this check must match the one below or it will usually corrupt memory
2974 // 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
2975 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2978 numpoints += p->numpoints * 2;
2982 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2983 loadmodel->brush.num_portals = numportals;
2984 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2985 loadmodel->brush.num_portalpoints = numpoints;
2986 // clear all leaf portal chains
2987 for (i = 0;i < loadmodel->brush.num_leafs;i++)
2988 loadmodel->brush.data_leafs[i].portals = NULL;
2989 // process all portals in the global portal chain, while freeing them
2990 portal = loadmodel->brush.data_portals;
2991 point = loadmodel->brush.data_portalpoints;
2998 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3000 // note: this check must match the one above or it will usually corrupt memory
3001 // 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
3002 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3004 // first make the back to front portal(forward portal)
3005 portal->points = point;
3006 portal->numpoints = p->numpoints;
3007 portal->plane.dist = p->plane.dist;
3008 VectorCopy(p->plane.normal, portal->plane.normal);
3009 portal->here = (mleaf_t *)p->nodes[1];
3010 portal->past = (mleaf_t *)p->nodes[0];
3012 for (j = 0;j < portal->numpoints;j++)
3014 VectorCopy(p->points + j*3, point->position);
3017 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3018 PlaneClassify(&portal->plane);
3020 // link into leaf's portal chain
3021 portal->next = portal->here->portals;
3022 portal->here->portals = portal;
3024 // advance to next portal
3027 // then make the front to back portal(backward portal)
3028 portal->points = point;
3029 portal->numpoints = p->numpoints;
3030 portal->plane.dist = -p->plane.dist;
3031 VectorNegate(p->plane.normal, portal->plane.normal);
3032 portal->here = (mleaf_t *)p->nodes[0];
3033 portal->past = (mleaf_t *)p->nodes[1];
3035 for (j = portal->numpoints - 1;j >= 0;j--)
3037 VectorCopy(p->points + j*3, point->position);
3040 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3041 PlaneClassify(&portal->plane);
3043 // link into leaf's portal chain
3044 portal->next = portal->here->portals;
3045 portal->here->portals = portal;
3047 // advance to next portal
3050 // add the portal's polygon points to the leaf bounding boxes
3051 for (i = 0;i < 2;i++)
3053 leaf = (mleaf_t *)p->nodes[i];
3054 for (j = 0;j < p->numpoints;j++)
3056 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3057 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3058 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3059 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3060 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3061 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3068 // now recalculate the node bounding boxes from the leafs
3069 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
3077 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3080 Host_Error("AddPortalToNodes: NULL front node");
3082 Host_Error("AddPortalToNodes: NULL back node");
3083 if (p->nodes[0] || p->nodes[1])
3084 Host_Error("AddPortalToNodes: already included");
3085 // 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
3087 p->nodes[0] = front;
3088 p->next[0] = (portal_t *)front->portals;
3089 front->portals = (mportal_t *)p;
3092 p->next[1] = (portal_t *)back->portals;
3093 back->portals = (mportal_t *)p;
3098 RemovePortalFromNode
3101 static void RemovePortalFromNodes(portal_t *portal)
3105 void **portalpointer;
3107 for (i = 0;i < 2;i++)
3109 node = portal->nodes[i];
3111 portalpointer = (void **) &node->portals;
3114 t = (portal_t *)*portalpointer;
3116 Host_Error("RemovePortalFromNodes: portal not in leaf");
3120 if (portal->nodes[0] == node)
3122 *portalpointer = portal->next[0];
3123 portal->nodes[0] = NULL;
3125 else if (portal->nodes[1] == node)
3127 *portalpointer = portal->next[1];
3128 portal->nodes[1] = NULL;
3131 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3135 if (t->nodes[0] == node)
3136 portalpointer = (void **) &t->next[0];
3137 else if (t->nodes[1] == node)
3138 portalpointer = (void **) &t->next[1];
3140 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3145 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3146 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3149 mnode_t *front, *back, *other_node;
3150 mplane_t clipplane, *plane;
3151 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3152 int numfrontpoints, numbackpoints;
3153 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3155 // if a leaf, we're done
3159 plane = node->plane;
3161 front = node->children[0];
3162 back = node->children[1];
3164 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3166 // create the new portal by generating a polygon for the node plane,
3167 // and clipping it by all of the other portals(which came from nodes above this one)
3168 nodeportal = AllocPortal();
3169 nodeportal->plane = *plane;
3171 // 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)
3172 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);
3173 nodeportal->numpoints = 4;
3174 side = 0; // shut up compiler warning
3175 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3177 clipplane = portal->plane;
3178 if (portal->nodes[0] == portal->nodes[1])
3179 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3180 if (portal->nodes[0] == node)
3182 else if (portal->nodes[1] == node)
3184 clipplane.dist = -clipplane.dist;
3185 VectorNegate(clipplane.normal, clipplane.normal);
3189 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3191 for (i = 0;i < nodeportal->numpoints*3;i++)
3192 frontpoints[i] = nodeportal->points[i];
3193 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);
3194 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3198 if (nodeportal->numpoints < 3)
3200 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3201 nodeportal->numpoints = 0;
3203 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3205 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3206 nodeportal->numpoints = 0;
3209 AddPortalToNodes(nodeportal, front, back);
3211 // split the portals of this node along this node's plane and assign them to the children of this node
3212 // (migrating the portals downward through the tree)
3213 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3215 if (portal->nodes[0] == portal->nodes[1])
3216 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3217 if (portal->nodes[0] == node)
3219 else if (portal->nodes[1] == node)
3222 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3223 nextportal = portal->next[side];
3224 if (!portal->numpoints)
3227 other_node = portal->nodes[!side];
3228 RemovePortalFromNodes(portal);
3230 // cut the portal into two portals, one on each side of the node plane
3231 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);
3233 if (!numfrontpoints)
3236 AddPortalToNodes(portal, back, other_node);
3238 AddPortalToNodes(portal, other_node, back);
3244 AddPortalToNodes(portal, front, other_node);
3246 AddPortalToNodes(portal, other_node, front);
3250 // the portal is split
3251 splitportal = AllocPortal();
3252 temp = splitportal->chain;
3253 *splitportal = *portal;
3254 splitportal->chain = temp;
3255 for (i = 0;i < numbackpoints*3;i++)
3256 splitportal->points[i] = backpoints[i];
3257 splitportal->numpoints = numbackpoints;
3258 for (i = 0;i < numfrontpoints*3;i++)
3259 portal->points[i] = frontpoints[i];
3260 portal->numpoints = numfrontpoints;
3264 AddPortalToNodes(portal, front, other_node);
3265 AddPortalToNodes(splitportal, back, other_node);
3269 AddPortalToNodes(portal, other_node, front);
3270 AddPortalToNodes(splitportal, other_node, back);
3274 Mod_Q1BSP_RecursiveNodePortals(front);
3275 Mod_Q1BSP_RecursiveNodePortals(back);
3278 static void Mod_Q1BSP_MakePortals(void)
3281 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3282 Mod_Q1BSP_FinalizePortals();
3285 //Returns PVS data for a given point
3286 //(note: can return NULL)
3287 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3290 node = model->brush.data_nodes;
3292 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3293 if (((mleaf_t *)node)->clusterindex >= 0)
3294 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3299 static void Mod_Q1BSP_FatPVS_RecursiveBSPNode(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbytes, mnode_t *node)
3303 float d = PlaneDiff(org, node->plane);
3305 node = node->children[0];
3306 else if (d < -radius)
3307 node = node->children[1];
3310 // go down both sides
3311 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3312 node = node->children[1];
3315 // if this leaf is in a cluster, accumulate the pvs bits
3316 if (((mleaf_t *)node)->clusterindex >= 0)
3319 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3320 for (i = 0;i < pvsbytes;i++)
3321 pvsbuffer[i] |= pvs[i];
3325 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3326 //of the given point.
3327 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3329 int bytes = model->brush.num_pvsclusterbytes;
3330 bytes = min(bytes, pvsbufferlength);
3331 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3333 memset(pvsbuffer, 0xFF, bytes);
3337 memset(pvsbuffer, 0, bytes);
3338 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3342 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3347 VectorSubtract(inmaxs, inmins, size);
3348 if (cmodel->brush.ishlbsp)
3351 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3352 else if (size[0] <= 32)
3354 if (size[2] < 54) // pick the nearest of 36 or 72
3355 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3357 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3360 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3365 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3366 else if (size[0] <= 32)
3367 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3369 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3371 VectorCopy(inmins, outmins);
3372 VectorAdd(inmins, hull->clip_size, outmaxs);
3375 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3380 mempool_t *mainmempool;
3381 float dist, modelyawradius, modelradius, *vec;
3382 msurface_t *surface;
3383 int numshadowmeshtriangles;
3384 hullinfo_t hullinfo;
3385 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3386 model_brush_lightstyleinfo_t styleinfo[256];
3387 unsigned char *datapointer;
3389 mod->modeldatatypestring = "Q1BSP";
3391 mod->type = mod_brushq1;
3393 header = (dheader_t *)buffer;
3395 i = LittleLong(header->version);
3396 if (i != BSPVERSION && i != 30)
3397 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3398 mod->brush.ishlbsp = i == 30;
3400 // fill in hull info
3401 VectorClear (hullinfo.hullsizes[0][0]);
3402 VectorClear (hullinfo.hullsizes[0][1]);
3403 if (mod->brush.ishlbsp)
3405 mod->modeldatatypestring = "HLBSP";
3407 hullinfo.filehulls = 4;
3408 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3409 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3410 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3411 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3412 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3413 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3417 hullinfo.filehulls = 4;
3418 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3419 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3420 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3421 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3425 mod_base = (unsigned char*)buffer;
3426 for (i = 0; i < HEADER_LUMPS; i++)
3428 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3429 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3432 mod->soundfromcenter = true;
3433 mod->TraceBox = Mod_Q1BSP_TraceBox;
3434 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3435 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3436 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3437 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3438 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3439 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3440 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3441 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3442 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3443 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3444 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3445 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3446 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3447 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3448 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3450 if (loadmodel->isworldmodel)
3451 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3455 mod->brush.qw_md4sum = 0;
3456 mod->brush.qw_md4sum2 = 0;
3457 for (i = 0;i < HEADER_LUMPS;i++)
3459 if (i == LUMP_ENTITIES)
3461 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3462 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3464 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3467 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3468 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3469 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3470 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3471 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3472 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3473 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3474 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3475 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3476 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3477 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3478 // load submodels before leafs because they contain the number of vis leafs
3479 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3480 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3481 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3482 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3484 // check if the map supports transparent water rendering
3485 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3487 if (mod->brushq1.data_compressedpvs)
3488 Mem_Free(mod->brushq1.data_compressedpvs);
3489 mod->brushq1.data_compressedpvs = NULL;
3490 mod->brushq1.num_compressedpvs = 0;
3492 Mod_Q1BSP_MakeHull0();
3493 Mod_Q1BSP_MakePortals();
3495 mod->numframes = 2; // regular and alternate animation
3498 mainmempool = mod->mempool;
3500 // make a single combined shadow mesh to allow optimized shadow volume creation
3501 numshadowmeshtriangles = 0;
3502 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3504 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3505 numshadowmeshtriangles += surface->num_triangles;
3507 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3508 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3509 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));
3510 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3511 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3513 if (loadmodel->brush.numsubmodels)
3514 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3516 // LordHavoc: to clear the fog around the original quake submodel code, I
3518 // first of all, some background info on the submodels:
3519 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3520 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3521 // now the weird for loop itself:
3522 // the loop functions in an odd way, on each iteration it sets up the
3523 // current 'mod' model (which despite the confusing code IS the model of
3524 // the number i), at the end of the loop it duplicates the model to become
3525 // the next submodel, and loops back to set up the new submodel.
3527 // LordHavoc: now the explanation of my sane way (which works identically):
3528 // set up the world model, then on each submodel copy from the world model
3529 // and set up the submodel with the respective model info.
3530 totalstylesurfaces = 0;
3532 for (i = 0;i < mod->brush.numsubmodels;i++)
3534 memset(stylecounts, 0, sizeof(stylecounts));
3535 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3537 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3538 for (j = 0;j < MAXLIGHTMAPS;j++)
3539 stylecounts[surface->lightmapinfo->styles[j]]++;
3541 for (k = 0;k < 255;k++)
3545 totalstylesurfaces += stylecounts[k];
3548 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3549 for (i = 0;i < mod->brush.numsubmodels;i++)
3551 // LordHavoc: this code was originally at the end of this loop, but
3552 // has been transformed to something more readable at the start here.
3557 // LordHavoc: only register submodels if it is the world
3558 // (prevents external bsp models from replacing world submodels with
3560 if (!loadmodel->isworldmodel)
3562 // duplicate the basic information
3563 dpsnprintf(name, sizeof(name), "*%i", i);
3564 mod = Mod_FindName(name);
3565 // copy the base model to this one
3567 // rename the clone back to its proper name
3568 strlcpy(mod->name, name, sizeof(mod->name));
3569 // textures and memory belong to the main model
3570 mod->texturepool = NULL;
3571 mod->mempool = NULL;
3574 mod->brush.submodel = i;
3576 if (loadmodel->brush.submodels)
3577 loadmodel->brush.submodels[i] = mod;
3579 bm = &mod->brushq1.submodels[i];
3581 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3582 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3584 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3585 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3588 mod->firstmodelsurface = bm->firstface;
3589 mod->nummodelsurfaces = bm->numfaces;
3591 // make the model surface list (used by shadowing/lighting)
3592 mod->surfacelist = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3593 for (j = 0;j < mod->nummodelsurfaces;j++)
3594 mod->surfacelist[j] = mod->firstmodelsurface + j;
3596 // this gets altered below if sky or water is used
3597 mod->DrawSky = NULL;
3598 mod->DrawAddWaterPlanes = NULL;
3599 mod->Draw = R_Q1BSP_Draw;
3600 mod->DrawDepth = R_Q1BSP_DrawDepth;
3601 mod->DrawDebug = R_Q1BSP_DrawDebug;
3602 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3603 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3604 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3605 mod->DrawLight = R_Q1BSP_DrawLight;
3608 mod->brush.TraceLineOfSight = NULL;
3609 mod->brush.GetPVS = NULL;
3610 mod->brush.FatPVS = NULL;
3611 mod->brush.BoxTouchingPVS = NULL;
3612 mod->brush.BoxTouchingLeafPVS = NULL;
3613 mod->brush.BoxTouchingVisibleLeafs = NULL;
3614 mod->brush.FindBoxClusters = NULL;
3615 mod->brush.LightPoint = NULL;
3616 mod->brush.AmbientSoundLevelsForPoint = NULL;
3618 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3619 VectorCopy(bm->mins, mod->normalmins);
3620 VectorCopy(bm->maxs, mod->normalmaxs);
3621 VectorCopy(bm->mins, mod->yawmins);
3622 VectorCopy(bm->maxs, mod->yawmaxs);
3623 VectorCopy(bm->mins, mod->rotatedmins);
3624 VectorCopy(bm->maxs, mod->rotatedmaxs);
3625 if (mod->nummodelsurfaces)
3629 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3631 // we only need to have a drawsky function if it is used(usually only on world model)
3632 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3633 mod->DrawSky = R_Q1BSP_DrawSky;
3634 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3635 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3636 // calculate bounding shapes
3637 for (k = 0, vec = (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex);k < surface->num_vertices;k++, vec += 3)
3639 dist = vec[0]*vec[0]+vec[1]*vec[1];
3640 if (modelyawradius < dist)
3641 modelyawradius = dist;
3642 dist += vec[2]*vec[2];
3643 if (modelradius < dist)
3647 modelyawradius = sqrt(modelyawradius);
3648 modelradius = sqrt(modelradius);
3649 mod->yawmins[0] = min(mod->yawmins[0], -modelyawradius);
3650 mod->yawmaxs[0] = min(mod->yawmaxs[0], -modelyawradius);
3651 mod->yawmins[1] = min(mod->yawmins[1], modelyawradius);
3652 mod->yawmaxs[1] = min(mod->yawmaxs[1], modelyawradius);
3653 mod->rotatedmins[0] = min(mod->rotatedmins[0], -modelradius);
3654 mod->rotatedmaxs[0] = min(mod->rotatedmaxs[0], modelradius);
3655 mod->rotatedmins[1] = min(mod->rotatedmins[1], -modelradius);
3656 mod->rotatedmaxs[1] = min(mod->rotatedmaxs[1], modelradius);
3657 mod->rotatedmins[2] = min(mod->rotatedmins[2], -modelradius);
3658 mod->rotatedmaxs[2] = min(mod->rotatedmaxs[2], modelradius);
3659 mod->radius = modelradius;
3660 mod->radius2 = modelradius * modelradius;
3662 // build lightstyle update chains
3663 // (used to rapidly mark surface->cached_dlight on many surfaces
3664 // when d_lightstylevalue changes)
3665 memset(stylecounts, 0, sizeof(stylecounts));
3666 for (k = 0;k < mod->nummodelsurfaces;k++)
3668 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3669 for (j = 0;j < MAXLIGHTMAPS;j++)
3670 stylecounts[surface->lightmapinfo->styles[j]]++;
3672 mod->brushq1.num_lightstyles = 0;
3673 for (k = 0;k < 255;k++)
3677 styleinfo[mod->brushq1.num_lightstyles].style = k;
3678 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3679 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3680 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3681 remapstyles[k] = mod->brushq1.num_lightstyles;
3682 mod->brushq1.num_lightstyles++;
3685 for (k = 0;k < mod->nummodelsurfaces;k++)
3687 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3688 for (j = 0;j < MAXLIGHTMAPS;j++)
3690 if (surface->lightmapinfo->styles[j] != 255)
3692 int r = remapstyles[surface->lightmapinfo->styles[j]];
3693 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3697 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3698 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3702 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3703 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3705 //mod->brushq1.num_visleafs = bm->visleafs;
3708 Mod_Q1BSP_LoadMapBrushes();
3710 //Mod_Q1BSP_ProcessLightList();
3712 if (developer.integer >= 10)
3713 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);
3716 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3720 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3727 in = (void *)(mod_base + l->fileofs);
3728 if (l->filelen % sizeof(*in))
3729 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3730 count = l->filelen / sizeof(*in);
3731 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3734 loadmodel->num = count;
3736 for (i = 0;i < count;i++, in++, out++)
3742 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3749 in = (void *)(mod_base + l->fileofs);
3750 if (l->filelen % sizeof(*in))
3751 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3752 count = l->filelen / sizeof(*in);
3753 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3756 loadmodel->num = count;
3758 for (i = 0;i < count;i++, in++, out++)
3764 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3771 in = (void *)(mod_base + l->fileofs);
3772 if (l->filelen % sizeof(*in))
3773 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3774 count = l->filelen / sizeof(*in);
3775 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3778 loadmodel->num = count;
3780 for (i = 0;i < count;i++, in++, out++)
3786 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3793 in = (void *)(mod_base + l->fileofs);
3794 if (l->filelen % sizeof(*in))
3795 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3796 count = l->filelen / sizeof(*in);
3797 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3800 loadmodel->num = count;
3802 for (i = 0;i < count;i++, in++, out++)
3808 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3815 in = (void *)(mod_base + l->fileofs);
3816 if (l->filelen % sizeof(*in))
3817 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3818 count = l->filelen / sizeof(*in);
3819 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3822 loadmodel->num = count;
3824 for (i = 0;i < count;i++, in++, out++)
3830 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3837 in = (void *)(mod_base + l->fileofs);
3838 if (l->filelen % sizeof(*in))
3839 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3840 count = l->filelen / sizeof(*in);
3841 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3844 loadmodel->num = count;
3846 for (i = 0;i < count;i++, in++, out++)
3852 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3859 in = (void *)(mod_base + l->fileofs);
3860 if (l->filelen % sizeof(*in))
3861 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3862 count = l->filelen / sizeof(*in);
3863 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3866 loadmodel->num = count;
3868 for (i = 0;i < count;i++, in++, out++)
3874 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3881 in = (void *)(mod_base + l->fileofs);
3882 if (l->filelen % sizeof(*in))
3883 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3884 count = l->filelen / sizeof(*in);
3885 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3888 loadmodel->num = count;
3890 for (i = 0;i < count;i++, in++, out++)
3896 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3903 in = (void *)(mod_base + l->fileofs);
3904 if (l->filelen % sizeof(*in))
3905 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3906 count = l->filelen / sizeof(*in);
3907 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3910 loadmodel->num = count;
3912 for (i = 0;i < count;i++, in++, out++)
3918 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3925 in = (void *)(mod_base + l->fileofs);
3926 if (l->filelen % sizeof(*in))
3927 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3928 count = l->filelen / sizeof(*in);
3929 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3932 loadmodel->num = count;
3934 for (i = 0;i < count;i++, in++, out++)
3940 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3947 in = (void *)(mod_base + l->fileofs);
3948 if (l->filelen % sizeof(*in))
3949 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3950 count = l->filelen / sizeof(*in);
3951 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3954 loadmodel->num = count;
3956 for (i = 0;i < count;i++, in++, out++)
3962 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3969 in = (void *)(mod_base + l->fileofs);
3970 if (l->filelen % sizeof(*in))
3971 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3972 count = l->filelen / sizeof(*in);
3973 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3976 loadmodel->num = count;
3978 for (i = 0;i < count;i++, in++, out++)
3984 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3991 in = (void *)(mod_base + l->fileofs);
3992 if (l->filelen % sizeof(*in))
3993 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3994 count = l->filelen / sizeof(*in);
3995 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3998 loadmodel->num = count;
4000 for (i = 0;i < count;i++, in++, out++)
4006 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4013 in = (void *)(mod_base + l->fileofs);
4014 if (l->filelen % sizeof(*in))
4015 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4016 count = l->filelen / sizeof(*in);
4017 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4020 loadmodel->num = count;
4022 for (i = 0;i < count;i++, in++, out++)
4028 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4035 in = (void *)(mod_base + l->fileofs);
4036 if (l->filelen % sizeof(*in))
4037 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4038 count = l->filelen / sizeof(*in);
4039 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4042 loadmodel->num = count;
4044 for (i = 0;i < count;i++, in++, out++)
4050 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4057 in = (void *)(mod_base + l->fileofs);
4058 if (l->filelen % sizeof(*in))
4059 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4060 count = l->filelen / sizeof(*in);
4061 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4064 loadmodel->num = count;
4066 for (i = 0;i < count;i++, in++, out++)
4072 static void Mod_Q2BSP_LoadModels(lump_t *l)
4079 in = (void *)(mod_base + l->fileofs);
4080 if (l->filelen % sizeof(*in))
4081 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4082 count = l->filelen / sizeof(*in);
4083 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4086 loadmodel->num = count;
4088 for (i = 0;i < count;i++, in++, out++)
4094 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4097 q2dheader_t *header;
4099 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4101 mod->modeldatatypestring = "Q2BSP";
4103 mod->type = mod_brushq2;
4105 header = (q2dheader_t *)buffer;
4107 i = LittleLong(header->version);
4108 if (i != Q2BSPVERSION)
4109 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4110 mod->brush.ishlbsp = false;
4111 if (loadmodel->isworldmodel)
4112 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
4114 mod_base = (unsigned char *)header;
4116 // swap all the lumps
4117 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4118 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4120 mod->brush.qw_md4sum = 0;
4121 mod->brush.qw_md4sum2 = 0;
4122 for (i = 0;i < Q2HEADER_LUMPS;i++)
4124 if (i == Q2LUMP_ENTITIES)
4126 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4127 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4129 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4132 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4133 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4134 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4135 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4136 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4137 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4138 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4139 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4140 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4141 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4142 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4143 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4144 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4145 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4146 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4147 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4148 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4149 // LordHavoc: must go last because this makes the submodels
4150 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4153 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4154 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4156 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4159 char key[128], value[MAX_INPUTLINE];
4161 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4162 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4163 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4166 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen);
4167 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4168 data = loadmodel->brush.entities;
4169 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4170 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4174 if (!COM_ParseToken_Simple(&data, false, false))
4176 if (com_token[0] == '}')
4177 break; // end of worldspawn
4178 if (com_token[0] == '_')
4179 strlcpy(key, com_token + 1, sizeof(key));
4181 strlcpy(key, com_token, sizeof(key));
4182 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4183 key[strlen(key)-1] = 0;
4184 if (!COM_ParseToken_Simple(&data, false, false))
4186 strlcpy(value, com_token, sizeof(value));
4187 if (!strcmp("gridsize", key))
4189 #if _MSC_VER >= 1400
4190 #define sscanf sscanf_s
4192 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4193 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4199 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4205 in = (q3dtexture_t *)(mod_base + l->fileofs);
4206 if (l->filelen % sizeof(*in))
4207 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4208 count = l->filelen / sizeof(*in);
4209 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4211 loadmodel->data_textures = out;
4212 loadmodel->num_textures = count;
4213 loadmodel->num_texturesperskin = loadmodel->num_textures;
4215 for (i = 0;i < count;i++)
4217 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4218 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4219 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4222 if (cls.state == ca_dedicated)
4225 for (i = 0;i < count;i++, in++, out++)
4226 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4229 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4235 in = (q3dplane_t *)(mod_base + l->fileofs);
4236 if (l->filelen % sizeof(*in))
4237 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4238 count = l->filelen / sizeof(*in);
4239 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4241 loadmodel->brush.data_planes = out;
4242 loadmodel->brush.num_planes = count;
4244 for (i = 0;i < count;i++, in++, out++)
4246 out->normal[0] = LittleFloat(in->normal[0]);
4247 out->normal[1] = LittleFloat(in->normal[1]);
4248 out->normal[2] = LittleFloat(in->normal[2]);
4249 out->dist = LittleFloat(in->dist);
4254 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4257 q3mbrushside_t *out;
4260 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4261 if (l->filelen % sizeof(*in))
4262 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4263 count = l->filelen / sizeof(*in);
4264 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4266 loadmodel->brush.data_brushsides = out;
4267 loadmodel->brush.num_brushsides = count;
4269 for (i = 0;i < count;i++, in++, out++)
4271 n = LittleLong(in->planeindex);
4272 if (n < 0 || n >= loadmodel->brush.num_planes)
4273 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4274 out->plane = loadmodel->brush.data_planes + n;
4275 n = LittleLong(in->textureindex);
4276 if (n < 0 || n >= loadmodel->num_textures)
4277 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4278 out->texture = loadmodel->data_textures + n;
4282 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4286 int i, j, n, c, count, maxplanes;
4287 colplanef_t *planes;
4289 in = (q3dbrush_t *)(mod_base + l->fileofs);
4290 if (l->filelen % sizeof(*in))
4291 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4292 count = l->filelen / sizeof(*in);
4293 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4295 loadmodel->brush.data_brushes = out;
4296 loadmodel->brush.num_brushes = count;
4301 for (i = 0;i < count;i++, in++, out++)
4303 n = LittleLong(in->firstbrushside);
4304 c = LittleLong(in->numbrushsides);
4305 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4306 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4307 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4308 out->numbrushsides = c;
4309 n = LittleLong(in->textureindex);
4310 if (n < 0 || n >= loadmodel->num_textures)
4311 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4312 out->texture = loadmodel->data_textures + n;
4314 // make a list of mplane_t structs to construct a colbrush from
4315 if (maxplanes < out->numbrushsides)
4317 maxplanes = out->numbrushsides;
4320 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4322 for (j = 0;j < out->numbrushsides;j++)
4324 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4325 planes[j].dist = out->firstbrushside[j].plane->dist;
4326 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4327 planes[j].texture = out->firstbrushside[j].texture;
4329 // make the colbrush from the planes
4330 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4336 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4342 in = (q3deffect_t *)(mod_base + l->fileofs);
4343 if (l->filelen % sizeof(*in))
4344 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4345 count = l->filelen / sizeof(*in);
4346 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4348 loadmodel->brushq3.data_effects = out;
4349 loadmodel->brushq3.num_effects = count;
4351 for (i = 0;i < count;i++, in++, out++)
4353 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4354 n = LittleLong(in->brushindex);
4355 if (n >= loadmodel->brush.num_brushes)
4357 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4360 out->brushindex = n;
4361 out->unknown = LittleLong(in->unknown);
4365 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4370 in = (q3dvertex_t *)(mod_base + l->fileofs);
4371 if (l->filelen % sizeof(*in))
4372 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4373 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4374 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4375 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4376 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4377 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4378 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4380 for (i = 0;i < count;i++, in++)
4382 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4383 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4384 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4385 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4386 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4387 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4388 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4389 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4390 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4391 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4392 // svector/tvector are calculated later in face loading
4393 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4394 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4395 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4396 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4400 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4406 in = (int *)(mod_base + l->fileofs);
4407 if (l->filelen % sizeof(int[3]))
4408 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4409 count = l->filelen / sizeof(*in);
4410 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4412 loadmodel->brushq3.num_triangles = count / 3;
4413 loadmodel->brushq3.data_element3i = out;
4415 for (i = 0;i < count;i++, in++, out++)
4417 *out = LittleLong(*in);
4418 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4420 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4426 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4429 int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4431 unsigned char convertedpixels[128*128*4];
4435 if (cls.state == ca_dedicated)
4437 in = (q3dlightmap_t *)(mod_base + l->fileofs);
4438 if (l->filelen % sizeof(*in))
4439 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4440 count = l->filelen / sizeof(*in);
4441 loadmodel->brushq3.num_originallightmaps = count;
4443 // now check the surfaces to see if any of them index an odd numbered
4444 // lightmap, if so this is not a deluxemapped bsp file
4446 // also check what lightmaps are actually used, because q3map2 sometimes
4447 // (always?) makes an unused one at the end, which
4448 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4449 // reason when only one lightmap is used, which can throw off the
4450 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4451 // to see if the second lightmap is blank, if so it is not deluxemapped.
4452 loadmodel->brushq3.deluxemapping = !(count & 1);
4453 loadmodel->brushq3.deluxemapping_modelspace = true;
4455 if (loadmodel->brushq3.deluxemapping)
4457 int facecount = faceslump->filelen / sizeof(q3dface_t);
4458 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4459 for (i = 0;i < facecount;i++)
4461 j = LittleLong(faces[i].lightmapindex);
4464 endlightmap = max(endlightmap, j + 1);
4465 if ((j & 1) || j + 1 >= count)
4467 loadmodel->brushq3.deluxemapping = false;
4474 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4475 // reason when only one lightmap is used, which can throw off the
4476 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4477 // to see if the second lightmap is blank, if so it is not deluxemapped.
4479 // further research has shown q3map2 sometimes creates a deluxemap and two
4480 // blank lightmaps, which must be handled properly as well
4481 if (endlightmap == 1 && count > 1)
4484 for (i = 0;i < 128*128*3;i++)
4489 // all pixels in the unused lightmap were black...
4490 loadmodel->brushq3.deluxemapping = false;
4494 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4496 // figure out what the most reasonable merge power is within limits
4497 loadmodel->brushq3.num_lightmapmergepower = 0;
4498 for (power = 1;power <= mod_q3bsp_lightmapmergepower.integer && (128 << power) <= gl_max_texture_size && (1 << (power * 2)) < 4 * (count >> loadmodel->brushq3.deluxemapping);power++)
4499 loadmodel->brushq3.num_lightmapmergepower = power;
4500 loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4502 loadmodel->brushq3.num_mergedlightmaps = ((count >> loadmodel->brushq3.deluxemapping) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4503 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4504 if (loadmodel->brushq3.deluxemapping)
4505 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4507 // allocate a texture pool if we need it
4508 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4509 loadmodel->texturepool = R_AllocTexturePool();
4511 power = loadmodel->brushq3.num_lightmapmergepower;
4513 mask = (1 << power) - 1;
4514 for (i = 0;i < count;i++)
4516 // figure out which merged lightmap texture this fits into
4517 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4518 for (k = 0;k < 128*128;k++)
4520 convertedpixels[k*4+2] = in[i].rgb[k*3+0];
4521 convertedpixels[k*4+1] = in[i].rgb[k*3+1];
4522 convertedpixels[k*4+0] = in[i].rgb[k*3+2];
4523 convertedpixels[k*4+3] = 255;
4525 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4527 // if the lightmap has not been allocated yet, create it
4528 if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4530 // create a lightmap only as large as necessary to hold the
4531 // remaining 128x128 blocks
4532 // if there are multiple merged lightmap textures then they will
4533 // all be full size except the last one which may be smaller
4534 // because it only needs to the remaining blocks, and it will often
4535 // be odd sizes like 2048x512 due to only being 25% full or so.
4536 j = (count >> loadmodel->brushq3.deluxemapping) - (lightmapindex << power2);
4537 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4539 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4541 if (developer_loading.integer)
4542 Con_Printf("lightmap merge texture #%i is %ix%i (%i of %i used)\n", lightmapindex, mergewidth*128, mergeheight*128, min(j, mergewidth*mergeheight), mergewidth*mergeheight);
4543 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);
4544 if (loadmodel->brushq3.data_deluxemaps)
4545 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);
4547 mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / 128;
4548 mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / 128;
4549 j = (i >> loadmodel->brushq3.deluxemapping) & ((1 << power2) - 1);
4550 if (loadmodel->brushq3.deluxemapping && (i & 1))
4551 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * 128, (j / mergewidth) * 128, 128, 128);
4553 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * 128, (j / mergewidth) * 128, 128, 128);
4557 // figure out which merged lightmap texture this fits into
4558 if (loadmodel->brushq3.deluxemapping && (i & 1))
4559 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);
4561 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);
4566 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4568 q3dface_t *in, *oldin;
4569 msurface_t *out, *oldout;
4570 int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, numvertices, numtriangles;
4571 float lightmaptcbase[2], lightmaptcscale[2];
4572 //int *originalelement3i;
4573 //int *originalneighbor3i;
4574 float *originalvertex3f;
4575 //float *originalsvector3f;
4576 //float *originaltvector3f;
4577 float *originalnormal3f;
4578 float *originalcolor4f;
4579 float *originaltexcoordtexture2f;
4580 float *originaltexcoordlightmap2f;
4583 in = (q3dface_t *)(mod_base + l->fileofs);
4584 if (l->filelen % sizeof(*in))
4585 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4586 count = l->filelen / sizeof(*in);
4587 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4589 loadmodel->data_surfaces = out;
4590 loadmodel->num_surfaces = count;
4598 for (;i < count;i++, in++, out++)
4600 // check face type first
4601 type = LittleLong(in->type);
4602 if (type != Q3FACETYPE_FLAT
4603 && type != Q3FACETYPE_PATCH
4604 && type != Q3FACETYPE_MESH
4605 && type != Q3FACETYPE_FLARE)
4607 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4611 n = LittleLong(in->textureindex);
4612 if (n < 0 || n >= loadmodel->num_textures)
4614 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4617 out->texture = loadmodel->data_textures + n;
4618 n = LittleLong(in->effectindex);
4619 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4621 if (developer.integer >= 100)
4622 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4628 out->effect = loadmodel->brushq3.data_effects + n;
4630 if (cls.state != ca_dedicated)
4632 out->lightmaptexture = NULL;
4633 out->deluxemaptexture = r_texture_blanknormalmap;
4634 n = LittleLong(in->lightmapindex);
4637 else if (n >= loadmodel->brushq3.num_originallightmaps)
4639 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4644 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4645 if (loadmodel->brushq3.deluxemapping)
4646 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4650 firstvertex = LittleLong(in->firstvertex);
4651 numvertices = LittleLong(in->numvertices);
4652 firstelement = LittleLong(in->firstelement);
4653 numtriangles = LittleLong(in->numelements) / 3;
4654 if (numtriangles * 3 != LittleLong(in->numelements))
4656 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));
4659 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4661 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);
4664 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4666 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);
4671 case Q3FACETYPE_FLAT:
4672 case Q3FACETYPE_MESH:
4673 // no processing necessary
4675 case Q3FACETYPE_PATCH:
4676 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4677 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4678 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))
4680 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4683 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4684 // convert patch to Q3FACETYPE_MESH
4685 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4686 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4687 // bound to user settings
4688 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4689 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4690 // bound to sanity settings
4691 xtess = bound(1, xtess, 1024);
4692 ytess = bound(1, ytess, 1024);
4693 // bound to user limit on vertices
4694 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4701 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4702 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4703 numvertices = finalwidth * finalheight;
4704 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4706 case Q3FACETYPE_FLARE:
4707 if (developer.integer >= 100)
4708 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4712 out->num_vertices = numvertices;
4713 out->num_triangles = numtriangles;
4714 meshvertices += out->num_vertices;
4715 meshtriangles += out->num_triangles;
4721 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4724 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
4726 if (out->num_vertices < 3 || out->num_triangles < 1)
4729 type = LittleLong(in->type);
4730 firstvertex = LittleLong(in->firstvertex);
4731 firstelement = LittleLong(in->firstelement);
4732 out->num_firstvertex = meshvertices;
4733 out->num_firsttriangle = meshtriangles;
4736 case Q3FACETYPE_FLAT:
4737 case Q3FACETYPE_MESH:
4738 // no processing necessary, except for lightmap merging
4739 for (j = 0;j < out->num_vertices;j++)
4741 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4742 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4743 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4744 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
4745 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
4746 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
4747 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4748 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4749 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4750 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4751 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4752 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4753 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4754 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4756 for (j = 0;j < out->num_triangles*3;j++)
4757 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
4759 case Q3FACETYPE_PATCH:
4760 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4761 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4762 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4763 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
4764 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4765 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4766 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4767 // convert patch to Q3FACETYPE_MESH
4768 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4769 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4770 // bound to user settings
4771 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4772 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4773 // bound to sanity settings
4774 xtess = bound(1, xtess, 1024);
4775 ytess = bound(1, ytess, 1024);
4776 // bound to user limit on vertices
4777 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_maxvertices.integer, 262144))
4784 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4785 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4786 finalvertices = finalwidth * finalheight;
4787 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4788 type = Q3FACETYPE_MESH;
4789 // generate geometry
4790 // (note: normals are skipped because they get recalculated)
4791 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4792 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
4793 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
4794 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
4795 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
4796 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
4797 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);
4798 if (developer.integer >= 100)
4800 if (out->num_triangles < finaltriangles)
4801 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);
4803 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);
4805 // q3map does not put in collision brushes for curves... ugh
4806 // build the lower quality collision geometry
4807 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4808 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4809 // bound to user settings
4810 xtess = bound(r_subdivisions_collision_mintess.integer, xtess, r_subdivisions_collision_maxtess.integer);
4811 ytess = bound(r_subdivisions_collision_mintess.integer, ytess, r_subdivisions_collision_maxtess.integer);
4812 // bound to sanity settings
4813 xtess = bound(1, xtess, 1024);
4814 ytess = bound(1, ytess, 1024);
4815 // bound to user limit on vertices
4816 while ((xtess > 1 || ytess > 1) && (((patchsize[0] - 1) * xtess) + 1) * (((patchsize[1] - 1) * ytess) + 1) > min(r_subdivisions_collision_maxvertices.integer, 262144))
4823 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
4824 finalheight = ((patchsize[1] - 1) * ytess) + 1;
4825 finalvertices = finalwidth * finalheight;
4826 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4828 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4829 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4830 out->num_collisionvertices = finalvertices;
4831 out->num_collisiontriangles = finaltriangles;
4832 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4833 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
4835 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
4836 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
4838 oldnumtriangles = out->num_triangles;
4839 oldnumtriangles2 = out->num_collisiontriangles;
4840 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
4841 if (developer.integer >= 100)
4842 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);
4847 meshvertices += out->num_vertices;
4848 meshtriangles += out->num_triangles;
4849 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
4850 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)
4852 if (invalidelements)
4854 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);
4855 for (j = 0;j < out->num_triangles * 3;j++)
4857 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
4858 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)
4859 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
4863 // calculate a bounding box
4864 VectorClear(out->mins);
4865 VectorClear(out->maxs);
4866 if (out->num_vertices)
4868 if (cls.state != ca_dedicated && out->lightmaptexture)
4870 // figure out which part of the merged lightmap this fits into
4871 int lightmapindex = LittleLong(in->lightmapindex) >> loadmodel->brushq3.deluxemapping;
4872 int mergewidth = R_TextureWidth(out->lightmaptexture) / 128;
4873 int mergeheight = R_TextureHeight(out->lightmaptexture) / 128;
4874 lightmapindex &= mergewidth * mergeheight - 1;
4875 lightmaptcscale[0] = 1.0f / mergewidth;
4876 lightmaptcscale[1] = 1.0f / mergeheight;
4877 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
4878 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
4879 // modify the lightmap texcoords to match this region of the merged lightmap
4880 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
4882 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
4883 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
4886 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
4887 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
4888 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
4890 out->mins[0] = min(out->mins[0], v[0]);
4891 out->maxs[0] = max(out->maxs[0], v[0]);
4892 out->mins[1] = min(out->mins[1], v[1]);
4893 out->maxs[1] = max(out->maxs[1], v[1]);
4894 out->mins[2] = min(out->mins[2], v[2]);
4895 out->maxs[2] = max(out->maxs[2], v[2]);
4897 out->mins[0] -= 1.0f;
4898 out->mins[1] -= 1.0f;
4899 out->mins[2] -= 1.0f;
4900 out->maxs[0] += 1.0f;
4901 out->maxs[1] += 1.0f;
4902 out->maxs[2] += 1.0f;
4904 // set lightmap styles for consistency with q1bsp
4905 //out->lightmapinfo->styles[0] = 0;
4906 //out->lightmapinfo->styles[1] = 255;
4907 //out->lightmapinfo->styles[2] = 255;
4908 //out->lightmapinfo->styles[3] = 255;
4911 // for per pixel lighting
4912 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);
4914 // generate ushort elements array if possible
4915 if (loadmodel->surfmesh.data_element3s)
4916 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
4917 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
4919 // free the no longer needed vertex data
4920 loadmodel->brushq3.num_vertices = 0;
4921 if (loadmodel->brushq3.data_vertex3f)
4922 Mem_Free(loadmodel->brushq3.data_vertex3f);
4923 loadmodel->brushq3.data_vertex3f = NULL;
4924 loadmodel->brushq3.data_normal3f = NULL;
4925 loadmodel->brushq3.data_texcoordtexture2f = NULL;
4926 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
4927 loadmodel->brushq3.data_color4f = NULL;
4928 // free the no longer needed triangle data
4929 loadmodel->brushq3.num_triangles = 0;
4930 if (loadmodel->brushq3.data_element3i)
4931 Mem_Free(loadmodel->brushq3.data_element3i);
4932 loadmodel->brushq3.data_element3i = NULL;
4935 static void Mod_Q3BSP_LoadModels(lump_t *l)
4939 int i, j, n, c, count;
4941 in = (q3dmodel_t *)(mod_base + l->fileofs);
4942 if (l->filelen % sizeof(*in))
4943 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
4944 count = l->filelen / sizeof(*in);
4945 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4947 loadmodel->brushq3.data_models = out;
4948 loadmodel->brushq3.num_models = count;
4950 for (i = 0;i < count;i++, in++, out++)
4952 for (j = 0;j < 3;j++)
4954 out->mins[j] = LittleFloat(in->mins[j]);
4955 out->maxs[j] = LittleFloat(in->maxs[j]);
4957 n = LittleLong(in->firstface);
4958 c = LittleLong(in->numfaces);
4959 if (n < 0 || n + c > loadmodel->num_surfaces)
4960 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
4963 n = LittleLong(in->firstbrush);
4964 c = LittleLong(in->numbrushes);
4965 if (n < 0 || n + c > loadmodel->brush.num_brushes)
4966 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
4967 out->firstbrush = n;
4968 out->numbrushes = c;
4972 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
4978 in = (int *)(mod_base + l->fileofs);
4979 if (l->filelen % sizeof(*in))
4980 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4981 count = l->filelen / sizeof(*in);
4982 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4984 loadmodel->brush.data_leafbrushes = out;
4985 loadmodel->brush.num_leafbrushes = count;
4987 for (i = 0;i < count;i++, in++, out++)
4989 n = LittleLong(*in);
4990 if (n < 0 || n >= loadmodel->brush.num_brushes)
4991 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
4996 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5002 in = (int *)(mod_base + l->fileofs);
5003 if (l->filelen % sizeof(*in))
5004 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5005 count = l->filelen / sizeof(*in);
5006 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5008 loadmodel->brush.data_leafsurfaces = out;
5009 loadmodel->brush.num_leafsurfaces = count;
5011 for (i = 0;i < count;i++, in++, out++)
5013 n = LittleLong(*in);
5014 if (n < 0 || n >= loadmodel->num_surfaces)
5015 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5020 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5024 int i, j, n, c, count;
5026 in = (q3dleaf_t *)(mod_base + l->fileofs);
5027 if (l->filelen % sizeof(*in))
5028 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5029 count = l->filelen / sizeof(*in);
5030 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5032 loadmodel->brush.data_leafs = out;
5033 loadmodel->brush.num_leafs = count;
5035 for (i = 0;i < count;i++, in++, out++)
5039 out->clusterindex = LittleLong(in->clusterindex);
5040 out->areaindex = LittleLong(in->areaindex);
5041 for (j = 0;j < 3;j++)
5043 // yes the mins/maxs are ints
5044 out->mins[j] = LittleLong(in->mins[j]) - 1;
5045 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5047 n = LittleLong(in->firstleafface);
5048 c = LittleLong(in->numleaffaces);
5049 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5050 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5051 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5052 out->numleafsurfaces = c;
5053 n = LittleLong(in->firstleafbrush);
5054 c = LittleLong(in->numleafbrushes);
5055 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5056 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5057 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5058 out->numleafbrushes = c;
5062 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5068 in = (q3dnode_t *)(mod_base + l->fileofs);
5069 if (l->filelen % sizeof(*in))
5070 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5071 count = l->filelen / sizeof(*in);
5072 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5074 loadmodel->brush.data_nodes = out;
5075 loadmodel->brush.num_nodes = count;
5077 for (i = 0;i < count;i++, in++, out++)
5080 n = LittleLong(in->planeindex);
5081 if (n < 0 || n >= loadmodel->brush.num_planes)
5082 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5083 out->plane = loadmodel->brush.data_planes + n;
5084 for (j = 0;j < 2;j++)
5086 n = LittleLong(in->childrenindex[j]);
5089 if (n >= loadmodel->brush.num_nodes)
5090 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5091 out->children[j] = loadmodel->brush.data_nodes + n;
5096 if (n >= loadmodel->brush.num_leafs)
5097 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5098 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5101 for (j = 0;j < 3;j++)
5103 // yes the mins/maxs are ints
5104 out->mins[j] = LittleLong(in->mins[j]) - 1;
5105 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5109 // set the parent pointers
5110 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5113 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5116 q3dlightgrid_t *out;
5119 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5120 if (l->filelen % sizeof(*in))
5121 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5122 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5123 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5124 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5125 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5126 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5127 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5128 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5129 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5130 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5131 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5132 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5133 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5134 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5135 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]);
5136 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]);
5138 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5141 if (l->filelen < count * (int)sizeof(*in))
5142 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]);
5143 if (l->filelen != count * (int)sizeof(*in))
5144 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5145 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5146 loadmodel->brushq3.data_lightgrid = out;
5147 loadmodel->brushq3.num_lightgrid = count;
5148 // no swapping or validation necessary
5149 memcpy(out, in, count * (int)sizeof(*out));
5153 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5158 if (l->filelen == 0)
5161 // unvised maps often have cluster indices even without pvs, so check
5162 // leafs to find real number of clusters
5163 loadmodel->brush.num_pvsclusters = 1;
5164 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5165 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5168 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5169 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5170 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5171 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5175 in = (q3dpvs_t *)(mod_base + l->fileofs);
5177 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5179 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5180 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5181 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5182 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5183 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5184 if (l->filelen < totalchains + (int)sizeof(*in))
5185 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);
5187 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5188 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5191 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5193 int i, j, k, index[3];
5194 float transformed[3], blend1, blend2, blend, stylescale;
5195 q3dlightgrid_t *a, *s;
5197 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5198 stylescale = r_refdef.scene.rtlightstylevalue[0];
5200 if (!model->brushq3.num_lightgrid)
5202 ambientcolor[0] = stylescale;
5203 ambientcolor[1] = stylescale;
5204 ambientcolor[2] = stylescale;
5208 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5209 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5210 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5211 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5212 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5213 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5214 index[0] = (int)floor(transformed[0]);
5215 index[1] = (int)floor(transformed[1]);
5216 index[2] = (int)floor(transformed[2]);
5217 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5219 // now lerp the values
5220 VectorClear(diffusenormal);
5221 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5222 for (k = 0;k < 2;k++)
5224 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5225 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5227 for (j = 0;j < 2;j++)
5229 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5230 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5232 for (i = 0;i < 2;i++)
5234 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5235 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5237 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5238 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5239 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5240 // this uses the mod_md3_sin table because the values are
5241 // already in the 0-255 range, the 64+ bias fetches a cosine
5242 // instead of a sine value
5243 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5244 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5245 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5246 //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)));
5251 // normalize the light direction before turning
5252 VectorNormalize(diffusenormal);
5253 //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]);
5256 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
5261 // find which leaf the point is in
5263 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5264 // point trace the brushes
5265 leaf = (mleaf_t *)node;
5266 for (i = 0;i < leaf->numleafbrushes;i++)
5268 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5269 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5271 brush->markframe = markframe;
5272 Collision_TracePointBrushFloat(trace, point, brush);
5275 // can't do point traces on curves (they have no thickness)
5278 static void Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace_t *trace, dp_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)
5280 int i, startside, endside;
5281 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5283 msurface_t *surface;
5286 // walk the tree until we hit a leaf, recursing for any split cases
5289 // abort if this part of the bsp tree can not be hit by this trace
5290 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5292 plane = node->plane;
5293 // axial planes are much more common than non-axial, so an optimized
5294 // axial case pays off here
5295 if (plane->type < 3)
5297 dist1 = start[plane->type] - plane->dist;
5298 dist2 = end[plane->type] - plane->dist;
5302 dist1 = DotProduct(start, plane->normal) - plane->dist;
5303 dist2 = DotProduct(end, plane->normal) - plane->dist;
5305 startside = dist1 < 0;
5306 endside = dist2 < 0;
5307 if (startside == endside)
5309 // most of the time the line fragment is on one side of the plane
5310 node = node->children[startside];
5314 // line crosses node plane, split the line
5315 dist1 = PlaneDiff(linestart, plane);
5316 dist2 = PlaneDiff(lineend, plane);
5317 midfrac = dist1 / (dist1 - dist2);
5318 VectorLerp(linestart, midfrac, lineend, mid);
5319 // take the near side first
5320 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5321 // if we found an impact on the front side, don't waste time
5322 // exploring the far side
5323 if (midfrac <= trace->realfraction)
5324 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5328 // abort if this part of the bsp tree can not be hit by this trace
5329 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5332 nodesegmentmins[0] = min(start[0], end[0]) - 1;
5333 nodesegmentmins[1] = min(start[1], end[1]) - 1;
5334 nodesegmentmins[2] = min(start[2], end[2]) - 1;
5335 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5336 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5337 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5338 // line trace the brushes
5339 leaf = (mleaf_t *)node;
5340 for (i = 0;i < leaf->numleafbrushes;i++)
5342 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5343 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5345 brush->markframe = markframe;
5346 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5349 // can't do point traces on curves (they have no thickness)
5350 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5352 // line trace the curves
5353 for (i = 0;i < leaf->numleafsurfaces;i++)
5355 surface = model->data_surfaces + leaf->firstleafsurface[i];
5356 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5358 surface->collisionmarkframe = markframe;
5359 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5365 static void Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace_t *trace, dp_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)
5371 msurface_t *surface;
5373 float nodesegmentmins[3], nodesegmentmaxs[3];
5374 // walk the tree until we hit a leaf, recursing for any split cases
5377 // abort if this part of the bsp tree can not be hit by this trace
5378 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5380 plane = node->plane;
5381 // axial planes are much more common than non-axial, so an optimized
5382 // axial case pays off here
5383 if (plane->type < 3)
5385 // this is an axial plane, compare bounding box directly to it and
5386 // recurse sides accordingly
5387 // recurse down node sides
5388 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5389 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5390 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5391 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5395 // this is a non-axial plane, so check if the start and end boxes
5396 // are both on one side of the plane to handle 'diagonal' cases
5397 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5401 // segment crosses plane
5402 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5405 // if sides == 0 then the trace itself is bogus (Not A Number values),
5406 // in this case we simply pretend the trace hit nothing
5408 return; // ERROR: NAN bounding box!
5409 // take whichever side the segment box is on
5410 node = node->children[sides - 1];
5412 // abort if this part of the bsp tree can not be hit by this trace
5413 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5415 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5416 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5417 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5418 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5419 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5420 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5422 leaf = (mleaf_t *)node;
5423 for (i = 0;i < leaf->numleafbrushes;i++)
5425 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5426 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5428 brush->markframe = markframe;
5429 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5432 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5434 for (i = 0;i < leaf->numleafsurfaces;i++)
5436 surface = model->data_surfaces + leaf->firstleafsurface[i];
5437 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5439 surface->collisionmarkframe = markframe;
5440 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);
5446 static void Mod_Q3BSP_TraceBox(dp_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)
5449 float segmentmins[3], segmentmaxs[3];
5450 static int markframe = 0;
5451 msurface_t *surface;
5453 memset(trace, 0, sizeof(*trace));
5454 trace->fraction = 1;
5455 trace->realfraction = 1;
5456 trace->hitsupercontentsmask = hitsupercontentsmask;
5457 if (mod_q3bsp_optimizedtraceline.integer && VectorLength2(boxmins) + VectorLength2(boxmaxs) == 0)
5459 if (VectorCompare(start, end))
5462 if (model->brush.submodel)
5464 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5465 if (brush->colbrushf)
5466 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5469 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5474 segmentmins[0] = min(start[0], end[0]) - 1;
5475 segmentmins[1] = min(start[1], end[1]) - 1;
5476 segmentmins[2] = min(start[2], end[2]) - 1;
5477 segmentmaxs[0] = max(start[0], end[0]) + 1;
5478 segmentmaxs[1] = max(start[1], end[1]) + 1;
5479 segmentmaxs[2] = max(start[2], end[2]) + 1;
5480 if (model->brush.submodel)
5482 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5483 if (brush->colbrushf)
5484 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5485 if (mod_q3bsp_curves_collisions.integer)
5486 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5487 if (surface->num_collisiontriangles)
5488 Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5491 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5496 // box trace, performed as brush trace
5497 colbrushf_t *thisbrush_start, *thisbrush_end;
5498 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5499 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5500 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5501 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5502 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5503 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5504 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5505 VectorAdd(start, boxmins, boxstartmins);
5506 VectorAdd(start, boxmaxs, boxstartmaxs);
5507 VectorAdd(end, boxmins, boxendmins);
5508 VectorAdd(end, boxmaxs, boxendmaxs);
5509 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5510 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5511 if (model->brush.submodel)
5513 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5514 if (brush->colbrushf)
5515 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5516 if (mod_q3bsp_curves_collisions.integer)
5517 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5518 if (surface->num_collisiontriangles)
5519 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);
5522 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5526 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5529 int supercontents = 0;
5531 // test if the point is inside each brush
5532 if (model->brush.submodel)
5534 // submodels are effectively one leaf
5535 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5536 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5537 supercontents |= brush->colbrushf->supercontents;
5541 mnode_t *node = model->brush.data_nodes;
5543 // find which leaf the point is in
5545 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5546 leaf = (mleaf_t *)node;
5547 // now check the brushes in the leaf
5548 for (i = 0;i < leaf->numleafbrushes;i++)
5550 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5551 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5552 supercontents |= brush->colbrushf->supercontents;
5555 return supercontents;
5558 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
5560 int supercontents = 0;
5561 if (nativecontents & CONTENTSQ3_SOLID)
5562 supercontents |= SUPERCONTENTS_SOLID;
5563 if (nativecontents & CONTENTSQ3_WATER)
5564 supercontents |= SUPERCONTENTS_WATER;
5565 if (nativecontents & CONTENTSQ3_SLIME)
5566 supercontents |= SUPERCONTENTS_SLIME;
5567 if (nativecontents & CONTENTSQ3_LAVA)
5568 supercontents |= SUPERCONTENTS_LAVA;
5569 if (nativecontents & CONTENTSQ3_BODY)
5570 supercontents |= SUPERCONTENTS_BODY;
5571 if (nativecontents & CONTENTSQ3_CORPSE)
5572 supercontents |= SUPERCONTENTS_CORPSE;
5573 if (nativecontents & CONTENTSQ3_NODROP)
5574 supercontents |= SUPERCONTENTS_NODROP;
5575 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5576 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5577 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5578 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5579 if (nativecontents & CONTENTSQ3_DONOTENTER)
5580 supercontents |= SUPERCONTENTS_DONOTENTER;
5581 return supercontents;
5584 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
5586 int nativecontents = 0;
5587 if (supercontents & SUPERCONTENTS_SOLID)
5588 nativecontents |= CONTENTSQ3_SOLID;
5589 if (supercontents & SUPERCONTENTS_WATER)
5590 nativecontents |= CONTENTSQ3_WATER;
5591 if (supercontents & SUPERCONTENTS_SLIME)
5592 nativecontents |= CONTENTSQ3_SLIME;
5593 if (supercontents & SUPERCONTENTS_LAVA)
5594 nativecontents |= CONTENTSQ3_LAVA;
5595 if (supercontents & SUPERCONTENTS_BODY)
5596 nativecontents |= CONTENTSQ3_BODY;
5597 if (supercontents & SUPERCONTENTS_CORPSE)
5598 nativecontents |= CONTENTSQ3_CORPSE;
5599 if (supercontents & SUPERCONTENTS_NODROP)
5600 nativecontents |= CONTENTSQ3_NODROP;
5601 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5602 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5603 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5604 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5605 if (supercontents & SUPERCONTENTS_DONOTENTER)
5606 nativecontents |= CONTENTSQ3_DONOTENTER;
5607 return nativecontents;
5610 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5615 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5616 node = node->children[1];
5618 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5619 if (loadmodel->brush.num_leafs < numleafs)
5620 loadmodel->brush.num_leafs = numleafs;
5623 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
5625 int i, j, numshadowmeshtriangles;
5626 q3dheader_t *header;
5627 float corner[3], yawradius, modelradius;
5628 msurface_t *surface;
5630 mod->modeldatatypestring = "Q3BSP";
5632 mod->type = mod_brushq3;
5633 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5636 header = (q3dheader_t *)buffer;
5638 i = LittleLong(header->version);
5639 if (i != Q3BSPVERSION)
5640 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5641 mod->brush.ishlbsp = false;
5642 if (loadmodel->isworldmodel)
5643 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
5645 mod->soundfromcenter = true;
5646 mod->TraceBox = Mod_Q3BSP_TraceBox;
5647 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
5648 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
5649 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5650 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5651 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5652 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5653 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5654 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5655 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5656 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
5657 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5658 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5659 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5660 mod->Draw = R_Q1BSP_Draw;
5661 mod->DrawDepth = R_Q1BSP_DrawDepth;
5662 mod->DrawDebug = R_Q1BSP_DrawDebug;
5663 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5664 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5665 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5666 mod->DrawLight = R_Q1BSP_DrawLight;
5667 mod->DrawAddWaterPlanes = NULL;
5669 mod_base = (unsigned char *)header;
5671 // swap all the lumps
5672 header->ident = LittleLong(header->ident);
5673 header->version = LittleLong(header->version);
5674 for (i = 0;i < Q3HEADER_LUMPS;i++)
5676 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
5677 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
5680 mod->brush.qw_md4sum = 0;
5681 mod->brush.qw_md4sum2 = 0;
5682 for (i = 0;i < Q3HEADER_LUMPS;i++)
5684 if (i == Q3LUMP_ENTITIES)
5686 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5687 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
5689 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5692 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5693 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5694 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5695 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5696 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5697 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5698 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5699 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5700 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
5701 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5702 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5703 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5704 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5705 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5706 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5707 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5708 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5709 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5711 // the MakePortals code works fine on the q3bsp data as well
5712 Mod_Q1BSP_MakePortals();
5714 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
5715 loadmodel->brush.supportwateralpha = true;
5717 // make a single combined shadow mesh to allow optimized shadow volume creation
5718 numshadowmeshtriangles = 0;
5719 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5721 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5722 numshadowmeshtriangles += surface->num_triangles;
5724 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5725 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5726 if (surface->num_triangles > 0)
5727 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));
5728 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
5729 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5731 loadmodel->brush.num_leafs = 0;
5732 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
5735 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
5740 // LordHavoc: only register submodels if it is the world
5741 // (prevents external bsp models from replacing world submodels with
5743 if (!loadmodel->isworldmodel)
5745 // duplicate the basic information
5746 dpsnprintf(name, sizeof(name), "*%i", i);
5747 mod = Mod_FindName(name);
5749 strlcpy(mod->name, name, sizeof(mod->name));
5750 // textures and memory belong to the main model
5751 mod->texturepool = NULL;
5752 mod->mempool = NULL;
5753 mod->brush.TraceLineOfSight = NULL;
5754 mod->brush.GetPVS = NULL;
5755 mod->brush.FatPVS = NULL;
5756 mod->brush.BoxTouchingPVS = NULL;
5757 mod->brush.BoxTouchingLeafPVS = NULL;
5758 mod->brush.BoxTouchingVisibleLeafs = NULL;
5759 mod->brush.FindBoxClusters = NULL;
5760 mod->brush.LightPoint = NULL;
5761 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5763 mod->brush.submodel = i;
5765 // make the model surface list (used by shadowing/lighting)
5766 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
5767 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
5768 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
5769 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
5770 mod->surfacelist = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
5771 for (j = 0;j < mod->nummodelsurfaces;j++)
5772 mod->surfacelist[j] = mod->firstmodelsurface + j;
5774 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
5775 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
5776 // enlarge the bounding box to enclose all geometry of this model,
5777 // because q3map2 sometimes lies (mostly to affect the lightgrid),
5778 // which can in turn mess up the farclip (as well as culling when
5779 // outside the level - an unimportant concern)
5781 //printf("Editing model %d... BEFORE re-bounding: %f %f %f - %f %f %f\n", i, mod->normalmins[0], mod->normalmins[1], mod->normalmins[2], mod->normalmaxs[0], mod->normalmaxs[1], mod->normalmaxs[2]);
5782 for (j = 0;j < mod->nummodelsurfaces;j++)
5784 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
5785 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
5787 if (!surface->num_vertices)
5789 for (k = 0;k < surface->num_vertices;k++, v += 3)
5791 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
5792 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
5793 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
5794 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
5795 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
5796 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
5799 //printf("Editing model %d... AFTER re-bounding: %f %f %f - %f %f %f\n", i, mod->normalmins[0], mod->normalmins[1], mod->normalmins[2], mod->normalmaxs[0], mod->normalmaxs[1], mod->normalmaxs[2]);
5800 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5801 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5802 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5803 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
5804 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
5805 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5806 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5807 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
5808 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
5809 mod->yawmins[2] = mod->normalmins[2];
5810 mod->yawmaxs[2] = mod->normalmaxs[2];
5811 mod->radius = modelradius;
5812 mod->radius2 = modelradius * modelradius;
5814 for (j = 0;j < mod->nummodelsurfaces;j++)
5815 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
5817 if (j < mod->nummodelsurfaces)
5818 mod->DrawSky = R_Q1BSP_DrawSky;
5820 mod->DrawSky = NULL;
5822 for (j = 0;j < mod->nummodelsurfaces;j++)
5823 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
5825 if (j < mod->nummodelsurfaces)
5826 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
5828 mod->DrawAddWaterPlanes = NULL;
5832 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
5834 int i = LittleLong(((int *)buffer)[1]);
5835 if (i == Q3BSPVERSION)
5836 Mod_Q3BSP_Load(mod,buffer, bufferend);
5837 else if (i == Q2BSPVERSION)
5838 Mod_Q2BSP_Load(mod,buffer, bufferend);
5840 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
5843 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
5845 Host_Error("Mod_MAP_Load: not yet implemented");
5848 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
5850 // we already have done PVS culling at this point...
5851 // so we don't need to do it again.
5854 vec3_t testorigin, mins, maxs;
5856 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
5857 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
5858 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
5860 if(model->brush.TraceLineOfSight(model, eye, testorigin))
5863 // expand the box a little
5864 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
5865 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
5866 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
5867 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
5868 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
5869 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
5871 for(i = 0; i != numsamples; ++i)
5873 testorigin[0] = lhrandom(mins[0], maxs[0]);
5874 testorigin[1] = lhrandom(mins[1], maxs[1]);
5875 testorigin[2] = lhrandom(mins[2], maxs[2]);
5877 if(model->brush.TraceLineOfSight(model, eye, testorigin))