2 Copyright (C) 1996-1997 Id Software, Inc.
4 This program is free software; you can redistribute it and/or
5 modify it under the terms of the GNU General Public License
6 as published by the Free Software Foundation; either version 2
7 of the License, or (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
13 See the GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128", "how large water polygons should be (smaller values produce more polygons which give better warping effects)"};
30 cvar_t halflifebsp = {0, "halflifebsp", "0", "indicates the current map is hlbsp format (useful to know because of different bounding box sizes)"};
31 cvar_t r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
32 cvar_t r_picmipworld = {CVAR_SAVE, "r_picmipworld", "1", "whether gl_picmip shall apply to world textures too"};
33 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0", "pretends there was no texture lump found in the q1bsp/hlbsp loading (useful for debugging this rare case)"};
34 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4", "maximum error tolerance on curve subdivision for rendering purposes (in other words, the curves will be given as many polygons as necessary to represent curves at this quality)"};
35 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "1", "minimum number of subdivisions (values above 1 will smooth curves that don't need it)"};
36 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
37 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
38 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15", "maximum error tolerance on curve subdivision for collision purposes (usually a larger error tolerance than for rendering)"};
39 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "1", "minimum number of subdivisions (values above 1 will smooth curves that don't need it)"};
40 cvar_t r_subdivisions_collision_maxtess = {0, "r_subdivisions_collision_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
41 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
42 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
43 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
44 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
45 cvar_t mod_q3bsp_lightmapmergepower = {CVAR_SAVE, "mod_q3bsp_lightmapmergepower", "4", "merges the quake3 128x128 lightmap textures into larger lightmap group textures to speed up rendering, 1 = 256x256, 2 = 512x512, 3 = 1024x1024, 4 = 2048x2048, 5 = 4096x4096, ..."};
46 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)"};
48 static texture_t mod_q1bsp_texture_solid;
49 static texture_t mod_q1bsp_texture_sky;
50 static texture_t mod_q1bsp_texture_lava;
51 static texture_t mod_q1bsp_texture_slime;
52 static texture_t mod_q1bsp_texture_water;
54 void Mod_BrushInit(void)
56 // Cvar_RegisterVariable(&r_subdivide_size);
57 Cvar_RegisterVariable(&halflifebsp);
58 Cvar_RegisterVariable(&r_novis);
59 Cvar_RegisterVariable(&r_picmipworld);
60 Cvar_RegisterVariable(&r_nosurftextures);
61 Cvar_RegisterVariable(&r_subdivisions_tolerance);
62 Cvar_RegisterVariable(&r_subdivisions_mintess);
63 Cvar_RegisterVariable(&r_subdivisions_maxtess);
64 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
65 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
66 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
67 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
68 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
69 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
70 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
71 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
72 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
73 Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
75 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
76 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
77 mod_q1bsp_texture_solid.surfaceflags = 0;
78 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
80 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
81 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
82 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
83 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
85 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
86 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
87 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
88 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
90 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
91 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
92 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
93 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
95 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
96 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
97 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
98 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
101 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
108 // LordHavoc: modified to start at first clip node,
109 // in other words: first node of the (sub)model
110 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
112 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
114 return (mleaf_t *)node;
117 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
121 leaf = Mod_Q1BSP_PointInLeaf(model, p);
124 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
127 memcpy(out, leaf->ambient_sound_level, i);
133 memset(out, 0, outsize);
136 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
139 int nodestackindex = 0;
140 mnode_t *node, *nodestack[1024];
141 if (!model->brush.num_pvsclusters)
143 node = model->brush.data_nodes;
149 // node - recurse down the BSP tree
150 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
154 return -1; // ERROR: NAN bounding box!
155 // box is on one side of plane, take that path
156 node = node->children[sides-1];
160 // box crosses plane, take one path and remember the other
161 if (nodestackindex < 1024)
162 nodestack[nodestackindex++] = node->children[0];
163 node = node->children[1];
169 // leaf - add clusterindex to list
170 if (numclusters < maxclusters)
171 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
175 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
179 if (nodestackindex < 1024)
180 nodestack[nodestackindex++] = node->children[0];
181 node = node->children[1];
186 // leaf - add clusterindex to list
187 if (numclusters < maxclusters)
188 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
193 // try another path we didn't take earlier
194 if (nodestackindex == 0)
196 node = nodestack[--nodestackindex];
198 // return number of clusters found (even if more than the maxclusters)
202 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
204 int nodestackindex = 0;
205 mnode_t *node, *nodestack[1024];
206 if (!model->brush.num_pvsclusters)
208 node = model->brush.data_nodes;
214 // node - recurse down the BSP tree
215 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
219 return -1; // ERROR: NAN bounding box!
220 // box is on one side of plane, take that path
221 node = node->children[sides-1];
225 // box crosses plane, take one path and remember the other
226 if (nodestackindex < 1024)
227 nodestack[nodestackindex++] = node->children[0];
228 node = node->children[1];
234 // leaf - check cluster bit
235 int clusterindex = ((mleaf_t *)node)->clusterindex;
236 if (CHECKPVSBIT(pvs, clusterindex))
238 // it is visible, return immediately with the news
243 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
247 if (nodestackindex < 1024)
248 nodestack[nodestackindex++] = node->children[0];
249 node = node->children[1];
254 // leaf - check cluster bit
255 int clusterindex = ((mleaf_t *)node)->clusterindex;
256 if (CHECKPVSBIT(pvs, clusterindex))
258 // it is visible, return immediately with the news
264 // nothing to see here, try another path we didn't take earlier
265 if (nodestackindex == 0)
267 node = nodestack[--nodestackindex];
273 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
275 int nodestackindex = 0;
276 mnode_t *node, *nodestack[1024];
277 if (!model->brush.num_leafs)
279 node = model->brush.data_nodes;
285 // node - recurse down the BSP tree
286 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
290 return -1; // ERROR: NAN bounding box!
291 // box is on one side of plane, take that path
292 node = node->children[sides-1];
296 // box crosses plane, take one path and remember the other
297 if (nodestackindex < 1024)
298 nodestack[nodestackindex++] = node->children[0];
299 node = node->children[1];
305 // leaf - check cluster bit
306 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
307 if (CHECKPVSBIT(pvs, clusterindex))
309 // it is visible, return immediately with the news
314 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
318 if (nodestackindex < 1024)
319 nodestack[nodestackindex++] = node->children[0];
320 node = node->children[1];
325 // leaf - check cluster bit
326 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
327 if (CHECKPVSBIT(pvs, clusterindex))
329 // it is visible, return immediately with the news
335 // nothing to see here, try another path we didn't take earlier
336 if (nodestackindex == 0)
338 node = nodestack[--nodestackindex];
344 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
346 int nodestackindex = 0;
347 mnode_t *node, *nodestack[1024];
348 if (!model->brush.num_leafs)
350 node = model->brush.data_nodes;
356 // node - recurse down the BSP tree
357 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
361 return -1; // ERROR: NAN bounding box!
362 // box is on one side of plane, take that path
363 node = node->children[sides-1];
367 // box crosses plane, take one path and remember the other
368 if (nodestackindex < 1024)
369 nodestack[nodestackindex++] = node->children[0];
370 node = node->children[1];
376 // leaf - check if it is visible
377 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
379 // it is visible, return immediately with the news
384 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
388 if (nodestackindex < 1024)
389 nodestack[nodestackindex++] = node->children[0];
390 node = node->children[1];
395 // leaf - check if it is visible
396 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
398 // it is visible, return immediately with the news
404 // nothing to see here, try another path we didn't take earlier
405 if (nodestackindex == 0)
407 node = nodestack[--nodestackindex];
413 typedef struct findnonsolidlocationinfo_s
421 findnonsolidlocationinfo_t;
423 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
425 int i, surfacenum, k, *tri, *mark;
426 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
428 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
430 surface = info->model->data_surfaces + *mark;
431 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
433 for (k = 0;k < surface->num_triangles;k++)
435 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
436 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
437 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
438 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
439 VectorSubtract(vert[1], vert[0], edge[0]);
440 VectorSubtract(vert[2], vert[1], edge[1]);
441 CrossProduct(edge[1], edge[0], facenormal);
442 if (facenormal[0] || facenormal[1] || facenormal[2])
444 VectorNormalize(facenormal);
445 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
446 if (f <= info->bestdist && f >= -info->bestdist)
448 VectorSubtract(vert[0], vert[2], edge[2]);
449 VectorNormalize(edge[0]);
450 VectorNormalize(edge[1]);
451 VectorNormalize(edge[2]);
452 CrossProduct(facenormal, edge[0], edgenormal[0]);
453 CrossProduct(facenormal, edge[1], edgenormal[1]);
454 CrossProduct(facenormal, edge[2], edgenormal[2]);
456 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
457 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
458 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
460 // we got lucky, the center is within the face
461 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
465 if (info->bestdist > dist)
467 info->bestdist = dist;
468 VectorScale(facenormal, (info->radius - -dist), info->nudge);
473 if (info->bestdist > dist)
475 info->bestdist = dist;
476 VectorScale(facenormal, (info->radius - dist), info->nudge);
482 // check which edge or vertex the center is nearest
483 for (i = 0;i < 3;i++)
485 f = DotProduct(info->center, edge[i]);
486 if (f >= DotProduct(vert[0], edge[i])
487 && f <= DotProduct(vert[1], edge[i]))
490 VectorMA(info->center, -f, edge[i], point);
491 dist = sqrt(DotProduct(point, point));
492 if (info->bestdist > dist)
494 info->bestdist = dist;
495 VectorScale(point, (info->radius / dist), info->nudge);
497 // skip both vertex checks
498 // (both are further away than this edge)
503 // not on edge, check first vertex of edge
504 VectorSubtract(info->center, vert[i], point);
505 dist = sqrt(DotProduct(point, point));
506 if (info->bestdist > dist)
508 info->bestdist = dist;
509 VectorScale(point, (info->radius / dist), info->nudge);
521 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
525 float f = PlaneDiff(info->center, node->plane);
526 if (f >= -info->bestdist)
527 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
528 if (f <= info->bestdist)
529 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
533 if (((mleaf_t *)node)->numleafsurfaces)
534 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
538 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
541 findnonsolidlocationinfo_t info;
547 VectorCopy(in, info.center);
548 info.radius = radius;
553 VectorClear(info.nudge);
554 info.bestdist = radius;
555 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
556 VectorAdd(info.center, info.nudge, info.center);
558 while (info.bestdist < radius && ++i < 10);
559 VectorCopy(info.center, out);
562 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
564 switch(nativecontents)
569 return SUPERCONTENTS_SOLID;
571 return SUPERCONTENTS_WATER;
573 return SUPERCONTENTS_SLIME;
575 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
577 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
582 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
584 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
585 return CONTENTS_SOLID;
586 if (supercontents & SUPERCONTENTS_SKY)
588 if (supercontents & SUPERCONTENTS_LAVA)
589 return CONTENTS_LAVA;
590 if (supercontents & SUPERCONTENTS_SLIME)
591 return CONTENTS_SLIME;
592 if (supercontents & SUPERCONTENTS_WATER)
593 return CONTENTS_WATER;
594 return CONTENTS_EMPTY;
597 typedef struct RecursiveHullCheckTraceInfo_s
599 // the hull we're tracing through
602 // the trace structure to fill in
605 // start, end, and end - start (in model space)
610 RecursiveHullCheckTraceInfo_t;
612 // 1/32 epsilon to keep floating point happy
613 #define DIST_EPSILON (0.03125)
615 #define HULLCHECKSTATE_EMPTY 0
616 #define HULLCHECKSTATE_SOLID 1
617 #define HULLCHECKSTATE_DONE 2
619 extern cvar_t collision_prefernudgedfraction;
620 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
622 // status variables, these don't need to be saved on the stack when
623 // recursing... but are because this should be thread-safe
624 // (note: tracing against a bbox is not thread-safe, yet)
629 // variables that need to be stored on the stack when recursing
634 // LordHavoc: a goto! everyone flee in terror... :)
639 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
640 if (!t->trace->startfound)
642 t->trace->startfound = true;
643 t->trace->startsupercontents |= num;
645 if (num & SUPERCONTENTS_LIQUIDSMASK)
646 t->trace->inwater = true;
648 t->trace->inopen = true;
649 if (num & SUPERCONTENTS_SOLID)
650 t->trace->hittexture = &mod_q1bsp_texture_solid;
651 else if (num & SUPERCONTENTS_SKY)
652 t->trace->hittexture = &mod_q1bsp_texture_sky;
653 else if (num & SUPERCONTENTS_LAVA)
654 t->trace->hittexture = &mod_q1bsp_texture_lava;
655 else if (num & SUPERCONTENTS_SLIME)
656 t->trace->hittexture = &mod_q1bsp_texture_slime;
658 t->trace->hittexture = &mod_q1bsp_texture_water;
659 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
660 t->trace->hitsupercontents = num;
661 if (num & t->trace->hitsupercontentsmask)
663 // if the first leaf is solid, set startsolid
664 if (t->trace->allsolid)
665 t->trace->startsolid = true;
666 #if COLLISIONPARANOID >= 3
669 return HULLCHECKSTATE_SOLID;
673 t->trace->allsolid = false;
674 #if COLLISIONPARANOID >= 3
677 return HULLCHECKSTATE_EMPTY;
681 // find the point distances
682 node = t->hull->clipnodes + num;
684 plane = t->hull->planes + node->planenum;
687 t1 = p1[plane->type] - plane->dist;
688 t2 = p2[plane->type] - plane->dist;
692 t1 = DotProduct (plane->normal, p1) - plane->dist;
693 t2 = DotProduct (plane->normal, p2) - plane->dist;
700 #if COLLISIONPARANOID >= 3
703 num = node->children[1];
712 #if COLLISIONPARANOID >= 3
715 num = node->children[0];
721 // the line intersects, find intersection point
722 // LordHavoc: this uses the original trace for maximum accuracy
723 #if COLLISIONPARANOID >= 3
728 t1 = t->start[plane->type] - plane->dist;
729 t2 = t->end[plane->type] - plane->dist;
733 t1 = DotProduct (plane->normal, t->start) - plane->dist;
734 t2 = DotProduct (plane->normal, t->end) - plane->dist;
737 midf = t1 / (t1 - t2);
738 midf = bound(p1f, midf, p2f);
739 VectorMA(t->start, midf, t->dist, mid);
741 // recurse both sides, front side first
742 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
743 // if this side is not empty, return what it is (solid or done)
744 if (ret != HULLCHECKSTATE_EMPTY)
747 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
748 // if other side is not solid, return what it is (empty or done)
749 if (ret != HULLCHECKSTATE_SOLID)
752 // front is air and back is solid, this is the impact point...
755 t->trace->plane.dist = -plane->dist;
756 VectorNegate (plane->normal, t->trace->plane.normal);
760 t->trace->plane.dist = plane->dist;
761 VectorCopy (plane->normal, t->trace->plane.normal);
764 // calculate the true fraction
765 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
766 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
767 midf = t1 / (t1 - t2);
768 t->trace->realfraction = bound(0, midf, 1);
770 // calculate the return fraction which is nudged off the surface a bit
771 midf = (t1 - DIST_EPSILON) / (t1 - t2);
772 t->trace->fraction = bound(0, midf, 1);
774 if (collision_prefernudgedfraction.integer)
775 t->trace->realfraction = t->trace->fraction;
777 #if COLLISIONPARANOID >= 3
780 return HULLCHECKSTATE_DONE;
783 //#if COLLISIONPARANOID < 2
784 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
787 mclipnode_t *nodes = t->hull->clipnodes;
788 mplane_t *planes = t->hull->planes;
790 VectorCopy(t->start, point);
793 plane = planes + nodes[num].planenum;
794 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
796 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
797 t->trace->startsupercontents |= num;
798 if (num & SUPERCONTENTS_LIQUIDSMASK)
799 t->trace->inwater = true;
801 t->trace->inopen = true;
802 if (num & t->trace->hitsupercontentsmask)
804 t->trace->allsolid = t->trace->startsolid = true;
805 return HULLCHECKSTATE_SOLID;
809 t->trace->allsolid = t->trace->startsolid = false;
810 return HULLCHECKSTATE_EMPTY;
815 static void Mod_Q1BSP_TraceBox(struct model_s *model, int frame, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
817 // this function currently only supports same size start and end
819 RecursiveHullCheckTraceInfo_t rhc;
821 memset(&rhc, 0, sizeof(rhc));
822 memset(trace, 0, sizeof(trace_t));
824 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
825 rhc.trace->fraction = 1;
826 rhc.trace->realfraction = 1;
827 rhc.trace->allsolid = true;
828 VectorSubtract(boxmaxs, boxmins, boxsize);
830 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
831 else if (model->brush.ishlbsp)
833 // LordHavoc: this has to have a minor tolerance (the .1) because of
834 // minor float precision errors from the box being transformed around
835 if (boxsize[0] < 32.1)
837 if (boxsize[2] < 54) // pick the nearest of 36 or 72
838 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
840 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
843 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
847 // LordHavoc: this has to have a minor tolerance (the .1) because of
848 // minor float precision errors from the box being transformed around
849 if (boxsize[0] < 32.1)
850 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
852 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
854 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
855 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
856 VectorSubtract(rhc.end, rhc.start, rhc.dist);
857 #if COLLISIONPARANOID >= 2
858 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]);
859 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
864 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
865 memset(&testtrace, 0, sizeof(trace_t));
866 rhc.trace = &testtrace;
867 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
868 rhc.trace->fraction = 1;
869 rhc.trace->realfraction = 1;
870 rhc.trace->allsolid = true;
871 VectorCopy(test, rhc.start);
872 VectorCopy(test, rhc.end);
873 VectorClear(rhc.dist);
874 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
875 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
876 if (!trace->startsolid && testtrace.startsolid)
877 Con_Printf(" - ended in solid!\n");
881 if (VectorLength2(rhc.dist))
882 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
884 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
888 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
890 int num = model->brushq1.hulls[0].firstclipnode;
892 mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
893 mplane_t *planes = model->brushq1.hulls[0].planes;
896 plane = planes + nodes[num].planenum;
897 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
899 return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
902 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)
906 colplanef_t cbox_planes[6];
907 cbox.supercontents = boxsupercontents;
910 cbox.numtriangles = 0;
911 cbox.planes = cbox_planes;
913 cbox.elements = NULL;
921 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];
922 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];
923 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];
924 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];
925 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];
926 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];
927 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
928 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
929 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
930 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
931 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
932 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
933 memset(trace, 0, sizeof(trace_t));
934 trace->hitsupercontentsmask = hitsupercontentsmask;
936 trace->realfraction = 1;
937 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
939 RecursiveHullCheckTraceInfo_t rhc;
940 static hull_t box_hull;
941 static mclipnode_t box_clipnodes[6];
942 static mplane_t box_planes[6];
943 // fill in a default trace
944 memset(&rhc, 0, sizeof(rhc));
945 memset(trace, 0, sizeof(trace_t));
946 //To keep everything totally uniform, bounding boxes are turned into small
947 //BSP trees instead of being compared directly.
948 // create a temp hull from bounding box sizes
949 box_planes[0].dist = cmaxs[0] - mins[0];
950 box_planes[1].dist = cmins[0] - maxs[0];
951 box_planes[2].dist = cmaxs[1] - mins[1];
952 box_planes[3].dist = cmins[1] - maxs[1];
953 box_planes[4].dist = cmaxs[2] - mins[2];
954 box_planes[5].dist = cmins[2] - maxs[2];
955 #if COLLISIONPARANOID >= 3
956 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]);
959 if (box_hull.clipnodes == NULL)
963 //Set up the planes and clipnodes so that the six floats of a bounding box
964 //can just be stored out and get a proper hull_t structure.
966 box_hull.clipnodes = box_clipnodes;
967 box_hull.planes = box_planes;
968 box_hull.firstclipnode = 0;
969 box_hull.lastclipnode = 5;
971 for (i = 0;i < 6;i++)
973 box_clipnodes[i].planenum = i;
977 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
979 box_clipnodes[i].children[side^1] = i + 1;
981 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
983 box_planes[i].type = i>>1;
984 box_planes[i].normal[i>>1] = 1;
988 // trace a line through the generated clipping hull
989 //rhc.boxsupercontents = boxsupercontents;
990 rhc.hull = &box_hull;
992 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
993 rhc.trace->fraction = 1;
994 rhc.trace->realfraction = 1;
995 rhc.trace->allsolid = true;
996 VectorCopy(start, rhc.start);
997 VectorCopy(end, rhc.end);
998 VectorSubtract(rhc.end, rhc.start, rhc.dist);
999 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1000 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1001 if (rhc.trace->startsupercontents)
1002 rhc.trace->startsupercontents = boxsupercontents;
1006 static int Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
1009 double midf, mid[3];
1015 // find the point distances
1016 mplane_t *plane = node->plane;
1017 if (plane->type < 3)
1019 t1 = p1[plane->type] - plane->dist;
1020 t2 = p2[plane->type] - plane->dist;
1024 t1 = DotProduct (plane->normal, p1) - plane->dist;
1025 t2 = DotProduct (plane->normal, p2) - plane->dist;
1032 node = node->children[1];
1041 node = node->children[0];
1047 midf = t1 / (t1 - t2);
1048 VectorLerp(p1, midf, p2, mid);
1050 // recurse both sides, front side first
1051 // return 2 if empty is followed by solid (hit something)
1052 // do not return 2 if both are solid or both empty,
1053 // or if start is solid and end is empty
1054 // as these degenerate cases usually indicate the eye is in solid and
1055 // should see the target point anyway
1056 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
1059 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
1064 return ((mleaf_t *)node)->clusterindex < 0;
1067 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1069 // this function currently only supports same size start and end
1070 double tracestart[3], traceend[3];
1071 VectorCopy(start, tracestart);
1072 VectorCopy(end, traceend);
1073 return Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend) != 2;
1076 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)
1080 float mid, distz = endz - startz;
1084 return false; // didn't hit anything
1086 switch (node->plane->type)
1089 node = node->children[x < node->plane->dist];
1092 node = node->children[y < node->plane->dist];
1095 side = startz < node->plane->dist;
1096 if ((endz < node->plane->dist) == side)
1098 node = node->children[side];
1101 // found an intersection
1102 mid = node->plane->dist;
1105 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1106 front += startz * node->plane->normal[2];
1107 back += endz * node->plane->normal[2];
1108 side = front < node->plane->dist;
1109 if ((back < node->plane->dist) == side)
1111 node = node->children[side];
1114 // found an intersection
1115 mid = startz + distz * (front - node->plane->dist) / (front - back);
1119 // go down front side
1120 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1121 return true; // hit something
1124 // check for impact on this node
1125 if (node->numsurfaces)
1127 int i, dsi, dti, lmwidth, lmheight;
1129 msurface_t *surface;
1130 unsigned char *lightmap;
1131 int maps, line3, size3;
1134 float scale, w, w00, w01, w10, w11;
1136 surface = model->data_surfaces + node->firstsurface;
1137 for (i = 0;i < node->numsurfaces;i++, surface++)
1139 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1140 continue; // no lightmaps
1142 // location we want to sample in the lightmap
1143 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;
1144 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;
1149 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1150 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1153 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1155 // calculate bilinear interpolation factors
1156 // and also multiply by fixedpoint conversion factors
1159 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1160 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1161 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1162 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1164 // values for pointer math
1165 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1166 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1168 // look up the pixel
1169 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1171 // bilinear filter each lightmap style, and sum them
1172 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1174 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1175 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1176 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1177 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1178 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1182 return true; // success
1187 // go down back side
1188 node = node->children[side ^ 1];
1190 distz = endz - startz;
1195 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1197 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1198 VectorSet(diffusenormal, 0, 0, 1);
1200 if (!model->brushq1.lightdata)
1202 VectorSet(ambientcolor, 1, 1, 1);
1203 VectorSet(diffusecolor, 0, 0, 0);
1207 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);
1210 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1213 unsigned char *outstart = out;
1214 while (out < outend)
1218 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));
1228 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));
1231 for (c = *in++;c > 0;c--)
1235 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));
1246 R_Q1BSP_LoadSplitSky
1248 A sky texture is 256*128, with the right side being a masked overlay
1251 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1254 unsigned solidpixels[128*128], alphapixels[128*128];
1256 // allocate a texture pool if we need it
1257 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1258 loadmodel->texturepool = R_AllocTexturePool();
1260 if (bytesperpixel == 4)
1262 for (i = 0;i < 128;i++)
1264 for (j = 0;j < 128;j++)
1266 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1267 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1273 // make an average value for the back to avoid
1274 // a fringe on the top level
1283 for (i = 0;i < 128;i++)
1285 for (j = 0;j < 128;j++)
1287 p = src[i*256 + j + 128];
1288 r += palette_rgb[p][0];
1289 g += palette_rgb[p][1];
1290 b += palette_rgb[p][2];
1293 bgra.b[2] = r/(128*128);
1294 bgra.b[1] = g/(128*128);
1295 bgra.b[0] = b/(128*128);
1297 for (i = 0;i < 128;i++)
1299 for (j = 0;j < 128;j++)
1301 solidpixels[(i*128) + j] = palette_bgra_complete[src[i*256 + j + 128]];
1303 alphapixels[(i*128) + j] = p ? palette_bgra_complete[p] : bgra.i;
1308 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1309 loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1312 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1314 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1315 skinframe_t *skinframe;
1317 texture_t *tx, *tx2, *anims[10], *altanims[10];
1319 unsigned char *data, *mtdata;
1321 char mapname[MAX_QPATH], name[MAX_QPATH];
1322 unsigned char zero[4];
1324 memset(zero, 0, sizeof(zero));
1326 loadmodel->data_textures = NULL;
1328 // add two slots for notexture walls and notexture liquids
1331 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1332 m->nummiptex = LittleLong (m->nummiptex);
1333 loadmodel->num_textures = m->nummiptex + 2;
1334 loadmodel->num_texturesperskin = loadmodel->num_textures;
1339 loadmodel->num_textures = 2;
1340 loadmodel->num_texturesperskin = loadmodel->num_textures;
1343 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1345 // fill out all slots with notexture
1346 if (cls.state != ca_dedicated)
1347 skinframe = R_SkinFrame_LoadMissing();
1350 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1352 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1355 if (cls.state != ca_dedicated)
1357 tx->numskinframes = 1;
1358 tx->skinframerate = 1;
1359 tx->skinframes[0] = skinframe;
1360 tx->currentskinframe = tx->skinframes[0];
1361 tx->basematerialflags = 0;
1363 tx->basematerialflags = MATERIALFLAG_WALL;
1364 if (i == loadmodel->num_textures - 1)
1366 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1367 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1368 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1372 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1373 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1375 tx->currentframe = tx;
1377 // clear water settings
1380 tx->refractfactor = 1;
1381 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1382 tx->reflectfactor = 1;
1383 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1384 tx->r_water_wateralpha = 1;
1389 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1393 s = loadmodel->name;
1394 if (!strncasecmp(s, "maps/", 5))
1396 FS_StripExtension(s, mapname, sizeof(mapname));
1398 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1400 // LordHavoc: mostly rewritten map texture loader
1401 for (i = 0;i < m->nummiptex;i++)
1403 dofs[i] = LittleLong(dofs[i]);
1404 if (r_nosurftextures.integer)
1408 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1411 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1413 // copy name, but only up to 16 characters
1414 // (the output buffer can hold more than this, but the input buffer is
1416 for (j = 0;j < 16 && dmiptex->name[j];j++)
1417 name[j] = dmiptex->name[j];
1422 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1423 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1426 mtwidth = LittleLong(dmiptex->width);
1427 mtheight = LittleLong(dmiptex->height);
1429 j = LittleLong(dmiptex->offsets[0]);
1433 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1435 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1438 mtdata = (unsigned char *)dmiptex + j;
1441 if ((mtwidth & 15) || (mtheight & 15))
1442 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1444 // LordHavoc: force all names to lowercase
1445 for (j = 0;name[j];j++)
1446 if (name[j] >= 'A' && name[j] <= 'Z')
1447 name[j] += 'a' - 'A';
1449 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1452 tx = loadmodel->data_textures + i;
1453 strlcpy(tx->name, name, sizeof(tx->name));
1454 tx->width = mtwidth;
1455 tx->height = mtheight;
1457 if (tx->name[0] == '*')
1459 if (!strncmp(tx->name, "*lava", 5))
1461 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1462 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1464 else if (!strncmp(tx->name, "*slime", 6))
1466 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1467 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1471 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1472 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1475 else if (!strncmp(tx->name, "sky", 3))
1477 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1478 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1482 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1483 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1486 if (cls.state != ca_dedicated)
1488 // LordHavoc: HL sky textures are entirely different than quake
1489 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1491 if (loadmodel->isworldmodel)
1493 data = loadimagepixelsbgra(tx->name, false, false);
1494 if (data && image_width == 256 && image_height == 128)
1496 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1499 else if (mtdata != NULL)
1500 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1505 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);
1507 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);
1510 // did not find external texture, load it from the bsp or wad3
1511 if (loadmodel->brush.ishlbsp)
1513 // internal texture overrides wad
1514 unsigned char *pixels, *freepixels;
1515 pixels = freepixels = NULL;
1517 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1519 pixels = freepixels = W_GetTextureBGRA(tx->name);
1522 tx->width = image_width;
1523 tx->height = image_height;
1524 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1527 Mem_Free(freepixels);
1529 else if (mtdata) // texture included
1530 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);
1532 // if skinframe is still NULL the "missing" texture will be used
1534 tx->skinframes[0] = skinframe;
1537 tx->basematerialflags = MATERIALFLAG_WALL;
1538 if (tx->name[0] == '*')
1540 // LordHavoc: some turbulent textures should not be affected by wateralpha
1541 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1543 // replace the texture with transparent black
1544 Vector4Set(zero, 128, 128, 128, 128);
1545 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1546 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1548 else if (!strncmp(tx->name,"*lava",5)
1549 || !strncmp(tx->name,"*teleport",9)
1550 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1551 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1553 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1554 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1555 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1557 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1559 // replace the texture with black
1560 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1561 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1563 else if (!strncmp(tx->name, "sky", 3))
1564 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1565 else if (!strcmp(tx->name, "caulk"))
1566 tx->basematerialflags = MATERIALFLAG_NODRAW;
1567 else if (tx->skinframes[0] && tx->skinframes[0]->fog)
1568 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1570 // start out with no animation
1571 tx->currentframe = tx;
1572 tx->currentskinframe = tx->skinframes[0];
1576 // sequence the animations
1577 for (i = 0;i < m->nummiptex;i++)
1579 tx = loadmodel->data_textures + i;
1580 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1582 if (tx->anim_total[0] || tx->anim_total[1])
1583 continue; // already sequenced
1585 // find the number of frames in the animation
1586 memset(anims, 0, sizeof(anims));
1587 memset(altanims, 0, sizeof(altanims));
1589 for (j = i;j < m->nummiptex;j++)
1591 tx2 = loadmodel->data_textures + j;
1592 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1596 if (num >= '0' && num <= '9')
1597 anims[num - '0'] = tx2;
1598 else if (num >= 'a' && num <= 'j')
1599 altanims[num - 'a'] = tx2;
1601 Con_Printf("Bad animating texture %s\n", tx->name);
1605 for (j = 0;j < 10;j++)
1612 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1615 for (j = 0;j < max;j++)
1619 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1623 for (j = 0;j < altmax;j++)
1627 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1636 // if there is no alternate animation, duplicate the primary
1637 // animation into the alternate
1639 for (k = 0;k < 10;k++)
1640 altanims[k] = anims[k];
1643 // link together the primary animation
1644 for (j = 0;j < max;j++)
1647 tx2->animated = true;
1648 tx2->anim_total[0] = max;
1649 tx2->anim_total[1] = altmax;
1650 for (k = 0;k < 10;k++)
1652 tx2->anim_frames[0][k] = anims[k];
1653 tx2->anim_frames[1][k] = altanims[k];
1657 // if there really is an alternate anim...
1658 if (anims[0] != altanims[0])
1660 // link together the alternate animation
1661 for (j = 0;j < altmax;j++)
1664 tx2->animated = true;
1665 // the primary/alternate are reversed here
1666 tx2->anim_total[0] = altmax;
1667 tx2->anim_total[1] = max;
1668 for (k = 0;k < 10;k++)
1670 tx2->anim_frames[0][k] = altanims[k];
1671 tx2->anim_frames[1][k] = anims[k];
1678 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1681 unsigned char *in, *out, *data, d;
1682 char litfilename[MAX_QPATH];
1683 char dlitfilename[MAX_QPATH];
1684 fs_offset_t filesize;
1685 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1687 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1688 for (i=0; i<l->filelen; i++)
1689 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1691 else // LordHavoc: bsp version 29 (normal white lighting)
1693 // LordHavoc: hope is not lost yet, check for a .lit file to load
1694 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1695 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1696 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1697 strlcat (litfilename, ".lit", sizeof (litfilename));
1698 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1699 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1702 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1704 i = LittleLong(((int *)data)[1]);
1707 if (developer_loading.integer)
1708 Con_Printf("loaded %s\n", litfilename);
1709 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1710 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1712 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1715 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1717 i = LittleLong(((int *)data)[1]);
1720 if (developer_loading.integer)
1721 Con_Printf("loaded %s\n", dlitfilename);
1722 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1723 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1724 loadmodel->brushq3.deluxemapping_modelspace = false;
1725 loadmodel->brushq3.deluxemapping = true;
1734 Con_Printf("Unknown .lit file version (%d)\n", i);
1736 else if (filesize == 8)
1737 Con_Print("Empty .lit file, ignoring\n");
1739 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1746 // LordHavoc: oh well, expand the white lighting data
1749 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1750 in = mod_base + l->fileofs;
1751 out = loadmodel->brushq1.lightdata;
1752 for (i = 0;i < l->filelen;i++)
1762 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1764 loadmodel->brushq1.num_compressedpvs = 0;
1765 loadmodel->brushq1.data_compressedpvs = NULL;
1768 loadmodel->brushq1.num_compressedpvs = l->filelen;
1769 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1770 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1773 // used only for HalfLife maps
1774 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1776 char key[128], value[4096];
1781 if (!COM_ParseToken_Simple(&data, false, false))
1783 if (com_token[0] != '{')
1787 if (!COM_ParseToken_Simple(&data, false, false))
1789 if (com_token[0] == '}')
1790 break; // end of worldspawn
1791 if (com_token[0] == '_')
1792 strlcpy(key, com_token + 1, sizeof(key));
1794 strlcpy(key, com_token, sizeof(key));
1795 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1796 key[strlen(key)-1] = 0;
1797 if (!COM_ParseToken_Simple(&data, false, false))
1799 dpsnprintf(value, sizeof(value), "%s", com_token);
1800 if (!strcmp("wad", key)) // for HalfLife maps
1802 if (loadmodel->brush.ishlbsp)
1805 for (i = 0;i < (int)sizeof(value);i++)
1806 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1810 for (;i < (int)sizeof(value);i++)
1812 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1813 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1815 else if (value[i] == ';' || value[i] == 0)
1819 strlcpy(wadname, "textures/", sizeof(wadname));
1820 strlcat(wadname, &value[j], sizeof(wadname));
1821 W_LoadTextureWadFile(wadname, false);
1833 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1835 loadmodel->brush.entities = NULL;
1838 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
1839 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1840 loadmodel->brush.entities[l->filelen] = 0;
1841 if (loadmodel->brush.ishlbsp)
1842 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1846 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1852 in = (dvertex_t *)(mod_base + l->fileofs);
1853 if (l->filelen % sizeof(*in))
1854 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1855 count = l->filelen / sizeof(*in);
1856 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1858 loadmodel->brushq1.vertexes = out;
1859 loadmodel->brushq1.numvertexes = count;
1861 for ( i=0 ; i<count ; i++, in++, out++)
1863 out->position[0] = LittleFloat(in->point[0]);
1864 out->position[1] = LittleFloat(in->point[1]);
1865 out->position[2] = LittleFloat(in->point[2]);
1869 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1870 // can be used for this
1872 int SB_ReadInt (unsigned char **buffer)
1875 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1881 float SB_ReadFloat (unsigned char **buffer)
1889 u.i = SB_ReadInt (buffer);
1893 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1895 unsigned char *index;
1899 index = (unsigned char *)(mod_base + l->fileofs);
1900 if (l->filelen % (48+4*hullinfo->filehulls))
1901 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1903 count = l->filelen / (48+4*hullinfo->filehulls);
1904 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1906 loadmodel->brushq1.submodels = out;
1907 loadmodel->brush.numsubmodels = count;
1909 for (i = 0; i < count; i++, out++)
1911 // spread out the mins / maxs by a pixel
1912 out->mins[0] = SB_ReadFloat (&index) - 1;
1913 out->mins[1] = SB_ReadFloat (&index) - 1;
1914 out->mins[2] = SB_ReadFloat (&index) - 1;
1915 out->maxs[0] = SB_ReadFloat (&index) + 1;
1916 out->maxs[1] = SB_ReadFloat (&index) + 1;
1917 out->maxs[2] = SB_ReadFloat (&index) + 1;
1918 out->origin[0] = SB_ReadFloat (&index);
1919 out->origin[1] = SB_ReadFloat (&index);
1920 out->origin[2] = SB_ReadFloat (&index);
1921 for (j = 0; j < hullinfo->filehulls; j++)
1922 out->headnode[j] = SB_ReadInt (&index);
1923 out->visleafs = SB_ReadInt (&index);
1924 out->firstface = SB_ReadInt (&index);
1925 out->numfaces = SB_ReadInt (&index);
1929 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1935 in = (dedge_t *)(mod_base + l->fileofs);
1936 if (l->filelen % sizeof(*in))
1937 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1938 count = l->filelen / sizeof(*in);
1939 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1941 loadmodel->brushq1.edges = out;
1942 loadmodel->brushq1.numedges = count;
1944 for ( i=0 ; i<count ; i++, in++, out++)
1946 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1947 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1948 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1950 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);
1957 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1961 int i, j, k, count, miptex;
1963 in = (texinfo_t *)(mod_base + l->fileofs);
1964 if (l->filelen % sizeof(*in))
1965 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
1966 count = l->filelen / sizeof(*in);
1967 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1969 loadmodel->brushq1.texinfo = out;
1970 loadmodel->brushq1.numtexinfo = count;
1972 for (i = 0;i < count;i++, in++, out++)
1974 for (k = 0;k < 2;k++)
1975 for (j = 0;j < 4;j++)
1976 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
1978 miptex = LittleLong(in->miptex);
1979 out->flags = LittleLong(in->flags);
1981 out->texture = NULL;
1982 if (loadmodel->data_textures)
1984 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
1985 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
1987 out->texture = loadmodel->data_textures + miptex;
1989 if (out->flags & TEX_SPECIAL)
1991 // if texture chosen is NULL or the shader needs a lightmap,
1992 // force to notexture water shader
1993 if (out->texture == NULL)
1994 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
1998 // if texture chosen is NULL, force to notexture
1999 if (out->texture == NULL)
2000 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2006 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2011 mins[0] = mins[1] = mins[2] = 9999;
2012 maxs[0] = maxs[1] = maxs[2] = -9999;
2014 for (i = 0;i < numverts;i++)
2016 for (j = 0;j < 3;j++, v++)
2026 #define MAX_SUBDIVPOLYTRIANGLES 4096
2027 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2029 static int subdivpolyverts, subdivpolytriangles;
2030 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2031 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2033 static int subdivpolylookupvert(vec3_t v)
2036 for (i = 0;i < subdivpolyverts;i++)
2037 if (subdivpolyvert[i][0] == v[0]
2038 && subdivpolyvert[i][1] == v[1]
2039 && subdivpolyvert[i][2] == v[2])
2041 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2042 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2043 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2044 return subdivpolyverts++;
2047 static void SubdividePolygon(int numverts, float *verts)
2049 int i, i1, i2, i3, f, b, c, p;
2050 vec3_t mins, maxs, front[256], back[256];
2051 float m, *pv, *cv, dist[256], frac;
2054 Host_Error("SubdividePolygon: ran out of verts in buffer");
2056 BoundPoly(numverts, verts, mins, maxs);
2058 for (i = 0;i < 3;i++)
2060 m = (mins[i] + maxs[i]) * 0.5;
2061 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2062 if (maxs[i] - m < 8)
2064 if (m - mins[i] < 8)
2068 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2069 dist[c] = cv[i] - m;
2072 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2076 VectorCopy(pv, front[f]);
2081 VectorCopy(pv, back[b]);
2084 if (dist[p] == 0 || dist[c] == 0)
2086 if ((dist[p] > 0) != (dist[c] > 0) )
2089 frac = dist[p] / (dist[p] - dist[c]);
2090 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2091 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2092 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2098 SubdividePolygon(f, front[0]);
2099 SubdividePolygon(b, back[0]);
2103 i1 = subdivpolylookupvert(verts);
2104 i2 = subdivpolylookupvert(verts + 3);
2105 for (i = 2;i < numverts;i++)
2107 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2109 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2113 i3 = subdivpolylookupvert(verts + i * 3);
2114 subdivpolyindex[subdivpolytriangles][0] = i1;
2115 subdivpolyindex[subdivpolytriangles][1] = i2;
2116 subdivpolyindex[subdivpolytriangles][2] = i3;
2118 subdivpolytriangles++;
2122 //Breaks a polygon up along axial 64 unit
2123 //boundaries so that turbulent and sky warps
2124 //can be done reasonably.
2125 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2131 subdivpolytriangles = 0;
2132 subdivpolyverts = 0;
2133 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2134 if (subdivpolytriangles < 1)
2135 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2137 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2138 mesh->num_vertices = subdivpolyverts;
2139 mesh->num_triangles = subdivpolytriangles;
2140 mesh->vertex = (surfvertex_t *)(mesh + 1);
2141 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2142 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2144 for (i = 0;i < mesh->num_triangles;i++)
2145 for (j = 0;j < 3;j++)
2146 mesh->index[i*3+j] = subdivpolyindex[i][j];
2148 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2150 VectorCopy(subdivpolyvert[i], v->v);
2151 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2152 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2157 /* Maximum size of a single LM */
2158 #define MAX_SINGLE_LM_SIZE 256
2166 struct alloc_lm_state
2169 struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2172 static void init_alloc_lm_state (struct alloc_lm_state* state)
2176 state->currentY = 0;
2177 for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2179 state->rows[r].currentX = 0;
2180 state->rows[r].rowY = -1;
2184 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2186 struct alloc_lm_row* row;
2189 row = &(state->rows[blockheight]);
2190 if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2192 if (state->currentY + blockheight <= totalheight)
2194 row->rowY = state->currentY;
2196 state->currentY += blockheight;
2200 /* See if we can stuff the block into a higher row */
2202 for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2204 if ((state->rows[r].rowY >= 0)
2205 && (state->rows[r].currentX + blockwidth <= totalwidth))
2207 row = &(state->rows[r]);
2211 if (row == NULL) return false;
2215 *outx = row->currentX;
2216 row->currentX += blockwidth;
2221 extern cvar_t gl_max_size;
2222 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2225 msurface_t *surface;
2226 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2227 float texmins[2], texmaxs[2], val;
2228 rtexture_t *lightmaptexture, *deluxemaptexture;
2230 in = (dface_t *)(mod_base + l->fileofs);
2231 if (l->filelen % sizeof(*in))
2232 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2233 count = l->filelen / sizeof(*in);
2234 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2235 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2237 loadmodel->num_surfaces = count;
2239 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2243 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2245 numedges = (unsigned short)LittleShort(in->numedges);
2246 totalverts += numedges;
2247 totaltris += numedges - 2;
2250 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2252 lightmaptexture = NULL;
2253 deluxemaptexture = r_texture_blanknormalmap;
2255 lightmapsize = max(256, gl_max_size.integer);
2256 totallightmapsamples = 0;
2260 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2262 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2264 // FIXME: validate edges, texinfo, etc?
2265 firstedge = LittleLong(in->firstedge);
2266 numedges = (unsigned short)LittleShort(in->numedges);
2267 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)
2268 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2269 i = (unsigned short)LittleShort(in->texinfo);
2270 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2271 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2272 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2273 surface->texture = surface->lightmapinfo->texinfo->texture;
2275 planenum = (unsigned short)LittleShort(in->planenum);
2276 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2277 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2279 //surface->flags = surface->texture->flags;
2280 //if (LittleShort(in->side))
2281 // surface->flags |= SURF_PLANEBACK;
2282 //surface->plane = loadmodel->brush.data_planes + planenum;
2284 surface->num_firstvertex = totalverts;
2285 surface->num_vertices = numedges;
2286 surface->num_firsttriangle = totaltris;
2287 surface->num_triangles = numedges - 2;
2288 totalverts += numedges;
2289 totaltris += numedges - 2;
2291 // convert edges back to a normal polygon
2292 for (i = 0;i < surface->num_vertices;i++)
2294 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2297 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2299 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2300 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2301 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2302 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2303 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2304 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2305 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2306 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2309 for (i = 0;i < surface->num_triangles;i++)
2311 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2312 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2313 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2316 // compile additional data about the surface geometry
2317 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);
2318 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);
2319 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2321 // generate surface extents information
2322 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2323 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2324 for (i = 1;i < surface->num_vertices;i++)
2326 for (j = 0;j < 2;j++)
2328 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2329 texmins[j] = min(texmins[j], val);
2330 texmaxs[j] = max(texmaxs[j], val);
2333 for (i = 0;i < 2;i++)
2335 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2336 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2339 smax = surface->lightmapinfo->extents[0] >> 4;
2340 tmax = surface->lightmapinfo->extents[1] >> 4;
2341 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2342 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2345 for (i = 0;i < MAXLIGHTMAPS;i++)
2346 surface->lightmapinfo->styles[i] = in->styles[i];
2347 surface->lightmaptexture = NULL;
2348 surface->deluxemaptexture = r_texture_blanknormalmap;
2349 i = LittleLong(in->lightofs);
2352 surface->lightmapinfo->samples = NULL;
2353 // give non-lightmapped water a 1x white lightmap
2354 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2356 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2357 surface->lightmapinfo->styles[0] = 0;
2358 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2361 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2362 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2363 else // LordHavoc: white lighting (bsp version 29)
2365 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2366 if (loadmodel->brushq1.nmaplightdata)
2367 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2370 // check if we should apply a lightmap to this
2371 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2373 if (ssize > 256 || tsize > 256)
2374 Host_Error("Bad surface extents");
2376 if (lightmapsize < ssize)
2377 lightmapsize = ssize;
2378 if (lightmapsize < tsize)
2379 lightmapsize = tsize;
2381 totallightmapsamples += ssize*tsize;
2383 // force lightmap upload on first time seeing the surface
2385 // additionally this is used by the later code to see if a
2386 // lightmap is needed on this surface (rather than duplicating the
2388 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2392 // small maps (such as ammo boxes especially) don't need big lightmap
2393 // textures, so this code tries to guess a good size based on
2394 // totallightmapsamples (size of the lightmaps lump basically), as well as
2395 // trying to max out the gl_max_size if there is a lot of lightmap data to
2397 // additionally, never choose a lightmapsize that is smaller than the
2398 // largest surface encountered (as it would fail)
2400 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2403 // now that we've decided the lightmap texture size, we can do the rest
2404 if (cls.state != ca_dedicated)
2406 struct alloc_lm_state allocState;
2408 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2410 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2411 float u, v, ubase, vbase, uscale, vscale;
2413 smax = surface->lightmapinfo->extents[0] >> 4;
2414 tmax = surface->lightmapinfo->extents[1] >> 4;
2415 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2416 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2418 if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2420 // allocate a texture pool if we need it
2421 if (loadmodel->texturepool == NULL)
2422 loadmodel->texturepool = R_AllocTexturePool();
2423 // could not find room, make a new lightmap
2424 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2425 if (loadmodel->brushq1.nmaplightdata)
2426 deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2428 init_alloc_lm_state (&allocState);
2429 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2431 surface->lightmaptexture = lightmaptexture;
2432 surface->deluxemaptexture = deluxemaptexture;
2433 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2434 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2436 uscale = 1.0f / (float)lightmapsize;
2437 vscale = 1.0f / (float)lightmapsize;
2438 ubase = lightmapx * uscale;
2439 vbase = lightmapy * vscale;
2441 for (i = 0;i < surface->num_vertices;i++)
2443 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);
2444 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);
2445 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2446 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2447 // LordHavoc: calc lightmap data offset for vertex lighting to use
2450 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2455 if (cl_stainmaps.integer)
2457 // allocate stainmaps for permanent marks on walls
2458 int stainmapsize = 0;
2459 unsigned char *stainsamples = NULL;
2460 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2462 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2463 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2464 stainmapsize += ssize * tsize * 3;
2466 // allocate and clear to white
2467 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2468 memset(stainsamples, 255, stainmapsize);
2470 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2472 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2473 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2474 surface->lightmapinfo->stainsamples = stainsamples;
2475 stainsamples += ssize * tsize * 3;
2480 // generate ushort elements array if possible
2481 if (loadmodel->surfmesh.data_element3s)
2482 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2483 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2486 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2489 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2490 node->parent = parent;
2493 // this is a node, recurse to children
2494 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2495 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2496 // combine supercontents of children
2497 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2502 mleaf_t *leaf = (mleaf_t *)node;
2503 // if this is a leaf, calculate supercontents mask from all collidable
2504 // primitives in the leaf (brushes and collision surfaces)
2505 // also flag if the leaf contains any collision surfaces
2506 leaf->combinedsupercontents = 0;
2507 // combine the supercontents values of all brushes in this leaf
2508 for (j = 0;j < leaf->numleafbrushes;j++)
2509 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2510 // check if this leaf contains any collision surfaces (q3 patches)
2511 for (j = 0;j < leaf->numleafsurfaces;j++)
2513 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2514 if (surface->num_collisiontriangles)
2516 leaf->containscollisionsurfaces = true;
2517 leaf->combinedsupercontents |= surface->texture->supercontents;
2523 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2529 in = (dnode_t *)(mod_base + l->fileofs);
2530 if (l->filelen % sizeof(*in))
2531 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2532 count = l->filelen / sizeof(*in);
2533 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2535 loadmodel->brush.data_nodes = out;
2536 loadmodel->brush.num_nodes = count;
2538 for ( i=0 ; i<count ; i++, in++, out++)
2540 for (j=0 ; j<3 ; j++)
2542 out->mins[j] = LittleShort(in->mins[j]);
2543 out->maxs[j] = LittleShort(in->maxs[j]);
2546 p = LittleLong(in->planenum);
2547 out->plane = loadmodel->brush.data_planes + p;
2549 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2550 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2552 for (j=0 ; j<2 ; j++)
2554 // LordHavoc: this code supports broken bsp files produced by
2555 // arguire qbsp which can produce more than 32768 nodes, any value
2556 // below count is assumed to be a node number, any other value is
2557 // assumed to be a leaf number
2558 p = (unsigned short)LittleShort(in->children[j]);
2561 if (p < loadmodel->brush.num_nodes)
2562 out->children[j] = loadmodel->brush.data_nodes + p;
2565 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2566 // map it to the solid leaf
2567 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2572 // note this uses 65535 intentionally, -1 is leaf 0
2574 if (p < loadmodel->brush.num_leafs)
2575 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2578 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2579 // map it to the solid leaf
2580 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2586 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2589 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2595 in = (dleaf_t *)(mod_base + l->fileofs);
2596 if (l->filelen % sizeof(*in))
2597 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2598 count = l->filelen / sizeof(*in);
2599 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2601 loadmodel->brush.data_leafs = out;
2602 loadmodel->brush.num_leafs = count;
2603 // get visleafs from the submodel data
2604 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2605 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2606 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2607 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2609 for ( i=0 ; i<count ; i++, in++, out++)
2611 for (j=0 ; j<3 ; j++)
2613 out->mins[j] = LittleShort(in->mins[j]);
2614 out->maxs[j] = LittleShort(in->maxs[j]);
2617 // FIXME: this function could really benefit from some error checking
2619 out->contents = LittleLong(in->contents);
2621 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2622 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2623 if (out->firstleafsurface < 0 || (unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2625 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);
2626 out->firstleafsurface = NULL;
2627 out->numleafsurfaces = 0;
2630 out->clusterindex = i - 1;
2631 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2632 out->clusterindex = -1;
2634 p = LittleLong(in->visofs);
2635 // ignore visofs errors on leaf 0 (solid)
2636 if (p >= 0 && out->clusterindex >= 0)
2638 if (p >= loadmodel->brushq1.num_compressedpvs)
2639 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2641 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);
2644 for (j = 0;j < 4;j++)
2645 out->ambient_sound_level[j] = in->ambient_level[j];
2647 // FIXME: Insert caustics here
2651 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2655 const unsigned char *pvs;
2656 // if there's no vis data, assume supported (because everything is visible all the time)
2657 if (!loadmodel->brush.data_pvsclusters)
2659 // check all liquid leafs to see if they can see into empty leafs, if any
2660 // can we can assume this map supports r_wateralpha
2661 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2663 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2665 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2666 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2667 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2674 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2681 in = (dclipnode_t *)(mod_base + l->fileofs);
2682 if (l->filelen % sizeof(*in))
2683 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2684 count = l->filelen / sizeof(*in);
2685 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2687 loadmodel->brushq1.clipnodes = out;
2688 loadmodel->brushq1.numclipnodes = count;
2690 for (i = 1; i < MAX_MAP_HULLS; i++)
2692 hull = &loadmodel->brushq1.hulls[i];
2693 hull->clipnodes = out;
2694 hull->firstclipnode = 0;
2695 hull->lastclipnode = count-1;
2696 hull->planes = loadmodel->brush.data_planes;
2697 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2698 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2699 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2700 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2701 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2702 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2703 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2706 for (i=0 ; i<count ; i++, out++, in++)
2708 out->planenum = LittleLong(in->planenum);
2709 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2710 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2711 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2712 if (out->children[0] >= count)
2713 out->children[0] -= 65536;
2714 if (out->children[1] >= count)
2715 out->children[1] -= 65536;
2716 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2717 Host_Error("Corrupt clipping hull(out of range planenum)");
2721 //Duplicate the drawing hull structure as a clipping hull
2722 static void Mod_Q1BSP_MakeHull0(void)
2729 hull = &loadmodel->brushq1.hulls[0];
2731 in = loadmodel->brush.data_nodes;
2732 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2734 hull->clipnodes = out;
2735 hull->firstclipnode = 0;
2736 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2737 hull->planes = loadmodel->brush.data_planes;
2739 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2741 out->planenum = in->plane - loadmodel->brush.data_planes;
2742 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2743 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2747 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2752 in = (short *)(mod_base + l->fileofs);
2753 if (l->filelen % sizeof(*in))
2754 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2755 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2756 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2758 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2760 j = (unsigned short) LittleShort(in[i]);
2761 if (j >= loadmodel->num_surfaces)
2762 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2763 loadmodel->brush.data_leafsurfaces[i] = j;
2767 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2772 in = (int *)(mod_base + l->fileofs);
2773 if (l->filelen % sizeof(*in))
2774 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2775 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2776 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2778 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2779 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2783 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2789 in = (dplane_t *)(mod_base + l->fileofs);
2790 if (l->filelen % sizeof(*in))
2791 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2793 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2794 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2796 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2798 out->normal[0] = LittleFloat(in->normal[0]);
2799 out->normal[1] = LittleFloat(in->normal[1]);
2800 out->normal[2] = LittleFloat(in->normal[2]);
2801 out->dist = LittleFloat(in->dist);
2807 static void Mod_Q1BSP_LoadMapBrushes(void)
2811 int submodel, numbrushes;
2812 qboolean firstbrush;
2813 char *text, *maptext;
2814 char mapfilename[MAX_QPATH];
2815 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2816 strlcat (mapfilename, ".map", sizeof (mapfilename));
2817 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2821 if (!COM_ParseToken_Simple(&data, false, false))
2826 if (!COM_ParseToken_Simple(&data, false, false))
2828 if (com_token[0] != '{')
2834 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2837 if (!COM_ParseToken_Simple(&data, false, false))
2839 if (com_token[0] == '}')
2840 break; // end of entity
2841 if (com_token[0] == '{')
2848 if (submodel > loadmodel->brush.numsubmodels)
2850 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2854 model = loadmodel->brush.submodels[submodel];
2861 if (!COM_ParseToken_Simple(&data, false, false))
2863 if (com_token[0] == '}')
2864 break; // end of brush
2865 // each brush face should be this format:
2866 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2867 // FIXME: support hl .map format
2868 for (pointnum = 0;pointnum < 3;pointnum++)
2870 COM_ParseToken_Simple(&data, false, false);
2871 for (componentnum = 0;componentnum < 3;componentnum++)
2873 COM_ParseToken_Simple(&data, false, false);
2874 point[pointnum][componentnum] = atof(com_token);
2876 COM_ParseToken_Simple(&data, false, false);
2878 COM_ParseToken_Simple(&data, false, false);
2879 strlcpy(facetexture, com_token, sizeof(facetexture));
2880 COM_ParseToken_Simple(&data, false, false);
2881 //scroll_s = atof(com_token);
2882 COM_ParseToken_Simple(&data, false, false);
2883 //scroll_t = atof(com_token);
2884 COM_ParseToken_Simple(&data, false, false);
2885 //rotate = atof(com_token);
2886 COM_ParseToken_Simple(&data, false, false);
2887 //scale_s = atof(com_token);
2888 COM_ParseToken_Simple(&data, false, false);
2889 //scale_t = atof(com_token);
2890 TriangleNormal(point[0], point[1], point[2], planenormal);
2891 VectorNormalizeDouble(planenormal);
2892 planedist = DotProduct(point[0], planenormal);
2893 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2903 #define MAX_PORTALPOINTS 64
2905 typedef struct portal_s
2908 mnode_t *nodes[2]; // [0] = front side of plane
2909 struct portal_s *next[2];
2911 double points[3*MAX_PORTALPOINTS];
2912 struct portal_s *chain; // all portals are linked into a list
2916 static portal_t *portalchain;
2923 static portal_t *AllocPortal(void)
2926 p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2927 p->chain = portalchain;
2932 static void FreePortal(portal_t *p)
2937 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2939 // process only nodes (leafs already had their box calculated)
2943 // calculate children first
2944 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2945 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2947 // make combined bounding box from children
2948 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2949 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2950 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2951 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2952 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2953 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2956 static void Mod_Q1BSP_FinalizePortals(void)
2958 int i, j, numportals, numpoints;
2959 portal_t *p, *pnext;
2962 mleaf_t *leaf, *endleaf;
2964 // tally up portal and point counts and recalculate bounding boxes for all
2965 // leafs (because qbsp is very sloppy)
2966 leaf = loadmodel->brush.data_leafs;
2967 endleaf = leaf + loadmodel->brush.num_leafs;
2968 for (;leaf < endleaf;leaf++)
2970 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2971 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2978 // note: this check must match the one below or it will usually corrupt memory
2979 // 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
2980 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2983 numpoints += p->numpoints * 2;
2987 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2988 loadmodel->brush.num_portals = numportals;
2989 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2990 loadmodel->brush.num_portalpoints = numpoints;
2991 // clear all leaf portal chains
2992 for (i = 0;i < loadmodel->brush.num_leafs;i++)
2993 loadmodel->brush.data_leafs[i].portals = NULL;
2994 // process all portals in the global portal chain, while freeing them
2995 portal = loadmodel->brush.data_portals;
2996 point = loadmodel->brush.data_portalpoints;
3003 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3005 // note: this check must match the one above or it will usually corrupt memory
3006 // 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
3007 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3009 // first make the back to front portal(forward portal)
3010 portal->points = point;
3011 portal->numpoints = p->numpoints;
3012 portal->plane.dist = p->plane.dist;
3013 VectorCopy(p->plane.normal, portal->plane.normal);
3014 portal->here = (mleaf_t *)p->nodes[1];
3015 portal->past = (mleaf_t *)p->nodes[0];
3017 for (j = 0;j < portal->numpoints;j++)
3019 VectorCopy(p->points + j*3, point->position);
3022 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3023 PlaneClassify(&portal->plane);
3025 // link into leaf's portal chain
3026 portal->next = portal->here->portals;
3027 portal->here->portals = portal;
3029 // advance to next portal
3032 // then make the front to back portal(backward portal)
3033 portal->points = point;
3034 portal->numpoints = p->numpoints;
3035 portal->plane.dist = -p->plane.dist;
3036 VectorNegate(p->plane.normal, portal->plane.normal);
3037 portal->here = (mleaf_t *)p->nodes[0];
3038 portal->past = (mleaf_t *)p->nodes[1];
3040 for (j = portal->numpoints - 1;j >= 0;j--)
3042 VectorCopy(p->points + j*3, point->position);
3045 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3046 PlaneClassify(&portal->plane);
3048 // link into leaf's portal chain
3049 portal->next = portal->here->portals;
3050 portal->here->portals = portal;
3052 // advance to next portal
3055 // add the portal's polygon points to the leaf bounding boxes
3056 for (i = 0;i < 2;i++)
3058 leaf = (mleaf_t *)p->nodes[i];
3059 for (j = 0;j < p->numpoints;j++)
3061 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3062 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3063 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3064 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3065 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3066 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3073 // now recalculate the node bounding boxes from the leafs
3074 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
3082 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3085 Host_Error("AddPortalToNodes: NULL front node");
3087 Host_Error("AddPortalToNodes: NULL back node");
3088 if (p->nodes[0] || p->nodes[1])
3089 Host_Error("AddPortalToNodes: already included");
3090 // 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
3092 p->nodes[0] = front;
3093 p->next[0] = (portal_t *)front->portals;
3094 front->portals = (mportal_t *)p;
3097 p->next[1] = (portal_t *)back->portals;
3098 back->portals = (mportal_t *)p;
3103 RemovePortalFromNode
3106 static void RemovePortalFromNodes(portal_t *portal)
3110 void **portalpointer;
3112 for (i = 0;i < 2;i++)
3114 node = portal->nodes[i];
3116 portalpointer = (void **) &node->portals;
3119 t = (portal_t *)*portalpointer;
3121 Host_Error("RemovePortalFromNodes: portal not in leaf");
3125 if (portal->nodes[0] == node)
3127 *portalpointer = portal->next[0];
3128 portal->nodes[0] = NULL;
3130 else if (portal->nodes[1] == node)
3132 *portalpointer = portal->next[1];
3133 portal->nodes[1] = NULL;
3136 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3140 if (t->nodes[0] == node)
3141 portalpointer = (void **) &t->next[0];
3142 else if (t->nodes[1] == node)
3143 portalpointer = (void **) &t->next[1];
3145 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3150 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3151 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3154 mnode_t *front, *back, *other_node;
3155 mplane_t clipplane, *plane;
3156 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3157 int numfrontpoints, numbackpoints;
3158 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3160 // if a leaf, we're done
3164 plane = node->plane;
3166 front = node->children[0];
3167 back = node->children[1];
3169 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3171 // create the new portal by generating a polygon for the node plane,
3172 // and clipping it by all of the other portals(which came from nodes above this one)
3173 nodeportal = AllocPortal();
3174 nodeportal->plane = *plane;
3176 // 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)
3177 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);
3178 nodeportal->numpoints = 4;
3179 side = 0; // shut up compiler warning
3180 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3182 clipplane = portal->plane;
3183 if (portal->nodes[0] == portal->nodes[1])
3184 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3185 if (portal->nodes[0] == node)
3187 else if (portal->nodes[1] == node)
3189 clipplane.dist = -clipplane.dist;
3190 VectorNegate(clipplane.normal, clipplane.normal);
3194 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3196 for (i = 0;i < nodeportal->numpoints*3;i++)
3197 frontpoints[i] = nodeportal->points[i];
3198 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);
3199 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3203 if (nodeportal->numpoints < 3)
3205 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3206 nodeportal->numpoints = 0;
3208 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3210 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3211 nodeportal->numpoints = 0;
3214 AddPortalToNodes(nodeportal, front, back);
3216 // split the portals of this node along this node's plane and assign them to the children of this node
3217 // (migrating the portals downward through the tree)
3218 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3220 if (portal->nodes[0] == portal->nodes[1])
3221 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3222 if (portal->nodes[0] == node)
3224 else if (portal->nodes[1] == node)
3227 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3228 nextportal = portal->next[side];
3229 if (!portal->numpoints)
3232 other_node = portal->nodes[!side];
3233 RemovePortalFromNodes(portal);
3235 // cut the portal into two portals, one on each side of the node plane
3236 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);
3238 if (!numfrontpoints)
3241 AddPortalToNodes(portal, back, other_node);
3243 AddPortalToNodes(portal, other_node, back);
3249 AddPortalToNodes(portal, front, other_node);
3251 AddPortalToNodes(portal, other_node, front);
3255 // the portal is split
3256 splitportal = AllocPortal();
3257 temp = splitportal->chain;
3258 *splitportal = *portal;
3259 splitportal->chain = temp;
3260 for (i = 0;i < numbackpoints*3;i++)
3261 splitportal->points[i] = backpoints[i];
3262 splitportal->numpoints = numbackpoints;
3263 for (i = 0;i < numfrontpoints*3;i++)
3264 portal->points[i] = frontpoints[i];
3265 portal->numpoints = numfrontpoints;
3269 AddPortalToNodes(portal, front, other_node);
3270 AddPortalToNodes(splitportal, back, other_node);
3274 AddPortalToNodes(portal, other_node, front);
3275 AddPortalToNodes(splitportal, other_node, back);
3279 Mod_Q1BSP_RecursiveNodePortals(front);
3280 Mod_Q1BSP_RecursiveNodePortals(back);
3283 static void Mod_Q1BSP_MakePortals(void)
3286 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3287 Mod_Q1BSP_FinalizePortals();
3290 //Returns PVS data for a given point
3291 //(note: can return NULL)
3292 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3295 node = model->brush.data_nodes;
3297 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3298 if (((mleaf_t *)node)->clusterindex >= 0)
3299 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3304 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)
3308 float d = PlaneDiff(org, node->plane);
3310 node = node->children[0];
3311 else if (d < -radius)
3312 node = node->children[1];
3315 // go down both sides
3316 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3317 node = node->children[1];
3320 // if this leaf is in a cluster, accumulate the pvs bits
3321 if (((mleaf_t *)node)->clusterindex >= 0)
3324 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3325 for (i = 0;i < pvsbytes;i++)
3326 pvsbuffer[i] |= pvs[i];
3330 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3331 //of the given point.
3332 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3334 int bytes = model->brush.num_pvsclusterbytes;
3335 bytes = min(bytes, pvsbufferlength);
3336 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3338 memset(pvsbuffer, 0xFF, bytes);
3342 memset(pvsbuffer, 0, bytes);
3343 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3347 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3352 VectorSubtract(inmaxs, inmins, size);
3353 if (cmodel->brush.ishlbsp)
3356 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3357 else if (size[0] <= 32)
3359 if (size[2] < 54) // pick the nearest of 36 or 72
3360 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3362 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3365 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3370 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3371 else if (size[0] <= 32)
3372 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3374 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3376 VectorCopy(inmins, outmins);
3377 VectorAdd(inmins, hull->clip_size, outmaxs);
3380 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3385 mempool_t *mainmempool;
3386 float dist, modelyawradius, modelradius, *vec;
3387 msurface_t *surface;
3388 int numshadowmeshtriangles;
3389 hullinfo_t hullinfo;
3390 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3391 model_brush_lightstyleinfo_t styleinfo[256];
3392 unsigned char *datapointer;
3394 mod->modeldatatypestring = "Q1BSP";
3396 mod->type = mod_brushq1;
3398 header = (dheader_t *)buffer;
3400 i = LittleLong(header->version);
3401 if (i != BSPVERSION && i != 30)
3402 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3403 mod->brush.ishlbsp = i == 30;
3405 // fill in hull info
3406 VectorClear (hullinfo.hullsizes[0][0]);
3407 VectorClear (hullinfo.hullsizes[0][1]);
3408 if (mod->brush.ishlbsp)
3410 mod->modeldatatypestring = "HLBSP";
3412 hullinfo.filehulls = 4;
3413 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3414 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3415 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3416 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3417 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3418 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3422 hullinfo.filehulls = 4;
3423 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3424 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3425 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3426 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3430 mod_base = (unsigned char*)buffer;
3431 for (i = 0; i < HEADER_LUMPS; i++)
3433 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3434 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3437 mod->soundfromcenter = true;
3438 mod->TraceBox = Mod_Q1BSP_TraceBox;
3439 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3440 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3441 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3442 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3443 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3444 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3445 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3446 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3447 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3448 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3449 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3450 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3451 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3452 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3453 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3455 if (loadmodel->isworldmodel)
3456 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
3460 mod->brush.qw_md4sum = 0;
3461 mod->brush.qw_md4sum2 = 0;
3462 for (i = 0;i < HEADER_LUMPS;i++)
3464 if (i == LUMP_ENTITIES)
3466 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3467 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3469 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3472 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3473 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3474 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3475 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3476 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3477 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3478 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3479 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3480 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3481 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3482 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3483 // load submodels before leafs because they contain the number of vis leafs
3484 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3485 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3486 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3487 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3489 // check if the map supports transparent water rendering
3490 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3492 if (mod->brushq1.data_compressedpvs)
3493 Mem_Free(mod->brushq1.data_compressedpvs);
3494 mod->brushq1.data_compressedpvs = NULL;
3495 mod->brushq1.num_compressedpvs = 0;
3497 Mod_Q1BSP_MakeHull0();
3498 Mod_Q1BSP_MakePortals();
3500 mod->numframes = 2; // regular and alternate animation
3503 mainmempool = mod->mempool;
3505 // make a single combined shadow mesh to allow optimized shadow volume creation
3506 numshadowmeshtriangles = 0;
3507 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3509 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3510 numshadowmeshtriangles += surface->num_triangles;
3512 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3513 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3514 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));
3515 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3516 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3518 if (loadmodel->brush.numsubmodels)
3519 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3521 // LordHavoc: to clear the fog around the original quake submodel code, I
3523 // first of all, some background info on the submodels:
3524 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3525 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3526 // now the weird for loop itself:
3527 // the loop functions in an odd way, on each iteration it sets up the
3528 // current 'mod' model (which despite the confusing code IS the model of
3529 // the number i), at the end of the loop it duplicates the model to become
3530 // the next submodel, and loops back to set up the new submodel.
3532 // LordHavoc: now the explanation of my sane way (which works identically):
3533 // set up the world model, then on each submodel copy from the world model
3534 // and set up the submodel with the respective model info.
3535 totalstylesurfaces = 0;
3537 for (i = 0;i < mod->brush.numsubmodels;i++)
3539 memset(stylecounts, 0, sizeof(stylecounts));
3540 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3542 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3543 for (j = 0;j < MAXLIGHTMAPS;j++)
3544 stylecounts[surface->lightmapinfo->styles[j]]++;
3546 for (k = 0;k < 255;k++)
3550 totalstylesurfaces += stylecounts[k];
3553 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3554 for (i = 0;i < mod->brush.numsubmodels;i++)
3556 // LordHavoc: this code was originally at the end of this loop, but
3557 // has been transformed to something more readable at the start here.
3562 // LordHavoc: only register submodels if it is the world
3563 // (prevents external bsp models from replacing world submodels with
3565 if (!loadmodel->isworldmodel)
3567 // duplicate the basic information
3568 dpsnprintf(name, sizeof(name), "*%i", i);
3569 mod = Mod_FindName(name);
3570 // copy the base model to this one
3572 // rename the clone back to its proper name
3573 strlcpy(mod->name, name, sizeof(mod->name));
3574 // textures and memory belong to the main model
3575 mod->texturepool = NULL;
3576 mod->mempool = 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->surfacelist = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3598 for (j = 0;j < mod->nummodelsurfaces;j++)
3599 mod->surfacelist[j] = mod->firstmodelsurface + j;
3601 // this gets altered below if sky or water is used
3602 mod->DrawSky = NULL;
3603 mod->DrawAddWaterPlanes = NULL;
3604 mod->Draw = R_Q1BSP_Draw;
3605 mod->DrawDepth = R_Q1BSP_DrawDepth;
3606 mod->DrawDebug = R_Q1BSP_DrawDebug;
3607 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3608 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3609 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3610 mod->DrawLight = R_Q1BSP_DrawLight;
3613 mod->brush.TraceLineOfSight = NULL;
3614 mod->brush.GetPVS = NULL;
3615 mod->brush.FatPVS = NULL;
3616 mod->brush.BoxTouchingPVS = NULL;
3617 mod->brush.BoxTouchingLeafPVS = NULL;
3618 mod->brush.BoxTouchingVisibleLeafs = NULL;
3619 mod->brush.FindBoxClusters = NULL;
3620 mod->brush.LightPoint = NULL;
3621 mod->brush.AmbientSoundLevelsForPoint = NULL;
3623 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3624 VectorCopy(bm->mins, mod->normalmins);
3625 VectorCopy(bm->maxs, mod->normalmaxs);
3626 VectorCopy(bm->mins, mod->yawmins);
3627 VectorCopy(bm->maxs, mod->yawmaxs);
3628 VectorCopy(bm->mins, mod->rotatedmins);
3629 VectorCopy(bm->maxs, mod->rotatedmaxs);
3630 if (mod->nummodelsurfaces)
3634 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3636 // we only need to have a drawsky function if it is used(usually only on world model)
3637 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3638 mod->DrawSky = R_Q1BSP_DrawSky;
3639 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3640 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3641 // calculate bounding shapes
3642 for (k = 0, vec = (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex);k < surface->num_vertices;k++, vec += 3)
3644 dist = vec[0]*vec[0]+vec[1]*vec[1];
3645 if (modelyawradius < dist)
3646 modelyawradius = dist;
3647 dist += vec[2]*vec[2];
3648 if (modelradius < dist)
3652 modelyawradius = sqrt(modelyawradius);
3653 modelradius = sqrt(modelradius);
3654 mod->yawmins[0] = min(mod->yawmins[0], -modelyawradius);
3655 mod->yawmaxs[0] = min(mod->yawmaxs[0], -modelyawradius);
3656 mod->yawmins[1] = min(mod->yawmins[1], modelyawradius);
3657 mod->yawmaxs[1] = min(mod->yawmaxs[1], modelyawradius);
3658 mod->rotatedmins[0] = min(mod->rotatedmins[0], -modelradius);
3659 mod->rotatedmaxs[0] = min(mod->rotatedmaxs[0], modelradius);
3660 mod->rotatedmins[1] = min(mod->rotatedmins[1], -modelradius);
3661 mod->rotatedmaxs[1] = min(mod->rotatedmaxs[1], modelradius);
3662 mod->rotatedmins[2] = min(mod->rotatedmins[2], -modelradius);
3663 mod->rotatedmaxs[2] = min(mod->rotatedmaxs[2], modelradius);
3664 mod->radius = modelradius;
3665 mod->radius2 = modelradius * modelradius;
3667 // build lightstyle update chains
3668 // (used to rapidly mark lightmapupdateflags on many surfaces
3669 // when d_lightstylevalue changes)
3670 memset(stylecounts, 0, sizeof(stylecounts));
3671 for (k = 0;k < mod->nummodelsurfaces;k++)
3673 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3674 for (j = 0;j < MAXLIGHTMAPS;j++)
3675 stylecounts[surface->lightmapinfo->styles[j]]++;
3677 mod->brushq1.num_lightstyles = 0;
3678 for (k = 0;k < 255;k++)
3682 styleinfo[mod->brushq1.num_lightstyles].style = k;
3683 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3684 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3685 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3686 remapstyles[k] = mod->brushq1.num_lightstyles;
3687 mod->brushq1.num_lightstyles++;
3690 for (k = 0;k < mod->nummodelsurfaces;k++)
3692 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3693 for (j = 0;j < MAXLIGHTMAPS;j++)
3695 if (surface->lightmapinfo->styles[j] != 255)
3697 int r = remapstyles[surface->lightmapinfo->styles[j]];
3698 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3702 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3703 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3707 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3708 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3710 //mod->brushq1.num_visleafs = bm->visleafs;
3713 Mod_Q1BSP_LoadMapBrushes();
3715 //Mod_Q1BSP_ProcessLightList();
3717 if (developer.integer >= 10)
3718 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);
3721 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3725 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3732 in = (void *)(mod_base + l->fileofs);
3733 if (l->filelen % sizeof(*in))
3734 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3735 count = l->filelen / sizeof(*in);
3736 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3739 loadmodel->num = count;
3741 for (i = 0;i < count;i++, in++, out++)
3747 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3754 in = (void *)(mod_base + l->fileofs);
3755 if (l->filelen % sizeof(*in))
3756 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3757 count = l->filelen / sizeof(*in);
3758 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3761 loadmodel->num = count;
3763 for (i = 0;i < count;i++, in++, out++)
3769 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3776 in = (void *)(mod_base + l->fileofs);
3777 if (l->filelen % sizeof(*in))
3778 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3779 count = l->filelen / sizeof(*in);
3780 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3783 loadmodel->num = count;
3785 for (i = 0;i < count;i++, in++, out++)
3791 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3798 in = (void *)(mod_base + l->fileofs);
3799 if (l->filelen % sizeof(*in))
3800 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3801 count = l->filelen / sizeof(*in);
3802 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3805 loadmodel->num = count;
3807 for (i = 0;i < count;i++, in++, out++)
3813 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3820 in = (void *)(mod_base + l->fileofs);
3821 if (l->filelen % sizeof(*in))
3822 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3823 count = l->filelen / sizeof(*in);
3824 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3827 loadmodel->num = count;
3829 for (i = 0;i < count;i++, in++, out++)
3835 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3842 in = (void *)(mod_base + l->fileofs);
3843 if (l->filelen % sizeof(*in))
3844 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3845 count = l->filelen / sizeof(*in);
3846 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3849 loadmodel->num = count;
3851 for (i = 0;i < count;i++, in++, out++)
3857 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3864 in = (void *)(mod_base + l->fileofs);
3865 if (l->filelen % sizeof(*in))
3866 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3867 count = l->filelen / sizeof(*in);
3868 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3871 loadmodel->num = count;
3873 for (i = 0;i < count;i++, in++, out++)
3879 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3886 in = (void *)(mod_base + l->fileofs);
3887 if (l->filelen % sizeof(*in))
3888 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3889 count = l->filelen / sizeof(*in);
3890 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3893 loadmodel->num = count;
3895 for (i = 0;i < count;i++, in++, out++)
3901 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3908 in = (void *)(mod_base + l->fileofs);
3909 if (l->filelen % sizeof(*in))
3910 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3911 count = l->filelen / sizeof(*in);
3912 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3915 loadmodel->num = count;
3917 for (i = 0;i < count;i++, in++, out++)
3923 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3930 in = (void *)(mod_base + l->fileofs);
3931 if (l->filelen % sizeof(*in))
3932 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3933 count = l->filelen / sizeof(*in);
3934 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3937 loadmodel->num = count;
3939 for (i = 0;i < count;i++, in++, out++)
3945 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3952 in = (void *)(mod_base + l->fileofs);
3953 if (l->filelen % sizeof(*in))
3954 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3955 count = l->filelen / sizeof(*in);
3956 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3959 loadmodel->num = count;
3961 for (i = 0;i < count;i++, in++, out++)
3967 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3974 in = (void *)(mod_base + l->fileofs);
3975 if (l->filelen % sizeof(*in))
3976 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3977 count = l->filelen / sizeof(*in);
3978 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3981 loadmodel->num = count;
3983 for (i = 0;i < count;i++, in++, out++)
3989 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3996 in = (void *)(mod_base + l->fileofs);
3997 if (l->filelen % sizeof(*in))
3998 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3999 count = l->filelen / sizeof(*in);
4000 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4003 loadmodel->num = count;
4005 for (i = 0;i < count;i++, in++, out++)
4011 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4018 in = (void *)(mod_base + l->fileofs);
4019 if (l->filelen % sizeof(*in))
4020 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4021 count = l->filelen / sizeof(*in);
4022 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4025 loadmodel->num = count;
4027 for (i = 0;i < count;i++, in++, out++)
4033 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4040 in = (void *)(mod_base + l->fileofs);
4041 if (l->filelen % sizeof(*in))
4042 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4043 count = l->filelen / sizeof(*in);
4044 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4047 loadmodel->num = count;
4049 for (i = 0;i < count;i++, in++, out++)
4055 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4062 in = (void *)(mod_base + l->fileofs);
4063 if (l->filelen % sizeof(*in))
4064 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4065 count = l->filelen / sizeof(*in);
4066 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4069 loadmodel->num = count;
4071 for (i = 0;i < count;i++, in++, out++)
4077 static void Mod_Q2BSP_LoadModels(lump_t *l)
4084 in = (void *)(mod_base + l->fileofs);
4085 if (l->filelen % sizeof(*in))
4086 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4087 count = l->filelen / sizeof(*in);
4088 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4091 loadmodel->num = count;
4093 for (i = 0;i < count;i++, in++, out++)
4099 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4102 q2dheader_t *header;
4104 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4106 mod->modeldatatypestring = "Q2BSP";
4108 mod->type = mod_brushq2;
4110 header = (q2dheader_t *)buffer;
4112 i = LittleLong(header->version);
4113 if (i != Q2BSPVERSION)
4114 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4115 mod->brush.ishlbsp = false;
4116 if (loadmodel->isworldmodel)
4117 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
4119 mod_base = (unsigned char *)header;
4121 // swap all the lumps
4122 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4123 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4125 mod->brush.qw_md4sum = 0;
4126 mod->brush.qw_md4sum2 = 0;
4127 for (i = 0;i < Q2HEADER_LUMPS;i++)
4129 if (i == Q2LUMP_ENTITIES)
4131 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4132 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4134 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4137 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4138 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4139 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4140 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4141 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4142 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4143 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4144 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4145 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4146 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4147 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4148 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4149 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4150 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4151 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4152 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4153 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4154 // LordHavoc: must go last because this makes the submodels
4155 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4158 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4159 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4161 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4164 char key[128], value[MAX_INPUTLINE];
4166 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4167 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4168 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4171 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4172 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4173 loadmodel->brush.entities[l->filelen] = 0;
4174 data = loadmodel->brush.entities;
4175 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4176 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4180 if (!COM_ParseToken_Simple(&data, false, false))
4182 if (com_token[0] == '}')
4183 break; // end of worldspawn
4184 if (com_token[0] == '_')
4185 strlcpy(key, com_token + 1, sizeof(key));
4187 strlcpy(key, com_token, sizeof(key));
4188 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4189 key[strlen(key)-1] = 0;
4190 if (!COM_ParseToken_Simple(&data, false, false))
4192 strlcpy(value, com_token, sizeof(value));
4193 if (!strcmp("gridsize", key))
4195 #if _MSC_VER >= 1400
4196 #define sscanf sscanf_s
4198 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4199 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4205 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4211 in = (q3dtexture_t *)(mod_base + l->fileofs);
4212 if (l->filelen % sizeof(*in))
4213 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4214 count = l->filelen / sizeof(*in);
4215 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4217 loadmodel->data_textures = out;
4218 loadmodel->num_textures = count;
4219 loadmodel->num_texturesperskin = loadmodel->num_textures;
4221 for (i = 0;i < count;i++)
4223 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4224 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4225 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4228 if (cls.state == ca_dedicated)
4231 for (i = 0;i < count;i++, in++, out++)
4232 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4235 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4241 in = (q3dplane_t *)(mod_base + l->fileofs);
4242 if (l->filelen % sizeof(*in))
4243 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4244 count = l->filelen / sizeof(*in);
4245 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4247 loadmodel->brush.data_planes = out;
4248 loadmodel->brush.num_planes = count;
4250 for (i = 0;i < count;i++, in++, out++)
4252 out->normal[0] = LittleFloat(in->normal[0]);
4253 out->normal[1] = LittleFloat(in->normal[1]);
4254 out->normal[2] = LittleFloat(in->normal[2]);
4255 out->dist = LittleFloat(in->dist);
4260 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4263 q3mbrushside_t *out;
4266 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4267 if (l->filelen % sizeof(*in))
4268 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4269 count = l->filelen / sizeof(*in);
4270 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4272 loadmodel->brush.data_brushsides = out;
4273 loadmodel->brush.num_brushsides = count;
4275 for (i = 0;i < count;i++, in++, out++)
4277 n = LittleLong(in->planeindex);
4278 if (n < 0 || n >= loadmodel->brush.num_planes)
4279 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4280 out->plane = loadmodel->brush.data_planes + n;
4281 n = LittleLong(in->textureindex);
4282 if (n < 0 || n >= loadmodel->num_textures)
4283 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4284 out->texture = loadmodel->data_textures + n;
4288 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4290 q3dbrushside_ig_t *in;
4291 q3mbrushside_t *out;
4294 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4295 if (l->filelen % sizeof(*in))
4296 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4297 count = l->filelen / sizeof(*in);
4298 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4300 loadmodel->brush.data_brushsides = out;
4301 loadmodel->brush.num_brushsides = count;
4303 for (i = 0;i < count;i++, in++, out++)
4305 n = LittleLong(in->planeindex);
4306 if (n < 0 || n >= loadmodel->brush.num_planes)
4307 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4308 out->plane = loadmodel->brush.data_planes + n;
4309 n = LittleLong(in->textureindex);
4310 if (n < 0 || n >= loadmodel->num_textures)
4311 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4312 out->texture = loadmodel->data_textures + n;
4316 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4320 int i, j, n, c, count, maxplanes;
4321 colplanef_t *planes;
4323 in = (q3dbrush_t *)(mod_base + l->fileofs);
4324 if (l->filelen % sizeof(*in))
4325 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4326 count = l->filelen / sizeof(*in);
4327 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4329 loadmodel->brush.data_brushes = out;
4330 loadmodel->brush.num_brushes = count;
4335 for (i = 0;i < count;i++, in++, out++)
4337 n = LittleLong(in->firstbrushside);
4338 c = LittleLong(in->numbrushsides);
4339 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4340 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4341 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4342 out->numbrushsides = c;
4343 n = LittleLong(in->textureindex);
4344 if (n < 0 || n >= loadmodel->num_textures)
4345 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4346 out->texture = loadmodel->data_textures + n;
4348 // make a list of mplane_t structs to construct a colbrush from
4349 if (maxplanes < out->numbrushsides)
4351 maxplanes = out->numbrushsides;
4354 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4356 for (j = 0;j < out->numbrushsides;j++)
4358 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4359 planes[j].dist = out->firstbrushside[j].plane->dist;
4360 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4361 planes[j].texture = out->firstbrushside[j].texture;
4363 // make the colbrush from the planes
4364 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4370 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4376 in = (q3deffect_t *)(mod_base + l->fileofs);
4377 if (l->filelen % sizeof(*in))
4378 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4379 count = l->filelen / sizeof(*in);
4380 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4382 loadmodel->brushq3.data_effects = out;
4383 loadmodel->brushq3.num_effects = count;
4385 for (i = 0;i < count;i++, in++, out++)
4387 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4388 n = LittleLong(in->brushindex);
4389 if (n >= loadmodel->brush.num_brushes)
4391 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4394 out->brushindex = n;
4395 out->unknown = LittleLong(in->unknown);
4399 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4404 in = (q3dvertex_t *)(mod_base + l->fileofs);
4405 if (l->filelen % sizeof(*in))
4406 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4407 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4408 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4409 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4410 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4411 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4412 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4414 for (i = 0;i < count;i++, in++)
4416 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4417 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4418 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4419 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4420 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4421 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4422 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4423 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4424 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4425 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4426 // svector/tvector are calculated later in face loading
4427 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4428 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4429 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4430 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4434 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4440 in = (int *)(mod_base + l->fileofs);
4441 if (l->filelen % sizeof(int[3]))
4442 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4443 count = l->filelen / sizeof(*in);
4444 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4446 loadmodel->brushq3.num_triangles = count / 3;
4447 loadmodel->brushq3.data_element3i = out;
4449 for (i = 0;i < count;i++, in++, out++)
4451 *out = LittleLong(*in);
4452 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4454 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4460 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4462 q3dlightmap_t *input_pointer;
4463 int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4466 unsigned char *convertedpixels;
4467 char mapname[MAX_QPATH];
4468 int size, bytesperpixel, rgbmap[3];
4470 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4472 // defaults for q3bsp
4479 loadmodel->brushq3.lightmapsize = 128;
4481 if (cls.state == ca_dedicated)
4484 if(mod_q3bsp_nolightmaps.integer)
4490 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4491 if (developer_loading.integer)
4492 Con_Printf("Using internal lightmaps\n");
4493 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4494 if (l->filelen % sizeof(*input_pointer))
4495 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4496 count = l->filelen / sizeof(*input_pointer);
4497 for(i = 0; i < count; ++i)
4498 inpixels[i] = input_pointer[i].rgb;
4502 // no internal lightmaps
4503 // try external lightmaps
4504 if (developer_loading.integer)
4505 Con_Printf("Using external lightmaps\n");
4506 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4507 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false);
4511 // using EXTERNAL lightmaps instead
4512 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4514 Mem_Free(inpixels[0]);
4515 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4525 for(count = 1; ; ++count)
4527 inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false);
4528 if(!inpixels[count])
4529 break; // we got all of them
4530 if(image_width != size || image_height != size)
4532 for(i = 0; i <= count; ++i)
4533 Mem_Free(inpixels[i]);
4534 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4539 convertedpixels = Mem_Alloc(tempmempool, size*size*4);
4540 loadmodel->brushq3.lightmapsize = size;
4541 loadmodel->brushq3.num_originallightmaps = count;
4543 // now check the surfaces to see if any of them index an odd numbered
4544 // lightmap, if so this is not a deluxemapped bsp file
4546 // also check what lightmaps are actually used, because q3map2 sometimes
4547 // (always?) makes an unused one at the end, which
4548 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4549 // reason when only one lightmap is used, which can throw off the
4550 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4551 // to see if the second lightmap is blank, if so it is not deluxemapped.
4552 loadmodel->brushq3.deluxemapping = !(count & 1);
4553 loadmodel->brushq3.deluxemapping_modelspace = true;
4555 if (loadmodel->brushq3.deluxemapping)
4557 int facecount = faceslump->filelen / sizeof(q3dface_t);
4558 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4559 for (i = 0;i < facecount;i++)
4561 j = LittleLong(faces[i].lightmapindex);
4564 endlightmap = max(endlightmap, j + 1);
4565 if ((j & 1) || j + 1 >= count)
4567 loadmodel->brushq3.deluxemapping = false;
4574 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4575 // reason when only one lightmap is used, which can throw off the
4576 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4577 // to see if the second lightmap is blank, if so it is not deluxemapped.
4579 // further research has shown q3map2 sometimes creates a deluxemap and two
4580 // blank lightmaps, which must be handled properly as well
4581 if (endlightmap == 1 && count > 1)
4584 for (i = 0;i < size*size;i++)
4586 if (c[bytesperpixel*i + rgbmap[0]])
4588 if (c[bytesperpixel*i + rgbmap[1]])
4590 if (c[bytesperpixel*i + rgbmap[2]])
4595 // all pixels in the unused lightmap were black...
4596 loadmodel->brushq3.deluxemapping = false;
4600 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4602 // figure out what the most reasonable merge power is within limits
4603 loadmodel->brushq3.num_lightmapmergepower = 0;
4604 for (power = 1;power <= mod_q3bsp_lightmapmergepower.integer && (128 << power) <= gl_max_texture_size && (1 << (power * 2)) < 4 * (count >> loadmodel->brushq3.deluxemapping);power++)
4605 loadmodel->brushq3.num_lightmapmergepower = power;
4607 // as the lightmap size may actually be another power of 2, adjust for this
4608 // (and interpret it as the power for 128x128 lightmaps above)
4609 for(i = 0; (128 << i) < size; ++i)
4610 loadmodel->brushq3.num_lightmapmergepower -= 1;
4611 if(loadmodel->brushq3.num_lightmapmergepower < 0)
4612 loadmodel->brushq3.num_lightmapmergepower = 0;
4614 loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4616 loadmodel->brushq3.num_mergedlightmaps = ((count >> loadmodel->brushq3.deluxemapping) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4617 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4618 if (loadmodel->brushq3.deluxemapping)
4619 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4621 // allocate a texture pool if we need it
4622 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4623 loadmodel->texturepool = R_AllocTexturePool();
4625 power = loadmodel->brushq3.num_lightmapmergepower;
4627 mask = (1 << power) - 1;
4628 for (i = 0;i < count;i++)
4630 // figure out which merged lightmap texture this fits into
4631 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4632 for (k = 0;k < size*size;k++)
4634 convertedpixels[k*4+0] = inpixels[i][k*bytesperpixel+rgbmap[0]];
4635 convertedpixels[k*4+1] = inpixels[i][k*bytesperpixel+rgbmap[1]];
4636 convertedpixels[k*4+2] = inpixels[i][k*bytesperpixel+rgbmap[2]];
4637 convertedpixels[k*4+3] = 255;
4639 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4641 // if the lightmap has not been allocated yet, create it
4642 if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4644 // create a lightmap only as large as necessary to hold the
4645 // remaining size*size blocks
4646 // if there are multiple merged lightmap textures then they will
4647 // all be full size except the last one which may be smaller
4648 // because it only needs to the remaining blocks, and it will often
4649 // be odd sizes like 2048x512 due to only being 25% full or so.
4650 j = (count >> loadmodel->brushq3.deluxemapping) - (lightmapindex << power2);
4651 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4653 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4655 if (developer_loading.integer)
4656 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);
4657 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);
4658 if (loadmodel->brushq3.data_deluxemaps)
4659 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);
4661 mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4662 mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4663 j = (i >> loadmodel->brushq3.deluxemapping) & ((1 << power2) - 1);
4664 if (loadmodel->brushq3.deluxemapping && (i & 1))
4665 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4667 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4671 // figure out which merged lightmap texture this fits into
4672 if (loadmodel->brushq3.deluxemapping && (i & 1))
4673 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);
4675 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);
4679 Mem_Free(convertedpixels);
4682 for(i = 0; i < count; ++i)
4683 Mem_Free(inpixels[i]);
4687 typedef struct patchtess_s
4699 #define PATCHTESS_SAME_LODGROUP(a,b) \
4701 (a).lodgroup[0] == (b).lodgroup[0] && \
4702 (a).lodgroup[1] == (b).lodgroup[1] && \
4703 (a).lodgroup[2] == (b).lodgroup[2] && \
4704 (a).lodgroup[3] == (b).lodgroup[3] && \
4705 (a).lodgroup[4] == (b).lodgroup[4] && \
4706 (a).lodgroup[5] == (b).lodgroup[5] \
4709 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4711 q3dface_t *in, *oldin;
4712 msurface_t *out, *oldout;
4713 int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, numvertices, numtriangles, groupsize, cxtess, cytess;
4714 float lightmaptcbase[2], lightmaptcscale[2];
4715 //int *originalelement3i;
4716 //int *originalneighbor3i;
4717 float *originalvertex3f;
4718 //float *originalsvector3f;
4719 //float *originaltvector3f;
4720 float *originalnormal3f;
4721 float *originalcolor4f;
4722 float *originaltexcoordtexture2f;
4723 float *originaltexcoordlightmap2f;
4725 patchtess_t *patchtess = NULL;
4726 int patchtesscount = 0;
4728 in = (q3dface_t *)(mod_base + l->fileofs);
4729 if (l->filelen % sizeof(*in))
4730 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4731 count = l->filelen / sizeof(*in);
4732 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4734 loadmodel->data_surfaces = out;
4735 loadmodel->num_surfaces = count;
4738 patchtess = Mem_Alloc(tempmempool, count * sizeof(*patchtess));
4746 for (;i < count;i++, in++, out++)
4748 // check face type first
4749 type = LittleLong(in->type);
4750 if (type != Q3FACETYPE_FLAT
4751 && type != Q3FACETYPE_PATCH
4752 && type != Q3FACETYPE_MESH
4753 && type != Q3FACETYPE_FLARE)
4755 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4759 n = LittleLong(in->textureindex);
4760 if (n < 0 || n >= loadmodel->num_textures)
4762 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4765 out->texture = loadmodel->data_textures + n;
4766 n = LittleLong(in->effectindex);
4767 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4769 if (developer.integer >= 100)
4770 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4776 out->effect = loadmodel->brushq3.data_effects + n;
4778 if (cls.state != ca_dedicated)
4780 out->lightmaptexture = NULL;
4781 out->deluxemaptexture = r_texture_blanknormalmap;
4782 n = LittleLong(in->lightmapindex);
4785 else if (n >= loadmodel->brushq3.num_originallightmaps)
4787 if(loadmodel->brushq3.num_originallightmaps != 0)
4788 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4793 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4794 if (loadmodel->brushq3.deluxemapping)
4795 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4799 firstvertex = LittleLong(in->firstvertex);
4800 numvertices = LittleLong(in->numvertices);
4801 firstelement = LittleLong(in->firstelement);
4802 numtriangles = LittleLong(in->numelements) / 3;
4803 if (numtriangles * 3 != LittleLong(in->numelements))
4805 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));
4808 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4810 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);
4813 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4815 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);
4820 case Q3FACETYPE_FLAT:
4821 case Q3FACETYPE_MESH:
4822 // no processing necessary
4824 case Q3FACETYPE_PATCH:
4825 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4826 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4827 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))
4829 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4832 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4834 // convert patch to Q3FACETYPE_MESH
4835 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4836 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4837 // bound to user settings
4838 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4839 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4840 // bound to sanity settings
4841 xtess = bound(1, xtess, 1024);
4842 ytess = bound(1, ytess, 1024);
4844 // lower quality collision patches! Same procedure as before, but different cvars
4845 // convert patch to Q3FACETYPE_MESH
4846 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4847 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4848 // bound to user settings
4849 cxtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_collision_maxtess.integer);
4850 cytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_collision_maxtess.integer);
4851 // bound to sanity settings
4852 cxtess = bound(1, xtess, 1024);
4853 cytess = bound(1, ytess, 1024);
4855 // store it for the LOD grouping step
4856 patchtess[patchtesscount].surface_id = i;
4857 patchtess[patchtesscount].grouped = false;
4858 patchtess[patchtesscount].xtess = xtess;
4859 patchtess[patchtesscount].ytess = ytess;
4860 patchtess[patchtesscount].xsize = patchsize[0];
4861 patchtess[patchtesscount].ysize = patchsize[1];
4862 patchtess[patchtesscount].lodgroup[0] = in->specific.patch.mins[0];
4863 patchtess[patchtesscount].lodgroup[1] = in->specific.patch.mins[1];
4864 patchtess[patchtesscount].lodgroup[2] = in->specific.patch.mins[2];
4865 patchtess[patchtesscount].lodgroup[3] = in->specific.patch.maxs[0];
4866 patchtess[patchtesscount].lodgroup[4] = in->specific.patch.maxs[1];
4867 patchtess[patchtesscount].lodgroup[5] = in->specific.patch.maxs[2];
4869 patchtess[patchtesscount].cxtess = xtess;
4870 patchtess[patchtesscount].cytess = ytess;
4873 case Q3FACETYPE_FLARE:
4874 if (developer.integer >= 100)
4875 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4879 out->num_vertices = numvertices;
4880 out->num_triangles = numtriangles;
4881 meshvertices += out->num_vertices;
4882 meshtriangles += out->num_triangles;
4885 for(i = 0; i < patchtesscount; ++i)
4887 if(patchtess[i].grouped) // already grouped
4890 // get the highest required tess parameters for this group
4893 cxtess = cytess = 0;
4894 for(j = 0; j < patchtesscount; ++j)
4896 if(patchtess[j].grouped) // already grouped
4898 if(!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
4900 if(patchtess[j].xtess > xtess)
4901 xtess = patchtess[j].xtess;
4902 if(patchtess[j].ytess > ytess)
4903 ytess = patchtess[j].ytess;
4904 if(patchtess[j].cxtess > cxtess)
4905 cxtess = patchtess[j].cxtess;
4906 if(patchtess[j].cytess > cytess)
4907 cytess = patchtess[j].cytess;
4913 Con_Printf("ERROR: patch %d isn't in any LOD group (1)?!?\n", patchtess[i].surface_id);
4917 // bound to user limit on vertices
4923 for(j = 0; j < patchtesscount; ++j)
4925 if(patchtess[j].grouped) // already grouped
4927 if(!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
4930 finalwidth = (patchtess[j].xsize - 1) * xtess + 1;
4931 finalheight = (patchtess[j].ysize - 1) * ytess + 1;
4932 numvertices += finalwidth * finalheight;
4933 numtriangles += (finalwidth - 1) * (finalheight - 1) * 2;
4936 if(xtess <= 1 && ytess <= 1)
4939 if(numvertices > min(r_subdivisions_maxvertices.integer, 262144) * groupsize)
4945 continue; // try again
4951 // bound to user limit on vertices (collision)
4957 for(j = 0; j < patchtesscount; ++j)
4959 if(patchtess[j].grouped) // already grouped
4961 if(!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
4964 finalwidth = (patchtess[j].xsize - 1) * cxtess + 1;
4965 finalheight = (patchtess[j].ysize - 1) * cytess + 1;
4966 numvertices += finalwidth * finalheight;
4967 numtriangles += (finalwidth - 1) * (finalheight - 1) * 2;
4970 if(cxtess <= 1 && cytess <= 1)
4973 if(numvertices > min(r_subdivisions_collision_maxvertices.integer, 262144) * groupsize)
4975 if (cxtess > cytess)
4979 continue; // try again
4985 for(j = 0; j < patchtesscount; ++j)
4987 if(patchtess[j].grouped) // already grouped
4989 if(!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
4992 finalwidth = (patchtess[j].xsize - 1) * xtess + 1;
4993 finalheight = (patchtess[j].ysize - 1) * ytess + 1;
4994 numvertices = finalwidth * finalheight;
4995 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4997 oldout[patchtess[j].surface_id].num_vertices = numvertices;
4998 oldout[patchtess[j].surface_id].num_triangles = numtriangles;
4999 meshvertices += oldout[patchtess[j].surface_id].num_vertices;
5000 meshtriangles += oldout[patchtess[j].surface_id].num_triangles;
5002 patchtess[j].grouped = true;
5003 patchtess[j].xtess = xtess;
5004 patchtess[j].ytess = ytess;
5005 patchtess[j].cxtess = cxtess;
5006 patchtess[j].cytess = cytess;
5013 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
5016 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
5018 if (out->num_vertices < 3 || out->num_triangles < 1)
5021 type = LittleLong(in->type);
5022 firstvertex = LittleLong(in->firstvertex);
5023 firstelement = LittleLong(in->firstelement);
5024 out->num_firstvertex = meshvertices;
5025 out->num_firsttriangle = meshtriangles;
5028 case Q3FACETYPE_FLAT:
5029 case Q3FACETYPE_MESH:
5030 // no processing necessary, except for lightmap merging
5031 for (j = 0;j < out->num_vertices;j++)
5033 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5034 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5035 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5036 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5037 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5038 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5039 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5040 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5041 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5042 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5043 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5044 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5045 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5046 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5048 for (j = 0;j < out->num_triangles*3;j++)
5049 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5051 case Q3FACETYPE_PATCH:
5052 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5053 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5054 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5055 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5056 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5057 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5058 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5060 xtess = ytess = cxtess = cytess = 0;
5061 for(j = 0; j < patchtesscount; ++j)
5062 if(patchtess[j].grouped && patchtess[j].surface_id == i)
5064 xtess = patchtess[j].xtess;
5065 ytess = patchtess[j].ytess;
5066 cxtess = patchtess[j].cxtess;
5067 cytess = patchtess[j].cytess;
5072 Con_Printf("ERROR: patch %d isn't in any LOD group (2)?!?\n", i);
5073 xtess = ytess = cxtess = cytess = 1;
5076 finalwidth = ((patchsize[0] - 1) * xtess) + 1;
5077 finalheight = ((patchsize[1] - 1) * ytess) + 1;
5078 finalvertices = finalwidth * finalheight;
5079 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5080 type = Q3FACETYPE_MESH;
5081 // generate geometry
5082 // (note: normals are skipped because they get recalculated)
5083 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5084 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5085 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5086 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5087 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5088 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5089 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);
5090 if (developer.integer >= 100)
5092 if (out->num_triangles < finaltriangles)
5093 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);
5095 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);
5097 // q3map does not put in collision brushes for curves... ugh
5098 // build the lower quality collision geometry
5099 finalwidth = ((patchsize[0] - 1) * cxtess) + 1;
5100 finalheight = ((patchsize[1] - 1) * cytess) + 1;
5101 finalvertices = finalwidth * finalheight;
5102 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5104 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5105 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5106 out->num_collisionvertices = finalvertices;
5107 out->num_collisiontriangles = finaltriangles;
5108 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5109 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
5111 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5112 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
5114 oldnumtriangles = out->num_triangles;
5115 oldnumtriangles2 = out->num_collisiontriangles;
5116 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
5117 if (developer.integer >= 100)
5118 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);
5123 meshvertices += out->num_vertices;
5124 meshtriangles += out->num_triangles;
5125 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5126 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)
5128 if (invalidelements)
5130 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);
5131 for (j = 0;j < out->num_triangles * 3;j++)
5133 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5134 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)
5135 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5139 // calculate a bounding box
5140 VectorClear(out->mins);
5141 VectorClear(out->maxs);
5142 if (out->num_vertices)
5144 if (cls.state != ca_dedicated && out->lightmaptexture)
5146 // figure out which part of the merged lightmap this fits into
5147 int lightmapindex = LittleLong(in->lightmapindex) >> loadmodel->brushq3.deluxemapping;
5148 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5149 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5150 lightmapindex &= mergewidth * mergeheight - 1;
5151 lightmaptcscale[0] = 1.0f / mergewidth;
5152 lightmaptcscale[1] = 1.0f / mergeheight;
5153 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5154 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5155 // modify the lightmap texcoords to match this region of the merged lightmap
5156 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5158 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5159 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5162 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5163 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5164 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5166 out->mins[0] = min(out->mins[0], v[0]);
5167 out->maxs[0] = max(out->maxs[0], v[0]);
5168 out->mins[1] = min(out->mins[1], v[1]);
5169 out->maxs[1] = max(out->maxs[1], v[1]);
5170 out->mins[2] = min(out->mins[2], v[2]);
5171 out->maxs[2] = max(out->maxs[2], v[2]);
5173 out->mins[0] -= 1.0f;
5174 out->mins[1] -= 1.0f;
5175 out->mins[2] -= 1.0f;
5176 out->maxs[0] += 1.0f;
5177 out->maxs[1] += 1.0f;
5178 out->maxs[2] += 1.0f;
5180 // set lightmap styles for consistency with q1bsp
5181 //out->lightmapinfo->styles[0] = 0;
5182 //out->lightmapinfo->styles[1] = 255;
5183 //out->lightmapinfo->styles[2] = 255;
5184 //out->lightmapinfo->styles[3] = 255;
5189 for (;i < count;i++, out++)
5191 if(out->num_vertices && out->num_triangles)
5193 if(out->num_vertices == 0)
5194 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no vertices, ignoring\n", i);
5195 if(out->num_triangles == 0)
5196 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no triangles, ignoring\n", i);
5199 // for per pixel lighting
5200 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);
5202 // generate ushort elements array if possible
5203 if (loadmodel->surfmesh.data_element3s)
5204 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5205 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5207 // free the no longer needed vertex data
5208 loadmodel->brushq3.num_vertices = 0;
5209 if (loadmodel->brushq3.data_vertex3f)
5210 Mem_Free(loadmodel->brushq3.data_vertex3f);
5211 loadmodel->brushq3.data_vertex3f = NULL;
5212 loadmodel->brushq3.data_normal3f = NULL;
5213 loadmodel->brushq3.data_texcoordtexture2f = NULL;
5214 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5215 loadmodel->brushq3.data_color4f = NULL;
5216 // free the no longer needed triangle data
5217 loadmodel->brushq3.num_triangles = 0;
5218 if (loadmodel->brushq3.data_element3i)
5219 Mem_Free(loadmodel->brushq3.data_element3i);
5220 loadmodel->brushq3.data_element3i = NULL;
5223 Mem_Free(patchtess);
5226 static void Mod_Q3BSP_LoadModels(lump_t *l)
5230 int i, j, n, c, count;
5232 in = (q3dmodel_t *)(mod_base + l->fileofs);
5233 if (l->filelen % sizeof(*in))
5234 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5235 count = l->filelen / sizeof(*in);
5236 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5238 loadmodel->brushq3.data_models = out;
5239 loadmodel->brushq3.num_models = count;
5241 for (i = 0;i < count;i++, in++, out++)
5243 for (j = 0;j < 3;j++)
5245 out->mins[j] = LittleFloat(in->mins[j]);
5246 out->maxs[j] = LittleFloat(in->maxs[j]);
5248 n = LittleLong(in->firstface);
5249 c = LittleLong(in->numfaces);
5250 if (n < 0 || n + c > loadmodel->num_surfaces)
5251 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5254 n = LittleLong(in->firstbrush);
5255 c = LittleLong(in->numbrushes);
5256 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5257 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5258 out->firstbrush = n;
5259 out->numbrushes = c;
5263 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5269 in = (int *)(mod_base + l->fileofs);
5270 if (l->filelen % sizeof(*in))
5271 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5272 count = l->filelen / sizeof(*in);
5273 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5275 loadmodel->brush.data_leafbrushes = out;
5276 loadmodel->brush.num_leafbrushes = count;
5278 for (i = 0;i < count;i++, in++, out++)
5280 n = LittleLong(*in);
5281 if (n < 0 || n >= loadmodel->brush.num_brushes)
5282 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5287 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5293 in = (int *)(mod_base + l->fileofs);
5294 if (l->filelen % sizeof(*in))
5295 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5296 count = l->filelen / sizeof(*in);
5297 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5299 loadmodel->brush.data_leafsurfaces = out;
5300 loadmodel->brush.num_leafsurfaces = count;
5302 for (i = 0;i < count;i++, in++, out++)
5304 n = LittleLong(*in);
5305 if (n < 0 || n >= loadmodel->num_surfaces)
5306 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5311 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5315 int i, j, n, c, count;
5317 in = (q3dleaf_t *)(mod_base + l->fileofs);
5318 if (l->filelen % sizeof(*in))
5319 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5320 count = l->filelen / sizeof(*in);
5321 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5323 loadmodel->brush.data_leafs = out;
5324 loadmodel->brush.num_leafs = count;
5326 for (i = 0;i < count;i++, in++, out++)
5330 out->clusterindex = LittleLong(in->clusterindex);
5331 out->areaindex = LittleLong(in->areaindex);
5332 for (j = 0;j < 3;j++)
5334 // yes the mins/maxs are ints
5335 out->mins[j] = LittleLong(in->mins[j]) - 1;
5336 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5338 n = LittleLong(in->firstleafface);
5339 c = LittleLong(in->numleaffaces);
5340 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5341 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5342 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5343 out->numleafsurfaces = c;
5344 n = LittleLong(in->firstleafbrush);
5345 c = LittleLong(in->numleafbrushes);
5346 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5347 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5348 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5349 out->numleafbrushes = c;
5353 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5359 in = (q3dnode_t *)(mod_base + l->fileofs);
5360 if (l->filelen % sizeof(*in))
5361 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5362 count = l->filelen / sizeof(*in);
5363 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5365 loadmodel->brush.data_nodes = out;
5366 loadmodel->brush.num_nodes = count;
5368 for (i = 0;i < count;i++, in++, out++)
5371 n = LittleLong(in->planeindex);
5372 if (n < 0 || n >= loadmodel->brush.num_planes)
5373 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5374 out->plane = loadmodel->brush.data_planes + n;
5375 for (j = 0;j < 2;j++)
5377 n = LittleLong(in->childrenindex[j]);
5380 if (n >= loadmodel->brush.num_nodes)
5381 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5382 out->children[j] = loadmodel->brush.data_nodes + n;
5387 if (n >= loadmodel->brush.num_leafs)
5388 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5389 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5392 for (j = 0;j < 3;j++)
5394 // yes the mins/maxs are ints
5395 out->mins[j] = LittleLong(in->mins[j]) - 1;
5396 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5400 // set the parent pointers
5401 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5404 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5407 q3dlightgrid_t *out;
5410 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5411 if (l->filelen % sizeof(*in))
5412 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5413 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5414 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5415 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5416 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5417 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5418 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5419 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5420 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5421 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5422 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5423 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5424 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5425 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5426 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]);
5427 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]);
5429 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5432 if (l->filelen < count * (int)sizeof(*in))
5433 Host_Error("Mod_Q3BSP_LoadLightGrid: invalid lightgrid lump size %i bytes, should be %i bytes (%ix%ix%i)", l->filelen, (int)(count * sizeof(*in)), loadmodel->brushq3.num_lightgrid_dimensions[0], loadmodel->brushq3.num_lightgrid_dimensions[1], loadmodel->brushq3.num_lightgrid_dimensions[2]);
5434 if (l->filelen != count * (int)sizeof(*in))
5435 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5436 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5437 loadmodel->brushq3.data_lightgrid = out;
5438 loadmodel->brushq3.num_lightgrid = count;
5439 // no swapping or validation necessary
5440 memcpy(out, in, count * (int)sizeof(*out));
5444 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5449 if (l->filelen == 0)
5452 // unvised maps often have cluster indices even without pvs, so check
5453 // leafs to find real number of clusters
5454 loadmodel->brush.num_pvsclusters = 1;
5455 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5456 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5459 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5460 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5461 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5462 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5466 in = (q3dpvs_t *)(mod_base + l->fileofs);
5468 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5470 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5471 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5472 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5473 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5474 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5475 if (l->filelen < totalchains + (int)sizeof(*in))
5476 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);
5478 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5479 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5482 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5484 int i, j, k, index[3];
5485 float transformed[3], blend1, blend2, blend, stylescale;
5486 q3dlightgrid_t *a, *s;
5488 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5489 stylescale = r_refdef.scene.rtlightstylevalue[0];
5491 if (!model->brushq3.num_lightgrid)
5493 ambientcolor[0] = stylescale;
5494 ambientcolor[1] = stylescale;
5495 ambientcolor[2] = stylescale;
5499 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5500 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5501 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5502 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5503 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5504 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5505 index[0] = (int)floor(transformed[0]);
5506 index[1] = (int)floor(transformed[1]);
5507 index[2] = (int)floor(transformed[2]);
5508 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5510 // now lerp the values
5511 VectorClear(diffusenormal);
5512 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5513 for (k = 0;k < 2;k++)
5515 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5516 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5518 for (j = 0;j < 2;j++)
5520 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5521 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5523 for (i = 0;i < 2;i++)
5525 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5526 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5528 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5529 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5530 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5531 // this uses the mod_md3_sin table because the values are
5532 // already in the 0-255 range, the 64+ bias fetches a cosine
5533 // instead of a sine value
5534 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5535 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5536 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5537 //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)));
5542 // normalize the light direction before turning
5543 VectorNormalize(diffusenormal);
5544 //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]);
5547 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
5552 // find which leaf the point is in
5554 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5555 // point trace the brushes
5556 leaf = (mleaf_t *)node;
5557 for (i = 0;i < leaf->numleafbrushes;i++)
5559 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5560 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5562 brush->markframe = markframe;
5563 Collision_TracePointBrushFloat(trace, point, brush);
5566 // can't do point traces on curves (they have no thickness)
5569 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)
5571 int i, startside, endside;
5572 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5574 msurface_t *surface;
5577 // walk the tree until we hit a leaf, recursing for any split cases
5580 // abort if this part of the bsp tree can not be hit by this trace
5581 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5583 plane = node->plane;
5584 // axial planes are much more common than non-axial, so an optimized
5585 // axial case pays off here
5586 if (plane->type < 3)
5588 dist1 = start[plane->type] - plane->dist;
5589 dist2 = end[plane->type] - plane->dist;
5593 dist1 = DotProduct(start, plane->normal) - plane->dist;
5594 dist2 = DotProduct(end, plane->normal) - plane->dist;
5596 startside = dist1 < 0;
5597 endside = dist2 < 0;
5598 if (startside == endside)
5600 // most of the time the line fragment is on one side of the plane
5601 node = node->children[startside];
5605 // line crosses node plane, split the line
5606 dist1 = PlaneDiff(linestart, plane);
5607 dist2 = PlaneDiff(lineend, plane);
5608 midfrac = dist1 / (dist1 - dist2);
5609 VectorLerp(linestart, midfrac, lineend, mid);
5610 // take the near side first
5611 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5612 // if we found an impact on the front side, don't waste time
5613 // exploring the far side
5614 if (midfrac <= trace->realfraction)
5615 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5619 // abort if this part of the bsp tree can not be hit by this trace
5620 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5623 nodesegmentmins[0] = min(start[0], end[0]) - 1;
5624 nodesegmentmins[1] = min(start[1], end[1]) - 1;
5625 nodesegmentmins[2] = min(start[2], end[2]) - 1;
5626 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5627 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5628 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5629 // line trace the brushes
5630 leaf = (mleaf_t *)node;
5631 for (i = 0;i < leaf->numleafbrushes;i++)
5633 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5634 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5636 brush->markframe = markframe;
5637 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5640 // can't do point traces on curves (they have no thickness)
5641 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5643 // line trace the curves
5644 for (i = 0;i < leaf->numleafsurfaces;i++)
5646 surface = model->data_surfaces + leaf->firstleafsurface[i];
5647 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5649 surface->collisionmarkframe = markframe;
5650 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5656 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)
5662 msurface_t *surface;
5664 float nodesegmentmins[3], nodesegmentmaxs[3];
5665 // walk the tree until we hit a leaf, recursing for any split cases
5668 // abort if this part of the bsp tree can not be hit by this trace
5669 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5671 plane = node->plane;
5672 // axial planes are much more common than non-axial, so an optimized
5673 // axial case pays off here
5674 if (plane->type < 3)
5676 // this is an axial plane, compare bounding box directly to it and
5677 // recurse sides accordingly
5678 // recurse down node sides
5679 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5680 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5681 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5682 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5686 // this is a non-axial plane, so check if the start and end boxes
5687 // are both on one side of the plane to handle 'diagonal' cases
5688 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5692 // segment crosses plane
5693 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5696 // if sides == 0 then the trace itself is bogus (Not A Number values),
5697 // in this case we simply pretend the trace hit nothing
5699 return; // ERROR: NAN bounding box!
5700 // take whichever side the segment box is on
5701 node = node->children[sides - 1];
5703 // abort if this part of the bsp tree can not be hit by this trace
5704 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5706 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5707 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5708 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5709 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5710 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5711 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5713 leaf = (mleaf_t *)node;
5714 for (i = 0;i < leaf->numleafbrushes;i++)
5716 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5717 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5719 brush->markframe = markframe;
5720 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5723 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5725 for (i = 0;i < leaf->numleafsurfaces;i++)
5727 surface = model->data_surfaces + leaf->firstleafsurface[i];
5728 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5730 surface->collisionmarkframe = markframe;
5731 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);
5737 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)
5740 float segmentmins[3], segmentmaxs[3];
5741 static int markframe = 0;
5742 msurface_t *surface;
5744 memset(trace, 0, sizeof(*trace));
5745 trace->fraction = 1;
5746 trace->realfraction = 1;
5747 trace->hitsupercontentsmask = hitsupercontentsmask;
5748 if (mod_q3bsp_optimizedtraceline.integer && VectorLength2(boxmins) + VectorLength2(boxmaxs) == 0)
5750 if (VectorCompare(start, end))
5753 if (model->brush.submodel)
5755 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5756 if (brush->colbrushf)
5757 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5760 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5765 segmentmins[0] = min(start[0], end[0]) - 1;
5766 segmentmins[1] = min(start[1], end[1]) - 1;
5767 segmentmins[2] = min(start[2], end[2]) - 1;
5768 segmentmaxs[0] = max(start[0], end[0]) + 1;
5769 segmentmaxs[1] = max(start[1], end[1]) + 1;
5770 segmentmaxs[2] = max(start[2], end[2]) + 1;
5771 if (model->brush.submodel)
5773 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5774 if (brush->colbrushf)
5775 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5776 if (mod_q3bsp_curves_collisions.integer)
5777 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5778 if (surface->num_collisiontriangles)
5779 Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5782 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5787 // box trace, performed as brush trace
5788 colbrushf_t *thisbrush_start, *thisbrush_end;
5789 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5790 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5791 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5792 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5793 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5794 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5795 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5796 VectorAdd(start, boxmins, boxstartmins);
5797 VectorAdd(start, boxmaxs, boxstartmaxs);
5798 VectorAdd(end, boxmins, boxendmins);
5799 VectorAdd(end, boxmaxs, boxendmaxs);
5800 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5801 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5802 if (model->brush.submodel)
5804 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5805 if (brush->colbrushf)
5806 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5807 if (mod_q3bsp_curves_collisions.integer)
5808 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5809 if (surface->num_collisiontriangles)
5810 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);
5813 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5817 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5820 int supercontents = 0;
5822 // test if the point is inside each brush
5823 if (model->brush.submodel)
5825 // submodels are effectively one leaf
5826 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5827 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5828 supercontents |= brush->colbrushf->supercontents;
5832 mnode_t *node = model->brush.data_nodes;
5834 // find which leaf the point is in
5836 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5837 leaf = (mleaf_t *)node;
5838 // now check the brushes in the leaf
5839 for (i = 0;i < leaf->numleafbrushes;i++)
5841 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5842 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5843 supercontents |= brush->colbrushf->supercontents;
5846 return supercontents;
5849 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
5851 int supercontents = 0;
5852 if (nativecontents & CONTENTSQ3_SOLID)
5853 supercontents |= SUPERCONTENTS_SOLID;
5854 if (nativecontents & CONTENTSQ3_WATER)
5855 supercontents |= SUPERCONTENTS_WATER;
5856 if (nativecontents & CONTENTSQ3_SLIME)
5857 supercontents |= SUPERCONTENTS_SLIME;
5858 if (nativecontents & CONTENTSQ3_LAVA)
5859 supercontents |= SUPERCONTENTS_LAVA;
5860 if (nativecontents & CONTENTSQ3_BODY)
5861 supercontents |= SUPERCONTENTS_BODY;
5862 if (nativecontents & CONTENTSQ3_CORPSE)
5863 supercontents |= SUPERCONTENTS_CORPSE;
5864 if (nativecontents & CONTENTSQ3_NODROP)
5865 supercontents |= SUPERCONTENTS_NODROP;
5866 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5867 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5868 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5869 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5870 if (nativecontents & CONTENTSQ3_DONOTENTER)
5871 supercontents |= SUPERCONTENTS_DONOTENTER;
5872 return supercontents;
5875 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
5877 int nativecontents = 0;
5878 if (supercontents & SUPERCONTENTS_SOLID)
5879 nativecontents |= CONTENTSQ3_SOLID;
5880 if (supercontents & SUPERCONTENTS_WATER)
5881 nativecontents |= CONTENTSQ3_WATER;
5882 if (supercontents & SUPERCONTENTS_SLIME)
5883 nativecontents |= CONTENTSQ3_SLIME;
5884 if (supercontents & SUPERCONTENTS_LAVA)
5885 nativecontents |= CONTENTSQ3_LAVA;
5886 if (supercontents & SUPERCONTENTS_BODY)
5887 nativecontents |= CONTENTSQ3_BODY;
5888 if (supercontents & SUPERCONTENTS_CORPSE)
5889 nativecontents |= CONTENTSQ3_CORPSE;
5890 if (supercontents & SUPERCONTENTS_NODROP)
5891 nativecontents |= CONTENTSQ3_NODROP;
5892 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5893 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5894 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5895 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5896 if (supercontents & SUPERCONTENTS_DONOTENTER)
5897 nativecontents |= CONTENTSQ3_DONOTENTER;
5898 return nativecontents;
5901 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5906 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5907 node = node->children[1];
5909 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5910 if (loadmodel->brush.num_leafs < numleafs)
5911 loadmodel->brush.num_leafs = numleafs;
5914 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
5916 int i, j, numshadowmeshtriangles, lumps;
5917 q3dheader_t *header;
5918 float corner[3], yawradius, modelradius;
5919 msurface_t *surface;
5921 mod->modeldatatypestring = "Q3BSP";
5923 mod->type = mod_brushq3;
5924 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5927 header = (q3dheader_t *)buffer;
5928 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
5929 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
5931 i = LittleLong(header->version);
5932 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
5933 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5934 mod->brush.ishlbsp = false;
5935 if (loadmodel->isworldmodel)
5936 Cvar_SetValue("halflifebsp", mod->brush.ishlbsp);
5938 mod->soundfromcenter = true;
5939 mod->TraceBox = Mod_Q3BSP_TraceBox;
5940 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
5941 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
5942 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5943 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5944 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5945 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5946 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5947 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5948 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5949 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
5950 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5951 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5952 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5953 mod->Draw = R_Q1BSP_Draw;
5954 mod->DrawDepth = R_Q1BSP_DrawDepth;
5955 mod->DrawDebug = R_Q1BSP_DrawDebug;
5956 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5957 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5958 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5959 mod->DrawLight = R_Q1BSP_DrawLight;
5960 mod->DrawAddWaterPlanes = NULL;
5962 mod_base = (unsigned char *)header;
5964 // swap all the lumps
5965 header->ident = LittleLong(header->ident);
5966 header->version = LittleLong(header->version);
5967 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
5968 for (i = 0;i < lumps;i++)
5970 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
5971 if((char *) bufferend < (char *) buffer + j)
5972 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
5973 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
5974 if((char *) bufferend < (char *) buffer + j)
5975 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
5978 * NO, do NOT clear them!
5979 * they contain actual data referenced by other stuff.
5980 * Instead, before using the advertisements lump, check header->versio
5982 * Sorry, but otherwise it breaks memory of the first lump.
5983 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
5985 header->lumps[i].fileofs = 0;
5986 header->lumps[i].filelen = 0;
5990 mod->brush.qw_md4sum = 0;
5991 mod->brush.qw_md4sum2 = 0;
5992 for (i = 0;i < lumps;i++)
5994 if (i == Q3LUMP_ENTITIES)
5996 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5997 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
5999 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6002 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
6003 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
6004 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
6005 if (header->version == Q3BSPVERSION_IG)
6006 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
6008 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
6009 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
6010 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
6011 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
6012 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
6013 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
6014 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
6015 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
6016 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
6017 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
6018 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
6019 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
6020 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
6021 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
6022 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
6024 // the MakePortals code works fine on the q3bsp data as well
6025 Mod_Q1BSP_MakePortals();
6027 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
6028 loadmodel->brush.supportwateralpha = true;
6030 // make a single combined shadow mesh to allow optimized shadow volume creation
6031 numshadowmeshtriangles = 0;
6032 if (cls.state != ca_dedicated)
6034 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6036 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
6037 numshadowmeshtriangles += surface->num_triangles;
6039 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
6040 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6041 if (surface->num_triangles > 0)
6042 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));
6043 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
6044 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
6047 loadmodel->brush.num_leafs = 0;
6048 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
6051 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
6056 // LordHavoc: only register submodels if it is the world
6057 // (prevents external bsp models from replacing world submodels with
6059 if (!loadmodel->isworldmodel)
6061 // duplicate the basic information
6062 dpsnprintf(name, sizeof(name), "*%i", i);
6063 mod = Mod_FindName(name);
6065 strlcpy(mod->name, name, sizeof(mod->name));
6066 // textures and memory belong to the main model
6067 mod->texturepool = NULL;
6068 mod->mempool = NULL;
6069 mod->brush.TraceLineOfSight = NULL;
6070 mod->brush.GetPVS = NULL;
6071 mod->brush.FatPVS = NULL;
6072 mod->brush.BoxTouchingPVS = NULL;
6073 mod->brush.BoxTouchingLeafPVS = NULL;
6074 mod->brush.BoxTouchingVisibleLeafs = NULL;
6075 mod->brush.FindBoxClusters = NULL;
6076 mod->brush.LightPoint = NULL;
6077 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
6079 mod->brush.submodel = i;
6081 // make the model surface list (used by shadowing/lighting)
6082 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
6083 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
6084 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
6085 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
6086 mod->surfacelist = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->surfacelist));
6087 for (j = 0;j < mod->nummodelsurfaces;j++)
6088 mod->surfacelist[j] = mod->firstmodelsurface + j;
6090 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
6091 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
6092 // enlarge the bounding box to enclose all geometry of this model,
6093 // because q3map2 sometimes lies (mostly to affect the lightgrid),
6094 // which can in turn mess up the farclip (as well as culling when
6095 // outside the level - an unimportant concern)
6097 //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]);
6098 for (j = 0;j < mod->nummodelsurfaces;j++)
6100 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
6101 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
6103 if (!surface->num_vertices)
6105 for (k = 0;k < surface->num_vertices;k++, v += 3)
6107 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
6108 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
6109 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
6110 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
6111 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
6112 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
6115 //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]);
6116 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
6117 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
6118 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
6119 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
6120 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
6121 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
6122 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
6123 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
6124 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
6125 mod->yawmins[2] = mod->normalmins[2];
6126 mod->yawmaxs[2] = mod->normalmaxs[2];
6127 mod->radius = modelradius;
6128 mod->radius2 = modelradius * modelradius;
6130 for (j = 0;j < mod->nummodelsurfaces;j++)
6131 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
6133 if (j < mod->nummodelsurfaces)
6134 mod->DrawSky = R_Q1BSP_DrawSky;
6136 mod->DrawSky = NULL;
6138 for (j = 0;j < mod->nummodelsurfaces;j++)
6139 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
6141 if (j < mod->nummodelsurfaces)
6142 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
6144 mod->DrawAddWaterPlanes = NULL;
6148 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6150 int i = LittleLong(((int *)buffer)[1]);
6151 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
6152 Mod_Q3BSP_Load(mod,buffer, bufferend);
6153 else if (i == Q2BSPVERSION)
6154 Mod_Q2BSP_Load(mod,buffer, bufferend);
6156 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
6159 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6161 Host_Error("Mod_MAP_Load: not yet implemented");
6164 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
6166 // we already have done PVS culling at this point...
6167 // so we don't need to do it again.
6170 vec3_t testorigin, mins, maxs;
6172 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
6173 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
6174 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
6176 if(model->brush.TraceLineOfSight(model, eye, testorigin))
6179 // expand the box a little
6180 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
6181 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
6182 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
6183 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
6184 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
6185 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
6187 for(i = 0; i != numsamples; ++i)
6189 testorigin[0] = lhrandom(mins[0], maxs[0]);
6190 testorigin[1] = lhrandom(mins[1], maxs[1]);
6191 testorigin[2] = lhrandom(mins[2], maxs[2]);
6193 if(model->brush.TraceLineOfSight(model, eye, testorigin))