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_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)
856 // this function currently only supports same size start and end
858 RecursiveHullCheckTraceInfo_t rhc;
860 memset(&rhc, 0, sizeof(rhc));
861 memset(trace, 0, sizeof(trace_t));
863 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
864 rhc.trace->fraction = 1;
865 rhc.trace->realfraction = 1;
866 rhc.trace->allsolid = true;
867 VectorSubtract(boxmaxs, boxmins, boxsize);
869 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
870 else if (model->brush.ishlbsp)
872 // LordHavoc: this has to have a minor tolerance (the .1) because of
873 // minor float precision errors from the box being transformed around
874 if (boxsize[0] < 32.1)
876 if (boxsize[2] < 54) // pick the nearest of 36 or 72
877 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
879 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
882 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
886 // LordHavoc: this has to have a minor tolerance (the .1) because of
887 // minor float precision errors from the box being transformed around
888 if (boxsize[0] < 32.1)
889 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
891 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
893 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
894 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
895 VectorSubtract(rhc.end, rhc.start, rhc.dist);
896 #if COLLISIONPARANOID >= 2
897 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]);
898 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
903 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
904 memset(&testtrace, 0, sizeof(trace_t));
905 rhc.trace = &testtrace;
906 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
907 rhc.trace->fraction = 1;
908 rhc.trace->realfraction = 1;
909 rhc.trace->allsolid = true;
910 VectorCopy(test, rhc.start);
911 VectorCopy(test, rhc.end);
912 VectorClear(rhc.dist);
913 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
914 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
915 if (!trace->startsolid && testtrace.startsolid)
916 Con_Printf(" - ended in solid!\n");
920 if (VectorLength2(rhc.dist))
921 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
923 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
927 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
929 int num = model->brushq1.hulls[0].firstclipnode;
931 mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
932 mplane_t *planes = model->brushq1.hulls[0].planes;
935 plane = planes + nodes[num].planenum;
936 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
938 return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
941 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)
945 colplanef_t cbox_planes[6];
946 cbox.supercontents = boxsupercontents;
949 cbox.numtriangles = 0;
950 cbox.planes = cbox_planes;
952 cbox.elements = NULL;
960 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];
961 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];
962 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];
963 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];
964 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];
965 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];
966 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
967 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
968 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
969 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
970 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
971 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
972 memset(trace, 0, sizeof(trace_t));
973 trace->hitsupercontentsmask = hitsupercontentsmask;
975 trace->realfraction = 1;
976 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
978 RecursiveHullCheckTraceInfo_t rhc;
979 static hull_t box_hull;
980 static mclipnode_t box_clipnodes[6];
981 static mplane_t box_planes[6];
982 // fill in a default trace
983 memset(&rhc, 0, sizeof(rhc));
984 memset(trace, 0, sizeof(trace_t));
985 //To keep everything totally uniform, bounding boxes are turned into small
986 //BSP trees instead of being compared directly.
987 // create a temp hull from bounding box sizes
988 box_planes[0].dist = cmaxs[0] - mins[0];
989 box_planes[1].dist = cmins[0] - maxs[0];
990 box_planes[2].dist = cmaxs[1] - mins[1];
991 box_planes[3].dist = cmins[1] - maxs[1];
992 box_planes[4].dist = cmaxs[2] - mins[2];
993 box_planes[5].dist = cmins[2] - maxs[2];
994 #if COLLISIONPARANOID >= 3
995 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]);
998 if (box_hull.clipnodes == NULL)
1002 //Set up the planes and clipnodes so that the six floats of a bounding box
1003 //can just be stored out and get a proper hull_t structure.
1005 box_hull.clipnodes = box_clipnodes;
1006 box_hull.planes = box_planes;
1007 box_hull.firstclipnode = 0;
1008 box_hull.lastclipnode = 5;
1010 for (i = 0;i < 6;i++)
1012 box_clipnodes[i].planenum = i;
1016 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1018 box_clipnodes[i].children[side^1] = i + 1;
1020 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1022 box_planes[i].type = i>>1;
1023 box_planes[i].normal[i>>1] = 1;
1027 // trace a line through the generated clipping hull
1028 //rhc.boxsupercontents = boxsupercontents;
1029 rhc.hull = &box_hull;
1031 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1032 rhc.trace->fraction = 1;
1033 rhc.trace->realfraction = 1;
1034 rhc.trace->allsolid = true;
1035 VectorCopy(start, rhc.start);
1036 VectorCopy(end, rhc.end);
1037 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1038 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1039 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1040 if (rhc.trace->startsupercontents)
1041 rhc.trace->startsupercontents = boxsupercontents;
1045 static int Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
1048 double midf, mid[3];
1054 // find the point distances
1055 mplane_t *plane = node->plane;
1056 if (plane->type < 3)
1058 t1 = p1[plane->type] - plane->dist;
1059 t2 = p2[plane->type] - plane->dist;
1063 t1 = DotProduct (plane->normal, p1) - plane->dist;
1064 t2 = DotProduct (plane->normal, p2) - plane->dist;
1071 node = node->children[1];
1080 node = node->children[0];
1086 midf = t1 / (t1 - t2);
1087 VectorLerp(p1, midf, p2, mid);
1089 // recurse both sides, front side first
1090 // return 2 if empty is followed by solid (hit something)
1091 // do not return 2 if both are solid or both empty,
1092 // or if start is solid and end is empty
1093 // as these degenerate cases usually indicate the eye is in solid and
1094 // should see the target point anyway
1095 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
1098 ret = Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
1103 return ((mleaf_t *)node)->clusterindex < 0;
1106 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1108 // this function currently only supports same size start and end
1109 double tracestart[3], traceend[3];
1110 VectorCopy(start, tracestart);
1111 VectorCopy(end, traceend);
1112 return Mod_Q1BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend) != 2;
1115 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)
1119 float mid, distz = endz - startz;
1123 return false; // didn't hit anything
1125 switch (node->plane->type)
1128 node = node->children[x < node->plane->dist];
1131 node = node->children[y < node->plane->dist];
1134 side = startz < node->plane->dist;
1135 if ((endz < node->plane->dist) == side)
1137 node = node->children[side];
1140 // found an intersection
1141 mid = node->plane->dist;
1144 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1145 front += startz * node->plane->normal[2];
1146 back += endz * node->plane->normal[2];
1147 side = front < node->plane->dist;
1148 if ((back < node->plane->dist) == side)
1150 node = node->children[side];
1153 // found an intersection
1154 mid = startz + distz * (front - node->plane->dist) / (front - back);
1158 // go down front side
1159 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1160 return true; // hit something
1163 // check for impact on this node
1164 if (node->numsurfaces)
1166 int i, dsi, dti, lmwidth, lmheight;
1168 msurface_t *surface;
1169 unsigned char *lightmap;
1170 int maps, line3, size3;
1173 float scale, w, w00, w01, w10, w11;
1175 surface = model->data_surfaces + node->firstsurface;
1176 for (i = 0;i < node->numsurfaces;i++, surface++)
1178 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1179 continue; // no lightmaps
1181 // location we want to sample in the lightmap
1182 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;
1183 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;
1188 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1189 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1192 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1194 // calculate bilinear interpolation factors
1195 // and also multiply by fixedpoint conversion factors
1198 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1199 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1200 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1201 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1203 // values for pointer math
1204 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1205 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1207 // look up the pixel
1208 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1210 // bilinear filter each lightmap style, and sum them
1211 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1213 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1214 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1215 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1216 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1217 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1221 return true; // success
1226 // go down back side
1227 node = node->children[side ^ 1];
1229 distz = endz - startz;
1234 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1236 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1237 VectorSet(diffusenormal, 0, 0, 1);
1239 if (!model->brushq1.lightdata)
1241 VectorSet(ambientcolor, 1, 1, 1);
1242 VectorSet(diffusecolor, 0, 0, 0);
1246 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);
1249 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1252 unsigned char *outstart = out;
1253 while (out < outend)
1257 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));
1267 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));
1270 for (c = *in++;c > 0;c--)
1274 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));
1285 R_Q1BSP_LoadSplitSky
1287 A sky texture is 256*128, with the right side being a masked overlay
1290 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1293 unsigned solidpixels[128*128], alphapixels[128*128];
1295 // allocate a texture pool if we need it
1296 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1297 loadmodel->texturepool = R_AllocTexturePool();
1299 if (bytesperpixel == 4)
1301 for (i = 0;i < 128;i++)
1303 for (j = 0;j < 128;j++)
1305 solidpixels[(i*128) + j] = ((unsigned *)src)[i*256+j+128];
1306 alphapixels[(i*128) + j] = ((unsigned *)src)[i*256+j];
1312 // make an average value for the back to avoid
1313 // a fringe on the top level
1322 for (i = 0;i < 128;i++)
1324 for (j = 0;j < 128;j++)
1326 p = src[i*256 + j + 128];
1327 r += palette_rgb[p][0];
1328 g += palette_rgb[p][1];
1329 b += palette_rgb[p][2];
1332 bgra.b[2] = r/(128*128);
1333 bgra.b[1] = g/(128*128);
1334 bgra.b[0] = b/(128*128);
1336 for (i = 0;i < 128;i++)
1338 for (j = 0;j < 128;j++)
1340 solidpixels[(i*128) + j] = palette_bgra_complete[src[i*256 + j + 128]];
1342 alphapixels[(i*128) + j] = p ? palette_bgra_complete[p] : bgra.i;
1347 loadmodel->brush.solidskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_solidtexture", 128, 128, (unsigned char *) solidpixels, TEXTYPE_BGRA, TEXF_PRECACHE, NULL);
1348 loadmodel->brush.alphaskytexture = R_LoadTexture2D(loadmodel->texturepool, "sky_alphatexture", 128, 128, (unsigned char *) alphapixels, TEXTYPE_BGRA, TEXF_ALPHA | TEXF_PRECACHE, NULL);
1351 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1353 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1354 skinframe_t *skinframe;
1356 texture_t *tx, *tx2, *anims[10], *altanims[10];
1358 unsigned char *data, *mtdata;
1360 char mapname[MAX_QPATH], name[MAX_QPATH];
1361 unsigned char zero[4];
1363 memset(zero, 0, sizeof(zero));
1365 loadmodel->data_textures = NULL;
1367 // add two slots for notexture walls and notexture liquids
1370 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1371 m->nummiptex = LittleLong (m->nummiptex);
1372 loadmodel->num_textures = m->nummiptex + 2;
1373 loadmodel->num_texturesperskin = loadmodel->num_textures;
1378 loadmodel->num_textures = 2;
1379 loadmodel->num_texturesperskin = loadmodel->num_textures;
1382 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1384 // fill out all slots with notexture
1385 if (cls.state != ca_dedicated)
1386 skinframe = R_SkinFrame_LoadMissing();
1389 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1391 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1394 if (cls.state != ca_dedicated)
1396 tx->numskinframes = 1;
1397 tx->skinframerate = 1;
1398 tx->skinframes[0] = skinframe;
1399 tx->currentskinframe = tx->skinframes[0];
1401 tx->basematerialflags = MATERIALFLAG_WALL;
1402 if (i == loadmodel->num_textures - 1)
1404 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1405 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1406 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1410 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1411 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1413 tx->currentframe = tx;
1415 // clear water settings
1418 tx->refractfactor = 1;
1419 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1420 tx->reflectfactor = 1;
1421 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1422 tx->r_water_wateralpha = 1;
1427 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1431 s = loadmodel->name;
1432 if (!strncasecmp(s, "maps/", 5))
1434 FS_StripExtension(s, mapname, sizeof(mapname));
1436 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1438 // LordHavoc: mostly rewritten map texture loader
1439 for (i = 0;i < m->nummiptex;i++)
1441 dofs[i] = LittleLong(dofs[i]);
1442 if (r_nosurftextures.integer)
1446 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1449 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1451 // copy name, but only up to 16 characters
1452 // (the output buffer can hold more than this, but the input buffer is
1454 for (j = 0;j < 16 && dmiptex->name[j];j++)
1455 name[j] = dmiptex->name[j];
1460 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1461 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1464 mtwidth = LittleLong(dmiptex->width);
1465 mtheight = LittleLong(dmiptex->height);
1467 j = LittleLong(dmiptex->offsets[0]);
1471 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1473 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1476 mtdata = (unsigned char *)dmiptex + j;
1479 if ((mtwidth & 15) || (mtheight & 15))
1480 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1482 // LordHavoc: force all names to lowercase
1483 for (j = 0;name[j];j++)
1484 if (name[j] >= 'A' && name[j] <= 'Z')
1485 name[j] += 'a' - 'A';
1487 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1490 tx = loadmodel->data_textures + i;
1491 strlcpy(tx->name, name, sizeof(tx->name));
1492 tx->width = mtwidth;
1493 tx->height = mtheight;
1495 if (tx->name[0] == '*')
1497 if (!strncmp(tx->name, "*lava", 5))
1499 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1500 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1502 else if (!strncmp(tx->name, "*slime", 6))
1504 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1505 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1509 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1510 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1513 else if (!strncmp(tx->name, "sky", 3))
1515 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1516 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1520 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1521 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1524 if (cls.state != ca_dedicated)
1526 // LordHavoc: HL sky textures are entirely different than quake
1527 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == 256 && mtheight == 128)
1529 data = loadimagepixelsbgra(tx->name, false, false);
1530 if (data && image_width == 256 && image_height == 128)
1532 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1535 else if (mtdata != NULL)
1536 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1540 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);
1542 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);
1545 // did not find external texture, load it from the bsp or wad3
1546 if (loadmodel->brush.ishlbsp)
1548 // internal texture overrides wad
1549 unsigned char *pixels, *freepixels;
1550 pixels = freepixels = NULL;
1552 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1554 pixels = freepixels = W_GetTextureBGRA(tx->name);
1557 tx->width = image_width;
1558 tx->height = image_height;
1559 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1562 Mem_Free(freepixels);
1564 else if (mtdata) // texture included
1565 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);
1567 // if skinframe is still NULL the "missing" texture will be used
1569 tx->skinframes[0] = skinframe;
1572 tx->basematerialflags = MATERIALFLAG_WALL;
1573 if (tx->name[0] == '*')
1575 // LordHavoc: some turbulent textures should not be affected by wateralpha
1576 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1578 // replace the texture with transparent black
1579 Vector4Set(zero, 128, 128, 128, 128);
1580 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1581 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1583 else if (!strncmp(tx->name,"*lava",5)
1584 || !strncmp(tx->name,"*teleport",9)
1585 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1586 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1588 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1589 if (tx->skinframes[0] && tx->skinframes[0]->fog)
1590 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1592 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1594 // replace the texture with black
1595 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1596 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1598 else if (!strncmp(tx->name, "sky", 3))
1599 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1600 else if (!strcmp(tx->name, "caulk"))
1601 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1602 else if (tx->skinframes[0] && tx->skinframes[0]->fog)
1603 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1605 // start out with no animation
1606 tx->currentframe = tx;
1607 tx->currentskinframe = tx->skinframes[0];
1611 // sequence the animations
1612 for (i = 0;i < m->nummiptex;i++)
1614 tx = loadmodel->data_textures + i;
1615 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1617 if (tx->anim_total[0] || tx->anim_total[1])
1618 continue; // already sequenced
1620 // find the number of frames in the animation
1621 memset(anims, 0, sizeof(anims));
1622 memset(altanims, 0, sizeof(altanims));
1624 for (j = i;j < m->nummiptex;j++)
1626 tx2 = loadmodel->data_textures + j;
1627 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1631 if (num >= '0' && num <= '9')
1632 anims[num - '0'] = tx2;
1633 else if (num >= 'a' && num <= 'j')
1634 altanims[num - 'a'] = tx2;
1636 Con_Printf("Bad animating texture %s\n", tx->name);
1640 for (j = 0;j < 10;j++)
1647 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1650 for (j = 0;j < max;j++)
1654 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1658 for (j = 0;j < altmax;j++)
1662 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1671 // if there is no alternate animation, duplicate the primary
1672 // animation into the alternate
1674 for (k = 0;k < 10;k++)
1675 altanims[k] = anims[k];
1678 // link together the primary animation
1679 for (j = 0;j < max;j++)
1682 tx2->animated = true;
1683 tx2->anim_total[0] = max;
1684 tx2->anim_total[1] = altmax;
1685 for (k = 0;k < 10;k++)
1687 tx2->anim_frames[0][k] = anims[k];
1688 tx2->anim_frames[1][k] = altanims[k];
1692 // if there really is an alternate anim...
1693 if (anims[0] != altanims[0])
1695 // link together the alternate animation
1696 for (j = 0;j < altmax;j++)
1699 tx2->animated = true;
1700 // the primary/alternate are reversed here
1701 tx2->anim_total[0] = altmax;
1702 tx2->anim_total[1] = max;
1703 for (k = 0;k < 10;k++)
1705 tx2->anim_frames[0][k] = altanims[k];
1706 tx2->anim_frames[1][k] = anims[k];
1713 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1716 unsigned char *in, *out, *data, d;
1717 char litfilename[MAX_QPATH];
1718 char dlitfilename[MAX_QPATH];
1719 fs_offset_t filesize;
1720 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1722 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1723 for (i=0; i<l->filelen; i++)
1724 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1726 else // LordHavoc: bsp version 29 (normal white lighting)
1728 // LordHavoc: hope is not lost yet, check for a .lit file to load
1729 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1730 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1731 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1732 strlcat (litfilename, ".lit", sizeof (litfilename));
1733 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1734 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1737 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1739 i = LittleLong(((int *)data)[1]);
1742 if (developer_loading.integer)
1743 Con_Printf("loaded %s\n", litfilename);
1744 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1745 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1747 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1750 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1752 i = LittleLong(((int *)data)[1]);
1755 if (developer_loading.integer)
1756 Con_Printf("loaded %s\n", dlitfilename);
1757 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1758 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1759 loadmodel->brushq3.deluxemapping_modelspace = false;
1760 loadmodel->brushq3.deluxemapping = true;
1769 Con_Printf("Unknown .lit file version (%d)\n", i);
1771 else if (filesize == 8)
1772 Con_Print("Empty .lit file, ignoring\n");
1774 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1781 // LordHavoc: oh well, expand the white lighting data
1784 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1785 in = mod_base + l->fileofs;
1786 out = loadmodel->brushq1.lightdata;
1787 for (i = 0;i < l->filelen;i++)
1797 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1799 loadmodel->brushq1.num_compressedpvs = 0;
1800 loadmodel->brushq1.data_compressedpvs = NULL;
1803 loadmodel->brushq1.num_compressedpvs = l->filelen;
1804 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1805 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1808 // used only for HalfLife maps
1809 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1811 char key[128], value[4096];
1815 if (!COM_ParseToken_Simple(&data, false, false))
1817 if (com_token[0] != '{')
1821 if (!COM_ParseToken_Simple(&data, false, false))
1823 if (com_token[0] == '}')
1824 break; // end of worldspawn
1825 if (com_token[0] == '_')
1826 strlcpy(key, com_token + 1, sizeof(key));
1828 strlcpy(key, com_token, sizeof(key));
1829 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1830 key[strlen(key)-1] = 0;
1831 if (!COM_ParseToken_Simple(&data, false, false))
1833 dpsnprintf(value, sizeof(value), "%s", com_token);
1834 if (!strcmp("wad", key)) // for HalfLife maps
1836 if (loadmodel->brush.ishlbsp)
1839 for (i = 0;i < (int)sizeof(value);i++)
1840 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1844 for (;i < (int)sizeof(value);i++)
1846 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1847 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1849 else if (value[i] == ';' || value[i] == 0)
1853 W_LoadTextureWadFile(&value[j], false);
1865 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1867 loadmodel->brush.entities = NULL;
1870 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
1871 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1872 loadmodel->brush.entities[l->filelen] = 0;
1873 if (loadmodel->brush.ishlbsp)
1874 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1878 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1884 in = (dvertex_t *)(mod_base + l->fileofs);
1885 if (l->filelen % sizeof(*in))
1886 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1887 count = l->filelen / sizeof(*in);
1888 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1890 loadmodel->brushq1.vertexes = out;
1891 loadmodel->brushq1.numvertexes = count;
1893 for ( i=0 ; i<count ; i++, in++, out++)
1895 out->position[0] = LittleFloat(in->point[0]);
1896 out->position[1] = LittleFloat(in->point[1]);
1897 out->position[2] = LittleFloat(in->point[2]);
1901 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1902 // can be used for this
1904 int SB_ReadInt (unsigned char **buffer)
1907 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1913 float SB_ReadFloat (unsigned char **buffer)
1921 u.i = SB_ReadInt (buffer);
1925 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1927 unsigned char *index;
1931 index = (unsigned char *)(mod_base + l->fileofs);
1932 if (l->filelen % (48+4*hullinfo->filehulls))
1933 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1935 count = l->filelen / (48+4*hullinfo->filehulls);
1936 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1938 loadmodel->brushq1.submodels = out;
1939 loadmodel->brush.numsubmodels = count;
1941 for (i = 0; i < count; i++, out++)
1943 // spread out the mins / maxs by a pixel
1944 out->mins[0] = SB_ReadFloat (&index) - 1;
1945 out->mins[1] = SB_ReadFloat (&index) - 1;
1946 out->mins[2] = SB_ReadFloat (&index) - 1;
1947 out->maxs[0] = SB_ReadFloat (&index) + 1;
1948 out->maxs[1] = SB_ReadFloat (&index) + 1;
1949 out->maxs[2] = SB_ReadFloat (&index) + 1;
1950 out->origin[0] = SB_ReadFloat (&index);
1951 out->origin[1] = SB_ReadFloat (&index);
1952 out->origin[2] = SB_ReadFloat (&index);
1953 for (j = 0; j < hullinfo->filehulls; j++)
1954 out->headnode[j] = SB_ReadInt (&index);
1955 out->visleafs = SB_ReadInt (&index);
1956 out->firstface = SB_ReadInt (&index);
1957 out->numfaces = SB_ReadInt (&index);
1961 static void Mod_Q1BSP_LoadEdges(lump_t *l)
1967 in = (dedge_t *)(mod_base + l->fileofs);
1968 if (l->filelen % sizeof(*in))
1969 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
1970 count = l->filelen / sizeof(*in);
1971 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
1973 loadmodel->brushq1.edges = out;
1974 loadmodel->brushq1.numedges = count;
1976 for ( i=0 ; i<count ; i++, in++, out++)
1978 out->v[0] = (unsigned short)LittleShort(in->v[0]);
1979 out->v[1] = (unsigned short)LittleShort(in->v[1]);
1980 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
1982 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);
1983 if(!loadmodel->brushq1.numvertexes)
1984 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
1992 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
1996 int i, j, k, count, miptex;
1998 in = (texinfo_t *)(mod_base + l->fileofs);
1999 if (l->filelen % sizeof(*in))
2000 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2001 count = l->filelen / sizeof(*in);
2002 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2004 loadmodel->brushq1.texinfo = out;
2005 loadmodel->brushq1.numtexinfo = count;
2007 for (i = 0;i < count;i++, in++, out++)
2009 for (k = 0;k < 2;k++)
2010 for (j = 0;j < 4;j++)
2011 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2013 miptex = LittleLong(in->miptex);
2014 out->flags = LittleLong(in->flags);
2016 out->texture = NULL;
2017 if (loadmodel->data_textures)
2019 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2020 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2022 out->texture = loadmodel->data_textures + miptex;
2024 if (out->flags & TEX_SPECIAL)
2026 // if texture chosen is NULL or the shader needs a lightmap,
2027 // force to notexture water shader
2028 if (out->texture == NULL)
2029 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2033 // if texture chosen is NULL, force to notexture
2034 if (out->texture == NULL)
2035 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2041 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2046 mins[0] = mins[1] = mins[2] = 9999;
2047 maxs[0] = maxs[1] = maxs[2] = -9999;
2049 for (i = 0;i < numverts;i++)
2051 for (j = 0;j < 3;j++, v++)
2061 #define MAX_SUBDIVPOLYTRIANGLES 4096
2062 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2064 static int subdivpolyverts, subdivpolytriangles;
2065 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2066 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2068 static int subdivpolylookupvert(vec3_t v)
2071 for (i = 0;i < subdivpolyverts;i++)
2072 if (subdivpolyvert[i][0] == v[0]
2073 && subdivpolyvert[i][1] == v[1]
2074 && subdivpolyvert[i][2] == v[2])
2076 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2077 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2078 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2079 return subdivpolyverts++;
2082 static void SubdividePolygon(int numverts, float *verts)
2084 int i, i1, i2, i3, f, b, c, p;
2085 vec3_t mins, maxs, front[256], back[256];
2086 float m, *pv, *cv, dist[256], frac;
2089 Host_Error("SubdividePolygon: ran out of verts in buffer");
2091 BoundPoly(numverts, verts, mins, maxs);
2093 for (i = 0;i < 3;i++)
2095 m = (mins[i] + maxs[i]) * 0.5;
2096 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2097 if (maxs[i] - m < 8)
2099 if (m - mins[i] < 8)
2103 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2104 dist[c] = cv[i] - m;
2107 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2111 VectorCopy(pv, front[f]);
2116 VectorCopy(pv, back[b]);
2119 if (dist[p] == 0 || dist[c] == 0)
2121 if ((dist[p] > 0) != (dist[c] > 0) )
2124 frac = dist[p] / (dist[p] - dist[c]);
2125 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2126 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2127 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2133 SubdividePolygon(f, front[0]);
2134 SubdividePolygon(b, back[0]);
2138 i1 = subdivpolylookupvert(verts);
2139 i2 = subdivpolylookupvert(verts + 3);
2140 for (i = 2;i < numverts;i++)
2142 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2144 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2148 i3 = subdivpolylookupvert(verts + i * 3);
2149 subdivpolyindex[subdivpolytriangles][0] = i1;
2150 subdivpolyindex[subdivpolytriangles][1] = i2;
2151 subdivpolyindex[subdivpolytriangles][2] = i3;
2153 subdivpolytriangles++;
2157 //Breaks a polygon up along axial 64 unit
2158 //boundaries so that turbulent and sky warps
2159 //can be done reasonably.
2160 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2166 subdivpolytriangles = 0;
2167 subdivpolyverts = 0;
2168 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2169 if (subdivpolytriangles < 1)
2170 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2172 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2173 mesh->num_vertices = subdivpolyverts;
2174 mesh->num_triangles = subdivpolytriangles;
2175 mesh->vertex = (surfvertex_t *)(mesh + 1);
2176 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2177 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2179 for (i = 0;i < mesh->num_triangles;i++)
2180 for (j = 0;j < 3;j++)
2181 mesh->index[i*3+j] = subdivpolyindex[i][j];
2183 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2185 VectorCopy(subdivpolyvert[i], v->v);
2186 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2187 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2192 /* Maximum size of a single LM */
2193 #define MAX_SINGLE_LM_SIZE 256
2201 struct alloc_lm_state
2204 struct alloc_lm_row rows[MAX_SINGLE_LM_SIZE];
2207 static void init_alloc_lm_state (struct alloc_lm_state* state)
2211 state->currentY = 0;
2212 for (r = 0; r < MAX_SINGLE_LM_SIZE; r++)
2214 state->rows[r].currentX = 0;
2215 state->rows[r].rowY = -1;
2219 static qboolean Mod_Q1BSP_AllocLightmapBlock(struct alloc_lm_state* state, int totalwidth, int totalheight, int blockwidth, int blockheight, int *outx, int *outy)
2221 struct alloc_lm_row* row;
2224 row = &(state->rows[blockheight]);
2225 if ((row->rowY < 0) || (row->currentX + blockwidth > totalwidth))
2227 if (state->currentY + blockheight <= totalheight)
2229 row->rowY = state->currentY;
2231 state->currentY += blockheight;
2235 /* See if we can stuff the block into a higher row */
2237 for (r = blockheight; r < MAX_SINGLE_LM_SIZE; r++)
2239 if ((state->rows[r].rowY >= 0)
2240 && (state->rows[r].currentX + blockwidth <= totalwidth))
2242 row = &(state->rows[r]);
2246 if (row == NULL) return false;
2250 *outx = row->currentX;
2251 row->currentX += blockwidth;
2256 extern cvar_t gl_max_size;
2257 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2260 msurface_t *surface;
2261 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2262 float texmins[2], texmaxs[2], val;
2263 rtexture_t *lightmaptexture, *deluxemaptexture;
2265 in = (dface_t *)(mod_base + l->fileofs);
2266 if (l->filelen % sizeof(*in))
2267 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2268 count = l->filelen / sizeof(*in);
2269 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2270 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2272 loadmodel->num_surfaces = count;
2274 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2278 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2280 numedges = (unsigned short)LittleShort(in->numedges);
2281 totalverts += numedges;
2282 totaltris += numedges - 2;
2285 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2287 lightmaptexture = NULL;
2288 deluxemaptexture = r_texture_blanknormalmap;
2290 lightmapsize = max(256, gl_max_size.integer);
2291 totallightmapsamples = 0;
2295 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2297 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2299 // FIXME: validate edges, texinfo, etc?
2300 firstedge = LittleLong(in->firstedge);
2301 numedges = (unsigned short)LittleShort(in->numedges);
2302 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)
2303 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2304 i = (unsigned short)LittleShort(in->texinfo);
2305 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2306 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2307 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2308 surface->texture = surface->lightmapinfo->texinfo->texture;
2310 planenum = (unsigned short)LittleShort(in->planenum);
2311 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2312 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2314 //surface->flags = surface->texture->flags;
2315 //if (LittleShort(in->side))
2316 // surface->flags |= SURF_PLANEBACK;
2317 //surface->plane = loadmodel->brush.data_planes + planenum;
2319 surface->num_firstvertex = totalverts;
2320 surface->num_vertices = numedges;
2321 surface->num_firsttriangle = totaltris;
2322 surface->num_triangles = numedges - 2;
2323 totalverts += numedges;
2324 totaltris += numedges - 2;
2326 // convert edges back to a normal polygon
2327 for (i = 0;i < surface->num_vertices;i++)
2329 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2331 // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2333 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2335 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2336 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2337 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2338 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2339 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2340 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2341 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2342 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2345 for (i = 0;i < surface->num_triangles;i++)
2347 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2348 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2349 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2352 // compile additional data about the surface geometry
2353 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);
2354 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);
2355 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2357 // generate surface extents information
2358 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2359 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2360 for (i = 1;i < surface->num_vertices;i++)
2362 for (j = 0;j < 2;j++)
2364 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2365 texmins[j] = min(texmins[j], val);
2366 texmaxs[j] = max(texmaxs[j], val);
2369 for (i = 0;i < 2;i++)
2371 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2372 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2375 smax = surface->lightmapinfo->extents[0] >> 4;
2376 tmax = surface->lightmapinfo->extents[1] >> 4;
2377 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2378 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2381 for (i = 0;i < MAXLIGHTMAPS;i++)
2382 surface->lightmapinfo->styles[i] = in->styles[i];
2383 surface->lightmaptexture = NULL;
2384 surface->deluxemaptexture = r_texture_blanknormalmap;
2385 i = LittleLong(in->lightofs);
2388 surface->lightmapinfo->samples = NULL;
2390 // give non-lightmapped water a 1x white lightmap
2391 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2393 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2394 surface->lightmapinfo->styles[0] = 0;
2395 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2399 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2400 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2401 else // LordHavoc: white lighting (bsp version 29)
2403 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2404 if (loadmodel->brushq1.nmaplightdata)
2405 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2408 // check if we should apply a lightmap to this
2409 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2411 if (ssize > 256 || tsize > 256)
2412 Host_Error("Bad surface extents");
2414 if (lightmapsize < ssize)
2415 lightmapsize = ssize;
2416 if (lightmapsize < tsize)
2417 lightmapsize = tsize;
2419 totallightmapsamples += ssize*tsize;
2421 // force lightmap upload on first time seeing the surface
2423 // additionally this is used by the later code to see if a
2424 // lightmap is needed on this surface (rather than duplicating the
2426 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2430 // small maps (such as ammo boxes especially) don't need big lightmap
2431 // textures, so this code tries to guess a good size based on
2432 // totallightmapsamples (size of the lightmaps lump basically), as well as
2433 // trying to max out the gl_max_size if there is a lot of lightmap data to
2435 // additionally, never choose a lightmapsize that is smaller than the
2436 // largest surface encountered (as it would fail)
2438 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < gl_max_size.integer) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2441 // now that we've decided the lightmap texture size, we can do the rest
2442 if (cls.state != ca_dedicated)
2444 int stainmapsize = 0;
2445 struct alloc_lm_state allocState;
2447 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2449 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2450 float u, v, ubase, vbase, uscale, vscale;
2452 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2455 smax = surface->lightmapinfo->extents[0] >> 4;
2456 tmax = surface->lightmapinfo->extents[1] >> 4;
2457 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2458 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2459 stainmapsize += ssize * tsize * 3;
2461 if (!lightmaptexture || !Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy))
2463 // allocate a texture pool if we need it
2464 if (loadmodel->texturepool == NULL)
2465 loadmodel->texturepool = R_AllocTexturePool();
2466 // could not find room, make a new lightmap
2467 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2468 if (loadmodel->brushq1.nmaplightdata)
2469 deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2471 init_alloc_lm_state (&allocState);
2472 Mod_Q1BSP_AllocLightmapBlock(&allocState, lightmapsize, lightmapsize, ssize, tsize, &lightmapx, &lightmapy);
2474 surface->lightmaptexture = lightmaptexture;
2475 surface->deluxemaptexture = deluxemaptexture;
2476 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2477 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2479 uscale = 1.0f / (float)lightmapsize;
2480 vscale = 1.0f / (float)lightmapsize;
2481 ubase = lightmapx * uscale;
2482 vbase = lightmapy * vscale;
2484 for (i = 0;i < surface->num_vertices;i++)
2486 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);
2487 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);
2488 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2489 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2490 // LordHavoc: calc lightmap data offset for vertex lighting to use
2493 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2497 if (cl_stainmaps.integer)
2499 // allocate stainmaps for permanent marks on walls and clear white
2500 unsigned char *stainsamples = NULL;
2501 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2502 memset(stainsamples, 255, stainmapsize);
2504 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2506 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2508 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2509 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2510 surface->lightmapinfo->stainsamples = stainsamples;
2511 stainsamples += ssize * tsize * 3;
2516 // generate ushort elements array if possible
2517 if (loadmodel->surfmesh.data_element3s)
2518 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2519 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2522 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2525 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2526 node->parent = parent;
2529 // this is a node, recurse to children
2530 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2531 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2532 // combine supercontents of children
2533 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2538 mleaf_t *leaf = (mleaf_t *)node;
2539 // if this is a leaf, calculate supercontents mask from all collidable
2540 // primitives in the leaf (brushes and collision surfaces)
2541 // also flag if the leaf contains any collision surfaces
2542 leaf->combinedsupercontents = 0;
2543 // combine the supercontents values of all brushes in this leaf
2544 for (j = 0;j < leaf->numleafbrushes;j++)
2545 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2546 // check if this leaf contains any collision surfaces (q3 patches)
2547 for (j = 0;j < leaf->numleafsurfaces;j++)
2549 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2550 if (surface->num_collisiontriangles)
2552 leaf->containscollisionsurfaces = true;
2553 leaf->combinedsupercontents |= surface->texture->supercontents;
2559 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2565 in = (dnode_t *)(mod_base + l->fileofs);
2566 if (l->filelen % sizeof(*in))
2567 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2568 count = l->filelen / sizeof(*in);
2569 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2571 loadmodel->brush.data_nodes = out;
2572 loadmodel->brush.num_nodes = count;
2574 for ( i=0 ; i<count ; i++, in++, out++)
2576 for (j=0 ; j<3 ; j++)
2578 out->mins[j] = LittleShort(in->mins[j]);
2579 out->maxs[j] = LittleShort(in->maxs[j]);
2582 p = LittleLong(in->planenum);
2583 out->plane = loadmodel->brush.data_planes + p;
2585 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2586 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2588 for (j=0 ; j<2 ; j++)
2590 // LordHavoc: this code supports broken bsp files produced by
2591 // arguire qbsp which can produce more than 32768 nodes, any value
2592 // below count is assumed to be a node number, any other value is
2593 // assumed to be a leaf number
2594 p = (unsigned short)LittleShort(in->children[j]);
2597 if (p < loadmodel->brush.num_nodes)
2598 out->children[j] = loadmodel->brush.data_nodes + p;
2601 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2602 // map it to the solid leaf
2603 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2608 // note this uses 65535 intentionally, -1 is leaf 0
2610 if (p < loadmodel->brush.num_leafs)
2611 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2614 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2615 // map it to the solid leaf
2616 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2622 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2625 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2631 in = (dleaf_t *)(mod_base + l->fileofs);
2632 if (l->filelen % sizeof(*in))
2633 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2634 count = l->filelen / sizeof(*in);
2635 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2637 loadmodel->brush.data_leafs = out;
2638 loadmodel->brush.num_leafs = count;
2639 // get visleafs from the submodel data
2640 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2641 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2642 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2643 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2645 for ( i=0 ; i<count ; i++, in++, out++)
2647 for (j=0 ; j<3 ; j++)
2649 out->mins[j] = LittleShort(in->mins[j]);
2650 out->maxs[j] = LittleShort(in->maxs[j]);
2653 // FIXME: this function could really benefit from some error checking
2655 out->contents = LittleLong(in->contents);
2657 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2658 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2659 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2661 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);
2662 out->firstleafsurface = NULL;
2663 out->numleafsurfaces = 0;
2666 out->clusterindex = i - 1;
2667 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2668 out->clusterindex = -1;
2670 p = LittleLong(in->visofs);
2671 // ignore visofs errors on leaf 0 (solid)
2672 if (p >= 0 && out->clusterindex >= 0)
2674 if (p >= loadmodel->brushq1.num_compressedpvs)
2675 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2677 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);
2680 for (j = 0;j < 4;j++)
2681 out->ambient_sound_level[j] = in->ambient_level[j];
2683 // FIXME: Insert caustics here
2687 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2691 const unsigned char *pvs;
2692 // if there's no vis data, assume supported (because everything is visible all the time)
2693 if (!loadmodel->brush.data_pvsclusters)
2695 // check all liquid leafs to see if they can see into empty leafs, if any
2696 // can we can assume this map supports r_wateralpha
2697 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2699 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2701 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2702 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2703 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2710 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2717 in = (dclipnode_t *)(mod_base + l->fileofs);
2718 if (l->filelen % sizeof(*in))
2719 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2720 count = l->filelen / sizeof(*in);
2721 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2723 loadmodel->brushq1.clipnodes = out;
2724 loadmodel->brushq1.numclipnodes = count;
2726 for (i = 1; i < MAX_MAP_HULLS; i++)
2728 hull = &loadmodel->brushq1.hulls[i];
2729 hull->clipnodes = out;
2730 hull->firstclipnode = 0;
2731 hull->lastclipnode = count-1;
2732 hull->planes = loadmodel->brush.data_planes;
2733 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2734 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2735 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2736 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2737 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2738 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2739 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2742 for (i=0 ; i<count ; i++, out++, in++)
2744 out->planenum = LittleLong(in->planenum);
2745 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2746 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2747 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2748 if (out->children[0] >= count)
2749 out->children[0] -= 65536;
2750 if (out->children[1] >= count)
2751 out->children[1] -= 65536;
2752 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2753 Host_Error("Corrupt clipping hull(out of range planenum)");
2757 //Duplicate the drawing hull structure as a clipping hull
2758 static void Mod_Q1BSP_MakeHull0(void)
2765 hull = &loadmodel->brushq1.hulls[0];
2767 in = loadmodel->brush.data_nodes;
2768 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2770 hull->clipnodes = out;
2771 hull->firstclipnode = 0;
2772 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2773 hull->planes = loadmodel->brush.data_planes;
2775 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2777 out->planenum = in->plane - loadmodel->brush.data_planes;
2778 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2779 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2783 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2788 in = (short *)(mod_base + l->fileofs);
2789 if (l->filelen % sizeof(*in))
2790 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2791 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2792 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2794 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2796 j = (unsigned short) LittleShort(in[i]);
2797 if (j >= loadmodel->num_surfaces)
2798 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2799 loadmodel->brush.data_leafsurfaces[i] = j;
2803 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2808 in = (int *)(mod_base + l->fileofs);
2809 if (l->filelen % sizeof(*in))
2810 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2811 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2812 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2814 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2815 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2819 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2825 in = (dplane_t *)(mod_base + l->fileofs);
2826 if (l->filelen % sizeof(*in))
2827 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2829 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2830 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2832 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2834 out->normal[0] = LittleFloat(in->normal[0]);
2835 out->normal[1] = LittleFloat(in->normal[1]);
2836 out->normal[2] = LittleFloat(in->normal[2]);
2837 out->dist = LittleFloat(in->dist);
2843 static void Mod_Q1BSP_LoadMapBrushes(void)
2847 int submodel, numbrushes;
2848 qboolean firstbrush;
2849 char *text, *maptext;
2850 char mapfilename[MAX_QPATH];
2851 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2852 strlcat (mapfilename, ".map", sizeof (mapfilename));
2853 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2857 if (!COM_ParseToken_Simple(&data, false, false))
2862 if (!COM_ParseToken_Simple(&data, false, false))
2864 if (com_token[0] != '{')
2870 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2873 if (!COM_ParseToken_Simple(&data, false, false))
2875 if (com_token[0] == '}')
2876 break; // end of entity
2877 if (com_token[0] == '{')
2884 if (submodel > loadmodel->brush.numsubmodels)
2886 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2890 model = loadmodel->brush.submodels[submodel];
2897 if (!COM_ParseToken_Simple(&data, false, false))
2899 if (com_token[0] == '}')
2900 break; // end of brush
2901 // each brush face should be this format:
2902 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2903 // FIXME: support hl .map format
2904 for (pointnum = 0;pointnum < 3;pointnum++)
2906 COM_ParseToken_Simple(&data, false, false);
2907 for (componentnum = 0;componentnum < 3;componentnum++)
2909 COM_ParseToken_Simple(&data, false, false);
2910 point[pointnum][componentnum] = atof(com_token);
2912 COM_ParseToken_Simple(&data, false, false);
2914 COM_ParseToken_Simple(&data, false, false);
2915 strlcpy(facetexture, com_token, sizeof(facetexture));
2916 COM_ParseToken_Simple(&data, false, false);
2917 //scroll_s = atof(com_token);
2918 COM_ParseToken_Simple(&data, false, false);
2919 //scroll_t = atof(com_token);
2920 COM_ParseToken_Simple(&data, false, false);
2921 //rotate = atof(com_token);
2922 COM_ParseToken_Simple(&data, false, false);
2923 //scale_s = atof(com_token);
2924 COM_ParseToken_Simple(&data, false, false);
2925 //scale_t = atof(com_token);
2926 TriangleNormal(point[0], point[1], point[2], planenormal);
2927 VectorNormalizeDouble(planenormal);
2928 planedist = DotProduct(point[0], planenormal);
2929 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2939 #define MAX_PORTALPOINTS 64
2941 typedef struct portal_s
2944 mnode_t *nodes[2]; // [0] = front side of plane
2945 struct portal_s *next[2];
2947 double points[3*MAX_PORTALPOINTS];
2948 struct portal_s *chain; // all portals are linked into a list
2952 static portal_t *portalchain;
2959 static portal_t *AllocPortal(void)
2962 p = (portal_t *)Mem_Alloc(loadmodel->mempool, sizeof(portal_t));
2963 p->chain = portalchain;
2968 static void FreePortal(portal_t *p)
2973 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2975 // process only nodes (leafs already had their box calculated)
2979 // calculate children first
2980 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2981 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2983 // make combined bounding box from children
2984 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2985 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2986 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2987 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2988 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2989 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2992 static void Mod_Q1BSP_FinalizePortals(void)
2994 int i, j, numportals, numpoints;
2995 portal_t *p, *pnext;
2998 mleaf_t *leaf, *endleaf;
3000 // tally up portal and point counts and recalculate bounding boxes for all
3001 // leafs (because qbsp is very sloppy)
3002 leaf = loadmodel->brush.data_leafs;
3003 endleaf = leaf + loadmodel->brush.num_leafs;
3004 for (;leaf < endleaf;leaf++)
3006 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
3007 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3014 // note: this check must match the one below or it will usually corrupt memory
3015 // 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
3016 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3019 numpoints += p->numpoints * 2;
3023 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3024 loadmodel->brush.num_portals = numportals;
3025 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3026 loadmodel->brush.num_portalpoints = numpoints;
3027 // clear all leaf portal chains
3028 for (i = 0;i < loadmodel->brush.num_leafs;i++)
3029 loadmodel->brush.data_leafs[i].portals = NULL;
3030 // process all portals in the global portal chain, while freeing them
3031 portal = loadmodel->brush.data_portals;
3032 point = loadmodel->brush.data_portalpoints;
3039 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3041 // note: this check must match the one above or it will usually corrupt memory
3042 // 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
3043 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3045 // first make the back to front portal(forward portal)
3046 portal->points = point;
3047 portal->numpoints = p->numpoints;
3048 portal->plane.dist = p->plane.dist;
3049 VectorCopy(p->plane.normal, portal->plane.normal);
3050 portal->here = (mleaf_t *)p->nodes[1];
3051 portal->past = (mleaf_t *)p->nodes[0];
3053 for (j = 0;j < portal->numpoints;j++)
3055 VectorCopy(p->points + j*3, point->position);
3058 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3059 PlaneClassify(&portal->plane);
3061 // link into leaf's portal chain
3062 portal->next = portal->here->portals;
3063 portal->here->portals = portal;
3065 // advance to next portal
3068 // then make the front to back portal(backward portal)
3069 portal->points = point;
3070 portal->numpoints = p->numpoints;
3071 portal->plane.dist = -p->plane.dist;
3072 VectorNegate(p->plane.normal, portal->plane.normal);
3073 portal->here = (mleaf_t *)p->nodes[0];
3074 portal->past = (mleaf_t *)p->nodes[1];
3076 for (j = portal->numpoints - 1;j >= 0;j--)
3078 VectorCopy(p->points + j*3, point->position);
3081 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3082 PlaneClassify(&portal->plane);
3084 // link into leaf's portal chain
3085 portal->next = portal->here->portals;
3086 portal->here->portals = portal;
3088 // advance to next portal
3091 // add the portal's polygon points to the leaf bounding boxes
3092 for (i = 0;i < 2;i++)
3094 leaf = (mleaf_t *)p->nodes[i];
3095 for (j = 0;j < p->numpoints;j++)
3097 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3098 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3099 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3100 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3101 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3102 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3109 // now recalculate the node bounding boxes from the leafs
3110 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes);
3118 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3121 Host_Error("AddPortalToNodes: NULL front node");
3123 Host_Error("AddPortalToNodes: NULL back node");
3124 if (p->nodes[0] || p->nodes[1])
3125 Host_Error("AddPortalToNodes: already included");
3126 // 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
3128 p->nodes[0] = front;
3129 p->next[0] = (portal_t *)front->portals;
3130 front->portals = (mportal_t *)p;
3133 p->next[1] = (portal_t *)back->portals;
3134 back->portals = (mportal_t *)p;
3139 RemovePortalFromNode
3142 static void RemovePortalFromNodes(portal_t *portal)
3146 void **portalpointer;
3148 for (i = 0;i < 2;i++)
3150 node = portal->nodes[i];
3152 portalpointer = (void **) &node->portals;
3155 t = (portal_t *)*portalpointer;
3157 Host_Error("RemovePortalFromNodes: portal not in leaf");
3161 if (portal->nodes[0] == node)
3163 *portalpointer = portal->next[0];
3164 portal->nodes[0] = NULL;
3166 else if (portal->nodes[1] == node)
3168 *portalpointer = portal->next[1];
3169 portal->nodes[1] = NULL;
3172 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3176 if (t->nodes[0] == node)
3177 portalpointer = (void **) &t->next[0];
3178 else if (t->nodes[1] == node)
3179 portalpointer = (void **) &t->next[1];
3181 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3186 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3187 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3190 mnode_t *front, *back, *other_node;
3191 mplane_t clipplane, *plane;
3192 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3193 int numfrontpoints, numbackpoints;
3194 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3196 // if a leaf, we're done
3200 plane = node->plane;
3202 front = node->children[0];
3203 back = node->children[1];
3205 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3207 // create the new portal by generating a polygon for the node plane,
3208 // and clipping it by all of the other portals(which came from nodes above this one)
3209 nodeportal = AllocPortal();
3210 nodeportal->plane = *plane;
3212 // 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)
3213 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);
3214 nodeportal->numpoints = 4;
3215 side = 0; // shut up compiler warning
3216 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3218 clipplane = portal->plane;
3219 if (portal->nodes[0] == portal->nodes[1])
3220 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3221 if (portal->nodes[0] == node)
3223 else if (portal->nodes[1] == node)
3225 clipplane.dist = -clipplane.dist;
3226 VectorNegate(clipplane.normal, clipplane.normal);
3230 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3232 for (i = 0;i < nodeportal->numpoints*3;i++)
3233 frontpoints[i] = nodeportal->points[i];
3234 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);
3235 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3239 if (nodeportal->numpoints < 3)
3241 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3242 nodeportal->numpoints = 0;
3244 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3246 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3247 nodeportal->numpoints = 0;
3250 AddPortalToNodes(nodeportal, front, back);
3252 // split the portals of this node along this node's plane and assign them to the children of this node
3253 // (migrating the portals downward through the tree)
3254 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3256 if (portal->nodes[0] == portal->nodes[1])
3257 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3258 if (portal->nodes[0] == node)
3260 else if (portal->nodes[1] == node)
3263 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3264 nextportal = portal->next[side];
3265 if (!portal->numpoints)
3268 other_node = portal->nodes[!side];
3269 RemovePortalFromNodes(portal);
3271 // cut the portal into two portals, one on each side of the node plane
3272 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);
3274 if (!numfrontpoints)
3277 AddPortalToNodes(portal, back, other_node);
3279 AddPortalToNodes(portal, other_node, back);
3285 AddPortalToNodes(portal, front, other_node);
3287 AddPortalToNodes(portal, other_node, front);
3291 // the portal is split
3292 splitportal = AllocPortal();
3293 temp = splitportal->chain;
3294 *splitportal = *portal;
3295 splitportal->chain = temp;
3296 for (i = 0;i < numbackpoints*3;i++)
3297 splitportal->points[i] = backpoints[i];
3298 splitportal->numpoints = numbackpoints;
3299 for (i = 0;i < numfrontpoints*3;i++)
3300 portal->points[i] = frontpoints[i];
3301 portal->numpoints = numfrontpoints;
3305 AddPortalToNodes(portal, front, other_node);
3306 AddPortalToNodes(splitportal, back, other_node);
3310 AddPortalToNodes(portal, other_node, front);
3311 AddPortalToNodes(splitportal, other_node, back);
3315 Mod_Q1BSP_RecursiveNodePortals(front);
3316 Mod_Q1BSP_RecursiveNodePortals(back);
3319 static void Mod_Q1BSP_MakePortals(void)
3322 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes);
3323 Mod_Q1BSP_FinalizePortals();
3326 //Returns PVS data for a given point
3327 //(note: can return NULL)
3328 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3331 node = model->brush.data_nodes;
3333 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3334 if (((mleaf_t *)node)->clusterindex >= 0)
3335 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3340 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)
3344 float d = PlaneDiff(org, node->plane);
3346 node = node->children[0];
3347 else if (d < -radius)
3348 node = node->children[1];
3351 // go down both sides
3352 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3353 node = node->children[1];
3356 // if this leaf is in a cluster, accumulate the pvs bits
3357 if (((mleaf_t *)node)->clusterindex >= 0)
3360 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3361 for (i = 0;i < pvsbytes;i++)
3362 pvsbuffer[i] |= pvs[i];
3366 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3367 //of the given point.
3368 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3370 int bytes = model->brush.num_pvsclusterbytes;
3371 bytes = min(bytes, pvsbufferlength);
3372 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3374 memset(pvsbuffer, 0xFF, bytes);
3378 memset(pvsbuffer, 0, bytes);
3379 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes);
3383 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3388 VectorSubtract(inmaxs, inmins, size);
3389 if (cmodel->brush.ishlbsp)
3392 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3393 else if (size[0] <= 32)
3395 if (size[2] < 54) // pick the nearest of 36 or 72
3396 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3398 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3401 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3406 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3407 else if (size[0] <= 32)
3408 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3410 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3412 VectorCopy(inmins, outmins);
3413 VectorAdd(inmins, hull->clip_size, outmaxs);
3416 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3421 mempool_t *mainmempool;
3422 float dist, modelyawradius, modelradius;
3423 msurface_t *surface;
3424 int numshadowmeshtriangles;
3425 hullinfo_t hullinfo;
3426 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3427 model_brush_lightstyleinfo_t styleinfo[256];
3428 unsigned char *datapointer;
3430 mod->modeldatatypestring = "Q1BSP";
3432 mod->type = mod_brushq1;
3434 header = (dheader_t *)buffer;
3436 i = LittleLong(header->version);
3437 if (i != BSPVERSION && i != 30)
3438 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3439 mod->brush.ishlbsp = i == 30;
3441 // fill in hull info
3442 VectorClear (hullinfo.hullsizes[0][0]);
3443 VectorClear (hullinfo.hullsizes[0][1]);
3444 if (mod->brush.ishlbsp)
3446 mod->modeldatatypestring = "HLBSP";
3448 hullinfo.filehulls = 4;
3449 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3450 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3451 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3452 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3453 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3454 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3458 hullinfo.filehulls = 4;
3459 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3460 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3461 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3462 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3466 mod_base = (unsigned char*)buffer;
3467 for (i = 0; i < HEADER_LUMPS; i++)
3469 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3470 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3473 mod->soundfromcenter = true;
3474 mod->TraceBox = Mod_Q1BSP_TraceBox;
3475 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3476 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3477 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3478 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3479 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3480 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3481 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3482 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3483 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3484 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3485 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3486 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3487 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3488 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3489 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3490 mod->Draw = R_Q1BSP_Draw;
3491 mod->DrawDepth = R_Q1BSP_DrawDepth;
3492 mod->DrawDebug = R_Q1BSP_DrawDebug;
3493 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3494 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3495 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3496 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3497 mod->DrawLight = R_Q1BSP_DrawLight;
3501 mod->brush.qw_md4sum = 0;
3502 mod->brush.qw_md4sum2 = 0;
3503 for (i = 0;i < HEADER_LUMPS;i++)
3505 if (i == LUMP_ENTITIES)
3507 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3508 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3510 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3513 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3514 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3515 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3516 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3517 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3518 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3519 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3520 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3521 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3522 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3523 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3524 // load submodels before leafs because they contain the number of vis leafs
3525 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3526 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3527 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3528 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3530 // check if the map supports transparent water rendering
3531 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3533 if (mod->brushq1.data_compressedpvs)
3534 Mem_Free(mod->brushq1.data_compressedpvs);
3535 mod->brushq1.data_compressedpvs = NULL;
3536 mod->brushq1.num_compressedpvs = 0;
3538 Mod_Q1BSP_MakeHull0();
3539 Mod_Q1BSP_MakePortals();
3541 mod->numframes = 2; // regular and alternate animation
3544 mainmempool = mod->mempool;
3546 // make a single combined shadow mesh to allow optimized shadow volume creation
3547 numshadowmeshtriangles = 0;
3548 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3550 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3551 numshadowmeshtriangles += surface->num_triangles;
3553 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3554 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3555 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));
3556 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3557 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3559 if (loadmodel->brush.numsubmodels)
3560 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3562 // LordHavoc: to clear the fog around the original quake submodel code, I
3564 // first of all, some background info on the submodels:
3565 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3566 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3567 // now the weird for loop itself:
3568 // the loop functions in an odd way, on each iteration it sets up the
3569 // current 'mod' model (which despite the confusing code IS the model of
3570 // the number i), at the end of the loop it duplicates the model to become
3571 // the next submodel, and loops back to set up the new submodel.
3573 // LordHavoc: now the explanation of my sane way (which works identically):
3574 // set up the world model, then on each submodel copy from the world model
3575 // and set up the submodel with the respective model info.
3576 totalstylesurfaces = 0;
3578 for (i = 0;i < mod->brush.numsubmodels;i++)
3580 memset(stylecounts, 0, sizeof(stylecounts));
3581 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3583 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3584 for (j = 0;j < MAXLIGHTMAPS;j++)
3585 stylecounts[surface->lightmapinfo->styles[j]]++;
3587 for (k = 0;k < 255;k++)
3591 totalstylesurfaces += stylecounts[k];
3594 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3595 for (i = 0;i < mod->brush.numsubmodels;i++)
3597 // LordHavoc: this code was originally at the end of this loop, but
3598 // has been transformed to something more readable at the start here.
3603 // duplicate the basic information
3604 dpsnprintf(name, sizeof(name), "*%i", i);
3605 mod = Mod_FindName(name, loadmodel->name);
3606 // copy the base model to this one
3608 // rename the clone back to its proper name
3609 strlcpy(mod->name, name, sizeof(mod->name));
3610 mod->brush.parentmodel = loadmodel;
3611 // textures and memory belong to the main model
3612 mod->texturepool = NULL;
3613 mod->mempool = NULL;
3614 mod->brush.TraceLineOfSight = NULL;
3615 mod->brush.GetPVS = NULL;
3616 mod->brush.FatPVS = NULL;
3617 mod->brush.BoxTouchingPVS = NULL;
3618 mod->brush.BoxTouchingLeafPVS = NULL;
3619 mod->brush.BoxTouchingVisibleLeafs = NULL;
3620 mod->brush.FindBoxClusters = NULL;
3621 mod->brush.LightPoint = NULL;
3622 mod->brush.AmbientSoundLevelsForPoint = NULL;
3625 mod->brush.submodel = i;
3627 if (loadmodel->brush.submodels)
3628 loadmodel->brush.submodels[i] = mod;
3630 bm = &mod->brushq1.submodels[i];
3632 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3633 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3635 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3636 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3639 mod->firstmodelsurface = bm->firstface;
3640 mod->nummodelsurfaces = bm->numfaces;
3642 // make the model surface list (used by shadowing/lighting)
3643 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3644 Mod_MakeSortedSurfaces(mod);
3646 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3647 // (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)
3648 VectorCopy(bm->mins, mod->normalmins);
3649 VectorCopy(bm->maxs, mod->normalmaxs);
3650 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3651 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3652 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3653 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3654 modelradius = modelyawradius + modelradius * modelradius;
3655 modelyawradius = sqrt(modelyawradius);
3656 modelradius = sqrt(modelradius);
3657 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3658 mod->yawmins[2] = mod->normalmins[2];
3659 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
3660 mod->yawmaxs[2] = mod->normalmaxs[2];
3661 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3662 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3663 mod->radius = modelradius;
3664 mod->radius2 = modelradius * modelradius;
3666 // this gets altered below if sky or water is used
3667 mod->DrawSky = NULL;
3668 mod->DrawAddWaterPlanes = NULL;
3670 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3671 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3672 if (mod->nummodelsurfaces)
3674 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3675 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3677 if (j < mod->nummodelsurfaces)
3678 mod->DrawSky = R_Q1BSP_DrawSky;
3680 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3681 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3683 if (j < mod->nummodelsurfaces)
3684 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3686 // build lightstyle update chains
3687 // (used to rapidly mark lightmapupdateflags on many surfaces
3688 // when d_lightstylevalue changes)
3689 memset(stylecounts, 0, sizeof(stylecounts));
3690 for (k = 0;k < mod->nummodelsurfaces;k++)
3692 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3693 for (j = 0;j < MAXLIGHTMAPS;j++)
3694 stylecounts[surface->lightmapinfo->styles[j]]++;
3696 mod->brushq1.num_lightstyles = 0;
3697 for (k = 0;k < 255;k++)
3701 styleinfo[mod->brushq1.num_lightstyles].style = k;
3702 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3703 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3704 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3705 remapstyles[k] = mod->brushq1.num_lightstyles;
3706 mod->brushq1.num_lightstyles++;
3709 for (k = 0;k < mod->nummodelsurfaces;k++)
3711 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3712 for (j = 0;j < MAXLIGHTMAPS;j++)
3714 if (surface->lightmapinfo->styles[j] != 255)
3716 int r = remapstyles[surface->lightmapinfo->styles[j]];
3717 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3721 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3722 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3726 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3727 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3729 //mod->brushq1.num_visleafs = bm->visleafs;
3732 Mod_Q1BSP_LoadMapBrushes();
3734 //Mod_Q1BSP_ProcessLightList();
3736 if (developer.integer >= 10)
3737 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);
3740 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3744 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3751 in = (void *)(mod_base + l->fileofs);
3752 if (l->filelen % sizeof(*in))
3753 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3754 count = l->filelen / sizeof(*in);
3755 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3758 loadmodel->num = count;
3760 for (i = 0;i < count;i++, in++, out++)
3766 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3773 in = (void *)(mod_base + l->fileofs);
3774 if (l->filelen % sizeof(*in))
3775 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3776 count = l->filelen / sizeof(*in);
3777 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3780 loadmodel->num = count;
3782 for (i = 0;i < count;i++, in++, out++)
3788 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3795 in = (void *)(mod_base + l->fileofs);
3796 if (l->filelen % sizeof(*in))
3797 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3798 count = l->filelen / sizeof(*in);
3799 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3802 loadmodel->num = count;
3804 for (i = 0;i < count;i++, in++, out++)
3810 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3817 in = (void *)(mod_base + l->fileofs);
3818 if (l->filelen % sizeof(*in))
3819 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3820 count = l->filelen / sizeof(*in);
3821 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3824 loadmodel->num = count;
3826 for (i = 0;i < count;i++, in++, out++)
3832 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3839 in = (void *)(mod_base + l->fileofs);
3840 if (l->filelen % sizeof(*in))
3841 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3842 count = l->filelen / sizeof(*in);
3843 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3846 loadmodel->num = count;
3848 for (i = 0;i < count;i++, in++, out++)
3854 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3861 in = (void *)(mod_base + l->fileofs);
3862 if (l->filelen % sizeof(*in))
3863 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3864 count = l->filelen / sizeof(*in);
3865 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3868 loadmodel->num = count;
3870 for (i = 0;i < count;i++, in++, out++)
3876 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3883 in = (void *)(mod_base + l->fileofs);
3884 if (l->filelen % sizeof(*in))
3885 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3886 count = l->filelen / sizeof(*in);
3887 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3890 loadmodel->num = count;
3892 for (i = 0;i < count;i++, in++, out++)
3898 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3905 in = (void *)(mod_base + l->fileofs);
3906 if (l->filelen % sizeof(*in))
3907 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3908 count = l->filelen / sizeof(*in);
3909 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3912 loadmodel->num = count;
3914 for (i = 0;i < count;i++, in++, out++)
3920 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3927 in = (void *)(mod_base + l->fileofs);
3928 if (l->filelen % sizeof(*in))
3929 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3930 count = l->filelen / sizeof(*in);
3931 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3934 loadmodel->num = count;
3936 for (i = 0;i < count;i++, in++, out++)
3942 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3949 in = (void *)(mod_base + l->fileofs);
3950 if (l->filelen % sizeof(*in))
3951 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3952 count = l->filelen / sizeof(*in);
3953 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3956 loadmodel->num = count;
3958 for (i = 0;i < count;i++, in++, out++)
3964 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3971 in = (void *)(mod_base + l->fileofs);
3972 if (l->filelen % sizeof(*in))
3973 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3974 count = l->filelen / sizeof(*in);
3975 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3978 loadmodel->num = count;
3980 for (i = 0;i < count;i++, in++, out++)
3986 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3993 in = (void *)(mod_base + l->fileofs);
3994 if (l->filelen % sizeof(*in))
3995 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3996 count = l->filelen / sizeof(*in);
3997 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4000 loadmodel->num = count;
4002 for (i = 0;i < count;i++, in++, out++)
4008 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4015 in = (void *)(mod_base + l->fileofs);
4016 if (l->filelen % sizeof(*in))
4017 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4018 count = l->filelen / sizeof(*in);
4019 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4022 loadmodel->num = count;
4024 for (i = 0;i < count;i++, in++, out++)
4030 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4037 in = (void *)(mod_base + l->fileofs);
4038 if (l->filelen % sizeof(*in))
4039 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4040 count = l->filelen / sizeof(*in);
4041 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4044 loadmodel->num = count;
4046 for (i = 0;i < count;i++, in++, out++)
4052 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4059 in = (void *)(mod_base + l->fileofs);
4060 if (l->filelen % sizeof(*in))
4061 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4062 count = l->filelen / sizeof(*in);
4063 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4066 loadmodel->num = count;
4068 for (i = 0;i < count;i++, in++, out++)
4074 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4081 in = (void *)(mod_base + l->fileofs);
4082 if (l->filelen % sizeof(*in))
4083 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4084 count = l->filelen / sizeof(*in);
4085 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4088 loadmodel->num = count;
4090 for (i = 0;i < count;i++, in++, out++)
4096 static void Mod_Q2BSP_LoadModels(lump_t *l)
4103 in = (void *)(mod_base + l->fileofs);
4104 if (l->filelen % sizeof(*in))
4105 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4106 count = l->filelen / sizeof(*in);
4107 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4110 loadmodel->num = count;
4112 for (i = 0;i < count;i++, in++, out++)
4118 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4121 q2dheader_t *header;
4123 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4125 mod->modeldatatypestring = "Q2BSP";
4127 mod->type = mod_brushq2;
4129 header = (q2dheader_t *)buffer;
4131 i = LittleLong(header->version);
4132 if (i != Q2BSPVERSION)
4133 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4135 mod_base = (unsigned char *)header;
4137 // swap all the lumps
4138 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4139 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4141 mod->brush.qw_md4sum = 0;
4142 mod->brush.qw_md4sum2 = 0;
4143 for (i = 0;i < Q2HEADER_LUMPS;i++)
4145 if (i == Q2LUMP_ENTITIES)
4147 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4148 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4150 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4153 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4154 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4155 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4156 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4157 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4158 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4159 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4160 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4161 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4162 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4163 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4164 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4165 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4166 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4167 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4168 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4169 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4170 // LordHavoc: must go last because this makes the submodels
4171 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4174 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4175 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4177 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4180 char key[128], value[MAX_INPUTLINE];
4182 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4183 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4184 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4187 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4188 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4189 loadmodel->brush.entities[l->filelen] = 0;
4190 data = loadmodel->brush.entities;
4191 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4192 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4196 if (!COM_ParseToken_Simple(&data, false, false))
4198 if (com_token[0] == '}')
4199 break; // end of worldspawn
4200 if (com_token[0] == '_')
4201 strlcpy(key, com_token + 1, sizeof(key));
4203 strlcpy(key, com_token, sizeof(key));
4204 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4205 key[strlen(key)-1] = 0;
4206 if (!COM_ParseToken_Simple(&data, false, false))
4208 strlcpy(value, com_token, sizeof(value));
4209 if (!strcmp("gridsize", key))
4211 #if _MSC_VER >= 1400
4212 #define sscanf sscanf_s
4214 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4215 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4221 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4227 in = (q3dtexture_t *)(mod_base + l->fileofs);
4228 if (l->filelen % sizeof(*in))
4229 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4230 count = l->filelen / sizeof(*in);
4231 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4233 loadmodel->data_textures = out;
4234 loadmodel->num_textures = count;
4235 loadmodel->num_texturesperskin = loadmodel->num_textures;
4237 for (i = 0;i < count;i++)
4239 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4240 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4241 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4244 if (cls.state == ca_dedicated)
4247 for (i = 0;i < count;i++, in++, out++)
4248 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4251 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4257 in = (q3dplane_t *)(mod_base + l->fileofs);
4258 if (l->filelen % sizeof(*in))
4259 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4260 count = l->filelen / sizeof(*in);
4261 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4263 loadmodel->brush.data_planes = out;
4264 loadmodel->brush.num_planes = count;
4266 for (i = 0;i < count;i++, in++, out++)
4268 out->normal[0] = LittleFloat(in->normal[0]);
4269 out->normal[1] = LittleFloat(in->normal[1]);
4270 out->normal[2] = LittleFloat(in->normal[2]);
4271 out->dist = LittleFloat(in->dist);
4276 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4279 q3mbrushside_t *out;
4282 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4283 if (l->filelen % sizeof(*in))
4284 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4285 count = l->filelen / sizeof(*in);
4286 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4288 loadmodel->brush.data_brushsides = out;
4289 loadmodel->brush.num_brushsides = count;
4291 for (i = 0;i < count;i++, in++, out++)
4293 n = LittleLong(in->planeindex);
4294 if (n < 0 || n >= loadmodel->brush.num_planes)
4295 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4296 out->plane = loadmodel->brush.data_planes + n;
4297 n = LittleLong(in->textureindex);
4298 if (n < 0 || n >= loadmodel->num_textures)
4299 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4300 out->texture = loadmodel->data_textures + n;
4304 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4306 q3dbrushside_ig_t *in;
4307 q3mbrushside_t *out;
4310 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4311 if (l->filelen % sizeof(*in))
4312 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4313 count = l->filelen / sizeof(*in);
4314 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4316 loadmodel->brush.data_brushsides = out;
4317 loadmodel->brush.num_brushsides = count;
4319 for (i = 0;i < count;i++, in++, out++)
4321 n = LittleLong(in->planeindex);
4322 if (n < 0 || n >= loadmodel->brush.num_planes)
4323 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4324 out->plane = loadmodel->brush.data_planes + n;
4325 n = LittleLong(in->textureindex);
4326 if (n < 0 || n >= loadmodel->num_textures)
4327 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4328 out->texture = loadmodel->data_textures + n;
4332 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4336 int i, j, n, c, count, maxplanes;
4337 colplanef_t *planes;
4339 in = (q3dbrush_t *)(mod_base + l->fileofs);
4340 if (l->filelen % sizeof(*in))
4341 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4342 count = l->filelen / sizeof(*in);
4343 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4345 loadmodel->brush.data_brushes = out;
4346 loadmodel->brush.num_brushes = count;
4351 for (i = 0;i < count;i++, in++, out++)
4353 n = LittleLong(in->firstbrushside);
4354 c = LittleLong(in->numbrushsides);
4355 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4356 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4357 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4358 out->numbrushsides = c;
4359 n = LittleLong(in->textureindex);
4360 if (n < 0 || n >= loadmodel->num_textures)
4361 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4362 out->texture = loadmodel->data_textures + n;
4364 // make a list of mplane_t structs to construct a colbrush from
4365 if (maxplanes < out->numbrushsides)
4367 maxplanes = out->numbrushsides;
4370 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4372 for (j = 0;j < out->numbrushsides;j++)
4374 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4375 planes[j].dist = out->firstbrushside[j].plane->dist;
4376 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4377 planes[j].texture = out->firstbrushside[j].texture;
4379 // make the colbrush from the planes
4380 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents);
4382 // this whole loop can take a while (e.g. on redstarrepublic4)
4383 CL_KeepaliveMessage(false);
4389 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4395 in = (q3deffect_t *)(mod_base + l->fileofs);
4396 if (l->filelen % sizeof(*in))
4397 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4398 count = l->filelen / sizeof(*in);
4399 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4401 loadmodel->brushq3.data_effects = out;
4402 loadmodel->brushq3.num_effects = count;
4404 for (i = 0;i < count;i++, in++, out++)
4406 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4407 n = LittleLong(in->brushindex);
4408 if (n >= loadmodel->brush.num_brushes)
4410 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4413 out->brushindex = n;
4414 out->unknown = LittleLong(in->unknown);
4418 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4423 in = (q3dvertex_t *)(mod_base + l->fileofs);
4424 if (l->filelen % sizeof(*in))
4425 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4426 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4427 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4428 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4429 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4430 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4431 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4433 for (i = 0;i < count;i++, in++)
4435 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4436 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4437 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4438 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4439 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4440 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4441 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4442 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4443 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4444 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4445 // svector/tvector are calculated later in face loading
4446 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4447 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4448 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4449 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4453 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4459 in = (int *)(mod_base + l->fileofs);
4460 if (l->filelen % sizeof(int[3]))
4461 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4462 count = l->filelen / sizeof(*in);
4463 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4465 loadmodel->brushq3.num_triangles = count / 3;
4466 loadmodel->brushq3.data_element3i = out;
4468 for (i = 0;i < count;i++, in++, out++)
4470 *out = LittleLong(*in);
4471 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4473 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4474 if(!loadmodel->brushq3.num_vertices)
4475 Host_Error("Mod_Q1BSP_LoadTrianglles: %s has triangles but no vertexes, cannot fix\n", loadmodel->name);
4481 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4483 q3dlightmap_t *input_pointer;
4484 int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4487 unsigned char *convertedpixels;
4488 char mapname[MAX_QPATH];
4489 int size, bytesperpixel, rgbmap[3];
4491 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4493 // defaults for q3bsp
4500 loadmodel->brushq3.lightmapsize = 128;
4502 if (cls.state == ca_dedicated)
4505 if(mod_q3bsp_nolightmaps.integer)
4511 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4512 if (developer_loading.integer)
4513 Con_Printf("Using internal lightmaps\n");
4514 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4515 if (l->filelen % sizeof(*input_pointer))
4516 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4517 count = l->filelen / sizeof(*input_pointer);
4518 for(i = 0; i < count; ++i)
4519 inpixels[i] = input_pointer[i].rgb;
4523 // no internal lightmaps
4524 // try external lightmaps
4525 if (developer_loading.integer)
4526 Con_Printf("Using external lightmaps\n");
4527 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4528 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false);
4532 // using EXTERNAL lightmaps instead
4533 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4535 Mem_Free(inpixels[0]);
4536 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4546 for(count = 1; ; ++count)
4548 inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false);
4549 if(!inpixels[count])
4550 break; // we got all of them
4551 if(image_width != size || image_height != size)
4553 for(i = 0; i <= count; ++i)
4554 Mem_Free(inpixels[i]);
4555 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4560 convertedpixels = (unsigned char *) Mem_Alloc(tempmempool, size*size*4);
4561 loadmodel->brushq3.lightmapsize = size;
4562 loadmodel->brushq3.num_originallightmaps = count;
4564 // now check the surfaces to see if any of them index an odd numbered
4565 // lightmap, if so this is not a deluxemapped bsp file
4567 // also check what lightmaps are actually used, because q3map2 sometimes
4568 // (always?) makes an unused one at the end, which
4569 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4570 // reason when only one lightmap is used, which can throw off the
4571 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4572 // to see if the second lightmap is blank, if so it is not deluxemapped.
4573 loadmodel->brushq3.deluxemapping = !(count & 1);
4574 loadmodel->brushq3.deluxemapping_modelspace = true;
4576 if (loadmodel->brushq3.deluxemapping)
4578 int facecount = faceslump->filelen / sizeof(q3dface_t);
4579 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4580 for (i = 0;i < facecount;i++)
4582 j = LittleLong(faces[i].lightmapindex);
4585 endlightmap = max(endlightmap, j + 1);
4586 if ((j & 1) || j + 1 >= count)
4588 loadmodel->brushq3.deluxemapping = false;
4595 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4596 // reason when only one lightmap is used, which can throw off the
4597 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4598 // to see if the second lightmap is blank, if so it is not deluxemapped.
4600 // further research has shown q3map2 sometimes creates a deluxemap and two
4601 // blank lightmaps, which must be handled properly as well
4602 if (endlightmap == 1 && count > 1)
4605 for (i = 0;i < size*size;i++)
4607 if (c[bytesperpixel*i + rgbmap[0]])
4609 if (c[bytesperpixel*i + rgbmap[1]])
4611 if (c[bytesperpixel*i + rgbmap[2]])
4616 // all pixels in the unused lightmap were black...
4617 loadmodel->brushq3.deluxemapping = false;
4621 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4623 // figure out what the most reasonable merge power is within limits
4625 loadmodel->brushq3.num_lightmapmergepower = 0;
4627 for(i = 0; (128 << i) < size; ++i)
4629 // i is now 0 for 128, 1 for 256, etc
4631 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++)
4632 loadmodel->brushq3.num_lightmapmergepower = power;
4634 loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4636 loadmodel->brushq3.num_mergedlightmaps = ((count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4637 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4638 if (loadmodel->brushq3.deluxemapping)
4639 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4641 // allocate a texture pool if we need it
4642 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4643 loadmodel->texturepool = R_AllocTexturePool();
4645 power = loadmodel->brushq3.num_lightmapmergepower;
4647 mask = (1 << power) - 1;
4648 for (i = 0;i < count;i++)
4650 // figure out which merged lightmap texture this fits into
4651 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4652 for (k = 0;k < size*size;k++)
4654 convertedpixels[k*4+0] = inpixels[i][k*bytesperpixel+rgbmap[0]];
4655 convertedpixels[k*4+1] = inpixels[i][k*bytesperpixel+rgbmap[1]];
4656 convertedpixels[k*4+2] = inpixels[i][k*bytesperpixel+rgbmap[2]];
4657 convertedpixels[k*4+3] = 255;
4659 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4661 // if the lightmap has not been allocated yet, create it
4662 if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4664 // create a lightmap only as large as necessary to hold the
4665 // remaining size*size blocks
4666 // if there are multiple merged lightmap textures then they will
4667 // all be full size except the last one which may be smaller
4668 // because it only needs to the remaining blocks, and it will often
4669 // be odd sizes like 2048x512 due to only being 25% full or so.
4670 j = (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) - (lightmapindex << power2);
4671 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4673 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4675 if (developer_loading.integer)
4676 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);
4677 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);
4678 if (loadmodel->brushq3.data_deluxemaps)
4679 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);
4681 mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4682 mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4683 j = (i >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) & ((1 << power2) - 1);
4684 if (loadmodel->brushq3.deluxemapping && (i & 1))
4685 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4687 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4691 // figure out which merged lightmap texture this fits into
4692 if (loadmodel->brushq3.deluxemapping && (i & 1))
4693 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);
4695 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);
4699 Mem_Free(convertedpixels);
4702 for(i = 0; i < count; ++i)
4703 Mem_Free(inpixels[i]);
4707 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
4714 *collisionstride = stride;
4715 cnt = (num_triangles + stride - 1) / stride;
4716 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
4717 for(j = 0; j < cnt; ++j)
4719 mins = &((*collisionbbox6f)[6 * j + 0]);
4720 maxs = &((*collisionbbox6f)[6 * j + 3]);
4721 for(k = 0; k < stride; ++k)
4723 tri = j * stride + k;
4724 if(tri >= num_triangles)
4726 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
4727 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
4728 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
4729 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
4730 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
4731 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
4732 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
4733 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
4734 if(vert[0] < mins[0]) mins[0] = vert[0];
4735 if(vert[1] < mins[1]) mins[1] = vert[1];
4736 if(vert[2] < mins[2]) mins[2] = vert[2];
4737 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4738 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4739 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4740 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
4741 if(vert[0] < mins[0]) mins[0] = vert[0];
4742 if(vert[1] < mins[1]) mins[1] = vert[1];
4743 if(vert[2] < mins[2]) mins[2] = vert[2];
4744 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4745 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4746 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4752 *collisionstride = 0;
4753 *collisionbbox6f = NULL;
4757 typedef struct patchtess_s
4761 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
4764 float *originalvertex3f;
4767 #define PATCHTESS_SAME_LODGROUP(a,b) \
4769 (a).lodgroup[0] == (b).lodgroup[0] && \
4770 (a).lodgroup[1] == (b).lodgroup[1] && \
4771 (a).lodgroup[2] == (b).lodgroup[2] && \
4772 (a).lodgroup[3] == (b).lodgroup[3] && \
4773 (a).lodgroup[4] == (b).lodgroup[4] && \
4774 (a).lodgroup[5] == (b).lodgroup[5] \
4777 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4779 q3dface_t *in, *oldin;
4780 msurface_t *out, *oldout;
4781 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;
4782 float lightmaptcbase[2], lightmaptcscale[2];
4783 //int *originalelement3i;
4784 //int *originalneighbor3i;
4785 float *originalvertex3f;
4786 //float *originalsvector3f;
4787 //float *originaltvector3f;
4788 float *originalnormal3f;
4789 float *originalcolor4f;
4790 float *originaltexcoordtexture2f;
4791 float *originaltexcoordlightmap2f;
4793 patchtess_t *patchtess = NULL;
4794 int patchtesscount = 0;
4797 in = (q3dface_t *)(mod_base + l->fileofs);
4798 if (l->filelen % sizeof(*in))
4799 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4800 count = l->filelen / sizeof(*in);
4801 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4803 loadmodel->data_surfaces = out;
4804 loadmodel->num_surfaces = count;
4807 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
4815 for (;i < count;i++, in++, out++)
4817 // check face type first
4818 type = LittleLong(in->type);
4819 if (type != Q3FACETYPE_FLAT
4820 && type != Q3FACETYPE_PATCH
4821 && type != Q3FACETYPE_MESH
4822 && type != Q3FACETYPE_FLARE)
4824 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4828 n = LittleLong(in->textureindex);
4829 if (n < 0 || n >= loadmodel->num_textures)
4831 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4834 out->texture = loadmodel->data_textures + n;
4835 n = LittleLong(in->effectindex);
4836 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4838 if (developer.integer >= 100)
4839 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4845 out->effect = loadmodel->brushq3.data_effects + n;
4847 if (cls.state != ca_dedicated)
4849 out->lightmaptexture = NULL;
4850 out->deluxemaptexture = r_texture_blanknormalmap;
4851 n = LittleLong(in->lightmapindex);
4854 else if (n >= loadmodel->brushq3.num_originallightmaps)
4856 if(loadmodel->brushq3.num_originallightmaps != 0)
4857 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4862 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4863 if (loadmodel->brushq3.deluxemapping)
4864 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4868 firstvertex = LittleLong(in->firstvertex);
4869 numvertices = LittleLong(in->numvertices);
4870 firstelement = LittleLong(in->firstelement);
4871 numtriangles = LittleLong(in->numelements) / 3;
4872 if (numtriangles * 3 != LittleLong(in->numelements))
4874 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));
4877 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4879 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);
4882 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4884 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);
4889 case Q3FACETYPE_FLAT:
4890 case Q3FACETYPE_MESH:
4891 // no processing necessary
4893 case Q3FACETYPE_PATCH:
4894 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4895 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4896 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))
4898 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4901 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4903 // convert patch to Q3FACETYPE_MESH
4904 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4905 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4906 // bound to user settings
4907 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4908 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4909 // bound to sanity settings
4910 xtess = bound(0, xtess, 1024);
4911 ytess = bound(0, ytess, 1024);
4913 // lower quality collision patches! Same procedure as before, but different cvars
4914 // convert patch to Q3FACETYPE_MESH
4915 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4916 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4917 // bound to user settings
4918 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
4919 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
4920 // bound to sanity settings
4921 cxtess = bound(0, cxtess, 1024);
4922 cytess = bound(0, cytess, 1024);
4924 // store it for the LOD grouping step
4925 patchtess[patchtesscount].info.xsize = patchsize[0];
4926 patchtess[patchtesscount].info.ysize = patchsize[1];
4927 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
4928 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
4929 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
4930 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
4932 patchtess[patchtesscount].surface_id = i;
4933 patchtess[patchtesscount].lodgroup[0] = in->specific.patch.mins[0];
4934 patchtess[patchtesscount].lodgroup[1] = in->specific.patch.mins[1];
4935 patchtess[patchtesscount].lodgroup[2] = in->specific.patch.mins[2];
4936 patchtess[patchtesscount].lodgroup[3] = in->specific.patch.maxs[0];
4937 patchtess[patchtesscount].lodgroup[4] = in->specific.patch.maxs[1];
4938 patchtess[patchtesscount].lodgroup[5] = in->specific.patch.maxs[2];
4939 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
4942 case Q3FACETYPE_FLARE:
4943 if (developer.integer >= 100)
4944 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4948 out->num_vertices = numvertices;
4949 out->num_triangles = numtriangles;
4950 meshvertices += out->num_vertices;
4951 meshtriangles += out->num_triangles;
4954 // Fix patches tesselations so that they make no seams
4958 for(i = 0; i < patchtesscount; ++i)
4960 for(j = i+1; j < patchtesscount; ++j)
4962 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
4965 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
4972 // Calculate resulting number of triangles
4973 for(i = 0; i < patchtesscount; ++i)
4975 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
4976 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
4977 numvertices = finalwidth * finalheight;
4978 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4980 oldout[patchtess[i].surface_id].num_vertices = numvertices;
4981 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
4982 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
4983 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
4989 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4992 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
4994 if (out->num_vertices < 3 || out->num_triangles < 1)
4997 type = LittleLong(in->type);
4998 firstvertex = LittleLong(in->firstvertex);
4999 firstelement = LittleLong(in->firstelement);
5000 out->num_firstvertex = meshvertices;
5001 out->num_firsttriangle = meshtriangles;
5004 case Q3FACETYPE_FLAT:
5005 case Q3FACETYPE_MESH:
5006 // no processing necessary, except for lightmap merging
5007 for (j = 0;j < out->num_vertices;j++)
5009 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5010 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5011 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5012 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5013 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5014 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5015 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5016 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5017 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5018 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5019 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5020 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5021 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5022 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5024 for (j = 0;j < out->num_triangles*3;j++)
5025 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5027 case Q3FACETYPE_PATCH:
5028 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5029 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5030 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5031 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5032 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5033 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5034 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5036 xtess = ytess = cxtess = cytess = -1;
5037 for(j = 0; j < patchtesscount; ++j)
5038 if(patchtess[j].surface_id == i)
5040 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5041 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5042 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5043 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5048 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5049 xtess = ytess = cxtess = cytess = 0;
5052 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5053 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5054 finalvertices = finalwidth * finalheight;
5055 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5056 type = Q3FACETYPE_MESH;
5057 // generate geometry
5058 // (note: normals are skipped because they get recalculated)
5059 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5060 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5061 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5062 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5063 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5064 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5066 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);
5068 if (developer.integer >= 100)
5070 if (out->num_triangles < finaltriangles)
5071 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);
5073 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);
5075 // q3map does not put in collision brushes for curves... ugh
5076 // build the lower quality collision geometry
5077 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5078 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5079 finalvertices = finalwidth * finalheight;
5080 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5082 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5083 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5084 out->num_collisionvertices = finalvertices;
5085 out->num_collisiontriangles = finaltriangles;
5086 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5087 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
5089 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5090 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
5092 oldnumtriangles = out->num_triangles;
5093 oldnumtriangles2 = out->num_collisiontriangles;
5094 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
5096 // now optimize the collision mesh by finding triangle bboxes...
5097 Mod_Q3BSP_BuildBBoxes(out->data_collisionelement3i, out->num_collisiontriangles, out->data_collisionvertex3f, &out->data_collisionbbox6f, &out->num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5098 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);
5100 if (developer.integer >= 100)
5101 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);
5106 meshvertices += out->num_vertices;
5107 meshtriangles += out->num_triangles;
5108 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5109 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)
5111 if (invalidelements)
5113 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);
5114 for (j = 0;j < out->num_triangles * 3;j++)
5116 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5117 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)
5118 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5122 // calculate a bounding box
5123 VectorClear(out->mins);
5124 VectorClear(out->maxs);
5125 if (out->num_vertices)
5127 if (cls.state != ca_dedicated && out->lightmaptexture)
5129 // figure out which part of the merged lightmap this fits into
5130 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5131 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5132 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5133 lightmapindex &= mergewidth * mergeheight - 1;
5134 lightmaptcscale[0] = 1.0f / mergewidth;
5135 lightmaptcscale[1] = 1.0f / mergeheight;
5136 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5137 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5138 // modify the lightmap texcoords to match this region of the merged lightmap
5139 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5141 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5142 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5145 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5146 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5147 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5149 out->mins[0] = min(out->mins[0], v[0]);
5150 out->maxs[0] = max(out->maxs[0], v[0]);
5151 out->mins[1] = min(out->mins[1], v[1]);
5152 out->maxs[1] = max(out->maxs[1], v[1]);
5153 out->mins[2] = min(out->mins[2], v[2]);
5154 out->maxs[2] = max(out->maxs[2], v[2]);
5156 out->mins[0] -= 1.0f;
5157 out->mins[1] -= 1.0f;
5158 out->mins[2] -= 1.0f;
5159 out->maxs[0] += 1.0f;
5160 out->maxs[1] += 1.0f;
5161 out->maxs[2] += 1.0f;
5163 // set lightmap styles for consistency with q1bsp
5164 //out->lightmapinfo->styles[0] = 0;
5165 //out->lightmapinfo->styles[1] = 255;
5166 //out->lightmapinfo->styles[2] = 255;
5167 //out->lightmapinfo->styles[3] = 255;
5172 for (;i < count;i++, out++)
5174 if(out->num_vertices && out->num_triangles)
5176 if(out->num_vertices == 0)
5177 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no vertices, ignoring\n", i);
5178 if(out->num_triangles == 0)
5179 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no triangles, ignoring\n", i);
5182 // for per pixel lighting
5183 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);
5185 // generate ushort elements array if possible
5186 if (loadmodel->surfmesh.data_element3s)
5187 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5188 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5190 // free the no longer needed vertex data
5191 loadmodel->brushq3.num_vertices = 0;
5192 if (loadmodel->brushq3.data_vertex3f)
5193 Mem_Free(loadmodel->brushq3.data_vertex3f);
5194 loadmodel->brushq3.data_vertex3f = NULL;
5195 loadmodel->brushq3.data_normal3f = NULL;
5196 loadmodel->brushq3.data_texcoordtexture2f = NULL;
5197 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5198 loadmodel->brushq3.data_color4f = NULL;
5199 // free the no longer needed triangle data
5200 loadmodel->brushq3.num_triangles = 0;
5201 if (loadmodel->brushq3.data_element3i)
5202 Mem_Free(loadmodel->brushq3.data_element3i);
5203 loadmodel->brushq3.data_element3i = NULL;
5206 Mem_Free(patchtess);
5209 static void Mod_Q3BSP_LoadModels(lump_t *l)
5213 int i, j, n, c, count;
5215 in = (q3dmodel_t *)(mod_base + l->fileofs);
5216 if (l->filelen % sizeof(*in))
5217 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5218 count = l->filelen / sizeof(*in);
5219 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5221 loadmodel->brushq3.data_models = out;
5222 loadmodel->brushq3.num_models = count;
5224 for (i = 0;i < count;i++, in++, out++)
5226 for (j = 0;j < 3;j++)
5228 out->mins[j] = LittleFloat(in->mins[j]);
5229 out->maxs[j] = LittleFloat(in->maxs[j]);
5231 n = LittleLong(in->firstface);
5232 c = LittleLong(in->numfaces);
5233 if (n < 0 || n + c > loadmodel->num_surfaces)
5234 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5237 n = LittleLong(in->firstbrush);
5238 c = LittleLong(in->numbrushes);
5239 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5240 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5241 out->firstbrush = n;
5242 out->numbrushes = c;
5246 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5252 in = (int *)(mod_base + l->fileofs);
5253 if (l->filelen % sizeof(*in))
5254 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5255 count = l->filelen / sizeof(*in);
5256 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5258 loadmodel->brush.data_leafbrushes = out;
5259 loadmodel->brush.num_leafbrushes = count;
5261 for (i = 0;i < count;i++, in++, out++)
5263 n = LittleLong(*in);
5264 if (n < 0 || n >= loadmodel->brush.num_brushes)
5265 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5270 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5276 in = (int *)(mod_base + l->fileofs);
5277 if (l->filelen % sizeof(*in))
5278 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5279 count = l->filelen / sizeof(*in);
5280 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5282 loadmodel->brush.data_leafsurfaces = out;
5283 loadmodel->brush.num_leafsurfaces = count;
5285 for (i = 0;i < count;i++, in++, out++)
5287 n = LittleLong(*in);
5288 if (n < 0 || n >= loadmodel->num_surfaces)
5289 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5294 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5298 int i, j, n, c, count;
5300 in = (q3dleaf_t *)(mod_base + l->fileofs);
5301 if (l->filelen % sizeof(*in))
5302 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5303 count = l->filelen / sizeof(*in);
5304 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5306 loadmodel->brush.data_leafs = out;
5307 loadmodel->brush.num_leafs = count;
5309 for (i = 0;i < count;i++, in++, out++)
5313 out->clusterindex = LittleLong(in->clusterindex);
5314 out->areaindex = LittleLong(in->areaindex);
5315 for (j = 0;j < 3;j++)
5317 // yes the mins/maxs are ints
5318 out->mins[j] = LittleLong(in->mins[j]) - 1;
5319 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5321 n = LittleLong(in->firstleafface);
5322 c = LittleLong(in->numleaffaces);
5323 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5324 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5325 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5326 out->numleafsurfaces = c;
5327 n = LittleLong(in->firstleafbrush);
5328 c = LittleLong(in->numleafbrushes);
5329 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5330 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5331 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5332 out->numleafbrushes = c;
5336 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5342 in = (q3dnode_t *)(mod_base + l->fileofs);
5343 if (l->filelen % sizeof(*in))
5344 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5345 count = l->filelen / sizeof(*in);
5346 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5348 loadmodel->brush.data_nodes = out;
5349 loadmodel->brush.num_nodes = count;
5351 for (i = 0;i < count;i++, in++, out++)
5354 n = LittleLong(in->planeindex);
5355 if (n < 0 || n >= loadmodel->brush.num_planes)
5356 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5357 out->plane = loadmodel->brush.data_planes + n;
5358 for (j = 0;j < 2;j++)
5360 n = LittleLong(in->childrenindex[j]);
5363 if (n >= loadmodel->brush.num_nodes)
5364 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5365 out->children[j] = loadmodel->brush.data_nodes + n;
5370 if (n >= loadmodel->brush.num_leafs)
5371 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5372 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5375 for (j = 0;j < 3;j++)
5377 // yes the mins/maxs are ints
5378 out->mins[j] = LittleLong(in->mins[j]) - 1;
5379 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5383 // set the parent pointers
5384 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5387 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5390 q3dlightgrid_t *out;
5393 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5394 if (l->filelen % sizeof(*in))
5395 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5396 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5397 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5398 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5399 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5400 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5401 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5402 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5403 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5404 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5405 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5406 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5407 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5408 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5409 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]);
5410 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]);
5412 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5415 if (l->filelen < count * (int)sizeof(*in))
5416 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]);
5417 if (l->filelen != count * (int)sizeof(*in))
5418 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5419 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5420 loadmodel->brushq3.data_lightgrid = out;
5421 loadmodel->brushq3.num_lightgrid = count;
5422 // no swapping or validation necessary
5423 memcpy(out, in, count * (int)sizeof(*out));
5427 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5432 if (l->filelen == 0)
5435 // unvised maps often have cluster indices even without pvs, so check
5436 // leafs to find real number of clusters
5437 loadmodel->brush.num_pvsclusters = 1;
5438 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5439 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5442 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5443 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5444 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5445 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5449 in = (q3dpvs_t *)(mod_base + l->fileofs);
5451 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5453 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5454 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5455 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5456 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5457 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5458 if (l->filelen < totalchains + (int)sizeof(*in))
5459 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);
5461 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5462 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5465 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5467 int i, j, k, index[3];
5468 float transformed[3], blend1, blend2, blend, stylescale;
5469 q3dlightgrid_t *a, *s;
5471 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5472 stylescale = r_refdef.scene.rtlightstylevalue[0];
5474 if (!model->brushq3.num_lightgrid)
5476 ambientcolor[0] = stylescale;
5477 ambientcolor[1] = stylescale;
5478 ambientcolor[2] = stylescale;
5482 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5483 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5484 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5485 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5486 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5487 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5488 index[0] = (int)floor(transformed[0]);
5489 index[1] = (int)floor(transformed[1]);
5490 index[2] = (int)floor(transformed[2]);
5491 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5493 // now lerp the values
5494 VectorClear(diffusenormal);
5495 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5496 for (k = 0;k < 2;k++)
5498 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5499 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5501 for (j = 0;j < 2;j++)
5503 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5504 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5506 for (i = 0;i < 2;i++)
5508 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5509 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5511 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5512 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5513 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5514 // this uses the mod_md3_sin table because the values are
5515 // already in the 0-255 range, the 64+ bias fetches a cosine
5516 // instead of a sine value
5517 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5518 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5519 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5520 //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)));
5525 // normalize the light direction before turning
5526 VectorNormalize(diffusenormal);
5527 //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]);
5530 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
5535 // find which leaf the point is in
5537 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5538 // point trace the brushes
5539 leaf = (mleaf_t *)node;
5540 for (i = 0;i < leaf->numleafbrushes;i++)
5542 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5543 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5545 brush->markframe = markframe;
5546 Collision_TracePointBrushFloat(trace, point, brush);
5549 // can't do point traces on curves (they have no thickness)
5552 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)
5554 int i, startside, endside;
5555 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5557 msurface_t *surface;
5560 // walk the tree until we hit a leaf, recursing for any split cases
5563 // abort if this part of the bsp tree can not be hit by this trace
5564 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5566 plane = node->plane;
5567 // axial planes are much more common than non-axial, so an optimized
5568 // axial case pays off here
5569 if (plane->type < 3)
5571 dist1 = start[plane->type] - plane->dist;
5572 dist2 = end[plane->type] - plane->dist;
5576 dist1 = DotProduct(start, plane->normal) - plane->dist;
5577 dist2 = DotProduct(end, plane->normal) - plane->dist;
5579 startside = dist1 < 0;
5580 endside = dist2 < 0;
5581 if (startside == endside)
5583 // most of the time the line fragment is on one side of the plane
5584 node = node->children[startside];
5588 // line crosses node plane, split the line
5589 dist1 = PlaneDiff(linestart, plane);
5590 dist2 = PlaneDiff(lineend, plane);
5591 midfrac = dist1 / (dist1 - dist2);
5592 VectorLerp(linestart, midfrac, lineend, mid);
5593 // take the near side first
5594 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5595 // if we found an impact on the front side, don't waste time
5596 // exploring the far side
5597 if (midfrac <= trace->realfraction)
5598 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5602 // abort if this part of the bsp tree can not be hit by this trace
5603 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5606 nodesegmentmins[0] = min(start[0], end[0]) - 1;
5607 nodesegmentmins[1] = min(start[1], end[1]) - 1;
5608 nodesegmentmins[2] = min(start[2], end[2]) - 1;
5609 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5610 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5611 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5612 // line trace the brushes
5613 leaf = (mleaf_t *)node;
5614 for (i = 0;i < leaf->numleafbrushes;i++)
5616 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5617 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5619 brush->markframe = markframe;
5620 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5623 // can't do point traces on curves (they have no thickness)
5624 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5626 // line trace the curves
5627 for (i = 0;i < leaf->numleafsurfaces;i++)
5629 surface = model->data_surfaces + leaf->firstleafsurface[i];
5630 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5632 surface->collisionmarkframe = markframe;
5633 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);
5639 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)
5645 msurface_t *surface;
5647 float nodesegmentmins[3], nodesegmentmaxs[3];
5648 // walk the tree until we hit a leaf, recursing for any split cases
5651 // abort if this part of the bsp tree can not be hit by this trace
5652 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5654 plane = node->plane;
5655 // axial planes are much more common than non-axial, so an optimized
5656 // axial case pays off here
5657 if (plane->type < 3)
5659 // this is an axial plane, compare bounding box directly to it and
5660 // recurse sides accordingly
5661 // recurse down node sides
5662 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5663 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5664 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5665 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5669 // this is a non-axial plane, so check if the start and end boxes
5670 // are both on one side of the plane to handle 'diagonal' cases
5671 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5675 // segment crosses plane
5676 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5679 // if sides == 0 then the trace itself is bogus (Not A Number values),
5680 // in this case we simply pretend the trace hit nothing
5682 return; // ERROR: NAN bounding box!
5683 // take whichever side the segment box is on
5684 node = node->children[sides - 1];
5686 // abort if this part of the bsp tree can not be hit by this trace
5687 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5689 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5690 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5691 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5692 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5693 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5694 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5696 leaf = (mleaf_t *)node;
5697 for (i = 0;i < leaf->numleafbrushes;i++)
5699 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5700 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5702 brush->markframe = markframe;
5703 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5706 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5708 for (i = 0;i < leaf->numleafsurfaces;i++)
5710 surface = model->data_surfaces + leaf->firstleafsurface[i];
5711 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5713 surface->collisionmarkframe = markframe;
5714 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);
5720 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)
5723 vec3_t shiftstart, shiftend;
5724 float segmentmins[3], segmentmaxs[3];
5725 static int markframe = 0;
5726 msurface_t *surface;
5728 memset(trace, 0, sizeof(*trace));
5729 trace->fraction = 1;
5730 trace->realfraction = 1;
5731 trace->hitsupercontentsmask = hitsupercontentsmask;
5732 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
5734 VectorAdd(start, boxmins, shiftstart);
5735 VectorAdd(end, boxmins, shiftend);
5736 if (VectorCompare(shiftstart, shiftend))
5739 if (model->brush.submodel)
5741 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5742 if (brush->colbrushf)
5743 Collision_TracePointBrushFloat(trace, shiftstart, brush->colbrushf);
5746 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, shiftstart, ++markframe);
5751 segmentmins[0] = min(shiftstart[0], shiftend[0]) - 1;
5752 segmentmins[1] = min(shiftstart[1], shiftend[1]) - 1;
5753 segmentmins[2] = min(shiftstart[2], shiftend[2]) - 1;
5754 segmentmaxs[0] = max(shiftstart[0], shiftend[0]) + 1;
5755 segmentmaxs[1] = max(shiftstart[1], shiftend[1]) + 1;
5756 segmentmaxs[2] = max(shiftstart[2], shiftend[2]) + 1;
5757 if (model->brush.submodel)
5759 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5760 if (brush->colbrushf)
5761 Collision_TraceLineBrushFloat(trace, shiftstart, shiftend, brush->colbrushf, brush->colbrushf);
5762 if (mod_q3bsp_curves_collisions.integer)
5763 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5764 if (surface->num_collisiontriangles)
5765 Collision_TraceLineTriangleMeshFloat(trace, shiftstart, shiftend, 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);
5768 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, shiftstart, shiftend, 0, 1, shiftstart, shiftend, ++markframe, segmentmins, segmentmaxs);
5773 // box trace, performed as brush trace
5774 colbrushf_t *thisbrush_start, *thisbrush_end;
5775 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5776 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5777 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5778 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5779 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5780 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5781 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5782 VectorAdd(start, boxmins, boxstartmins);
5783 VectorAdd(start, boxmaxs, boxstartmaxs);
5784 VectorAdd(end, boxmins, boxendmins);
5785 VectorAdd(end, boxmaxs, boxendmaxs);
5786 thisbrush_start = Collision_BrushForBox(&identitymatrix, boxstartmins, boxstartmaxs, 0, 0, NULL);
5787 thisbrush_end = Collision_BrushForBox(&identitymatrix, boxendmins, boxendmaxs, 0, 0, NULL);
5788 if (model->brush.submodel)
5790 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5791 if (brush->colbrushf)
5792 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush->colbrushf, brush->colbrushf);
5793 if (mod_q3bsp_curves_collisions.integer)
5794 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5795 if (surface->num_collisiontriangles)
5796 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);
5799 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, thisbrush_start, thisbrush_end, ++markframe, segmentmins, segmentmaxs);
5803 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5806 int supercontents = 0;
5808 // test if the point is inside each brush
5809 if (model->brush.submodel)
5811 // submodels are effectively one leaf
5812 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5813 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5814 supercontents |= brush->colbrushf->supercontents;
5818 mnode_t *node = model->brush.data_nodes;
5820 // find which leaf the point is in
5822 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5823 leaf = (mleaf_t *)node;
5824 // now check the brushes in the leaf
5825 for (i = 0;i < leaf->numleafbrushes;i++)
5827 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5828 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5829 supercontents |= brush->colbrushf->supercontents;
5832 return supercontents;
5835 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
5837 int supercontents = 0;
5838 if (nativecontents & CONTENTSQ3_SOLID)
5839 supercontents |= SUPERCONTENTS_SOLID;
5840 if (nativecontents & CONTENTSQ3_WATER)
5841 supercontents |= SUPERCONTENTS_WATER;
5842 if (nativecontents & CONTENTSQ3_SLIME)
5843 supercontents |= SUPERCONTENTS_SLIME;
5844 if (nativecontents & CONTENTSQ3_LAVA)
5845 supercontents |= SUPERCONTENTS_LAVA;
5846 if (nativecontents & CONTENTSQ3_BODY)
5847 supercontents |= SUPERCONTENTS_BODY;
5848 if (nativecontents & CONTENTSQ3_CORPSE)
5849 supercontents |= SUPERCONTENTS_CORPSE;
5850 if (nativecontents & CONTENTSQ3_NODROP)
5851 supercontents |= SUPERCONTENTS_NODROP;
5852 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5853 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5854 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5855 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5856 if (nativecontents & CONTENTSQ3_DONOTENTER)
5857 supercontents |= SUPERCONTENTS_DONOTENTER;
5858 if (nativecontents & CONTENTSQ3_BOTCLIP)
5859 supercontents |= SUPERCONTENTS_BOTCLIP;
5860 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
5861 supercontents |= SUPERCONTENTS_OPAQUE;
5862 return supercontents;
5865 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
5867 int nativecontents = 0;
5868 if (supercontents & SUPERCONTENTS_SOLID)
5869 nativecontents |= CONTENTSQ3_SOLID;
5870 if (supercontents & SUPERCONTENTS_WATER)
5871 nativecontents |= CONTENTSQ3_WATER;
5872 if (supercontents & SUPERCONTENTS_SLIME)
5873 nativecontents |= CONTENTSQ3_SLIME;
5874 if (supercontents & SUPERCONTENTS_LAVA)
5875 nativecontents |= CONTENTSQ3_LAVA;
5876 if (supercontents & SUPERCONTENTS_BODY)
5877 nativecontents |= CONTENTSQ3_BODY;
5878 if (supercontents & SUPERCONTENTS_CORPSE)
5879 nativecontents |= CONTENTSQ3_CORPSE;
5880 if (supercontents & SUPERCONTENTS_NODROP)
5881 nativecontents |= CONTENTSQ3_NODROP;
5882 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5883 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5884 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5885 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5886 if (supercontents & SUPERCONTENTS_DONOTENTER)
5887 nativecontents |= CONTENTSQ3_DONOTENTER;
5888 if (supercontents & SUPERCONTENTS_BOTCLIP)
5889 nativecontents |= CONTENTSQ3_BOTCLIP;
5890 if (!(supercontents & SUPERCONTENTS_OPAQUE))
5891 nativecontents |= CONTENTSQ3_TRANSLUCENT;
5892 return nativecontents;
5895 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
5900 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
5901 node = node->children[1];
5903 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
5904 if (loadmodel->brush.num_leafs < numleafs)
5905 loadmodel->brush.num_leafs = numleafs;
5908 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
5910 int i, j, numshadowmeshtriangles, lumps;
5911 q3dheader_t *header;
5912 float corner[3], yawradius, modelradius;
5913 msurface_t *surface;
5915 mod->modeldatatypestring = "Q3BSP";
5917 mod->type = mod_brushq3;
5918 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
5921 header = (q3dheader_t *)buffer;
5922 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
5923 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
5925 i = LittleLong(header->version);
5926 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
5927 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
5929 mod->soundfromcenter = true;
5930 mod->TraceBox = Mod_Q3BSP_TraceBox;
5931 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
5932 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
5933 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
5934 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
5935 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
5936 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
5937 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
5938 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
5939 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
5940 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
5941 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
5942 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
5943 mod->brush.AmbientSoundLevelsForPoint = NULL;
5944 mod->brush.RoundUpToHullSize = NULL;
5945 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
5946 mod->Draw = R_Q1BSP_Draw;
5947 mod->DrawDepth = R_Q1BSP_DrawDepth;
5948 mod->DrawDebug = R_Q1BSP_DrawDebug;
5949 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
5950 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
5951 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
5952 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
5953 mod->DrawLight = R_Q1BSP_DrawLight;
5955 mod_base = (unsigned char *)header;
5957 // swap all the lumps
5958 header->ident = LittleLong(header->ident);
5959 header->version = LittleLong(header->version);
5960 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
5961 for (i = 0;i < lumps;i++)
5963 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
5964 if((char *) bufferend < (char *) buffer + j)
5965 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
5966 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
5967 if((char *) bufferend < (char *) buffer + j)
5968 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
5971 * NO, do NOT clear them!
5972 * they contain actual data referenced by other stuff.
5973 * Instead, before using the advertisements lump, check header->versio
5975 * Sorry, but otherwise it breaks memory of the first lump.
5976 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
5978 header->lumps[i].fileofs = 0;
5979 header->lumps[i].filelen = 0;
5983 mod->brush.qw_md4sum = 0;
5984 mod->brush.qw_md4sum2 = 0;
5985 for (i = 0;i < lumps;i++)
5987 if (i == Q3LUMP_ENTITIES)
5989 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5990 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
5992 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
5994 // all this checksumming can take a while, so let's send keepalives here too
5995 CL_KeepaliveMessage(false);
5998 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
5999 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
6000 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
6001 if (header->version == Q3BSPVERSION_IG)
6002 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
6004 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
6005 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
6006 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
6007 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
6008 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
6009 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
6010 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
6011 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
6012 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
6013 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
6014 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
6015 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
6016 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
6017 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
6018 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
6020 // the MakePortals code works fine on the q3bsp data as well
6021 Mod_Q1BSP_MakePortals();
6023 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
6024 loadmodel->brush.supportwateralpha = true;
6026 // make a single combined shadow mesh to allow optimized shadow volume creation
6027 numshadowmeshtriangles = 0;
6028 if (cls.state != ca_dedicated)
6030 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6032 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
6033 numshadowmeshtriangles += surface->num_triangles;
6035 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
6036 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6037 if (surface->num_triangles > 0)
6038 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));
6039 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
6040 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
6043 loadmodel->brush.num_leafs = 0;
6044 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
6047 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
6052 // duplicate the basic information
6053 dpsnprintf(name, sizeof(name), "*%i", i);
6054 mod = Mod_FindName(name, loadmodel->name);
6055 // copy the base model to this one
6057 // rename the clone back to its proper name
6058 strlcpy(mod->name, name, sizeof(mod->name));
6059 mod->brush.parentmodel = loadmodel;
6060 // textures and memory belong to the main model
6061 mod->texturepool = NULL;
6062 mod->mempool = NULL;
6063 mod->brush.TraceLineOfSight = NULL;
6064 mod->brush.GetPVS = NULL;
6065 mod->brush.FatPVS = NULL;
6066 mod->brush.BoxTouchingPVS = NULL;
6067 mod->brush.BoxTouchingLeafPVS = NULL;
6068 mod->brush.BoxTouchingVisibleLeafs = NULL;
6069 mod->brush.FindBoxClusters = NULL;
6070 mod->brush.LightPoint = NULL;
6071 mod->brush.AmbientSoundLevelsForPoint = NULL;
6073 mod->brush.submodel = i;
6075 // make the model surface list (used by shadowing/lighting)
6076 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
6077 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
6078 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
6079 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
6080 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
6081 Mod_MakeSortedSurfaces(mod);
6083 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
6084 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
6085 // enlarge the bounding box to enclose all geometry of this model,
6086 // because q3map2 sometimes lies (mostly to affect the lightgrid),
6087 // which can in turn mess up the farclip (as well as culling when
6088 // outside the level - an unimportant concern)
6090 //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]);
6091 for (j = 0;j < mod->nummodelsurfaces;j++)
6093 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
6094 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
6096 if (!surface->num_vertices)
6098 for (k = 0;k < surface->num_vertices;k++, v += 3)
6100 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
6101 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
6102 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
6103 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
6104 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
6105 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
6108 //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]);
6109 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
6110 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
6111 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
6112 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
6113 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
6114 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
6115 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
6116 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
6117 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
6118 mod->yawmins[2] = mod->normalmins[2];
6119 mod->yawmaxs[2] = mod->normalmaxs[2];
6120 mod->radius = modelradius;
6121 mod->radius2 = modelradius * modelradius;
6123 // this gets altered below if sky or water is used
6124 mod->DrawSky = NULL;
6125 mod->DrawAddWaterPlanes = NULL;
6127 for (j = 0;j < mod->nummodelsurfaces;j++)
6128 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
6130 if (j < mod->nummodelsurfaces)
6131 mod->DrawSky = R_Q1BSP_DrawSky;
6133 for (j = 0;j < mod->nummodelsurfaces;j++)
6134 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
6136 if (j < mod->nummodelsurfaces)
6137 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
6141 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6143 int i = LittleLong(((int *)buffer)[1]);
6144 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
6145 Mod_Q3BSP_Load(mod,buffer, bufferend);
6146 else if (i == Q2BSPVERSION)
6147 Mod_Q2BSP_Load(mod,buffer, bufferend);
6149 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
6152 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6154 Host_Error("Mod_MAP_Load: not yet implemented");
6157 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
6159 // we already have done PVS culling at this point...
6160 // so we don't need to do it again.
6163 vec3_t testorigin, mins, maxs;
6165 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
6166 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
6167 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
6169 if(model->brush.TraceLineOfSight(model, eye, testorigin))
6172 // expand the box a little
6173 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
6174 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
6175 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
6176 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
6177 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
6178 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
6180 for(i = 0; i != numsamples; ++i)
6182 testorigin[0] = lhrandom(mins[0], maxs[0]);
6183 testorigin[1] = lhrandom(mins[1], maxs[1]);
6184 testorigin[2] = lhrandom(mins[2], maxs[2]);
6186 if(model->brush.TraceLineOfSight(model, eye, testorigin))