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 r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
31 cvar_t r_picmipworld = {CVAR_SAVE, "r_picmipworld", "1", "whether gl_picmip shall apply to world textures too"};
32 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)"};
33 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)"};
34 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
35 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
36 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
37 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)"};
38 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
39 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)"};
40 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
41 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
42 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
43 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
44 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, ..."};
45 cvar_t mod_q3bsp_nolightmaps = {CVAR_SAVE, "mod_q3bsp_nolightmaps", "0", "do not load lightmaps in Q3BSP maps (to save video RAM, but be warned: it looks ugly)"};
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(&r_novis);
57 Cvar_RegisterVariable(&r_picmipworld);
58 Cvar_RegisterVariable(&r_nosurftextures);
59 Cvar_RegisterVariable(&r_subdivisions_tolerance);
60 Cvar_RegisterVariable(&r_subdivisions_mintess);
61 Cvar_RegisterVariable(&r_subdivisions_maxtess);
62 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
63 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
64 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
65 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
66 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
67 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
68 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
69 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
70 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
71 Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
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 | SUPERCONTENTS_OPAQUE;
569 return SUPERCONTENTS_WATER;
571 return SUPERCONTENTS_SLIME;
573 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
575 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
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];
1360 tx->basematerialflags = MATERIALFLAG_WALL;
1361 if (i == loadmodel->num_textures - 1)
1363 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1364 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1365 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1369 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1370 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1372 tx->currentframe = tx;
1374 // clear water settings
1377 tx->refractfactor = 1;
1378 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1379 tx->reflectfactor = 1;
1380 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1381 tx->r_water_wateralpha = 1;
1386 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1390 s = loadmodel->name;
1391 if (!strncasecmp(s, "maps/", 5))
1393 FS_StripExtension(s, mapname, sizeof(mapname));
1395 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1397 // LordHavoc: mostly rewritten map texture loader
1398 for (i = 0;i < m->nummiptex;i++)
1400 dofs[i] = LittleLong(dofs[i]);
1401 if (r_nosurftextures.integer)
1405 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1408 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1410 // copy name, but only up to 16 characters
1411 // (the output buffer can hold more than this, but the input buffer is
1413 for (j = 0;j < 16 && dmiptex->name[j];j++)
1414 name[j] = dmiptex->name[j];
1419 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1420 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1423 mtwidth = LittleLong(dmiptex->width);
1424 mtheight = LittleLong(dmiptex->height);
1426 j = LittleLong(dmiptex->offsets[0]);
1430 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1432 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1435 mtdata = (unsigned char *)dmiptex + j;
1438 if ((mtwidth & 15) || (mtheight & 15))
1439 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1441 // LordHavoc: force all names to lowercase
1442 for (j = 0;name[j];j++)
1443 if (name[j] >= 'A' && name[j] <= 'Z')
1444 name[j] += 'a' - 'A';
1446 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1449 tx = loadmodel->data_textures + i;
1450 strlcpy(tx->name, name, sizeof(tx->name));
1451 tx->width = mtwidth;
1452 tx->height = mtheight;
1454 if (tx->name[0] == '*')
1456 if (!strncmp(tx->name, "*lava", 5))
1458 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1459 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1461 else if (!strncmp(tx->name, "*slime", 6))
1463 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1464 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1468 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1469 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1472 else if (!strncmp(tx->name, "sky", 3))
1474 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1475 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1479 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1480 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1483 if (cls.state != ca_dedicated)
1485 // LordHavoc: HL sky textures are entirely different than quake
1486 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1488 data = loadimagepixelsbgra(tx->name, false, false);
1489 if (data && image_width == 256 && image_height == 128)
1491 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1494 else if (mtdata != NULL)
1495 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1499 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1501 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS, false);
1504 // did not find external texture, load it from the bsp or wad3
1505 if (loadmodel->brush.ishlbsp)
1507 // internal texture overrides wad
1508 unsigned char *pixels, *freepixels;
1509 pixels = freepixels = NULL;
1511 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1513 pixels = freepixels = W_GetTextureBGRA(tx->name);
1516 tx->width = image_width;
1517 tx->height = image_height;
1518 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1521 Mem_Free(freepixels);
1523 else if (mtdata) // texture included
1524 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1526 // if skinframe is still NULL the "missing" texture will be used
1528 tx->skinframes[0] = skinframe;
1531 tx->basematerialflags = MATERIALFLAG_WALL;
1532 if (tx->name[0] == '*')
1534 // LordHavoc: some turbulent textures should not be affected by wateralpha
1535 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1537 // replace the texture with transparent black
1538 Vector4Set(zero, 128, 128, 128, 128);
1539 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1540 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1542 else if (!strncmp(tx->name,"*lava",5)
1543 || !strncmp(tx->name,"*teleport",9)
1544 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1545 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1547 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1548 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1549 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1551 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1553 // replace the texture with black
1554 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1555 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1557 else if (!strncmp(tx->name, "sky", 3))
1558 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1559 else if (!strcmp(tx->name, "caulk"))
1560 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1561 else if (tx->skinframes[0] && tx->skinframes[0]->fog)
1562 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1564 // start out with no animation
1565 tx->currentframe = tx;
1566 tx->currentskinframe = tx->skinframes[0];
1570 // sequence the animations
1571 for (i = 0;i < m->nummiptex;i++)
1573 tx = loadmodel->data_textures + i;
1574 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1576 if (tx->anim_total[0] || tx->anim_total[1])
1577 continue; // already sequenced
1579 // find the number of frames in the animation
1580 memset(anims, 0, sizeof(anims));
1581 memset(altanims, 0, sizeof(altanims));
1583 for (j = i;j < m->nummiptex;j++)
1585 tx2 = loadmodel->data_textures + j;
1586 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1590 if (num >= '0' && num <= '9')
1591 anims[num - '0'] = tx2;
1592 else if (num >= 'a' && num <= 'j')
1593 altanims[num - 'a'] = tx2;
1595 Con_Printf("Bad animating texture %s\n", tx->name);
1599 for (j = 0;j < 10;j++)
1606 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1609 for (j = 0;j < max;j++)
1613 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1617 for (j = 0;j < altmax;j++)
1621 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1630 // if there is no alternate animation, duplicate the primary
1631 // animation into the alternate
1633 for (k = 0;k < 10;k++)
1634 altanims[k] = anims[k];
1637 // link together the primary animation
1638 for (j = 0;j < max;j++)
1641 tx2->animated = true;
1642 tx2->anim_total[0] = max;
1643 tx2->anim_total[1] = altmax;
1644 for (k = 0;k < 10;k++)
1646 tx2->anim_frames[0][k] = anims[k];
1647 tx2->anim_frames[1][k] = altanims[k];
1651 // if there really is an alternate anim...
1652 if (anims[0] != altanims[0])
1654 // link together the alternate animation
1655 for (j = 0;j < altmax;j++)
1658 tx2->animated = true;
1659 // the primary/alternate are reversed here
1660 tx2->anim_total[0] = altmax;
1661 tx2->anim_total[1] = max;
1662 for (k = 0;k < 10;k++)
1664 tx2->anim_frames[0][k] = altanims[k];
1665 tx2->anim_frames[1][k] = anims[k];
1672 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1675 unsigned char *in, *out, *data, d;
1676 char litfilename[MAX_QPATH];
1677 char dlitfilename[MAX_QPATH];
1678 fs_offset_t filesize;
1679 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1681 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1682 for (i=0; i<l->filelen; i++)
1683 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1685 else // LordHavoc: bsp version 29 (normal white lighting)
1687 // LordHavoc: hope is not lost yet, check for a .lit file to load
1688 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1689 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1690 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1691 strlcat (litfilename, ".lit", sizeof (litfilename));
1692 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1693 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1696 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1698 i = LittleLong(((int *)data)[1]);
1701 if (developer_loading.integer)
1702 Con_Printf("loaded %s\n", litfilename);
1703 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1704 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1706 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1709 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1711 i = LittleLong(((int *)data)[1]);
1714 if (developer_loading.integer)
1715 Con_Printf("loaded %s\n", dlitfilename);
1716 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1717 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1718 loadmodel->brushq3.deluxemapping_modelspace = false;
1719 loadmodel->brushq3.deluxemapping = true;
1728 Con_Printf("Unknown .lit file version (%d)\n", i);
1730 else if (filesize == 8)
1731 Con_Print("Empty .lit file, ignoring\n");
1733 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1740 // LordHavoc: oh well, expand the white lighting data
1743 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1744 in = mod_base + l->fileofs;
1745 out = loadmodel->brushq1.lightdata;
1746 for (i = 0;i < l->filelen;i++)
1756 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1758 loadmodel->brushq1.num_compressedpvs = 0;
1759 loadmodel->brushq1.data_compressedpvs = NULL;
1762 loadmodel->brushq1.num_compressedpvs = l->filelen;
1763 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1764 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1767 // used only for HalfLife maps
1768 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1770 char key[128], value[4096];
1774 if (!COM_ParseToken_Simple(&data, false, false))
1776 if (com_token[0] != '{')
1780 if (!COM_ParseToken_Simple(&data, false, false))
1782 if (com_token[0] == '}')
1783 break; // end of worldspawn
1784 if (com_token[0] == '_')
1785 strlcpy(key, com_token + 1, sizeof(key));
1787 strlcpy(key, com_token, sizeof(key));
1788 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1789 key[strlen(key)-1] = 0;
1790 if (!COM_ParseToken_Simple(&data, false, false))
1792 dpsnprintf(value, sizeof(value), "%s", com_token);
1793 if (!strcmp("wad", key)) // for HalfLife maps
1795 if (loadmodel->brush.ishlbsp)
1798 for (i = 0;i < (int)sizeof(value);i++)
1799 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1803 for (;i < (int)sizeof(value);i++)
1805 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1806 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1808 else if (value[i] == ';' || value[i] == 0)
1812 W_LoadTextureWadFile(&value[j], false);
1824 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1826 loadmodel->brush.entities = NULL;
1829 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
1830 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1831 loadmodel->brush.entities[l->filelen] = 0;
1832 if (loadmodel->brush.ishlbsp)
1833 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1837 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1843 in = (dvertex_t *)(mod_base + l->fileofs);
1844 if (l->filelen % sizeof(*in))
1845 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1846 count = l->filelen / sizeof(*in);
1847 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1849 loadmodel->brushq1.vertexes = out;
1850 loadmodel->brushq1.numvertexes = count;
1852 for ( i=0 ; i<count ; i++, in++, out++)
1854 out->position[0] = LittleFloat(in->point[0]);
1855 out->position[1] = LittleFloat(in->point[1]);
1856 out->position[2] = LittleFloat(in->point[2]);
1860 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1861 // can be used for this
1863 int SB_ReadInt (unsigned char **buffer)
1866 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1872 float SB_ReadFloat (unsigned char **buffer)
1880 u.i = SB_ReadInt (buffer);
1884 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1886 unsigned char *index;
1890 index = (unsigned char *)(mod_base + l->fileofs);
1891 if (l->filelen % (48+4*hullinfo->filehulls))
1892 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1894 count = l->filelen / (48+4*hullinfo->filehulls);
1895 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1897 loadmodel->brushq1.submodels = out;
1898 loadmodel->brush.numsubmodels = count;
1900 for (i = 0; i < count; i++, out++)
1902 // spread out the mins / maxs by a pixel
1903 out->mins[0] = SB_ReadFloat (&index) - 1;
1904 out->mins[1] = SB_ReadFloat (&index) - 1;
1905 out->mins[2] = SB_ReadFloat (&index) - 1;
1906 out->maxs[0] = SB_ReadFloat (&index) + 1;
1907 out->maxs[1] = SB_ReadFloat (&index) + 1;
1908 out->maxs[2] = SB_ReadFloat (&index) + 1;
1909 out->origin[0] = SB_ReadFloat (&index);
1910 out->origin[1] = SB_ReadFloat (&index);
1911 out->origin[2] = SB_ReadFloat (&index);
1912 for (j = 0; j < hullinfo->filehulls; j++)
1913 out->headnode[j] = SB_ReadInt (&index);
1914 out->visleafs = SB_ReadInt (&index);
1915 out->firstface = SB_ReadInt (&index);
1916 out->numfaces = SB_ReadInt (&index);
1920 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1926 in = (dedge_t *)(mod_base + l->fileofs);
1927 if (l->filelen % sizeof(*in))
1928 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1929 count = l->filelen / sizeof(*in);
1930 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1932 loadmodel->brushq1.edges = out;
1933 loadmodel->brushq1.numedges = count;
1935 for ( i=0 ; i<count ; i++, in++, out++)
1937 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1938 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1939 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1941 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);
1948 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1952 int i, j, k, count, miptex;
1954 in = (texinfo_t *)(mod_base + l->fileofs);
1955 if (l->filelen % sizeof(*in))
1956 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1957 count = l->filelen / sizeof(*in);
1958 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1960 loadmodel->brushq1.texinfo = out;
1961 loadmodel->brushq1.numtexinfo = count;
1963 for (i = 0;i < count;i++, in++, out++)
1965 for (k = 0;k < 2;k++)
1966 for (j = 0;j < 4;j++)
1967 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1969 miptex = LittleLong(in->miptex);
1970 out->flags = LittleLong(in->flags);
1972 out->texture = NULL;
1973 if (loadmodel->data_textures)
1975 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1976 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1978 out->texture = loadmodel->data_textures + miptex;
1980 if (out->flags & TEX_SPECIAL)
1982 // if texture chosen is NULL or the shader needs a lightmap,
1983 // force to notexture water shader
1984 if (out->texture == NULL)
1985 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1989 // if texture chosen is NULL, force to notexture
1990 if (out->texture == NULL)
1991 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
1997 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2002 mins[0] = mins[1] = mins[2] = 9999;
2003 maxs[0] = maxs[1] = maxs[2] = -9999;
2005 for (i = 0;i < numverts;i++)
2007 for (j = 0;j < 3;j++, v++)
2017 #define MAX_SUBDIVPOLYTRIANGLES 4096
2018 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2020 static int subdivpolyverts, subdivpolytriangles;
2021 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2022 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2024 static int subdivpolylookupvert(vec3_t v)
2027 for (i = 0;i < subdivpolyverts;i++)
2028 if (subdivpolyvert[i][0] == v[0]
2029 && subdivpolyvert[i][1] == v[1]
2030 && subdivpolyvert[i][2] == v[2])
2032 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2033 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2034 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2035 return subdivpolyverts++;
2038 static void SubdividePolygon(int numverts, float *verts)
2040 int i, i1, i2, i3, f, b, c, p;
2041 vec3_t mins, maxs, front[256], back[256];
2042 float m, *pv, *cv, dist[256], frac;
2045 Host_Error("SubdividePolygon: ran out of verts in buffer");
2047 BoundPoly(numverts, verts, mins, maxs);
2049 for (i = 0;i < 3;i++)
2051 m = (mins[i] + maxs[i]) * 0.5;
2052 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2053 if (maxs[i] - m < 8)
2055 if (m - mins[i] < 8)
2059 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2060 dist[c] = cv[i] - m;
2063 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2067 VectorCopy(pv, front[f]);
2072 VectorCopy(pv, back[b]);
2075 if (dist[p] == 0 || dist[c] == 0)
2077 if ((dist[p] > 0) != (dist[c] > 0) )
2080 frac = dist[p] / (dist[p] - dist[c]);
2081 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2082 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2083 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2089 SubdividePolygon(f, front[0]);
2090 SubdividePolygon(b, back[0]);
2094 i1 = subdivpolylookupvert(verts);
2095 i2 = subdivpolylookupvert(verts + 3);
2096 for (i = 2;i < numverts;i++)
2098 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2100 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2104 i3 = subdivpolylookupvert(verts + i * 3);
2105 subdivpolyindex[subdivpolytriangles][0] = i1;
2106 subdivpolyindex[subdivpolytriangles][1] = i2;
2107 subdivpolyindex[subdivpolytriangles][2] = i3;
2109 subdivpolytriangles++;
2113 //Breaks a polygon up along axial 64 unit
2114 //boundaries so that turbulent and sky warps
2115 //can be done reasonably.
2116 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2122 subdivpolytriangles = 0;
2123 subdivpolyverts = 0;
2124 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2125 if (subdivpolytriangles < 1)
2126 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2128 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2129 mesh->num_vertices = subdivpolyverts;
2130 mesh->num_triangles = subdivpolytriangles;
2131 mesh->vertex = (surfvertex_t *)(mesh + 1);
2132 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2133 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2135 for (i = 0;i < mesh->num_triangles;i++)
2136 for (j = 0;j < 3;j++)
2137 mesh->index[i*3+j] = subdivpolyindex[i][j];
2139 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2141 VectorCopy(subdivpolyvert[i], v->v);
2142 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2143 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2148 /* Maximum size of a single LM */
2149 #define MAX_SINGLE_LM_SIZE 256
2157 struct alloc_lm_state
2160 struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2163 static void init_alloc_lm_state (struct alloc_lm_state* state)
2167 state->currentY = 0;
2168 for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2170 state->rows[r].currentX = 0;
2171 state->rows[r].rowY = -1;
2175 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2177 struct alloc_lm_row* row;
2180 row = &(state->rows[blockheight]);
2181 if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2183 if (state->currentY + blockheight <= totalheight)
2185 row->rowY = state->currentY;
2187 state->currentY += blockheight;
2191 /* See if we can stuff the block into a higher row */
2193 for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2195 if ((state->rows[r].rowY >= 0)
2196 && (state->rows[r].currentX + blockwidth <= totalwidth))
2198 row = &(state->rows[r]);
2202 if (row == NULL) return false;
2206 *outx = row->currentX;
2207 row->currentX += blockwidth;
2212 extern cvar_t gl_max_size;
2213 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2216 msurface_t *surface;
2217 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2218 float texmins[2], texmaxs[2], val;
2219 rtexture_t *lightmaptexture, *deluxemaptexture;
2221 in = (dface_t *)(mod_base + l->fileofs);
2222 if (l->filelen % sizeof(*in))
2223 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2224 count = l->filelen / sizeof(*in);
2225 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2226 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2228 loadmodel->num_surfaces = count;
2230 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2234 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2236 numedges = (unsigned short)LittleShort(in->numedges);
2237 totalverts += numedges;
2238 totaltris += numedges - 2;
2241 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2243 lightmaptexture = NULL;
2244 deluxemaptexture = r_texture_blanknormalmap;
2246 lightmapsize = max(256, gl_max_size.integer);
2247 totallightmapsamples = 0;
2251 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2253 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2255 // FIXME: validate edges, texinfo, etc?
2256 firstedge = LittleLong(in->firstedge);
2257 numedges = (unsigned short)LittleShort(in->numedges);
2258 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)
2259 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2260 i = (unsigned short)LittleShort(in->texinfo);
2261 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2262 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2263 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2264 surface->texture = surface->lightmapinfo->texinfo->texture;
2266 planenum = (unsigned short)LittleShort(in->planenum);
2267 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2268 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2270 //surface->flags = surface->texture->flags;
2271 //if (LittleShort(in->side))
2272 // surface->flags |= SURF_PLANEBACK;
2273 //surface->plane = loadmodel->brush.data_planes + planenum;
2275 surface->num_firstvertex = totalverts;
2276 surface->num_vertices = numedges;
2277 surface->num_firsttriangle = totaltris;
2278 surface->num_triangles = numedges - 2;
2279 totalverts += numedges;
2280 totaltris += numedges - 2;
2282 // convert edges back to a normal polygon
2283 for (i = 0;i < surface->num_vertices;i++)
2285 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2288 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2290 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2291 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2292 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2293 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2294 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2295 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2296 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2297 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2300 for (i = 0;i < surface->num_triangles;i++)
2302 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2303 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2304 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2307 // compile additional data about the surface geometry
2308 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);
2309 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);
2310 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2312 // generate surface extents information
2313 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2314 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2315 for (i = 1;i < surface->num_vertices;i++)
2317 for (j = 0;j < 2;j++)
2319 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2320 texmins[j] = min(texmins[j], val);
2321 texmaxs[j] = max(texmaxs[j], val);
2324 for (i = 0;i < 2;i++)
2326 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2327 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2330 smax = surface->lightmapinfo->extents[0] >> 4;
2331 tmax = surface->lightmapinfo->extents[1] >> 4;
2332 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2333 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2336 for (i = 0;i < MAXLIGHTMAPS;i++)
2337 surface->lightmapinfo->styles[i] = in->styles[i];
2338 surface->lightmaptexture = NULL;
2339 surface->deluxemaptexture = r_texture_blanknormalmap;
2340 i = LittleLong(in->lightofs);
2343 surface->lightmapinfo->samples = NULL;
2345 // give non-lightmapped water a 1x white lightmap
2346 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2348 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2349 surface->lightmapinfo->styles[0] = 0;
2350 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2354 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2355 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2356 else // LordHavoc: white lighting (bsp version 29)
2358 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2359 if (loadmodel->brushq1.nmaplightdata)
2360 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2363 // check if we should apply a lightmap to this
2364 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2366 if (ssize > 256 || tsize > 256)
2367 Host_Error("Bad surface extents");
2369 if (lightmapsize < ssize)
2370 lightmapsize = ssize;
2371 if (lightmapsize < tsize)
2372 lightmapsize = tsize;
2374 totallightmapsamples += ssize*tsize;
2376 // force lightmap upload on first time seeing the surface
2378 // additionally this is used by the later code to see if a
2379 // lightmap is needed on this surface (rather than duplicating the
2381 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2385 // small maps (such as ammo boxes especially) don't need big lightmap
2386 // textures, so this code tries to guess a good size based on
2387 // totallightmapsamples (size of the lightmaps lump basically), as well as
2388 // trying to max out the gl_max_size if there is a lot of lightmap data to
2390 // additionally, never choose a lightmapsize that is smaller than the
2391 // largest surface encountered (as it would fail)
2393 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2396 // now that we've decided the lightmap texture size, we can do the rest
2397 if (cls.state != ca_dedicated)
2399 int stainmapsize = 0;
2400 struct alloc_lm_state allocState;
2402 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2404 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2405 float u, v, ubase, vbase, uscale, vscale;
2407 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2410 smax = surface->lightmapinfo->extents[0] >> 4;
2411 tmax = surface->lightmapinfo->extents[1] >> 4;
2412 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2413 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2414 stainmapsize += ssize * tsize * 3;
2416 if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2418 // allocate a texture pool if we need it
2419 if (loadmodel->texturepool == NULL)
2420 loadmodel->texturepool = R_AllocTexturePool();
2421 // could not find room, make a new lightmap
2422 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2423 if (loadmodel->brushq1.nmaplightdata)
2424 deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2426 init_alloc_lm_state (&allocState);
2427 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2429 surface->lightmaptexture = lightmaptexture;
2430 surface->deluxemaptexture = deluxemaptexture;
2431 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2432 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2434 uscale = 1.0f / (float)lightmapsize;
2435 vscale = 1.0f / (float)lightmapsize;
2436 ubase = lightmapx * uscale;
2437 vbase = lightmapy * vscale;
2439 for (i = 0;i < surface->num_vertices;i++)
2441 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);
2442 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);
2443 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2444 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2445 // LordHavoc: calc lightmap data offset for vertex lighting to use
2448 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2452 if (cl_stainmaps.integer)
2454 // allocate stainmaps for permanent marks on walls and clear white
2455 unsigned char *stainsamples = NULL;
2456 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2457 memset(stainsamples, 255, stainmapsize);
2459 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2461 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2463 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2464 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2465 surface->lightmapinfo->stainsamples = stainsamples;
2466 stainsamples += ssize * tsize * 3;
2471 // generate ushort elements array if possible
2472 if (loadmodel->surfmesh.data_element3s)
2473 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2474 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2477 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2480 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2481 node->parent = parent;
2484 // this is a node, recurse to children
2485 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2486 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2487 // combine supercontents of children
2488 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2493 mleaf_t *leaf = (mleaf_t *)node;
2494 // if this is a leaf, calculate supercontents mask from all collidable
2495 // primitives in the leaf (brushes and collision surfaces)
2496 // also flag if the leaf contains any collision surfaces
2497 leaf->combinedsupercontents = 0;
2498 // combine the supercontents values of all brushes in this leaf
2499 for (j = 0;j < leaf->numleafbrushes;j++)
2500 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2501 // check if this leaf contains any collision surfaces (q3 patches)
2502 for (j = 0;j < leaf->numleafsurfaces;j++)
2504 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2505 if (surface->num_collisiontriangles)
2507 leaf->containscollisionsurfaces = true;
2508 leaf->combinedsupercontents |= surface->texture->supercontents;
2514 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2520 in = (dnode_t *)(mod_base + l->fileofs);
2521 if (l->filelen % sizeof(*in))
2522 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2523 count = l->filelen / sizeof(*in);
2524 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2526 loadmodel->brush.data_nodes = out;
2527 loadmodel->brush.num_nodes = count;
2529 for ( i=0 ; i<count ; i++, in++, out++)
2531 for (j=0 ; j<3 ; j++)
2533 out->mins[j] = LittleShort(in->mins[j]);
2534 out->maxs[j] = LittleShort(in->maxs[j]);
2537 p = LittleLong(in->planenum);
2538 out->plane = loadmodel->brush.data_planes + p;
2540 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2541 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2543 for (j=0 ; j<2 ; j++)
2545 // LordHavoc: this code supports broken bsp files produced by
2546 // arguire qbsp which can produce more than 32768 nodes, any value
2547 // below count is assumed to be a node number, any other value is
2548 // assumed to be a leaf number
2549 p = (unsigned short)LittleShort(in->children[j]);
2552 if (p < loadmodel->brush.num_nodes)
2553 out->children[j] = loadmodel->brush.data_nodes + p;
2556 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2557 // map it to the solid leaf
2558 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2563 // note this uses 65535 intentionally, -1 is leaf 0
2565 if (p < loadmodel->brush.num_leafs)
2566 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2569 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2570 // map it to the solid leaf
2571 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2577 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2580 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2586 in = (dleaf_t *)(mod_base + l->fileofs);
2587 if (l->filelen % sizeof(*in))
2588 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2589 count = l->filelen / sizeof(*in);
2590 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2592 loadmodel->brush.data_leafs = out;
2593 loadmodel->brush.num_leafs = count;
2594 // get visleafs from the submodel data
2595 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2596 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2597 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2598 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2600 for ( i=0 ; i<count ; i++, in++, out++)
2602 for (j=0 ; j<3 ; j++)
2604 out->mins[j] = LittleShort(in->mins[j]);
2605 out->maxs[j] = LittleShort(in->maxs[j]);
2608 // FIXME: this function could really benefit from some error checking
2610 out->contents = LittleLong(in->contents);
2612 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2613 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2614 if (out->firstleafsurface < 0 || (unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2616 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);
2617 out->firstleafsurface = NULL;
2618 out->numleafsurfaces = 0;
2621 out->clusterindex = i - 1;
2622 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2623 out->clusterindex = -1;
2625 p = LittleLong(in->visofs);
2626 // ignore visofs errors on leaf 0 (solid)
2627 if (p >= 0 && out->clusterindex >= 0)
2629 if (p >= loadmodel->brushq1.num_compressedpvs)
2630 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2632 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);
2635 for (j = 0;j < 4;j++)
2636 out->ambient_sound_level[j] = in->ambient_level[j];
2638 // FIXME: Insert caustics here
2642 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2646 const unsigned char *pvs;
2647 // if there's no vis data, assume supported (because everything is visible all the time)
2648 if (!loadmodel->brush.data_pvsclusters)
2650 // check all liquid leafs to see if they can see into empty leafs, if any
2651 // can we can assume this map supports r_wateralpha
2652 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2654 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2656 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2657 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2658 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2665 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2672 in = (dclipnode_t *)(mod_base + l->fileofs);
2673 if (l->filelen % sizeof(*in))
2674 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2675 count = l->filelen / sizeof(*in);
2676 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2678 loadmodel->brushq1.clipnodes = out;
2679 loadmodel->brushq1.numclipnodes = count;
2681 for (i = 1; i < MAX_MAP_HULLS; i++)
2683 hull = &loadmodel->brushq1.hulls[i];
2684 hull->clipnodes = out;
2685 hull->firstclipnode = 0;
2686 hull->lastclipnode = count-1;
2687 hull->planes = loadmodel->brush.data_planes;
2688 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2689 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2690 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2691 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2692 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2693 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2694 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2697 for (i=0 ; i<count ; i++, out++, in++)
2699 out->planenum = LittleLong(in->planenum);
2700 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2701 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2702 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2703 if (out->children[0] >= count)
2704 out->children[0] -= 65536;
2705 if (out->children[1] >= count)
2706 out->children[1] -= 65536;
2707 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2708 Host_Error("Corrupt clipping hull(out of range planenum)");
2712 //Duplicate the drawing hull structure as a clipping hull
2713 static void Mod_Q1BSP_MakeHull0(void)
2720 hull = &loadmodel->brushq1.hulls[0];
2722 in = loadmodel->brush.data_nodes;
2723 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2725 hull->clipnodes = out;
2726 hull->firstclipnode = 0;
2727 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2728 hull->planes = loadmodel->brush.data_planes;
2730 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2732 out->planenum = in->plane - loadmodel->brush.data_planes;
2733 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2734 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2738 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2743 in = (short *)(mod_base + l->fileofs);
2744 if (l->filelen % sizeof(*in))
2745 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2746 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2747 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2749 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2751 j = (unsigned short) LittleShort(in[i]);
2752 if (j >= loadmodel->num_surfaces)
2753 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2754 loadmodel->brush.data_leafsurfaces[i] = j;
2758 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2763 in = (int *)(mod_base + l->fileofs);
2764 if (l->filelen % sizeof(*in))
2765 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2766 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2767 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2769 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2770 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2774 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2780 in = (dplane_t *)(mod_base + l->fileofs);
2781 if (l->filelen % sizeof(*in))
2782 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2784 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2785 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2787 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2789 out->normal[0] = LittleFloat(in->normal[0]);
2790 out->normal[1] = LittleFloat(in->normal[1]);
2791 out->normal[2] = LittleFloat(in->normal[2]);
2792 out->dist = LittleFloat(in->dist);
2798 static void Mod_Q1BSP_LoadMapBrushes(void)
2802 int submodel, numbrushes;
2803 qboolean firstbrush;
2804 char *text, *maptext;
2805 char mapfilename[MAX_QPATH];
2806 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2807 strlcat (mapfilename, ".map", sizeof (mapfilename));
2808 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2812 if (!COM_ParseToken_Simple(&data, false, false))
2817 if (!COM_ParseToken_Simple(&data, false, false))
2819 if (com_token[0] != '{')
2825 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2828 if (!COM_ParseToken_Simple(&data, false, false))
2830 if (com_token[0] == '}')
2831 break; // end of entity
2832 if (com_token[0] == '{')
2839 if (submodel > loadmodel->brush.numsubmodels)
2841 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2845 model = loadmodel->brush.submodels[submodel];
2852 if (!COM_ParseToken_Simple(&data, false, false))
2854 if (com_token[0] == '}')
2855 break; // end of brush
2856 // each brush face should be this format:
2857 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2858 // FIXME: support hl .map format
2859 for (pointnum = 0;pointnum < 3;pointnum++)
2861 COM_ParseToken_Simple(&data, false, false);
2862 for (componentnum = 0;componentnum < 3;componentnum++)
2864 COM_ParseToken_Simple(&data, false, false);
2865 point[pointnum][componentnum] = atof(com_token);
2867 COM_ParseToken_Simple(&data, false, false);
2869 COM_ParseToken_Simple(&data, false, false);
2870 strlcpy(facetexture, com_token, sizeof(facetexture));
2871 COM_ParseToken_Simple(&data, false, false);
2872 //scroll_s = atof(com_token);
2873 COM_ParseToken_Simple(&data, false, false);
2874 //scroll_t = atof(com_token);
2875 COM_ParseToken_Simple(&data, false, false);
2876 //rotate = atof(com_token);
2877 COM_ParseToken_Simple(&data, false, false);
2878 //scale_s = atof(com_token);
2879 COM_ParseToken_Simple(&data, false, false);
2880 //scale_t = atof(com_token);
2881 TriangleNormal(point[0], point[1], point[2], planenormal);
2882 VectorNormalizeDouble(planenormal);
2883 planedist = DotProduct(point[0], planenormal);
2884 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2894 #define MAX_PORTALPOINTS 64
2896 typedef struct portal_s
2899 mnode_t *nodes[2]; // [0] = front side of plane
2900 struct portal_s *next[2];
2902 double points[3*MAX_PORTALPOINTS];
2903 struct portal_s *chain; // all portals are linked into a list
2907 static portal_t *portalchain;
2914 static portal_t *AllocPortal(void)
2917 p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2918 p->chain = portalchain;
2923 static void FreePortal(portal_t *p)
2928 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2930 // process only nodes (leafs already had their box calculated)
2934 // calculate children first
2935 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2936 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2938 // make combined bounding box from children
2939 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2940 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2941 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2942 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2943 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2944 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2947 static void Mod_Q1BSP_FinalizePortals(void)
2949 int i, j, numportals, numpoints;
2950 portal_t *p, *pnext;
2953 mleaf_t *leaf, *endleaf;
2955 // tally up portal and point counts and recalculate bounding boxes for all
2956 // leafs (because qbsp is very sloppy)
2957 leaf = loadmodel->brush.data_leafs;
2958 endleaf = leaf + loadmodel->brush.num_leafs;
2959 for (;leaf < endleaf;leaf++)
2961 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2962 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2969 // note: this check must match the one below or it will usually corrupt memory
2970 // 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
2971 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2974 numpoints += p->numpoints * 2;
2978 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2979 loadmodel->brush.num_portals = numportals;
2980 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2981 loadmodel->brush.num_portalpoints = numpoints;
2982 // clear all leaf portal chains
2983 for (i = 0;i < loadmodel->brush.num_leafs;i++)
2984 loadmodel->brush.data_leafs[i].portals = NULL;
2985 // process all portals in the global portal chain, while freeing them
2986 portal = loadmodel->brush.data_portals;
2987 point = loadmodel->brush.data_portalpoints;
2994 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2996 // note: this check must match the one above or it will usually corrupt memory
2997 // 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
2998 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3000 // first make the back to front portal(forward portal)
3001 portal->points = point;
3002 portal->numpoints = p->numpoints;
3003 portal->plane.dist = p->plane.dist;
3004 VectorCopy(p->plane.normal, portal->plane.normal);
3005 portal->here = (mleaf_t *)p->nodes[1];
3006 portal->past = (mleaf_t *)p->nodes[0];
3008 for (j = 0;j < portal->numpoints;j++)
3010 VectorCopy(p->points + j*3, point->position);
3013 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3014 PlaneClassify(&portal->plane);
3016 // link into leaf's portal chain
3017 portal->next = portal->here->portals;
3018 portal->here->portals = portal;
3020 // advance to next portal
3023 // then make the front to back portal(backward portal)
3024 portal->points = point;
3025 portal->numpoints = p->numpoints;
3026 portal->plane.dist = -p->plane.dist;
3027 VectorNegate(p->plane.normal, portal->plane.normal);
3028 portal->here = (mleaf_t *)p->nodes[0];
3029 portal->past = (mleaf_t *)p->nodes[1];
3031 for (j = portal->numpoints - 1;j >= 0;j--)
3033 VectorCopy(p->points + j*3, point->position);
3036 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3037 PlaneClassify(&portal->plane);
3039 // link into leaf's portal chain
3040 portal->next = portal->here->portals;
3041 portal->here->portals = portal;
3043 // advance to next portal
3046 // add the portal's polygon points to the leaf bounding boxes
3047 for (i = 0;i < 2;i++)
3049 leaf = (mleaf_t *)p->nodes[i];
3050 for (j = 0;j < p->numpoints;j++)
3052 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3053 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3054 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3055 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3056 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3057 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3064 // now recalculate the node bounding boxes from the leafs
3065 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
3073 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3076 Host_Error("AddPortalToNodes: NULL front node");
3078 Host_Error("AddPortalToNodes: NULL back node");
3079 if (p->nodes[0] || p->nodes[1])
3080 Host_Error("AddPortalToNodes: already included");
3081 // 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
3083 p->nodes[0] = front;
3084 p->next[0] = (portal_t *)front->portals;
3085 front->portals = (mportal_t *)p;
3088 p->next[1] = (portal_t *)back->portals;
3089 back->portals = (mportal_t *)p;
3094 RemovePortalFromNode
3097 static void RemovePortalFromNodes(portal_t *portal)
3101 void **portalpointer;
3103 for (i = 0;i < 2;i++)
3105 node = portal->nodes[i];
3107 portalpointer = (void **) &node->portals;
3110 t = (portal_t *)*portalpointer;
3112 Host_Error("RemovePortalFromNodes: portal not in leaf");
3116 if (portal->nodes[0] == node)
3118 *portalpointer = portal->next[0];
3119 portal->nodes[0] = NULL;
3121 else if (portal->nodes[1] == node)
3123 *portalpointer = portal->next[1];
3124 portal->nodes[1] = NULL;
3127 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3131 if (t->nodes[0] == node)
3132 portalpointer = (void **) &t->next[0];
3133 else if (t->nodes[1] == node)
3134 portalpointer = (void **) &t->next[1];
3136 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3141 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3142 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3145 mnode_t *front, *back, *other_node;
3146 mplane_t clipplane, *plane;
3147 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3148 int numfrontpoints, numbackpoints;
3149 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3151 // if a leaf, we're done
3155 plane = node->plane;
3157 front = node->children[0];
3158 back = node->children[1];
3160 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3162 // create the new portal by generating a polygon for the node plane,
3163 // and clipping it by all of the other portals(which came from nodes above this one)
3164 nodeportal = AllocPortal();
3165 nodeportal->plane = *plane;
3167 // 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)
3168 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);
3169 nodeportal->numpoints = 4;
3170 side = 0; // shut up compiler warning
3171 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3173 clipplane = portal->plane;
3174 if (portal->nodes[0] == portal->nodes[1])
3175 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3176 if (portal->nodes[0] == node)
3178 else if (portal->nodes[1] == node)
3180 clipplane.dist = -clipplane.dist;
3181 VectorNegate(clipplane.normal, clipplane.normal);
3185 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3187 for (i = 0;i < nodeportal->numpoints*3;i++)
3188 frontpoints[i] = nodeportal->points[i];
3189 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);
3190 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3194 if (nodeportal->numpoints < 3)
3196 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3197 nodeportal->numpoints = 0;
3199 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3201 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3202 nodeportal->numpoints = 0;
3205 AddPortalToNodes(nodeportal, front, back);
3207 // split the portals of this node along this node's plane and assign them to the children of this node
3208 // (migrating the portals downward through the tree)
3209 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3211 if (portal->nodes[0] == portal->nodes[1])
3212 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3213 if (portal->nodes[0] == node)
3215 else if (portal->nodes[1] == node)
3218 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3219 nextportal = portal->next[side];
3220 if (!portal->numpoints)
3223 other_node = portal->nodes[!side];
3224 RemovePortalFromNodes(portal);
3226 // cut the portal into two portals, one on each side of the node plane
3227 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);
3229 if (!numfrontpoints)
3232 AddPortalToNodes(portal, back, other_node);
3234 AddPortalToNodes(portal, other_node, back);
3240 AddPortalToNodes(portal, front, other_node);
3242 AddPortalToNodes(portal, other_node, front);
3246 // the portal is split
3247 splitportal = AllocPortal();
3248 temp = splitportal->chain;
3249 *splitportal = *portal;
3250 splitportal->chain = temp;
3251 for (i = 0;i < numbackpoints*3;i++)
3252 splitportal->points[i] = backpoints[i];
3253 splitportal->numpoints = numbackpoints;
3254 for (i = 0;i < numfrontpoints*3;i++)
3255 portal->points[i] = frontpoints[i];
3256 portal->numpoints = numfrontpoints;
3260 AddPortalToNodes(portal, front, other_node);
3261 AddPortalToNodes(splitportal, back, other_node);
3265 AddPortalToNodes(portal, other_node, front);
3266 AddPortalToNodes(splitportal, other_node, back);
3270 Mod_Q1BSP_RecursiveNodePortals(front);
3271 Mod_Q1BSP_RecursiveNodePortals(back);
3274 static void Mod_Q1BSP_MakePortals(void)
3277 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3278 Mod_Q1BSP_FinalizePortals();
3281 //Returns PVS data for a given point
3282 //(note: can return NULL)
3283 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3286 node = model->brush.data_nodes;
3288 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3289 if (((mleaf_t *)node)->clusterindex >= 0)
3290 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3295 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)
3299 float d = PlaneDiff(org, node->plane);
3301 node = node->children[0];
3302 else if (d < -radius)
3303 node = node->children[1];
3306 // go down both sides
3307 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3308 node = node->children[1];
3311 // if this leaf is in a cluster, accumulate the pvs bits
3312 if (((mleaf_t *)node)->clusterindex >= 0)
3315 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3316 for (i = 0;i < pvsbytes;i++)
3317 pvsbuffer[i] |= pvs[i];
3321 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3322 //of the given point.
3323 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3325 int bytes = model->brush.num_pvsclusterbytes;
3326 bytes = min(bytes, pvsbufferlength);
3327 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3329 memset(pvsbuffer, 0xFF, bytes);
3333 memset(pvsbuffer, 0, bytes);
3334 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3338 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3343 VectorSubtract(inmaxs, inmins, size);
3344 if (cmodel->brush.ishlbsp)
3347 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3348 else if (size[0] <= 32)
3350 if (size[2] < 54) // pick the nearest of 36 or 72
3351 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3353 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3356 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3361 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3362 else if (size[0] <= 32)
3363 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3365 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3367 VectorCopy(inmins, outmins);
3368 VectorAdd(inmins, hull->clip_size, outmaxs);
3371 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3376 mempool_t *mainmempool;
3377 float dist, modelyawradius, modelradius;
3378 msurface_t *surface;
3379 int numshadowmeshtriangles;
3380 hullinfo_t hullinfo;
3381 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3382 model_brush_lightstyleinfo_t styleinfo[256];
3383 unsigned char *datapointer;
3385 mod->modeldatatypestring = "Q1BSP";
3387 mod->type = mod_brushq1;
3389 header = (dheader_t *)buffer;
3391 i = LittleLong(header->version);
3392 if (i != BSPVERSION && i != 30)
3393 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3394 mod->brush.ishlbsp = i == 30;
3396 // fill in hull info
3397 VectorClear (hullinfo.hullsizes[0][0]);
3398 VectorClear (hullinfo.hullsizes[0][1]);
3399 if (mod->brush.ishlbsp)
3401 mod->modeldatatypestring = "HLBSP";
3403 hullinfo.filehulls = 4;
3404 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3405 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3406 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3407 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3408 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3409 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3413 hullinfo.filehulls = 4;
3414 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3415 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3416 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3417 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3421 mod_base = (unsigned char*)buffer;
3422 for (i = 0; i < HEADER_LUMPS; i++)
3424 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3425 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3428 mod->soundfromcenter = true;
3429 mod->TraceBox = Mod_Q1BSP_TraceBox;
3430 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3431 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3432 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3433 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3434 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3435 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3436 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3437 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3438 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3439 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3440 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3441 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3442 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3443 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3444 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3445 mod->Draw = R_Q1BSP_Draw;
3446 mod->DrawDepth = R_Q1BSP_DrawDepth;
3447 mod->DrawDebug = R_Q1BSP_DrawDebug;
3448 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3449 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3450 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3451 mod->DrawLight = R_Q1BSP_DrawLight;
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 // duplicate the basic information
3558 dpsnprintf(name, sizeof(name), "*%i", i);
3559 mod = Mod_FindName(name, loadmodel->name);
3560 // copy the base model to this one
3562 // rename the clone back to its proper name
3563 strlcpy(mod->name, name, sizeof(mod->name));
3564 mod->brush.parentmodel = loadmodel;
3565 // textures and memory belong to the main model
3566 mod->texturepool = NULL;
3567 mod->mempool = NULL;
3568 mod->brush.TraceLineOfSight = NULL;
3569 mod->brush.GetPVS = NULL;
3570 mod->brush.FatPVS = NULL;
3571 mod->brush.BoxTouchingPVS = NULL;
3572 mod->brush.BoxTouchingLeafPVS = NULL;
3573 mod->brush.BoxTouchingVisibleLeafs = NULL;
3574 mod->brush.FindBoxClusters = NULL;
3575 mod->brush.LightPoint = NULL;
3576 mod->brush.AmbientSoundLevelsForPoint = NULL;
3579 mod->brush.submodel = i;
3581 if (loadmodel->brush.submodels)
3582 loadmodel->brush.submodels[i] = mod;
3584 bm = &mod->brushq1.submodels[i];
3586 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3587 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3589 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3590 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3593 mod->firstmodelsurface = bm->firstface;
3594 mod->nummodelsurfaces = bm->numfaces;
3596 // make the model surface list (used by shadowing/lighting)
3597 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3598 Mod_MakeSortedSurfaces(mod);
3600 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3601 // (previously this code measured the radius of the vertices of surfaces in the submodel, but that broke submodels that contain only CLIP brushes, which do not produce surfaces)
3602 VectorCopy(bm->mins, mod->normalmins);
3603 VectorCopy(bm->maxs, mod->normalmaxs);
3604 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3605 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3606 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3607 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3608 modelradius = modelyawradius + modelradius * modelradius;
3609 modelyawradius = sqrt(modelyawradius);
3610 modelradius = sqrt(modelradius);
3611 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3612 mod->yawmins[2] = mod->normalmins[2];
3613 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
3614 mod->yawmaxs[2] = mod->normalmaxs[2];
3615 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3616 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3617 mod->radius = modelradius;
3618 mod->radius2 = modelradius * modelradius;
3620 // this gets altered below if sky or water is used
3621 mod->DrawSky = NULL;
3622 mod->DrawAddWaterPlanes = NULL;
3624 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3625 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3626 if (mod->nummodelsurfaces)
3628 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3629 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3631 if (j < mod->nummodelsurfaces)
3632 mod->DrawSky = R_Q1BSP_DrawSky;
3634 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3635 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3637 if (j < mod->nummodelsurfaces)
3638 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3640 // build lightstyle update chains
3641 // (used to rapidly mark lightmapupdateflags on many surfaces
3642 // when d_lightstylevalue changes)
3643 memset(stylecounts, 0, sizeof(stylecounts));
3644 for (k = 0;k < mod->nummodelsurfaces;k++)
3646 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3647 for (j = 0;j < MAXLIGHTMAPS;j++)
3648 stylecounts[surface->lightmapinfo->styles[j]]++;
3650 mod->brushq1.num_lightstyles = 0;
3651 for (k = 0;k < 255;k++)
3655 styleinfo[mod->brushq1.num_lightstyles].style = k;
3656 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3657 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3658 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3659 remapstyles[k] = mod->brushq1.num_lightstyles;
3660 mod->brushq1.num_lightstyles++;
3663 for (k = 0;k < mod->nummodelsurfaces;k++)
3665 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3666 for (j = 0;j < MAXLIGHTMAPS;j++)
3668 if (surface->lightmapinfo->styles[j] != 255)
3670 int r = remapstyles[surface->lightmapinfo->styles[j]];
3671 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3675 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3676 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3680 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3681 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3683 //mod->brushq1.num_visleafs = bm->visleafs;
3686 Mod_Q1BSP_LoadMapBrushes();
3688 //Mod_Q1BSP_ProcessLightList();
3690 if (developer.integer >= 10)
3691 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);
3694 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3698 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3705 in = (void *)(mod_base + l->fileofs);
3706 if (l->filelen % sizeof(*in))
3707 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3708 count = l->filelen / sizeof(*in);
3709 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3712 loadmodel->num = count;
3714 for (i = 0;i < count;i++, in++, out++)
3720 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3727 in = (void *)(mod_base + l->fileofs);
3728 if (l->filelen % sizeof(*in))
3729 Host_Error("Mod_Q2BSP_LoadVertices: 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_LoadVisibility(lump_t *l)
3749 in = (void *)(mod_base + l->fileofs);
3750 if (l->filelen % sizeof(*in))
3751 Host_Error("Mod_Q2BSP_LoadVisibility: 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_LoadNodes(lump_t *l)
3771 in = (void *)(mod_base + l->fileofs);
3772 if (l->filelen % sizeof(*in))
3773 Host_Error("Mod_Q2BSP_LoadNodes: 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_LoadTexInfo(lump_t *l)
3793 in = (void *)(mod_base + l->fileofs);
3794 if (l->filelen % sizeof(*in))
3795 Host_Error("Mod_Q2BSP_LoadTexInfo: 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_LoadFaces(lump_t *l)
3815 in = (void *)(mod_base + l->fileofs);
3816 if (l->filelen % sizeof(*in))
3817 Host_Error("Mod_Q2BSP_LoadFaces: 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_LoadLighting(lump_t *l)
3837 in = (void *)(mod_base + l->fileofs);
3838 if (l->filelen % sizeof(*in))
3839 Host_Error("Mod_Q2BSP_LoadLighting: 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_LoadLeafs(lump_t *l)
3859 in = (void *)(mod_base + l->fileofs);
3860 if (l->filelen % sizeof(*in))
3861 Host_Error("Mod_Q2BSP_LoadLeafs: 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_LoadLeafFaces(lump_t *l)
3881 in = (void *)(mod_base + l->fileofs);
3882 if (l->filelen % sizeof(*in))
3883 Host_Error("Mod_Q2BSP_LoadLeafFaces: 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_LoadLeafBrushes(lump_t *l)
3903 in = (void *)(mod_base + l->fileofs);
3904 if (l->filelen % sizeof(*in))
3905 Host_Error("Mod_Q2BSP_LoadLeafBrushes: 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_LoadEdges(lump_t *l)
3925 in = (void *)(mod_base + l->fileofs);
3926 if (l->filelen % sizeof(*in))
3927 Host_Error("Mod_Q2BSP_LoadEdges: 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_LoadSurfEdges(lump_t *l)
3947 in = (void *)(mod_base + l->fileofs);
3948 if (l->filelen % sizeof(*in))
3949 Host_Error("Mod_Q2BSP_LoadSurfEdges: 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_LoadBrushes(lump_t *l)
3969 in = (void *)(mod_base + l->fileofs);
3970 if (l->filelen % sizeof(*in))
3971 Host_Error("Mod_Q2BSP_LoadBrushes: 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_LoadBrushSides(lump_t *l)
3991 in = (void *)(mod_base + l->fileofs);
3992 if (l->filelen % sizeof(*in))
3993 Host_Error("Mod_Q2BSP_LoadBrushSides: 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_LoadAreas(lump_t *l)
4013 in = (void *)(mod_base + l->fileofs);
4014 if (l->filelen % sizeof(*in))
4015 Host_Error("Mod_Q2BSP_LoadAreas: 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_LoadAreaPortals(lump_t *l)
4035 in = (void *)(mod_base + l->fileofs);
4036 if (l->filelen % sizeof(*in))
4037 Host_Error("Mod_Q2BSP_LoadAreaPortals: 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_LoadModels(lump_t *l)
4057 in = (void *)(mod_base + l->fileofs);
4058 if (l->filelen % sizeof(*in))
4059 Host_Error("Mod_Q2BSP_LoadModels: 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 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4075 q2dheader_t *header;
4077 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4079 mod->modeldatatypestring = "Q2BSP";
4081 mod->type = mod_brushq2;
4083 header = (q2dheader_t *)buffer;
4085 i = LittleLong(header->version);
4086 if (i != Q2BSPVERSION)
4087 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4089 mod_base = (unsigned char *)header;
4091 // swap all the lumps
4092 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4093 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4095 mod->brush.qw_md4sum = 0;
4096 mod->brush.qw_md4sum2 = 0;
4097 for (i = 0;i < Q2HEADER_LUMPS;i++)
4099 if (i == Q2LUMP_ENTITIES)
4101 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4102 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4104 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4107 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4108 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4109 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4110 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4111 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4112 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4113 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4114 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4115 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4116 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4117 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4118 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4119 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4120 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4121 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4122 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4123 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4124 // LordHavoc: must go last because this makes the submodels
4125 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4128 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4129 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4131 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4134 char key[128], value[MAX_INPUTLINE];
4136 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4137 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4138 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4141 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4142 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4143 loadmodel->brush.entities[l->filelen] = 0;
4144 data = loadmodel->brush.entities;
4145 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4146 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4150 if (!COM_ParseToken_Simple(&data, false, false))
4152 if (com_token[0] == '}')
4153 break; // end of worldspawn
4154 if (com_token[0] == '_')
4155 strlcpy(key, com_token + 1, sizeof(key));
4157 strlcpy(key, com_token, sizeof(key));
4158 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4159 key[strlen(key)-1] = 0;
4160 if (!COM_ParseToken_Simple(&data, false, false))
4162 strlcpy(value, com_token, sizeof(value));
4163 if (!strcmp("gridsize", key))
4165 #if _MSC_VER >= 1400
4166 #define sscanf sscanf_s
4168 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4169 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4175 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4181 in = (q3dtexture_t *)(mod_base + l->fileofs);
4182 if (l->filelen % sizeof(*in))
4183 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4184 count = l->filelen / sizeof(*in);
4185 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4187 loadmodel->data_textures = out;
4188 loadmodel->num_textures = count;
4189 loadmodel->num_texturesperskin = loadmodel->num_textures;
4191 for (i = 0;i < count;i++)
4193 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4194 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4195 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4198 if (cls.state == ca_dedicated)
4201 for (i = 0;i < count;i++, in++, out++)
4202 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4205 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4211 in = (q3dplane_t *)(mod_base + l->fileofs);
4212 if (l->filelen % sizeof(*in))
4213 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4214 count = l->filelen / sizeof(*in);
4215 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4217 loadmodel->brush.data_planes = out;
4218 loadmodel->brush.num_planes = count;
4220 for (i = 0;i < count;i++, in++, out++)
4222 out->normal[0] = LittleFloat(in->normal[0]);
4223 out->normal[1] = LittleFloat(in->normal[1]);
4224 out->normal[2] = LittleFloat(in->normal[2]);
4225 out->dist = LittleFloat(in->dist);
4230 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4233 q3mbrushside_t *out;
4236 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4237 if (l->filelen % sizeof(*in))
4238 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4239 count = l->filelen / sizeof(*in);
4240 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4242 loadmodel->brush.data_brushsides = out;
4243 loadmodel->brush.num_brushsides = count;
4245 for (i = 0;i < count;i++, in++, out++)
4247 n = LittleLong(in->planeindex);
4248 if (n < 0 || n >= loadmodel->brush.num_planes)
4249 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4250 out->plane = loadmodel->brush.data_planes + n;
4251 n = LittleLong(in->textureindex);
4252 if (n < 0 || n >= loadmodel->num_textures)
4253 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4254 out->texture = loadmodel->data_textures + n;
4258 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4260 q3dbrushside_ig_t *in;
4261 q3mbrushside_t *out;
4264 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4265 if (l->filelen % sizeof(*in))
4266 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4267 count = l->filelen / sizeof(*in);
4268 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4270 loadmodel->brush.data_brushsides = out;
4271 loadmodel->brush.num_brushsides = count;
4273 for (i = 0;i < count;i++, in++, out++)
4275 n = LittleLong(in->planeindex);
4276 if (n < 0 || n >= loadmodel->brush.num_planes)
4277 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4278 out->plane = loadmodel->brush.data_planes + n;
4279 n = LittleLong(in->textureindex);
4280 if (n < 0 || n >= loadmodel->num_textures)
4281 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4282 out->texture = loadmodel->data_textures + n;
4286 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4290 int i, j, n, c, count, maxplanes;
4291 colplanef_t *planes;
4293 in = (q3dbrush_t *)(mod_base + l->fileofs);
4294 if (l->filelen % sizeof(*in))
4295 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4296 count = l->filelen / sizeof(*in);
4297 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4299 loadmodel->brush.data_brushes = out;
4300 loadmodel->brush.num_brushes = count;
4305 for (i = 0;i < count;i++, in++, out++)
4307 n = LittleLong(in->firstbrushside);
4308 c = LittleLong(in->numbrushsides);
4309 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4310 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4311 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4312 out->numbrushsides = c;
4313 n = LittleLong(in->textureindex);
4314 if (n < 0 || n >= loadmodel->num_textures)
4315 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4316 out->texture = loadmodel->data_textures + n;
4318 // make a list of mplane_t structs to construct a colbrush from
4319 if (maxplanes < out->numbrushsides)
4321 maxplanes = out->numbrushsides;
4324 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4326 for (j = 0;j < out->numbrushsides;j++)
4328 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4329 planes[j].dist = out->firstbrushside[j].plane->dist;
4330 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4331 planes[j].texture = out->firstbrushside[j].texture;
4333 // make the colbrush from the planes
4334 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4336 // this whole loop can take a while (e.g. on redstarrepublic4)
4337 CL_KeepaliveMessage(false);
4343 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4349 in = (q3deffect_t *)(mod_base + l->fileofs);
4350 if (l->filelen % sizeof(*in))
4351 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4352 count = l->filelen / sizeof(*in);
4353 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4355 loadmodel->brushq3.data_effects = out;
4356 loadmodel->brushq3.num_effects = count;
4358 for (i = 0;i < count;i++, in++, out++)
4360 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4361 n = LittleLong(in->brushindex);
4362 if (n >= loadmodel->brush.num_brushes)
4364 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4367 out->brushindex = n;
4368 out->unknown = LittleLong(in->unknown);
4372 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4377 in = (q3dvertex_t *)(mod_base + l->fileofs);
4378 if (l->filelen % sizeof(*in))
4379 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4380 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4381 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4382 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4383 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4384 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4385 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4387 for (i = 0;i < count;i++, in++)
4389 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4390 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4391 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4392 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4393 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4394 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4395 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4396 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4397 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4398 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4399 // svector/tvector are calculated later in face loading
4400 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4401 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4402 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4403 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4407 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4413 in = (int *)(mod_base + l->fileofs);
4414 if (l->filelen % sizeof(int[3]))
4415 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4416 count = l->filelen / sizeof(*in);
4417 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4419 loadmodel->brushq3.num_triangles = count / 3;
4420 loadmodel->brushq3.data_element3i = out;
4422 for (i = 0;i < count;i++, in++, out++)
4424 *out = LittleLong(*in);
4425 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4427 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4433 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4435 q3dlightmap_t *input_pointer;
4436 int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4439 unsigned char *convertedpixels;
4440 char mapname[MAX_QPATH];
4441 int size, bytesperpixel, rgbmap[3];
4443 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4445 // defaults for q3bsp
4452 loadmodel->brushq3.lightmapsize = 128;
4454 if (cls.state == ca_dedicated)
4457 if(mod_q3bsp_nolightmaps.integer)
4463 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4464 if (developer_loading.integer)
4465 Con_Printf("Using internal lightmaps\n");
4466 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4467 if (l->filelen % sizeof(*input_pointer))
4468 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4469 count = l->filelen / sizeof(*input_pointer);
4470 for(i = 0; i < count; ++i)
4471 inpixels[i] = input_pointer[i].rgb;
4475 // no internal lightmaps
4476 // try external lightmaps
4477 if (developer_loading.integer)
4478 Con_Printf("Using external lightmaps\n");
4479 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4480 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false);
4484 // using EXTERNAL lightmaps instead
4485 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4487 Mem_Free(inpixels[0]);
4488 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4498 for(count = 1; ; ++count)
4500 inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false);
4501 if(!inpixels[count])
4502 break; // we got all of them
4503 if(image_width != size || image_height != size)
4505 for(i = 0; i <= count; ++i)
4506 Mem_Free(inpixels[i]);
4507 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4512 convertedpixels = (unsigned char *) Mem_Alloc(tempmempool, size*size*4);
4513 loadmodel->brushq3.lightmapsize = size;
4514 loadmodel->brushq3.num_originallightmaps = count;
4516 // now check the surfaces to see if any of them index an odd numbered
4517 // lightmap, if so this is not a deluxemapped bsp file
4519 // also check what lightmaps are actually used, because q3map2 sometimes
4520 // (always?) makes an unused one at the end, which
4521 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4522 // reason when only one lightmap is used, which can throw off the
4523 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4524 // to see if the second lightmap is blank, if so it is not deluxemapped.
4525 loadmodel->brushq3.deluxemapping = !(count & 1);
4526 loadmodel->brushq3.deluxemapping_modelspace = true;
4528 if (loadmodel->brushq3.deluxemapping)
4530 int facecount = faceslump->filelen / sizeof(q3dface_t);
4531 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4532 for (i = 0;i < facecount;i++)
4534 j = LittleLong(faces[i].lightmapindex);
4537 endlightmap = max(endlightmap, j + 1);
4538 if ((j & 1) || j + 1 >= count)
4540 loadmodel->brushq3.deluxemapping = false;
4547 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4548 // reason when only one lightmap is used, which can throw off the
4549 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4550 // to see if the second lightmap is blank, if so it is not deluxemapped.
4552 // further research has shown q3map2 sometimes creates a deluxemap and two
4553 // blank lightmaps, which must be handled properly as well
4554 if (endlightmap == 1 && count > 1)
4557 for (i = 0;i < size*size;i++)
4559 if (c[bytesperpixel*i + rgbmap[0]])
4561 if (c[bytesperpixel*i + rgbmap[1]])
4563 if (c[bytesperpixel*i + rgbmap[2]])
4568 // all pixels in the unused lightmap were black...
4569 loadmodel->brushq3.deluxemapping = false;
4573 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4575 // figure out what the most reasonable merge power is within limits
4576 loadmodel->brushq3.num_lightmapmergepower = 0;
4577 for (power = 1;power <= mod_q3bsp_lightmapmergepower.integer && (128 << power) <= gl_max_texture_size && (1 << (power * 2)) < 4 * (count >> loadmodel->brushq3.deluxemapping);power++)
4578 loadmodel->brushq3.num_lightmapmergepower = power;
4580 // as the lightmap size may actually be another power of 2, adjust for this
4581 // (and interpret it as the power for 128x128 lightmaps above)
4582 for(i = 0; (128 << i) < size; ++i)
4583 loadmodel->brushq3.num_lightmapmergepower -= 1;
4584 if(loadmodel->brushq3.num_lightmapmergepower < 0)
4585 loadmodel->brushq3.num_lightmapmergepower = 0;
4587 loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4589 loadmodel->brushq3.num_mergedlightmaps = ((count >> loadmodel->brushq3.deluxemapping) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4590 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4591 if (loadmodel->brushq3.deluxemapping)
4592 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4594 // allocate a texture pool if we need it
4595 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4596 loadmodel->texturepool = R_AllocTexturePool();
4598 power = loadmodel->brushq3.num_lightmapmergepower;
4600 mask = (1 << power) - 1;
4601 for (i = 0;i < count;i++)
4603 // figure out which merged lightmap texture this fits into
4604 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4605 for (k = 0;k < size*size;k++)
4607 convertedpixels[k*4+0] = inpixels[i][k*bytesperpixel+rgbmap[0]];
4608 convertedpixels[k*4+1] = inpixels[i][k*bytesperpixel+rgbmap[1]];
4609 convertedpixels[k*4+2] = inpixels[i][k*bytesperpixel+rgbmap[2]];
4610 convertedpixels[k*4+3] = 255;
4612 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4614 // if the lightmap has not been allocated yet, create it
4615 if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4617 // create a lightmap only as large as necessary to hold the
4618 // remaining size*size blocks
4619 // if there are multiple merged lightmap textures then they will
4620 // all be full size except the last one which may be smaller
4621 // because it only needs to the remaining blocks, and it will often
4622 // be odd sizes like 2048x512 due to only being 25% full or so.
4623 j = (count >> loadmodel->brushq3.deluxemapping) - (lightmapindex << power2);
4624 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4626 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4628 if (developer_loading.integer)
4629 Con_Printf("lightmap merge texture #%i is %ix%i (%i of %i used)\n", lightmapindex, mergewidth*size, mergeheight*size, min(j, mergewidth*mergeheight), mergewidth*mergeheight);
4630 loadmodel->brushq3.data_lightmaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), mergewidth * size, mergeheight * size, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), NULL);
4631 if (loadmodel->brushq3.data_deluxemaps)
4632 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), mergewidth * size, mergeheight * size, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), NULL);
4634 mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4635 mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4636 j = (i >> loadmodel->brushq3.deluxemapping) & ((1 << power2) - 1);
4637 if (loadmodel->brushq3.deluxemapping && (i & 1))
4638 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4640 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4644 // figure out which merged lightmap texture this fits into
4645 if (loadmodel->brushq3.deluxemapping && (i & 1))
4646 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), size, size, convertedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), NULL);
4648 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), size, size, convertedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), NULL);
4652 Mem_Free(convertedpixels);
4655 for(i = 0; i < count; ++i)
4656 Mem_Free(inpixels[i]);
4660 typedef struct patchtess_s
4664 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
4667 float *originalvertex3f;
4670 #define PATCHTESS_SAME_LODGROUP(a,b) \
4672 (a).lodgroup[0] == (b).lodgroup[0] && \
4673 (a).lodgroup[1] == (b).lodgroup[1] && \
4674 (a).lodgroup[2] == (b).lodgroup[2] && \
4675 (a).lodgroup[3] == (b).lodgroup[3] && \
4676 (a).lodgroup[4] == (b).lodgroup[4] && \
4677 (a).lodgroup[5] == (b).lodgroup[5] \
4680 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4682 q3dface_t *in, *oldin;
4683 msurface_t *out, *oldout;
4684 int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, numvertices, numtriangles, cxtess, cytess;
4685 float lightmaptcbase[2], lightmaptcscale[2];
4686 //int *originalelement3i;
4687 //int *originalneighbor3i;
4688 float *originalvertex3f;
4689 //float *originalsvector3f;
4690 //float *originaltvector3f;
4691 float *originalnormal3f;
4692 float *originalcolor4f;
4693 float *originaltexcoordtexture2f;
4694 float *originaltexcoordlightmap2f;
4696 patchtess_t *patchtess = NULL;
4697 int patchtesscount = 0;
4700 in = (q3dface_t *)(mod_base + l->fileofs);
4701 if (l->filelen % sizeof(*in))
4702 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4703 count = l->filelen / sizeof(*in);
4704 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4706 loadmodel->data_surfaces = out;
4707 loadmodel->num_surfaces = count;
4710 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
4718 for (;i < count;i++, in++, out++)
4720 // check face type first
4721 type = LittleLong(in->type);
4722 if (type != Q3FACETYPE_FLAT
4723 && type != Q3FACETYPE_PATCH
4724 && type != Q3FACETYPE_MESH
4725 && type != Q3FACETYPE_FLARE)
4727 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4731 n = LittleLong(in->textureindex);
4732 if (n < 0 || n >= loadmodel->num_textures)
4734 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4737 out->texture = loadmodel->data_textures + n;
4738 n = LittleLong(in->effectindex);
4739 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4741 if (developer.integer >= 100)
4742 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4748 out->effect = loadmodel->brushq3.data_effects + n;
4750 if (cls.state != ca_dedicated)
4752 out->lightmaptexture = NULL;
4753 out->deluxemaptexture = r_texture_blanknormalmap;
4754 n = LittleLong(in->lightmapindex);
4757 else if (n >= loadmodel->brushq3.num_originallightmaps)
4759 if(loadmodel->brushq3.num_originallightmaps != 0)
4760 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4765 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4766 if (loadmodel->brushq3.deluxemapping)
4767 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4771 firstvertex = LittleLong(in->firstvertex);
4772 numvertices = LittleLong(in->numvertices);
4773 firstelement = LittleLong(in->firstelement);
4774 numtriangles = LittleLong(in->numelements) / 3;
4775 if (numtriangles * 3 != LittleLong(in->numelements))
4777 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));
4780 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4782 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);
4785 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4787 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);
4792 case Q3FACETYPE_FLAT:
4793 case Q3FACETYPE_MESH:
4794 // no processing necessary
4796 case Q3FACETYPE_PATCH:
4797 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4798 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4799 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))
4801 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4804 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4806 // convert patch to Q3FACETYPE_MESH
4807 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4808 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4809 // bound to user settings
4810 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4811 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4812 // bound to sanity settings
4813 xtess = bound(0, xtess, 1024);
4814 ytess = bound(0, ytess, 1024);
4816 // lower quality collision patches! Same procedure as before, but different cvars
4817 // convert patch to Q3FACETYPE_MESH
4818 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4819 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4820 // bound to user settings
4821 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
4822 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
4823 // bound to sanity settings
4824 cxtess = bound(0, cxtess, 1024);
4825 cytess = bound(0, cytess, 1024);
4827 // store it for the LOD grouping step
4828 patchtess[patchtesscount].info.xsize = patchsize[0];
4829 patchtess[patchtesscount].info.ysize = patchsize[1];
4830 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
4831 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
4832 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
4833 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
4835 patchtess[patchtesscount].surface_id = i;
4836 patchtess[patchtesscount].lodgroup[0] = in->specific.patch.mins[0];
4837 patchtess[patchtesscount].lodgroup[1] = in->specific.patch.mins[1];
4838 patchtess[patchtesscount].lodgroup[2] = in->specific.patch.mins[2];
4839 patchtess[patchtesscount].lodgroup[3] = in->specific.patch.maxs[0];
4840 patchtess[patchtesscount].lodgroup[4] = in->specific.patch.maxs[1];
4841 patchtess[patchtesscount].lodgroup[5] = in->specific.patch.maxs[2];
4842 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
4845 case Q3FACETYPE_FLARE:
4846 if (developer.integer >= 100)
4847 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4851 out->num_vertices = numvertices;
4852 out->num_triangles = numtriangles;
4853 meshvertices += out->num_vertices;
4854 meshtriangles += out->num_triangles;
4857 // Fix patches tesselations so that they make no seams
4861 for(i = 0; i < patchtesscount; ++i)
4863 for(j = i+1; j < patchtesscount; ++j)
4865 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
4868 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
4875 // Calculate resulting number of triangles
4876 for(i = 0; i < patchtesscount; ++i)
4878 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
4879 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
4880 numvertices = finalwidth * finalheight;
4881 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4883 oldout[patchtess[i].surface_id].num_vertices = numvertices;
4884 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
4885 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
4886 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
4892 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4895 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
4897 if (out->num_vertices < 3 || out->num_triangles < 1)
4900 type = LittleLong(in->type);
4901 firstvertex = LittleLong(in->firstvertex);
4902 firstelement = LittleLong(in->firstelement);
4903 out->num_firstvertex = meshvertices;
4904 out->num_firsttriangle = meshtriangles;
4907 case Q3FACETYPE_FLAT:
4908 case Q3FACETYPE_MESH:
4909 // no processing necessary, except for lightmap merging
4910 for (j = 0;j < out->num_vertices;j++)
4912 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
4913 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
4914 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
4915 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
4916 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
4917 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
4918 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
4919 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
4920 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
4921 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
4922 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
4923 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
4924 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
4925 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
4927 for (j = 0;j < out->num_triangles*3;j++)
4928 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
4930 case Q3FACETYPE_PATCH:
4931 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4932 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4933 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4934 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
4935 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
4936 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
4937 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
4939 xtess = ytess = cxtess = cytess = -1;
4940 for(j = 0; j < patchtesscount; ++j)
4941 if(patchtess[j].surface_id == i)
4943 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
4944 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
4945 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
4946 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
4951 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
4952 xtess = ytess = cxtess = cytess = 0;
4955 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
4956 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
4957 finalvertices = finalwidth * finalheight;
4958 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4959 type = Q3FACETYPE_MESH;
4960 // generate geometry
4961 // (note: normals are skipped because they get recalculated)
4962 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
4963 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
4964 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
4965 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
4966 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
4967 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
4969 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);
4971 if (developer.integer >= 100)
4973 if (out->num_triangles < finaltriangles)
4974 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);
4976 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);
4978 // q3map does not put in collision brushes for curves... ugh
4979 // build the lower quality collision geometry
4980 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
4981 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
4982 finalvertices = finalwidth * finalheight;
4983 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4985 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
4986 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
4987 out->num_collisionvertices = finalvertices;
4988 out->num_collisiontriangles = finaltriangles;
4989 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
4990 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
4992 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
4993 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
4995 oldnumtriangles = out->num_triangles;
4996 oldnumtriangles2 = out->num_collisiontriangles;
4997 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
4998 if (developer.integer >= 100)
4999 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);
5004 meshvertices += out->num_vertices;
5005 meshtriangles += out->num_triangles;
5006 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5007 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)
5009 if (invalidelements)
5011 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);
5012 for (j = 0;j < out->num_triangles * 3;j++)
5014 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5015 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)
5016 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5020 // calculate a bounding box
5021 VectorClear(out->mins);
5022 VectorClear(out->maxs);
5023 if (out->num_vertices)
5025 if (cls.state != ca_dedicated && out->lightmaptexture)
5027 // figure out which part of the merged lightmap this fits into
5028 int lightmapindex = LittleLong(in->lightmapindex) >> loadmodel->brushq3.deluxemapping;
5029 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5030 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5031 lightmapindex &= mergewidth * mergeheight - 1;
5032 lightmaptcscale[0] = 1.0f / mergewidth;
5033 lightmaptcscale[1] = 1.0f / mergeheight;
5034 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5035 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5036 // modify the lightmap texcoords to match this region of the merged lightmap
5037 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5039 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5040 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5043 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5044 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5045 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5047 out->mins[0] = min(out->mins[0], v[0]);
5048 out->maxs[0] = max(out->maxs[0], v[0]);
5049 out->mins[1] = min(out->mins[1], v[1]);
5050 out->maxs[1] = max(out->maxs[1], v[1]);
5051 out->mins[2] = min(out->mins[2], v[2]);
5052 out->maxs[2] = max(out->maxs[2], v[2]);
5054 out->mins[0] -= 1.0f;
5055 out->mins[1] -= 1.0f;
5056 out->mins[2] -= 1.0f;
5057 out->maxs[0] += 1.0f;
5058 out->maxs[1] += 1.0f;
5059 out->maxs[2] += 1.0f;
5061 // set lightmap styles for consistency with q1bsp
5062 //out->lightmapinfo->styles[0] = 0;
5063 //out->lightmapinfo->styles[1] = 255;
5064 //out->lightmapinfo->styles[2] = 255;
5065 //out->lightmapinfo->styles[3] = 255;
5070 for (;i < count;i++, out++)
5072 if(out->num_vertices && out->num_triangles)
5074 if(out->num_vertices == 0)
5075 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no vertices, ignoring\n", i);
5076 if(out->num_triangles == 0)
5077 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no triangles, ignoring\n", i);
5080 // for per pixel lighting
5081 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);
5083 // generate ushort elements array if possible
5084 if (loadmodel->surfmesh.data_element3s)
5085 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5086 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5088 // free the no longer needed vertex data
5089 loadmodel->brushq3.num_vertices = 0;
5090 if (loadmodel->brushq3.data_vertex3f)
5091 Mem_Free(loadmodel->brushq3.data_vertex3f);
5092 loadmodel->brushq3.data_vertex3f = NULL;
5093 loadmodel->brushq3.data_normal3f = NULL;
5094 loadmodel->brushq3.data_texcoordtexture2f = NULL;
5095 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5096 loadmodel->brushq3.data_color4f = NULL;
5097 // free the no longer needed triangle data
5098 loadmodel->brushq3.num_triangles = 0;
5099 if (loadmodel->brushq3.data_element3i)
5100 Mem_Free(loadmodel->brushq3.data_element3i);
5101 loadmodel->brushq3.data_element3i = NULL;
5104 Mem_Free(patchtess);
5107 static void Mod_Q3BSP_LoadModels(lump_t *l)
5111 int i, j, n, c, count;
5113 in = (q3dmodel_t *)(mod_base + l->fileofs);
5114 if (l->filelen % sizeof(*in))
5115 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5116 count = l->filelen / sizeof(*in);
5117 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5119 loadmodel->brushq3.data_models = out;
5120 loadmodel->brushq3.num_models = count;
5122 for (i = 0;i < count;i++, in++, out++)
5124 for (j = 0;j < 3;j++)
5126 out->mins[j] = LittleFloat(in->mins[j]);
5127 out->maxs[j] = LittleFloat(in->maxs[j]);
5129 n = LittleLong(in->firstface);
5130 c = LittleLong(in->numfaces);
5131 if (n < 0 || n + c > loadmodel->num_surfaces)
5132 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5135 n = LittleLong(in->firstbrush);
5136 c = LittleLong(in->numbrushes);
5137 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5138 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5139 out->firstbrush = n;
5140 out->numbrushes = c;
5144 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5150 in = (int *)(mod_base + l->fileofs);
5151 if (l->filelen % sizeof(*in))
5152 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5153 count = l->filelen / sizeof(*in);
5154 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5156 loadmodel->brush.data_leafbrushes = out;
5157 loadmodel->brush.num_leafbrushes = count;
5159 for (i = 0;i < count;i++, in++, out++)
5161 n = LittleLong(*in);
5162 if (n < 0 || n >= loadmodel->brush.num_brushes)
5163 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5168 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5174 in = (int *)(mod_base + l->fileofs);
5175 if (l->filelen % sizeof(*in))
5176 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5177 count = l->filelen / sizeof(*in);
5178 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5180 loadmodel->brush.data_leafsurfaces = out;
5181 loadmodel->brush.num_leafsurfaces = count;
5183 for (i = 0;i < count;i++, in++, out++)
5185 n = LittleLong(*in);
5186 if (n < 0 || n >= loadmodel->num_surfaces)
5187 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5192 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5196 int i, j, n, c, count;
5198 in = (q3dleaf_t *)(mod_base + l->fileofs);
5199 if (l->filelen % sizeof(*in))
5200 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5201 count = l->filelen / sizeof(*in);
5202 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5204 loadmodel->brush.data_leafs = out;
5205 loadmodel->brush.num_leafs = count;
5207 for (i = 0;i < count;i++, in++, out++)
5211 out->clusterindex = LittleLong(in->clusterindex);
5212 out->areaindex = LittleLong(in->areaindex);
5213 for (j = 0;j < 3;j++)
5215 // yes the mins/maxs are ints
5216 out->mins[j] = LittleLong(in->mins[j]) - 1;
5217 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5219 n = LittleLong(in->firstleafface);
5220 c = LittleLong(in->numleaffaces);
5221 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5222 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5223 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5224 out->numleafsurfaces = c;
5225 n = LittleLong(in->firstleafbrush);
5226 c = LittleLong(in->numleafbrushes);
5227 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5228 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5229 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5230 out->numleafbrushes = c;
5234 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5240 in = (q3dnode_t *)(mod_base + l->fileofs);
5241 if (l->filelen % sizeof(*in))
5242 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5243 count = l->filelen / sizeof(*in);
5244 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5246 loadmodel->brush.data_nodes = out;
5247 loadmodel->brush.num_nodes = count;
5249 for (i = 0;i < count;i++, in++, out++)
5252 n = LittleLong(in->planeindex);
5253 if (n < 0 || n >= loadmodel->brush.num_planes)
5254 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5255 out->plane = loadmodel->brush.data_planes + n;
5256 for (j = 0;j < 2;j++)
5258 n = LittleLong(in->childrenindex[j]);
5261 if (n >= loadmodel->brush.num_nodes)
5262 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5263 out->children[j] = loadmodel->brush.data_nodes + n;
5268 if (n >= loadmodel->brush.num_leafs)
5269 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5270 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5273 for (j = 0;j < 3;j++)
5275 // yes the mins/maxs are ints
5276 out->mins[j] = LittleLong(in->mins[j]) - 1;
5277 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5281 // set the parent pointers
5282 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5285 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5288 q3dlightgrid_t *out;
5291 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5292 if (l->filelen % sizeof(*in))
5293 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5294 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5295 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5296 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5297 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5298 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5299 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5300 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5301 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5302 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5303 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5304 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5305 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5306 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5307 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]);
5308 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]);
5310 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5313 if (l->filelen < count * (int)sizeof(*in))
5314 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_isize[0], loadmodel->brushq3.num_lightgrid_isize[1], loadmodel->brushq3.num_lightgrid_isize[2]);
5315 if (l->filelen != count * (int)sizeof(*in))
5316 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5317 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5318 loadmodel->brushq3.data_lightgrid = out;
5319 loadmodel->brushq3.num_lightgrid = count;
5320 // no swapping or validation necessary
5321 memcpy(out, in, count * (int)sizeof(*out));
5325 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5330 if (l->filelen == 0)
5333 // unvised maps often have cluster indices even without pvs, so check
5334 // leafs to find real number of clusters
5335 loadmodel->brush.num_pvsclusters = 1;
5336 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5337 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5340 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5341 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5342 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5343 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5347 in = (q3dpvs_t *)(mod_base + l->fileofs);
5349 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5351 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5352 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5353 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5354 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5355 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5356 if (l->filelen < totalchains + (int)sizeof(*in))
5357 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);
5359 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5360 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5363 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5365 int i, j, k, index[3];
5366 float transformed[3], blend1, blend2, blend, stylescale;
5367 q3dlightgrid_t *a, *s;
5369 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5370 stylescale = r_refdef.scene.rtlightstylevalue[0];
5372 if (!model->brushq3.num_lightgrid)
5374 ambientcolor[0] = stylescale;
5375 ambientcolor[1] = stylescale;
5376 ambientcolor[2] = stylescale;
5380 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5381 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5382 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5383 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5384 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5385 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5386 index[0] = (int)floor(transformed[0]);
5387 index[1] = (int)floor(transformed[1]);
5388 index[2] = (int)floor(transformed[2]);
5389 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5391 // now lerp the values
5392 VectorClear(diffusenormal);
5393 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5394 for (k = 0;k < 2;k++)
5396 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5397 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5399 for (j = 0;j < 2;j++)
5401 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5402 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5404 for (i = 0;i < 2;i++)
5406 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5407 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5409 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5410 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5411 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5412 // this uses the mod_md3_sin table because the values are
5413 // already in the 0-255 range, the 64+ bias fetches a cosine
5414 // instead of a sine value
5415 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5416 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5417 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5418 //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)));
5423 // normalize the light direction before turning
5424 VectorNormalize(diffusenormal);
5425 //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]);
5428 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
5433 // find which leaf the point is in
5435 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5436 // point trace the brushes
5437 leaf = (mleaf_t *)node;
5438 for (i = 0;i < leaf->numleafbrushes;i++)
5440 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5441 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5443 brush->markframe = markframe;
5444 Collision_TracePointBrushFloat(trace, point, brush);
5447 // can't do point traces on curves (they have no thickness)
5450 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)
5452 int i, startside, endside;
5453 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5455 msurface_t *surface;
5458 // walk the tree until we hit a leaf, recursing for any split cases
5461 // abort if this part of the bsp tree can not be hit by this trace
5462 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5464 plane = node->plane;
5465 // axial planes are much more common than non-axial, so an optimized
5466 // axial case pays off here
5467 if (plane->type < 3)
5469 dist1 = start[plane->type] - plane->dist;
5470 dist2 = end[plane->type] - plane->dist;
5474 dist1 = DotProduct(start, plane->normal) - plane->dist;
5475 dist2 = DotProduct(end, plane->normal) - plane->dist;
5477 startside = dist1 < 0;
5478 endside = dist2 < 0;
5479 if (startside == endside)
5481 // most of the time the line fragment is on one side of the plane
5482 node = node->children[startside];
5486 // line crosses node plane, split the line
5487 dist1 = PlaneDiff(linestart, plane);
5488 dist2 = PlaneDiff(lineend, plane);
5489 midfrac = dist1 / (dist1 - dist2);
5490 VectorLerp(linestart, midfrac, lineend, mid);
5491 // take the near side first
5492 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5493 // if we found an impact on the front side, don't waste time
5494 // exploring the far side
5495 if (midfrac <= trace->realfraction)
5496 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5500 // abort if this part of the bsp tree can not be hit by this trace
5501 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5504 nodesegmentmins[0] = min(start[0], end[0]) - 1;
5505 nodesegmentmins[1] = min(start[1], end[1]) - 1;
5506 nodesegmentmins[2] = min(start[2], end[2]) - 1;
5507 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5508 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5509 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5510 // line trace the brushes
5511 leaf = (mleaf_t *)node;
5512 for (i = 0;i < leaf->numleafbrushes;i++)
5514 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5515 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5517 brush->markframe = markframe;
5518 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5521 // can't do point traces on curves (they have no thickness)
5522 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5524 // line trace the curves
5525 for (i = 0;i < leaf->numleafsurfaces;i++)
5527 surface = model->data_surfaces + leaf->firstleafsurface[i];
5528 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5530 surface->collisionmarkframe = markframe;
5531 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5537 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)
5543 msurface_t *surface;
5545 float nodesegmentmins[3], nodesegmentmaxs[3];
5546 // walk the tree until we hit a leaf, recursing for any split cases
5549 // abort if this part of the bsp tree can not be hit by this trace
5550 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5552 plane = node->plane;
5553 // axial planes are much more common than non-axial, so an optimized
5554 // axial case pays off here
5555 if (plane->type < 3)
5557 // this is an axial plane, compare bounding box directly to it and
5558 // recurse sides accordingly
5559 // recurse down node sides
5560 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5561 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5562 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5563 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5567 // this is a non-axial plane, so check if the start and end boxes
5568 // are both on one side of the plane to handle 'diagonal' cases
5569 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5573 // segment crosses plane
5574 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5577 // if sides == 0 then the trace itself is bogus (Not A Number values),
5578 // in this case we simply pretend the trace hit nothing
5580 return; // ERROR: NAN bounding box!
5581 // take whichever side the segment box is on
5582 node = node->children[sides - 1];
5584 // abort if this part of the bsp tree can not be hit by this trace
5585 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5587 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5588 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5589 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5590 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5591 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5592 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5594 leaf = (mleaf_t *)node;
5595 for (i = 0;i < leaf->numleafbrushes;i++)
5597 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5598 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5600 brush->markframe = markframe;
5601 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5604 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5606 for (i = 0;i < leaf->numleafsurfaces;i++)
5608 surface = model->data_surfaces + leaf->firstleafsurface[i];
5609 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5611 surface->collisionmarkframe = markframe;
5612 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);
5618 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)
5621 float segmentmins[3], segmentmaxs[3];
5622 static int markframe = 0;
5623 msurface_t *surface;
5625 memset(trace, 0, sizeof(*trace));
5626 trace->fraction = 1;
5627 trace->realfraction = 1;
5628 trace->hitsupercontentsmask = hitsupercontentsmask;
5629 if (mod_q3bsp_optimizedtraceline.integer && VectorLength2(boxmins) + VectorLength2(boxmaxs) == 0)
5631 if (VectorCompare(start, end))
5634 if (model->brush.submodel)
5636 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5637 if (brush->colbrushf)
5638 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5641 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5646 segmentmins[0] = min(start[0], end[0]) - 1;
5647 segmentmins[1] = min(start[1], end[1]) - 1;
5648 segmentmins[2] = min(start[2], end[2]) - 1;
5649 segmentmaxs[0] = max(start[0], end[0]) + 1;
5650 segmentmaxs[1] = max(start[1], end[1]) + 1;
5651 segmentmaxs[2] = max(start[2], end[2]) + 1;
5652 if (model->brush.submodel)
5654 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5655 if (brush->colbrushf)
5656 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5657 if (mod_q3bsp_curves_collisions.integer)
5658 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5659 if (surface->num_collisiontriangles)
5660 Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5663 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5668 // box trace, performed as brush trace
5669 colbrushf_t *thisbrush_start, *thisbrush_end;
5670 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5671 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5672 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5673 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5674 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5675 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5676 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5677 VectorAdd(start, boxmins, boxstartmins);
5678 VectorAdd(start, boxmaxs, boxstartmaxs);
5679 VectorAdd(end, boxmins, boxendmins);
5680 VectorAdd(end, boxmaxs, boxendmaxs);
5681 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5682 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5683 if (model->brush.submodel)
5685 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5686 if (brush->colbrushf)
5687 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5688 if (mod_q3bsp_curves_collisions.integer)
5689 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5690 if (surface->num_collisiontriangles)
5691 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);
5694 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5698 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5701 int supercontents = 0;
5703 // test if the point is inside each brush
5704 if (model->brush.submodel)
5706 // submodels are effectively one leaf
5707 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5708 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5709 supercontents |= brush->colbrushf->supercontents;
5713 mnode_t *node = model->brush.data_nodes;
5715 // find which leaf the point is in
5717 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5718 leaf = (mleaf_t *)node;
5719 // now check the brushes in the leaf
5720 for (i = 0;i < leaf->numleafbrushes;i++)
5722 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5723 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5724 supercontents |= brush->colbrushf->supercontents;
5727 return supercontents;
5730 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
5732 int supercontents = 0;
5733 if (nativecontents & CONTENTSQ3_SOLID)
5734 supercontents |= SUPERCONTENTS_SOLID;
5735 if (nativecontents & CONTENTSQ3_WATER)
5736 supercontents |= SUPERCONTENTS_WATER;
5737 if (nativecontents & CONTENTSQ3_SLIME)
5738 supercontents |= SUPERCONTENTS_SLIME;
5739 if (nativecontents & CONTENTSQ3_LAVA)
5740 supercontents |= SUPERCONTENTS_LAVA;
5741 if (nativecontents & CONTENTSQ3_BODY)
5742 supercontents |= SUPERCONTENTS_BODY;
5743 if (nativecontents & CONTENTSQ3_CORPSE)
5744 supercontents |= SUPERCONTENTS_CORPSE;
5745 if (nativecontents & CONTENTSQ3_NODROP)
5746 supercontents |= SUPERCONTENTS_NODROP;
5747 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5748 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5749 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5750 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5751 if (nativecontents & CONTENTSQ3_DONOTENTER)
5752 supercontents |= SUPERCONTENTS_DONOTENTER;
5753 if (nativecontents & CONTENTSQ3_BOTCLIP)
5754 supercontents |= SUPERCONTENTS_BOTCLIP;
5755 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
5756 supercontents |= SUPERCONTENTS_OPAQUE;
5757 return supercontents;
5760 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
5762 int nativecontents = 0;
5763 if (supercontents & SUPERCONTENTS_SOLID)
5764 nativecontents |= CONTENTSQ3_SOLID;
5765 if (supercontents & SUPERCONTENTS_WATER)
5766 nativecontents |= CONTENTSQ3_WATER;
5767 if (supercontents & SUPERCONTENTS_SLIME)
5768 nativecontents |= CONTENTSQ3_SLIME;
5769 if (supercontents & SUPERCONTENTS_LAVA)
5770 nativecontents |= CONTENTSQ3_LAVA;
5771 if (supercontents & SUPERCONTENTS_BODY)
5772 nativecontents |= CONTENTSQ3_BODY;
5773 if (supercontents & SUPERCONTENTS_CORPSE)
5774 nativecontents |= CONTENTSQ3_CORPSE;
5775 if (supercontents & SUPERCONTENTS_NODROP)
5776 nativecontents |= CONTENTSQ3_NODROP;
5777 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5778 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5779 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5780 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5781 if (supercontents & SUPERCONTENTS_DONOTENTER)
5782 nativecontents |= CONTENTSQ3_DONOTENTER;
5783 if (supercontents & SUPERCONTENTS_BOTCLIP)
5784 nativecontents |= CONTENTSQ3_BOTCLIP;
5785 if (!(supercontents & SUPERCONTENTS_OPAQUE))
5786 nativecontents |= CONTENTSQ3_TRANSLUCENT;
5787 return nativecontents;
5790 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5795 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5796 node = node->children[1];
5798 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5799 if (loadmodel->brush.num_leafs < numleafs)
5800 loadmodel->brush.num_leafs = numleafs;
5803 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
5805 int i, j, numshadowmeshtriangles, lumps;
5806 q3dheader_t *header;
5807 float corner[3], yawradius, modelradius;
5808 msurface_t *surface;
5810 mod->modeldatatypestring = "Q3BSP";
5812 mod->type = mod_brushq3;
5813 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5816 header = (q3dheader_t *)buffer;
5817 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
5818 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
5820 i = LittleLong(header->version);
5821 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
5822 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5824 mod->soundfromcenter = true;
5825 mod->TraceBox = Mod_Q3BSP_TraceBox;
5826 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
5827 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
5828 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5829 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5830 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5831 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5832 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5833 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5834 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5835 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
5836 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5837 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5838 mod->brush.AmbientSoundLevelsForPoint = NULL;
5839 mod->brush.RoundUpToHullSize = NULL;
5840 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5841 mod->Draw = R_Q1BSP_Draw;
5842 mod->DrawDepth = R_Q1BSP_DrawDepth;
5843 mod->DrawDebug = R_Q1BSP_DrawDebug;
5844 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5845 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5846 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5847 mod->DrawLight = R_Q1BSP_DrawLight;
5849 mod_base = (unsigned char *)header;
5851 // swap all the lumps
5852 header->ident = LittleLong(header->ident);
5853 header->version = LittleLong(header->version);
5854 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
5855 for (i = 0;i < lumps;i++)
5857 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
5858 if((char *) bufferend < (char *) buffer + j)
5859 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
5860 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
5861 if((char *) bufferend < (char *) buffer + j)
5862 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
5865 * NO, do NOT clear them!
5866 * they contain actual data referenced by other stuff.
5867 * Instead, before using the advertisements lump, check header->versio
5869 * Sorry, but otherwise it breaks memory of the first lump.
5870 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
5872 header->lumps[i].fileofs = 0;
5873 header->lumps[i].filelen = 0;
5877 mod->brush.qw_md4sum = 0;
5878 mod->brush.qw_md4sum2 = 0;
5879 for (i = 0;i < lumps;i++)
5881 if (i == Q3LUMP_ENTITIES)
5883 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5884 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
5886 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5888 // all this checksumming can take a while, so let's send keepalives here too
5889 CL_KeepaliveMessage(false);
5892 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5893 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
5894 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
5895 if (header->version == Q3BSPVERSION_IG)
5896 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
5898 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
5899 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
5900 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
5901 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
5902 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
5903 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
5904 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
5905 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
5906 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
5907 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
5908 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
5909 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
5910 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
5911 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
5912 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
5914 // the MakePortals code works fine on the q3bsp data as well
5915 Mod_Q1BSP_MakePortals();
5917 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
5918 loadmodel->brush.supportwateralpha = true;
5920 // make a single combined shadow mesh to allow optimized shadow volume creation
5921 numshadowmeshtriangles = 0;
5922 if (cls.state != ca_dedicated)
5924 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5926 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
5927 numshadowmeshtriangles += surface->num_triangles;
5929 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
5930 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
5931 if (surface->num_triangles > 0)
5932 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));
5933 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
5934 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
5937 loadmodel->brush.num_leafs = 0;
5938 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
5941 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
5946 // duplicate the basic information
5947 dpsnprintf(name, sizeof(name), "*%i", i);
5948 mod = Mod_FindName(name, loadmodel->name);
5949 // copy the base model to this one
5951 // rename the clone back to its proper name
5952 strlcpy(mod->name, name, sizeof(mod->name));
5953 mod->brush.parentmodel = loadmodel;
5954 // textures and memory belong to the main model
5955 mod->texturepool = NULL;
5956 mod->mempool = NULL;
5957 mod->brush.TraceLineOfSight = NULL;
5958 mod->brush.GetPVS = NULL;
5959 mod->brush.FatPVS = NULL;
5960 mod->brush.BoxTouchingPVS = NULL;
5961 mod->brush.BoxTouchingLeafPVS = NULL;
5962 mod->brush.BoxTouchingVisibleLeafs = NULL;
5963 mod->brush.FindBoxClusters = NULL;
5964 mod->brush.LightPoint = NULL;
5965 mod->brush.AmbientSoundLevelsForPoint = NULL;
5967 mod->brush.submodel = i;
5969 // make the model surface list (used by shadowing/lighting)
5970 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
5971 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
5972 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
5973 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
5974 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
5975 Mod_MakeSortedSurfaces(mod);
5977 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
5978 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
5979 // enlarge the bounding box to enclose all geometry of this model,
5980 // because q3map2 sometimes lies (mostly to affect the lightgrid),
5981 // which can in turn mess up the farclip (as well as culling when
5982 // outside the level - an unimportant concern)
5984 //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]);
5985 for (j = 0;j < mod->nummodelsurfaces;j++)
5987 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
5988 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
5990 if (!surface->num_vertices)
5992 for (k = 0;k < surface->num_vertices;k++, v += 3)
5994 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
5995 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
5996 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
5997 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
5998 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
5999 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
6002 //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]);
6003 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
6004 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
6005 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
6006 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
6007 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
6008 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
6009 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
6010 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
6011 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
6012 mod->yawmins[2] = mod->normalmins[2];
6013 mod->yawmaxs[2] = mod->normalmaxs[2];
6014 mod->radius = modelradius;
6015 mod->radius2 = modelradius * modelradius;
6017 // this gets altered below if sky or water is used
6018 mod->DrawSky = NULL;
6019 mod->DrawAddWaterPlanes = NULL;
6021 for (j = 0;j < mod->nummodelsurfaces;j++)
6022 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
6024 if (j < mod->nummodelsurfaces)
6025 mod->DrawSky = R_Q1BSP_DrawSky;
6027 for (j = 0;j < mod->nummodelsurfaces;j++)
6028 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
6030 if (j < mod->nummodelsurfaces)
6031 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
6035 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6037 int i = LittleLong(((int *)buffer)[1]);
6038 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
6039 Mod_Q3BSP_Load(mod,buffer, bufferend);
6040 else if (i == Q2BSPVERSION)
6041 Mod_Q2BSP_Load(mod,buffer, bufferend);
6043 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
6046 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6048 Host_Error("Mod_MAP_Load: not yet implemented");
6051 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
6053 // we already have done PVS culling at this point...
6054 // so we don't need to do it again.
6057 vec3_t testorigin, mins, maxs;
6059 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
6060 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
6061 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
6063 if(model->brush.TraceLineOfSight(model, eye, testorigin))
6066 // expand the box a little
6067 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
6068 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
6069 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
6070 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
6071 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
6072 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
6074 for(i = 0; i != numsamples; ++i)
6076 testorigin[0] = lhrandom(mins[0], maxs[0]);
6077 testorigin[1] = lhrandom(mins[1], maxs[1]);
6078 testorigin[2] = lhrandom(mins[2], maxs[2]);
6080 if(model->brush.TraceLineOfSight(model, eye, testorigin))