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 (-1 avoids any box tests)"};
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 (-1 avoids any box tests)"};
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)"};
48 cvar_t mod_q3bsp_tracelineofsight_brushes = {0, "mod_q3bsp_tracelineofsight_brushes", "0", "enables culling of entities behind detail brushes, curves, etc"};
50 static texture_t mod_q1bsp_texture_solid;
51 static texture_t mod_q1bsp_texture_sky;
52 static texture_t mod_q1bsp_texture_lava;
53 static texture_t mod_q1bsp_texture_slime;
54 static texture_t mod_q1bsp_texture_water;
56 void Mod_BrushInit(void)
58 // Cvar_RegisterVariable(&r_subdivide_size);
59 Cvar_RegisterVariable(&r_novis);
60 Cvar_RegisterVariable(&r_picmipworld);
61 Cvar_RegisterVariable(&r_nosurftextures);
62 Cvar_RegisterVariable(&r_subdivisions_tolerance);
63 Cvar_RegisterVariable(&r_subdivisions_mintess);
64 Cvar_RegisterVariable(&r_subdivisions_maxtess);
65 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
66 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
67 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
68 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
69 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
70 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
71 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
72 Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
73 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
74 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
75 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
76 Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
77 Cvar_RegisterVariable(&mod_q3bsp_tracelineofsight_brushes);
79 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
80 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
81 mod_q1bsp_texture_solid.surfaceflags = 0;
82 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
84 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
85 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
86 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
87 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
89 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
90 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
91 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
92 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
94 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
95 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
96 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
97 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
99 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
100 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
101 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
102 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
105 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
112 // LordHavoc: modified to start at first clip node,
113 // in other words: first node of the (sub)model
114 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
116 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
118 return (mleaf_t *)node;
121 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
125 leaf = Mod_Q1BSP_PointInLeaf(model, p);
128 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
131 memcpy(out, leaf->ambient_sound_level, i);
137 memset(out, 0, outsize);
140 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
143 int nodestackindex = 0;
144 mnode_t *node, *nodestack[1024];
145 if (!model->brush.num_pvsclusters)
147 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
153 // node - recurse down the BSP tree
154 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
158 return -1; // ERROR: NAN bounding box!
159 // box is on one side of plane, take that path
160 node = node->children[sides-1];
164 // box crosses plane, take one path and remember the other
165 if (nodestackindex < 1024)
166 nodestack[nodestackindex++] = node->children[0];
167 node = node->children[1];
173 // leaf - add clusterindex to list
174 if (numclusters < maxclusters)
175 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
179 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
183 if (nodestackindex < 1024)
184 nodestack[nodestackindex++] = node->children[0];
185 node = node->children[1];
190 // leaf - add clusterindex to list
191 if (numclusters < maxclusters)
192 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
197 // try another path we didn't take earlier
198 if (nodestackindex == 0)
200 node = nodestack[--nodestackindex];
202 // return number of clusters found (even if more than the maxclusters)
206 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
208 int nodestackindex = 0;
209 mnode_t *node, *nodestack[1024];
210 if (!model->brush.num_pvsclusters)
212 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
218 // node - recurse down the BSP tree
219 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
223 return -1; // ERROR: NAN bounding box!
224 // box is on one side of plane, take that path
225 node = node->children[sides-1];
229 // box crosses plane, take one path and remember the other
230 if (nodestackindex < 1024)
231 nodestack[nodestackindex++] = node->children[0];
232 node = node->children[1];
238 // leaf - check cluster bit
239 int clusterindex = ((mleaf_t *)node)->clusterindex;
240 if (CHECKPVSBIT(pvs, clusterindex))
242 // it is visible, return immediately with the news
247 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
251 if (nodestackindex < 1024)
252 nodestack[nodestackindex++] = node->children[0];
253 node = node->children[1];
258 // leaf - check cluster bit
259 int clusterindex = ((mleaf_t *)node)->clusterindex;
260 if (CHECKPVSBIT(pvs, clusterindex))
262 // it is visible, return immediately with the news
268 // nothing to see here, try another path we didn't take earlier
269 if (nodestackindex == 0)
271 node = nodestack[--nodestackindex];
277 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
279 int nodestackindex = 0;
280 mnode_t *node, *nodestack[1024];
281 if (!model->brush.num_leafs)
283 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
289 // node - recurse down the BSP tree
290 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
294 return -1; // ERROR: NAN bounding box!
295 // box is on one side of plane, take that path
296 node = node->children[sides-1];
300 // box crosses plane, take one path and remember the other
301 if (nodestackindex < 1024)
302 nodestack[nodestackindex++] = node->children[0];
303 node = node->children[1];
309 // leaf - check cluster bit
310 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
311 if (CHECKPVSBIT(pvs, clusterindex))
313 // it is visible, return immediately with the news
318 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
322 if (nodestackindex < 1024)
323 nodestack[nodestackindex++] = node->children[0];
324 node = node->children[1];
329 // leaf - check cluster bit
330 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
331 if (CHECKPVSBIT(pvs, clusterindex))
333 // it is visible, return immediately with the news
339 // nothing to see here, try another path we didn't take earlier
340 if (nodestackindex == 0)
342 node = nodestack[--nodestackindex];
348 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
350 int nodestackindex = 0;
351 mnode_t *node, *nodestack[1024];
352 if (!model->brush.num_leafs)
354 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
360 // node - recurse down the BSP tree
361 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
365 return -1; // ERROR: NAN bounding box!
366 // box is on one side of plane, take that path
367 node = node->children[sides-1];
371 // box crosses plane, take one path and remember the other
372 if (nodestackindex < 1024)
373 nodestack[nodestackindex++] = node->children[0];
374 node = node->children[1];
380 // leaf - check if it is visible
381 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
383 // it is visible, return immediately with the news
388 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
392 if (nodestackindex < 1024)
393 nodestack[nodestackindex++] = node->children[0];
394 node = node->children[1];
399 // leaf - check if it is visible
400 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
402 // it is visible, return immediately with the news
408 // nothing to see here, try another path we didn't take earlier
409 if (nodestackindex == 0)
411 node = nodestack[--nodestackindex];
417 typedef struct findnonsolidlocationinfo_s
420 vec3_t absmin, absmax;
426 findnonsolidlocationinfo_t;
428 static void Mod_Q1BSP_FindNonSolidLocation_r_Triangle(findnonsolidlocationinfo_t *info, msurface_t *surface, int k)
431 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
433 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
434 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
435 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
436 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
437 VectorSubtract(vert[1], vert[0], edge[0]);
438 VectorSubtract(vert[2], vert[1], edge[1]);
439 CrossProduct(edge[1], edge[0], facenormal);
440 if (facenormal[0] || facenormal[1] || facenormal[2])
442 VectorNormalize(facenormal);
443 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
444 if (f <= info->bestdist && f >= -info->bestdist)
446 VectorSubtract(vert[0], vert[2], edge[2]);
447 VectorNormalize(edge[0]);
448 VectorNormalize(edge[1]);
449 VectorNormalize(edge[2]);
450 CrossProduct(facenormal, edge[0], edgenormal[0]);
451 CrossProduct(facenormal, edge[1], edgenormal[1]);
452 CrossProduct(facenormal, edge[2], edgenormal[2]);
454 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
455 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
456 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
458 // we got lucky, the center is within the face
459 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
463 if (info->bestdist > dist)
465 info->bestdist = dist;
466 VectorScale(facenormal, (info->radius - -dist), info->nudge);
471 if (info->bestdist > dist)
473 info->bestdist = dist;
474 VectorScale(facenormal, (info->radius - dist), info->nudge);
480 // check which edge or vertex the center is nearest
481 for (i = 0;i < 3;i++)
483 f = DotProduct(info->center, edge[i]);
484 if (f >= DotProduct(vert[0], edge[i])
485 && f <= DotProduct(vert[1], edge[i]))
488 VectorMA(info->center, -f, edge[i], point);
489 dist = sqrt(DotProduct(point, point));
490 if (info->bestdist > dist)
492 info->bestdist = dist;
493 VectorScale(point, (info->radius / dist), info->nudge);
495 // skip both vertex checks
496 // (both are further away than this edge)
501 // not on edge, check first vertex of edge
502 VectorSubtract(info->center, vert[i], point);
503 dist = sqrt(DotProduct(point, point));
504 if (info->bestdist > dist)
506 info->bestdist = dist;
507 VectorScale(point, (info->radius / dist), info->nudge);
516 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
518 int surfacenum, k, *mark;
520 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
522 surface = info->model->data_surfaces + *mark;
523 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
525 if(surface->num_bboxstride > 0)
528 cnt = (surface->num_triangles + surface->num_bboxstride - 1) / surface->num_bboxstride;
529 for(i = 0; i < cnt; ++i)
531 if(BoxesOverlap(surface->data_bbox6f + i * 6, surface->data_bbox6f + i * 6 + 3, info->absmin, info->absmax))
533 for(k = 0; k < surface->num_bboxstride; ++k)
535 tri = i * surface->num_bboxstride + k;
536 if(tri >= surface->num_triangles)
538 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, tri);
545 for (k = 0;k < surface->num_triangles;k++)
547 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, k);
554 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
558 float f = PlaneDiff(info->center, node->plane);
559 if (f >= -info->bestdist)
560 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
561 if (f <= info->bestdist)
562 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
566 if (((mleaf_t *)node)->numleafsurfaces)
567 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
571 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
574 findnonsolidlocationinfo_t info;
580 VectorCopy(in, info.center);
581 info.radius = radius;
586 VectorClear(info.nudge);
587 info.bestdist = radius;
588 VectorCopy(info.center, info.absmin);
589 VectorCopy(info.center, info.absmax);
590 info.absmin[0] -= info.radius + 1;
591 info.absmin[1] -= info.radius + 1;
592 info.absmin[2] -= info.radius + 1;
593 info.absmax[0] += info.radius + 1;
594 info.absmax[1] += info.radius + 1;
595 info.absmax[2] += info.radius + 1;
596 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
597 VectorAdd(info.center, info.nudge, info.center);
599 while (info.bestdist < radius && ++i < 10);
600 VectorCopy(info.center, out);
603 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
605 switch(nativecontents)
610 return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
612 return SUPERCONTENTS_WATER;
614 return SUPERCONTENTS_SLIME;
616 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
618 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
623 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
625 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
626 return CONTENTS_SOLID;
627 if (supercontents & SUPERCONTENTS_SKY)
629 if (supercontents & SUPERCONTENTS_LAVA)
630 return CONTENTS_LAVA;
631 if (supercontents & SUPERCONTENTS_SLIME)
632 return CONTENTS_SLIME;
633 if (supercontents & SUPERCONTENTS_WATER)
634 return CONTENTS_WATER;
635 return CONTENTS_EMPTY;
638 typedef struct RecursiveHullCheckTraceInfo_s
640 // the hull we're tracing through
643 // the trace structure to fill in
646 // start, end, and end - start (in model space)
651 RecursiveHullCheckTraceInfo_t;
653 // 1/32 epsilon to keep floating point happy
654 #define DIST_EPSILON (0.03125)
656 #define HULLCHECKSTATE_EMPTY 0
657 #define HULLCHECKSTATE_SOLID 1
658 #define HULLCHECKSTATE_DONE 2
660 extern cvar_t collision_prefernudgedfraction;
661 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
663 // status variables, these don't need to be saved on the stack when
664 // recursing... but are because this should be thread-safe
665 // (note: tracing against a bbox is not thread-safe, yet)
670 // variables that need to be stored on the stack when recursing
675 // LordHavoc: a goto! everyone flee in terror... :)
680 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
681 if (!t->trace->startfound)
683 t->trace->startfound = true;
684 t->trace->startsupercontents |= num;
686 if (num & SUPERCONTENTS_LIQUIDSMASK)
687 t->trace->inwater = true;
689 t->trace->inopen = true;
690 if (num & SUPERCONTENTS_SOLID)
691 t->trace->hittexture = &mod_q1bsp_texture_solid;
692 else if (num & SUPERCONTENTS_SKY)
693 t->trace->hittexture = &mod_q1bsp_texture_sky;
694 else if (num & SUPERCONTENTS_LAVA)
695 t->trace->hittexture = &mod_q1bsp_texture_lava;
696 else if (num & SUPERCONTENTS_SLIME)
697 t->trace->hittexture = &mod_q1bsp_texture_slime;
699 t->trace->hittexture = &mod_q1bsp_texture_water;
700 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
701 t->trace->hitsupercontents = num;
702 if (num & t->trace->hitsupercontentsmask)
704 // if the first leaf is solid, set startsolid
705 if (t->trace->allsolid)
706 t->trace->startsolid = true;
707 #if COLLISIONPARANOID >= 3
710 return HULLCHECKSTATE_SOLID;
714 t->trace->allsolid = false;
715 #if COLLISIONPARANOID >= 3
718 return HULLCHECKSTATE_EMPTY;
722 // find the point distances
723 node = t->hull->clipnodes + num;
725 plane = t->hull->planes + node->planenum;
728 t1 = p1[plane->type] - plane->dist;
729 t2 = p2[plane->type] - plane->dist;
733 t1 = DotProduct (plane->normal, p1) - plane->dist;
734 t2 = DotProduct (plane->normal, p2) - plane->dist;
741 #if COLLISIONPARANOID >= 3
744 num = node->children[1];
753 #if COLLISIONPARANOID >= 3
756 num = node->children[0];
762 // the line intersects, find intersection point
763 // LordHavoc: this uses the original trace for maximum accuracy
764 #if COLLISIONPARANOID >= 3
769 t1 = t->start[plane->type] - plane->dist;
770 t2 = t->end[plane->type] - plane->dist;
774 t1 = DotProduct (plane->normal, t->start) - plane->dist;
775 t2 = DotProduct (plane->normal, t->end) - plane->dist;
778 midf = t1 / (t1 - t2);
779 midf = bound(p1f, midf, p2f);
780 VectorMA(t->start, midf, t->dist, mid);
782 // recurse both sides, front side first
783 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
784 // if this side is not empty, return what it is (solid or done)
785 if (ret != HULLCHECKSTATE_EMPTY)
788 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
789 // if other side is not solid, return what it is (empty or done)
790 if (ret != HULLCHECKSTATE_SOLID)
793 // front is air and back is solid, this is the impact point...
796 t->trace->plane.dist = -plane->dist;
797 VectorNegate (plane->normal, t->trace->plane.normal);
801 t->trace->plane.dist = plane->dist;
802 VectorCopy (plane->normal, t->trace->plane.normal);
805 // calculate the true fraction
806 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
807 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
808 midf = t1 / (t1 - t2);
809 t->trace->realfraction = bound(0, midf, 1);
811 // calculate the return fraction which is nudged off the surface a bit
812 midf = (t1 - DIST_EPSILON) / (t1 - t2);
813 t->trace->fraction = bound(0, midf, 1);
815 if (collision_prefernudgedfraction.integer)
816 t->trace->realfraction = t->trace->fraction;
818 #if COLLISIONPARANOID >= 3
821 return HULLCHECKSTATE_DONE;
824 //#if COLLISIONPARANOID < 2
825 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
828 mclipnode_t *nodes = t->hull->clipnodes;
829 mplane_t *planes = t->hull->planes;
831 VectorCopy(t->start, point);
834 plane = planes + nodes[num].planenum;
835 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
837 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
838 t->trace->startsupercontents |= num;
839 if (num & SUPERCONTENTS_LIQUIDSMASK)
840 t->trace->inwater = true;
842 t->trace->inopen = true;
843 if (num & t->trace->hitsupercontentsmask)
845 t->trace->allsolid = t->trace->startsolid = true;
846 return HULLCHECKSTATE_SOLID;
850 t->trace->allsolid = t->trace->startsolid = false;
851 return HULLCHECKSTATE_EMPTY;
856 static void Mod_Q1BSP_TracePoint(struct model_s *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
858 RecursiveHullCheckTraceInfo_t rhc;
860 memset(&rhc, 0, sizeof(rhc));
861 memset(trace, 0, sizeof(trace_t));
863 rhc.trace->fraction = 1;
864 rhc.trace->realfraction = 1;
865 rhc.trace->allsolid = true;
866 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
867 VectorCopy(start, rhc.start);
868 VectorCopy(start, rhc.end);
869 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
872 static void Mod_Q1BSP_TraceLine(struct model_s *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
874 RecursiveHullCheckTraceInfo_t rhc;
876 if (VectorCompare(start, end))
878 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
882 memset(&rhc, 0, sizeof(rhc));
883 memset(trace, 0, sizeof(trace_t));
885 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
886 rhc.trace->fraction = 1;
887 rhc.trace->realfraction = 1;
888 rhc.trace->allsolid = true;
889 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
890 VectorCopy(start, rhc.start);
891 VectorCopy(end, rhc.end);
892 VectorSubtract(rhc.end, rhc.start, rhc.dist);
893 #if COLLISIONPARANOID >= 2
894 Con_Printf("t(%f %f %f,%f %f %f)", rhc.start[0], rhc.start[1], rhc.start[2], rhc.end[0], rhc.end[1], rhc.end[2]);
895 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
900 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
901 memset(&testtrace, 0, sizeof(trace_t));
902 rhc.trace = &testtrace;
903 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
904 rhc.trace->fraction = 1;
905 rhc.trace->realfraction = 1;
906 rhc.trace->allsolid = true;
907 VectorCopy(test, rhc.start);
908 VectorCopy(test, rhc.end);
909 VectorClear(rhc.dist);
910 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
911 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
912 if (!trace->startsolid && testtrace.startsolid)
913 Con_Printf(" - ended in solid!\n");
917 if (VectorLength2(rhc.dist))
918 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
920 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
924 static void Mod_Q1BSP_TraceBox(struct model_s *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
926 // this function currently only supports same size start and end
928 RecursiveHullCheckTraceInfo_t rhc;
930 if (VectorCompare(boxmins, boxmaxs))
932 if (VectorCompare(start, end))
933 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
935 Mod_Q1BSP_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
939 memset(&rhc, 0, sizeof(rhc));
940 memset(trace, 0, sizeof(trace_t));
942 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
943 rhc.trace->fraction = 1;
944 rhc.trace->realfraction = 1;
945 rhc.trace->allsolid = true;
946 VectorSubtract(boxmaxs, boxmins, boxsize);
948 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
949 else if (model->brush.ishlbsp)
951 // LordHavoc: this has to have a minor tolerance (the .1) because of
952 // minor float precision errors from the box being transformed around
953 if (boxsize[0] < 32.1)
955 if (boxsize[2] < 54) // pick the nearest of 36 or 72
956 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
958 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
961 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
965 // LordHavoc: this has to have a minor tolerance (the .1) because of
966 // minor float precision errors from the box being transformed around
967 if (boxsize[0] < 32.1)
968 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
970 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
972 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
973 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
974 VectorSubtract(rhc.end, rhc.start, rhc.dist);
975 #if COLLISIONPARANOID >= 2
976 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]);
977 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
982 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
983 memset(&testtrace, 0, sizeof(trace_t));
984 rhc.trace = &testtrace;
985 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
986 rhc.trace->fraction = 1;
987 rhc.trace->realfraction = 1;
988 rhc.trace->allsolid = true;
989 VectorCopy(test, rhc.start);
990 VectorCopy(test, rhc.end);
991 VectorClear(rhc.dist);
992 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
993 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
994 if (!trace->startsolid && testtrace.startsolid)
995 Con_Printf(" - ended in solid!\n");
999 if (VectorLength2(rhc.dist))
1000 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1002 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1006 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
1008 int num = model->brushq1.hulls[0].firstclipnode;
1010 mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
1011 mplane_t *planes = model->brushq1.hulls[0].planes;
1014 plane = planes + nodes[num].planenum;
1015 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
1017 return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
1020 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)
1024 colplanef_t cbox_planes[6];
1026 cbox.hasaabbplanes = true;
1027 cbox.supercontents = boxsupercontents;
1030 cbox.numtriangles = 0;
1031 cbox.planes = cbox_planes;
1033 cbox.elements = NULL;
1041 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];
1042 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];
1043 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];
1044 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];
1045 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];
1046 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];
1047 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1048 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1049 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1050 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1051 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1052 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1053 memset(trace, 0, sizeof(trace_t));
1054 trace->hitsupercontentsmask = hitsupercontentsmask;
1055 trace->fraction = 1;
1056 trace->realfraction = 1;
1057 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1059 RecursiveHullCheckTraceInfo_t rhc;
1060 static hull_t box_hull;
1061 static mclipnode_t box_clipnodes[6];
1062 static mplane_t box_planes[6];
1063 // fill in a default trace
1064 memset(&rhc, 0, sizeof(rhc));
1065 memset(trace, 0, sizeof(trace_t));
1066 //To keep everything totally uniform, bounding boxes are turned into small
1067 //BSP trees instead of being compared directly.
1068 // create a temp hull from bounding box sizes
1069 box_planes[0].dist = cmaxs[0] - mins[0];
1070 box_planes[1].dist = cmins[0] - maxs[0];
1071 box_planes[2].dist = cmaxs[1] - mins[1];
1072 box_planes[3].dist = cmins[1] - maxs[1];
1073 box_planes[4].dist = cmaxs[2] - mins[2];
1074 box_planes[5].dist = cmins[2] - maxs[2];
1075 #if COLLISIONPARANOID >= 3
1076 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]);
1079 if (box_hull.clipnodes == NULL)
1083 //Set up the planes and clipnodes so that the six floats of a bounding box
1084 //can just be stored out and get a proper hull_t structure.
1086 box_hull.clipnodes = box_clipnodes;
1087 box_hull.planes = box_planes;
1088 box_hull.firstclipnode = 0;
1089 box_hull.lastclipnode = 5;
1091 for (i = 0;i < 6;i++)
1093 box_clipnodes[i].planenum = i;
1097 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1099 box_clipnodes[i].children[side^1] = i + 1;
1101 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1103 box_planes[i].type = i>>1;
1104 box_planes[i].normal[i>>1] = 1;
1108 // trace a line through the generated clipping hull
1109 //rhc.boxsupercontents = boxsupercontents;
1110 rhc.hull = &box_hull;
1112 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1113 rhc.trace->fraction = 1;
1114 rhc.trace->realfraction = 1;
1115 rhc.trace->allsolid = true;
1116 VectorCopy(start, rhc.start);
1117 VectorCopy(end, rhc.end);
1118 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1119 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1120 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1121 if (rhc.trace->startsupercontents)
1122 rhc.trace->startsupercontents = boxsupercontents;
1126 void Collision_ClipTrace_Point(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, int hitsupercontentsmask, int boxsupercontents, int boxq3surfaceflags, texture_t *boxtexture)
1128 memset(trace, 0, sizeof(trace_t));
1129 trace->fraction = 1;
1130 trace->realfraction = 1;
1131 if (BoxesOverlap(start, start, cmins, cmaxs))
1133 trace->startsupercontents |= boxsupercontents;
1134 if (hitsupercontentsmask & boxsupercontents)
1136 trace->startsolid = true;
1137 trace->allsolid = true;
1142 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1145 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
1146 return trace.fraction == 1;
1149 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)
1153 float mid, distz = endz - startz;
1157 return false; // didn't hit anything
1159 switch (node->plane->type)
1162 node = node->children[x < node->plane->dist];
1165 node = node->children[y < node->plane->dist];
1168 side = startz < node->plane->dist;
1169 if ((endz < node->plane->dist) == side)
1171 node = node->children[side];
1174 // found an intersection
1175 mid = node->plane->dist;
1178 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1179 front += startz * node->plane->normal[2];
1180 back += endz * node->plane->normal[2];
1181 side = front < node->plane->dist;
1182 if ((back < node->plane->dist) == side)
1184 node = node->children[side];
1187 // found an intersection
1188 mid = startz + distz * (front - node->plane->dist) / (front - back);
1192 // go down front side
1193 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1194 return true; // hit something
1197 // check for impact on this node
1198 if (node->numsurfaces)
1200 int i, dsi, dti, lmwidth, lmheight;
1202 msurface_t *surface;
1203 unsigned char *lightmap;
1204 int maps, line3, size3;
1207 float scale, w, w00, w01, w10, w11;
1209 surface = model->data_surfaces + node->firstsurface;
1210 for (i = 0;i < node->numsurfaces;i++, surface++)
1212 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo->samples)
1213 continue; // no lightmaps
1215 // location we want to sample in the lightmap
1216 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;
1217 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;
1222 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1223 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1226 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1228 // calculate bilinear interpolation factors
1229 // and also multiply by fixedpoint conversion factors
1232 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1233 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1234 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1235 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1237 // values for pointer math
1238 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1239 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1241 // look up the pixel
1242 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1244 // bilinear filter each lightmap style, and sum them
1245 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1247 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1248 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1249 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1250 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1251 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1255 return true; // success
1260 // go down back side
1261 node = node->children[side ^ 1];
1263 distz = endz - startz;
1268 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1270 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1271 VectorSet(diffusenormal, 0, 0, 1);
1273 if (!model->brushq1.lightdata)
1275 VectorSet(ambientcolor, 1, 1, 1);
1276 VectorSet(diffusecolor, 0, 0, 0);
1280 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);
1283 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1286 unsigned char *outstart = out;
1287 while (out < outend)
1291 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));
1301 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));
1304 for (c = *in++;c > 0;c--)
1308 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));
1319 R_Q1BSP_LoadSplitSky
1321 A sky texture is 256*128, with the right side being a masked overlay
1324 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1329 unsigned *solidpixels = Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1330 unsigned *alphapixels = Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1332 // allocate a texture pool if we need it
1333 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1334 loadmodel->texturepool = R_AllocTexturePool();
1336 if (bytesperpixel == 4)
1338 for (y = 0;y < h;y++)
1340 for (x = 0;x < w;x++)
1342 solidpixels[y*w+x] = ((unsigned *)src)[y*width+x+w];
1343 alphapixels[y*w+x] = ((unsigned *)src)[y*width+x];
1349 // make an average value for the back to avoid
1350 // a fringe on the top level
1359 for (y = 0;y < h;y++)
1361 for (x = 0;x < w;x++)
1363 p = src[x*width+y+w];
1364 r += palette_rgb[p][0];
1365 g += palette_rgb[p][1];
1366 b += palette_rgb[p][2];
1369 bgra.b[2] = r/(w*h);
1370 bgra.b[1] = g/(w*h);
1371 bgra.b[0] = b/(w*h);
1373 for (y = 0;y < h;y++)
1375 for (x = 0;x < w;x++)
1377 solidpixels[y*w+x] = palette_bgra_complete[src[y*width+x+w]];
1379 alphapixels[y*w+x] = p ? palette_bgra_complete[p] : bgra.i;
1384 loadmodel->brush.solidskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_solidtexture", TEXF_PRECACHE, (unsigned char *) solidpixels, w, h);
1385 loadmodel->brush.alphaskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_alphatexture", TEXF_ALPHA | TEXF_PRECACHE, (unsigned char *) alphapixels, w, h);
1386 Mem_Free(solidpixels);
1387 Mem_Free(alphapixels);
1390 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1392 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1393 skinframe_t *skinframe;
1395 texture_t *tx, *tx2, *anims[10], *altanims[10];
1397 unsigned char *data, *mtdata;
1399 char mapname[MAX_QPATH], name[MAX_QPATH];
1400 unsigned char zero[4];
1402 memset(zero, 0, sizeof(zero));
1404 loadmodel->data_textures = NULL;
1406 // add two slots for notexture walls and notexture liquids
1409 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1410 m->nummiptex = LittleLong (m->nummiptex);
1411 loadmodel->num_textures = m->nummiptex + 2;
1412 loadmodel->num_texturesperskin = loadmodel->num_textures;
1417 loadmodel->num_textures = 2;
1418 loadmodel->num_texturesperskin = loadmodel->num_textures;
1421 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1423 // fill out all slots with notexture
1424 if (cls.state != ca_dedicated)
1425 skinframe = R_SkinFrame_LoadMissing();
1428 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1430 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1433 if (cls.state != ca_dedicated)
1435 tx->numskinframes = 1;
1436 tx->skinframerate = 1;
1437 tx->skinframes[0] = skinframe;
1438 tx->currentskinframe = tx->skinframes[0];
1440 tx->basematerialflags = MATERIALFLAG_WALL;
1441 if (i == loadmodel->num_textures - 1)
1443 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1444 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1445 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1449 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1450 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1452 tx->currentframe = tx;
1454 // clear water settings
1457 tx->refractfactor = 1;
1458 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1459 tx->reflectfactor = 1;
1460 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1461 tx->r_water_wateralpha = 1;
1462 tx->specularscalemod = 1;
1463 tx->specularpowermod = 1;
1468 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1472 s = loadmodel->name;
1473 if (!strncasecmp(s, "maps/", 5))
1475 FS_StripExtension(s, mapname, sizeof(mapname));
1477 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1479 // LordHavoc: mostly rewritten map texture loader
1480 for (i = 0;i < m->nummiptex;i++)
1482 dofs[i] = LittleLong(dofs[i]);
1483 if (r_nosurftextures.integer)
1487 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1490 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1492 // copy name, but only up to 16 characters
1493 // (the output buffer can hold more than this, but the input buffer is
1495 for (j = 0;j < 16 && dmiptex->name[j];j++)
1496 name[j] = dmiptex->name[j];
1501 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1502 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1505 mtwidth = LittleLong(dmiptex->width);
1506 mtheight = LittleLong(dmiptex->height);
1508 j = LittleLong(dmiptex->offsets[0]);
1512 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1514 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1517 mtdata = (unsigned char *)dmiptex + j;
1520 if ((mtwidth & 15) || (mtheight & 15))
1521 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1523 // LordHavoc: force all names to lowercase
1524 for (j = 0;name[j];j++)
1525 if (name[j] >= 'A' && name[j] <= 'Z')
1526 name[j] += 'a' - 'A';
1528 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1531 tx = loadmodel->data_textures + i;
1532 strlcpy(tx->name, name, sizeof(tx->name));
1533 tx->width = mtwidth;
1534 tx->height = mtheight;
1536 if (tx->name[0] == '*')
1538 if (!strncmp(tx->name, "*lava", 5))
1540 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1541 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1543 else if (!strncmp(tx->name, "*slime", 6))
1545 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1546 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1550 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1551 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1554 else if (!strncmp(tx->name, "sky", 3))
1556 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1557 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1561 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1562 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1565 if (cls.state != ca_dedicated)
1567 // LordHavoc: HL sky textures are entirely different than quake
1568 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == mtheight * 2)
1570 data = loadimagepixelsbgra(tx->name, false, false);
1571 if (data && image_width == image_height * 2)
1573 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1576 else if (mtdata != NULL)
1577 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1581 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);
1583 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);
1586 // did not find external texture, load it from the bsp or wad3
1587 if (loadmodel->brush.ishlbsp)
1589 // internal texture overrides wad
1590 unsigned char *pixels, *freepixels;
1591 pixels = freepixels = NULL;
1593 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1595 pixels = freepixels = W_GetTextureBGRA(tx->name);
1598 tx->width = image_width;
1599 tx->height = image_height;
1600 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0), pixels, image_width, image_height);
1603 Mem_Free(freepixels);
1605 else if (mtdata) // texture included
1606 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_PRECACHE | TEXF_MIPMAP | (r_picmipworld.integer ? TEXF_PICMIP : 0), false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1608 // if skinframe is still NULL the "missing" texture will be used
1610 tx->skinframes[0] = skinframe;
1613 tx->basematerialflags = MATERIALFLAG_WALL;
1614 if (tx->name[0] == '*')
1616 // LordHavoc: some turbulent textures should not be affected by wateralpha
1617 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1619 // replace the texture with transparent black
1620 Vector4Set(zero, 128, 128, 128, 128);
1621 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_PRECACHE | TEXF_ALPHA, zero, 1, 1);
1622 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1624 else if (!strncmp(tx->name,"*lava",5)
1625 || !strncmp(tx->name,"*teleport",9)
1626 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1627 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1629 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1630 if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1631 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1633 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1635 // replace the texture with black
1636 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_PRECACHE, zero, 1, 1);
1637 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1639 else if (!strncmp(tx->name, "sky", 3))
1640 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1641 else if (!strcmp(tx->name, "caulk"))
1642 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1643 else if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1644 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1646 // start out with no animation
1647 tx->currentframe = tx;
1648 tx->currentskinframe = tx->skinframes[0];
1652 // sequence the animations
1653 for (i = 0;i < m->nummiptex;i++)
1655 tx = loadmodel->data_textures + i;
1656 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1658 if (tx->anim_total[0] || tx->anim_total[1])
1659 continue; // already sequenced
1661 // find the number of frames in the animation
1662 memset(anims, 0, sizeof(anims));
1663 memset(altanims, 0, sizeof(altanims));
1665 for (j = i;j < m->nummiptex;j++)
1667 tx2 = loadmodel->data_textures + j;
1668 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1672 if (num >= '0' && num <= '9')
1673 anims[num - '0'] = tx2;
1674 else if (num >= 'a' && num <= 'j')
1675 altanims[num - 'a'] = tx2;
1677 Con_Printf("Bad animating texture %s\n", tx->name);
1681 for (j = 0;j < 10;j++)
1688 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1691 for (j = 0;j < max;j++)
1695 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1699 for (j = 0;j < altmax;j++)
1703 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1712 // if there is no alternate animation, duplicate the primary
1713 // animation into the alternate
1715 for (k = 0;k < 10;k++)
1716 altanims[k] = anims[k];
1719 // link together the primary animation
1720 for (j = 0;j < max;j++)
1723 tx2->animated = true;
1724 tx2->anim_total[0] = max;
1725 tx2->anim_total[1] = altmax;
1726 for (k = 0;k < 10;k++)
1728 tx2->anim_frames[0][k] = anims[k];
1729 tx2->anim_frames[1][k] = altanims[k];
1733 // if there really is an alternate anim...
1734 if (anims[0] != altanims[0])
1736 // link together the alternate animation
1737 for (j = 0;j < altmax;j++)
1740 tx2->animated = true;
1741 // the primary/alternate are reversed here
1742 tx2->anim_total[0] = altmax;
1743 tx2->anim_total[1] = max;
1744 for (k = 0;k < 10;k++)
1746 tx2->anim_frames[0][k] = altanims[k];
1747 tx2->anim_frames[1][k] = anims[k];
1754 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1757 unsigned char *in, *out, *data, d;
1758 char litfilename[MAX_QPATH];
1759 char dlitfilename[MAX_QPATH];
1760 fs_offset_t filesize;
1761 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1763 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1764 for (i=0; i<l->filelen; i++)
1765 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1767 else // LordHavoc: bsp version 29 (normal white lighting)
1769 // LordHavoc: hope is not lost yet, check for a .lit file to load
1770 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1771 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1772 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1773 strlcat (litfilename, ".lit", sizeof (litfilename));
1774 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1775 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1778 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1780 i = LittleLong(((int *)data)[1]);
1783 if (developer_loading.integer)
1784 Con_Printf("loaded %s\n", litfilename);
1785 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1786 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1788 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1791 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1793 i = LittleLong(((int *)data)[1]);
1796 if (developer_loading.integer)
1797 Con_Printf("loaded %s\n", dlitfilename);
1798 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1799 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1800 loadmodel->brushq3.deluxemapping_modelspace = false;
1801 loadmodel->brushq3.deluxemapping = true;
1810 Con_Printf("Unknown .lit file version (%d)\n", i);
1812 else if (filesize == 8)
1813 Con_Print("Empty .lit file, ignoring\n");
1815 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
1822 // LordHavoc: oh well, expand the white lighting data
1825 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
1826 in = mod_base + l->fileofs;
1827 out = loadmodel->brushq1.lightdata;
1828 for (i = 0;i < l->filelen;i++)
1838 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
1840 loadmodel->brushq1.num_compressedpvs = 0;
1841 loadmodel->brushq1.data_compressedpvs = NULL;
1844 loadmodel->brushq1.num_compressedpvs = l->filelen;
1845 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1846 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
1849 // used only for HalfLife maps
1850 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
1852 char key[128], value[4096];
1856 if (!COM_ParseToken_Simple(&data, false, false))
1858 if (com_token[0] != '{')
1862 if (!COM_ParseToken_Simple(&data, false, false))
1864 if (com_token[0] == '}')
1865 break; // end of worldspawn
1866 if (com_token[0] == '_')
1867 strlcpy(key, com_token + 1, sizeof(key));
1869 strlcpy(key, com_token, sizeof(key));
1870 while (key[strlen(key)-1] == ' ') // remove trailing spaces
1871 key[strlen(key)-1] = 0;
1872 if (!COM_ParseToken_Simple(&data, false, false))
1874 dpsnprintf(value, sizeof(value), "%s", com_token);
1875 if (!strcmp("wad", key)) // for HalfLife maps
1877 if (loadmodel->brush.ishlbsp)
1880 for (i = 0;i < (int)sizeof(value);i++)
1881 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
1885 for (;i < (int)sizeof(value);i++)
1887 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
1888 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
1890 else if (value[i] == ';' || value[i] == 0)
1894 W_LoadTextureWadFile(&value[j], false);
1906 static void Mod_Q1BSP_LoadEntities(lump_t *l)
1908 loadmodel->brush.entities = NULL;
1911 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
1912 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
1913 loadmodel->brush.entities[l->filelen] = 0;
1914 if (loadmodel->brush.ishlbsp)
1915 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
1919 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
1925 in = (dvertex_t *)(mod_base + l->fileofs);
1926 if (l->filelen % sizeof(*in))
1927 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
1928 count = l->filelen / sizeof(*in);
1929 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
1931 loadmodel->brushq1.vertexes = out;
1932 loadmodel->brushq1.numvertexes = count;
1934 for ( i=0 ; i<count ; i++, in++, out++)
1936 out->position[0] = LittleFloat(in->point[0]);
1937 out->position[1] = LittleFloat(in->point[1]);
1938 out->position[2] = LittleFloat(in->point[2]);
1942 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
1943 // can be used for this
1945 int SB_ReadInt (unsigned char **buffer)
1948 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
1954 float SB_ReadFloat (unsigned char **buffer)
1962 u.i = SB_ReadInt (buffer);
1966 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
1968 unsigned char *index;
1972 index = (unsigned char *)(mod_base + l->fileofs);
1973 if (l->filelen % (48+4*hullinfo->filehulls))
1974 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
1976 count = l->filelen / (48+4*hullinfo->filehulls);
1977 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
1979 loadmodel->brushq1.submodels = out;
1980 loadmodel->brush.numsubmodels = count;
1982 for (i = 0; i < count; i++, out++)
1984 // spread out the mins / maxs by a pixel
1985 out->mins[0] = SB_ReadFloat (&index) - 1;
1986 out->mins[1] = SB_ReadFloat (&index) - 1;
1987 out->mins[2] = SB_ReadFloat (&index) - 1;
1988 out->maxs[0] = SB_ReadFloat (&index) + 1;
1989 out->maxs[1] = SB_ReadFloat (&index) + 1;
1990 out->maxs[2] = SB_ReadFloat (&index) + 1;
1991 out->origin[0] = SB_ReadFloat (&index);
1992 out->origin[1] = SB_ReadFloat (&index);
1993 out->origin[2] = SB_ReadFloat (&index);
1994 for (j = 0; j < hullinfo->filehulls; j++)
1995 out->headnode[j] = SB_ReadInt (&index);
1996 out->visleafs = SB_ReadInt (&index);
1997 out->firstface = SB_ReadInt (&index);
1998 out->numfaces = SB_ReadInt (&index);
2002 static void Mod_Q1BSP_LoadEdges(lump_t *l)
2008 in = (dedge_t *)(mod_base + l->fileofs);
2009 if (l->filelen % sizeof(*in))
2010 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2011 count = l->filelen / sizeof(*in);
2012 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2014 loadmodel->brushq1.edges = out;
2015 loadmodel->brushq1.numedges = count;
2017 for ( i=0 ; i<count ; i++, in++, out++)
2019 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2020 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2021 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2023 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);
2024 if(!loadmodel->brushq1.numvertexes)
2025 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2033 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2037 int i, j, k, count, miptex;
2039 in = (texinfo_t *)(mod_base + l->fileofs);
2040 if (l->filelen % sizeof(*in))
2041 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2042 count = l->filelen / sizeof(*in);
2043 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2045 loadmodel->brushq1.texinfo = out;
2046 loadmodel->brushq1.numtexinfo = count;
2048 for (i = 0;i < count;i++, in++, out++)
2050 for (k = 0;k < 2;k++)
2051 for (j = 0;j < 4;j++)
2052 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2054 miptex = LittleLong(in->miptex);
2055 out->flags = LittleLong(in->flags);
2057 out->texture = NULL;
2058 if (loadmodel->data_textures)
2060 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2061 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2063 out->texture = loadmodel->data_textures + miptex;
2065 if (out->flags & TEX_SPECIAL)
2067 // if texture chosen is NULL or the shader needs a lightmap,
2068 // force to notexture water shader
2069 if (out->texture == NULL)
2070 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2074 // if texture chosen is NULL, force to notexture
2075 if (out->texture == NULL)
2076 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2082 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2087 mins[0] = mins[1] = mins[2] = 9999;
2088 maxs[0] = maxs[1] = maxs[2] = -9999;
2090 for (i = 0;i < numverts;i++)
2092 for (j = 0;j < 3;j++, v++)
2102 #define MAX_SUBDIVPOLYTRIANGLES 4096
2103 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2105 static int subdivpolyverts, subdivpolytriangles;
2106 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2107 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2109 static int subdivpolylookupvert(vec3_t v)
2112 for (i = 0;i < subdivpolyverts;i++)
2113 if (subdivpolyvert[i][0] == v[0]
2114 && subdivpolyvert[i][1] == v[1]
2115 && subdivpolyvert[i][2] == v[2])
2117 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2118 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2119 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2120 return subdivpolyverts++;
2123 static void SubdividePolygon(int numverts, float *verts)
2125 int i, i1, i2, i3, f, b, c, p;
2126 vec3_t mins, maxs, front[256], back[256];
2127 float m, *pv, *cv, dist[256], frac;
2130 Host_Error("SubdividePolygon: ran out of verts in buffer");
2132 BoundPoly(numverts, verts, mins, maxs);
2134 for (i = 0;i < 3;i++)
2136 m = (mins[i] + maxs[i]) * 0.5;
2137 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2138 if (maxs[i] - m < 8)
2140 if (m - mins[i] < 8)
2144 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2145 dist[c] = cv[i] - m;
2148 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2152 VectorCopy(pv, front[f]);
2157 VectorCopy(pv, back[b]);
2160 if (dist[p] == 0 || dist[c] == 0)
2162 if ((dist[p] > 0) != (dist[c] > 0) )
2165 frac = dist[p] / (dist[p] - dist[c]);
2166 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2167 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2168 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2174 SubdividePolygon(f, front[0]);
2175 SubdividePolygon(b, back[0]);
2179 i1 = subdivpolylookupvert(verts);
2180 i2 = subdivpolylookupvert(verts + 3);
2181 for (i = 2;i < numverts;i++)
2183 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2185 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2189 i3 = subdivpolylookupvert(verts + i * 3);
2190 subdivpolyindex[subdivpolytriangles][0] = i1;
2191 subdivpolyindex[subdivpolytriangles][1] = i2;
2192 subdivpolyindex[subdivpolytriangles][2] = i3;
2194 subdivpolytriangles++;
2198 //Breaks a polygon up along axial 64 unit
2199 //boundaries so that turbulent and sky warps
2200 //can be done reasonably.
2201 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2207 subdivpolytriangles = 0;
2208 subdivpolyverts = 0;
2209 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2210 if (subdivpolytriangles < 1)
2211 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2213 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2214 mesh->num_vertices = subdivpolyverts;
2215 mesh->num_triangles = subdivpolytriangles;
2216 mesh->vertex = (surfvertex_t *)(mesh + 1);
2217 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2218 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2220 for (i = 0;i < mesh->num_triangles;i++)
2221 for (j = 0;j < 3;j++)
2222 mesh->index[i*3+j] = subdivpolyindex[i][j];
2224 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2226 VectorCopy(subdivpolyvert[i], v->v);
2227 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2228 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2233 extern cvar_t gl_max_lightmapsize;
2234 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2237 msurface_t *surface;
2238 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2239 float texmins[2], texmaxs[2], val;
2240 rtexture_t *lightmaptexture, *deluxemaptexture;
2242 in = (dface_t *)(mod_base + l->fileofs);
2243 if (l->filelen % sizeof(*in))
2244 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2245 count = l->filelen / sizeof(*in);
2246 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2247 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2249 loadmodel->num_surfaces = count;
2251 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2255 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2257 numedges = (unsigned short)LittleShort(in->numedges);
2258 totalverts += numedges;
2259 totaltris += numedges - 2;
2262 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2264 lightmaptexture = NULL;
2265 deluxemaptexture = r_texture_blanknormalmap;
2267 lightmapsize = bound(256, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d);
2268 totallightmapsamples = 0;
2272 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2274 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2276 // FIXME: validate edges, texinfo, etc?
2277 firstedge = LittleLong(in->firstedge);
2278 numedges = (unsigned short)LittleShort(in->numedges);
2279 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)
2280 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2281 i = (unsigned short)LittleShort(in->texinfo);
2282 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2283 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2284 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2285 surface->texture = surface->lightmapinfo->texinfo->texture;
2287 planenum = (unsigned short)LittleShort(in->planenum);
2288 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2289 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2291 //surface->flags = surface->texture->flags;
2292 //if (LittleShort(in->side))
2293 // surface->flags |= SURF_PLANEBACK;
2294 //surface->plane = loadmodel->brush.data_planes + planenum;
2296 surface->num_firstvertex = totalverts;
2297 surface->num_vertices = numedges;
2298 surface->num_firsttriangle = totaltris;
2299 surface->num_triangles = numedges - 2;
2300 totalverts += numedges;
2301 totaltris += numedges - 2;
2303 // convert edges back to a normal polygon
2304 for (i = 0;i < surface->num_vertices;i++)
2306 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2308 // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2310 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2312 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2313 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2314 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2315 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2316 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2317 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2318 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2319 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2322 for (i = 0;i < surface->num_triangles;i++)
2324 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2325 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2326 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2329 // compile additional data about the surface geometry
2330 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);
2331 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);
2332 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2334 // generate surface extents information
2335 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2336 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2337 for (i = 1;i < surface->num_vertices;i++)
2339 for (j = 0;j < 2;j++)
2341 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2342 texmins[j] = min(texmins[j], val);
2343 texmaxs[j] = max(texmaxs[j], val);
2346 for (i = 0;i < 2;i++)
2348 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2349 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2352 smax = surface->lightmapinfo->extents[0] >> 4;
2353 tmax = surface->lightmapinfo->extents[1] >> 4;
2354 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2355 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2358 for (i = 0;i < MAXLIGHTMAPS;i++)
2359 surface->lightmapinfo->styles[i] = in->styles[i];
2360 surface->lightmaptexture = NULL;
2361 surface->deluxemaptexture = r_texture_blanknormalmap;
2362 i = LittleLong(in->lightofs);
2365 surface->lightmapinfo->samples = NULL;
2367 // give non-lightmapped water a 1x white lightmap
2368 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2370 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2371 surface->lightmapinfo->styles[0] = 0;
2372 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2376 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2377 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2378 else // LordHavoc: white lighting (bsp version 29)
2380 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2381 if (loadmodel->brushq1.nmaplightdata)
2382 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2385 // check if we should apply a lightmap to this
2386 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2388 if (ssize > 256 || tsize > 256)
2389 Host_Error("Bad surface extents");
2391 if (lightmapsize < ssize)
2392 lightmapsize = ssize;
2393 if (lightmapsize < tsize)
2394 lightmapsize = tsize;
2396 totallightmapsamples += ssize*tsize;
2398 // force lightmap upload on first time seeing the surface
2400 // additionally this is used by the later code to see if a
2401 // lightmap is needed on this surface (rather than duplicating the
2403 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2407 // small maps (such as ammo boxes especially) don't need big lightmap
2408 // textures, so this code tries to guess a good size based on
2409 // totallightmapsamples (size of the lightmaps lump basically), as well as
2410 // trying to max out the size if there is a lot of lightmap data to store
2411 // additionally, never choose a lightmapsize that is smaller than the
2412 // largest surface encountered (as it would fail)
2414 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < bound(128, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d)) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2417 // now that we've decided the lightmap texture size, we can do the rest
2418 if (cls.state != ca_dedicated)
2420 int stainmapsize = 0;
2421 mod_alloclightmap_state_t allocState;
2423 Mod_AllocLightmap_Init(&allocState, lightmapsize, lightmapsize);
2424 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2426 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2427 float u, v, ubase, vbase, uscale, vscale;
2429 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2432 smax = surface->lightmapinfo->extents[0] >> 4;
2433 tmax = surface->lightmapinfo->extents[1] >> 4;
2434 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2435 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2436 stainmapsize += ssize * tsize * 3;
2438 if (!lightmaptexture || !Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy))
2440 // allocate a texture pool if we need it
2441 if (loadmodel->texturepool == NULL)
2442 loadmodel->texturepool = R_AllocTexturePool();
2443 // could not find room, make a new lightmap
2444 lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2445 if (loadmodel->brushq1.nmaplightdata)
2446 deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_PRECACHE, NULL);
2448 Mod_AllocLightmap_Reset(&allocState);
2449 Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy);
2451 surface->lightmaptexture = lightmaptexture;
2452 surface->deluxemaptexture = deluxemaptexture;
2453 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2454 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2456 uscale = 1.0f / (float)lightmapsize;
2457 vscale = 1.0f / (float)lightmapsize;
2458 ubase = lightmapx * uscale;
2459 vbase = lightmapy * vscale;
2461 for (i = 0;i < surface->num_vertices;i++)
2463 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);
2464 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);
2465 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2466 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2467 // LordHavoc: calc lightmap data offset for vertex lighting to use
2470 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2474 if (cl_stainmaps.integer)
2476 // allocate stainmaps for permanent marks on walls and clear white
2477 unsigned char *stainsamples = NULL;
2478 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2479 memset(stainsamples, 255, stainmapsize);
2481 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2483 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2485 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2486 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2487 surface->lightmapinfo->stainsamples = stainsamples;
2488 stainsamples += ssize * tsize * 3;
2493 // generate ushort elements array if possible
2494 if (loadmodel->surfmesh.data_element3s)
2495 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2496 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2499 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2502 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2503 node->parent = parent;
2506 // this is a node, recurse to children
2507 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2508 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2509 // combine supercontents of children
2510 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2515 mleaf_t *leaf = (mleaf_t *)node;
2516 // if this is a leaf, calculate supercontents mask from all collidable
2517 // primitives in the leaf (brushes and collision surfaces)
2518 // also flag if the leaf contains any collision surfaces
2519 leaf->combinedsupercontents = 0;
2520 // combine the supercontents values of all brushes in this leaf
2521 for (j = 0;j < leaf->numleafbrushes;j++)
2522 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2523 // check if this leaf contains any collision surfaces (q3 patches)
2524 for (j = 0;j < leaf->numleafsurfaces;j++)
2526 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2527 if (surface->num_collisiontriangles)
2529 leaf->containscollisionsurfaces = true;
2530 leaf->combinedsupercontents |= surface->texture->supercontents;
2536 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2542 in = (dnode_t *)(mod_base + l->fileofs);
2543 if (l->filelen % sizeof(*in))
2544 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2545 count = l->filelen / sizeof(*in);
2546 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2548 loadmodel->brush.data_nodes = out;
2549 loadmodel->brush.num_nodes = count;
2551 for ( i=0 ; i<count ; i++, in++, out++)
2553 for (j=0 ; j<3 ; j++)
2555 out->mins[j] = LittleShort(in->mins[j]);
2556 out->maxs[j] = LittleShort(in->maxs[j]);
2559 p = LittleLong(in->planenum);
2560 out->plane = loadmodel->brush.data_planes + p;
2562 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2563 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2565 for (j=0 ; j<2 ; j++)
2567 // LordHavoc: this code supports broken bsp files produced by
2568 // arguire qbsp which can produce more than 32768 nodes, any value
2569 // below count is assumed to be a node number, any other value is
2570 // assumed to be a leaf number
2571 p = (unsigned short)LittleShort(in->children[j]);
2574 if (p < loadmodel->brush.num_nodes)
2575 out->children[j] = loadmodel->brush.data_nodes + p;
2578 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2579 // map it to the solid leaf
2580 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2585 // note this uses 65535 intentionally, -1 is leaf 0
2587 if (p < loadmodel->brush.num_leafs)
2588 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2591 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2592 // map it to the solid leaf
2593 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2599 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2602 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2608 in = (dleaf_t *)(mod_base + l->fileofs);
2609 if (l->filelen % sizeof(*in))
2610 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2611 count = l->filelen / sizeof(*in);
2612 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2614 loadmodel->brush.data_leafs = out;
2615 loadmodel->brush.num_leafs = count;
2616 // get visleafs from the submodel data
2617 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2618 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2619 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2620 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2622 for ( i=0 ; i<count ; i++, in++, out++)
2624 for (j=0 ; j<3 ; j++)
2626 out->mins[j] = LittleShort(in->mins[j]);
2627 out->maxs[j] = LittleShort(in->maxs[j]);
2630 // FIXME: this function could really benefit from some error checking
2632 out->contents = LittleLong(in->contents);
2634 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2635 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2636 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2638 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);
2639 out->firstleafsurface = NULL;
2640 out->numleafsurfaces = 0;
2643 out->clusterindex = i - 1;
2644 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2645 out->clusterindex = -1;
2647 p = LittleLong(in->visofs);
2648 // ignore visofs errors on leaf 0 (solid)
2649 if (p >= 0 && out->clusterindex >= 0)
2651 if (p >= loadmodel->brushq1.num_compressedpvs)
2652 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2654 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);
2657 for (j = 0;j < 4;j++)
2658 out->ambient_sound_level[j] = in->ambient_level[j];
2660 // FIXME: Insert caustics here
2664 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2668 const unsigned char *pvs;
2669 // if there's no vis data, assume supported (because everything is visible all the time)
2670 if (!loadmodel->brush.data_pvsclusters)
2672 // check all liquid leafs to see if they can see into empty leafs, if any
2673 // can we can assume this map supports r_wateralpha
2674 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2676 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2678 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2679 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2680 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2687 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2694 in = (dclipnode_t *)(mod_base + l->fileofs);
2695 if (l->filelen % sizeof(*in))
2696 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2697 count = l->filelen / sizeof(*in);
2698 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2700 loadmodel->brushq1.clipnodes = out;
2701 loadmodel->brushq1.numclipnodes = count;
2703 for (i = 1; i < MAX_MAP_HULLS; i++)
2705 hull = &loadmodel->brushq1.hulls[i];
2706 hull->clipnodes = out;
2707 hull->firstclipnode = 0;
2708 hull->lastclipnode = count-1;
2709 hull->planes = loadmodel->brush.data_planes;
2710 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2711 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2712 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2713 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2714 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2715 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2716 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2719 for (i=0 ; i<count ; i++, out++, in++)
2721 out->planenum = LittleLong(in->planenum);
2722 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2723 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2724 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2725 if (out->children[0] >= count)
2726 out->children[0] -= 65536;
2727 if (out->children[1] >= count)
2728 out->children[1] -= 65536;
2729 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2730 Host_Error("Corrupt clipping hull(out of range planenum)");
2734 //Duplicate the drawing hull structure as a clipping hull
2735 static void Mod_Q1BSP_MakeHull0(void)
2742 hull = &loadmodel->brushq1.hulls[0];
2744 in = loadmodel->brush.data_nodes;
2745 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2747 hull->clipnodes = out;
2748 hull->firstclipnode = 0;
2749 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2750 hull->planes = loadmodel->brush.data_planes;
2752 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2754 out->planenum = in->plane - loadmodel->brush.data_planes;
2755 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2756 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2760 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2765 in = (short *)(mod_base + l->fileofs);
2766 if (l->filelen % sizeof(*in))
2767 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2768 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2769 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2771 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2773 j = (unsigned short) LittleShort(in[i]);
2774 if (j >= loadmodel->num_surfaces)
2775 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2776 loadmodel->brush.data_leafsurfaces[i] = j;
2780 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2785 in = (int *)(mod_base + l->fileofs);
2786 if (l->filelen % sizeof(*in))
2787 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2788 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2789 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2791 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2792 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
2796 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
2802 in = (dplane_t *)(mod_base + l->fileofs);
2803 if (l->filelen % sizeof(*in))
2804 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
2806 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
2807 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
2809 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
2811 out->normal[0] = LittleFloat(in->normal[0]);
2812 out->normal[1] = LittleFloat(in->normal[1]);
2813 out->normal[2] = LittleFloat(in->normal[2]);
2814 out->dist = LittleFloat(in->dist);
2820 static void Mod_Q1BSP_LoadMapBrushes(void)
2824 int submodel, numbrushes;
2825 qboolean firstbrush;
2826 char *text, *maptext;
2827 char mapfilename[MAX_QPATH];
2828 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
2829 strlcat (mapfilename, ".map", sizeof (mapfilename));
2830 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
2834 if (!COM_ParseToken_Simple(&data, false, false))
2839 if (!COM_ParseToken_Simple(&data, false, false))
2841 if (com_token[0] != '{')
2847 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
2850 if (!COM_ParseToken_Simple(&data, false, false))
2852 if (com_token[0] == '}')
2853 break; // end of entity
2854 if (com_token[0] == '{')
2861 if (submodel > loadmodel->brush.numsubmodels)
2863 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
2867 model = loadmodel->brush.submodels[submodel];
2874 if (!COM_ParseToken_Simple(&data, false, false))
2876 if (com_token[0] == '}')
2877 break; // end of brush
2878 // each brush face should be this format:
2879 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
2880 // FIXME: support hl .map format
2881 for (pointnum = 0;pointnum < 3;pointnum++)
2883 COM_ParseToken_Simple(&data, false, false);
2884 for (componentnum = 0;componentnum < 3;componentnum++)
2886 COM_ParseToken_Simple(&data, false, false);
2887 point[pointnum][componentnum] = atof(com_token);
2889 COM_ParseToken_Simple(&data, false, false);
2891 COM_ParseToken_Simple(&data, false, false);
2892 strlcpy(facetexture, com_token, sizeof(facetexture));
2893 COM_ParseToken_Simple(&data, false, false);
2894 //scroll_s = atof(com_token);
2895 COM_ParseToken_Simple(&data, false, false);
2896 //scroll_t = atof(com_token);
2897 COM_ParseToken_Simple(&data, false, false);
2898 //rotate = atof(com_token);
2899 COM_ParseToken_Simple(&data, false, false);
2900 //scale_s = atof(com_token);
2901 COM_ParseToken_Simple(&data, false, false);
2902 //scale_t = atof(com_token);
2903 TriangleNormal(point[0], point[1], point[2], planenormal);
2904 VectorNormalizeDouble(planenormal);
2905 planedist = DotProduct(point[0], planenormal);
2906 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
2916 #define MAX_PORTALPOINTS 64
2918 typedef struct portal_s
2921 mnode_t *nodes[2]; // [0] = front side of plane
2922 struct portal_s *next[2];
2924 double points[3*MAX_PORTALPOINTS];
2925 struct portal_s *chain; // all portals are linked into a list
2929 static memexpandablearray_t portalarray;
2931 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
2933 // process only nodes (leafs already had their box calculated)
2937 // calculate children first
2938 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
2939 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
2941 // make combined bounding box from children
2942 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
2943 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
2944 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
2945 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
2946 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
2947 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
2950 static void Mod_Q1BSP_FinalizePortals(void)
2952 int i, j, numportals, numpoints, portalindex, portalrange = Mem_ExpandableArray_IndexRange(&portalarray);
2956 mleaf_t *leaf, *endleaf;
2958 // tally up portal and point counts and recalculate bounding boxes for all
2959 // leafs (because qbsp is very sloppy)
2960 leaf = loadmodel->brush.data_leafs;
2961 endleaf = leaf + loadmodel->brush.num_leafs;
2962 for (;leaf < endleaf;leaf++)
2964 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
2965 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
2969 for (portalindex = 0;portalindex < portalrange;portalindex++)
2971 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
2974 // note: this check must match the one below or it will usually corrupt memory
2975 // 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
2976 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
2979 numpoints += p->numpoints * 2;
2982 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
2983 loadmodel->brush.num_portals = numportals;
2984 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
2985 loadmodel->brush.num_portalpoints = numpoints;
2986 // clear all leaf portal chains
2987 for (i = 0;i < loadmodel->brush.num_leafs;i++)
2988 loadmodel->brush.data_leafs[i].portals = NULL;
2989 // process all portals in the global portal chain, while freeing them
2990 portal = loadmodel->brush.data_portals;
2991 point = loadmodel->brush.data_portalpoints;
2992 for (portalindex = 0;portalindex < portalrange;portalindex++)
2994 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
2997 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
2999 // note: this check must match the one above or it will usually corrupt memory
3000 // 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
3001 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3003 // first make the back to front portal(forward portal)
3004 portal->points = point;
3005 portal->numpoints = p->numpoints;
3006 portal->plane.dist = p->plane.dist;
3007 VectorCopy(p->plane.normal, portal->plane.normal);
3008 portal->here = (mleaf_t *)p->nodes[1];
3009 portal->past = (mleaf_t *)p->nodes[0];
3011 for (j = 0;j < portal->numpoints;j++)
3013 VectorCopy(p->points + j*3, point->position);
3016 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3017 PlaneClassify(&portal->plane);
3019 // link into leaf's portal chain
3020 portal->next = portal->here->portals;
3021 portal->here->portals = portal;
3023 // advance to next portal
3026 // then make the front to back portal(backward portal)
3027 portal->points = point;
3028 portal->numpoints = p->numpoints;
3029 portal->plane.dist = -p->plane.dist;
3030 VectorNegate(p->plane.normal, portal->plane.normal);
3031 portal->here = (mleaf_t *)p->nodes[0];
3032 portal->past = (mleaf_t *)p->nodes[1];
3034 for (j = portal->numpoints - 1;j >= 0;j--)
3036 VectorCopy(p->points + j*3, point->position);
3039 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3040 PlaneClassify(&portal->plane);
3042 // link into leaf's portal chain
3043 portal->next = portal->here->portals;
3044 portal->here->portals = portal;
3046 // advance to next portal
3049 // add the portal's polygon points to the leaf bounding boxes
3050 for (i = 0;i < 2;i++)
3052 leaf = (mleaf_t *)p->nodes[i];
3053 for (j = 0;j < p->numpoints;j++)
3055 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3056 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3057 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3058 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3059 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3060 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3065 // now recalculate the node bounding boxes from the leafs
3066 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3074 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3077 Host_Error("AddPortalToNodes: NULL front node");
3079 Host_Error("AddPortalToNodes: NULL back node");
3080 if (p->nodes[0] || p->nodes[1])
3081 Host_Error("AddPortalToNodes: already included");
3082 // 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
3084 p->nodes[0] = front;
3085 p->next[0] = (portal_t *)front->portals;
3086 front->portals = (mportal_t *)p;
3089 p->next[1] = (portal_t *)back->portals;
3090 back->portals = (mportal_t *)p;
3095 RemovePortalFromNode
3098 static void RemovePortalFromNodes(portal_t *portal)
3102 void **portalpointer;
3104 for (i = 0;i < 2;i++)
3106 node = portal->nodes[i];
3108 portalpointer = (void **) &node->portals;
3111 t = (portal_t *)*portalpointer;
3113 Host_Error("RemovePortalFromNodes: portal not in leaf");
3117 if (portal->nodes[0] == node)
3119 *portalpointer = portal->next[0];
3120 portal->nodes[0] = NULL;
3122 else if (portal->nodes[1] == node)
3124 *portalpointer = portal->next[1];
3125 portal->nodes[1] = NULL;
3128 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3132 if (t->nodes[0] == node)
3133 portalpointer = (void **) &t->next[0];
3134 else if (t->nodes[1] == node)
3135 portalpointer = (void **) &t->next[1];
3137 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3142 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3143 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3146 mnode_t *front, *back, *other_node;
3147 mplane_t clipplane, *plane;
3148 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3149 int numfrontpoints, numbackpoints;
3150 double frontpoints[3*MAX_PORTALPOINTS], backpoints[3*MAX_PORTALPOINTS];
3152 // if a leaf, we're done
3156 plane = node->plane;
3158 front = node->children[0];
3159 back = node->children[1];
3161 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3163 // create the new portal by generating a polygon for the node plane,
3164 // and clipping it by all of the other portals(which came from nodes above this one)
3165 nodeportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3166 nodeportal->plane = *plane;
3168 // 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)
3169 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);
3170 nodeportal->numpoints = 4;
3171 side = 0; // shut up compiler warning
3172 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3174 clipplane = portal->plane;
3175 if (portal->nodes[0] == portal->nodes[1])
3176 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3177 if (portal->nodes[0] == node)
3179 else if (portal->nodes[1] == node)
3181 clipplane.dist = -clipplane.dist;
3182 VectorNegate(clipplane.normal, clipplane.normal);
3186 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3188 for (i = 0;i < nodeportal->numpoints*3;i++)
3189 frontpoints[i] = nodeportal->points[i];
3190 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);
3191 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3195 if (nodeportal->numpoints < 3)
3197 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3198 nodeportal->numpoints = 0;
3200 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3202 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3203 nodeportal->numpoints = 0;
3206 AddPortalToNodes(nodeportal, front, back);
3208 // split the portals of this node along this node's plane and assign them to the children of this node
3209 // (migrating the portals downward through the tree)
3210 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3212 if (portal->nodes[0] == portal->nodes[1])
3213 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3214 if (portal->nodes[0] == node)
3216 else if (portal->nodes[1] == node)
3219 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3220 nextportal = portal->next[side];
3221 if (!portal->numpoints)
3224 other_node = portal->nodes[!side];
3225 RemovePortalFromNodes(portal);
3227 // cut the portal into two portals, one on each side of the node plane
3228 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);
3230 if (!numfrontpoints)
3233 AddPortalToNodes(portal, back, other_node);
3235 AddPortalToNodes(portal, other_node, back);
3241 AddPortalToNodes(portal, front, other_node);
3243 AddPortalToNodes(portal, other_node, front);
3247 // the portal is split
3248 splitportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3249 temp = splitportal->chain;
3250 *splitportal = *portal;
3251 splitportal->chain = temp;
3252 for (i = 0;i < numbackpoints*3;i++)
3253 splitportal->points[i] = backpoints[i];
3254 splitportal->numpoints = numbackpoints;
3255 for (i = 0;i < numfrontpoints*3;i++)
3256 portal->points[i] = frontpoints[i];
3257 portal->numpoints = numfrontpoints;
3261 AddPortalToNodes(portal, front, other_node);
3262 AddPortalToNodes(splitportal, back, other_node);
3266 AddPortalToNodes(portal, other_node, front);
3267 AddPortalToNodes(splitportal, other_node, back);
3271 Mod_Q1BSP_RecursiveNodePortals(front);
3272 Mod_Q1BSP_RecursiveNodePortals(back);
3275 static void Mod_Q1BSP_MakePortals(void)
3277 Mem_ExpandableArray_NewArray(&portalarray, loadmodel->mempool, sizeof(portal_t), 1020*1024/sizeof(portal_t));
3278 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3279 Mod_Q1BSP_FinalizePortals();
3280 Mem_ExpandableArray_FreeArray(&portalarray);
3283 //Returns PVS data for a given point
3284 //(note: can return NULL)
3285 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3288 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3290 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3291 if (((mleaf_t *)node)->clusterindex >= 0)
3292 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3297 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)
3301 float d = PlaneDiff(org, node->plane);
3303 node = node->children[0];
3304 else if (d < -radius)
3305 node = node->children[1];
3308 // go down both sides
3309 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3310 node = node->children[1];
3313 // if this leaf is in a cluster, accumulate the pvs bits
3314 if (((mleaf_t *)node)->clusterindex >= 0)
3317 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3318 for (i = 0;i < pvsbytes;i++)
3319 pvsbuffer[i] |= pvs[i];
3323 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3324 //of the given point.
3325 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3327 int bytes = model->brush.num_pvsclusterbytes;
3328 bytes = min(bytes, pvsbufferlength);
3329 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3331 memset(pvsbuffer, 0xFF, bytes);
3335 memset(pvsbuffer, 0, bytes);
3336 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3340 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3345 VectorSubtract(inmaxs, inmins, size);
3346 if (cmodel->brush.ishlbsp)
3349 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3350 else if (size[0] <= 32)
3352 if (size[2] < 54) // pick the nearest of 36 or 72
3353 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3355 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3358 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3363 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3364 else if (size[0] <= 32)
3365 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3367 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3369 VectorCopy(inmins, outmins);
3370 VectorAdd(inmins, hull->clip_size, outmaxs);
3373 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3378 mempool_t *mainmempool;
3379 float dist, modelyawradius, modelradius;
3380 msurface_t *surface;
3381 int numshadowmeshtriangles;
3382 hullinfo_t hullinfo;
3383 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3384 model_brush_lightstyleinfo_t styleinfo[256];
3385 unsigned char *datapointer;
3387 mod->modeldatatypestring = "Q1BSP";
3389 mod->type = mod_brushq1;
3391 header = (dheader_t *)buffer;
3393 i = LittleLong(header->version);
3394 if (i != BSPVERSION && i != 30)
3395 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3396 mod->brush.ishlbsp = i == 30;
3398 // fill in hull info
3399 VectorClear (hullinfo.hullsizes[0][0]);
3400 VectorClear (hullinfo.hullsizes[0][1]);
3401 if (mod->brush.ishlbsp)
3403 mod->modeldatatypestring = "HLBSP";
3405 hullinfo.filehulls = 4;
3406 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3407 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3408 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3409 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3410 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3411 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3415 hullinfo.filehulls = 4;
3416 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3417 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3418 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3419 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3423 mod_base = (unsigned char*)buffer;
3424 for (i = 0; i < HEADER_LUMPS; i++)
3426 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3427 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3430 mod->soundfromcenter = true;
3431 mod->TraceBox = Mod_Q1BSP_TraceBox;
3432 mod->TraceLine = Mod_Q1BSP_TraceLine;
3433 mod->TracePoint = Mod_Q1BSP_TracePoint;
3434 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3435 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3436 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3437 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3438 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3439 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3440 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3441 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3442 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3443 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3444 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3445 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3446 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3447 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3448 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3449 mod->Draw = R_Q1BSP_Draw;
3450 mod->DrawDepth = R_Q1BSP_DrawDepth;
3451 mod->DrawDebug = R_Q1BSP_DrawDebug;
3452 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
3453 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3454 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3455 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3456 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3457 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3458 mod->DrawLight = R_Q1BSP_DrawLight;
3462 mod->brush.qw_md4sum = 0;
3463 mod->brush.qw_md4sum2 = 0;
3464 for (i = 0;i < HEADER_LUMPS;i++)
3466 if (i == LUMP_ENTITIES)
3468 mod->brush.qw_md4sum ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3469 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3471 mod->brush.qw_md4sum2 ^= LittleLong(Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen));
3474 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3475 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3476 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3477 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3478 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3479 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3480 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3481 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3482 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3483 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3484 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3485 // load submodels before leafs because they contain the number of vis leafs
3486 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3487 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3488 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3489 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3491 // check if the map supports transparent water rendering
3492 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3494 if (mod->brushq1.data_compressedpvs)
3495 Mem_Free(mod->brushq1.data_compressedpvs);
3496 mod->brushq1.data_compressedpvs = NULL;
3497 mod->brushq1.num_compressedpvs = 0;
3499 Mod_Q1BSP_MakeHull0();
3500 Mod_Q1BSP_MakePortals();
3502 mod->numframes = 2; // regular and alternate animation
3505 mainmempool = mod->mempool;
3507 // make a single combined shadow mesh to allow optimized shadow volume creation
3508 numshadowmeshtriangles = 0;
3509 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3511 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3512 numshadowmeshtriangles += surface->num_triangles;
3514 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3515 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
3516 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));
3517 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
3518 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
3520 if (loadmodel->brush.numsubmodels)
3521 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3523 // LordHavoc: to clear the fog around the original quake submodel code, I
3525 // first of all, some background info on the submodels:
3526 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3527 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3528 // now the weird for loop itself:
3529 // the loop functions in an odd way, on each iteration it sets up the
3530 // current 'mod' model (which despite the confusing code IS the model of
3531 // the number i), at the end of the loop it duplicates the model to become
3532 // the next submodel, and loops back to set up the new submodel.
3534 // LordHavoc: now the explanation of my sane way (which works identically):
3535 // set up the world model, then on each submodel copy from the world model
3536 // and set up the submodel with the respective model info.
3537 totalstylesurfaces = 0;
3539 for (i = 0;i < mod->brush.numsubmodels;i++)
3541 memset(stylecounts, 0, sizeof(stylecounts));
3542 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3544 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3545 for (j = 0;j < MAXLIGHTMAPS;j++)
3546 stylecounts[surface->lightmapinfo->styles[j]]++;
3548 for (k = 0;k < 255;k++)
3552 totalstylesurfaces += stylecounts[k];
3555 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3556 for (i = 0;i < mod->brush.numsubmodels;i++)
3558 // LordHavoc: this code was originally at the end of this loop, but
3559 // has been transformed to something more readable at the start here.
3564 // duplicate the basic information
3565 dpsnprintf(name, sizeof(name), "*%i", i);
3566 mod = Mod_FindName(name, loadmodel->name);
3567 // copy the base model to this one
3569 // rename the clone back to its proper name
3570 strlcpy(mod->name, name, sizeof(mod->name));
3571 mod->brush.parentmodel = loadmodel;
3572 // textures and memory belong to the main model
3573 mod->texturepool = NULL;
3574 mod->mempool = NULL;
3575 mod->brush.GetPVS = NULL;
3576 mod->brush.FatPVS = NULL;
3577 mod->brush.BoxTouchingPVS = NULL;
3578 mod->brush.BoxTouchingLeafPVS = NULL;
3579 mod->brush.BoxTouchingVisibleLeafs = NULL;
3580 mod->brush.FindBoxClusters = NULL;
3581 mod->brush.LightPoint = NULL;
3582 mod->brush.AmbientSoundLevelsForPoint = NULL;
3585 mod->brush.submodel = i;
3587 if (loadmodel->brush.submodels)
3588 loadmodel->brush.submodels[i] = mod;
3590 bm = &mod->brushq1.submodels[i];
3592 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3593 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3595 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3596 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3599 mod->firstmodelsurface = bm->firstface;
3600 mod->nummodelsurfaces = bm->numfaces;
3602 // set node/leaf parents for this submodel
3603 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
3605 // make the model surface list (used by shadowing/lighting)
3606 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3607 Mod_MakeSortedSurfaces(mod);
3609 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3610 // (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)
3611 VectorCopy(bm->mins, mod->normalmins);
3612 VectorCopy(bm->maxs, mod->normalmaxs);
3613 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3614 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3615 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3616 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3617 modelradius = modelyawradius + modelradius * modelradius;
3618 modelyawradius = sqrt(modelyawradius);
3619 modelradius = sqrt(modelradius);
3620 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3621 mod->yawmins[2] = mod->normalmins[2];
3622 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
3623 mod->yawmaxs[2] = mod->normalmaxs[2];
3624 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3625 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3626 mod->radius = modelradius;
3627 mod->radius2 = modelradius * modelradius;
3629 // this gets altered below if sky or water is used
3630 mod->DrawSky = NULL;
3631 mod->DrawAddWaterPlanes = NULL;
3633 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3634 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3635 if (mod->nummodelsurfaces)
3637 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3638 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3640 if (j < mod->nummodelsurfaces)
3641 mod->DrawSky = R_Q1BSP_DrawSky;
3643 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3644 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
3646 if (j < mod->nummodelsurfaces)
3647 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3649 // build lightstyle update chains
3650 // (used to rapidly mark lightmapupdateflags on many surfaces
3651 // when d_lightstylevalue changes)
3652 memset(stylecounts, 0, sizeof(stylecounts));
3653 for (k = 0;k < mod->nummodelsurfaces;k++)
3655 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3656 for (j = 0;j < MAXLIGHTMAPS;j++)
3657 stylecounts[surface->lightmapinfo->styles[j]]++;
3659 mod->brushq1.num_lightstyles = 0;
3660 for (k = 0;k < 255;k++)
3664 styleinfo[mod->brushq1.num_lightstyles].style = k;
3665 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3666 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3667 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3668 remapstyles[k] = mod->brushq1.num_lightstyles;
3669 mod->brushq1.num_lightstyles++;
3672 for (k = 0;k < mod->nummodelsurfaces;k++)
3674 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3675 for (j = 0;j < MAXLIGHTMAPS;j++)
3677 if (surface->lightmapinfo->styles[j] != 255)
3679 int r = remapstyles[surface->lightmapinfo->styles[j]];
3680 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3684 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3685 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3689 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3690 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3692 //mod->brushq1.num_visleafs = bm->visleafs;
3695 Mod_Q1BSP_LoadMapBrushes();
3697 //Mod_Q1BSP_ProcessLightList();
3699 if (developer.integer >= 10)
3700 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);
3703 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3707 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3714 in = (void *)(mod_base + l->fileofs);
3715 if (l->filelen % sizeof(*in))
3716 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3717 count = l->filelen / sizeof(*in);
3718 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3721 loadmodel->num = count;
3723 for (i = 0;i < count;i++, in++, out++)
3729 static void Mod_Q2BSP_LoadVertices(lump_t *l)
3736 in = (void *)(mod_base + l->fileofs);
3737 if (l->filelen % sizeof(*in))
3738 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
3739 count = l->filelen / sizeof(*in);
3740 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3743 loadmodel->num = count;
3745 for (i = 0;i < count;i++, in++, out++)
3751 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
3758 in = (void *)(mod_base + l->fileofs);
3759 if (l->filelen % sizeof(*in))
3760 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
3761 count = l->filelen / sizeof(*in);
3762 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3765 loadmodel->num = count;
3767 for (i = 0;i < count;i++, in++, out++)
3773 static void Mod_Q2BSP_LoadNodes(lump_t *l)
3780 in = (void *)(mod_base + l->fileofs);
3781 if (l->filelen % sizeof(*in))
3782 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
3783 count = l->filelen / sizeof(*in);
3784 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3787 loadmodel->num = count;
3789 for (i = 0;i < count;i++, in++, out++)
3795 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
3802 in = (void *)(mod_base + l->fileofs);
3803 if (l->filelen % sizeof(*in))
3804 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
3805 count = l->filelen / sizeof(*in);
3806 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3809 loadmodel->num = count;
3811 for (i = 0;i < count;i++, in++, out++)
3817 static void Mod_Q2BSP_LoadFaces(lump_t *l)
3824 in = (void *)(mod_base + l->fileofs);
3825 if (l->filelen % sizeof(*in))
3826 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
3827 count = l->filelen / sizeof(*in);
3828 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3831 loadmodel->num = count;
3833 for (i = 0;i < count;i++, in++, out++)
3839 static void Mod_Q2BSP_LoadLighting(lump_t *l)
3846 in = (void *)(mod_base + l->fileofs);
3847 if (l->filelen % sizeof(*in))
3848 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
3849 count = l->filelen / sizeof(*in);
3850 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3853 loadmodel->num = count;
3855 for (i = 0;i < count;i++, in++, out++)
3861 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
3868 in = (void *)(mod_base + l->fileofs);
3869 if (l->filelen % sizeof(*in))
3870 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
3871 count = l->filelen / sizeof(*in);
3872 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3875 loadmodel->num = count;
3877 for (i = 0;i < count;i++, in++, out++)
3883 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
3890 in = (void *)(mod_base + l->fileofs);
3891 if (l->filelen % sizeof(*in))
3892 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
3893 count = l->filelen / sizeof(*in);
3894 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3897 loadmodel->num = count;
3899 for (i = 0;i < count;i++, in++, out++)
3905 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
3912 in = (void *)(mod_base + l->fileofs);
3913 if (l->filelen % sizeof(*in))
3914 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
3915 count = l->filelen / sizeof(*in);
3916 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3919 loadmodel->num = count;
3921 for (i = 0;i < count;i++, in++, out++)
3927 static void Mod_Q2BSP_LoadEdges(lump_t *l)
3934 in = (void *)(mod_base + l->fileofs);
3935 if (l->filelen % sizeof(*in))
3936 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
3937 count = l->filelen / sizeof(*in);
3938 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3941 loadmodel->num = count;
3943 for (i = 0;i < count;i++, in++, out++)
3949 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
3956 in = (void *)(mod_base + l->fileofs);
3957 if (l->filelen % sizeof(*in))
3958 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
3959 count = l->filelen / sizeof(*in);
3960 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3963 loadmodel->num = count;
3965 for (i = 0;i < count;i++, in++, out++)
3971 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
3978 in = (void *)(mod_base + l->fileofs);
3979 if (l->filelen % sizeof(*in))
3980 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
3981 count = l->filelen / sizeof(*in);
3982 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3985 loadmodel->num = count;
3987 for (i = 0;i < count;i++, in++, out++)
3993 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4000 in = (void *)(mod_base + l->fileofs);
4001 if (l->filelen % sizeof(*in))
4002 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4003 count = l->filelen / sizeof(*in);
4004 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4007 loadmodel->num = count;
4009 for (i = 0;i < count;i++, in++, out++)
4015 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4022 in = (void *)(mod_base + l->fileofs);
4023 if (l->filelen % sizeof(*in))
4024 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4025 count = l->filelen / sizeof(*in);
4026 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4029 loadmodel->num = count;
4031 for (i = 0;i < count;i++, in++, out++)
4037 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4044 in = (void *)(mod_base + l->fileofs);
4045 if (l->filelen % sizeof(*in))
4046 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4047 count = l->filelen / sizeof(*in);
4048 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4051 loadmodel->num = count;
4053 for (i = 0;i < count;i++, in++, out++)
4059 static void Mod_Q2BSP_LoadModels(lump_t *l)
4066 in = (void *)(mod_base + l->fileofs);
4067 if (l->filelen % sizeof(*in))
4068 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4069 count = l->filelen / sizeof(*in);
4070 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4073 loadmodel->num = count;
4075 for (i = 0;i < count;i++, in++, out++)
4081 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4084 q2dheader_t *header;
4086 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4088 mod->modeldatatypestring = "Q2BSP";
4090 mod->type = mod_brushq2;
4092 header = (q2dheader_t *)buffer;
4094 i = LittleLong(header->version);
4095 if (i != Q2BSPVERSION)
4096 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4098 mod_base = (unsigned char *)header;
4100 // swap all the lumps
4101 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4102 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4104 mod->brush.qw_md4sum = 0;
4105 mod->brush.qw_md4sum2 = 0;
4106 for (i = 0;i < Q2HEADER_LUMPS;i++)
4108 if (i == Q2LUMP_ENTITIES)
4110 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4111 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4113 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4116 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4117 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4118 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4119 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4120 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4121 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4122 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4123 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4124 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4125 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4126 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4127 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4128 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4129 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4130 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4131 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4132 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4133 // LordHavoc: must go last because this makes the submodels
4134 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4137 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4138 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4140 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4143 char key[128], value[MAX_INPUTLINE];
4145 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4146 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4147 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4150 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4151 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4152 loadmodel->brush.entities[l->filelen] = 0;
4153 data = loadmodel->brush.entities;
4154 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4155 // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
4156 loadmodel->brushq3.deluxemapping = false;
4157 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4161 if (!COM_ParseToken_Simple(&data, false, false))
4163 if (com_token[0] == '}')
4164 break; // end of worldspawn
4165 if (com_token[0] == '_')
4166 strlcpy(key, com_token + 1, sizeof(key));
4168 strlcpy(key, com_token, sizeof(key));
4169 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4170 key[strlen(key)-1] = 0;
4171 if (!COM_ParseToken_Simple(&data, false, false))
4173 strlcpy(value, com_token, sizeof(value));
4174 if (!strcasecmp("gridsize", key)) // this one is case insensitive to 100% match q3map2
4176 #if _MSC_VER >= 1400
4177 #define sscanf sscanf_s
4180 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4181 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4183 VectorSet(v, 64, 64, 128);
4184 if(sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) != 3)
4185 Con_Printf("Mod_Q3BSP_LoadEntities: funny gridsize \"%s\" in %s, interpreting as \"%f %f %f\" to match q3map2's parsing\n", value, loadmodel->name, v[0], v[1], v[2]);
4186 if (v[0] != 0 && v[1] != 0 && v[2] != 0)
4187 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4190 else if (!strcmp("deluxeMaps", key))
4192 if (!strcmp(com_token, "1"))
4194 loadmodel->brushq3.deluxemapping = true;
4195 loadmodel->brushq3.deluxemapping_modelspace = true;
4197 else if (!strcmp(com_token, "2"))
4199 loadmodel->brushq3.deluxemapping = true;
4200 loadmodel->brushq3.deluxemapping_modelspace = false;
4207 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4213 in = (q3dtexture_t *)(mod_base + l->fileofs);
4214 if (l->filelen % sizeof(*in))
4215 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4216 count = l->filelen / sizeof(*in);
4217 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4219 loadmodel->data_textures = out;
4220 loadmodel->num_textures = count;
4221 loadmodel->num_texturesperskin = loadmodel->num_textures;
4223 for (i = 0;i < count;i++)
4225 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4226 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4227 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4230 if (cls.state == ca_dedicated)
4233 for (i = 0;i < count;i++, in++, out++)
4234 Mod_LoadTextureFromQ3Shader(out, out->name, true, true, TEXF_MIPMAP | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
4237 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4243 in = (q3dplane_t *)(mod_base + l->fileofs);
4244 if (l->filelen % sizeof(*in))
4245 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4246 count = l->filelen / sizeof(*in);
4247 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4249 loadmodel->brush.data_planes = out;
4250 loadmodel->brush.num_planes = count;
4252 for (i = 0;i < count;i++, in++, out++)
4254 out->normal[0] = LittleFloat(in->normal[0]);
4255 out->normal[1] = LittleFloat(in->normal[1]);
4256 out->normal[2] = LittleFloat(in->normal[2]);
4257 out->dist = LittleFloat(in->dist);
4262 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4265 q3mbrushside_t *out;
4268 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4269 if (l->filelen % sizeof(*in))
4270 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4271 count = l->filelen / sizeof(*in);
4272 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4274 loadmodel->brush.data_brushsides = out;
4275 loadmodel->brush.num_brushsides = count;
4277 for (i = 0;i < count;i++, in++, out++)
4279 n = LittleLong(in->planeindex);
4280 if (n < 0 || n >= loadmodel->brush.num_planes)
4281 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4282 out->plane = loadmodel->brush.data_planes + n;
4283 n = LittleLong(in->textureindex);
4284 if (n < 0 || n >= loadmodel->num_textures)
4285 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4286 out->texture = loadmodel->data_textures + n;
4290 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4292 q3dbrushside_ig_t *in;
4293 q3mbrushside_t *out;
4296 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4297 if (l->filelen % sizeof(*in))
4298 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4299 count = l->filelen / sizeof(*in);
4300 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4302 loadmodel->brush.data_brushsides = out;
4303 loadmodel->brush.num_brushsides = count;
4305 for (i = 0;i < count;i++, in++, out++)
4307 n = LittleLong(in->planeindex);
4308 if (n < 0 || n >= loadmodel->brush.num_planes)
4309 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4310 out->plane = loadmodel->brush.data_planes + n;
4311 n = LittleLong(in->textureindex);
4312 if (n < 0 || n >= loadmodel->num_textures)
4313 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4314 out->texture = loadmodel->data_textures + n;
4318 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4322 int i, j, n, c, count, maxplanes, q3surfaceflags;
4323 colplanef_t *planes;
4325 in = (q3dbrush_t *)(mod_base + l->fileofs);
4326 if (l->filelen % sizeof(*in))
4327 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4328 count = l->filelen / sizeof(*in);
4329 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4331 loadmodel->brush.data_brushes = out;
4332 loadmodel->brush.num_brushes = count;
4337 for (i = 0;i < count;i++, in++, out++)
4339 n = LittleLong(in->firstbrushside);
4340 c = LittleLong(in->numbrushsides);
4341 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4342 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4343 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4344 out->numbrushsides = c;
4345 n = LittleLong(in->textureindex);
4346 if (n < 0 || n >= loadmodel->num_textures)
4347 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4348 out->texture = loadmodel->data_textures + n;
4350 // make a list of mplane_t structs to construct a colbrush from
4351 if (maxplanes < out->numbrushsides)
4353 maxplanes = out->numbrushsides;
4356 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4359 for (j = 0;j < out->numbrushsides;j++)
4361 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4362 planes[j].dist = out->firstbrushside[j].plane->dist;
4363 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4364 planes[j].texture = out->firstbrushside[j].texture;
4365 q3surfaceflags |= planes[j].q3surfaceflags;
4367 // make the colbrush from the planes
4368 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4370 // this whole loop can take a while (e.g. on redstarrepublic4)
4371 CL_KeepaliveMessage(false);
4377 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4383 in = (q3deffect_t *)(mod_base + l->fileofs);
4384 if (l->filelen % sizeof(*in))
4385 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4386 count = l->filelen / sizeof(*in);
4387 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4389 loadmodel->brushq3.data_effects = out;
4390 loadmodel->brushq3.num_effects = count;
4392 for (i = 0;i < count;i++, in++, out++)
4394 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4395 n = LittleLong(in->brushindex);
4396 if (n >= loadmodel->brush.num_brushes)
4398 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4401 out->brushindex = n;
4402 out->unknown = LittleLong(in->unknown);
4406 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4411 in = (q3dvertex_t *)(mod_base + l->fileofs);
4412 if (l->filelen % sizeof(*in))
4413 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4414 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4415 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4416 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4417 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4418 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4419 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4421 for (i = 0;i < count;i++, in++)
4423 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4424 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4425 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4426 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4427 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4428 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4429 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4430 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4431 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4432 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4433 // svector/tvector are calculated later in face loading
4434 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4435 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4436 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4437 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4441 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4447 in = (int *)(mod_base + l->fileofs);
4448 if (l->filelen % sizeof(int[3]))
4449 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4450 count = l->filelen / sizeof(*in);
4451 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4453 loadmodel->brushq3.num_triangles = count / 3;
4454 loadmodel->brushq3.data_element3i = out;
4456 for (i = 0;i < count;i++, in++, out++)
4458 *out = LittleLong(*in);
4459 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4461 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4462 if(!loadmodel->brushq3.num_vertices)
4463 Host_Error("Mod_Q1BSP_LoadTrianglles: %s has triangles but no vertexes, cannot fix\n", loadmodel->name);
4469 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4471 q3dlightmap_t *input_pointer;
4472 int i, j, k, count, power, power2, mask, endlightmap, mergewidth, mergeheight;
4475 unsigned char *convertedpixels;
4476 char mapname[MAX_QPATH];
4477 int size, bytesperpixel, rgbmap[3];
4479 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4481 // defaults for q3bsp
4488 loadmodel->brushq3.lightmapsize = 128;
4490 if (cls.state == ca_dedicated)
4493 if(mod_q3bsp_nolightmaps.integer)
4499 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4500 if (developer_loading.integer)
4501 Con_Printf("Using internal lightmaps\n");
4502 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4503 if (l->filelen % sizeof(*input_pointer))
4504 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4505 count = l->filelen / sizeof(*input_pointer);
4506 for(i = 0; i < count; ++i)
4507 inpixels[i] = input_pointer[i].rgb;
4511 // no internal lightmaps
4512 // try external lightmaps
4513 if (developer_loading.integer)
4514 Con_Printf("Using external lightmaps\n");
4515 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4516 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false);
4520 // using EXTERNAL lightmaps instead
4521 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4523 Mem_Free(inpixels[0]);
4524 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4534 for(count = 1; ; ++count)
4536 inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false);
4537 if(!inpixels[count])
4538 break; // we got all of them
4539 if(image_width != size || image_height != size)
4541 for(i = 0; i <= count; ++i)
4542 Mem_Free(inpixels[i]);
4543 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4548 convertedpixels = (unsigned char *) Mem_Alloc(tempmempool, size*size*4);
4549 loadmodel->brushq3.lightmapsize = size;
4550 loadmodel->brushq3.num_originallightmaps = count;
4552 // now check the surfaces to see if any of them index an odd numbered
4553 // lightmap, if so this is not a deluxemapped bsp file
4555 // also check what lightmaps are actually used, because q3map2 sometimes
4556 // (always?) makes an unused one at the end, which
4557 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4558 // reason when only one lightmap is used, which can throw off the
4559 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4560 // to see if the second lightmap is blank, if so it is not deluxemapped.
4561 // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
4562 // in Mod_Q3BSP_LoadEntities was failed
4563 if (!loadmodel->brushq3.deluxemapping)
4565 loadmodel->brushq3.deluxemapping = !(count & 1);
4566 loadmodel->brushq3.deluxemapping_modelspace = true;
4568 if (loadmodel->brushq3.deluxemapping)
4570 int facecount = faceslump->filelen / sizeof(q3dface_t);
4571 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4572 for (i = 0;i < facecount;i++)
4574 j = LittleLong(faces[i].lightmapindex);
4577 endlightmap = max(endlightmap, j + 1);
4578 if ((j & 1) || j + 1 >= count)
4580 loadmodel->brushq3.deluxemapping = false;
4587 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4588 // reason when only one lightmap is used, which can throw off the
4589 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4590 // to see if the second lightmap is blank, if so it is not deluxemapped.
4592 // further research has shown q3map2 sometimes creates a deluxemap and two
4593 // blank lightmaps, which must be handled properly as well
4594 if (endlightmap == 1 && count > 1)
4597 for (i = 0;i < size*size;i++)
4599 if (c[bytesperpixel*i + rgbmap[0]])
4601 if (c[bytesperpixel*i + rgbmap[1]])
4603 if (c[bytesperpixel*i + rgbmap[2]])
4608 // all pixels in the unused lightmap were black...
4609 loadmodel->brushq3.deluxemapping = false;
4614 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4616 // figure out what the most reasonable merge power is within limits
4618 loadmodel->brushq3.num_lightmapmergepower = 0;
4620 for(i = 0; (128 << i) < size; ++i)
4622 // i is now 0 for 128, 1 for 256, etc
4624 for (power = 1;power + i <= mod_q3bsp_lightmapmergepower.integer && (size << power) <= (int)vid.maxtexturesize_2d && (1 << (power * 2)) < 4 * (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)); power++)
4625 loadmodel->brushq3.num_lightmapmergepower = power;
4627 loadmodel->brushq3.num_lightmapmerge = 1 << loadmodel->brushq3.num_lightmapmergepower;
4629 loadmodel->brushq3.num_mergedlightmaps = ((count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) + (1 << (loadmodel->brushq3.num_lightmapmergepower * 2)) - 1) >> (loadmodel->brushq3.num_lightmapmergepower * 2);
4630 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4631 if (loadmodel->brushq3.deluxemapping)
4632 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4634 // allocate a texture pool if we need it
4635 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4636 loadmodel->texturepool = R_AllocTexturePool();
4638 power = loadmodel->brushq3.num_lightmapmergepower;
4640 mask = (1 << power) - 1;
4641 for (i = 0;i < count;i++)
4643 // figure out which merged lightmap texture this fits into
4644 int lightmapindex = i >> (loadmodel->brushq3.deluxemapping + power2);
4645 for (k = 0;k < size*size;k++)
4647 convertedpixels[k*4+0] = inpixels[i][k*bytesperpixel+rgbmap[0]];
4648 convertedpixels[k*4+1] = inpixels[i][k*bytesperpixel+rgbmap[1]];
4649 convertedpixels[k*4+2] = inpixels[i][k*bytesperpixel+rgbmap[2]];
4650 convertedpixels[k*4+3] = 255;
4652 if (loadmodel->brushq3.num_lightmapmergepower > 0)
4654 // if the lightmap has not been allocated yet, create it
4655 if (!loadmodel->brushq3.data_lightmaps[lightmapindex])
4657 // create a lightmap only as large as necessary to hold the
4658 // remaining size*size blocks
4659 // if there are multiple merged lightmap textures then they will
4660 // all be full size except the last one which may be smaller
4661 // because it only needs to the remaining blocks, and it will often
4662 // be odd sizes like 2048x512 due to only being 25% full or so.
4663 j = (count >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) - (lightmapindex << power2);
4664 for (mergewidth = 1;mergewidth < j && mergewidth < (1 << power);mergewidth *= 2)
4666 for (mergeheight = 1;mergewidth*mergeheight < j && mergeheight < (1 << power);mergeheight *= 2)
4668 if (developer_loading.integer)
4669 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);
4670 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);
4671 if (loadmodel->brushq3.data_deluxemaps)
4672 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);
4674 mergewidth = R_TextureWidth(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4675 mergeheight = R_TextureHeight(loadmodel->brushq3.data_lightmaps[lightmapindex]) / size;
4676 j = (i >> (loadmodel->brushq3.deluxemapping ? 1 : 0)) & ((1 << power2) - 1);
4677 if (loadmodel->brushq3.deluxemapping && (i & 1))
4678 R_UpdateTexture(loadmodel->brushq3.data_deluxemaps[lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4680 R_UpdateTexture(loadmodel->brushq3.data_lightmaps [lightmapindex], convertedpixels, (j % mergewidth) * size, (j / mergewidth) * size, size, size);
4684 // figure out which merged lightmap texture this fits into
4685 if (loadmodel->brushq3.deluxemapping && (i & 1))
4686 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);
4688 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);
4692 Mem_Free(convertedpixels);
4695 for(i = 0; i < count; ++i)
4696 Mem_Free(inpixels[i]);
4700 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
4705 *collisionstride = stride;
4708 cnt = (num_triangles + stride - 1) / stride;
4709 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
4710 for(j = 0; j < cnt; ++j)
4712 mins = &((*collisionbbox6f)[6 * j + 0]);
4713 maxs = &((*collisionbbox6f)[6 * j + 3]);
4714 for(k = 0; k < stride; ++k)
4716 tri = j * stride + k;
4717 if(tri >= num_triangles)
4719 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
4720 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
4721 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
4722 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
4723 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
4724 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
4725 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
4726 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
4727 if(vert[0] < mins[0]) mins[0] = vert[0];
4728 if(vert[1] < mins[1]) mins[1] = vert[1];
4729 if(vert[2] < mins[2]) mins[2] = vert[2];
4730 if(vert[0] > maxs[0]) maxs[0] = vert[0];
4731 if(vert[1] > maxs[1]) maxs[1] = vert[1];
4732 if(vert[2] > maxs[2]) maxs[2] = vert[2];
4733 vert = &(vertex3f[element3i[3 * tri + 2] * 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];
4744 *collisionbbox6f = NULL;
4747 typedef struct patchtess_s
4751 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
4754 float *originalvertex3f;
4757 #define PATCHTESS_SAME_LODGROUP(a,b) \
4759 (a).lodgroup[0] == (b).lodgroup[0] && \
4760 (a).lodgroup[1] == (b).lodgroup[1] && \
4761 (a).lodgroup[2] == (b).lodgroup[2] && \
4762 (a).lodgroup[3] == (b).lodgroup[3] && \
4763 (a).lodgroup[4] == (b).lodgroup[4] && \
4764 (a).lodgroup[5] == (b).lodgroup[5] \
4767 static void Mod_Q3BSP_LoadFaces(lump_t *l)
4769 q3dface_t *in, *oldin;
4770 msurface_t *out, *oldout;
4771 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;
4772 float lightmaptcbase[2], lightmaptcscale[2];
4773 //int *originalelement3i;
4774 //int *originalneighbor3i;
4775 float *originalvertex3f;
4776 //float *originalsvector3f;
4777 //float *originaltvector3f;
4778 float *originalnormal3f;
4779 float *originalcolor4f;
4780 float *originaltexcoordtexture2f;
4781 float *originaltexcoordlightmap2f;
4783 patchtess_t *patchtess = NULL;
4784 int patchtesscount = 0;
4787 in = (q3dface_t *)(mod_base + l->fileofs);
4788 if (l->filelen % sizeof(*in))
4789 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4790 count = l->filelen / sizeof(*in);
4791 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4793 loadmodel->data_surfaces = out;
4794 loadmodel->num_surfaces = count;
4797 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
4805 for (;i < count;i++, in++, out++)
4807 // check face type first
4808 type = LittleLong(in->type);
4809 if (type != Q3FACETYPE_FLAT
4810 && type != Q3FACETYPE_PATCH
4811 && type != Q3FACETYPE_MESH
4812 && type != Q3FACETYPE_FLARE)
4814 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
4818 n = LittleLong(in->textureindex);
4819 if (n < 0 || n >= loadmodel->num_textures)
4821 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
4824 out->texture = loadmodel->data_textures + n;
4825 n = LittleLong(in->effectindex);
4826 if (n < -1 || n >= loadmodel->brushq3.num_effects)
4828 if (developer.integer >= 100)
4829 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
4835 out->effect = loadmodel->brushq3.data_effects + n;
4837 if (cls.state != ca_dedicated)
4839 out->lightmaptexture = NULL;
4840 out->deluxemaptexture = r_texture_blanknormalmap;
4841 n = LittleLong(in->lightmapindex);
4844 else if (n >= loadmodel->brushq3.num_originallightmaps)
4846 if(loadmodel->brushq3.num_originallightmaps != 0)
4847 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
4852 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4853 if (loadmodel->brushq3.deluxemapping)
4854 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> (loadmodel->brushq3.num_lightmapmergepower * 2 + loadmodel->brushq3.deluxemapping)];
4858 firstvertex = LittleLong(in->firstvertex);
4859 numvertices = LittleLong(in->numvertices);
4860 firstelement = LittleLong(in->firstelement);
4861 numtriangles = LittleLong(in->numelements) / 3;
4862 if (numtriangles * 3 != LittleLong(in->numelements))
4864 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));
4867 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
4869 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);
4872 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
4874 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);
4879 case Q3FACETYPE_FLAT:
4880 case Q3FACETYPE_MESH:
4881 // no processing necessary
4883 case Q3FACETYPE_PATCH:
4884 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
4885 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
4886 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))
4888 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
4891 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
4893 // convert patch to Q3FACETYPE_MESH
4894 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4895 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
4896 // bound to user settings
4897 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
4898 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
4899 // bound to sanity settings
4900 xtess = bound(0, xtess, 1024);
4901 ytess = bound(0, ytess, 1024);
4903 // lower quality collision patches! Same procedure as before, but different cvars
4904 // convert patch to Q3FACETYPE_MESH
4905 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4906 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
4907 // bound to user settings
4908 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
4909 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
4910 // bound to sanity settings
4911 cxtess = bound(0, cxtess, 1024);
4912 cytess = bound(0, cytess, 1024);
4914 // store it for the LOD grouping step
4915 patchtess[patchtesscount].info.xsize = patchsize[0];
4916 patchtess[patchtesscount].info.ysize = patchsize[1];
4917 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
4918 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
4919 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
4920 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
4922 patchtess[patchtesscount].surface_id = i;
4923 patchtess[patchtesscount].lodgroup[0] = in->specific.patch.mins[0];
4924 patchtess[patchtesscount].lodgroup[1] = in->specific.patch.mins[1];
4925 patchtess[patchtesscount].lodgroup[2] = in->specific.patch.mins[2];
4926 patchtess[patchtesscount].lodgroup[3] = in->specific.patch.maxs[0];
4927 patchtess[patchtesscount].lodgroup[4] = in->specific.patch.maxs[1];
4928 patchtess[patchtesscount].lodgroup[5] = in->specific.patch.maxs[2];
4929 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
4932 case Q3FACETYPE_FLARE:
4933 if (developer.integer >= 100)
4934 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
4938 out->num_vertices = numvertices;
4939 out->num_triangles = numtriangles;
4940 meshvertices += out->num_vertices;
4941 meshtriangles += out->num_triangles;
4944 // Fix patches tesselations so that they make no seams
4948 for(i = 0; i < patchtesscount; ++i)
4950 for(j = i+1; j < patchtesscount; ++j)
4952 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
4955 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
4962 // Calculate resulting number of triangles
4963 for(i = 0; i < patchtesscount; ++i)
4965 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
4966 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
4967 numvertices = finalwidth * finalheight;
4968 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
4970 oldout[patchtess[i].surface_id].num_vertices = numvertices;
4971 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
4972 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
4973 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
4979 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
4982 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
4984 if (out->num_vertices < 3 || out->num_triangles < 1)
4987 type = LittleLong(in->type);
4988 firstvertex = LittleLong(in->firstvertex);
4989 firstelement = LittleLong(in->firstelement);
4990 out->num_firstvertex = meshvertices;
4991 out->num_firsttriangle = meshtriangles;
4994 case Q3FACETYPE_FLAT:
4995 case Q3FACETYPE_MESH:
4996 // no processing necessary, except for lightmap merging
4997 for (j = 0;j < out->num_vertices;j++)
4999 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5000 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5001 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5002 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5003 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5004 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5005 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5006 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5007 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5008 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5009 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5010 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5011 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5012 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5014 for (j = 0;j < out->num_triangles*3;j++)
5015 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5017 case Q3FACETYPE_PATCH:
5018 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5019 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5020 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5021 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5022 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5023 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5024 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5026 xtess = ytess = cxtess = cytess = -1;
5027 for(j = 0; j < patchtesscount; ++j)
5028 if(patchtess[j].surface_id == i)
5030 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5031 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5032 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5033 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5038 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5039 xtess = ytess = cxtess = cytess = 0;
5042 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5043 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5044 finalvertices = finalwidth * finalheight;
5045 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5046 type = Q3FACETYPE_MESH;
5047 // generate geometry
5048 // (note: normals are skipped because they get recalculated)
5049 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5050 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5051 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5052 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5053 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5054 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5056 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);
5058 if (developer.integer >= 100)
5060 if (out->num_triangles < finaltriangles)
5061 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);
5063 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);
5065 // q3map does not put in collision brushes for curves... ugh
5066 // build the lower quality collision geometry
5067 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5068 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5069 finalvertices = finalwidth * finalheight;
5070 finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5072 out->data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5073 out->data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5074 out->num_collisionvertices = finalvertices;
5075 out->num_collisiontriangles = finaltriangles;
5076 Q3PatchTesselateFloat(3, sizeof(float[3]), out->data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5077 Q3PatchTriangleElements(out->data_collisionelement3i, finalwidth, finalheight, 0);
5079 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5080 Mod_SnapVertices(3, out->num_collisionvertices, out->data_collisionvertex3f, 1);
5082 oldnumtriangles = out->num_triangles;
5083 oldnumtriangles2 = out->num_collisiontriangles;
5084 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(out->num_collisiontriangles, out->data_collisionelement3i, out->data_collisionelement3i, out->data_collisionvertex3f);
5086 // now optimize the collision mesh by finding triangle bboxes...
5087 Mod_Q3BSP_BuildBBoxes(out->data_collisionelement3i, out->num_collisiontriangles, out->data_collisionvertex3f, &out->data_collisionbbox6f, &out->num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5088 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);
5090 if (developer.integer >= 100)
5091 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);
5096 meshvertices += out->num_vertices;
5097 meshtriangles += out->num_triangles;
5098 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5099 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)
5101 if (invalidelements)
5103 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);
5104 for (j = 0;j < out->num_triangles * 3;j++)
5106 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5107 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)
5108 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5112 // calculate a bounding box
5113 VectorClear(out->mins);
5114 VectorClear(out->maxs);
5115 if (out->num_vertices)
5117 if (cls.state != ca_dedicated && out->lightmaptexture)
5119 // figure out which part of the merged lightmap this fits into
5120 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5121 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5122 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5123 lightmapindex &= mergewidth * mergeheight - 1;
5124 lightmaptcscale[0] = 1.0f / mergewidth;
5125 lightmaptcscale[1] = 1.0f / mergeheight;
5126 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5127 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5128 // modify the lightmap texcoords to match this region of the merged lightmap
5129 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5131 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5132 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5135 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5136 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5137 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5139 out->mins[0] = min(out->mins[0], v[0]);
5140 out->maxs[0] = max(out->maxs[0], v[0]);
5141 out->mins[1] = min(out->mins[1], v[1]);
5142 out->maxs[1] = max(out->maxs[1], v[1]);
5143 out->mins[2] = min(out->mins[2], v[2]);
5144 out->maxs[2] = max(out->maxs[2], v[2]);
5146 out->mins[0] -= 1.0f;
5147 out->mins[1] -= 1.0f;
5148 out->mins[2] -= 1.0f;
5149 out->maxs[0] += 1.0f;
5150 out->maxs[1] += 1.0f;
5151 out->maxs[2] += 1.0f;
5153 // set lightmap styles for consistency with q1bsp
5154 //out->lightmapinfo->styles[0] = 0;
5155 //out->lightmapinfo->styles[1] = 255;
5156 //out->lightmapinfo->styles[2] = 255;
5157 //out->lightmapinfo->styles[3] = 255;
5162 for (;i < count;i++, out++)
5164 if(out->num_vertices && out->num_triangles)
5166 if(out->num_vertices == 0)
5167 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no vertices, ignoring\n", i);
5168 if(out->num_triangles == 0)
5169 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d has no triangles, ignoring\n", i);
5172 // for per pixel lighting
5173 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);
5175 // generate ushort elements array if possible
5176 if (loadmodel->surfmesh.data_element3s)
5177 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5178 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5180 // free the no longer needed vertex data
5181 loadmodel->brushq3.num_vertices = 0;
5182 if (loadmodel->brushq3.data_vertex3f)
5183 Mem_Free(loadmodel->brushq3.data_vertex3f);
5184 loadmodel->brushq3.data_vertex3f = NULL;
5185 loadmodel->brushq3.data_normal3f = NULL;
5186 loadmodel->brushq3.data_texcoordtexture2f = NULL;
5187 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5188 loadmodel->brushq3.data_color4f = NULL;
5189 // free the no longer needed triangle data
5190 loadmodel->brushq3.num_triangles = 0;
5191 if (loadmodel->brushq3.data_element3i)
5192 Mem_Free(loadmodel->brushq3.data_element3i);
5193 loadmodel->brushq3.data_element3i = NULL;
5196 Mem_Free(patchtess);
5199 static void Mod_Q3BSP_LoadModels(lump_t *l)
5203 int i, j, n, c, count;
5205 in = (q3dmodel_t *)(mod_base + l->fileofs);
5206 if (l->filelen % sizeof(*in))
5207 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5208 count = l->filelen / sizeof(*in);
5209 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5211 loadmodel->brushq3.data_models = out;
5212 loadmodel->brushq3.num_models = count;
5214 for (i = 0;i < count;i++, in++, out++)
5216 for (j = 0;j < 3;j++)
5218 out->mins[j] = LittleFloat(in->mins[j]);
5219 out->maxs[j] = LittleFloat(in->maxs[j]);
5221 n = LittleLong(in->firstface);
5222 c = LittleLong(in->numfaces);
5223 if (n < 0 || n + c > loadmodel->num_surfaces)
5224 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5227 n = LittleLong(in->firstbrush);
5228 c = LittleLong(in->numbrushes);
5229 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5230 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5231 out->firstbrush = n;
5232 out->numbrushes = c;
5236 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5242 in = (int *)(mod_base + l->fileofs);
5243 if (l->filelen % sizeof(*in))
5244 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5245 count = l->filelen / sizeof(*in);
5246 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5248 loadmodel->brush.data_leafbrushes = out;
5249 loadmodel->brush.num_leafbrushes = count;
5251 for (i = 0;i < count;i++, in++, out++)
5253 n = LittleLong(*in);
5254 if (n < 0 || n >= loadmodel->brush.num_brushes)
5255 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5260 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5266 in = (int *)(mod_base + l->fileofs);
5267 if (l->filelen % sizeof(*in))
5268 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5269 count = l->filelen / sizeof(*in);
5270 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5272 loadmodel->brush.data_leafsurfaces = out;
5273 loadmodel->brush.num_leafsurfaces = count;
5275 for (i = 0;i < count;i++, in++, out++)
5277 n = LittleLong(*in);
5278 if (n < 0 || n >= loadmodel->num_surfaces)
5279 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5284 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5288 int i, j, n, c, count;
5290 in = (q3dleaf_t *)(mod_base + l->fileofs);
5291 if (l->filelen % sizeof(*in))
5292 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5293 count = l->filelen / sizeof(*in);
5294 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5296 loadmodel->brush.data_leafs = out;
5297 loadmodel->brush.num_leafs = count;
5299 for (i = 0;i < count;i++, in++, out++)
5303 out->clusterindex = LittleLong(in->clusterindex);
5304 out->areaindex = LittleLong(in->areaindex);
5305 for (j = 0;j < 3;j++)
5307 // yes the mins/maxs are ints
5308 out->mins[j] = LittleLong(in->mins[j]) - 1;
5309 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5311 n = LittleLong(in->firstleafface);
5312 c = LittleLong(in->numleaffaces);
5313 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5314 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5315 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5316 out->numleafsurfaces = c;
5317 n = LittleLong(in->firstleafbrush);
5318 c = LittleLong(in->numleafbrushes);
5319 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5320 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5321 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5322 out->numleafbrushes = c;
5326 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5332 in = (q3dnode_t *)(mod_base + l->fileofs);
5333 if (l->filelen % sizeof(*in))
5334 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5335 count = l->filelen / sizeof(*in);
5336 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5338 loadmodel->brush.data_nodes = out;
5339 loadmodel->brush.num_nodes = count;
5341 for (i = 0;i < count;i++, in++, out++)
5344 n = LittleLong(in->planeindex);
5345 if (n < 0 || n >= loadmodel->brush.num_planes)
5346 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5347 out->plane = loadmodel->brush.data_planes + n;
5348 for (j = 0;j < 2;j++)
5350 n = LittleLong(in->childrenindex[j]);
5353 if (n >= loadmodel->brush.num_nodes)
5354 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5355 out->children[j] = loadmodel->brush.data_nodes + n;
5360 if (n >= loadmodel->brush.num_leafs)
5361 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5362 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5365 for (j = 0;j < 3;j++)
5367 // yes the mins/maxs are ints
5368 out->mins[j] = LittleLong(in->mins[j]) - 1;
5369 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5373 // set the parent pointers
5374 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5377 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5380 q3dlightgrid_t *out;
5383 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5384 if (l->filelen % sizeof(*in))
5385 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5386 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5387 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5388 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5389 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5390 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5391 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5392 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5393 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5394 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5395 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5396 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5397 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5398 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5399 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]);
5400 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]);
5402 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5405 if (l->filelen < count * (int)sizeof(*in))
5407 Con_Printf("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]);
5408 return; // ignore the grid if we cannot understand it
5410 if (l->filelen != count * (int)sizeof(*in))
5411 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5412 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5413 loadmodel->brushq3.data_lightgrid = out;
5414 loadmodel->brushq3.num_lightgrid = count;
5415 // no swapping or validation necessary
5416 memcpy(out, in, count * (int)sizeof(*out));
5420 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5425 if (l->filelen == 0)
5428 // unvised maps often have cluster indices even without pvs, so check
5429 // leafs to find real number of clusters
5430 loadmodel->brush.num_pvsclusters = 1;
5431 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5432 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5435 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5436 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5437 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5438 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5442 in = (q3dpvs_t *)(mod_base + l->fileofs);
5444 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5446 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5447 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5448 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5449 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5450 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5451 if (l->filelen < totalchains + (int)sizeof(*in))
5452 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);
5454 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5455 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5458 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5460 int i, j, k, index[3];
5461 float transformed[3], blend1, blend2, blend, stylescale;
5462 q3dlightgrid_t *a, *s;
5464 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5465 stylescale = r_refdef.scene.rtlightstylevalue[0];
5467 if (!model->brushq3.num_lightgrid)
5469 ambientcolor[0] = stylescale;
5470 ambientcolor[1] = stylescale;
5471 ambientcolor[2] = stylescale;
5475 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5476 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5477 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5478 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5479 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5480 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5481 index[0] = (int)floor(transformed[0]);
5482 index[1] = (int)floor(transformed[1]);
5483 index[2] = (int)floor(transformed[2]);
5484 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5486 // now lerp the values
5487 VectorClear(diffusenormal);
5488 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5489 for (k = 0;k < 2;k++)
5491 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5492 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5494 for (j = 0;j < 2;j++)
5496 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5497 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5499 for (i = 0;i < 2;i++)
5501 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5502 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5504 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5505 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5506 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5507 // this uses the mod_md3_sin table because the values are
5508 // already in the 0-255 range, the 64+ bias fetches a cosine
5509 // instead of a sine value
5510 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5511 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5512 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5513 //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)));
5518 // normalize the light direction before turning
5519 VectorNormalize(diffusenormal);
5520 //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]);
5523 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
5526 double midf, mid[3];
5532 // find the point distances
5533 mplane_t *plane = node->plane;
5534 if (plane->type < 3)
5536 t1 = p1[plane->type] - plane->dist;
5537 t2 = p2[plane->type] - plane->dist;
5541 t1 = DotProduct (plane->normal, p1) - plane->dist;
5542 t2 = DotProduct (plane->normal, p2) - plane->dist;
5549 node = node->children[1];
5558 node = node->children[0];
5564 midf = t1 / (t1 - t2);
5565 VectorLerp(p1, midf, p2, mid);
5567 // recurse both sides, front side first
5568 // return 2 if empty is followed by solid (hit something)
5569 // do not return 2 if both are solid or both empty,
5570 // or if start is solid and end is empty
5571 // as these degenerate cases usually indicate the eye is in solid and
5572 // should see the target point anyway
5573 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
5576 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
5581 return ((mleaf_t *)node)->clusterindex < 0;
5584 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
5586 if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
5589 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
5590 return trace.fraction == 1;
5594 double tracestart[3], traceend[3];
5595 VectorCopy(start, tracestart);
5596 VectorCopy(end, traceend);
5597 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
5601 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
5606 // find which leaf the point is in
5608 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5609 // point trace the brushes
5610 leaf = (mleaf_t *)node;
5611 for (i = 0;i < leaf->numleafbrushes;i++)
5613 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5614 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
5616 brush->markframe = markframe;
5617 Collision_TracePointBrushFloat(trace, point, brush);
5620 // can't do point traces on curves (they have no thickness)
5623 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)
5625 int i, startside, endside;
5626 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
5628 msurface_t *surface;
5631 // walk the tree until we hit a leaf, recursing for any split cases
5634 // abort if this part of the bsp tree can not be hit by this trace
5635 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5637 plane = node->plane;
5638 // axial planes are much more common than non-axial, so an optimized
5639 // axial case pays off here
5640 if (plane->type < 3)
5642 dist1 = start[plane->type] - plane->dist;
5643 dist2 = end[plane->type] - plane->dist;
5647 dist1 = DotProduct(start, plane->normal) - plane->dist;
5648 dist2 = DotProduct(end, plane->normal) - plane->dist;
5650 startside = dist1 < 0;
5651 endside = dist2 < 0;
5652 if (startside == endside)
5654 // most of the time the line fragment is on one side of the plane
5655 node = node->children[startside];
5659 // line crosses node plane, split the line
5660 dist1 = PlaneDiff(linestart, plane);
5661 dist2 = PlaneDiff(lineend, plane);
5662 midfrac = dist1 / (dist1 - dist2);
5663 VectorLerp(linestart, midfrac, lineend, mid);
5664 // take the near side first
5665 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5666 // if we found an impact on the front side, don't waste time
5667 // exploring the far side
5668 if (midfrac <= trace->realfraction)
5669 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
5673 // abort if this part of the bsp tree can not be hit by this trace
5674 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5677 nodesegmentmins[0] = min(start[0], end[0]) - 1;
5678 nodesegmentmins[1] = min(start[1], end[1]) - 1;
5679 nodesegmentmins[2] = min(start[2], end[2]) - 1;
5680 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
5681 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
5682 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
5683 // line trace the brushes
5684 leaf = (mleaf_t *)node;
5685 for (i = 0;i < leaf->numleafbrushes;i++)
5687 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5688 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5690 brush->markframe = markframe;
5691 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
5694 // can't do point traces on curves (they have no thickness)
5695 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
5697 // line trace the curves
5698 for (i = 0;i < leaf->numleafsurfaces;i++)
5700 surface = model->data_surfaces + leaf->firstleafsurface[i];
5701 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5703 surface->collisionmarkframe = markframe;
5704 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);
5710 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)
5716 msurface_t *surface;
5718 float nodesegmentmins[3], nodesegmentmaxs[3];
5719 // walk the tree until we hit a leaf, recursing for any split cases
5722 // abort if this part of the bsp tree can not be hit by this trace
5723 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5725 plane = node->plane;
5726 // axial planes are much more common than non-axial, so an optimized
5727 // axial case pays off here
5728 if (plane->type < 3)
5730 // this is an axial plane, compare bounding box directly to it and
5731 // recurse sides accordingly
5732 // recurse down node sides
5733 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
5734 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
5735 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
5736 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
5740 // this is a non-axial plane, so check if the start and end boxes
5741 // are both on one side of the plane to handle 'diagonal' cases
5742 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
5746 // segment crosses plane
5747 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
5750 // if sides == 0 then the trace itself is bogus (Not A Number values),
5751 // in this case we simply pretend the trace hit nothing
5753 return; // ERROR: NAN bounding box!
5754 // take whichever side the segment box is on
5755 node = node->children[sides - 1];
5757 // abort if this part of the bsp tree can not be hit by this trace
5758 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
5760 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
5761 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
5762 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
5763 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
5764 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
5765 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
5767 leaf = (mleaf_t *)node;
5768 for (i = 0;i < leaf->numleafbrushes;i++)
5770 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
5771 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
5773 brush->markframe = markframe;
5774 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
5777 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
5779 for (i = 0;i < leaf->numleafsurfaces;i++)
5781 surface = model->data_surfaces + leaf->firstleafsurface[i];
5782 if (surface->num_collisiontriangles && surface->collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
5784 surface->collisionmarkframe = markframe;
5785 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);
5791 static int markframe = 0;
5793 static void Mod_Q3BSP_TracePoint(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
5797 memset(trace, 0, sizeof(*trace));
5798 trace->fraction = 1;
5799 trace->realfraction = 1;
5800 trace->hitsupercontentsmask = hitsupercontentsmask;
5801 if (model->brush.submodel)
5803 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5804 if (brush->colbrushf)
5805 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
5808 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
5811 static void Mod_Q3BSP_TraceLine(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask)
5814 float segmentmins[3], segmentmaxs[3];
5815 msurface_t *surface;
5818 if (VectorCompare(start, end))
5820 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
5824 memset(trace, 0, sizeof(*trace));
5825 trace->fraction = 1;
5826 trace->realfraction = 1;
5827 trace->hitsupercontentsmask = hitsupercontentsmask;
5828 segmentmins[0] = min(start[0], end[0]) - 1;
5829 segmentmins[1] = min(start[1], end[1]) - 1;
5830 segmentmins[2] = min(start[2], end[2]) - 1;
5831 segmentmaxs[0] = max(start[0], end[0]) + 1;
5832 segmentmaxs[1] = max(start[1], end[1]) + 1;
5833 segmentmaxs[2] = max(start[2], end[2]) + 1;
5834 if (model->brush.submodel)
5836 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5837 if (brush->colbrushf)
5838 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
5839 if (mod_q3bsp_curves_collisions.integer)
5840 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5841 if (surface->num_collisiontriangles)
5842 Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->data_collisionelement3i, surface->data_collisionvertex3f, surface->num_collisionbboxstride, surface->data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
5845 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
5848 static void Mod_Q3BSP_TraceBox(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t boxmins, const vec3_t boxmaxs, const vec3_t end, int hitsupercontentsmask)
5851 float segmentmins[3], segmentmaxs[3];
5852 msurface_t *surface;
5854 colboxbrushf_t thisbrush_start, thisbrush_end;
5855 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
5857 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
5859 vec3_t shiftstart, shiftend;
5860 VectorAdd(start, boxmins, shiftstart);
5861 VectorAdd(end, boxmins, shiftend);
5862 if (VectorCompare(start, end))
5863 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, shiftstart, hitsupercontentsmask);
5866 Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, shiftstart, shiftend, hitsupercontentsmask);
5867 VectorSubtract(trace->endpos, boxmins, trace->endpos);
5872 // box trace, performed as brush trace
5873 memset(trace, 0, sizeof(*trace));
5874 trace->fraction = 1;
5875 trace->realfraction = 1;
5876 trace->hitsupercontentsmask = hitsupercontentsmask;
5877 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
5878 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
5879 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
5880 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
5881 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
5882 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
5883 VectorAdd(start, boxmins, boxstartmins);
5884 VectorAdd(start, boxmaxs, boxstartmaxs);
5885 VectorAdd(end, boxmins, boxendmins);
5886 VectorAdd(end, boxmaxs, boxendmaxs);
5887 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
5888 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
5889 if (model->brush.submodel)
5891 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5892 if (brush->colbrushf)
5893 Collision_TraceBrushBrushFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, brush->colbrushf, brush->colbrushf);
5894 if (mod_q3bsp_curves_collisions.integer)
5895 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
5896 if (surface->num_collisiontriangles)
5897 Collision_TraceBrushTriangleMeshFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, 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);
5900 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, &thisbrush_start.brush, &thisbrush_end.brush, ++markframe, segmentmins, segmentmaxs);
5903 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
5906 int supercontents = 0;
5908 // test if the point is inside each brush
5909 if (model->brush.submodel)
5911 // submodels are effectively one leaf
5912 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
5913 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5914 supercontents |= brush->colbrushf->supercontents;
5918 mnode_t *node = model->brush.data_nodes;
5920 // find which leaf the point is in
5922 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
5923 leaf = (mleaf_t *)node;
5924 // now check the brushes in the leaf
5925 for (i = 0;i < leaf->numleafbrushes;i++)
5927 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
5928 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
5929 supercontents |= brush->colbrushf->supercontents;
5932 return supercontents;
5935 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
5937 int supercontents = 0;
5938 if (nativecontents & CONTENTSQ3_SOLID)
5939 supercontents |= SUPERCONTENTS_SOLID;
5940 if (nativecontents & CONTENTSQ3_WATER)
5941 supercontents |= SUPERCONTENTS_WATER;
5942 if (nativecontents & CONTENTSQ3_SLIME)
5943 supercontents |= SUPERCONTENTS_SLIME;
5944 if (nativecontents & CONTENTSQ3_LAVA)
5945 supercontents |= SUPERCONTENTS_LAVA;
5946 if (nativecontents & CONTENTSQ3_BODY)
5947 supercontents |= SUPERCONTENTS_BODY;
5948 if (nativecontents & CONTENTSQ3_CORPSE)
5949 supercontents |= SUPERCONTENTS_CORPSE;
5950 if (nativecontents & CONTENTSQ3_NODROP)
5951 supercontents |= SUPERCONTENTS_NODROP;
5952 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
5953 supercontents |= SUPERCONTENTS_PLAYERCLIP;
5954 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
5955 supercontents |= SUPERCONTENTS_MONSTERCLIP;
5956 if (nativecontents & CONTENTSQ3_DONOTENTER)
5957 supercontents |= SUPERCONTENTS_DONOTENTER;
5958 if (nativecontents & CONTENTSQ3_BOTCLIP)
5959 supercontents |= SUPERCONTENTS_BOTCLIP;
5960 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
5961 supercontents |= SUPERCONTENTS_OPAQUE;
5962 return supercontents;
5965 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
5967 int nativecontents = 0;
5968 if (supercontents & SUPERCONTENTS_SOLID)
5969 nativecontents |= CONTENTSQ3_SOLID;
5970 if (supercontents & SUPERCONTENTS_WATER)
5971 nativecontents |= CONTENTSQ3_WATER;
5972 if (supercontents & SUPERCONTENTS_SLIME)
5973 nativecontents |= CONTENTSQ3_SLIME;
5974 if (supercontents & SUPERCONTENTS_LAVA)
5975 nativecontents |= CONTENTSQ3_LAVA;
5976 if (supercontents & SUPERCONTENTS_BODY)
5977 nativecontents |= CONTENTSQ3_BODY;
5978 if (supercontents & SUPERCONTENTS_CORPSE)
5979 nativecontents |= CONTENTSQ3_CORPSE;
5980 if (supercontents & SUPERCONTENTS_NODROP)
5981 nativecontents |= CONTENTSQ3_NODROP;
5982 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
5983 nativecontents |= CONTENTSQ3_PLAYERCLIP;
5984 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
5985 nativecontents |= CONTENTSQ3_MONSTERCLIP;
5986 if (supercontents & SUPERCONTENTS_DONOTENTER)
5987 nativecontents |= CONTENTSQ3_DONOTENTER;
5988 if (supercontents & SUPERCONTENTS_BOTCLIP)
5989 nativecontents |= CONTENTSQ3_BOTCLIP;
5990 if (!(supercontents & SUPERCONTENTS_OPAQUE))
5991 nativecontents |= CONTENTSQ3_TRANSLUCENT;
5992 return nativecontents;
5995 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
6000 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
6001 node = node->children[1];
6003 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
6004 if (loadmodel->brush.num_leafs < numleafs)
6005 loadmodel->brush.num_leafs = numleafs;
6008 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6010 int i, j, numshadowmeshtriangles, lumps;
6011 q3dheader_t *header;
6012 float corner[3], yawradius, modelradius;
6013 msurface_t *surface;
6015 mod->modeldatatypestring = "Q3BSP";
6017 mod->type = mod_brushq3;
6018 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
6021 header = (q3dheader_t *)buffer;
6022 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
6023 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
6025 i = LittleLong(header->version);
6026 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
6027 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
6029 mod->soundfromcenter = true;
6030 mod->TraceBox = Mod_Q3BSP_TraceBox;
6031 mod->TraceLine = Mod_Q3BSP_TraceLine;
6032 mod->TracePoint = Mod_Q3BSP_TracePoint;
6033 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
6034 mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
6035 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
6036 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
6037 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
6038 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
6039 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
6040 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
6041 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
6042 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
6043 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
6044 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
6045 mod->brush.AmbientSoundLevelsForPoint = NULL;
6046 mod->brush.RoundUpToHullSize = NULL;
6047 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
6048 mod->Draw = R_Q1BSP_Draw;
6049 mod->DrawDepth = R_Q1BSP_DrawDepth;
6050 mod->DrawDebug = R_Q1BSP_DrawDebug;
6051 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
6052 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
6053 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6054 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6055 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6056 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6057 mod->DrawLight = R_Q1BSP_DrawLight;
6059 mod_base = (unsigned char *)header;
6061 // swap all the lumps
6062 header->ident = LittleLong(header->ident);
6063 header->version = LittleLong(header->version);
6064 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
6065 for (i = 0;i < lumps;i++)
6067 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
6068 if((char *) bufferend < (char *) buffer + j)
6069 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
6070 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
6071 if((char *) bufferend < (char *) buffer + j)
6072 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
6075 * NO, do NOT clear them!
6076 * they contain actual data referenced by other stuff.
6077 * Instead, before using the advertisements lump, check header->versio
6079 * Sorry, but otherwise it breaks memory of the first lump.
6080 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
6082 header->lumps[i].fileofs = 0;
6083 header->lumps[i].filelen = 0;
6087 mod->brush.qw_md4sum = 0;
6088 mod->brush.qw_md4sum2 = 0;
6089 for (i = 0;i < lumps;i++)
6091 if (i == Q3LUMP_ENTITIES)
6093 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6094 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
6096 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
6098 // all this checksumming can take a while, so let's send keepalives here too
6099 CL_KeepaliveMessage(false);
6102 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
6103 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
6104 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
6105 if (header->version == Q3BSPVERSION_IG)
6106 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
6108 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
6109 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
6110 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
6111 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
6112 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
6113 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
6114 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
6115 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
6116 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
6117 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
6118 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
6119 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
6120 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
6121 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
6122 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
6124 // the MakePortals code works fine on the q3bsp data as well
6125 Mod_Q1BSP_MakePortals();
6127 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
6128 loadmodel->brush.supportwateralpha = true;
6130 // make a single combined shadow mesh to allow optimized shadow volume creation
6131 numshadowmeshtriangles = 0;
6132 if (cls.state != ca_dedicated)
6134 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6136 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
6137 numshadowmeshtriangles += surface->num_triangles;
6139 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Begin(loadmodel->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
6140 for (j = 0, surface = loadmodel->data_surfaces;j < loadmodel->num_surfaces;j++, surface++)
6141 if (surface->num_triangles > 0)
6142 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));
6143 loadmodel->brush.shadowmesh = Mod_ShadowMesh_Finish(loadmodel->mempool, loadmodel->brush.shadowmesh, false, true, false);
6144 Mod_BuildTriangleNeighbors(loadmodel->brush.shadowmesh->neighbor3i, loadmodel->brush.shadowmesh->element3i, loadmodel->brush.shadowmesh->numtriangles);
6147 loadmodel->brush.num_leafs = 0;
6148 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
6150 if (loadmodel->brush.numsubmodels)
6151 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
6154 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
6159 // duplicate the basic information
6160 dpsnprintf(name, sizeof(name), "*%i", i);
6161 mod = Mod_FindName(name, loadmodel->name);
6162 // copy the base model to this one
6164 // rename the clone back to its proper name
6165 strlcpy(mod->name, name, sizeof(mod->name));
6166 mod->brush.parentmodel = loadmodel;
6167 // textures and memory belong to the main model
6168 mod->texturepool = NULL;
6169 mod->mempool = NULL;
6170 mod->brush.GetPVS = NULL;
6171 mod->brush.FatPVS = NULL;
6172 mod->brush.BoxTouchingPVS = NULL;
6173 mod->brush.BoxTouchingLeafPVS = NULL;
6174 mod->brush.BoxTouchingVisibleLeafs = NULL;
6175 mod->brush.FindBoxClusters = NULL;
6176 mod->brush.LightPoint = NULL;
6177 mod->brush.AmbientSoundLevelsForPoint = NULL;
6179 mod->brush.submodel = i;
6180 if (loadmodel->brush.submodels)
6181 loadmodel->brush.submodels[i] = mod;
6183 // make the model surface list (used by shadowing/lighting)
6184 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
6185 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
6186 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
6187 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
6188 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
6189 Mod_MakeSortedSurfaces(mod);
6191 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
6192 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
6193 // enlarge the bounding box to enclose all geometry of this model,
6194 // because q3map2 sometimes lies (mostly to affect the lightgrid),
6195 // which can in turn mess up the farclip (as well as culling when
6196 // outside the level - an unimportant concern)
6198 //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]);
6199 for (j = 0;j < mod->nummodelsurfaces;j++)
6201 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
6202 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
6204 if (!surface->num_vertices)
6206 for (k = 0;k < surface->num_vertices;k++, v += 3)
6208 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
6209 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
6210 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
6211 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
6212 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
6213 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
6216 //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]);
6217 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
6218 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
6219 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
6220 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
6221 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
6222 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
6223 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
6224 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
6225 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
6226 mod->yawmins[2] = mod->normalmins[2];
6227 mod->yawmaxs[2] = mod->normalmaxs[2];
6228 mod->radius = modelradius;
6229 mod->radius2 = modelradius * modelradius;
6231 // this gets altered below if sky or water is used
6232 mod->DrawSky = NULL;
6233 mod->DrawAddWaterPlanes = NULL;
6235 for (j = 0;j < mod->nummodelsurfaces;j++)
6236 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
6238 if (j < mod->nummodelsurfaces)
6239 mod->DrawSky = R_Q1BSP_DrawSky;
6241 for (j = 0;j < mod->nummodelsurfaces;j++)
6242 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION))
6244 if (j < mod->nummodelsurfaces)
6245 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
6249 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6251 int i = LittleLong(((int *)buffer)[1]);
6252 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
6253 Mod_Q3BSP_Load(mod,buffer, bufferend);
6254 else if (i == Q2BSPVERSION)
6255 Mod_Q2BSP_Load(mod,buffer, bufferend);
6257 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
6260 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6262 Host_Error("Mod_MAP_Load: not yet implemented");
6266 typedef struct objvertex_s
6274 typedef struct objtriangle_s
6276 objvertex_t vertex[3];
6278 // these fields are used only in conversion to surfaces
6281 int surfacevertexindex[3];
6282 float edgeplane[3][4];
6288 struct objnode_s *children[2];
6289 struct objnode_s *parent;
6290 objtriangle_t *triangles;
6299 objnode_t *Mod_OBJ_BSPNodeForTriangles(objnode_t *parent, objtriangle_t *triangles, int numtriangles, const float *mins, const float *maxs, mem_expandablearray_t *nodesarray, int maxclippedtriangles, objtriangle_t *clippedfronttriangles, objtriangle_t *clippedbacktriangles)
6305 float bestnormal[3];
6310 int numfronttriangles;
6311 int numbacktriangles;
6316 float outfrontpoints[5][3];
6317 float outbackpoints[5][3];
6318 int neededfrontpoints;
6319 int neededbackpoints;
6323 node = (objnode_t *)Mem_ExpandableArray_AllocRecord(array);
6324 node->parent = parent;
6327 VectorCopy(triangles[0].vertex[0].v, mins);
6328 VectorCopy(triangles[0].vertex[0].v, maxs);
6330 else if (parent && parent->children[0] == node)
6332 VectorCopy(parent->mins, mins);
6333 Vectorcopy(parent->maxs, maxs);
6335 else if (parent && parent->children[1] == node)
6337 VectorCopy(parent->mins, mins);
6338 Vectorcopy(parent->maxs, maxs);
6345 for (i = 0;i < numtriangles;i++)
6347 for (j = 0;j < 3;j++)
6349 mins[0] = min(mins[0], triangles[i].vertex[j].v[0]);
6350 mins[1] = min(mins[1], triangles[i].vertex[j].v[1]);
6351 mins[2] = min(mins[2], triangles[i].vertex[j].v[2]);
6352 maxs[0] = max(maxs[0], triangles[i].vertex[j].v[0]);
6353 maxs[1] = max(maxs[1], triangles[i].vertex[j].v[1]);
6354 maxs[2] = max(maxs[2], triangles[i].vertex[j].v[2]);
6357 VectorCopy(mins, node->mins);
6358 VectorCopy(maxs, node->maxs);
6359 if (numtriangles <= mod_obj_leaftriangles.integer)
6362 loadmodel->brush.num_leafs++;
6363 node->triangles = triangles;
6364 node->numtriangles = numtriangles;
6369 loadmodel->brush.num_nodes++;
6370 // pick a splitting plane from the various choices available to us...
6371 // early splits simply halve the interval
6373 VectorClear(bestnormal);
6375 if (numtriangles <= mod_obj_splitterlimit.integer)
6376 limit = numtriangles;
6379 for (i = -3;i < limit;i++)
6383 // first we try 3 axial splits (kdtree-like)
6385 VectorClear(normal);
6387 dist = (mins[j] + maxs[j]) * 0.5f;
6391 // then we try each triangle plane
6392 TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
6393 VectorNormalize(normal);
6394 dist = DotProduct(normal, triangles[i].vertex[0].v);
6395 // use positive axial values whenever possible
6396 if (normal[0] == -1)
6398 if (normal[1] == -1)
6400 if (normal[2] == -1)
6402 // skip planes that match the current best
6403 if (VectorCompare(normal, bestnormal) && dist == bestdist)
6410 for (j = 0;j < numtriangles;j++)
6412 dists[0] = DotProduct(normal, triangles[j].vertex[0].v) - dist;
6413 dists[1] = DotProduct(normal, triangles[j].vertex[1].v) - dist;
6414 dists[2] = DotProduct(normal, triangles[j].vertex[2].v) - dist;
6415 if (dists[0] < -DIST_EPSILON || dists[1] < -DIST_EPSILON || dists[2] < -DIST_EPSILON)
6417 if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
6422 else if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
6427 // score is supposed to:
6428 // prefer axial splits
6429 // prefer evenly dividing the input triangles
6430 // prefer triangles on the plane
6431 // avoid triangles crossing the plane
6432 score = count_on*count_on - count_both*count_both + min(count_front, count_back)*(count_front+count_back);
6433 if (normal[0] == 1 || normal[1] == 1 || normal[2] == 1)
6435 if (i == -3 || bestscore < score)
6437 VectorCopy(normal, bestnormal);
6443 // now we have chosen an optimal split plane...
6445 // divide triangles by the splitting plane
6446 numfronttriangles = 0;
6447 numbacktriangles = 0;
6448 for (i = 0;i < numtriangles;i++)
6450 neededfrontpoints = 0;
6451 neededbackpoints = 0;
6453 PolygonF_Divide(3, triangles[i].vertex[0].v, bestnormal[0], bestnormal[1], bestnormal[2], bestdist, DIST_EPSILON, 5, outfrontpoints[0], &neededfrontpoints, 5, outbackpoints[0], &neededbackpoints, &countonpoints);
6454 if (countonpoints > 1)
6456 // triangle lies on plane, assign it to one child only
6457 TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
6458 if (DotProduct(bestnormal, normal) >= 0)
6460 // assign to front side child
6461 obj_fronttriangles[numfronttriangles++] = triangles[i];
6465 // assign to back side child
6466 obj_backtriangles[numbacktriangles++] = triangles[i];
6471 // convert clipped polygons to triangles
6472 for (j = 0;j < neededfrontpoints-2;j++)
6474 obj_fronttriangles[numfronttriangles] = triangles[i];
6475 VectorCopy(outfrontpoints[0], obj_fronttriangles[numfronttriangles].vertex[0].v);
6476 VectorCopy(outfrontpoints[j+1], obj_fronttriangles[numfronttriangles].vertex[1].v);
6477 VectorCopy(outfrontpoints[j+2], obj_fronttriangles[numfronttriangles].vertex[2].v);
6478 numfronttriangles++;
6480 for (j = 0;j < neededbackpoints-2;j++)
6482 obj_backtriangles[numbacktriangles] = triangles[i];
6483 VectorCopy(outbackpoints[0], obj_backtriangles[numbacktriangles].vertex[0].v);
6484 VectorCopy(outbackpoints[j+1], obj_backtriangles[numbacktriangles].vertex[1].v);
6485 VectorCopy(outbackpoints[j+2], obj_backtriangles[numbacktriangles].vertex[2].v);
6491 // now copy the triangles out of the big buffer
6492 if (numfronttriangles)
6494 fronttriangles = Mem_Alloc(loadmodel->mempool, fronttriangles * sizeof(*fronttriangles));
6495 memcpy(fronttriangles, obj_fronttriangles, numfronttriangles * sizeof(*fronttriangles));
6498 fronttriangles = NULL;
6499 if (numbacktriangles)
6501 backtriangles = Mem_Alloc(loadmodel->mempool, backtriangles * sizeof(*backtriangles));
6502 memcpy(backtriangles, obj_backtriangles, numbacktriangles * sizeof(*backtriangles));
6505 backtriangles = NULL;
6507 // free the original triangles we were given
6509 Mem_Free(triangles);
6513 // now create the children...
6514 node->children[0] = Mod_OBJ_BSPNodeForTriangles(node, fronttriangles, numfronttriangles, frontmins, frontmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
6515 node->children[1] = Mod_OBJ_BSPNodeForTriangles(node, backtriangles, numbacktriangles, backmins, backmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
6519 void Mod_OBJ_SnapVertex(float *v)
6522 float a = mod_obj_vertexprecision.value;
6524 v[0] -= floor(v[0] * a + 0.5f) * b;
6525 v[1] -= floor(v[1] * a + 0.5f) * b;
6526 v[2] -= floor(v[2] * a + 0.5f) * b;
6529 void Mod_OBJ_ConvertBSPNode(objnode_t *objnode, mnode_t *mnodeparent)
6531 if (objnode->children[0])
6533 // convert to mnode_t
6534 mnode_t *mnode = loadmodel->brush.data_nodes + loadmodel->brush.num_nodes++;
6535 mnode->parent = mnodeparent;
6536 mnode->plane = loadmodel->brush.data_planes + loadmodel->brush.num_planes++;
6537 VectorCopy(objnode->normal, mnode->plane->normal);
6538 mnode->plane->dist = objnode->dist;
6539 PlaneClassify(mnode->plane);
6540 VectorCopy(objnode->mins, mnode->mins);
6541 VectorCopy(objnode->maxs, mnode->maxs);
6542 // push combinedsupercontents up to the parent
6544 mnodeparent->combinedsupercontents |= mnode->combinedsupercontents;
6545 mnode->children[0] = Mod_OBJ_ConvertBSPNode(objnode->children[0], mnode);
6546 mnode->children[1] = Mod_OBJ_ConvertBSPNode(objnode->children[1], mnode);
6550 // convert to mleaf_t
6551 mleaf_t *mleaf = loadmodel->brush.data_leafs + loadmodel->brush.num_leafs++;
6552 mleaf->parent = mnodeparent;
6553 VectorCopy(objnode->mins, mleaf->mins);
6554 VectorCopy(objnode->maxs, mleaf->maxs);
6555 mleaf->clusterindex = loadmodel->brush.num_leafs - 1;
6556 if (objnode->numtriangles)
6558 objtriangle_t *triangles = objnode->triangles;
6559 int numtriangles = objnode->numtriangles;
6563 objvertex_t vertex[3];
6565 maxsurfaces = numtriangles;
6567 // calculate some more data on each triangle for surface gathering
6568 for (i = 0;i < numtriangles;i++)
6570 triangle = triangles + i;
6571 texture = loadmodel->data_textures + triangle->textureindex;
6572 Mod_OBJ_SnapVertex(triangle->vertex[0].v);
6573 Mod_OBJ_SnapVertex(triangle->vertex[1].v);
6574 Mod_OBJ_SnapVertex(triangle->vertex[2].v);
6575 TriangleNormal(triangle->vertex[0].v, triangle->vertex[1].v, triangle->vertex[2].v, normal);
6577 if (fabs(normal[axis]) < fabs(normal[1]))
6579 if (fabs(normal[axis]) < fabs(normal[2]))
6581 VectorClear(normal);
6583 triangle->axis = axis;
6584 VectorSubtract(triangle->vertex[1].v, triangle->vertex[0].v, edge[0]);
6585 VectorSubtract(triangle->vertex[2].v, triangle->vertex[1].v, edge[1]);
6586 VectorSubtract(triangle->vertex[0].v, triangle->vertex[2].v, edge[2]);
6587 CrossProduct(edge[0], normal, triangle->edgeplane[0]);
6588 CrossProduct(edge[1], normal, triangle->edgeplane[1]);
6589 CrossProduct(edge[2], normal, triangle->edgeplane[2]);
6590 VectorNormalize(triangle->edgeplane[0]);
6591 VectorNormalize(triangle->edgeplane[1]);
6592 VectorNormalize(triangle->edgeplane[2]);
6593 triangle->edgeplane[0][3] = DotProduct(triangle->edgeplane[0], triangle->vertex[0].v);
6594 triangle->edgeplane[1][3] = DotProduct(triangle->edgeplane[1], triangle->vertex[1].v);
6595 triangle->edgeplane[2][3] = DotProduct(triangle->edgeplane[2], triangle->vertex[2].v);
6596 triangle->surfaceindex = 0;
6597 // add to the combined supercontents while we're here...
6598 mleaf->combinedsupercontents |= texture->supercontents;
6601 for (i = 0;i < numtriangles;i++)
6603 // skip already-assigned triangles
6604 if (triangles[i].surfaceindex)
6606 texture = loadmodel->data_textures + triangles[i].textureindex;
6607 // assign a new surface to this triangle
6608 triangles[i].surfaceindex = surfaceindex++;
6609 axis = triangles[i].axis;
6611 // find the triangle's neighbors, this can take multiple passes
6616 for (j = i+1;j < numtriangles;j++)
6618 if (triangles[j].surfaceindex || triangles[j].axis != axis || triangles[j].texture != texture)
6620 triangle = triangles + j;
6621 for (k = i;k < j;k++)
6623 if (triangles[k].surfaceindex != surfaceindex)
6625 if (VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[0].v)
6626 || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[1].v)
6627 || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[2].v)
6628 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[0].v)
6629 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[1].v)
6630 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[2].v)
6631 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[0].v)
6632 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[1].v)
6633 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[2].v))
6635 // shares a vertex position
6639 for (k = 0;k < numvertices;k++)
6640 if (!VectorCompare(vertex[k].v, triangles[j].vertex[0].v) || !VectorCompare(vertex[k].v, triangles[j].vertex[1].v) || !VectorCompare(vertex[k].v, triangles[j].vertex[2].v))
6642 if (k == numvertices)
6643 break; // not a neighbor
6644 // this triangle is a neighbor and has the same axis and texture
6645 // check now if it overlaps in lightmap projection space
6646 triangles[j].surfaceindex;
6650 //triangles[i].surfaceindex = surfaceindex++;
6651 for (surfaceindex = 0;surfaceindex < numsurfaces;surfaceindex++)
6653 if (surfaces[surfaceindex].texture != texture)
6655 // check if any triangles already in this surface overlap in lightmap projection space
6662 // let the collision code simply use the surfaces
6663 mleaf->containscollisionsurfaces = mleaf->combinedsupercontents != 0;
6664 mleaf->numleafsurfaces = ?;
6665 mleaf->firstleafsurface = ?;
6667 // push combinedsupercontents up to the parent
6669 mnodeparent->combinedsupercontents |= mleaf->combinedsupercontents;
6674 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
6677 const char *textbase = (char *)buffer, *text = textbase;
6681 char materialname[MAX_QPATH];
6682 int j, index1, index2, index3, first, prev, index;
6685 int numtriangles = 0;
6686 int maxtriangles = 131072;
6687 objtriangle_t *triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
6689 int maxtextures = 256, numtextures = 0, textureindex = 0;
6690 int maxv = 1024, numv = 0;
6691 int maxvt = 1024, numvt = 0;
6692 int maxvn = 1024, numvn = 0;
6693 char **texturenames;
6694 float *v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
6695 float *vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
6696 float *vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
6697 objvertex_t vfirst, vprev, vcurrent;
6702 int maxverthash = 65536, numverthash = 0;
6703 int numhashindex = 65536;
6704 struct objverthash_s
6706 struct objverthash_s *next;
6712 *hash, **verthash = Mem_Alloc(tempmempool, numhashindex * sizeof(*verthash)), *verthashdata = Mem_Alloc(tempmempool, maxverthash * sizeof(*verthashdata)), *oldverthashdata;
6715 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
6717 loadmodel->modeldatatypestring = "OBJ";
6719 loadmodel->type = mod_obj;
6720 loadmodel->soundfromcenter = true;
6721 loadmodel->TraceBox = Mod_OBJ_TraceBox;
6722 loadmodel->TraceLine = Mod_OBJ_TraceLine;
6723 loadmodel->TracePoint = Mod_OBJ_TracePoint;
6724 loadmodel->PointSuperContents = Mod_OBJ_PointSuperContents;
6725 loadmodel->brush.TraceLineOfSight = Mod_OBJ_TraceLineOfSight;
6726 loadmodel->brush.SuperContentsFromNativeContents = Mod_OBJ_SuperContentsFromNativeContents;
6727 loadmodel->brush.NativeContentsFromSuperContents = Mod_OBJ_NativeContentsFromSuperContents;
6728 loadmodel->brush.GetPVS = Mod_OBJ_GetPVS;
6729 loadmodel->brush.FatPVS = Mod_OBJ_FatPVS;
6730 loadmodel->brush.BoxTouchingPVS = Mod_OBJ_BoxTouchingPVS;
6731 loadmodel->brush.BoxTouchingLeafPVS = Mod_OBJ_BoxTouchingLeafPVS;
6732 loadmodel->brush.BoxTouchingVisibleLeafs = Mod_OBJ_BoxTouchingVisibleLeafs;
6733 loadmodel->brush.FindBoxClusters = Mod_OBJ_FindBoxClusters;
6734 loadmodel->brush.LightPoint = Mod_OBJ_LightPoint;
6735 loadmodel->brush.FindNonSolidLocation = Mod_OBJ_FindNonSolidLocation;
6736 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
6737 loadmodel->brush.RoundUpToHullSize = NULL;
6738 loadmodel->brush.PointInLeaf = Mod_OBJ_PointInLeaf;
6739 loadmodel->Draw = R_Q1BSP_Draw;
6740 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
6741 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
6742 loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
6743 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
6744 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6745 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6746 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6747 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6748 loadmodel->DrawLight = R_Q1BSP_DrawLight;
6753 // parse the OBJ text now
6760 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
6761 line[linelen] = text[linelen];
6763 for (argc = 0;argc < (int)(sizeof(argv)/sizeof(argv[0]));argc++)
6767 while (*s == ' ' || *s == '\t')
6777 while (*s == ' ' || *s == '\t')
6782 if (argv[0][0] == '#')
6784 if (!strcmp(argv[0], "v"))
6790 v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
6793 memcpy(v, oldv, numv * sizeof(float[3]));
6797 v[numv*3+0] = atof(argv[1]);
6798 v[numv*3+1] = atof(argv[2]);
6799 v[numv*3+2] = atof(argv[3]);
6802 else if (!strcmp(argv[0], "vt"))
6808 vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
6811 memcpy(vt, oldvt, numvt * sizeof(float[2]));
6815 vt[numvt*2+0] = atof(argv[1]);
6816 vt[numvt*2+1] = atof(argv[2]);
6819 else if (!strcmp(argv[0], "vn"))
6825 vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
6828 memcpy(vn, oldvn, numvn * sizeof(float[3]));
6832 vn[numvn*3+0] = atof(argv[1]);
6833 vn[numvn*3+1] = atof(argv[2]);
6834 vn[numvn*3+2] = atof(argv[3]);
6837 else if (!strcmp(argv[0], "f"))
6839 for (j = 1;j < argc;j++)
6841 index1 = atoi(argv[j]);
6842 while(argv[j][0] && argv[j][0] != '/')
6846 index2 = atoi(argv[j]);
6847 while(argv[j][0] && argv[j][0] != '/')
6851 index3 = atoi(argv[j]);
6852 // negative refers to a recent vertex
6853 // zero means not specified
6854 // positive means an absolute vertex index
6856 index1 = numv - index1;
6858 index2 = numvt - index2;
6860 index3 = numvn - index3;
6861 VectorCopy(v + 3*index1, vcurrent.v);
6862 Vector2Copy(vt + 2*index2, vcurrent.vt);
6863 VectorCopy(vn + 3*index3, vcurrent.vn);
6864 if (numtriangles == 0)
6866 VectorCopy(vcurrent.v, mins);
6867 VectorCopy(vcurrent.v, maxs);
6871 mins[0] = min(mins[0], vcurrent.v[0]);
6872 mins[1] = min(mins[1], vcurrent.v[1]);
6873 mins[2] = min(mins[2], vcurrent.v[2]);
6874 maxs[0] = max(maxs[0], vcurrent.v[0]);
6875 maxs[1] = max(maxs[1], vcurrent.v[1]);
6876 maxs[2] = max(maxs[2], vcurrent.v[2]);
6882 if (maxtriangles <= numtriangles)
6884 objtriangle_t *oldtriangles = triangles;
6886 triangles = Mem_Alloc(tempmempool, numtriangles * sizeof(*triangles));
6889 memcpy(triangles, oldtriangles, numtriangles * sizeof(*triangles));
6890 Mem_Free(oldtriangles);
6893 triangles[numtriangles].textureindex = textureindex;
6894 triangles[numtriangles].vertex[0] = vfirst;
6895 triangles[numtriangles].vertex[1] = vprev;
6896 triangles[numtriangles].vertex[2] = vcurrent;
6903 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
6905 else if (!!strcmp(argv[0], "usemtl"))
6907 for (i = 0;i < numtextures;i++)
6908 if (!strcmp(texturenames[numtextures], argv[1]))
6910 if (i < numtextures)
6911 texture = textures + i;
6914 if (maxtextures <= numtextures)
6916 texture_t *oldtextures = textures;
6918 textures = Mem_Alloc(tempmempool, maxtextures * sizeof(*textures));
6921 memcpy(textures, oldtextures, numtexutres * sizeof(*textures));
6922 Mem_Free(oldtextures);
6925 textureindex = numtextures++;
6926 texturenames[textureindex] = Mem_Alloc(tempmempool, strlen(argv[1]) + 1);
6927 memcpy(texturenames[textureindex], argv[1], strlen(argv[1]) + 1);
6937 // now that we have the OBJ data loaded as-is, we can convert it
6939 // load the textures
6940 loadmodel->num_textures = numtextures;
6941 loadmodel->data_textures = Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
6942 for (i = 0;i < numtextures;i++)
6943 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, texturenames[i], true, true, TEXF_MIPMAP | TEXF_ALPHA | TEXF_PRECACHE | (r_picmipworld.integer ? TEXF_PICMIP : 0) | TEXF_COMPRESS);
6945 // free the texturenames array since we are now done with it
6946 for (i = 0;i < numtextures;i++)
6948 Mem_Free(texturenames[i]);
6949 texturenames[i] = NULL;
6951 Mem_Free(texturenames);
6952 texturenames = NULL;
6954 // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
6955 VectorCopy(mins, loadmodel->normalmins);
6956 VectorCopy(maxs, loadmodel->normalmaxs);
6957 dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
6958 modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
6959 modelyawradius = dist*dist+modelyawradius*modelyawradius;
6960 modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
6961 modelradius = modelyawradius + modelradius * modelradius;
6962 modelyawradius = sqrt(modelyawradius);
6963 modelradius = sqrt(modelradius);
6964 loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
6965 loadmodel->yawmins[2] = loadmodel->normalmins[2];
6966 loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] = modelyawradius;
6967 loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
6968 loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
6969 loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] = modelradius;
6970 loadmodel->radius = modelradius;
6971 loadmodel->radius2 = modelradius * modelradius;
6973 // make sure the temp triangle buffer is big enough for BSP building
6974 maxclippedtriangles = numtriangles*4;
6975 if (numtriangles > 0)
6977 clippedfronttriangles = Mem_Alloc(loadmodel->mempool, maxclippedtriangles * 2 * sizeof(objtriangle_t));
6978 clippedbacktriangles = clippedfronttriangles + maxclippedtriangles;
6981 // generate a rough BSP tree from triangle data, we don't have to be too careful here, it only has to define the basic areas of the map
6982 loadmodel->brush.num_leafs = 0;
6983 loadmodel->brush.num_nodes = 0;
6984 Mem_ExpandableArray_NewArray(&nodesarray, loadmodel->mempool, sizeof(objnode_t), 1024);
6985 rootnode = Mod_OBJ_BSPNodeForTriangles(triangles, numtriangles, mins, maxs, &nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
6987 // convert the BSP tree to mnode_t and mleaf_t structures and convert the triangles to msurface_t...
6988 loadmodel->brush.data_leafs = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
6989 loadmodel->brush.data_nodes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mnode_t));
6990 loadmodel->brush.data_planes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mplane_t));
6991 loadmodel->brush.num_leafs = 0;
6992 loadmodel->brush.num_nodes = 0;
6993 loadmodel->brush.num_planes = 0;
6994 Mod_OBJ_ConvertAndFreeBSPNode(rootnode);
6996 if (clippedfronttriangles)
6997 Mem_Free(clippedfronttriangles);
6998 maxclippedtriangles = 0;
6999 clippedfronttriangles = NULL;
7000 clippedbacktriangles = NULL;
7002 --- NOTHING DONE PAST THIS POINT ---
7004 loadmodel->numskins = LittleLong(pinmodel->num_skins);
7005 numxyz = LittleLong(pinmodel->num_xyz);
7006 numst = LittleLong(pinmodel->num_st);
7007 loadmodel->surfmesh.num_triangles = LittleLong(pinmodel->num_tris);
7008 loadmodel->numframes = LittleLong(pinmodel->num_frames);
7009 loadmodel->surfmesh.num_morphframes = loadmodel->numframes;
7010 loadmodel->num_poses = loadmodel->surfmesh.num_morphframes;
7011 skinwidth = LittleLong(pinmodel->skinwidth);
7012 skinheight = LittleLong(pinmodel->skinheight);
7013 iskinwidth = 1.0f / skinwidth;
7014 iskinheight = 1.0f / skinheight;
7016 loadmodel->num_surfaces = 1;
7017 loadmodel->nummodelsurfaces = loadmodel->num_surfaces;
7018 data = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * sizeof(msurface_t) + loadmodel->num_surfaces * sizeof(int) + loadmodel->numframes * sizeof(animscene_t) + loadmodel->numframes * sizeof(float[6]) + loadmodel->surfmesh.num_triangles * sizeof(int[3]) + loadmodel->surfmesh.num_triangles * sizeof(int[3]));
7019 loadmodel->data_surfaces = (msurface_t *)data;data += loadmodel->num_surfaces * sizeof(msurface_t);
7020 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
7021 loadmodel->sortedmodelsurfaces[0] = 0;
7022 loadmodel->animscenes = (animscene_t *)data;data += loadmodel->numframes * sizeof(animscene_t);
7023 loadmodel->surfmesh.data_morphmd2framesize6f = (float *)data;data += loadmodel->numframes * sizeof(float[6]);
7024 loadmodel->surfmesh.data_element3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
7025 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
7027 loadmodel->synctype = ST_RAND;
7030 inskin = (char *)(base + LittleLong(pinmodel->ofs_skins));
7031 skinfiles = Mod_LoadSkinFiles();
7034 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
7035 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
7036 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
7037 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures, skinfiles, "default", "");
7038 Mod_FreeSkinFiles(skinfiles);
7040 else if (loadmodel->numskins)
7042 // skins found (most likely not a player model)
7043 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
7044 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
7045 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
7046 for (i = 0;i < loadmodel->numskins;i++, inskin += MD2_SKINNAME)
7047 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i * loadmodel->num_surfaces, inskin, true, true, (r_mipskins.integer ? TEXF_MIPMAP : 0) | TEXF_ALPHA | TEXF_PRECACHE | TEXF_PICMIP | TEXF_COMPRESS);
7051 // no skins (most likely a player model)
7052 loadmodel->numskins = 1;
7053 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
7054 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
7055 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
7056 Mod_BuildAliasSkinFromSkinFrame(loadmodel->data_textures, NULL);
7059 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
7060 for (i = 0;i < loadmodel->numskins;i++)
7062 loadmodel->skinscenes[i].firstframe = i;
7063 loadmodel->skinscenes[i].framecount = 1;
7064 loadmodel->skinscenes[i].loop = true;
7065 loadmodel->skinscenes[i].framerate = 10;
7068 // load the triangles and stvert data
7069 inst = (unsigned short *)(base + LittleLong(pinmodel->ofs_st));
7070 intri = (md2triangle_t *)(base + LittleLong(pinmodel->ofs_tris));
7071 md2verthash = (struct md2verthash_s **)Mem_Alloc(tempmempool, 65536 * sizeof(hash));
7072 md2verthashdata = (struct md2verthash_s *)Mem_Alloc(tempmempool, loadmodel->surfmesh.num_triangles * 3 * sizeof(*hash));
7073 // swap the triangle list
7074 loadmodel->surfmesh.num_vertices = 0;
7075 for (i = 0;i < loadmodel->surfmesh.num_triangles;i++)
7077 for (j = 0;j < 3;j++)
7079 xyz = (unsigned short) LittleShort (intri[i].index_xyz[j]);
7080 st = (unsigned short) LittleShort (intri[i].index_st[j]);
7083 Con_Printf("%s has an invalid xyz index (%i) on triangle %i, resetting to 0\n", loadmodel->name, xyz, i);
7088 Con_Printf("%s has an invalid st index (%i) on triangle %i, resetting to 0\n", loadmodel->name, st, i);
7091 hashindex = (xyz * 256 + st) & 65535;
7092 for (hash = md2verthash[hashindex];hash;hash = hash->next)
7093 if (hash->xyz == xyz && hash->st == st)
7097 hash = md2verthashdata + loadmodel->surfmesh.num_vertices++;
7100 hash->next = md2verthash[hashindex];
7101 md2verthash[hashindex] = hash;
7103 loadmodel->surfmesh.data_element3i[i*3+j] = (hash - md2verthashdata);
7107 vertremap = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(int));
7108 data = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(float[2]) + loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t));
7109 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += loadmodel->surfmesh.num_vertices * sizeof(float[2]);
7110 loadmodel->surfmesh.data_morphmdlvertex = (trivertx_t *)data;data += loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t);
7111 for (i = 0;i < loadmodel->surfmesh.num_vertices;i++)
7114 hash = md2verthashdata + i;
7115 vertremap[i] = hash->xyz;
7116 sts = LittleShort(inst[hash->st*2+0]);
7117 stt = LittleShort(inst[hash->st*2+1]);
7118 if (sts < 0 || sts >= skinwidth || stt < 0 || stt >= skinheight)
7120 Con_Printf("%s has an invalid skin coordinate (%i %i) on vert %i, changing to 0 0\n", loadmodel->name, sts, stt, i);
7124 loadmodel->surfmesh.data_texcoordtexture2f[i*2+0] = sts * iskinwidth;
7125 loadmodel->surfmesh.data_texcoordtexture2f[i*2+1] = stt * iskinheight;
7128 Mem_Free(md2verthash);
7129 Mem_Free(md2verthashdata);
7131 // generate ushort elements array if possible
7132 if (loadmodel->surfmesh.num_vertices <= 65536)
7133 loadmodel->surfmesh.data_element3s = (unsigned short *)Mem_Alloc(loadmodel->mempool, sizeof(unsigned short[3]) * loadmodel->surfmesh.num_triangles);
7136 datapointer = (base + LittleLong(pinmodel->ofs_frames));
7137 for (i = 0;i < loadmodel->surfmesh.num_morphframes;i++)
7142 pinframe = (md2frame_t *)datapointer;
7143 datapointer += sizeof(md2frame_t);
7144 // store the frame scale/translate into the appropriate array
7145 for (j = 0;j < 3;j++)
7147 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+j] = LittleFloat(pinframe->scale[j]);
7148 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+3+j] = LittleFloat(pinframe->translate[j]);
7150 // convert the vertices
7151 v = (trivertx_t *)datapointer;
7152 out = loadmodel->surfmesh.data_morphmdlvertex + i * loadmodel->surfmesh.num_vertices;
7153 for (k = 0;k < loadmodel->surfmesh.num_vertices;k++)
7154 out[k] = v[vertremap[k]];
7155 datapointer += numxyz * sizeof(trivertx_t);
7157 strlcpy(loadmodel->animscenes[i].name, pinframe->name, sizeof(loadmodel->animscenes[i].name));
7158 loadmodel->animscenes[i].firstframe = i;
7159 loadmodel->animscenes[i].framecount = 1;
7160 loadmodel->animscenes[i].framerate = 10;
7161 loadmodel->animscenes[i].loop = true;
7164 Mem_Free(vertremap);
7166 Mod_MakeSortedSurfaces(loadmodel);
7167 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
7168 Mod_Alias_CalculateBoundingBox();
7169 Mod_Alias_MorphMesh_CompileFrames();
7171 surface = loadmodel->data_surfaces;
7172 surface->texture = loadmodel->data_textures;
7173 surface->num_firsttriangle = 0;
7174 surface->num_triangles = loadmodel->surfmesh.num_triangles;
7175 surface->num_firstvertex = 0;
7176 surface->num_vertices = loadmodel->surfmesh.num_vertices;
7178 loadmodel->surfmesh.isanimated = false;
7180 if (loadmodel->surfmesh.data_element3s)
7181 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
7182 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
7186 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
7188 // we already have done PVS culling at this point...
7189 // so we don't need to do it again.
7192 vec3_t testorigin, mins, maxs;
7194 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
7195 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
7196 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
7198 if(model->brush.TraceLineOfSight(model, eye, testorigin))
7201 // expand the box a little
7202 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
7203 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
7204 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
7205 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
7206 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
7207 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
7209 for(i = 0; i != numsamples; ++i)
7211 testorigin[0] = lhrandom(mins[0], maxs[0]);
7212 testorigin[1] = lhrandom(mins[1], maxs[1]);
7213 testorigin[2] = lhrandom(mins[2], maxs[2]);
7215 if(model->brush.TraceLineOfSight(model, eye, testorigin))