2 Copyright (C) 1996-1997 Id Software, Inc.
4 This program is free software; you can redistribute it and/or
5 modify it under the terms of the GNU General Public License
6 as published by the Free Software Foundation; either version 2
7 of the License, or (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
13 See the GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128", "how large water polygons should be (smaller values produce more polygons which give better warping effects)"};
30 cvar_t r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
31 cvar_t r_picmipworld = {CVAR_SAVE, "r_picmipworld", "1", "whether gl_picmip shall apply to world textures too"};
32 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0", "pretends there was no texture lump found in the q1bsp/hlbsp loading (useful for debugging this rare case)"};
33 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4", "maximum error tolerance on curve subdivision for rendering purposes (in other words, the curves will be given as many polygons as necessary to represent curves at this quality)"};
34 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
35 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
36 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
37 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15", "maximum error tolerance on curve subdivision for collision purposes (usually a larger error tolerance than for rendering)"};
38 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
39 cvar_t r_subdivisions_collision_maxtess = {0, "r_subdivisions_collision_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
40 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
41 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
42 cvar_t mod_q3bsp_curves_collisions_stride = {0, "mod_q3bsp_curves_collisions_stride", "16", "collisions against curves: optimize performance by doing a combined collision check for this triangle amount first"};
43 cvar_t mod_q3bsp_curves_stride = {0, "mod_q3bsp_curves_stride", "16", "particle effect collisions against curves: optimize performance by doing a combined collision check for this triangle amount first"};
44 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
45 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
46 cvar_t mod_q3bsp_lightmapmergepower = {CVAR_SAVE, "mod_q3bsp_lightmapmergepower", "4", "merges the quake3 128x128 lightmap textures into larger lightmap group textures to speed up rendering, 1 = 256x256, 2 = 512x512, 3 = 1024x1024, 4 = 2048x2048, 5 = 4096x4096, ..."};
47 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)"};
49 static texture_t mod_q1bsp_texture_solid;
50 static texture_t mod_q1bsp_texture_sky;
51 static texture_t mod_q1bsp_texture_lava;
52 static texture_t mod_q1bsp_texture_slime;
53 static texture_t mod_q1bsp_texture_water;
55 void Mod_BrushInit(void)
57 // Cvar_RegisterVariable(&r_subdivide_size);
58 Cvar_RegisterVariable(&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_curves_collisions_stride);
71 Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
72 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
73 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
74 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
75 Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
77 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
78 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
79 mod_q1bsp_texture_solid.surfaceflags = 0;
80 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
82 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
83 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
84 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
85 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
87 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
88 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
89 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
90 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
92 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
93 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
94 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
95 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
97 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
98 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
99 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
100 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
103 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
110 // LordHavoc: modified to start at first clip node,
111 // in other words: first node of the (sub)model
112 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
114 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
116 return (mleaf_t *)node;
119 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
123 leaf = Mod_Q1BSP_PointInLeaf(model, p);
126 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
129 memcpy(out, leaf->ambient_sound_level, i);
135 memset(out, 0, outsize);
138 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
141 int nodestackindex = 0;
142 mnode_t *node, *nodestack[1024];
143 if (!model->brush.num_pvsclusters)
145 node = model->brush.data_nodes;
151 // node - recurse down the BSP tree
152 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
156 return -1; // ERROR: NAN bounding box!
157 // box is on one side of plane, take that path
158 node = node->children[sides-1];
162 // box crosses plane, take one path and remember the other
163 if (nodestackindex < 1024)
164 nodestack[nodestackindex++] = node->children[0];
165 node = node->children[1];
171 // leaf - add clusterindex to list
172 if (numclusters < maxclusters)
173 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
177 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
181 if (nodestackindex < 1024)
182 nodestack[nodestackindex++] = node->children[0];
183 node = node->children[1];
188 // leaf - add clusterindex to list
189 if (numclusters < maxclusters)
190 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
195 // try another path we didn't take earlier
196 if (nodestackindex == 0)
198 node = nodestack[--nodestackindex];
200 // return number of clusters found (even if more than the maxclusters)
204 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
206 int nodestackindex = 0;
207 mnode_t *node, *nodestack[1024];
208 if (!model->brush.num_pvsclusters)
210 node = model->brush.data_nodes;
216 // node - recurse down the BSP tree
217 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
221 return -1; // ERROR: NAN bounding box!
222 // box is on one side of plane, take that path
223 node = node->children[sides-1];
227 // box crosses plane, take one path and remember the other
228 if (nodestackindex < 1024)
229 nodestack[nodestackindex++] = node->children[0];
230 node = node->children[1];
236 // leaf - check cluster bit
237 int clusterindex = ((mleaf_t *)node)->clusterindex;
238 if (CHECKPVSBIT(pvs, clusterindex))
240 // it is visible, return immediately with the news
245 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
249 if (nodestackindex < 1024)
250 nodestack[nodestackindex++] = node->children[0];
251 node = node->children[1];
256 // leaf - check cluster bit
257 int clusterindex = ((mleaf_t *)node)->clusterindex;
258 if (CHECKPVSBIT(pvs, clusterindex))
260 // it is visible, return immediately with the news
266 // nothing to see here, try another path we didn't take earlier
267 if (nodestackindex == 0)
269 node = nodestack[--nodestackindex];
275 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
277 int nodestackindex = 0;
278 mnode_t *node, *nodestack[1024];
279 if (!model->brush.num_leafs)
281 node = model->brush.data_nodes;
287 // node - recurse down the BSP tree
288 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
292 return -1; // ERROR: NAN bounding box!
293 // box is on one side of plane, take that path
294 node = node->children[sides-1];
298 // box crosses plane, take one path and remember the other
299 if (nodestackindex < 1024)
300 nodestack[nodestackindex++] = node->children[0];
301 node = node->children[1];
307 // leaf - check cluster bit
308 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
309 if (CHECKPVSBIT(pvs, clusterindex))
311 // it is visible, return immediately with the news
316 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
320 if (nodestackindex < 1024)
321 nodestack[nodestackindex++] = node->children[0];
322 node = node->children[1];
327 // leaf - check cluster bit
328 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
329 if (CHECKPVSBIT(pvs, clusterindex))
331 // it is visible, return immediately with the news
337 // nothing to see here, try another path we didn't take earlier
338 if (nodestackindex == 0)
340 node = nodestack[--nodestackindex];
346 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
348 int nodestackindex = 0;
349 mnode_t *node, *nodestack[1024];
350 if (!model->brush.num_leafs)
352 node = model->brush.data_nodes;
358 // node - recurse down the BSP tree
359 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
363 return -1; // ERROR: NAN bounding box!
364 // box is on one side of plane, take that path
365 node = node->children[sides-1];
369 // box crosses plane, take one path and remember the other
370 if (nodestackindex < 1024)
371 nodestack[nodestackindex++] = node->children[0];
372 node = node->children[1];
378 // leaf - check if it is visible
379 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
381 // it is visible, return immediately with the news
386 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
390 if (nodestackindex < 1024)
391 nodestack[nodestackindex++] = node->children[0];
392 node = node->children[1];
397 // leaf - check if it is visible
398 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
400 // it is visible, return immediately with the news
406 // nothing to see here, try another path we didn't take earlier
407 if (nodestackindex == 0)
409 node = nodestack[--nodestackindex];
415 typedef struct findnonsolidlocationinfo_s
418 vec3_t absmin, absmax;
424 findnonsolidlocationinfo_t;
426 static void Mod_Q1BSP_FindNonSolidLocation_r_Triangle(findnonsolidlocationinfo_t *info, msurface_t *surface, int k)
429 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
431 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
432 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
433 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
434 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
435 VectorSubtract(vert[1], vert[0], edge[0]);
436 VectorSubtract(vert[2], vert[1], edge[1]);
437 CrossProduct(edge[1], edge[0], facenormal);
438 if (facenormal[0] || facenormal[1] || facenormal[2])
440 VectorNormalize(facenormal);
441 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
442 if (f <= info->bestdist && f >= -info->bestdist)
444 VectorSubtract(vert[0], vert[2], edge[2]);
445 VectorNormalize(edge[0]);
446 VectorNormalize(edge[1]);
447 VectorNormalize(edge[2]);
448 CrossProduct(facenormal, edge[0], edgenormal[0]);
449 CrossProduct(facenormal, edge[1], edgenormal[1]);
450 CrossProduct(facenormal, edge[2], edgenormal[2]);
452 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
453 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
454 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
456 // we got lucky, the center is within the face
457 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
461 if (info->bestdist > dist)
463 info->bestdist = dist;
464 VectorScale(facenormal, (info->radius - -dist), info->nudge);
469 if (info->bestdist > dist)
471 info->bestdist = dist;
472 VectorScale(facenormal, (info->radius - dist), info->nudge);
478 // check which edge or vertex the center is nearest
479 for (i = 0;i < 3;i++)
481 f = DotProduct(info->center, edge[i]);
482 if (f >= DotProduct(vert[0], edge[i])
483 && f <= DotProduct(vert[1], edge[i]))
486 VectorMA(info->center, -f, edge[i], point);
487 dist = sqrt(DotProduct(point, point));
488 if (info->bestdist > dist)
490 info->bestdist = dist;
491 VectorScale(point, (info->radius / dist), info->nudge);
493 // skip both vertex checks
494 // (both are further away than this edge)
499 // not on edge, check first vertex of edge
500 VectorSubtract(info->center, vert[i], point);
501 dist = sqrt(DotProduct(point, point));
502 if (info->bestdist > dist)
504 info->bestdist = dist;
505 VectorScale(point, (info->radius / dist), info->nudge);
514 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
516 int surfacenum, k, *mark;
518 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
520 surface = info->model->data_surfaces + *mark;
521 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
523 if(surface->num_bboxstride)
526 cnt = (surface->num_triangles + surface->num_bboxstride - 1) / surface->num_bboxstride;
527 for(i = 0; i < cnt; ++i)
529 if(BoxesOverlap(surface->data_bbox6f + i * 6, surface->data_bbox6f + i * 6 + 3, info->absmin, info->absmax))
531 for(k = 0; k < surface->num_bboxstride; ++k)
533 tri = i * surface->num_bboxstride + k;
534 if(tri >= surface->num_triangles)
536 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, tri);
543 for (k = 0;k < surface->num_triangles;k++)
545 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, k);
552 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
556 float f = PlaneDiff(info->center, node->plane);
557 if (f >= -info->bestdist)
558 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
559 if (f <= info->bestdist)
560 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
564 if (((mleaf_t *)node)->numleafsurfaces)
565 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
569 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
572 findnonsolidlocationinfo_t info;
578 VectorCopy(in, info.center);
579 info.radius = radius;
584 VectorClear(info.nudge);
585 info.bestdist = radius;
586 VectorCopy(info.center, info.absmin);
587 VectorCopy(info.center, info.absmax);
588 info.absmin[0] -= info.radius + 1;
589 info.absmin[1] -= info.radius + 1;
590 info.absmin[2] -= info.radius + 1;
591 info.absmax[0] += info.radius + 1;
592 info.absmax[1] += info.radius + 1;
593 info.absmax[2] += info.radius + 1;
594 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
595 VectorAdd(info.center, info.nudge, info.center);
597 while (info.bestdist < radius && ++i < 10);
598 VectorCopy(info.center, out);
601 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
603 switch(nativecontents)
608 return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
610 return SUPERCONTENTS_WATER;
612 return SUPERCONTENTS_SLIME;
614 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
616 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
621 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
623 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
624 return CONTENTS_SOLID;
625 if (supercontents & SUPERCONTENTS_SKY)
627 if (supercontents & SUPERCONTENTS_LAVA)
628 return CONTENTS_LAVA;
629 if (supercontents & SUPERCONTENTS_SLIME)
630 return CONTENTS_SLIME;
631 if (supercontents & SUPERCONTENTS_WATER)
632 return CONTENTS_WATER;
633 return CONTENTS_EMPTY;
636 typedef struct RecursiveHullCheckTraceInfo_s
638 // the hull we're tracing through
641 // the trace structure to fill in
644 // start, end, and end - start (in model space)
649 RecursiveHullCheckTraceInfo_t;
651 // 1/32 epsilon to keep floating point happy
652 #define DIST_EPSILON (0.03125)
654 #define HULLCHECKSTATE_EMPTY 0
655 #define HULLCHECKSTATE_SOLID 1
656 #define HULLCHECKSTATE_DONE 2
658 extern cvar_t collision_prefernudgedfraction;
659 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
661 // status variables, these don't need to be saved on the stack when
662 // recursing... but are because this should be thread-safe
663 // (note: tracing against a bbox is not thread-safe, yet)
668 // variables that need to be stored on the stack when recursing
673 // LordHavoc: a goto! everyone flee in terror... :)
678 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
679 if (!t->trace->startfound)
681 t->trace->startfound = true;
682 t->trace->startsupercontents |= num;
684 if (num & SUPERCONTENTS_LIQUIDSMASK)
685 t->trace->inwater = true;
687 t->trace->inopen = true;
688 if (num & SUPERCONTENTS_SOLID)
689 t->trace->hittexture = &mod_q1bsp_texture_solid;
690 else if (num & SUPERCONTENTS_SKY)
691 t->trace->hittexture = &mod_q1bsp_texture_sky;
692 else if (num & SUPERCONTENTS_LAVA)
693 t->trace->hittexture = &mod_q1bsp_texture_lava;
694 else if (num & SUPERCONTENTS_SLIME)
695 t->trace->hittexture = &mod_q1bsp_texture_slime;
697 t->trace->hittexture = &mod_q1bsp_texture_water;
698 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
699 t->trace->hitsupercontents = num;
700 if (num & t->trace->hitsupercontentsmask)
702 // if the first leaf is solid, set startsolid
703 if (t->trace->allsolid)
704 t->trace->startsolid = true;
705 #if COLLISIONPARANOID >= 3
708 return HULLCHECKSTATE_SOLID;
712 t->trace->allsolid = false;
713 #if COLLISIONPARANOID >= 3
716 return HULLCHECKSTATE_EMPTY;
720 // find the point distances
721 node = t->hull->clipnodes + num;
723 plane = t->hull->planes + node->planenum;
726 t1 = p1[plane->type] - plane->dist;
727 t2 = p2[plane->type] - plane->dist;
731 t1 = DotProduct (plane->normal, p1) - plane->dist;
732 t2 = DotProduct (plane->normal, p2) - plane->dist;
739 #if COLLISIONPARANOID >= 3
742 num = node->children[1];
751 #if COLLISIONPARANOID >= 3
754 num = node->children[0];
760 // the line intersects, find intersection point
761 // LordHavoc: this uses the original trace for maximum accuracy
762 #if COLLISIONPARANOID >= 3
767 t1 = t->start[plane->type] - plane->dist;
768 t2 = t->end[plane->type] - plane->dist;
772 t1 = DotProduct (plane->normal, t->start) - plane->dist;
773 t2 = DotProduct (plane->normal, t->end) - plane->dist;
776 midf = t1 / (t1 - t2);
777 midf = bound(p1f, midf, p2f);
778 VectorMA(t->start, midf, t->dist, mid);
780 // recurse both sides, front side first
781 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
782 // if this side is not empty, return what it is (solid or done)
783 if (ret != HULLCHECKSTATE_EMPTY)
786 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
787 // if other side is not solid, return what it is (empty or done)
788 if (ret != HULLCHECKSTATE_SOLID)
791 // front is air and back is solid, this is the impact point...
794 t->trace->plane.dist = -plane->dist;
795 VectorNegate (plane->normal, t->trace->plane.normal);
799 t->trace->plane.dist = plane->dist;
800 VectorCopy (plane->normal, t->trace->plane.normal);
803 // calculate the true fraction
804 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
805 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
806 midf = t1 / (t1 - t2);
807 t->trace->realfraction = bound(0, midf, 1);
809 // calculate the return fraction which is nudged off the surface a bit
810 midf = (t1 - DIST_EPSILON) / (t1 - t2);
811 t->trace->fraction = bound(0, midf, 1);
813 if (collision_prefernudgedfraction.integer)
814 t->trace->realfraction = t->trace->fraction;
816 #if COLLISIONPARANOID >= 3
819 return HULLCHECKSTATE_DONE;
822 //#if COLLISIONPARANOID < 2
823 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
826 mclipnode_t *nodes = t->hull->clipnodes;
827 mplane_t *planes = t->hull->planes;
829 VectorCopy(t->start, point);
832 plane = planes + nodes[num].planenum;
833 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
835 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
836 t->trace->startsupercontents |= num;
837 if (num & SUPERCONTENTS_LIQUIDSMASK)
838 t->trace->inwater = true;
840 t->trace->inopen = true;
841 if (num & t->trace->hitsupercontentsmask)
843 t->trace->allsolid = t->trace->startsolid = true;
844 return HULLCHECKSTATE_SOLID;
848 t->trace->allsolid = t->trace->startsolid = false;
849 return HULLCHECKSTATE_EMPTY;
854 static void Mod_Q1BSP_TracePoint(struct model_s *model, int frame, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
856 RecursiveHullCheckTraceInfo_t rhc;
858 memset(&rhc, 0, sizeof(rhc));
859 memset(trace, 0, sizeof(trace_t));
861 rhc.trace->fraction = 1;
862 rhc.trace->realfraction = 1;
863 rhc.trace->allsolid = true;
864 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
865 VectorCopy(start, rhc.start);
866 VectorCopy(start, rhc.end);
867 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
870 static void Mod_Q1BSP_TraceLine(struct model_s *model, int frame, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
872 RecursiveHullCheckTraceInfo_t rhc;
874 if (VectorCompare(start, end))
876 Mod_Q1BSP_TracePoint(model, frame, trace, start, hitsupercontentsmask);
880 memset(&rhc, 0, sizeof(rhc));
881 memset(trace, 0, sizeof(trace_t));
883 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
884 rhc.trace->fraction = 1;
885 rhc.trace->realfraction = 1;
886 rhc.trace->allsolid = true;
887 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
888 VectorCopy(start, rhc.start);
889 VectorCopy(end, rhc.end);
890 VectorSubtract(rhc.end, rhc.start, rhc.dist);
891 #if COLLISIONPARANOID >= 2
892 Con_Printf("t(%f %f %f,%f %f %f)", rhc.start[0], rhc.start[1], rhc.start[2], rhc.end[0], rhc.end[1], rhc.end[2]);
893 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
898 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
899 memset(&testtrace, 0, sizeof(trace_t));
900 rhc.trace = &testtrace;
901 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
902 rhc.trace->fraction = 1;
903 rhc.trace->realfraction = 1;
904 rhc.trace->allsolid = true;
905 VectorCopy(test, rhc.start);
906 VectorCopy(test, rhc.end);
907 VectorClear(rhc.dist);
908 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
909 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
910 if (!trace->startsolid && testtrace.startsolid)
911 Con_Printf(" - ended in solid!\n");
915 if (VectorLength2(rhc.dist))
916 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
918 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
922 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)
924 // this function currently only supports same size start and end
926 RecursiveHullCheckTraceInfo_t rhc;
928 if (VectorCompare(boxmins, boxmaxs))
930 if (VectorCompare(start, end))
931 Mod_Q1BSP_TracePoint(model, frame, trace, start, hitsupercontentsmask);
933 Mod_Q1BSP_TraceLine(model, frame, trace, start, end, hitsupercontentsmask);
937 memset(&rhc, 0, sizeof(rhc));
938 memset(trace, 0, sizeof(trace_t));
940 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
941 rhc.trace->fraction = 1;
942 rhc.trace->realfraction = 1;
943 rhc.trace->allsolid = true;
944 VectorSubtract(boxmaxs, boxmins, boxsize);
946 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
947 else if (model->brush.ishlbsp)
949 // LordHavoc: this has to have a minor tolerance (the .1) because of
950 // minor float precision errors from the box being transformed around
951 if (boxsize[0] < 32.1)
953 if (boxsize[2] < 54) // pick the nearest of 36 or 72
954 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
956 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
959 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
963 // LordHavoc: this has to have a minor tolerance (the .1) because of
964 // minor float precision errors from the box being transformed around
965 if (boxsize[0] < 32.1)
966 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
968 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
970 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
971 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
972 VectorSubtract(rhc.end, rhc.start, rhc.dist);
973 #if COLLISIONPARANOID >= 2
974 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]);
975 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
980 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
981 memset(&testtrace, 0, sizeof(trace_t));
982 rhc.trace = &testtrace;
983 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
984 rhc.trace->fraction = 1;
985 rhc.trace->realfraction = 1;
986 rhc.trace->allsolid = true;
987 VectorCopy(test, rhc.start);
988 VectorCopy(test, rhc.end);
989 VectorClear(rhc.dist);
990 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
991 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
992 if (!trace->startsolid && testtrace.startsolid)
993 Con_Printf(" - ended in solid!\n");
997 if (VectorLength2(rhc.dist))
998 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1000 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1004 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
1006 int num = model->brushq1.hulls[0].firstclipnode;
1008 mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
1009 mplane_t *planes = model->brushq1.hulls[0].planes;
1012 plane = planes + nodes[num].planenum;
1013 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
1015 return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
1018 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)
1022 colplanef_t cbox_planes[6];
1023 cbox.supercontents = boxsupercontents;
1026 cbox.numtriangles = 0;
1027 cbox.planes = cbox_planes;
1029 cbox.elements = NULL;
1037 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];
1038 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];
1039 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];
1040 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];
1041 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];
1042 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];
1043 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1044 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1045 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1046 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1047 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1048 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1049 memset(trace, 0, sizeof(trace_t));
1050 trace->hitsupercontentsmask = hitsupercontentsmask;
1051 trace->fraction = 1;
1052 trace->realfraction = 1;
1053 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1055 RecursiveHullCheckTraceInfo_t rhc;
1056 static hull_t box_hull;
1057 static mclipnode_t box_clipnodes[6];
1058 static mplane_t box_planes[6];
1059 // fill in a default trace
1060 memset(&rhc, 0, sizeof(rhc));
1061 memset(trace, 0, sizeof(trace_t));
1062 //To keep everything totally uniform, bounding boxes are turned into small
1063 //BSP trees instead of being compared directly.
1064 // create a temp hull from bounding box sizes
1065 box_planes[0].dist = cmaxs[0] - mins[0];
1066 box_planes[1].dist = cmins[0] - maxs[0];
1067 box_planes[2].dist = cmaxs[1] - mins[1];
1068 box_planes[3].dist = cmins[1] - maxs[1];
1069 box_planes[4].dist = cmaxs[2] - mins[2];
1070 box_planes[5].dist = cmins[2] - maxs[2];
1071 #if COLLISIONPARANOID >= 3
1072 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]);
1075 if (box_hull.clipnodes == NULL)
1079 //Set up the planes and clipnodes so that the six floats of a bounding box
1080 //can just be stored out and get a proper hull_t structure.
1082 box_hull.clipnodes = box_clipnodes;
1083 box_hull.planes = box_planes;
1084 box_hull.firstclipnode = 0;
1085 box_hull.lastclipnode = 5;
1087 for (i = 0;i < 6;i++)
1089 box_clipnodes[i].planenum = i;
1093 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1095 box_clipnodes[i].children[side^1] = i + 1;
1097 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1099 box_planes[i].type = i>>1;
1100 box_planes[i].normal[i>>1] = 1;
1104 // trace a line through the generated clipping hull
1105 //rhc.boxsupercontents = boxsupercontents;
1106 rhc.hull = &box_hull;
1108 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1109 rhc.trace->fraction = 1;
1110 rhc.trace->realfraction = 1;
1111 rhc.trace->allsolid = true;
1112 VectorCopy(start, rhc.start);
1113 VectorCopy(end, rhc.end);
1114 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1115 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1116 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1117 if (rhc.trace->startsupercontents)
1118 rhc.trace->startsupercontents = boxsupercontents;
1122 void Collision_ClipTrace_Point(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, int hitsupercontentsmask, int boxsupercontents, int boxq3surfaceflags, texture_t *boxtexture)
1124 memset(trace, 0, sizeof(trace_t));
1125 trace->fraction = 1;
1126 trace->realfraction = 1;
1127 if (BoxesOverlap(start, start, cmins, cmaxs))
1129 trace->startsupercontents |= boxsupercontents;
1130 if (hitsupercontentsmask & boxsupercontents)
1132 trace->startsolid = true;
1133 trace->allsolid = true;
1138 static int Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
1141 double midf, mid[3];
1147 // find the point distances
1148 mplane_t *plane = node->plane;
1149 if (plane->type < 3)
1151 t1 = p1[plane->type] - plane->dist;
1152 t2 = p2[plane->type] - plane->dist;
1156 t1 = DotProduct (plane->normal, p1) - plane->dist;
1157 t2 = DotProduct (plane->normal, p2) - plane->dist;
1164 node = node->children[1];
1173 node = node->children[0];
1179 midf = t1 / (t1 - t2);
1180 VectorLerp(p1, midf, p2, mid);
1182 // recurse both sides, front side first
1183 // return 2 if empty is followed by solid (hit something)
1184 // do not return 2 if both are solid or both empty,
1185 // or if start is solid and end is empty
1186 // as these degenerate cases usually indicate the eye is in solid and
1187 // should see the target point anyway
1188 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
1191 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
1196 return ((mleaf_t *)node)->clusterindex < 0;
1199 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1201 // this function currently only supports same size start and end
1202 double tracestart[3], traceend[3];
1203 VectorCopy(start, tracestart);
1204 VectorCopy(end, traceend);
1205 return Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend) != 2;
1208 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)
1212 float mid, distz = endz - startz;
1216 return false; // didn't hit anything
1218 switch (node->plane->type)
1221 node = node->children[x < node->plane->dist];
1224 node = node->children[y < node->plane->dist];
1227 side = startz < node->plane->dist;
1228 if ((endz < node->plane->dist) == side)
1230 node = node->children[side];
1233 // found an intersection
1234 mid = node->plane->dist;
1237 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1238 front += startz * node->plane->normal[2];
1239 back += endz * node->plane->normal[2];
1240 side = front < node->plane->dist;
1241 if ((back < node->plane->dist) == side)
1243 node = node->children[side];
1246 // found an intersection
1247 mid = startz + distz * (front - node->plane->dist) / (front - back);
1251 // go down front side
1252 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1253 return true; // hit something
1256 // check for impact on this node
1257 if (node->numsurfaces)
1259 int i, dsi, dti, lmwidth, lmheight;
1261 msurface_t *surface;
1262 unsigned char *lightmap;
1263 int maps, line3, size3;
1266 float scale, w, w00, w01, w10, w11;
1268 surface = model->data_surfaces + node->firstsurface;
1269 for (i = 0;i < node->numsurfaces;i++, surface++)
1271 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1272 continue; // no lightmaps
1274 // location we want to sample in the lightmap
1275 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;
1276 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;
1281 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1282 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1285 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1287 // calculate bilinear interpolation factors
1288 // and also multiply by fixedpoint conversion factors
1291 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1292 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1293 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1294 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1296 // values for pointer math
1297 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1298 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1300 // look up the pixel
1301 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1303 // bilinear filter each lightmap style, and sum them
1304 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1306 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1307 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1308 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1309 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1310 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1314 return true; // success
1319 // go down back side
1320 node = node->children[side ^ 1];
1322 distz = endz - startz;
1327 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1329 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1330 VectorSet(diffusenormal, 0, 0, 1);
1332 if (!model->brushq1.lightdata)
1334 VectorSet(ambientcolor, 1, 1, 1);
1335 VectorSet(diffusecolor, 0, 0, 0);
1339 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);
1342 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1345 unsigned char *outstart = out;
1346 while (out < outend)
1350 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));
1360 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));
1363 for (c = *in++;c > 0;c--)
1367 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));
1378 R_Q1BSP_LoadSplitSky
1380 A sky texture is 256*128, with the right side being a masked overlay
1383 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1386 unsigned solidpixels[128*128], alphapixels[128*128];
1388 // allocate a texture pool if we need it
1389 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1390 loadmodel->texturepool = R_AllocTexturePool();
1392 if (bytesperpixel == 4)
1394 for (i = 0;i < 128;i++)
1396 for (j = 0;j < 128;j++)
1398 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1399 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1405 // make an average value for the back to avoid
1406 // a fringe on the top level
1415 for (i = 0;i < 128;i++)
1417 for (j = 0;j < 128;j++)
1419 p = src[i*256 + j + 128];
1420 r += palette_rgb[p][0];
1421 g += palette_rgb[p][1];
1422 b += palette_rgb[p][2];
1425 bgra.b[2] = r/(128*128);
1426 bgra.b[1] = g/(128*128);
1427 bgra.b[0] = b/(128*128);
1429 for (i = 0;i < 128;i++)
1431 for (j = 0;j < 128;j++)
1433 solidpixels[(i*128) + j] = palette_bgra_complete[src[i*256 + j + 128]];
1435 alphapixels[(i*128) + j] = p ? palette_bgra_complete[p] : bgra.i;
1440 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1441 loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1444 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1446 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1447 skinframe_t *skinframe;
1449 texture_t *tx, *tx2, *anims[10], *altanims[10];
1451 unsigned char *data, *mtdata;
1453 char mapname[MAX_QPATH], name[MAX_QPATH];
1454 unsigned char zero[4];
1456 memset(zero, 0, sizeof(zero));
1458 loadmodel->data_textures = NULL;
1460 // add two slots for notexture walls and notexture liquids
1463 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1464 m->nummiptex = LittleLong (m->nummiptex);
1465 loadmodel->num_textures = m->nummiptex + 2;
1466 loadmodel->num_texturesperskin = loadmodel->num_textures;
1471 loadmodel->num_textures = 2;
1472 loadmodel->num_texturesperskin = loadmodel->num_textures;
1475 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1477 // fill out all slots with notexture
1478 if (cls.state != ca_dedicated)
1479 skinframe = R_SkinFrame_LoadMissing();
1482 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1484 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1487 if (cls.state != ca_dedicated)
1489 tx->numskinframes = 1;
1490 tx->skinframerate = 1;
1491 tx->skinframes[0] = skinframe;
1492 tx->currentskinframe = tx->skinframes[0];
1494 tx->basematerialflags = MATERIALFLAG_WALL;
1495 if (i == loadmodel->num_textures - 1)
1497 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1498 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1499 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1503 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1504 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1506 tx->currentframe = tx;
1508 // clear water settings
1511 tx->refractfactor = 1;
1512 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1513 tx->reflectfactor = 1;
1514 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1515 tx->r_water_wateralpha = 1;
1520 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1524 s = loadmodel->name;
1525 if (!strncasecmp(s, "maps/", 5))
1527 FS_StripExtension(s, mapname, sizeof(mapname));
1529 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1531 // LordHavoc: mostly rewritten map texture loader
1532 for (i = 0;i < m->nummiptex;i++)
1534 dofs[i] = LittleLong(dofs[i]);
1535 if (r_nosurftextures.integer)
1539 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1542 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1544 // copy name, but only up to 16 characters
1545 // (the output buffer can hold more than this, but the input buffer is
1547 for (j = 0;j < 16 && dmiptex->name[j];j++)
1548 name[j] = dmiptex->name[j];
1553 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1554 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1557 mtwidth = LittleLong(dmiptex->width);
1558 mtheight = LittleLong(dmiptex->height);
1560 j = LittleLong(dmiptex->offsets[0]);
1564 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1566 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1569 mtdata = (unsigned char *)dmiptex + j;
1572 if ((mtwidth & 15) || (mtheight & 15))
1573 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1575 // LordHavoc: force all names to lowercase
1576 for (j = 0;name[j];j++)
1577 if (name[j] >= 'A' && name[j] <= 'Z')
1578 name[j] += 'a' - 'A';
1580 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1583 tx = loadmodel->data_textures + i;
1584 strlcpy(tx->name, name, sizeof(tx->name));
1585 tx->width = mtwidth;
1586 tx->height = mtheight;
1588 if (tx->name[0] == '*')
1590 if (!strncmp(tx->name, "*lava", 5))
1592 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1593 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1595 else if (!strncmp(tx->name, "*slime", 6))
1597 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1598 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1602 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1603 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1606 else if (!strncmp(tx->name, "sky", 3))
1608 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1609 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1613 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1614 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1617 if (cls.state != ca_dedicated)
1619 // LordHavoc: HL sky textures are entirely different than quake
1620 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1622 data = loadimagepixelsbgra(tx->name, false, false);
1623 if (data && image_width == 256 && image_height == 128)
1625 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1628 else if (mtdata != NULL)
1629 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1633 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);
1635 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);
1638 // did not find external texture, load it from the bsp or wad3
1639 if (loadmodel->brush.ishlbsp)
1641 // internal texture overrides wad
1642 unsigned char *pixels, *freepixels;
1643 pixels = freepixels = NULL;
1645 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1647 pixels = freepixels = W_GetTextureBGRA(tx->name);
1650 tx->width = image_width;
1651 tx->height = image_height;
1652 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1655 Mem_Free(freepixels);
1657 else if (mtdata) // texture included
1658 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);
1660 // if skinframe is still NULL the "missing" texture will be used
1662 tx->skinframes[0] = skinframe;
1665 tx->basematerialflags = MATERIALFLAG_WALL;
1666 if (tx->name[0] == '*')
1668 // LordHavoc: some turbulent textures should not be affected by wateralpha
1669 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1671 // replace the texture with transparent black
1672 Vector4Set(zero, 128, 128, 128, 128);
1673 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1674 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1676 else if (!strncmp(tx->name,"*lava",5)
1677 || !strncmp(tx->name,"*teleport",9)
1678 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1679 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1681 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1682 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1683 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1685 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1687 // replace the texture with black
1688 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1689 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1691 else if (!strncmp(tx->name, "sky", 3))
1692 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1693 else if (!strcmp(tx->name, "caulk"))
1694 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1695 else if (tx->skinframes[0] && tx->skinframes[0]->fog)
1696 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1698 // start out with no animation
1699 tx->currentframe = tx;
1700 tx->currentskinframe = tx->skinframes[0];
1704 // sequence the animations
1705 for (i = 0;i < m->nummiptex;i++)
1707 tx = loadmodel->data_textures + i;
1708 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1710 if (tx->anim_total[0] || tx->anim_total[1])
1711 continue; // already sequenced
1713 // find the number of frames in the animation
1714 memset(anims, 0, sizeof(anims));
1715 memset(altanims, 0, sizeof(altanims));
1717 for (j = i;j < m->nummiptex;j++)
1719 tx2 = loadmodel->data_textures + j;
1720 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1724 if (num >= '0' && num <= '9')
1725 anims[num - '0'] = tx2;
1726 else if (num >= 'a' && num <= 'j')
1727 altanims[num - 'a'] = tx2;
1729 Con_Printf("Bad animating texture %s\n", tx->name);
1733 for (j = 0;j < 10;j++)
1740 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1743 for (j = 0;j < max;j++)
1747 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1751 for (j = 0;j < altmax;j++)
1755 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1764 // if there is no alternate animation, duplicate the primary
1765 // animation into the alternate
1767 for (k = 0;k < 10;k++)
1768 altanims[k] = anims[k];
1771 // link together the primary animation
1772 for (j = 0;j < max;j++)
1775 tx2->animated = true;
1776 tx2->anim_total[0] = max;
1777 tx2->anim_total[1] = altmax;
1778 for (k = 0;k < 10;k++)
1780 tx2->anim_frames[0][k] = anims[k];
1781 tx2->anim_frames[1][k] = altanims[k];
1785 // if there really is an alternate anim...
1786 if (anims[0] != altanims[0])
1788 // link together the alternate animation
1789 for (j = 0;j < altmax;j++)
1792 tx2->animated = true;
1793 // the primary/alternate are reversed here
1794 tx2->anim_total[0] = altmax;
1795 tx2->anim_total[1] = max;
1796 for (k = 0;k < 10;k++)
1798 tx2->anim_frames[0][k] = altanims[k];
1799 tx2->anim_frames[1][k] = anims[k];
1806 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1809 unsigned char *in, *out, *data, d;
1810 char litfilename[MAX_QPATH];
1811 char dlitfilename[MAX_QPATH];
1812 fs_offset_t filesize;
1813 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1815 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1816 for (i=0; i<l->filelen; i++)
1817 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1819 else // LordHavoc: bsp version 29 (normal white lighting)
1821 // LordHavoc: hope is not lost yet, check for a .lit file to load
1822 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1823 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1824 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1825 strlcat (litfilename, ".lit", sizeof (litfilename));
1826 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1827 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1830 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1832 i = LittleLong(((int *)data)[1]);
1835 if (developer_loading.integer)
1836 Con_Printf("loaded %s\n", litfilename);
1837 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1838 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1840 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1843 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1845 i = LittleLong(((int *)data)[1]);
1848 if (developer_loading.integer)
1849 Con_Printf("loaded %s\n", dlitfilename);
1850 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1851 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1852 loadmodel->brushq3.deluxemapping_modelspace = false;
1853 loadmodel->brushq3.deluxemapping = true;
1862 Con_Printf("Unknown .lit file version (%d)\n", i);
1864 else if (filesize == 8)
1865 Con_Print("Empty .lit file, ignoring\n");
1867 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1874 // LordHavoc: oh well, expand the white lighting data
1877 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1878 in = mod_base + l->fileofs;
1879 out = loadmodel->brushq1.lightdata;
1880 for (i = 0;i < l->filelen;i++)
1890 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1892 loadmodel->brushq1.num_compressedpvs = 0;
1893 loadmodel->brushq1.data_compressedpvs = NULL;
1896 loadmodel->brushq1.num_compressedpvs = l->filelen;
1897 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1898 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1901 // used only for HalfLife maps
1902 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1904 char key[128], value[4096];
1908 if (!COM_ParseToken_Simple(&data, false, false))
1910 if (com_token[0] != '{')
1914 if (!COM_ParseToken_Simple(&data, false, false))
1916 if (com_token[0] == '}')
1917 break; // end of worldspawn
1918 if (com_token[0] == '_')
1919 strlcpy(key, com_token + 1, sizeof(key));
1921 strlcpy(key, com_token, sizeof(key));
1922 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1923 key[strlen(key)-1] = 0;
1924 if (!COM_ParseToken_Simple(&data, false, false))
1926 dpsnprintf(value, sizeof(value), "%s", com_token);
1927 if (!strcmp("wad", key)) // for HalfLife maps
1929 if (loadmodel->brush.ishlbsp)
1932 for (i = 0;i < (int)sizeof(value);i++)
1933 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1937 for (;i < (int)sizeof(value);i++)
1939 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1940 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1942 else if (value[i] == ';' || value[i] == 0)
1946 W_LoadTextureWadFile(&value[j], false);
1958 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1960 loadmodel->brush.entities = NULL;
1963 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
1964 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1965 loadmodel->brush.entities[l->filelen] = 0;
1966 if (loadmodel->brush.ishlbsp)
1967 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1971 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1977 in = (dvertex_t *)(mod_base + l->fileofs);
1978 if (l->filelen % sizeof(*in))
1979 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1980 count = l->filelen / sizeof(*in);
1981 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1983 loadmodel->brushq1.vertexes = out;
1984 loadmodel->brushq1.numvertexes = count;
1986 for ( i=0 ; i<count ; i++, in++, out++)
1988 out->position[0] = LittleFloat(in->point[0]);
1989 out->position[1] = LittleFloat(in->point[1]);
1990 out->position[2] = LittleFloat(in->point[2]);
1994 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1995 // can be used for this
1997 int SB_ReadInt (unsigned char **buffer)
2000 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
2006 float SB_ReadFloat (unsigned char **buffer)
2014 u.i = SB_ReadInt (buffer);
2018 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
2020 unsigned char *index;
2024 index = (unsigned char *)(mod_base + l->fileofs);
2025 if (l->filelen % (48+4*hullinfo->filehulls))
2026 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
2028 count = l->filelen / (48+4*hullinfo->filehulls);
2029 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
2031 loadmodel->brushq1.submodels = out;
2032 loadmodel->brush.numsubmodels = count;
2034 for (i = 0; i < count; i++, out++)
2036 // spread out the mins / maxs by a pixel
2037 out->mins[0] = SB_ReadFloat (&index) - 1;
2038 out->mins[1] = SB_ReadFloat (&index) - 1;
2039 out->mins[2] = SB_ReadFloat (&index) - 1;
2040 out->maxs[0] = SB_ReadFloat (&index) + 1;
2041 out->maxs[1] = SB_ReadFloat (&index) + 1;
2042 out->maxs[2] = SB_ReadFloat (&index) + 1;
2043 out->origin[0] = SB_ReadFloat (&index);
2044 out->origin[1] = SB_ReadFloat (&index);
2045 out->origin[2] = SB_ReadFloat (&index);
2046 for (j = 0; j < hullinfo->filehulls; j++)
2047 out->headnode[j] = SB_ReadInt (&index);
2048 out->visleafs = SB_ReadInt (&index);
2049 out->firstface = SB_ReadInt (&index);
2050 out->numfaces = SB_ReadInt (&index);
2054 static void Mod_Q1BSP_LoadEdges(lump_t *l)
2060 in = (dedge_t *)(mod_base + l->fileofs);
2061 if (l->filelen % sizeof(*in))
2062 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2063 count = l->filelen / sizeof(*in);
2064 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2066 loadmodel->brushq1.edges = out;
2067 loadmodel->brushq1.numedges = count;
2069 for ( i=0 ; i<count ; i++, in++, out++)
2071 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2072 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2073 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2075 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);
2076 if(!loadmodel->brushq1.numvertexes)
2077 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2085 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2089 int i, j, k, count, miptex;
2091 in = (texinfo_t *)(mod_base + l->fileofs);
2092 if (l->filelen % sizeof(*in))
2093 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2094 count = l->filelen / sizeof(*in);
2095 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2097 loadmodel->brushq1.texinfo = out;
2098 loadmodel->brushq1.numtexinfo = count;
2100 for (i = 0;i < count;i++, in++, out++)
2102 for (k = 0;k < 2;k++)
2103 for (j = 0;j < 4;j++)
2104 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2106 miptex = LittleLong(in->miptex);
2107 out->flags = LittleLong(in->flags);
2109 out->texture = NULL;
2110 if (loadmodel->data_textures)
2112 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2113 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2115 out->texture = loadmodel->data_textures + miptex;
2117 if (out->flags & TEX_SPECIAL)
2119 // if texture chosen is NULL or the shader needs a lightmap,
2120 // force to notexture water shader
2121 if (out->texture == NULL)
2122 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2126 // if texture chosen is NULL, force to notexture
2127 if (out->texture == NULL)
2128 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2134 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2139 mins[0] = mins[1] = mins[2] = 9999;
2140 maxs[0] = maxs[1] = maxs[2] = -9999;
2142 for (i = 0;i < numverts;i++)
2144 for (j = 0;j < 3;j++, v++)
2154 #define MAX_SUBDIVPOLYTRIANGLES 4096
2155 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2157 static int subdivpolyverts, subdivpolytriangles;
2158 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2159 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2161 static int subdivpolylookupvert(vec3_t v)
2164 for (i = 0;i < subdivpolyverts;i++)
2165 if (subdivpolyvert[i][0] == v[0]
2166 && subdivpolyvert[i][1] == v[1]
2167 && subdivpolyvert[i][2] == v[2])
2169 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2170 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2171 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2172 return subdivpolyverts++;
2175 static void SubdividePolygon(int numverts, float *verts)
2177 int i, i1, i2, i3, f, b, c, p;
2178 vec3_t mins, maxs, front[256], back[256];
2179 float m, *pv, *cv, dist[256], frac;
2182 Host_Error("SubdividePolygon: ran out of verts in buffer");
2184 BoundPoly(numverts, verts, mins, maxs);
2186 for (i = 0;i < 3;i++)
2188 m = (mins[i] + maxs[i]) * 0.5;
2189 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2190 if (maxs[i] - m < 8)
2192 if (m - mins[i] < 8)
2196 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2197 dist[c] = cv[i] - m;
2200 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2204 VectorCopy(pv, front[f]);
2209 VectorCopy(pv, back[b]);
2212 if (dist[p] == 0 || dist[c] == 0)
2214 if ((dist[p] > 0) != (dist[c] > 0) )
2217 frac = dist[p] / (dist[p] - dist[c]);
2218 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2219 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2220 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2226 SubdividePolygon(f, front[0]);
2227 SubdividePolygon(b, back[0]);
2231 i1 = subdivpolylookupvert(verts);
2232 i2 = subdivpolylookupvert(verts + 3);
2233 for (i = 2;i < numverts;i++)
2235 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2237 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2241 i3 = subdivpolylookupvert(verts + i * 3);
2242 subdivpolyindex[subdivpolytriangles][0] = i1;
2243 subdivpolyindex[subdivpolytriangles][1] = i2;
2244 subdivpolyindex[subdivpolytriangles][2] = i3;
2246 subdivpolytriangles++;
2250 //Breaks a polygon up along axial 64 unit
2251 //boundaries so that turbulent and sky warps
2252 //can be done reasonably.
2253 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2259 subdivpolytriangles = 0;
2260 subdivpolyverts = 0;
2261 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2262 if (subdivpolytriangles < 1)
2263 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2265 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2266 mesh->num_vertices = subdivpolyverts;
2267 mesh->num_triangles = subdivpolytriangles;
2268 mesh->vertex = (surfvertex_t *)(mesh + 1);
2269 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2270 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2272 for (i = 0;i < mesh->num_triangles;i++)
2273 for (j = 0;j < 3;j++)
2274 mesh->index[i*3+j] = subdivpolyindex[i][j];
2276 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2278 VectorCopy(subdivpolyvert[i], v->v);
2279 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2280 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2285 /* Maximum size of a single LM */
2286 #define MAX_SINGLE_LM_SIZE 256
2294 struct alloc_lm_state
2297 struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2300 static void init_alloc_lm_state (struct alloc_lm_state* state)
2304 state->currentY = 0;
2305 for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2307 state->rows[r].currentX = 0;
2308 state->rows[r].rowY = -1;
2312 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2314 struct alloc_lm_row* row;
2317 row = &(state->rows[blockheight]);
2318 if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2320 if (state->currentY + blockheight <= totalheight)
2322 row->rowY = state->currentY;
2324 state->currentY += blockheight;
2328 /* See if we can stuff the block into a higher row */
2330 for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2332 if ((state->rows[r].rowY >= 0)
2333 && (state->rows[r].currentX + blockwidth <= totalwidth))
2335 row = &(state->rows[r]);
2339 if (row == NULL) return false;
2343 *outx = row->currentX;
2344 row->currentX += blockwidth;
2349 extern cvar_t gl_max_size;
2350 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2353 msurface_t *surface;
2354 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2355 float texmins[2], texmaxs[2], val;
2356 rtexture_t *lightmaptexture, *deluxemaptexture;
2358 in = (dface_t *)(mod_base + l->fileofs);
2359 if (l->filelen % sizeof(*in))
2360 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2361 count = l->filelen / sizeof(*in);
2362 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2363 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2365 loadmodel->num_surfaces = count;
2367 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2371 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2373 numedges = (unsigned short)LittleShort(in->numedges);
2374 totalverts += numedges;
2375 totaltris += numedges - 2;
2378 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2380 lightmaptexture = NULL;
2381 deluxemaptexture = r_texture_blanknormalmap;
2383 lightmapsize = max(256, gl_max_size.integer);
2384 totallightmapsamples = 0;
2388 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2390 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2392 // FIXME: validate edges, texinfo, etc?
2393 firstedge = LittleLong(in->firstedge);
2394 numedges = (unsigned short)LittleShort(in->numedges);
2395 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)
2396 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2397 i = (unsigned short)LittleShort(in->texinfo);
2398 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2399 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2400 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2401 surface->texture = surface->lightmapinfo->texinfo->texture;
2403 planenum = (unsigned short)LittleShort(in->planenum);
2404 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2405 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2407 //surface->flags = surface->texture->flags;
2408 //if (LittleShort(in->side))
2409 // surface->flags |= SURF_PLANEBACK;
2410 //surface->plane = loadmodel->brush.data_planes + planenum;
2412 surface->num_firstvertex = totalverts;
2413 surface->num_vertices = numedges;
2414 surface->num_firsttriangle = totaltris;
2415 surface->num_triangles = numedges - 2;
2416 totalverts += numedges;
2417 totaltris += numedges - 2;
2419 // convert edges back to a normal polygon
2420 for (i = 0;i < surface->num_vertices;i++)
2422 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2424 // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2426 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2428 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2429 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2430 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2431 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2432 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2433 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2434 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2435 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2438 for (i = 0;i < surface->num_triangles;i++)
2440 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2441 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2442 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2445 // compile additional data about the surface geometry
2446 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);
2447 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);
2448 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2450 // generate surface extents information
2451 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2452 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2453 for (i = 1;i < surface->num_vertices;i++)
2455 for (j = 0;j < 2;j++)
2457 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2458 texmins[j] = min(texmins[j], val);
2459 texmaxs[j] = max(texmaxs[j], val);
2462 for (i = 0;i < 2;i++)
2464 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2465 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2468 smax = surface->lightmapinfo->extents[0] >> 4;
2469 tmax = surface->lightmapinfo->extents[1] >> 4;
2470 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2471 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2474 for (i = 0;i < MAXLIGHTMAPS;i++)
2475 surface->lightmapinfo->styles[i] = in->styles[i];
2476 surface->lightmaptexture = NULL;
2477 surface->deluxemaptexture = r_texture_blanknormalmap;
2478 i = LittleLong(in->lightofs);
2481 surface->lightmapinfo->samples = NULL;
2483 // give non-lightmapped water a 1x white lightmap
2484 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2486 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2487 surface->lightmapinfo->styles[0] = 0;
2488 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2492 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2493 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2494 else // LordHavoc: white lighting (bsp version 29)
2496 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2497 if (loadmodel->brushq1.nmaplightdata)
2498 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2501 // check if we should apply a lightmap to this
2502 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2504 if (ssize > 256 || tsize > 256)
2505 Host_Error("Bad surface extents");
2507 if (lightmapsize < ssize)
2508 lightmapsize = ssize;
2509 if (lightmapsize < tsize)
2510 lightmapsize = tsize;
2512 totallightmapsamples += ssize*tsize;
2514 // force lightmap upload on first time seeing the surface
2516 // additionally this is used by the later code to see if a
2517 // lightmap is needed on this surface (rather than duplicating the
2519 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2523 // small maps (such as ammo boxes especially) don't need big lightmap
2524 // textures, so this code tries to guess a good size based on
2525 // totallightmapsamples (size of the lightmaps lump basically), as well as
2526 // trying to max out the gl_max_size if there is a lot of lightmap data to
2528 // additionally, never choose a lightmapsize that is smaller than the
2529 // largest surface encountered (as it would fail)
2531 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2534 // now that we've decided the lightmap texture size, we can do the rest
2535 if (cls.state != ca_dedicated)
2537 int stainmapsize = 0;
2538 struct alloc_lm_state allocState;
2540 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2542 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2543 float u, v, ubase, vbase, uscale, vscale;
2545 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2548 smax = surface->lightmapinfo->extents[0] >> 4;
2549 tmax = surface->lightmapinfo->extents[1] >> 4;
2550 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2551 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2552 stainmapsize += ssize * tsize * 3;
2554 if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2556 // allocate a texture pool if we need it
2557 if (loadmodel->texturepool == NULL)
2558 loadmodel->texturepool = R_AllocTexturePool();
2559 // could not find room, make a new lightmap
2560 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2561 if (loadmodel->brushq1.nmaplightdata)
2562 deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2564 init_alloc_lm_state (&allocState);
2565 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2567 surface->lightmaptexture = lightmaptexture;
2568 surface->deluxemaptexture = deluxemaptexture;
2569 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2570 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2572 uscale = 1.0f / (float)lightmapsize;
2573 vscale = 1.0f / (float)lightmapsize;
2574 ubase = lightmapx * uscale;
2575 vbase = lightmapy * vscale;
2577 for (i = 0;i < surface->num_vertices;i++)
2579 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);
2580 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);
2581 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2582 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2583 // LordHavoc: calc lightmap data offset for vertex lighting to use
2586 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2590 if (cl_stainmaps.integer)
2592 // allocate stainmaps for permanent marks on walls and clear white
2593 unsigned char *stainsamples = NULL;
2594 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2595 memset(stainsamples, 255, stainmapsize);
2597 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2599 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2601 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2602 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2603 surface->lightmapinfo->stainsamples = stainsamples;
2604 stainsamples += ssize * tsize * 3;
2609 // generate ushort elements array if possible
2610 if (loadmodel->surfmesh.data_element3s)
2611 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2612 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2615 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2618 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2619 node->parent = parent;
2622 // this is a node, recurse to children
2623 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2624 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2625 // combine supercontents of children
2626 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2631 mleaf_t *leaf = (mleaf_t *)node;
2632 // if this is a leaf, calculate supercontents mask from all collidable
2633 // primitives in the leaf (brushes and collision surfaces)
2634 // also flag if the leaf contains any collision surfaces
2635 leaf->combinedsupercontents = 0;
2636 // combine the supercontents values of all brushes in this leaf
2637 for (j = 0;j < leaf->numleafbrushes;j++)
2638 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2639 // check if this leaf contains any collision surfaces (q3 patches)
2640 for (j = 0;j < leaf->numleafsurfaces;j++)
2642 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2643 if (surface->num_collisiontriangles)
2645 leaf->containscollisionsurfaces = true;
2646 leaf->combinedsupercontents |= surface->texture->supercontents;
2652 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2658 in = (dnode_t *)(mod_base + l->fileofs);
2659 if (l->filelen % sizeof(*in))
2660 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2661 count = l->filelen / sizeof(*in);
2662 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2664 loadmodel->brush.data_nodes = out;
2665 loadmodel->brush.num_nodes = count;
2667 for ( i=0 ; i<count ; i++, in++, out++)
2669 for (j=0 ; j<3 ; j++)
2671 out->mins[j] = LittleShort(in->mins[j]);
2672 out->maxs[j] = LittleShort(in->maxs[j]);
2675 p = LittleLong(in->planenum);
2676 out->plane = loadmodel->brush.data_planes + p;
2678 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2679 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2681 for (j=0 ; j<2 ; j++)
2683 // LordHavoc: this code supports broken bsp files produced by
2684 // arguire qbsp which can produce more than 32768 nodes, any value
2685 // below count is assumed to be a node number, any other value is
2686 // assumed to be a leaf number
2687 p = (unsigned short)LittleShort(in->children[j]);
2690 if (p < loadmodel->brush.num_nodes)
2691 out->children[j] = loadmodel->brush.data_nodes + p;
2694 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2695 // map it to the solid leaf
2696 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2701 // note this uses 65535 intentionally, -1 is leaf 0
2703 if (p < loadmodel->brush.num_leafs)
2704 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2707 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2708 // map it to the solid leaf
2709 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2715 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2718 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2724 in = (dleaf_t *)(mod_base + l->fileofs);
2725 if (l->filelen % sizeof(*in))
2726 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2727 count = l->filelen / sizeof(*in);
2728 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2730 loadmodel->brush.data_leafs = out;
2731 loadmodel->brush.num_leafs = count;
2732 // get visleafs from the submodel data
2733 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2734 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2735 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2736 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2738 for ( i=0 ; i<count ; i++, in++, out++)
2740 for (j=0 ; j<3 ; j++)
2742 out->mins[j] = LittleShort(in->mins[j]);
2743 out->maxs[j] = LittleShort(in->maxs[j]);
2746 // FIXME: this function could really benefit from some error checking
2748 out->contents = LittleLong(in->contents);
2750 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2751 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2752 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2754 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);
2755 out->firstleafsurface = NULL;
2756 out->numleafsurfaces = 0;
2759 out->clusterindex = i - 1;
2760 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2761 out->clusterindex = -1;
2763 p = LittleLong(in->visofs);
2764 // ignore visofs errors on leaf 0 (solid)
2765 if (p >= 0 && out->clusterindex >= 0)
2767 if (p >= loadmodel->brushq1.num_compressedpvs)
2768 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2770 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);
2773 for (j = 0;j < 4;j++)
2774 out->ambient_sound_level[j] = in->ambient_level[j];
2776 // FIXME: Insert caustics here
2780 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2784 const unsigned char *pvs;
2785 // if there's no vis data, assume supported (because everything is visible all the time)
2786 if (!loadmodel->brush.data_pvsclusters)
2788 // check all liquid leafs to see if they can see into empty leafs, if any
2789 // can we can assume this map supports r_wateralpha
2790 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2792 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2794 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2795 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2796 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2803 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2810 in = (dclipnode_t *)(mod_base + l->fileofs);
2811 if (l->filelen % sizeof(*in))
2812 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2813 count = l->filelen / sizeof(*in);
2814 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2816 loadmodel->brushq1.clipnodes = out;
2817 loadmodel->brushq1.numclipnodes = count;
2819 for (i = 1; i < MAX_MAP_HULLS; i++)
2821 hull = &loadmodel->brushq1.hulls[i];
2822 hull->clipnodes = out;
2823 hull->firstclipnode = 0;
2824 hull->lastclipnode = count-1;
2825 hull->planes = loadmodel->brush.data_planes;
2826 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2827 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2828 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2829 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2830 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2831 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2832 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2835 for (i=0 ; i<count ; i++, out++, in++)
2837 out->planenum = LittleLong(in->planenum);
2838 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2839 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2840 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2841 if (out->children[0] >= count)
2842 out->children[0] -= 65536;
2843 if (out->children[1] >= count)
2844 out->children[1] -= 65536;
2845 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2846 Host_Error("Corrupt clipping hull(out of range planenum)");
2850 //Duplicate the drawing hull structure as a clipping hull
2851 static void Mod_Q1BSP_MakeHull0(void)
2858 hull = &loadmodel->brushq1.hulls[0];
2860 in = loadmodel->brush.data_nodes;
2861 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2863 hull->clipnodes = out;
2864 hull->firstclipnode = 0;
2865 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2866 hull->planes = loadmodel->brush.data_planes;
2868 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2870 out->planenum = in->plane - loadmodel->brush.data_planes;
2871 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2872 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2876 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2881 in = (short *)(mod_base + l->fileofs);
2882 if (l->filelen % sizeof(*in))
2883 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2884 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2885 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2887 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2889 j = (unsigned short) LittleShort(in[i]);
2890 if (j >= loadmodel->num_surfaces)
2891 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2892 loadmodel->brush.data_leafsurfaces[i] = j;
2896 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2901 in = (int *)(mod_base + l->fileofs);
2902 if (l->filelen % sizeof(*in))
2903 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2904 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2905 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2907 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2908 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2912 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2918 in = (dplane_t *)(mod_base + l->fileofs);
2919 if (l->filelen % sizeof(*in))
2920 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2922 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2923 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2925 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2927 out->normal[0] = LittleFloat(in->normal[0]);
2928 out->normal[1] = LittleFloat(in->normal[1]);
2929 out->normal[2] = LittleFloat(in->normal[2]);
2930 out->dist = LittleFloat(in->dist);
2936 static void Mod_Q1BSP_LoadMapBrushes(void)
2940 int submodel, numbrushes;
2941 qboolean firstbrush;
2942 char *text, *maptext;
2943 char mapfilename[MAX_QPATH];
2944 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2945 strlcat (mapfilename, ".map", sizeof (mapfilename));
2946 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2950 if (!COM_ParseToken_Simple(&data, false, false))
2955 if (!COM_ParseToken_Simple(&data, false, false))
2957 if (com_token[0] != '{')
2963 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2966 if (!COM_ParseToken_Simple(&data, false, false))
2968 if (com_token[0] == '}')
2969 break; // end of entity
2970 if (com_token[0] == '{')
2977 if (submodel > loadmodel->brush.numsubmodels)
2979 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2983 model = loadmodel->brush.submodels[submodel];
2990 if (!COM_ParseToken_Simple(&data, false, false))
2992 if (com_token[0] == '}')
2993 break; // end of brush
2994 // each brush face should be this format:
2995 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2996 // FIXME: support hl .map format
2997 for (pointnum = 0;pointnum < 3;pointnum++)
2999 COM_ParseToken_Simple(&data, false, false);
3000 for (componentnum = 0;componentnum < 3;componentnum++)
3002 COM_ParseToken_Simple(&data, false, false);
3003 point[pointnum][componentnum] = atof(com_token);
3005 COM_ParseToken_Simple(&data, false, false);
3007 COM_ParseToken_Simple(&data, false, false);
3008 strlcpy(facetexture, com_token, sizeof(facetexture));
3009 COM_ParseToken_Simple(&data, false, false);
3010 //scroll_s = atof(com_token);
3011 COM_ParseToken_Simple(&data, false, false);
3012 //scroll_t = atof(com_token);
3013 COM_ParseToken_Simple(&data, false, false);
3014 //rotate = atof(com_token);
3015 COM_ParseToken_Simple(&data, false, false);
3016 //scale_s = atof(com_token);
3017 COM_ParseToken_Simple(&data, false, false);
3018 //scale_t = atof(com_token);
3019 TriangleNormal(point[0], point[1], point[2], planenormal);
3020 VectorNormalizeDouble(planenormal);
3021 planedist = DotProduct(point[0], planenormal);
3022 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
3032 #define MAX_PORTALPOINTS 64
3034 typedef struct portal_s
3037 mnode_t *nodes[2]; // [0] = front side of plane
3038 struct portal_s *next[2];
3040 double points[3*MAX_PORTALPOINTS];
3041 struct portal_s *chain; // all portals are linked into a list
3045 static portal_t *portalchain;
3052 static portal_t *AllocPortal(void)
3055 p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
3056 p->chain = portalchain;
3061 static void FreePortal(portal_t *p)
3066 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
3068 // process only nodes (leafs already had their box calculated)
3072 // calculate children first
3073 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
3074 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
3076 // make combined bounding box from children
3077 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
3078 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
3079 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
3080 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
3081 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
3082 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
3085 static void Mod_Q1BSP_FinalizePortals(void)
3087 int i, j, numportals, numpoints;
3088 portal_t *p, *pnext;
3091 mleaf_t *leaf, *endleaf;
3093 // tally up portal and point counts and recalculate bounding boxes for all
3094 // leafs (because qbsp is very sloppy)
3095 leaf = loadmodel->brush.data_leafs;
3096 endleaf = leaf + loadmodel->brush.num_leafs;
3097 for (;leaf < endleaf;leaf++)
3099 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
3100 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3107 // note: this check must match the one below or it will usually corrupt memory
3108 // 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
3109 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3112 numpoints += p->numpoints * 2;
3116 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3117 loadmodel->brush.num_portals = numportals;
3118 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3119 loadmodel->brush.num_portalpoints = numpoints;
3120 // clear all leaf portal chains
3121 for (i = 0;i < loadmodel->brush.num_leafs;i++)
3122 loadmodel->brush.data_leafs[i].portals = NULL;
3123 // process all portals in the global portal chain, while freeing them
3124 portal = loadmodel->brush.data_portals;
3125 point = loadmodel->brush.data_portalpoints;
3132 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3134 // note: this check must match the one above or it will usually corrupt memory
3135 // 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
3136 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3138 // first make the back to front portal(forward portal)
3139 portal->points = point;
3140 portal->numpoints = p->numpoints;
3141 portal->plane.dist = p->plane.dist;
3142 VectorCopy(p->plane.normal, portal->plane.normal);
3143 portal->here = (mleaf_t *)p->nodes[1];
3144 portal->past = (mleaf_t *)p->nodes[0];
3146 for (j = 0;j < portal->numpoints;j++)
3148 VectorCopy(p->points + j*3, point->position);
3151 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3152 PlaneClassify(&portal->plane);
3154 // link into leaf's portal chain
3155 portal->next = portal->here->portals;
3156 portal->here->portals = portal;
3158 // advance to next portal
3161 // then make the front to back portal(backward portal)
3162 portal->points = point;
3163 portal->numpoints = p->numpoints;
3164 portal->plane.dist = -p->plane.dist;
3165 VectorNegate(p->plane.normal, portal->plane.normal);
3166 portal->here = (mleaf_t *)p->nodes[0];
3167 portal->past = (mleaf_t *)p->nodes[1];
3169 for (j = portal->numpoints - 1;j >= 0;j--)
3171 VectorCopy(p->points + j*3, point->position);
3174 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3175 PlaneClassify(&portal->plane);
3177 // link into leaf's portal chain
3178 portal->next = portal->here->portals;
3179 portal->here->portals = portal;
3181 // advance to next portal
3184 // add the portal's polygon points to the leaf bounding boxes
3185 for (i = 0;i < 2;i++)
3187 leaf = (mleaf_t *)p->nodes[i];
3188 for (j = 0;j < p->numpoints;j++)
3190 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3191 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3192 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3193 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3194 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3195 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3202 // now recalculate the node bounding boxes from the leafs
3203 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
3211 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3214 Host_Error("AddPortalToNodes: NULL front node");
3216 Host_Error("AddPortalToNodes: NULL back node");
3217 if (p->nodes[0] || p->nodes[1])
3218 Host_Error("AddPortalToNodes: already included");
3219 // 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
3221 p->nodes[0] = front;
3222 p->next[0] = (portal_t *)front->portals;
3223 front->portals = (mportal_t *)p;
3226 p->next[1] = (portal_t *)back->portals;
3227 back->portals = (mportal_t *)p;
3232 RemovePortalFromNode
3235 static void RemovePortalFromNodes(portal_t *portal)
3239 void **portalpointer;
3241 for (i = 0;i < 2;i++)
3243 node = portal->nodes[i];
3245 portalpointer = (void **) &node->portals;
3248 t = (portal_t *)*portalpointer;
3250 Host_Error("RemovePortalFromNodes: portal not in leaf");
3254 if (portal->nodes[0] == node)
3256 *portalpointer = portal->next[0];
3257 portal->nodes[0] = NULL;
3259 else if (portal->nodes[1] == node)
3261 *portalpointer = portal->next[1];
3262 portal->nodes[1] = NULL;
3265 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3269 if (t->nodes[0] == node)
3270 portalpointer = (void **) &t->next[0];
3271 else if (t->nodes[1] == node)
3272 portalpointer = (void **) &t->next[1];
3274 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3279 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3280 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3283 mnode_t *front, *back, *other_node;
3284 mplane_t clipplane, *plane;
3285 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3286 int numfrontpoints, numbackpoints;
3287 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3289 // if a leaf, we're done
3293 plane = node->plane;
3295 front = node->children[0];
3296 back = node->children[1];
3298 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3300 // create the new portal by generating a polygon for the node plane,
3301 // and clipping it by all of the other portals(which came from nodes above this one)
3302 nodeportal = AllocPortal();
3303 nodeportal->plane = *plane;
3305 // 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)
3306 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);
3307 nodeportal->numpoints = 4;
3308 side = 0; // shut up compiler warning
3309 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3311 clipplane = portal->plane;
3312 if (portal->nodes[0] == portal->nodes[1])
3313 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3314 if (portal->nodes[0] == node)
3316 else if (portal->nodes[1] == node)
3318 clipplane.dist = -clipplane.dist;
3319 VectorNegate(clipplane.normal, clipplane.normal);
3323 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3325 for (i = 0;i < nodeportal->numpoints*3;i++)
3326 frontpoints[i] = nodeportal->points[i];
3327 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);
3328 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3332 if (nodeportal->numpoints < 3)
3334 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3335 nodeportal->numpoints = 0;
3337 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3339 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3340 nodeportal->numpoints = 0;
3343 AddPortalToNodes(nodeportal, front, back);
3345 // split the portals of this node along this node's plane and assign them to the children of this node
3346 // (migrating the portals downward through the tree)
3347 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3349 if (portal->nodes[0] == portal->nodes[1])
3350 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3351 if (portal->nodes[0] == node)
3353 else if (portal->nodes[1] == node)
3356 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3357 nextportal = portal->next[side];
3358 if (!portal->numpoints)
3361 other_node = portal->nodes[!side];
3362 RemovePortalFromNodes(portal);
3364 // cut the portal into two portals, one on each side of the node plane
3365 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);
3367 if (!numfrontpoints)
3370 AddPortalToNodes(portal, back, other_node);
3372 AddPortalToNodes(portal, other_node, back);
3378 AddPortalToNodes(portal, front, other_node);
3380 AddPortalToNodes(portal, other_node, front);
3384 // the portal is split
3385 splitportal = AllocPortal();
3386 temp = splitportal->chain;
3387 *splitportal = *portal;
3388 splitportal->chain = temp;
3389 for (i = 0;i < numbackpoints*3;i++)
3390 splitportal->points[i] = backpoints[i];
3391 splitportal->numpoints = numbackpoints;
3392 for (i = 0;i < numfrontpoints*3;i++)
3393 portal->points[i] = frontpoints[i];
3394 portal->numpoints = numfrontpoints;
3398 AddPortalToNodes(portal, front, other_node);
3399 AddPortalToNodes(splitportal, back, other_node);
3403 AddPortalToNodes(portal, other_node, front);
3404 AddPortalToNodes(splitportal, other_node, back);
3408 Mod_Q1BSP_RecursiveNodePortals(front);
3409 Mod_Q1BSP_RecursiveNodePortals(back);
3412 static void Mod_Q1BSP_MakePortals(void)
3415 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3416 Mod_Q1BSP_FinalizePortals();
3419 //Returns PVS data for a given point
3420 //(note: can return NULL)
3421 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3424 node = model->brush.data_nodes;
3426 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3427 if (((mleaf_t *)node)->clusterindex >= 0)
3428 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3433 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)
3437 float d = PlaneDiff(org, node->plane);
3439 node = node->children[0];
3440 else if (d < -radius)
3441 node = node->children[1];
3444 // go down both sides
3445 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3446 node = node->children[1];
3449 // if this leaf is in a cluster, accumulate the pvs bits
3450 if (((mleaf_t *)node)->clusterindex >= 0)
3453 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3454 for (i = 0;i < pvsbytes;i++)
3455 pvsbuffer[i] |= pvs[i];
3459 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3460 //of the given point.
3461 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3463 int bytes = model->brush.num_pvsclusterbytes;
3464 bytes = min(bytes, pvsbufferlength);
3465 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3467 memset(pvsbuffer, 0xFF, bytes);
3471 memset(pvsbuffer, 0, bytes);
3472 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3476 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3481 VectorSubtract(inmaxs, inmins, size);
3482 if (cmodel->brush.ishlbsp)
3485 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3486 else if (size[0] <= 32)
3488 if (size[2] < 54) // pick the nearest of 36 or 72
3489 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3491 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3494 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3499 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3500 else if (size[0] <= 32)
3501 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3503 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3505 VectorCopy(inmins, outmins);
3506 VectorAdd(inmins, hull->clip_size, outmaxs);
3509 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3514 mempool_t *mainmempool;
3515 float dist, modelyawradius, modelradius;
3516 msurface_t *surface;
3517 int numshadowmeshtriangles;
3518 hullinfo_t hullinfo;
3519 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3520 model_brush_lightstyleinfo_t styleinfo[256];
3521 unsigned char *datapointer;
3523 mod->modeldatatypestring = "Q1BSP";
3525 mod->type = mod_brushq1;
3527 header = (dheader_t *)buffer;
3529 i = LittleLong(header->version);
3530 if (i != BSPVERSION && i != 30)
3531 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3532 mod->brush.ishlbsp = i == 30;
3534 // fill in hull info
3535 VectorClear (hullinfo.hullsizes[0][0]);
3536 VectorClear (hullinfo.hullsizes[0][1]);
3537 if (mod->brush.ishlbsp)
3539 mod->modeldatatypestring = "HLBSP";
3541 hullinfo.filehulls = 4;
3542 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3543 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3544 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3545 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3546 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3547 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3551 hullinfo.filehulls = 4;
3552 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3553 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3554 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3555 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3559 mod_base = (unsigned char*)buffer;
3560 for (i = 0; i < HEADER_LUMPS; i++)
3562 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3563 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3566 mod->soundfromcenter = true;
3567 mod->TraceBox = Mod_Q1BSP_TraceBox;
3568 mod->TraceLine = Mod_Q1BSP_TraceLine;
3569 mod->TracePoint = Mod_Q1BSP_TracePoint;
3570 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3571 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3572 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3573 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3574 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3575 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3576 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3577 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3578 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3579 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3580 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3581 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3582 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3583 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3584 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3585 mod->Draw = R_Q1BSP_Draw;
3586 mod->DrawDepth = R_Q1BSP_DrawDepth;
3587 mod->DrawDebug = R_Q1BSP_DrawDebug;
3588 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3589 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3590 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3591 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3592 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3593 mod->DrawLight = R_Q1BSP_DrawLight;
3597 mod->brush.qw_md4sum = 0;
3598 mod->brush.qw_md4sum2 = 0;
3599 for (i = 0;i < HEADER_LUMPS;i++)
3601 if (i == LUMP_ENTITIES)
3603 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3604 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3606 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3609 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3610 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3611 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3612 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3613 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3614 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3615 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3616 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3617 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3618 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3619 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3620 // load submodels before leafs because they contain the number of vis leafs
3621 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3622 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3623 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3624 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3626 // check if the map supports transparent water rendering
3627 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3629 if (mod->brushq1.data_compressedpvs)
3630 Mem_Free(mod->brushq1.data_compressedpvs);
3631 mod->brushq1.data_compressedpvs = NULL;
3632 mod->brushq1.num_compressedpvs = 0;
3634 Mod_Q1BSP_MakeHull0();
3635 Mod_Q1BSP_MakePortals();
3637 mod->numframes = 2; // regular and alternate animation
3640 mainmempool = mod->mempool;
3642 // make a single combined shadow mesh to allow optimized shadow volume creation
3643 numshadowmeshtriangles = 0;
3644 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3646 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3647 numshadowmeshtriangles += surface->num_triangles;
3649 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3650 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3651 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));
3652 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3653 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3655 if (loadmodel->brush.numsubmodels)
3656 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3658 // LordHavoc: to clear the fog around the original quake submodel code, I
3660 // first of all, some background info on the submodels:
3661 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3662 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3663 // now the weird for loop itself:
3664 // the loop functions in an odd way, on each iteration it sets up the
3665 // current 'mod' model (which despite the confusing code IS the model of
3666 // the number i), at the end of the loop it duplicates the model to become
3667 // the next submodel, and loops back to set up the new submodel.
3669 // LordHavoc: now the explanation of my sane way (which works identically):
3670 // set up the world model, then on each submodel copy from the world model
3671 // and set up the submodel with the respective model info.
3672 totalstylesurfaces = 0;
3674 for (i = 0;i < mod->brush.numsubmodels;i++)
3676 memset(stylecounts, 0, sizeof(stylecounts));
3677 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3679 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3680 for (j = 0;j < MAXLIGHTMAPS;j++)
3681 stylecounts[surface->lightmapinfo->styles[j]]++;
3683 for (k = 0;k < 255;k++)
3687 totalstylesurfaces += stylecounts[k];
3690 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3691 for (i = 0;i < mod->brush.numsubmodels;i++)
3693 // LordHavoc: this code was originally at the end of this loop, but
3694 // has been transformed to something more readable at the start here.
3699 // duplicate the basic information
3700 dpsnprintf(name, sizeof(name), "*%i", i);
3701 mod = Mod_FindName(name, loadmodel->name);
3702 // copy the base model to this one
3704 // rename the clone back to its proper name
3705 strlcpy(mod->name, name, sizeof(mod->name));
3706 mod->brush.parentmodel = loadmodel;
3707 // textures and memory belong to the main model
3708 mod->texturepool = NULL;
3709 mod->mempool = NULL;
3710 mod->brush.TraceLineOfSight = NULL;
3711 mod->brush.GetPVS = NULL;
3712 mod->brush.FatPVS = NULL;
3713 mod->brush.BoxTouchingPVS = NULL;
3714 mod->brush.BoxTouchingLeafPVS = NULL;
3715 mod->brush.BoxTouchingVisibleLeafs = NULL;
3716 mod->brush.FindBoxClusters = NULL;
3717 mod->brush.LightPoint = NULL;
3718 mod->brush.AmbientSoundLevelsForPoint = NULL;
3721 mod->brush.submodel = i;
3723 if (loadmodel->brush.submodels)
3724 loadmodel->brush.submodels[i] = mod;
3726 bm = &mod->brushq1.submodels[i];
3728 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3729 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3731 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3732 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3735 mod->firstmodelsurface = bm->firstface;
3736 mod->nummodelsurfaces = bm->numfaces;
3738 // make the model surface list (used by shadowing/lighting)
3739 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3740 Mod_MakeSortedSurfaces(mod);
3742 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3743 // (previously this code measured the radius of the vertices of surfaces in the submodel, but that broke submodels that contain only CLIP brushes, which do not produce surfaces)
3744 VectorCopy(bm->mins, mod->normalmins);
3745 VectorCopy(bm->maxs, mod->normalmaxs);
3746 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3747 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3748 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3749 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3750 modelradius = modelyawradius + modelradius * modelradius;
3751 modelyawradius = sqrt(modelyawradius);
3752 modelradius = sqrt(modelradius);
3753 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3754 mod->yawmins[2] = mod->normalmins[2];
3755 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
3756 mod->yawmaxs[2] = mod->normalmaxs[2];
3757 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3758 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3759 mod->radius = modelradius;
3760 mod->radius2 = modelradius * modelradius;
3762 // this gets altered below if sky or water is used
3763 mod->DrawSky = NULL;
3764 mod->DrawAddWaterPlanes = NULL;
3766 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3767 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3768 if (mod->nummodelsurfaces)
3770 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3771 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3773 if (j < mod->nummodelsurfaces)
3774 mod->DrawSky = R_Q1BSP_DrawSky;
3776 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3777 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3779 if (j < mod->nummodelsurfaces)
3780 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3782 // build lightstyle update chains
3783 // (used to rapidly mark lightmapupdateflags on many surfaces
3784 // when d_lightstylevalue changes)
3785 memset(stylecounts, 0, sizeof(stylecounts));
3786 for (k = 0;k < mod->nummodelsurfaces;k++)
3788 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3789 for (j = 0;j < MAXLIGHTMAPS;j++)
3790 stylecounts[surface->lightmapinfo->styles[j]]++;
3792 mod->brushq1.num_lightstyles = 0;
3793 for (k = 0;k < 255;k++)
3797 styleinfo[mod->brushq1.num_lightstyles].style = k;
3798 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3799 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3800 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3801 remapstyles[k] = mod->brushq1.num_lightstyles;
3802 mod->brushq1.num_lightstyles++;
3805 for (k = 0;k < mod->nummodelsurfaces;k++)
3807 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3808 for (j = 0;j < MAXLIGHTMAPS;j++)
3810 if (surface->lightmapinfo->styles[j] != 255)
3812 int r = remapstyles[surface->lightmapinfo->styles[j]];
3813 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3817 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3818 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3822 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3823 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3825 //mod->brushq1.num_visleafs = bm->visleafs;
3828 Mod_Q1BSP_LoadMapBrushes();
3830 //Mod_Q1BSP_ProcessLightList();
3832 if (developer.integer >= 10)
3833 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);
3836 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3840 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3847 in = (void *)(mod_base + l->fileofs);
3848 if (l->filelen % sizeof(*in))
3849 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3850 count = l->filelen / sizeof(*in);
3851 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3854 loadmodel->num = count;
3856 for (i = 0;i < count;i++, in++, out++)
3862 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3869 in = (void *)(mod_base + l->fileofs);
3870 if (l->filelen % sizeof(*in))
3871 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3872 count = l->filelen / sizeof(*in);
3873 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3876 loadmodel->num = count;
3878 for (i = 0;i < count;i++, in++, out++)
3884 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3891 in = (void *)(mod_base + l->fileofs);
3892 if (l->filelen % sizeof(*in))
3893 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3894 count = l->filelen / sizeof(*in);
3895 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3898 loadmodel->num = count;
3900 for (i = 0;i < count;i++, in++, out++)
3906 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3913 in = (void *)(mod_base + l->fileofs);
3914 if (l->filelen % sizeof(*in))
3915 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3916 count = l->filelen / sizeof(*in);
3917 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3920 loadmodel->num = count;
3922 for (i = 0;i < count;i++, in++, out++)
3928 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3935 in = (void *)(mod_base + l->fileofs);
3936 if (l->filelen % sizeof(*in))
3937 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3938 count = l->filelen / sizeof(*in);
3939 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3942 loadmodel->num = count;
3944 for (i = 0;i < count;i++, in++, out++)
3950 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3957 in = (void *)(mod_base + l->fileofs);
3958 if (l->filelen % sizeof(*in))
3959 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3960 count = l->filelen / sizeof(*in);
3961 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3964 loadmodel->num = count;
3966 for (i = 0;i < count;i++, in++, out++)
3972 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3979 in = (void *)(mod_base + l->fileofs);
3980 if (l->filelen % sizeof(*in))
3981 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3982 count = l->filelen / sizeof(*in);
3983 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3986 loadmodel->num = count;
3988 for (i = 0;i < count;i++, in++, out++)
3994 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
4001 in = (void *)(mod_base + l->fileofs);
4002 if (l->filelen % sizeof(*in))
4003 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4004 count = l->filelen / sizeof(*in);
4005 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4008 loadmodel->num = count;
4010 for (i = 0;i < count;i++, in++, out++)
4016 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
4023 in = (void *)(mod_base + l->fileofs);
4024 if (l->filelen % sizeof(*in))
4025 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4026 count = l->filelen / sizeof(*in);
4027 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4030 loadmodel->num = count;
4032 for (i = 0;i < count;i++, in++, out++)
4038 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
4045 in = (void *)(mod_base + l->fileofs);
4046 if (l->filelen % sizeof(*in))
4047 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4048 count = l->filelen / sizeof(*in);
4049 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4052 loadmodel->num = count;
4054 for (i = 0;i < count;i++, in++, out++)
4060 static void Mod_Q2BSP_LoadEdges(lump_t *l)
4067 in = (void *)(mod_base + l->fileofs);
4068 if (l->filelen % sizeof(*in))
4069 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
4070 count = l->filelen / sizeof(*in);
4071 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4074 loadmodel->num = count;
4076 for (i = 0;i < count;i++, in++, out++)
4082 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
4089 in = (void *)(mod_base + l->fileofs);
4090 if (l->filelen % sizeof(*in))
4091 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
4092 count = l->filelen / sizeof(*in);
4093 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4096 loadmodel->num = count;
4098 for (i = 0;i < count;i++, in++, out++)
4104 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4111 in = (void *)(mod_base + l->fileofs);
4112 if (l->filelen % sizeof(*in))
4113 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4114 count = l->filelen / sizeof(*in);
4115 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4118 loadmodel->num = count;
4120 for (i = 0;i < count;i++, in++, out++)
4126 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4133 in = (void *)(mod_base + l->fileofs);
4134 if (l->filelen % sizeof(*in))
4135 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4136 count = l->filelen / sizeof(*in);
4137 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4140 loadmodel->num = count;
4142 for (i = 0;i < count;i++, in++, out++)
4148 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4155 in = (void *)(mod_base + l->fileofs);
4156 if (l->filelen % sizeof(*in))
4157 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4158 count = l->filelen / sizeof(*in);
4159 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4162 loadmodel->num = count;
4164 for (i = 0;i < count;i++, in++, out++)
4170 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4177 in = (void *)(mod_base + l->fileofs);
4178 if (l->filelen % sizeof(*in))
4179 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4180 count = l->filelen / sizeof(*in);
4181 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4184 loadmodel->num = count;
4186 for (i = 0;i < count;i++, in++, out++)
4192 static void Mod_Q2BSP_LoadModels(lump_t *l)
4199 in = (void *)(mod_base + l->fileofs);
4200 if (l->filelen % sizeof(*in))
4201 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4202 count = l->filelen / sizeof(*in);
4203 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4206 loadmodel->num = count;
4208 for (i = 0;i < count;i++, in++, out++)
4214 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4217 q2dheader_t *header;
4219 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4221 mod->modeldatatypestring = "Q2BSP";
4223 mod->type = mod_brushq2;
4225 header = (q2dheader_t *)buffer;
4227 i = LittleLong(header->version);
4228 if (i != Q2BSPVERSION)
4229 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4231 mod_base = (unsigned char *)header;
4233 // swap all the lumps
4234 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4235 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4237 mod->brush.qw_md4sum = 0;
4238 mod->brush.qw_md4sum2 = 0;
4239 for (i = 0;i < Q2HEADER_LUMPS;i++)
4241 if (i == Q2LUMP_ENTITIES)
4243 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4244 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4246 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4249 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4250 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4251 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4252 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4253 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4254 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4255 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4256 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4257 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4258 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4259 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4260 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4261 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4262 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4263 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4264 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4265 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4266 // LordHavoc: must go last because this makes the submodels
4267 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4270 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4271 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4273 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4276 char key[128], value[MAX_INPUTLINE];
4278 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4279 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4280 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4283 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4284 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4285 loadmodel->brush.entities[l->filelen] = 0;
4286 data = loadmodel->brush.entities;
4287 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4288 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4292 if (!COM_ParseToken_Simple(&data, false, false))
4294 if (com_token[0] == '}')
4295 break; // end of worldspawn
4296 if (com_token[0] == '_')
4297 strlcpy(key, com_token + 1, sizeof(key));
4299 strlcpy(key, com_token, sizeof(key));
4300 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4301 key[strlen(key)-1] = 0;
4302 if (!COM_ParseToken_Simple(&data, false, false))
4304 strlcpy(value, com_token, sizeof(value));
4305 if (!strcmp("gridsize", key))
4307 #if _MSC_VER >= 1400
4308 #define sscanf sscanf_s
4310 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4311 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4317 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4323 in = (q3dtexture_t *)(mod_base + l->fileofs);
4324 if (l->filelen % sizeof(*in))
4325 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4326 count = l->filelen / sizeof(*in);
4327 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4329 loadmodel->data_textures = out;
4330 loadmodel->num_textures = count;
4331 loadmodel->num_texturesperskin = loadmodel->num_textures;
4333 for (i = 0;i < count;i++)
4335 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4336 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4337 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4340 if (cls.state == ca_dedicated)
4343 for (i = 0;i < count;i++, in++, out++)
4344 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4347 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4353 in = (q3dplane_t *)(mod_base + l->fileofs);
4354 if (l->filelen % sizeof(*in))
4355 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4356 count = l->filelen / sizeof(*in);
4357 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4359 loadmodel->brush.data_planes = out;
4360 loadmodel->brush.num_planes = count;
4362 for (i = 0;i < count;i++, in++, out++)
4364 out->normal[0] = LittleFloat(in->normal[0]);
4365 out->normal[1] = LittleFloat(in->normal[1]);
4366 out->normal[2] = LittleFloat(in->normal[2]);
4367 out->dist = LittleFloat(in->dist);
4372 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4375 q3mbrushside_t *out;
4378 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4379 if (l->filelen % sizeof(*in))
4380 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4381 count = l->filelen / sizeof(*in);
4382 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4384 loadmodel->brush.data_brushsides = out;
4385 loadmodel->brush.num_brushsides = count;
4387 for (i = 0;i < count;i++, in++, out++)
4389 n = LittleLong(in->planeindex);
4390 if (n < 0 || n >= loadmodel->brush.num_planes)
4391 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4392 out->plane = loadmodel->brush.data_planes + n;
4393 n = LittleLong(in->textureindex);
4394 if (n < 0 || n >= loadmodel->num_textures)
4395 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4396 out->texture = loadmodel->data_textures + n;
4400 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4402 q3dbrushside_ig_t *in;
4403 q3mbrushside_t *out;
4406 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4407 if (l->filelen % sizeof(*in))
4408 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4409 count = l->filelen / sizeof(*in);
4410 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4412 loadmodel->brush.data_brushsides = out;
4413 loadmodel->brush.num_brushsides = count;
4415 for (i = 0;i < count;i++, in++, out++)
4417 n = LittleLong(in->planeindex);
4418 if (n < 0 || n >= loadmodel->brush.num_planes)
4419 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4420 out->plane = loadmodel->brush.data_planes + n;
4421 n = LittleLong(in->textureindex);
4422 if (n < 0 || n >= loadmodel->num_textures)
4423 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4424 out->texture = loadmodel->data_textures + n;
4428 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4432 int i, j, n, c, count, maxplanes;
4433 colplanef_t *planes;
4435 in = (q3dbrush_t *)(mod_base + l->fileofs);
4436 if (l->filelen % sizeof(*in))
4437 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4438 count = l->filelen / sizeof(*in);
4439 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4441 loadmodel->brush.data_brushes = out;
4442 loadmodel->brush.num_brushes = count;
4447 for (i = 0;i < count;i++, in++, out++)
4449 n = LittleLong(in->firstbrushside);
4450 c = LittleLong(in->numbrushsides);
4451 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4452 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4453 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4454 out->numbrushsides = c;
4455 n = LittleLong(in->textureindex);
4456 if (n < 0 || n >= loadmodel->num_textures)
4457 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4458 out->texture = loadmodel->data_textures + n;
4460 // make a list of mplane_t structs to construct a colbrush from
4461 if (maxplanes < out->numbrushsides)
4463 maxplanes = out->numbrushsides;
4466 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4468 for (j = 0;j < out->numbrushsides;j++)
4470 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4471 planes[j].dist = out->firstbrushside[j].plane->dist;
4472 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4473 planes[j].texture = out->firstbrushside[j].texture;
4475 // make the colbrush from the planes
4476 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4478 // this whole loop can take a while (e.g. on redstarrepublic4)
4479 CL_KeepaliveMessage(false);
4485 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4491 in = (q3deffect_t *)(mod_base + l->fileofs);
4492 if (l->filelen % sizeof(*in))
4493 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4494 count = l->filelen / sizeof(*in);
4495 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4497 loadmodel->brushq3.data_effects = out;
4498 loadmodel->brushq3.num_effects = count;
4500 for (i = 0;i < count;i++, in++, out++)
4502 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4503 n = LittleLong(in->brushindex);
4504 if (n >= loadmodel->brush.num_brushes)
4506 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4509 out->brushindex = n;
4510 out->unknown = LittleLong(in->unknown);
4514 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4519 in = (q3dvertex_t *)(mod_base + l->fileofs);
4520 if (l->filelen % sizeof(*in))
4521 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4522 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4523 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4524 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4525 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4526 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4527 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4529 for (i = 0;i < count;i++, in++)
4531 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4532 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4533 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4534 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4535 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4536 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4537 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4538 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4539 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4540 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4541 // svector/tvector are calculated later in face loading
4542 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4543 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4544 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4545 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4549 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4555 in = (int *)(mod_base + l->fileofs);
4556 if (l->filelen % sizeof(int[3]))
4557 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4558 count = l->filelen / sizeof(*in);
4559 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4561 loadmodel->brushq3.num_triangles = count / 3;
4562 loadmodel->brushq3.data_element3i = out;
4564 for (i = 0;i < count;i++, in++, out++)
4566 *out = LittleLong(*in);
4567 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4569 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4570 if(!loadmodel->brushq3.num_vertices)
4571 Host_Error("Mod_Q1BSP_LoadTrianglles: %s has triangles but no vertexes, cannot fix\n", loadmodel->name);
4577 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4579 q3dlightmap_t *input_pointer;
4580 int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4583 unsigned char *convertedpixels;
4584 char mapname[MAX_QPATH];
4585 int size, bytesperpixel, rgbmap[3];
4587 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4589 // defaults for q3bsp
4596 loadmodel->brushq3.lightmapsize = 128;
4598 if (cls.state == ca_dedicated)
4601 if(mod_q3bsp_nolightmaps.integer)
4607 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4608 if (developer_loading.integer)
4609 Con_Printf("Using internal lightmaps\n");
4610 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4611 if (l->filelen % sizeof(*input_pointer))
4612 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4613 count = l->filelen / sizeof(*input_pointer);
4614 for(i = 0; i < count; ++i)
4615 inpixels[i] = input_pointer[i].rgb;
4619 // no internal lightmaps
4620 // try external lightmaps
4621 if (developer_loading.integer)
4622 Con_Printf("Using external lightmaps\n");
4623 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4624 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false);
4628 // using EXTERNAL lightmaps instead
4629 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4631 Mem_Free(inpixels[0]);
4632 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4642 for(count = 1; ; ++count)
4644 inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false);
4645 if(!inpixels[count])
4646 break; // we got all of them
4647 if(image_width != size || image_height != size)
4649 for(i = 0; i <= count; ++i)
4650 Mem_Free(inpixels[i]);
4651 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4656 convertedpixels = (unsigned char *) Mem_Alloc(tempmempool, size*size*4);
4657 loadmodel->brushq3.lightmapsize = size;
4658 loadmodel->brushq3.num_originallightmaps = count;
4660 // now check the surfaces to see if any of them index an odd numbered
4661 // lightmap, if so this is not a deluxemapped bsp file
4663 // also check what lightmaps are actually used, because q3map2 sometimes
4664 // (always?) makes an unused one at the end, which
4665 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4666 // reason when only one lightmap is used, which can throw off the
4667 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4668 // to see if the second lightmap is blank, if so it is not deluxemapped.
4669 loadmodel->brushq3.deluxemapping = !(count & 1);
4670 loadmodel->brushq3.deluxemapping_modelspace = true;
4672 if (loadmodel->brushq3.deluxemapping)
4674 int facecount = faceslump->filelen / sizeof(q3dface_t);
4675 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4676 for (i = 0;i < facecount;i++)
4678 j = LittleLong(faces[i].lightmapindex);
4681 endlightmap = max(endlightmap, j + 1);
4682 if ((j & 1) || j + 1 >= count)
4684 loadmodel->brushq3.deluxemapping = false;
4691 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4692 // reason when only one lightmap is used, which can throw off the
4693 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4694 // to see if the second lightmap is blank, if so it is not deluxemapped.
4696 // further research has shown q3map2 sometimes creates a deluxemap and two
4697 // blank lightmaps, which must be handled properly as well
4698 if (endlightmap == 1 && count > 1)
4701 for (i = 0;i < size*size;i++)
4703 if (c[bytesperpixel*i + rgbmap[0]])
4705 if (c[bytesperpixel*i + rgbmap[1]])
4707 if (c[bytesperpixel*i + rgbmap[2]])
4712 // all pixels in the unused lightmap were black...
4713 loadmodel->brushq3.deluxemapping = false;
4717 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4719 // figure out what the most reasonable merge power is within limits
4721 loadmodel->brushq3.num_lightmapmergepower = 0;
4723 for(i = 0; (128 << i) < size; ++i)
4725 // i is now 0 for 128, 1 for 256, etc
4727 for (power = 1;power + i <= mod_q3bsp_lightmapmergepower.integer && (size << power) <= gl_max_texture_size && (1 << (power * 2)) < 4 * (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)); power++)
4728 loadmodel->brushq3.num_lightmapmergepower = power;
4730 loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4732 loadmodel->brushq3.num_mergedlightmaps = ((count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4733 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4734 if (loadmodel->brushq3.deluxemapping)
4735 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4737 // allocate a texture pool if we need it
4738 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4739 loadmodel->texturepool = R_AllocTexturePool();
4741 power = loadmodel->brushq3.num_lightmapmergepower;
4743 mask = (1 << power) - 1;
4744 for (i = 0;i < count;i++)
4746 // figure out which merged lightmap texture this fits into
4747 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4748 for (k = 0;k < size*size;k++)
4750 convertedpixels[k*4+0] = inpixels[i][k*bytesperpixel+rgbmap[0]];
4751 convertedpixels[k*4+1] = inpixels[i][k*bytesperpixel+rgbmap[1]];
4752 convertedpixels[k*4+2] = inpixels[i][k*bytesperpixel+rgbmap[2]];
4753 convertedpixels[k*4+3] = 255;
4755 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4757 // if the lightmap has not been allocated yet, create it
4758 if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4760 // create a lightmap only as large as necessary to hold the
4761 // remaining size*size blocks
4762 // if there are multiple merged lightmap textures then they will
4763 // all be full size except the last one which may be smaller
4764 // because it only needs to the remaining blocks, and it will often
4765 // be odd sizes like 2048x512 due to only being 25% full or so.
4766 j = (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) - (lightmapindex << power2);
4767 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4769 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4771 if (developer_loading.integer)
4772 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);
4773 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);
4774 if (loadmodel->brushq3.data_deluxemaps)
4775 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);
4777 mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4778 mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4779 j = (i >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) & ((1 << power2) - 1);
4780 if (loadmodel->brushq3.deluxemapping && (i & 1))
4781 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4783 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4787 // figure out which merged lightmap texture this fits into
4788 if (loadmodel->brushq3.deluxemapping && (i & 1))
4789 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);
4791 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);
4795 Mem_Free(convertedpixels);
4798 for(i = 0; i < count; ++i)
4799 Mem_Free(inpixels[i]);
4803 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
4810 *collisionstride = stride;
4811 cnt = (num_triangles + stride - 1) / stride;
4812 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
4813 for(j = 0; j < cnt; ++j)
4815 mins = &((*collisionbbox6f)[6 * j + 0]);
4816 maxs = &((*collisionbbox6f)[6 * j + 3]);
4817 for(k = 0; k < stride; ++k)
4819 tri = j * stride + k;
4820 if(tri >= num_triangles)
4822 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
4823 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
4824 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
4825 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
4826 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
4827 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
4828 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
4829 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
4830 if(vert[0] < mins[0]) mins[0] = vert[0];
4831 if(vert[1] < mins[1]) mins[1] = vert[1];
4832 if(vert[2] < mins[2]) mins[2] = vert[2];
4833 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4834 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4835 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4836 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
4837 if(vert[0] < mins[0]) mins[0] = vert[0];
4838 if(vert[1] < mins[1]) mins[1] = vert[1];
4839 if(vert[2] < mins[2]) mins[2] = vert[2];
4840 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4841 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4842 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4848 *collisionstride = 0;
4849 *collisionbbox6f = NULL;
4853 typedef struct patchtess_s
4857 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
4860 float *originalvertex3f;
4863 #define PATCHTESS_SAME_LODGROUP(a,b) \
4865 (a).lodgroup[0] == (b).lodgroup[0] && \
4866 (a).lodgroup[1] == (b).lodgroup[1] && \
4867 (a).lodgroup[2] == (b).lodgroup[2] && \
4868 (a).lodgroup[3] == (b).lodgroup[3] && \
4869 (a).lodgroup[4] == (b).lodgroup[4] && \
4870 (a).lodgroup[5] == (b).lodgroup[5] \
4873 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4875 q3dface_t *in, *oldin;
4876 msurface_t *out, *oldout;
4877 int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, numvertices, numtriangles, cxtess, cytess;
4878 float lightmaptcbase[2], lightmaptcscale[2];
4879 //int *originalelement3i;
4880 //int *originalneighbor3i;
4881 float *originalvertex3f;
4882 //float *originalsvector3f;
4883 //float *originaltvector3f;
4884 float *originalnormal3f;
4885 float *originalcolor4f;
4886 float *originaltexcoordtexture2f;
4887 float *originaltexcoordlightmap2f;
4889 patchtess_t *patchtess = NULL;
4890 int patchtesscount = 0;
4893 in = (q3dface_t *)(mod_base + l->fileofs);
4894 if (l->filelen % sizeof(*in))
4895 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4896 count = l->filelen / sizeof(*in);
4897 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4899 loadmodel->data_surfaces = out;
4900 loadmodel->num_surfaces = count;
4903 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
4911 for (;i < count;i++, in++, out++)
4913 // check face type first
4914 type = LittleLong(in->type);
4915 if (type != Q3FACETYPE_FLAT
4916 && type != Q3FACETYPE_PATCH
4917 && type != Q3FACETYPE_MESH
4918 && type != Q3FACETYPE_FLARE)
4920 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4924 n = LittleLong(in->textureindex);
4925 if (n < 0 || n >= loadmodel->num_textures)
4927 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4930 out->texture = loadmodel->data_textures + n;
4931 n = LittleLong(in->effectindex);
4932 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4934 if (developer.integer >= 100)
4935 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4941 out->effect = loadmodel->brushq3.data_effects + n;
4943 if (cls.state != ca_dedicated)
4945 out->lightmaptexture = NULL;
4946 out->deluxemaptexture = r_texture_blanknormalmap;
4947 n = LittleLong(in->lightmapindex);
4950 else if (n >= loadmodel->brushq3.num_originallightmaps)
4952 if(loadmodel->brushq3.num_originallightmaps != 0)
4953 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4958 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4959 if (loadmodel->brushq3.deluxemapping)
4960 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4964 firstvertex = LittleLong(in->firstvertex);
4965 numvertices = LittleLong(in->numvertices);
4966 firstelement = LittleLong(in->firstelement);
4967 numtriangles = LittleLong(in->numelements) / 3;
4968 if (numtriangles * 3 != LittleLong(in->numelements))
4970 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));
4973 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4975 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);
4978 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4980 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);
4985 case Q3FACETYPE_FLAT:
4986 case Q3FACETYPE_MESH:
4987 // no processing necessary
4989 case Q3FACETYPE_PATCH:
4990 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4991 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4992 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))
4994 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4997 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4999 // convert patch to Q3FACETYPE_MESH
5000 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5001 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5002 // bound to user settings
5003 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
5004 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
5005 // bound to sanity settings
5006 xtess = bound(0, xtess, 1024);
5007 ytess = bound(0, ytess, 1024);
5009 // lower quality collision patches! Same procedure as before, but different cvars
5010 // convert patch to Q3FACETYPE_MESH
5011 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5012 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5013 // bound to user settings
5014 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
5015 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
5016 // bound to sanity settings
5017 cxtess = bound(0, cxtess, 1024);
5018 cytess = bound(0, cytess, 1024);
5020 // store it for the LOD grouping step
5021 patchtess[patchtesscount].info.xsize = patchsize[0];
5022 patchtess[patchtesscount].info.ysize = patchsize[1];
5023 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
5024 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
5025 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
5026 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
5028 patchtess[patchtesscount].surface_id = i;
5029 patchtess[patchtesscount].lodgroup[0] = in->specific.patch.mins[0];
5030 patchtess[patchtesscount].lodgroup[1] = in->specific.patch.mins[1];
5031 patchtess[patchtesscount].lodgroup[2] = in->specific.patch.mins[2];
5032 patchtess[patchtesscount].lodgroup[3] = in->specific.patch.maxs[0];
5033 patchtess[patchtesscount].lodgroup[4] = in->specific.patch.maxs[1];
5034 patchtess[patchtesscount].lodgroup[5] = in->specific.patch.maxs[2];
5035 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
5038 case Q3FACETYPE_FLARE:
5039 if (developer.integer >= 100)
5040 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
5044 out->num_vertices = numvertices;
5045 out->num_triangles = numtriangles;
5046 meshvertices += out->num_vertices;
5047 meshtriangles += out->num_triangles;
5050 // Fix patches tesselations so that they make no seams
5054 for(i = 0; i < patchtesscount; ++i)
5056 for(j = i+1; j < patchtesscount; ++j)
5058 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
5061 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
5068 // Calculate resulting number of triangles
5069 for(i = 0; i < patchtesscount; ++i)
5071 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
5072 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
5073 numvertices = finalwidth * finalheight;
5074 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5076 oldout[patchtess[i].surface_id].num_vertices = numvertices;
5077 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
5078 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
5079 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
5085 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
5088 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
5090 if (out->num_vertices < 3 || out->num_triangles < 1)
5093 type = LittleLong(in->type);
5094 firstvertex = LittleLong(in->firstvertex);
5095 firstelement = LittleLong(in->firstelement);
5096 out->num_firstvertex = meshvertices;
5097 out->num_firsttriangle = meshtriangles;
5100 case Q3FACETYPE_FLAT:
5101 case Q3FACETYPE_MESH:
5102 // no processing necessary, except for lightmap merging
5103 for (j = 0;j < out->num_vertices;j++)
5105 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5106 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5107 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5108 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5109 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5110 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5111 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5112 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5113 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5114 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5115 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5116 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5117 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5118 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5120 for (j = 0;j < out->num_triangles*3;j++)
5121 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5123 case Q3FACETYPE_PATCH:
5124 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5125 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5126 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5127 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5128 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5129 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5130 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5132 xtess = ytess = cxtess = cytess = -1;
5133 for(j = 0; j < patchtesscount; ++j)
5134 if(patchtess[j].surface_id == i)
5136 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5137 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5138 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5139 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5144 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5145 xtess = ytess = cxtess = cytess = 0;
5148 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5149 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5150 finalvertices = finalwidth * finalheight;
5151 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5152 type = Q3FACETYPE_MESH;
5153 // generate geometry
5154 // (note: normals are skipped because they get recalculated)
5155 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5156 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5157 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5158 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5159 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5160 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5162 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);
5164 if (developer.integer >= 100)
5166 if (out->num_triangles < finaltriangles)
5167 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);
5169 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);
5171 // q3map does not put in collision brushes for curves... ugh
5172 // build the lower quality collision geometry
5173 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5174 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5175 finalvertices = finalwidth * finalheight;
5176 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5178 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5179 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5180 out->num_collisionvertices = finalvertices;
5181 out->num_collisiontriangles = finaltriangles;
5182 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5183 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
5185 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5186 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
5188 oldnumtriangles = out->num_triangles;
5189 oldnumtriangles2 = out->num_collisiontriangles;
5190 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
5192 // now optimize the collision mesh by finding triangle bboxes...
5193 Mod_Q3BSP_BuildBBoxes(out->data_collisionelement3i, out->num_collisiontriangles, out->data_collisionvertex3f, &out->data_collisionbbox6f, &out->num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5194 Mod_Q3BSP_BuildBBoxes(loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle, out->num_triangles, loadmodel->surfmesh.data_vertex3f, &out->data_bbox6f, &out->num_bboxstride, mod_q3bsp_curves_stride.integer);
5196 if (developer.integer >= 100)
5197 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);
5202 meshvertices += out->num_vertices;
5203 meshtriangles += out->num_triangles;
5204 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5205 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)
5207 if (invalidelements)
5209 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);
5210 for (j = 0;j < out->num_triangles * 3;j++)
5212 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5213 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)
5214 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5218 // calculate a bounding box
5219 VectorClear(out->mins);
5220 VectorClear(out->maxs);
5221 if (out->num_vertices)
5223 if (cls.state != ca_dedicated && out->lightmaptexture)
5225 // figure out which part of the merged lightmap this fits into
5226 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5227 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5228 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5229 lightmapindex &= mergewidth * mergeheight - 1;
5230 lightmaptcscale[0] = 1.0f / mergewidth;
5231 lightmaptcscale[1] = 1.0f / mergeheight;
5232 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5233 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5234 // modify the lightmap texcoords to match this region of the merged lightmap
5235 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5237 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5238 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5241 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5242 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5243 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5245 out->mins[0] = min(out->mins[0], v[0]);
5246 out->maxs[0] = max(out->maxs[0], v[0]);
5247 out->mins[1] = min(out->mins[1], v[1]);
5248 out->maxs[1] = max(out->maxs[1], v[1]);
5249 out->mins[2] = min(out->mins[2], v[2]);
5250 out->maxs[2] = max(out->maxs[2], v[2]);
5252 out->mins[0] -= 1.0f;
5253 out->mins[1] -= 1.0f;
5254 out->mins[2] -= 1.0f;
5255 out->maxs[0] += 1.0f;
5256 out->maxs[1] += 1.0f;
5257 out->maxs[2] += 1.0f;
5259 // set lightmap styles for consistency with q1bsp
5260 //out->lightmapinfo->styles[0] = 0;
5261 //out->lightmapinfo->styles[1] = 255;
5262 //out->lightmapinfo->styles[2] = 255;
5263 //out->lightmapinfo->styles[3] = 255;
5268 for (;i < count;i++, out++)
5270 if(out->num_vertices && out->num_triangles)
5272 if(out->num_vertices == 0)
5273 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no vertices, ignoring\n", i);
5274 if(out->num_triangles == 0)
5275 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no triangles, ignoring\n", i);
5278 // for per pixel lighting
5279 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);
5281 // generate ushort elements array if possible
5282 if (loadmodel->surfmesh.data_element3s)
5283 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5284 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5286 // free the no longer needed vertex data
5287 loadmodel->brushq3.num_vertices = 0;
5288 if (loadmodel->brushq3.data_vertex3f)
5289 Mem_Free(loadmodel->brushq3.data_vertex3f);
5290 loadmodel->brushq3.data_vertex3f = NULL;
5291 loadmodel->brushq3.data_normal3f = NULL;
5292 loadmodel->brushq3.data_texcoordtexture2f = NULL;
5293 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5294 loadmodel->brushq3.data_color4f = NULL;
5295 // free the no longer needed triangle data
5296 loadmodel->brushq3.num_triangles = 0;
5297 if (loadmodel->brushq3.data_element3i)
5298 Mem_Free(loadmodel->brushq3.data_element3i);
5299 loadmodel->brushq3.data_element3i = NULL;
5302 Mem_Free(patchtess);
5305 static void Mod_Q3BSP_LoadModels(lump_t *l)
5309 int i, j, n, c, count;
5311 in = (q3dmodel_t *)(mod_base + l->fileofs);
5312 if (l->filelen % sizeof(*in))
5313 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5314 count = l->filelen / sizeof(*in);
5315 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5317 loadmodel->brushq3.data_models = out;
5318 loadmodel->brushq3.num_models = count;
5320 for (i = 0;i < count;i++, in++, out++)
5322 for (j = 0;j < 3;j++)
5324 out->mins[j] = LittleFloat(in->mins[j]);
5325 out->maxs[j] = LittleFloat(in->maxs[j]);
5327 n = LittleLong(in->firstface);
5328 c = LittleLong(in->numfaces);
5329 if (n < 0 || n + c > loadmodel->num_surfaces)
5330 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5333 n = LittleLong(in->firstbrush);
5334 c = LittleLong(in->numbrushes);
5335 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5336 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5337 out->firstbrush = n;
5338 out->numbrushes = c;
5342 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5348 in = (int *)(mod_base + l->fileofs);
5349 if (l->filelen % sizeof(*in))
5350 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5351 count = l->filelen / sizeof(*in);
5352 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5354 loadmodel->brush.data_leafbrushes = out;
5355 loadmodel->brush.num_leafbrushes = count;
5357 for (i = 0;i < count;i++, in++, out++)
5359 n = LittleLong(*in);
5360 if (n < 0 || n >= loadmodel->brush.num_brushes)
5361 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5366 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5372 in = (int *)(mod_base + l->fileofs);
5373 if (l->filelen % sizeof(*in))
5374 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5375 count = l->filelen / sizeof(*in);
5376 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5378 loadmodel->brush.data_leafsurfaces = out;
5379 loadmodel->brush.num_leafsurfaces = count;
5381 for (i = 0;i < count;i++, in++, out++)
5383 n = LittleLong(*in);
5384 if (n < 0 || n >= loadmodel->num_surfaces)
5385 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5390 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5394 int i, j, n, c, count;
5396 in = (q3dleaf_t *)(mod_base + l->fileofs);
5397 if (l->filelen % sizeof(*in))
5398 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5399 count = l->filelen / sizeof(*in);
5400 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5402 loadmodel->brush.data_leafs = out;
5403 loadmodel->brush.num_leafs = count;
5405 for (i = 0;i < count;i++, in++, out++)
5409 out->clusterindex = LittleLong(in->clusterindex);
5410 out->areaindex = LittleLong(in->areaindex);
5411 for (j = 0;j < 3;j++)
5413 // yes the mins/maxs are ints
5414 out->mins[j] = LittleLong(in->mins[j]) - 1;
5415 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5417 n = LittleLong(in->firstleafface);
5418 c = LittleLong(in->numleaffaces);
5419 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5420 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5421 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5422 out->numleafsurfaces = c;
5423 n = LittleLong(in->firstleafbrush);
5424 c = LittleLong(in->numleafbrushes);
5425 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5426 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5427 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5428 out->numleafbrushes = c;
5432 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5438 in = (q3dnode_t *)(mod_base + l->fileofs);
5439 if (l->filelen % sizeof(*in))
5440 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5441 count = l->filelen / sizeof(*in);
5442 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5444 loadmodel->brush.data_nodes = out;
5445 loadmodel->brush.num_nodes = count;
5447 for (i = 0;i < count;i++, in++, out++)
5450 n = LittleLong(in->planeindex);
5451 if (n < 0 || n >= loadmodel->brush.num_planes)
5452 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5453 out->plane = loadmodel->brush.data_planes + n;
5454 for (j = 0;j < 2;j++)
5456 n = LittleLong(in->childrenindex[j]);
5459 if (n >= loadmodel->brush.num_nodes)
5460 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5461 out->children[j] = loadmodel->brush.data_nodes + n;
5466 if (n >= loadmodel->brush.num_leafs)
5467 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5468 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5471 for (j = 0;j < 3;j++)
5473 // yes the mins/maxs are ints
5474 out->mins[j] = LittleLong(in->mins[j]) - 1;
5475 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5479 // set the parent pointers
5480 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5483 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5486 q3dlightgrid_t *out;
5489 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5490 if (l->filelen % sizeof(*in))
5491 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5492 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5493 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5494 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5495 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5496 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5497 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5498 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5499 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5500 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5501 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5502 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5503 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5504 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5505 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]);
5506 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]);
5508 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5511 if (l->filelen < count * (int)sizeof(*in))
5512 Host_Error("Mod_Q3BSP_LoadLightGrid: invalid lightgrid lump size %i bytes, should be %i bytes (%ix%ix%i)", l->filelen, (int)(count * sizeof(*in)), loadmodel->brushq3.num_lightgrid_isize[0], loadmodel->brushq3.num_lightgrid_isize[1], loadmodel->brushq3.num_lightgrid_isize[2]);
5513 if (l->filelen != count * (int)sizeof(*in))
5514 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5515 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5516 loadmodel->brushq3.data_lightgrid = out;
5517 loadmodel->brushq3.num_lightgrid = count;
5518 // no swapping or validation necessary
5519 memcpy(out, in, count * (int)sizeof(*out));
5523 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5528 if (l->filelen == 0)
5531 // unvised maps often have cluster indices even without pvs, so check
5532 // leafs to find real number of clusters
5533 loadmodel->brush.num_pvsclusters = 1;
5534 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5535 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5538 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5539 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5540 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5541 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5545 in = (q3dpvs_t *)(mod_base + l->fileofs);
5547 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5549 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5550 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5551 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5552 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5553 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5554 if (l->filelen < totalchains + (int)sizeof(*in))
5555 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);
5557 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5558 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5561 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5563 int i, j, k, index[3];
5564 float transformed[3], blend1, blend2, blend, stylescale;
5565 q3dlightgrid_t *a, *s;
5567 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5568 stylescale = r_refdef.scene.rtlightstylevalue[0];
5570 if (!model->brushq3.num_lightgrid)
5572 ambientcolor[0] = stylescale;
5573 ambientcolor[1] = stylescale;
5574 ambientcolor[2] = stylescale;
5578 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5579 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5580 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5581 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5582 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5583 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5584 index[0] = (int)floor(transformed[0]);
5585 index[1] = (int)floor(transformed[1]);
5586 index[2] = (int)floor(transformed[2]);
5587 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5589 // now lerp the values
5590 VectorClear(diffusenormal);
5591 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5592 for (k = 0;k < 2;k++)
5594 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5595 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5597 for (j = 0;j < 2;j++)
5599 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5600 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5602 for (i = 0;i < 2;i++)
5604 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5605 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5607 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5608 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5609 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5610 // this uses the mod_md3_sin table because the values are
5611 // already in the 0-255 range, the 64+ bias fetches a cosine
5612 // instead of a sine value
5613 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5614 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5615 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5616 //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)));
5621 // normalize the light direction before turning
5622 VectorNormalize(diffusenormal);
5623 //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]);
5626 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
5631 // find which leaf the point is in
5633 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5634 // point trace the brushes
5635 leaf = (mleaf_t *)node;
5636 for (i = 0;i < leaf->numleafbrushes;i++)
5638 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5639 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5641 brush->markframe = markframe;
5642 Collision_TracePointBrushFloat(trace, point, brush);
5645 // can't do point traces on curves (they have no thickness)
5648 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)
5650 int i, startside, endside;
5651 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5653 msurface_t *surface;
5656 // walk the tree until we hit a leaf, recursing for any split cases
5659 // abort if this part of the bsp tree can not be hit by this trace
5660 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5662 plane = node->plane;
5663 // axial planes are much more common than non-axial, so an optimized
5664 // axial case pays off here
5665 if (plane->type < 3)
5667 dist1 = start[plane->type] - plane->dist;
5668 dist2 = end[plane->type] - plane->dist;
5672 dist1 = DotProduct(start, plane->normal) - plane->dist;
5673 dist2 = DotProduct(end, plane->normal) - plane->dist;
5675 startside = dist1 < 0;
5676 endside = dist2 < 0;
5677 if (startside == endside)
5679 // most of the time the line fragment is on one side of the plane
5680 node = node->children[startside];
5684 // line crosses node plane, split the line
5685 dist1 = PlaneDiff(linestart, plane);
5686 dist2 = PlaneDiff(lineend, plane);
5687 midfrac = dist1 / (dist1 - dist2);
5688 VectorLerp(linestart, midfrac, lineend, mid);
5689 // take the near side first
5690 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5691 // if we found an impact on the front side, don't waste time
5692 // exploring the far side
5693 if (midfrac <= trace->realfraction)
5694 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5698 // abort if this part of the bsp tree can not be hit by this trace
5699 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5702 nodesegmentmins[0] = min(start[0], end[0]) - 1;
5703 nodesegmentmins[1] = min(start[1], end[1]) - 1;
5704 nodesegmentmins[2] = min(start[2], end[2]) - 1;
5705 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5706 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5707 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5708 // line trace the brushes
5709 leaf = (mleaf_t *)node;
5710 for (i = 0;i < leaf->numleafbrushes;i++)
5712 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5713 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5715 brush->markframe = markframe;
5716 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5719 // can't do point traces on curves (they have no thickness)
5720 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5722 // line trace the curves
5723 for (i = 0;i < leaf->numleafsurfaces;i++)
5725 surface = model->data_surfaces + leaf->firstleafsurface[i];
5726 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5728 surface->collisionmarkframe = markframe;
5729 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5735 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)
5741 msurface_t *surface;
5743 float nodesegmentmins[3], nodesegmentmaxs[3];
5744 // walk the tree until we hit a leaf, recursing for any split cases
5747 // abort if this part of the bsp tree can not be hit by this trace
5748 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5750 plane = node->plane;
5751 // axial planes are much more common than non-axial, so an optimized
5752 // axial case pays off here
5753 if (plane->type < 3)
5755 // this is an axial plane, compare bounding box directly to it and
5756 // recurse sides accordingly
5757 // recurse down node sides
5758 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5759 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5760 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5761 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5765 // this is a non-axial plane, so check if the start and end boxes
5766 // are both on one side of the plane to handle 'diagonal' cases
5767 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5771 // segment crosses plane
5772 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5775 // if sides == 0 then the trace itself is bogus (Not A Number values),
5776 // in this case we simply pretend the trace hit nothing
5778 return; // ERROR: NAN bounding box!
5779 // take whichever side the segment box is on
5780 node = node->children[sides - 1];
5782 // abort if this part of the bsp tree can not be hit by this trace
5783 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5785 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5786 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5787 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5788 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5789 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5790 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5792 leaf = (mleaf_t *)node;
5793 for (i = 0;i < leaf->numleafbrushes;i++)
5795 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5796 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5798 brush->markframe = markframe;
5799 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5802 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5804 for (i = 0;i < leaf->numleafsurfaces;i++)
5806 surface = model->data_surfaces + leaf->firstleafsurface[i];
5807 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5809 surface->collisionmarkframe = markframe;
5810 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5816 static int markframe = 0;
5818 static void Mod_Q3BSP_TracePoint(dp_model_t *model, int frame, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
5822 memset(trace, 0, sizeof(*trace));
5823 trace->fraction = 1;
5824 trace->realfraction = 1;
5825 trace->hitsupercontentsmask = hitsupercontentsmask;
5826 if (model->brush.submodel)
5828 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5829 if (brush->colbrushf)
5830 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5833 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5836 static void Mod_Q3BSP_TraceLine(dp_model_t *model, int frame, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
5839 float segmentmins[3], segmentmaxs[3];
5840 msurface_t *surface;
5843 if (VectorCompare(start, end))
5845 Mod_Q3BSP_TracePoint(model, frame, trace, start, hitsupercontentsmask);
5849 memset(trace, 0, sizeof(*trace));
5850 trace->fraction = 1;
5851 trace->realfraction = 1;
5852 trace->hitsupercontentsmask = hitsupercontentsmask;
5853 segmentmins[0] = min(start[0], end[0]) - 1;
5854 segmentmins[1] = min(start[1], end[1]) - 1;
5855 segmentmins[2] = min(start[2], end[2]) - 1;
5856 segmentmaxs[0] = max(start[0], end[0]) + 1;
5857 segmentmaxs[1] = max(start[1], end[1]) + 1;
5858 segmentmaxs[2] = max(start[2], end[2]) + 1;
5859 if (model->brush.submodel)
5861 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5862 if (brush->colbrushf)
5863 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5864 if (mod_q3bsp_curves_collisions.integer)
5865 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5866 if (surface->num_collisiontriangles)
5867 Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5870 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5873 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)
5876 float segmentmins[3], segmentmaxs[3];
5877 msurface_t *surface;
5879 colbrushf_t *thisbrush_start, *thisbrush_end;
5880 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5882 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
5884 vec3_t shiftstart, shiftend;
5885 VectorAdd(start, boxmins, shiftstart);
5886 VectorAdd(end, boxmins, shiftend);
5887 if (VectorCompare(start, end))
5888 Mod_Q3BSP_TracePoint(model, frame, trace, shiftstart, hitsupercontentsmask);
5891 Mod_Q3BSP_TraceLine(model, frame, trace, shiftstart, shiftend, hitsupercontentsmask);
5892 VectorSubtract(trace->endpos, boxmins, trace->endpos);
5897 // box trace, performed as brush trace
5898 memset(trace, 0, sizeof(*trace));
5899 trace->fraction = 1;
5900 trace->realfraction = 1;
5901 trace->hitsupercontentsmask = hitsupercontentsmask;
5902 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5903 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5904 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5905 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5906 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5907 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5908 VectorAdd(start, boxmins, boxstartmins);
5909 VectorAdd(start, boxmaxs, boxstartmaxs);
5910 VectorAdd(end, boxmins, boxendmins);
5911 VectorAdd(end, boxmaxs, boxendmaxs);
5912 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5913 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5914 if (model->brush.submodel)
5916 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5917 if (brush->colbrushf)
5918 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5919 if (mod_q3bsp_curves_collisions.integer)
5920 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5921 if (surface->num_collisiontriangles)
5922 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5925 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5928 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5931 int supercontents = 0;
5933 // test if the point is inside each brush
5934 if (model->brush.submodel)
5936 // submodels are effectively one leaf
5937 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5938 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5939 supercontents |= brush->colbrushf->supercontents;
5943 mnode_t *node = model->brush.data_nodes;
5945 // find which leaf the point is in
5947 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5948 leaf = (mleaf_t *)node;
5949 // now check the brushes in the leaf
5950 for (i = 0;i < leaf->numleafbrushes;i++)
5952 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5953 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5954 supercontents |= brush->colbrushf->supercontents;
5957 return supercontents;
5960 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
5962 int supercontents = 0;
5963 if (nativecontents & CONTENTSQ3_SOLID)
5964 supercontents |= SUPERCONTENTS_SOLID;
5965 if (nativecontents & CONTENTSQ3_WATER)
5966 supercontents |= SUPERCONTENTS_WATER;
5967 if (nativecontents & CONTENTSQ3_SLIME)
5968 supercontents |= SUPERCONTENTS_SLIME;
5969 if (nativecontents & CONTENTSQ3_LAVA)
5970 supercontents |= SUPERCONTENTS_LAVA;
5971 if (nativecontents & CONTENTSQ3_BODY)
5972 supercontents |= SUPERCONTENTS_BODY;
5973 if (nativecontents & CONTENTSQ3_CORPSE)
5974 supercontents |= SUPERCONTENTS_CORPSE;
5975 if (nativecontents & CONTENTSQ3_NODROP)
5976 supercontents |= SUPERCONTENTS_NODROP;
5977 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5978 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5979 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5980 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5981 if (nativecontents & CONTENTSQ3_DONOTENTER)
5982 supercontents |= SUPERCONTENTS_DONOTENTER;
5983 if (nativecontents & CONTENTSQ3_BOTCLIP)
5984 supercontents |= SUPERCONTENTS_BOTCLIP;
5985 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
5986 supercontents |= SUPERCONTENTS_OPAQUE;
5987 return supercontents;
5990 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
5992 int nativecontents = 0;
5993 if (supercontents & SUPERCONTENTS_SOLID)
5994 nativecontents |= CONTENTSQ3_SOLID;
5995 if (supercontents & SUPERCONTENTS_WATER)
5996 nativecontents |= CONTENTSQ3_WATER;
5997 if (supercontents & SUPERCONTENTS_SLIME)
5998 nativecontents |= CONTENTSQ3_SLIME;
5999 if (supercontents & SUPERCONTENTS_LAVA)
6000 nativecontents |= CONTENTSQ3_LAVA;
6001 if (supercontents & SUPERCONTENTS_BODY)
6002 nativecontents |= CONTENTSQ3_BODY;
6003 if (supercontents & SUPERCONTENTS_CORPSE)
6004 nativecontents |= CONTENTSQ3_CORPSE;
6005 if (supercontents & SUPERCONTENTS_NODROP)
6006 nativecontents |= CONTENTSQ3_NODROP;
6007 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
6008 nativecontents |= CONTENTSQ3_PLAYERCLIP;
6009 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
6010 nativecontents |= CONTENTSQ3_MONSTERCLIP;
6011 if (supercontents & SUPERCONTENTS_DONOTENTER)
6012 nativecontents |= CONTENTSQ3_DONOTENTER;
6013 if (supercontents & SUPERCONTENTS_BOTCLIP)
6014 nativecontents |= CONTENTSQ3_BOTCLIP;
6015 if (!(supercontents & SUPERCONTENTS_OPAQUE))
6016 nativecontents |= CONTENTSQ3_TRANSLUCENT;
6017 return nativecontents;
6020 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
6025 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
6026 node = node->children[1];
6028 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
6029 if (loadmodel->brush.num_leafs < numleafs)
6030 loadmodel->brush.num_leafs = numleafs;
6033 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6035 int i, j, numshadowmeshtriangles, lumps;
6036 q3dheader_t *header;
6037 float corner[3], yawradius, modelradius;
6038 msurface_t *surface;
6040 mod->modeldatatypestring = "Q3BSP";
6042 mod->type = mod_brushq3;
6043 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
6046 header = (q3dheader_t *)buffer;
6047 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
6048 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
6050 i = LittleLong(header->version);
6051 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
6052 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
6054 mod->soundfromcenter = true;
6055 mod->TraceBox = Mod_Q3BSP_TraceBox;
6056 mod->TraceLine = Mod_Q3BSP_TraceLine;
6057 mod->TracePoint = Mod_Q3BSP_TracePoint;
6058 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
6059 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
6060 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
6061 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
6062 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
6063 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
6064 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
6065 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
6066 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
6067 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
6068 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
6069 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
6070 mod->brush.AmbientSoundLevelsForPoint = NULL;
6071 mod->brush.RoundUpToHullSize = NULL;
6072 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
6073 mod->Draw = R_Q1BSP_Draw;
6074 mod->DrawDepth = R_Q1BSP_DrawDepth;
6075 mod->DrawDebug = R_Q1BSP_DrawDebug;
6076 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
6077 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6078 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6079 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6080 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6081 mod->DrawLight = R_Q1BSP_DrawLight;
6083 mod_base = (unsigned char *)header;
6085 // swap all the lumps
6086 header->ident = LittleLong(header->ident);
6087 header->version = LittleLong(header->version);
6088 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
6089 for (i = 0;i < lumps;i++)
6091 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
6092 if((char *) bufferend < (char *) buffer + j)
6093 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
6094 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
6095 if((char *) bufferend < (char *) buffer + j)
6096 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
6099 * NO, do NOT clear them!
6100 * they contain actual data referenced by other stuff.
6101 * Instead, before using the advertisements lump, check header->versio
6103 * Sorry, but otherwise it breaks memory of the first lump.
6104 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
6106 header->lumps[i].fileofs = 0;
6107 header->lumps[i].filelen = 0;
6111 mod->brush.qw_md4sum = 0;
6112 mod->brush.qw_md4sum2 = 0;
6113 for (i = 0;i < lumps;i++)
6115 if (i == Q3LUMP_ENTITIES)
6117 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6118 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
6120 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6122 // all this checksumming can take a while, so let's send keepalives here too
6123 CL_KeepaliveMessage(false);
6126 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
6127 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
6128 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
6129 if (header->version == Q3BSPVERSION_IG)
6130 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
6132 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
6133 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
6134 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
6135 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
6136 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
6137 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
6138 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
6139 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
6140 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
6141 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
6142 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
6143 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
6144 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
6145 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
6146 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
6148 // the MakePortals code works fine on the q3bsp data as well
6149 Mod_Q1BSP_MakePortals();
6151 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
6152 loadmodel->brush.supportwateralpha = true;
6154 // make a single combined shadow mesh to allow optimized shadow volume creation
6155 numshadowmeshtriangles = 0;
6156 if (cls.state != ca_dedicated)
6158 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6160 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
6161 numshadowmeshtriangles += surface->num_triangles;
6163 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
6164 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6165 if (surface->num_triangles > 0)
6166 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));
6167 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
6168 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
6171 loadmodel->brush.num_leafs = 0;
6172 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
6175 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
6180 // duplicate the basic information
6181 dpsnprintf(name, sizeof(name), "*%i", i);
6182 mod = Mod_FindName(name, loadmodel->name);
6183 // copy the base model to this one
6185 // rename the clone back to its proper name
6186 strlcpy(mod->name, name, sizeof(mod->name));
6187 mod->brush.parentmodel = loadmodel;
6188 // textures and memory belong to the main model
6189 mod->texturepool = NULL;
6190 mod->mempool = NULL;
6191 mod->brush.TraceLineOfSight = NULL;
6192 mod->brush.GetPVS = NULL;
6193 mod->brush.FatPVS = NULL;
6194 mod->brush.BoxTouchingPVS = NULL;
6195 mod->brush.BoxTouchingLeafPVS = NULL;
6196 mod->brush.BoxTouchingVisibleLeafs = NULL;
6197 mod->brush.FindBoxClusters = NULL;
6198 mod->brush.LightPoint = NULL;
6199 mod->brush.AmbientSoundLevelsForPoint = NULL;
6201 mod->brush.submodel = i;
6203 // make the model surface list (used by shadowing/lighting)
6204 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
6205 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
6206 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
6207 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
6208 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
6209 Mod_MakeSortedSurfaces(mod);
6211 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
6212 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
6213 // enlarge the bounding box to enclose all geometry of this model,
6214 // because q3map2 sometimes lies (mostly to affect the lightgrid),
6215 // which can in turn mess up the farclip (as well as culling when
6216 // outside the level - an unimportant concern)
6218 //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]);
6219 for (j = 0;j < mod->nummodelsurfaces;j++)
6221 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
6222 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
6224 if (!surface->num_vertices)
6226 for (k = 0;k < surface->num_vertices;k++, v += 3)
6228 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
6229 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
6230 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
6231 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
6232 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
6233 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
6236 //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]);
6237 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
6238 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
6239 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
6240 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
6241 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
6242 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
6243 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
6244 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
6245 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
6246 mod->yawmins[2] = mod->normalmins[2];
6247 mod->yawmaxs[2] = mod->normalmaxs[2];
6248 mod->radius = modelradius;
6249 mod->radius2 = modelradius * modelradius;
6251 // this gets altered below if sky or water is used
6252 mod->DrawSky = NULL;
6253 mod->DrawAddWaterPlanes = NULL;
6255 for (j = 0;j < mod->nummodelsurfaces;j++)
6256 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
6258 if (j < mod->nummodelsurfaces)
6259 mod->DrawSky = R_Q1BSP_DrawSky;
6261 for (j = 0;j < mod->nummodelsurfaces;j++)
6262 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
6264 if (j < mod->nummodelsurfaces)
6265 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
6269 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6271 int i = LittleLong(((int *)buffer)[1]);
6272 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
6273 Mod_Q3BSP_Load(mod,buffer, bufferend);
6274 else if (i == Q2BSPVERSION)
6275 Mod_Q2BSP_Load(mod,buffer, bufferend);
6277 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
6280 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6282 Host_Error("Mod_MAP_Load: not yet implemented");
6285 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
6287 // we already have done PVS culling at this point...
6288 // so we don't need to do it again.
6291 vec3_t testorigin, mins, maxs;
6293 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
6294 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
6295 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
6297 if(model->brush.TraceLineOfSight(model, eye, testorigin))
6300 // expand the box a little
6301 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
6302 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
6303 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
6304 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
6305 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
6306 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
6308 for(i = 0; i != numsamples; ++i)
6310 testorigin[0] = lhrandom(mins[0], maxs[0]);
6311 testorigin[1] = lhrandom(mins[1], maxs[1]);
6312 testorigin[2] = lhrandom(mins[2], maxs[2]);
6314 if(model->brush.TraceLineOfSight(model, eye, testorigin))