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 mod_bsp_portalize = {0, "mod_bsp_portalize", "1", "enables portal generation from BSP tree (may take several seconds per map), used by r_drawportals, r_useportalculling, r_shadow_realtime_world_compileportalculling, sv_cullentities_portal"};
31 cvar_t r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
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_noshader_default_offsetmapping = {CVAR_SAVE, "mod_noshader_default_offsetmapping", "1", "use offsetmapping by default on all surfaces that are not using q3 shader files"};
42 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
43 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)"};
44 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)"};
45 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
46 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
47 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, ..."};
48 cvar_t mod_q3bsp_nolightmaps = {CVAR_SAVE, "mod_q3bsp_nolightmaps", "0", "do not load lightmaps in Q3BSP maps (to save video RAM, but be warned: it looks ugly)"};
49 cvar_t mod_q3bsp_tracelineofsight_brushes = {0, "mod_q3bsp_tracelineofsight_brushes", "0", "enables culling of entities behind detail brushes, curves, etc"};
50 cvar_t mod_q3shader_default_offsetmapping = {CVAR_SAVE, "mod_q3shader_default_offsetmapping", "1", "use offsetmapping by default on all surfaces that are using q3 shader files"};
51 cvar_t mod_q3shader_default_polygonfactor = {0, "mod_q3shader_default_polygonfactor", "0", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
52 cvar_t mod_q3shader_default_polygonoffset = {0, "mod_q3shader_default_polygonoffset", "-2", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
54 cvar_t mod_q1bsp_polygoncollisions = {0, "mod_q1bsp_polygoncollisions", "0", "disables use of precomputed cliphulls and instead collides with polygons (uses Bounding Interval Hierarchy optimizations)"};
55 cvar_t mod_collision_bih = {0, "mod_collision_bih", "1", "enables use of generated Bounding Interval Hierarchy tree instead of compiled bsp tree in collision code"};
56 cvar_t mod_recalculatenodeboxes = {0, "mod_recalculatenodeboxes", "1", "enables use of generated node bounding boxes based on BSP tree portal reconstruction, rather than the node boxes supplied by the map compiler"};
58 static texture_t mod_q1bsp_texture_solid;
59 static texture_t mod_q1bsp_texture_sky;
60 static texture_t mod_q1bsp_texture_lava;
61 static texture_t mod_q1bsp_texture_slime;
62 static texture_t mod_q1bsp_texture_water;
64 void Mod_BrushInit(void)
66 // Cvar_RegisterVariable(&r_subdivide_size);
67 Cvar_RegisterVariable(&mod_bsp_portalize);
68 Cvar_RegisterVariable(&r_novis);
69 Cvar_RegisterVariable(&r_nosurftextures);
70 Cvar_RegisterVariable(&r_subdivisions_tolerance);
71 Cvar_RegisterVariable(&r_subdivisions_mintess);
72 Cvar_RegisterVariable(&r_subdivisions_maxtess);
73 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
74 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
75 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
76 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
77 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
78 Cvar_RegisterVariable(&mod_noshader_default_offsetmapping);
79 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
80 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
81 Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
82 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
83 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
84 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
85 Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
86 Cvar_RegisterVariable(&mod_q3bsp_tracelineofsight_brushes);
87 Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping);
88 Cvar_RegisterVariable(&mod_q3shader_default_polygonfactor);
89 Cvar_RegisterVariable(&mod_q3shader_default_polygonoffset);
90 Cvar_RegisterVariable(&mod_q1bsp_polygoncollisions);
91 Cvar_RegisterVariable(&mod_collision_bih);
92 Cvar_RegisterVariable(&mod_recalculatenodeboxes);
94 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
95 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
96 mod_q1bsp_texture_solid.surfaceflags = 0;
97 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
99 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
100 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
101 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
102 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
104 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
105 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
106 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
107 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
109 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
110 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
111 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
112 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
114 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
115 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
116 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
117 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
120 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
127 // LordHavoc: modified to start at first clip node,
128 // in other words: first node of the (sub)model
129 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
131 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
133 return (mleaf_t *)node;
136 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
140 leaf = Mod_Q1BSP_PointInLeaf(model, p);
143 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
146 memcpy(out, leaf->ambient_sound_level, i);
152 memset(out, 0, outsize);
155 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
158 int nodestackindex = 0;
159 mnode_t *node, *nodestack[1024];
160 if (!model->brush.num_pvsclusters)
162 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
168 // node - recurse down the BSP tree
169 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
173 return -1; // ERROR: NAN bounding box!
174 // box is on one side of plane, take that path
175 node = node->children[sides-1];
179 // box crosses plane, take one path and remember the other
180 if (nodestackindex < 1024)
181 nodestack[nodestackindex++] = node->children[0];
182 node = node->children[1];
188 // leaf - add clusterindex to list
189 if (numclusters < maxclusters)
190 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
194 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
198 if (nodestackindex < 1024)
199 nodestack[nodestackindex++] = node->children[0];
200 node = node->children[1];
205 // leaf - add clusterindex to list
206 if (numclusters < maxclusters)
207 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
212 // try another path we didn't take earlier
213 if (nodestackindex == 0)
215 node = nodestack[--nodestackindex];
217 // return number of clusters found (even if more than the maxclusters)
221 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
223 int nodestackindex = 0;
224 mnode_t *node, *nodestack[1024];
225 if (!model->brush.num_pvsclusters)
227 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
233 // node - recurse down the BSP tree
234 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
238 return -1; // ERROR: NAN bounding box!
239 // box is on one side of plane, take that path
240 node = node->children[sides-1];
244 // box crosses plane, take one path and remember the other
245 if (nodestackindex < 1024)
246 nodestack[nodestackindex++] = node->children[0];
247 node = node->children[1];
253 // leaf - check cluster bit
254 int clusterindex = ((mleaf_t *)node)->clusterindex;
255 if (CHECKPVSBIT(pvs, clusterindex))
257 // it is visible, return immediately with the news
262 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
266 if (nodestackindex < 1024)
267 nodestack[nodestackindex++] = node->children[0];
268 node = node->children[1];
273 // leaf - check cluster bit
274 int clusterindex = ((mleaf_t *)node)->clusterindex;
275 if (CHECKPVSBIT(pvs, clusterindex))
277 // it is visible, return immediately with the news
283 // nothing to see here, try another path we didn't take earlier
284 if (nodestackindex == 0)
286 node = nodestack[--nodestackindex];
292 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
294 int nodestackindex = 0;
295 mnode_t *node, *nodestack[1024];
296 if (!model->brush.num_leafs)
298 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
304 // node - recurse down the BSP tree
305 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
309 return -1; // ERROR: NAN bounding box!
310 // box is on one side of plane, take that path
311 node = node->children[sides-1];
315 // box crosses plane, take one path and remember the other
316 if (nodestackindex < 1024)
317 nodestack[nodestackindex++] = node->children[0];
318 node = node->children[1];
324 // leaf - check cluster bit
325 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
326 if (CHECKPVSBIT(pvs, clusterindex))
328 // it is visible, return immediately with the news
333 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
337 if (nodestackindex < 1024)
338 nodestack[nodestackindex++] = node->children[0];
339 node = node->children[1];
344 // leaf - check cluster bit
345 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
346 if (CHECKPVSBIT(pvs, clusterindex))
348 // it is visible, return immediately with the news
354 // nothing to see here, try another path we didn't take earlier
355 if (nodestackindex == 0)
357 node = nodestack[--nodestackindex];
363 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
365 int nodestackindex = 0;
366 mnode_t *node, *nodestack[1024];
367 if (!model->brush.num_leafs)
369 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
375 // node - recurse down the BSP tree
376 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
380 return -1; // ERROR: NAN bounding box!
381 // box is on one side of plane, take that path
382 node = node->children[sides-1];
386 // box crosses plane, take one path and remember the other
387 if (nodestackindex < 1024)
388 nodestack[nodestackindex++] = node->children[0];
389 node = node->children[1];
395 // leaf - check if it is visible
396 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
398 // it is visible, return immediately with the news
403 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
407 if (nodestackindex < 1024)
408 nodestack[nodestackindex++] = node->children[0];
409 node = node->children[1];
414 // leaf - check if it is visible
415 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
417 // it is visible, return immediately with the news
423 // nothing to see here, try another path we didn't take earlier
424 if (nodestackindex == 0)
426 node = nodestack[--nodestackindex];
432 typedef struct findnonsolidlocationinfo_s
435 vec3_t absmin, absmax;
441 findnonsolidlocationinfo_t;
443 static void Mod_Q1BSP_FindNonSolidLocation_r_Triangle(findnonsolidlocationinfo_t *info, msurface_t *surface, int k)
446 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
448 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
449 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
450 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
451 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
452 VectorSubtract(vert[1], vert[0], edge[0]);
453 VectorSubtract(vert[2], vert[1], edge[1]);
454 CrossProduct(edge[1], edge[0], facenormal);
455 if (facenormal[0] || facenormal[1] || facenormal[2])
457 VectorNormalize(facenormal);
458 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
459 if (f <= info->bestdist && f >= -info->bestdist)
461 VectorSubtract(vert[0], vert[2], edge[2]);
462 VectorNormalize(edge[0]);
463 VectorNormalize(edge[1]);
464 VectorNormalize(edge[2]);
465 CrossProduct(facenormal, edge[0], edgenormal[0]);
466 CrossProduct(facenormal, edge[1], edgenormal[1]);
467 CrossProduct(facenormal, edge[2], edgenormal[2]);
469 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
470 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
471 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
473 // we got lucky, the center is within the face
474 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
478 if (info->bestdist > dist)
480 info->bestdist = dist;
481 VectorScale(facenormal, (info->radius - -dist), info->nudge);
486 if (info->bestdist > dist)
488 info->bestdist = dist;
489 VectorScale(facenormal, (info->radius - dist), info->nudge);
495 // check which edge or vertex the center is nearest
496 for (i = 0;i < 3;i++)
498 f = DotProduct(info->center, edge[i]);
499 if (f >= DotProduct(vert[0], edge[i])
500 && f <= DotProduct(vert[1], edge[i]))
503 VectorMA(info->center, -f, edge[i], point);
504 dist = sqrt(DotProduct(point, point));
505 if (info->bestdist > dist)
507 info->bestdist = dist;
508 VectorScale(point, (info->radius / dist), info->nudge);
510 // skip both vertex checks
511 // (both are further away than this edge)
516 // not on edge, check first vertex of edge
517 VectorSubtract(info->center, vert[i], point);
518 dist = sqrt(DotProduct(point, point));
519 if (info->bestdist > dist)
521 info->bestdist = dist;
522 VectorScale(point, (info->radius / dist), info->nudge);
531 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
533 int surfacenum, k, *mark;
535 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
537 surface = info->model->data_surfaces + *mark;
538 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
540 if(surface->deprecatedq3num_bboxstride > 0)
543 cnt = (surface->num_triangles + surface->deprecatedq3num_bboxstride - 1) / surface->deprecatedq3num_bboxstride;
544 for(i = 0; i < cnt; ++i)
546 if(BoxesOverlap(surface->deprecatedq3data_bbox6f + i * 6, surface->deprecatedq3data_bbox6f + i * 6 + 3, info->absmin, info->absmax))
548 for(k = 0; k < surface->deprecatedq3num_bboxstride; ++k)
550 tri = i * surface->deprecatedq3num_bboxstride + k;
551 if(tri >= surface->num_triangles)
553 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, tri);
560 for (k = 0;k < surface->num_triangles;k++)
562 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, k);
569 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
573 float f = PlaneDiff(info->center, node->plane);
574 if (f >= -info->bestdist)
575 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
576 if (f <= info->bestdist)
577 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
581 if (((mleaf_t *)node)->numleafsurfaces)
582 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
586 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
589 findnonsolidlocationinfo_t info;
595 VectorCopy(in, info.center);
596 info.radius = radius;
601 VectorClear(info.nudge);
602 info.bestdist = radius;
603 VectorCopy(info.center, info.absmin);
604 VectorCopy(info.center, info.absmax);
605 info.absmin[0] -= info.radius + 1;
606 info.absmin[1] -= info.radius + 1;
607 info.absmin[2] -= info.radius + 1;
608 info.absmax[0] += info.radius + 1;
609 info.absmax[1] += info.radius + 1;
610 info.absmax[2] += info.radius + 1;
611 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
612 VectorAdd(info.center, info.nudge, info.center);
614 while (info.bestdist < radius && ++i < 10);
615 VectorCopy(info.center, out);
618 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
620 switch(nativecontents)
625 return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
627 return SUPERCONTENTS_WATER;
629 return SUPERCONTENTS_SLIME;
631 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
633 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
638 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
640 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
641 return CONTENTS_SOLID;
642 if (supercontents & SUPERCONTENTS_SKY)
644 if (supercontents & SUPERCONTENTS_LAVA)
645 return CONTENTS_LAVA;
646 if (supercontents & SUPERCONTENTS_SLIME)
647 return CONTENTS_SLIME;
648 if (supercontents & SUPERCONTENTS_WATER)
649 return CONTENTS_WATER;
650 return CONTENTS_EMPTY;
653 typedef struct RecursiveHullCheckTraceInfo_s
655 // the hull we're tracing through
658 // the trace structure to fill in
661 // start, end, and end - start (in model space)
666 RecursiveHullCheckTraceInfo_t;
668 // 1/32 epsilon to keep floating point happy
669 #define DIST_EPSILON (0.03125)
671 #define HULLCHECKSTATE_EMPTY 0
672 #define HULLCHECKSTATE_SOLID 1
673 #define HULLCHECKSTATE_DONE 2
675 extern cvar_t collision_prefernudgedfraction;
676 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
678 // status variables, these don't need to be saved on the stack when
679 // recursing... but are because this should be thread-safe
680 // (note: tracing against a bbox is not thread-safe, yet)
685 // variables that need to be stored on the stack when recursing
690 // LordHavoc: a goto! everyone flee in terror... :)
695 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
696 if (!t->trace->startfound)
698 t->trace->startfound = true;
699 t->trace->startsupercontents |= num;
701 if (num & SUPERCONTENTS_LIQUIDSMASK)
702 t->trace->inwater = true;
704 t->trace->inopen = true;
705 if (num & SUPERCONTENTS_SOLID)
706 t->trace->hittexture = &mod_q1bsp_texture_solid;
707 else if (num & SUPERCONTENTS_SKY)
708 t->trace->hittexture = &mod_q1bsp_texture_sky;
709 else if (num & SUPERCONTENTS_LAVA)
710 t->trace->hittexture = &mod_q1bsp_texture_lava;
711 else if (num & SUPERCONTENTS_SLIME)
712 t->trace->hittexture = &mod_q1bsp_texture_slime;
714 t->trace->hittexture = &mod_q1bsp_texture_water;
715 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
716 t->trace->hitsupercontents = num;
717 if (num & t->trace->hitsupercontentsmask)
719 // if the first leaf is solid, set startsolid
720 if (t->trace->allsolid)
721 t->trace->startsolid = true;
722 #if COLLISIONPARANOID >= 3
725 return HULLCHECKSTATE_SOLID;
729 t->trace->allsolid = false;
730 #if COLLISIONPARANOID >= 3
733 return HULLCHECKSTATE_EMPTY;
737 // find the point distances
738 node = t->hull->clipnodes + num;
740 plane = t->hull->planes + node->planenum;
743 t1 = p1[plane->type] - plane->dist;
744 t2 = p2[plane->type] - plane->dist;
748 t1 = DotProduct (plane->normal, p1) - plane->dist;
749 t2 = DotProduct (plane->normal, p2) - plane->dist;
756 #if COLLISIONPARANOID >= 3
759 num = node->children[1];
768 #if COLLISIONPARANOID >= 3
771 num = node->children[0];
777 // the line intersects, find intersection point
778 // LordHavoc: this uses the original trace for maximum accuracy
779 #if COLLISIONPARANOID >= 3
784 t1 = t->start[plane->type] - plane->dist;
785 t2 = t->end[plane->type] - plane->dist;
789 t1 = DotProduct (plane->normal, t->start) - plane->dist;
790 t2 = DotProduct (plane->normal, t->end) - plane->dist;
793 midf = t1 / (t1 - t2);
794 midf = bound(p1f, midf, p2f);
795 VectorMA(t->start, midf, t->dist, mid);
797 // recurse both sides, front side first
798 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
799 // if this side is not empty, return what it is (solid or done)
800 if (ret != HULLCHECKSTATE_EMPTY)
803 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
804 // if other side is not solid, return what it is (empty or done)
805 if (ret != HULLCHECKSTATE_SOLID)
808 // front is air and back is solid, this is the impact point...
811 t->trace->plane.dist = -plane->dist;
812 VectorNegate (plane->normal, t->trace->plane.normal);
816 t->trace->plane.dist = plane->dist;
817 VectorCopy (plane->normal, t->trace->plane.normal);
820 // calculate the true fraction
821 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
822 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
823 midf = t1 / (t1 - t2);
824 t->trace->realfraction = bound(0, midf, 1);
826 // calculate the return fraction which is nudged off the surface a bit
827 midf = (t1 - DIST_EPSILON) / (t1 - t2);
828 t->trace->fraction = bound(0, midf, 1);
830 if (collision_prefernudgedfraction.integer)
831 t->trace->realfraction = t->trace->fraction;
833 #if COLLISIONPARANOID >= 3
836 return HULLCHECKSTATE_DONE;
839 //#if COLLISIONPARANOID < 2
840 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
843 mclipnode_t *nodes = t->hull->clipnodes;
844 mplane_t *planes = t->hull->planes;
846 VectorCopy(t->start, point);
849 plane = planes + nodes[num].planenum;
850 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
852 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
853 t->trace->startsupercontents |= num;
854 if (num & SUPERCONTENTS_LIQUIDSMASK)
855 t->trace->inwater = true;
857 t->trace->inopen = true;
858 if (num & t->trace->hitsupercontentsmask)
860 t->trace->allsolid = t->trace->startsolid = true;
861 return HULLCHECKSTATE_SOLID;
865 t->trace->allsolid = t->trace->startsolid = false;
866 return HULLCHECKSTATE_EMPTY;
871 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)
873 RecursiveHullCheckTraceInfo_t rhc;
875 memset(&rhc, 0, sizeof(rhc));
876 memset(trace, 0, sizeof(trace_t));
878 rhc.trace->fraction = 1;
879 rhc.trace->realfraction = 1;
880 rhc.trace->allsolid = true;
881 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
882 VectorCopy(start, rhc.start);
883 VectorCopy(start, rhc.end);
884 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
887 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)
889 RecursiveHullCheckTraceInfo_t rhc;
891 if (VectorCompare(start, end))
893 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
897 memset(&rhc, 0, sizeof(rhc));
898 memset(trace, 0, sizeof(trace_t));
900 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
901 rhc.trace->fraction = 1;
902 rhc.trace->realfraction = 1;
903 rhc.trace->allsolid = true;
904 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
905 VectorCopy(start, rhc.start);
906 VectorCopy(end, rhc.end);
907 VectorSubtract(rhc.end, rhc.start, rhc.dist);
908 #if COLLISIONPARANOID >= 2
909 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]);
910 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
915 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
916 memset(&testtrace, 0, sizeof(trace_t));
917 rhc.trace = &testtrace;
918 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
919 rhc.trace->fraction = 1;
920 rhc.trace->realfraction = 1;
921 rhc.trace->allsolid = true;
922 VectorCopy(test, rhc.start);
923 VectorCopy(test, rhc.end);
924 VectorClear(rhc.dist);
925 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
926 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
927 if (!trace->startsolid && testtrace.startsolid)
928 Con_Printf(" - ended in solid!\n");
932 if (VectorLength2(rhc.dist))
933 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
935 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
939 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)
941 // this function currently only supports same size start and end
943 RecursiveHullCheckTraceInfo_t rhc;
945 if (VectorCompare(boxmins, boxmaxs))
947 if (VectorCompare(start, end))
948 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
950 Mod_Q1BSP_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
954 memset(&rhc, 0, sizeof(rhc));
955 memset(trace, 0, sizeof(trace_t));
957 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
958 rhc.trace->fraction = 1;
959 rhc.trace->realfraction = 1;
960 rhc.trace->allsolid = true;
961 VectorSubtract(boxmaxs, boxmins, boxsize);
963 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
964 else if (model->brush.ishlbsp)
966 // LordHavoc: this has to have a minor tolerance (the .1) because of
967 // minor float precision errors from the box being transformed around
968 if (boxsize[0] < 32.1)
970 if (boxsize[2] < 54) // pick the nearest of 36 or 72
971 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
973 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
976 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
980 // LordHavoc: this has to have a minor tolerance (the .1) because of
981 // minor float precision errors from the box being transformed around
982 if (boxsize[0] < 32.1)
983 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
985 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
987 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
988 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
989 VectorSubtract(rhc.end, rhc.start, rhc.dist);
990 #if COLLISIONPARANOID >= 2
991 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]);
992 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
997 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
998 memset(&testtrace, 0, sizeof(trace_t));
999 rhc.trace = &testtrace;
1000 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1001 rhc.trace->fraction = 1;
1002 rhc.trace->realfraction = 1;
1003 rhc.trace->allsolid = true;
1004 VectorCopy(test, rhc.start);
1005 VectorCopy(test, rhc.end);
1006 VectorClear(rhc.dist);
1007 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1008 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
1009 if (!trace->startsolid && testtrace.startsolid)
1010 Con_Printf(" - ended in solid!\n");
1014 if (VectorLength2(rhc.dist))
1015 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1017 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1021 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
1023 int num = model->brushq1.hulls[0].firstclipnode;
1025 mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
1026 mplane_t *planes = model->brushq1.hulls[0].planes;
1029 plane = planes + nodes[num].planenum;
1030 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
1032 return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
1035 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, const texture_t *boxtexture)
1039 colplanef_t cbox_planes[6];
1041 cbox.hasaabbplanes = true;
1042 cbox.supercontents = boxsupercontents;
1045 cbox.numtriangles = 0;
1046 cbox.planes = cbox_planes;
1048 cbox.elements = NULL;
1056 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];
1057 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];
1058 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];
1059 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];
1060 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];
1061 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];
1062 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1063 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1064 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1065 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1066 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1067 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1068 memset(trace, 0, sizeof(trace_t));
1069 trace->hitsupercontentsmask = hitsupercontentsmask;
1070 trace->fraction = 1;
1071 trace->realfraction = 1;
1072 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1074 RecursiveHullCheckTraceInfo_t rhc;
1075 static hull_t box_hull;
1076 static mclipnode_t box_clipnodes[6];
1077 static mplane_t box_planes[6];
1078 // fill in a default trace
1079 memset(&rhc, 0, sizeof(rhc));
1080 memset(trace, 0, sizeof(trace_t));
1081 //To keep everything totally uniform, bounding boxes are turned into small
1082 //BSP trees instead of being compared directly.
1083 // create a temp hull from bounding box sizes
1084 box_planes[0].dist = cmaxs[0] - mins[0];
1085 box_planes[1].dist = cmins[0] - maxs[0];
1086 box_planes[2].dist = cmaxs[1] - mins[1];
1087 box_planes[3].dist = cmins[1] - maxs[1];
1088 box_planes[4].dist = cmaxs[2] - mins[2];
1089 box_planes[5].dist = cmins[2] - maxs[2];
1090 #if COLLISIONPARANOID >= 3
1091 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]);
1094 if (box_hull.clipnodes == NULL)
1098 //Set up the planes and clipnodes so that the six floats of a bounding box
1099 //can just be stored out and get a proper hull_t structure.
1101 box_hull.clipnodes = box_clipnodes;
1102 box_hull.planes = box_planes;
1103 box_hull.firstclipnode = 0;
1104 box_hull.lastclipnode = 5;
1106 for (i = 0;i < 6;i++)
1108 box_clipnodes[i].planenum = i;
1112 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1114 box_clipnodes[i].children[side^1] = i + 1;
1116 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1118 box_planes[i].type = i>>1;
1119 box_planes[i].normal[i>>1] = 1;
1123 // trace a line through the generated clipping hull
1124 //rhc.boxsupercontents = boxsupercontents;
1125 rhc.hull = &box_hull;
1127 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1128 rhc.trace->fraction = 1;
1129 rhc.trace->realfraction = 1;
1130 rhc.trace->allsolid = true;
1131 VectorCopy(start, rhc.start);
1132 VectorCopy(end, rhc.end);
1133 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1134 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1135 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1136 if (rhc.trace->startsupercontents)
1137 rhc.trace->startsupercontents = boxsupercontents;
1141 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, const texture_t *boxtexture)
1143 memset(trace, 0, sizeof(trace_t));
1144 trace->fraction = 1;
1145 trace->realfraction = 1;
1146 if (BoxesOverlap(start, start, cmins, cmaxs))
1148 trace->startsupercontents |= boxsupercontents;
1149 if (hitsupercontentsmask & boxsupercontents)
1151 trace->startsolid = true;
1152 trace->allsolid = true;
1157 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1160 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
1161 return trace.fraction == 1;
1164 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)
1168 float mid, distz = endz - startz;
1172 return false; // didn't hit anything
1174 switch (node->plane->type)
1177 node = node->children[x < node->plane->dist];
1180 node = node->children[y < node->plane->dist];
1183 side = startz < node->plane->dist;
1184 if ((endz < node->plane->dist) == side)
1186 node = node->children[side];
1189 // found an intersection
1190 mid = node->plane->dist;
1193 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1194 front += startz * node->plane->normal[2];
1195 back += endz * node->plane->normal[2];
1196 side = front < node->plane->dist;
1197 if ((back < node->plane->dist) == side)
1199 node = node->children[side];
1202 // found an intersection
1203 mid = startz + distz * (front - node->plane->dist) / (front - back);
1207 // go down front side
1208 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1209 return true; // hit something
1212 // check for impact on this node
1213 if (node->numsurfaces)
1215 int i, dsi, dti, lmwidth, lmheight;
1217 msurface_t *surface;
1218 unsigned char *lightmap;
1219 int maps, line3, size3;
1222 float scale, w, w00, w01, w10, w11;
1224 surface = model->data_surfaces + node->firstsurface;
1225 for (i = 0;i < node->numsurfaces;i++, surface++)
1227 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo || !surface->lightmapinfo->samples)
1228 continue; // no lightmaps
1230 // location we want to sample in the lightmap
1231 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;
1232 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;
1237 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1238 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1241 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1243 // calculate bilinear interpolation factors
1244 // and also multiply by fixedpoint conversion factors
1247 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1248 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1249 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1250 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1252 // values for pointer math
1253 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1254 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1256 // look up the pixel
1257 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1259 // bilinear filter each lightmap style, and sum them
1260 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1262 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1263 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1264 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1265 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1266 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1270 return true; // success
1275 // go down back side
1276 node = node->children[side ^ 1];
1278 distz = endz - startz;
1283 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1285 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1286 VectorSet(diffusenormal, 0, 0, 1);
1288 if (!model->brushq1.lightdata)
1290 VectorSet(ambientcolor, 1, 1, 1);
1291 VectorSet(diffusecolor, 0, 0, 0);
1295 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);
1298 static const texture_t *Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(RecursiveHullCheckTraceInfo_t *t, const dp_model_t *model, const mnode_t *node, double mid[3])
1303 const msurface_t *surface;
1308 float edgenormal[3];
1315 surface = model->data_surfaces + node->firstsurface;
1316 for (i = 0;i < node->numsurfaces;i++, surface++)
1318 // skip surfaces whose bounding box does not include the point
1319 // if (!BoxesOverlap(mid, mid, surface->mins, surface->maxs))
1321 // skip faces with contents we don't care about
1322 if (!(t->trace->hitsupercontentsmask & surface->texture->supercontents))
1324 // get the surface normal - since it is flat we know any vertex normal will suffice
1325 VectorCopy(model->surfmesh.data_normal3f + 3 * surface->num_firstvertex, normal);
1327 if (DotProduct(t->dist, normal) > 0)
1329 // iterate edges and see if the point is outside one of them
1330 for (j = 0, k = surface->num_vertices - 1;j < surface->num_vertices;k = j, j++)
1332 VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + k), v0);
1333 VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + j), v1);
1334 VectorSubtract(v0, v1, edgedir);
1335 CrossProduct(edgedir, normal, edgenormal);
1336 if (DotProduct(edgenormal, p) > DotProduct(edgenormal, v0))
1339 // if the point is outside one of the edges, it is not within the surface
1340 if (j < surface->num_vertices)
1343 // we hit a surface, this is the impact point...
1344 VectorCopy(normal, t->trace->plane.normal);
1345 t->trace->plane.dist = DotProduct(normal, p);
1347 // calculate the true fraction
1348 t1 = DotProduct(t->start, t->trace->plane.normal) - t->trace->plane.dist;
1349 t2 = DotProduct(t->end, t->trace->plane.normal) - t->trace->plane.dist;
1350 midf = t1 / (t1 - t2);
1351 t->trace->realfraction = midf;
1353 // calculate the return fraction which is nudged off the surface a bit
1354 midf = (t1 - DIST_EPSILON) / (t1 - t2);
1355 t->trace->fraction = bound(0, midf, 1);
1357 if (collision_prefernudgedfraction.integer)
1358 t->trace->realfraction = t->trace->fraction;
1360 t->trace->hittexture = surface->texture->currentframe;
1361 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
1362 t->trace->hitsupercontents = t->trace->hittexture->supercontents;
1363 return surface->texture->currentframe;
1368 static int Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(RecursiveHullCheckTraceInfo_t *t, const dp_model_t *model, const mnode_t *node, const double p1[3], const double p2[3])
1370 const mplane_t *plane;
1373 double midf, mid[3];
1374 const mleaf_t *leaf;
1378 plane = node->plane;
1379 if (plane->type < 3)
1381 t1 = p1[plane->type] - plane->dist;
1382 t2 = p2[plane->type] - plane->dist;
1386 t1 = DotProduct (plane->normal, p1) - plane->dist;
1387 t2 = DotProduct (plane->normal, p2) - plane->dist;
1393 node = node->children[1];
1402 node = node->children[0];
1408 // the line intersects, find intersection point
1409 // LordHavoc: this uses the original trace for maximum accuracy
1410 if (plane->type < 3)
1412 t1 = t->start[plane->type] - plane->dist;
1413 t2 = t->end[plane->type] - plane->dist;
1417 t1 = DotProduct (plane->normal, t->start) - plane->dist;
1418 t2 = DotProduct (plane->normal, t->end) - plane->dist;
1421 midf = t1 / (t1 - t2);
1422 VectorMA(t->start, midf, t->dist, mid);
1424 // recurse both sides, front side first, return if we hit a surface
1425 if (Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side], p1, mid) == HULLCHECKSTATE_DONE)
1426 return HULLCHECKSTATE_DONE;
1428 // test each surface on the node
1429 Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(t, model, node, mid);
1430 if (t->trace->hittexture)
1431 return HULLCHECKSTATE_DONE;
1433 // recurse back side
1434 return Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side ^ 1], mid, p2);
1436 leaf = (const mleaf_t *)node;
1437 side = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, leaf->contents);
1438 if (!t->trace->startfound)
1440 t->trace->startfound = true;
1441 t->trace->startsupercontents |= side;
1443 if (side & SUPERCONTENTS_LIQUIDSMASK)
1444 t->trace->inwater = true;
1446 t->trace->inopen = true;
1447 if (side & t->trace->hitsupercontentsmask)
1449 // if the first leaf is solid, set startsolid
1450 if (t->trace->allsolid)
1451 t->trace->startsolid = true;
1452 return HULLCHECKSTATE_SOLID;
1456 t->trace->allsolid = false;
1457 return HULLCHECKSTATE_EMPTY;
1461 static void Mod_Q1BSP_TraceLineAgainstSurfaces(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)
1463 RecursiveHullCheckTraceInfo_t rhc;
1465 memset(&rhc, 0, sizeof(rhc));
1466 memset(trace, 0, sizeof(trace_t));
1468 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1469 rhc.trace->fraction = 1;
1470 rhc.trace->realfraction = 1;
1471 rhc.trace->allsolid = true;
1472 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
1473 VectorCopy(start, rhc.start);
1474 VectorCopy(end, rhc.end);
1475 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1476 Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(&rhc, model, model->brush.data_nodes + rhc.hull->firstclipnode, rhc.start, rhc.end);
1477 VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1480 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1483 unsigned char *outstart = out;
1484 while (out < outend)
1488 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));
1498 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));
1501 for (c = *in++;c > 0;c--)
1505 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));
1516 R_Q1BSP_LoadSplitSky
1518 A sky texture is 256*128, with the right side being a masked overlay
1521 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1526 unsigned int *solidpixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1527 unsigned int *alphapixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1529 // allocate a texture pool if we need it
1530 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1531 loadmodel->texturepool = R_AllocTexturePool();
1533 if (bytesperpixel == 4)
1535 for (y = 0;y < h;y++)
1537 for (x = 0;x < w;x++)
1539 solidpixels[y*w+x] = ((unsigned *)src)[y*width+x+w];
1540 alphapixels[y*w+x] = ((unsigned *)src)[y*width+x];
1546 // make an average value for the back to avoid
1547 // a fringe on the top level
1556 for (y = 0;y < h;y++)
1558 for (x = 0;x < w;x++)
1560 p = src[x*width+y+w];
1561 r += palette_rgb[p][0];
1562 g += palette_rgb[p][1];
1563 b += palette_rgb[p][2];
1566 bgra.b[2] = r/(w*h);
1567 bgra.b[1] = g/(w*h);
1568 bgra.b[0] = b/(w*h);
1570 for (y = 0;y < h;y++)
1572 for (x = 0;x < w;x++)
1574 solidpixels[y*w+x] = palette_bgra_complete[src[y*width+x+w]];
1576 alphapixels[y*w+x] = p ? palette_bgra_complete[p] : bgra.i;
1581 loadmodel->brush.solidskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_solidtexture", 0 , (unsigned char *) solidpixels, w, h, bytesperpixel == 4 && r_texture_sRGB_skybox.integer);
1582 loadmodel->brush.alphaskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_alphatexture", TEXF_ALPHA, (unsigned char *) alphapixels, w, h, bytesperpixel == 4 && r_texture_sRGB_skybox.integer);
1583 Mem_Free(solidpixels);
1584 Mem_Free(alphapixels);
1587 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1589 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1590 skinframe_t *skinframe;
1592 texture_t *tx, *tx2, *anims[10], *altanims[10];
1593 texture_t backuptex;
1595 unsigned char *data, *mtdata;
1597 char mapname[MAX_QPATH], name[MAX_QPATH];
1598 unsigned char zeroopaque[4], zerotrans[4];
1599 Vector4Set(zeroopaque, 0, 0, 0, 255);
1600 Vector4Set(zerotrans, 0, 0, 0, 128);
1602 loadmodel->data_textures = NULL;
1604 // add two slots for notexture walls and notexture liquids
1607 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1608 m->nummiptex = LittleLong (m->nummiptex);
1609 loadmodel->num_textures = m->nummiptex + 2;
1610 loadmodel->num_texturesperskin = loadmodel->num_textures;
1615 loadmodel->num_textures = 2;
1616 loadmodel->num_texturesperskin = loadmodel->num_textures;
1619 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1621 // fill out all slots with notexture
1622 if (cls.state != ca_dedicated)
1623 skinframe = R_SkinFrame_LoadMissing();
1626 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1628 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1631 if (cls.state != ca_dedicated)
1633 tx->numskinframes = 1;
1634 tx->skinframerate = 1;
1635 tx->skinframes[0] = skinframe;
1636 tx->currentskinframe = tx->skinframes[0];
1638 tx->basematerialflags = MATERIALFLAG_WALL;
1639 if (i == loadmodel->num_textures - 1)
1641 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1642 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1643 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1647 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1648 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1650 tx->currentframe = tx;
1652 // clear water settings
1655 tx->refractfactor = 1;
1656 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1657 tx->reflectfactor = 1;
1658 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1659 tx->r_water_wateralpha = 1;
1660 tx->offsetmapping = OFFSETMAPPING_OFF;
1661 tx->offsetscale = 1;
1662 tx->specularscalemod = 1;
1663 tx->specularpowermod = 1;
1668 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1672 s = loadmodel->name;
1673 if (!strncasecmp(s, "maps/", 5))
1675 FS_StripExtension(s, mapname, sizeof(mapname));
1677 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1679 // LordHavoc: mostly rewritten map texture loader
1680 for (i = 0;i < m->nummiptex;i++)
1682 dofs[i] = LittleLong(dofs[i]);
1683 if (r_nosurftextures.integer)
1687 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1690 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1692 // copy name, but only up to 16 characters
1693 // (the output buffer can hold more than this, but the input buffer is
1695 for (j = 0;j < 16 && dmiptex->name[j];j++)
1696 name[j] = dmiptex->name[j];
1701 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1702 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1705 mtwidth = LittleLong(dmiptex->width);
1706 mtheight = LittleLong(dmiptex->height);
1708 j = LittleLong(dmiptex->offsets[0]);
1712 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1714 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1717 mtdata = (unsigned char *)dmiptex + j;
1720 if ((mtwidth & 15) || (mtheight & 15))
1721 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1723 // LordHavoc: force all names to lowercase
1724 for (j = 0;name[j];j++)
1725 if (name[j] >= 'A' && name[j] <= 'Z')
1726 name[j] += 'a' - 'A';
1728 // LordHavoc: backup the texture_t because q3 shader loading overwrites it
1729 backuptex = loadmodel->data_textures[i];
1730 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1732 loadmodel->data_textures[i] = backuptex;
1734 tx = loadmodel->data_textures + i;
1735 strlcpy(tx->name, name, sizeof(tx->name));
1736 tx->width = mtwidth;
1737 tx->height = mtheight;
1739 if (tx->name[0] == '*')
1741 if (!strncmp(tx->name, "*lava", 5))
1743 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1744 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1746 else if (!strncmp(tx->name, "*slime", 6))
1748 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1749 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1753 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1754 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1757 else if (!strncmp(tx->name, "sky", 3))
1759 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1760 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1764 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1765 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1768 if (cls.state != ca_dedicated)
1770 // LordHavoc: HL sky textures are entirely different than quake
1771 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == mtheight * 2)
1773 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), false, false, r_texture_sRGB_skin_diffuse.integer != 0, NULL);
1775 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), false, false, r_texture_sRGB_skin_diffuse.integer != 0, NULL);
1776 if (data && image_width == image_height * 2)
1778 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1781 else if (mtdata != NULL)
1782 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1786 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, false);
1788 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, false);
1791 // did not find external texture, load it from the bsp or wad3
1792 if (loadmodel->brush.ishlbsp)
1794 // internal texture overrides wad
1795 unsigned char *pixels, *freepixels;
1796 pixels = freepixels = NULL;
1798 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1800 pixels = freepixels = W_GetTextureBGRA(tx->name);
1803 tx->width = image_width;
1804 tx->height = image_height;
1805 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, pixels, image_width, image_height, true);
1808 Mem_Free(freepixels);
1810 else if (mtdata) // texture included
1811 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1813 // if skinframe is still NULL the "missing" texture will be used
1815 tx->skinframes[0] = skinframe;
1818 tx->basematerialflags = MATERIALFLAG_WALL;
1819 if (tx->name[0] == '*')
1821 // LordHavoc: some turbulent textures should not be affected by wateralpha
1822 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1824 // replace the texture with transparent black
1825 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA, zerotrans, 1, 1, false);
1826 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1828 else if (!strncmp(tx->name,"*lava",5)
1829 || !strncmp(tx->name,"*teleport",9)
1830 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1831 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1833 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1834 if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1835 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1837 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1839 // replace the texture with black
1840 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, 0, zeroopaque, 1, 1, false);
1841 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1843 else if (!strncmp(tx->name, "sky", 3))
1844 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1845 else if (!strcmp(tx->name, "caulk"))
1846 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1847 else if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1848 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1850 // start out with no animation
1851 tx->currentframe = tx;
1852 tx->currentskinframe = tx->skinframes[0];
1856 // sequence the animations
1857 for (i = 0;i < m->nummiptex;i++)
1859 tx = loadmodel->data_textures + i;
1860 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1862 if (tx->anim_total[0] || tx->anim_total[1])
1863 continue; // already sequenced
1865 // find the number of frames in the animation
1866 memset(anims, 0, sizeof(anims));
1867 memset(altanims, 0, sizeof(altanims));
1869 for (j = i;j < m->nummiptex;j++)
1871 tx2 = loadmodel->data_textures + j;
1872 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1876 if (num >= '0' && num <= '9')
1877 anims[num - '0'] = tx2;
1878 else if (num >= 'a' && num <= 'j')
1879 altanims[num - 'a'] = tx2;
1881 Con_Printf("Bad animating texture %s\n", tx->name);
1885 for (j = 0;j < 10;j++)
1892 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1895 for (j = 0;j < max;j++)
1899 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1903 for (j = 0;j < altmax;j++)
1907 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1916 // if there is no alternate animation, duplicate the primary
1917 // animation into the alternate
1919 for (k = 0;k < 10;k++)
1920 altanims[k] = anims[k];
1923 // link together the primary animation
1924 for (j = 0;j < max;j++)
1927 tx2->animated = true;
1928 tx2->anim_total[0] = max;
1929 tx2->anim_total[1] = altmax;
1930 for (k = 0;k < 10;k++)
1932 tx2->anim_frames[0][k] = anims[k];
1933 tx2->anim_frames[1][k] = altanims[k];
1937 // if there really is an alternate anim...
1938 if (anims[0] != altanims[0])
1940 // link together the alternate animation
1941 for (j = 0;j < altmax;j++)
1944 tx2->animated = true;
1945 // the primary/alternate are reversed here
1946 tx2->anim_total[0] = altmax;
1947 tx2->anim_total[1] = max;
1948 for (k = 0;k < 10;k++)
1950 tx2->anim_frames[0][k] = altanims[k];
1951 tx2->anim_frames[1][k] = anims[k];
1958 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1961 unsigned char *in, *out, *data, d;
1962 char litfilename[MAX_QPATH];
1963 char dlitfilename[MAX_QPATH];
1964 fs_offset_t filesize;
1965 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1967 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1968 for (i=0; i<l->filelen; i++)
1969 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1971 else // LordHavoc: bsp version 29 (normal white lighting)
1973 // LordHavoc: hope is not lost yet, check for a .lit file to load
1974 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1975 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1976 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1977 strlcat (litfilename, ".lit", sizeof (litfilename));
1978 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1979 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1982 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1984 i = LittleLong(((int *)data)[1]);
1987 if (developer_loading.integer)
1988 Con_Printf("loaded %s\n", litfilename);
1989 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1990 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1992 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1995 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1997 i = LittleLong(((int *)data)[1]);
2000 if (developer_loading.integer)
2001 Con_Printf("loaded %s\n", dlitfilename);
2002 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
2003 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
2004 loadmodel->brushq3.deluxemapping_modelspace = false;
2005 loadmodel->brushq3.deluxemapping = true;
2014 Con_Printf("Unknown .lit file version (%d)\n", i);
2016 else if (filesize == 8)
2017 Con_Print("Empty .lit file, ignoring\n");
2019 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
2026 // LordHavoc: oh well, expand the white lighting data
2029 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
2030 in = mod_base + l->fileofs;
2031 out = loadmodel->brushq1.lightdata;
2032 for (i = 0;i < l->filelen;i++)
2042 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
2044 loadmodel->brushq1.num_compressedpvs = 0;
2045 loadmodel->brushq1.data_compressedpvs = NULL;
2048 loadmodel->brushq1.num_compressedpvs = l->filelen;
2049 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
2050 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
2053 // used only for HalfLife maps
2054 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
2056 char key[128], value[4096];
2060 if (!COM_ParseToken_Simple(&data, false, false))
2062 if (com_token[0] != '{')
2066 if (!COM_ParseToken_Simple(&data, false, false))
2068 if (com_token[0] == '}')
2069 break; // end of worldspawn
2070 if (com_token[0] == '_')
2071 strlcpy(key, com_token + 1, sizeof(key));
2073 strlcpy(key, com_token, sizeof(key));
2074 while (key[strlen(key)-1] == ' ') // remove trailing spaces
2075 key[strlen(key)-1] = 0;
2076 if (!COM_ParseToken_Simple(&data, false, false))
2078 dpsnprintf(value, sizeof(value), "%s", com_token);
2079 if (!strcmp("wad", key)) // for HalfLife maps
2081 if (loadmodel->brush.ishlbsp)
2084 for (i = 0;i < (int)sizeof(value);i++)
2085 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
2089 for (;i < (int)sizeof(value);i++)
2091 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
2092 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
2094 else if (value[i] == ';' || value[i] == 0)
2098 W_LoadTextureWadFile(&value[j], false);
2110 static void Mod_Q1BSP_LoadEntities(lump_t *l)
2112 loadmodel->brush.entities = NULL;
2115 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
2116 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
2117 loadmodel->brush.entities[l->filelen] = 0;
2118 if (loadmodel->brush.ishlbsp)
2119 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
2123 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
2129 in = (dvertex_t *)(mod_base + l->fileofs);
2130 if (l->filelen % sizeof(*in))
2131 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
2132 count = l->filelen / sizeof(*in);
2133 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2135 loadmodel->brushq1.vertexes = out;
2136 loadmodel->brushq1.numvertexes = count;
2138 for ( i=0 ; i<count ; i++, in++, out++)
2140 out->position[0] = LittleFloat(in->point[0]);
2141 out->position[1] = LittleFloat(in->point[1]);
2142 out->position[2] = LittleFloat(in->point[2]);
2146 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
2147 // can be used for this
2149 int SB_ReadInt (unsigned char **buffer)
2152 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
2158 float SB_ReadFloat (unsigned char **buffer)
2166 u.i = SB_ReadInt (buffer);
2170 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
2172 unsigned char *index;
2176 index = (unsigned char *)(mod_base + l->fileofs);
2177 if (l->filelen % (48+4*hullinfo->filehulls))
2178 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
2180 count = l->filelen / (48+4*hullinfo->filehulls);
2181 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
2183 loadmodel->brushq1.submodels = out;
2184 loadmodel->brush.numsubmodels = count;
2186 for (i = 0; i < count; i++, out++)
2188 // spread out the mins / maxs by a pixel
2189 out->mins[0] = SB_ReadFloat (&index) - 1;
2190 out->mins[1] = SB_ReadFloat (&index) - 1;
2191 out->mins[2] = SB_ReadFloat (&index) - 1;
2192 out->maxs[0] = SB_ReadFloat (&index) + 1;
2193 out->maxs[1] = SB_ReadFloat (&index) + 1;
2194 out->maxs[2] = SB_ReadFloat (&index) + 1;
2195 out->origin[0] = SB_ReadFloat (&index);
2196 out->origin[1] = SB_ReadFloat (&index);
2197 out->origin[2] = SB_ReadFloat (&index);
2198 for (j = 0; j < hullinfo->filehulls; j++)
2199 out->headnode[j] = SB_ReadInt (&index);
2200 out->visleafs = SB_ReadInt (&index);
2201 out->firstface = SB_ReadInt (&index);
2202 out->numfaces = SB_ReadInt (&index);
2206 static void Mod_Q1BSP_LoadEdges(lump_t *l)
2212 in = (dedge_t *)(mod_base + l->fileofs);
2213 if (l->filelen % sizeof(*in))
2214 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2215 count = l->filelen / sizeof(*in);
2216 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2218 loadmodel->brushq1.edges = out;
2219 loadmodel->brushq1.numedges = count;
2221 for ( i=0 ; i<count ; i++, in++, out++)
2223 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2224 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2225 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2227 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);
2228 if(!loadmodel->brushq1.numvertexes)
2229 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2237 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2241 int i, j, k, count, miptex;
2243 in = (texinfo_t *)(mod_base + l->fileofs);
2244 if (l->filelen % sizeof(*in))
2245 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2246 count = l->filelen / sizeof(*in);
2247 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2249 loadmodel->brushq1.texinfo = out;
2250 loadmodel->brushq1.numtexinfo = count;
2252 for (i = 0;i < count;i++, in++, out++)
2254 for (k = 0;k < 2;k++)
2255 for (j = 0;j < 4;j++)
2256 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2258 miptex = LittleLong(in->miptex);
2259 out->flags = LittleLong(in->flags);
2261 out->texture = NULL;
2262 if (loadmodel->data_textures)
2264 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2265 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2267 out->texture = loadmodel->data_textures + miptex;
2269 if (out->flags & TEX_SPECIAL)
2271 // if texture chosen is NULL or the shader needs a lightmap,
2272 // force to notexture water shader
2273 if (out->texture == NULL)
2274 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2278 // if texture chosen is NULL, force to notexture
2279 if (out->texture == NULL)
2280 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2286 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2291 mins[0] = mins[1] = mins[2] = 9999;
2292 maxs[0] = maxs[1] = maxs[2] = -9999;
2294 for (i = 0;i < numverts;i++)
2296 for (j = 0;j < 3;j++, v++)
2306 #define MAX_SUBDIVPOLYTRIANGLES 4096
2307 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2309 static int subdivpolyverts, subdivpolytriangles;
2310 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2311 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2313 static int subdivpolylookupvert(vec3_t v)
2316 for (i = 0;i < subdivpolyverts;i++)
2317 if (subdivpolyvert[i][0] == v[0]
2318 && subdivpolyvert[i][1] == v[1]
2319 && subdivpolyvert[i][2] == v[2])
2321 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2322 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2323 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2324 return subdivpolyverts++;
2327 static void SubdividePolygon(int numverts, float *verts)
2329 int i, i1, i2, i3, f, b, c, p;
2330 vec3_t mins, maxs, front[256], back[256];
2331 float m, *pv, *cv, dist[256], frac;
2334 Host_Error("SubdividePolygon: ran out of verts in buffer");
2336 BoundPoly(numverts, verts, mins, maxs);
2338 for (i = 0;i < 3;i++)
2340 m = (mins[i] + maxs[i]) * 0.5;
2341 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2342 if (maxs[i] - m < 8)
2344 if (m - mins[i] < 8)
2348 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2349 dist[c] = cv[i] - m;
2352 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2356 VectorCopy(pv, front[f]);
2361 VectorCopy(pv, back[b]);
2364 if (dist[p] == 0 || dist[c] == 0)
2366 if ((dist[p] > 0) != (dist[c] > 0) )
2369 frac = dist[p] / (dist[p] - dist[c]);
2370 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2371 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2372 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2378 SubdividePolygon(f, front[0]);
2379 SubdividePolygon(b, back[0]);
2383 i1 = subdivpolylookupvert(verts);
2384 i2 = subdivpolylookupvert(verts + 3);
2385 for (i = 2;i < numverts;i++)
2387 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2389 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2393 i3 = subdivpolylookupvert(verts + i * 3);
2394 subdivpolyindex[subdivpolytriangles][0] = i1;
2395 subdivpolyindex[subdivpolytriangles][1] = i2;
2396 subdivpolyindex[subdivpolytriangles][2] = i3;
2398 subdivpolytriangles++;
2402 //Breaks a polygon up along axial 64 unit
2403 //boundaries so that turbulent and sky warps
2404 //can be done reasonably.
2405 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2411 subdivpolytriangles = 0;
2412 subdivpolyverts = 0;
2413 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2414 if (subdivpolytriangles < 1)
2415 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2417 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2418 mesh->num_vertices = subdivpolyverts;
2419 mesh->num_triangles = subdivpolytriangles;
2420 mesh->vertex = (surfvertex_t *)(mesh + 1);
2421 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2422 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2424 for (i = 0;i < mesh->num_triangles;i++)
2425 for (j = 0;j < 3;j++)
2426 mesh->index[i*3+j] = subdivpolyindex[i][j];
2428 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2430 VectorCopy(subdivpolyvert[i], v->v);
2431 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2432 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2437 extern cvar_t gl_max_lightmapsize;
2438 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2441 msurface_t *surface;
2442 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2443 float texmins[2], texmaxs[2], val;
2444 rtexture_t *lightmaptexture, *deluxemaptexture;
2446 in = (dface_t *)(mod_base + l->fileofs);
2447 if (l->filelen % sizeof(*in))
2448 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2449 count = l->filelen / sizeof(*in);
2450 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2451 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2453 loadmodel->num_surfaces = count;
2455 loadmodel->brushq1.firstrender = true;
2456 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2460 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2462 numedges = (unsigned short)LittleShort(in->numedges);
2463 totalverts += numedges;
2464 totaltris += numedges - 2;
2467 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2469 lightmaptexture = NULL;
2470 deluxemaptexture = r_texture_blanknormalmap;
2472 lightmapsize = bound(256, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d);
2473 totallightmapsamples = 0;
2477 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2479 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2481 // FIXME: validate edges, texinfo, etc?
2482 firstedge = LittleLong(in->firstedge);
2483 numedges = (unsigned short)LittleShort(in->numedges);
2484 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)
2485 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2486 i = (unsigned short)LittleShort(in->texinfo);
2487 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2488 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2489 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2490 surface->texture = surface->lightmapinfo->texinfo->texture;
2492 planenum = (unsigned short)LittleShort(in->planenum);
2493 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2494 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2496 //surface->flags = surface->texture->flags;
2497 //if (LittleShort(in->side))
2498 // surface->flags |= SURF_PLANEBACK;
2499 //surface->plane = loadmodel->brush.data_planes + planenum;
2501 surface->num_firstvertex = totalverts;
2502 surface->num_vertices = numedges;
2503 surface->num_firsttriangle = totaltris;
2504 surface->num_triangles = numedges - 2;
2505 totalverts += numedges;
2506 totaltris += numedges - 2;
2508 // convert edges back to a normal polygon
2509 for (i = 0;i < surface->num_vertices;i++)
2511 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2513 // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2515 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2517 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2518 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2519 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2520 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2521 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2522 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2523 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2524 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2527 for (i = 0;i < surface->num_triangles;i++)
2529 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2530 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2531 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2534 // compile additional data about the surface geometry
2535 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, r_smoothnormals_areaweighting.integer != 0);
2536 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, r_smoothnormals_areaweighting.integer != 0);
2537 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2539 // generate surface extents information
2540 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2541 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2542 for (i = 1;i < surface->num_vertices;i++)
2544 for (j = 0;j < 2;j++)
2546 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2547 texmins[j] = min(texmins[j], val);
2548 texmaxs[j] = max(texmaxs[j], val);
2551 for (i = 0;i < 2;i++)
2553 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2554 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2557 smax = surface->lightmapinfo->extents[0] >> 4;
2558 tmax = surface->lightmapinfo->extents[1] >> 4;
2559 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2560 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2563 for (i = 0;i < MAXLIGHTMAPS;i++)
2564 surface->lightmapinfo->styles[i] = in->styles[i];
2565 surface->lightmaptexture = NULL;
2566 surface->deluxemaptexture = r_texture_blanknormalmap;
2567 i = LittleLong(in->lightofs);
2570 surface->lightmapinfo->samples = NULL;
2572 // give non-lightmapped water a 1x white lightmap
2573 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2575 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2576 surface->lightmapinfo->styles[0] = 0;
2577 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2581 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2582 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2583 else // LordHavoc: white lighting (bsp version 29)
2585 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2586 if (loadmodel->brushq1.nmaplightdata)
2587 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2590 // check if we should apply a lightmap to this
2591 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2593 if (ssize > 256 || tsize > 256)
2594 Host_Error("Bad surface extents");
2596 if (lightmapsize < ssize)
2597 lightmapsize = ssize;
2598 if (lightmapsize < tsize)
2599 lightmapsize = tsize;
2601 totallightmapsamples += ssize*tsize;
2603 // force lightmap upload on first time seeing the surface
2605 // additionally this is used by the later code to see if a
2606 // lightmap is needed on this surface (rather than duplicating the
2608 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2609 loadmodel->lit = true;
2613 // small maps (such as ammo boxes especially) don't need big lightmap
2614 // textures, so this code tries to guess a good size based on
2615 // totallightmapsamples (size of the lightmaps lump basically), as well as
2616 // trying to max out the size if there is a lot of lightmap data to store
2617 // additionally, never choose a lightmapsize that is smaller than the
2618 // largest surface encountered (as it would fail)
2620 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < bound(128, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d)) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2623 // now that we've decided the lightmap texture size, we can do the rest
2624 if (cls.state != ca_dedicated)
2626 int stainmapsize = 0;
2627 mod_alloclightmap_state_t allocState;
2629 Mod_AllocLightmap_Init(&allocState, lightmapsize, lightmapsize);
2630 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2632 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2633 float u, v, ubase, vbase, uscale, vscale;
2635 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2638 smax = surface->lightmapinfo->extents[0] >> 4;
2639 tmax = surface->lightmapinfo->extents[1] >> 4;
2640 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2641 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2642 stainmapsize += ssize * tsize * 3;
2644 if (!lightmaptexture || !Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy))
2646 // allocate a texture pool if we need it
2647 if (loadmodel->texturepool == NULL)
2648 loadmodel->texturepool = R_AllocTexturePool();
2649 // could not find room, make a new lightmap
2650 loadmodel->brushq3.num_mergedlightmaps = lightmapnumber + 1;
2651 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_lightmaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_lightmaps[0]));
2652 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_deluxemaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_deluxemaps[0]));
2653 loadmodel->brushq3.data_lightmaps[lightmapnumber] = lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_ALLOWUPDATES, -1, NULL);
2654 if (loadmodel->brushq1.nmaplightdata)
2655 loadmodel->brushq3.data_deluxemaps[lightmapnumber] = deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_ALLOWUPDATES, -1, NULL);
2657 Mod_AllocLightmap_Reset(&allocState);
2658 Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy);
2660 surface->lightmaptexture = lightmaptexture;
2661 surface->deluxemaptexture = deluxemaptexture;
2662 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2663 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2665 uscale = 1.0f / (float)lightmapsize;
2666 vscale = 1.0f / (float)lightmapsize;
2667 ubase = lightmapx * uscale;
2668 vbase = lightmapy * vscale;
2670 for (i = 0;i < surface->num_vertices;i++)
2672 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);
2673 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);
2674 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2675 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2676 // LordHavoc: calc lightmap data offset for vertex lighting to use
2679 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2683 if (cl_stainmaps.integer)
2685 // allocate stainmaps for permanent marks on walls and clear white
2686 unsigned char *stainsamples = NULL;
2687 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2688 memset(stainsamples, 255, stainmapsize);
2690 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2692 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2694 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2695 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2696 surface->lightmapinfo->stainsamples = stainsamples;
2697 stainsamples += ssize * tsize * 3;
2702 // generate ushort elements array if possible
2703 if (loadmodel->surfmesh.data_element3s)
2704 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2705 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2708 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2711 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2712 node->parent = parent;
2715 // this is a node, recurse to children
2716 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2717 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2718 // combine supercontents of children
2719 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2724 mleaf_t *leaf = (mleaf_t *)node;
2725 // if this is a leaf, calculate supercontents mask from all collidable
2726 // primitives in the leaf (brushes and collision surfaces)
2727 // also flag if the leaf contains any collision surfaces
2728 leaf->combinedsupercontents = 0;
2729 // combine the supercontents values of all brushes in this leaf
2730 for (j = 0;j < leaf->numleafbrushes;j++)
2731 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2732 // check if this leaf contains any collision surfaces (q3 patches)
2733 for (j = 0;j < leaf->numleafsurfaces;j++)
2735 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2736 if (surface->num_collisiontriangles)
2738 leaf->containscollisionsurfaces = true;
2739 leaf->combinedsupercontents |= surface->texture->supercontents;
2745 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2751 in = (dnode_t *)(mod_base + l->fileofs);
2752 if (l->filelen % sizeof(*in))
2753 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2754 count = l->filelen / sizeof(*in);
2756 Host_Error("Mod_Q1BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
2757 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2759 loadmodel->brush.data_nodes = out;
2760 loadmodel->brush.num_nodes = count;
2762 for ( i=0 ; i<count ; i++, in++, out++)
2764 for (j=0 ; j<3 ; j++)
2766 out->mins[j] = LittleShort(in->mins[j]);
2767 out->maxs[j] = LittleShort(in->maxs[j]);
2770 p = LittleLong(in->planenum);
2771 out->plane = loadmodel->brush.data_planes + p;
2773 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2774 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2776 for (j=0 ; j<2 ; j++)
2778 // LordHavoc: this code supports broken bsp files produced by
2779 // arguire qbsp which can produce more than 32768 nodes, any value
2780 // below count is assumed to be a node number, any other value is
2781 // assumed to be a leaf number
2782 p = (unsigned short)LittleShort(in->children[j]);
2785 if (p < loadmodel->brush.num_nodes)
2786 out->children[j] = loadmodel->brush.data_nodes + p;
2789 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2790 // map it to the solid leaf
2791 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2796 // note this uses 65535 intentionally, -1 is leaf 0
2798 if (p < loadmodel->brush.num_leafs)
2799 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2802 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2803 // map it to the solid leaf
2804 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2810 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2813 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2819 in = (dleaf_t *)(mod_base + l->fileofs);
2820 if (l->filelen % sizeof(*in))
2821 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2822 count = l->filelen / sizeof(*in);
2823 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2825 loadmodel->brush.data_leafs = out;
2826 loadmodel->brush.num_leafs = count;
2827 // get visleafs from the submodel data
2828 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2829 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2830 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2831 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2833 for ( i=0 ; i<count ; i++, in++, out++)
2835 for (j=0 ; j<3 ; j++)
2837 out->mins[j] = LittleShort(in->mins[j]);
2838 out->maxs[j] = LittleShort(in->maxs[j]);
2841 // FIXME: this function could really benefit from some error checking
2843 out->contents = LittleLong(in->contents);
2845 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2846 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2847 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2849 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);
2850 out->firstleafsurface = NULL;
2851 out->numleafsurfaces = 0;
2854 out->clusterindex = i - 1;
2855 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2856 out->clusterindex = -1;
2858 p = LittleLong(in->visofs);
2859 // ignore visofs errors on leaf 0 (solid)
2860 if (p >= 0 && out->clusterindex >= 0)
2862 if (p >= loadmodel->brushq1.num_compressedpvs)
2863 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2865 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);
2868 for (j = 0;j < 4;j++)
2869 out->ambient_sound_level[j] = in->ambient_level[j];
2871 // FIXME: Insert caustics here
2875 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2879 const unsigned char *pvs;
2880 // if there's no vis data, assume supported (because everything is visible all the time)
2881 if (!loadmodel->brush.data_pvsclusters)
2883 // check all liquid leafs to see if they can see into empty leafs, if any
2884 // can we can assume this map supports r_wateralpha
2885 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2887 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2889 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2890 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2891 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2898 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2905 in = (dclipnode_t *)(mod_base + l->fileofs);
2906 if (l->filelen % sizeof(*in))
2907 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2908 count = l->filelen / sizeof(*in);
2909 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2911 loadmodel->brushq1.clipnodes = out;
2912 loadmodel->brushq1.numclipnodes = count;
2914 for (i = 1; i < MAX_MAP_HULLS; i++)
2916 hull = &loadmodel->brushq1.hulls[i];
2917 hull->clipnodes = out;
2918 hull->firstclipnode = 0;
2919 hull->lastclipnode = count-1;
2920 hull->planes = loadmodel->brush.data_planes;
2921 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2922 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2923 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2924 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2925 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2926 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2927 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2930 for (i=0 ; i<count ; i++, out++, in++)
2932 out->planenum = LittleLong(in->planenum);
2933 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2934 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2935 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2936 if (out->children[0] >= count)
2937 out->children[0] -= 65536;
2938 if (out->children[1] >= count)
2939 out->children[1] -= 65536;
2940 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2941 Host_Error("Corrupt clipping hull(out of range planenum)");
2945 //Duplicate the drawing hull structure as a clipping hull
2946 static void Mod_Q1BSP_MakeHull0(void)
2953 hull = &loadmodel->brushq1.hulls[0];
2955 in = loadmodel->brush.data_nodes;
2956 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2958 hull->clipnodes = out;
2959 hull->firstclipnode = 0;
2960 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2961 hull->planes = loadmodel->brush.data_planes;
2963 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2965 out->planenum = in->plane - loadmodel->brush.data_planes;
2966 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2967 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2971 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2976 in = (short *)(mod_base + l->fileofs);
2977 if (l->filelen % sizeof(*in))
2978 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2979 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2980 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2982 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2984 j = (unsigned short) LittleShort(in[i]);
2985 if (j >= loadmodel->num_surfaces)
2986 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2987 loadmodel->brush.data_leafsurfaces[i] = j;
2991 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2996 in = (int *)(mod_base + l->fileofs);
2997 if (l->filelen % sizeof(*in))
2998 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2999 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
3000 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
3002 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
3003 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
3007 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
3013 in = (dplane_t *)(mod_base + l->fileofs);
3014 if (l->filelen % sizeof(*in))
3015 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
3017 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
3018 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
3020 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
3022 out->normal[0] = LittleFloat(in->normal[0]);
3023 out->normal[1] = LittleFloat(in->normal[1]);
3024 out->normal[2] = LittleFloat(in->normal[2]);
3025 out->dist = LittleFloat(in->dist);
3031 static void Mod_Q1BSP_LoadMapBrushes(void)
3035 int submodel, numbrushes;
3036 qboolean firstbrush;
3037 char *text, *maptext;
3038 char mapfilename[MAX_QPATH];
3039 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
3040 strlcat (mapfilename, ".map", sizeof (mapfilename));
3041 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
3045 if (!COM_ParseToken_Simple(&data, false, false))
3050 if (!COM_ParseToken_Simple(&data, false, false))
3052 if (com_token[0] != '{')
3058 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
3061 if (!COM_ParseToken_Simple(&data, false, false))
3063 if (com_token[0] == '}')
3064 break; // end of entity
3065 if (com_token[0] == '{')
3072 if (submodel > loadmodel->brush.numsubmodels)
3074 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
3078 model = loadmodel->brush.submodels[submodel];
3085 if (!COM_ParseToken_Simple(&data, false, false))
3087 if (com_token[0] == '}')
3088 break; // end of brush
3089 // each brush face should be this format:
3090 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
3091 // FIXME: support hl .map format
3092 for (pointnum = 0;pointnum < 3;pointnum++)
3094 COM_ParseToken_Simple(&data, false, false);
3095 for (componentnum = 0;componentnum < 3;componentnum++)
3097 COM_ParseToken_Simple(&data, false, false);
3098 point[pointnum][componentnum] = atof(com_token);
3100 COM_ParseToken_Simple(&data, false, false);
3102 COM_ParseToken_Simple(&data, false, false);
3103 strlcpy(facetexture, com_token, sizeof(facetexture));
3104 COM_ParseToken_Simple(&data, false, false);
3105 //scroll_s = atof(com_token);
3106 COM_ParseToken_Simple(&data, false, false);
3107 //scroll_t = atof(com_token);
3108 COM_ParseToken_Simple(&data, false, false);
3109 //rotate = atof(com_token);
3110 COM_ParseToken_Simple(&data, false, false);
3111 //scale_s = atof(com_token);
3112 COM_ParseToken_Simple(&data, false, false);
3113 //scale_t = atof(com_token);
3114 TriangleNormal(point[0], point[1], point[2], planenormal);
3115 VectorNormalizeDouble(planenormal);
3116 planedist = DotProduct(point[0], planenormal);
3117 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
3127 #define MAX_PORTALPOINTS 64
3129 typedef struct portal_s
3132 mnode_t *nodes[2]; // [0] = front side of plane
3133 struct portal_s *next[2];
3135 double points[3*MAX_PORTALPOINTS];
3136 struct portal_s *chain; // all portals are linked into a list
3140 static memexpandablearray_t portalarray;
3142 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
3144 // process only nodes (leafs already had their box calculated)
3148 // calculate children first
3149 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
3150 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
3152 // make combined bounding box from children
3153 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
3154 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
3155 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
3156 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
3157 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
3158 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
3161 static void Mod_Q1BSP_FinalizePortals(void)
3163 int i, j, numportals, numpoints, portalindex, portalrange = Mem_ExpandableArray_IndexRange(&portalarray);
3167 mleaf_t *leaf, *endleaf;
3169 // tally up portal and point counts and recalculate bounding boxes for all
3170 // leafs (because qbsp is very sloppy)
3171 leaf = loadmodel->brush.data_leafs;
3172 endleaf = leaf + loadmodel->brush.num_leafs;
3173 if (mod_recalculatenodeboxes.integer)
3175 for (;leaf < endleaf;leaf++)
3177 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
3178 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3183 for (portalindex = 0;portalindex < portalrange;portalindex++)
3185 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3188 // note: this check must match the one below or it will usually corrupt memory
3189 // 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
3190 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3193 numpoints += p->numpoints * 2;
3196 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3197 loadmodel->brush.num_portals = numportals;
3198 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3199 loadmodel->brush.num_portalpoints = numpoints;
3200 // clear all leaf portal chains
3201 for (i = 0;i < loadmodel->brush.num_leafs;i++)
3202 loadmodel->brush.data_leafs[i].portals = NULL;
3203 // process all portals in the global portal chain, while freeing them
3204 portal = loadmodel->brush.data_portals;
3205 point = loadmodel->brush.data_portalpoints;
3206 for (portalindex = 0;portalindex < portalrange;portalindex++)
3208 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3211 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3213 // note: this check must match the one above or it will usually corrupt memory
3214 // 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
3215 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3217 // first make the back to front portal(forward portal)
3218 portal->points = point;
3219 portal->numpoints = p->numpoints;
3220 portal->plane.dist = p->plane.dist;
3221 VectorCopy(p->plane.normal, portal->plane.normal);
3222 portal->here = (mleaf_t *)p->nodes[1];
3223 portal->past = (mleaf_t *)p->nodes[0];
3225 for (j = 0;j < portal->numpoints;j++)
3227 VectorCopy(p->points + j*3, point->position);
3230 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3231 PlaneClassify(&portal->plane);
3233 // link into leaf's portal chain
3234 portal->next = portal->here->portals;
3235 portal->here->portals = portal;
3237 // advance to next portal
3240 // then make the front to back portal(backward portal)
3241 portal->points = point;
3242 portal->numpoints = p->numpoints;
3243 portal->plane.dist = -p->plane.dist;
3244 VectorNegate(p->plane.normal, portal->plane.normal);
3245 portal->here = (mleaf_t *)p->nodes[0];
3246 portal->past = (mleaf_t *)p->nodes[1];
3248 for (j = portal->numpoints - 1;j >= 0;j--)
3250 VectorCopy(p->points + j*3, point->position);
3253 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3254 PlaneClassify(&portal->plane);
3256 // link into leaf's portal chain
3257 portal->next = portal->here->portals;
3258 portal->here->portals = portal;
3260 // advance to next portal
3263 // add the portal's polygon points to the leaf bounding boxes
3264 if (mod_recalculatenodeboxes.integer)
3266 for (i = 0;i < 2;i++)
3268 leaf = (mleaf_t *)p->nodes[i];
3269 for (j = 0;j < p->numpoints;j++)
3271 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3272 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3273 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3274 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3275 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3276 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3282 // now recalculate the node bounding boxes from the leafs
3283 if (mod_recalculatenodeboxes.integer)
3284 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3292 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3295 Host_Error("AddPortalToNodes: NULL front node");
3297 Host_Error("AddPortalToNodes: NULL back node");
3298 if (p->nodes[0] || p->nodes[1])
3299 Host_Error("AddPortalToNodes: already included");
3300 // 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
3302 p->nodes[0] = front;
3303 p->next[0] = (portal_t *)front->portals;
3304 front->portals = (mportal_t *)p;
3307 p->next[1] = (portal_t *)back->portals;
3308 back->portals = (mportal_t *)p;
3313 RemovePortalFromNode
3316 static void RemovePortalFromNodes(portal_t *portal)
3320 void **portalpointer;
3322 for (i = 0;i < 2;i++)
3324 node = portal->nodes[i];
3326 portalpointer = (void **) &node->portals;
3329 t = (portal_t *)*portalpointer;
3331 Host_Error("RemovePortalFromNodes: portal not in leaf");
3335 if (portal->nodes[0] == node)
3337 *portalpointer = portal->next[0];
3338 portal->nodes[0] = NULL;
3340 else if (portal->nodes[1] == node)
3342 *portalpointer = portal->next[1];
3343 portal->nodes[1] = NULL;
3346 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3350 if (t->nodes[0] == node)
3351 portalpointer = (void **) &t->next[0];
3352 else if (t->nodes[1] == node)
3353 portalpointer = (void **) &t->next[1];
3355 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3360 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3361 static double *portalpointsbuffer;
3362 static int portalpointsbufferoffset;
3363 static int portalpointsbuffersize;
3364 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3367 mnode_t *front, *back, *other_node;
3368 mplane_t clipplane, *plane;
3369 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3370 int numfrontpoints, numbackpoints;
3371 double *frontpoints, *backpoints;
3373 // if a leaf, we're done
3377 // get some space for our clipping operations to use
3378 if (portalpointsbuffersize < portalpointsbufferoffset + 6*MAX_PORTALPOINTS)
3380 portalpointsbuffersize = portalpointsbufferoffset * 2;
3381 portalpointsbuffer = (double *)Mem_Realloc(loadmodel->mempool, portalpointsbuffer, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3383 frontpoints = portalpointsbuffer + portalpointsbufferoffset;
3384 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3385 backpoints = portalpointsbuffer + portalpointsbufferoffset;
3386 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3388 plane = node->plane;
3390 front = node->children[0];
3391 back = node->children[1];
3393 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3395 // create the new portal by generating a polygon for the node plane,
3396 // and clipping it by all of the other portals(which came from nodes above this one)
3397 nodeportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3398 nodeportal->plane = *plane;
3400 // 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)
3401 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);
3402 nodeportal->numpoints = 4;
3403 side = 0; // shut up compiler warning
3404 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3406 clipplane = portal->plane;
3407 if (portal->nodes[0] == portal->nodes[1])
3408 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3409 if (portal->nodes[0] == node)
3411 else if (portal->nodes[1] == node)
3413 clipplane.dist = -clipplane.dist;
3414 VectorNegate(clipplane.normal, clipplane.normal);
3418 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3420 for (i = 0;i < nodeportal->numpoints*3;i++)
3421 frontpoints[i] = nodeportal->points[i];
3422 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);
3423 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3427 if (nodeportal->numpoints < 3)
3429 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3430 nodeportal->numpoints = 0;
3432 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3434 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3435 nodeportal->numpoints = 0;
3438 AddPortalToNodes(nodeportal, front, back);
3440 // split the portals of this node along this node's plane and assign them to the children of this node
3441 // (migrating the portals downward through the tree)
3442 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3444 if (portal->nodes[0] == portal->nodes[1])
3445 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3446 if (portal->nodes[0] == node)
3448 else if (portal->nodes[1] == node)
3451 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3452 nextportal = portal->next[side];
3453 if (!portal->numpoints)
3456 other_node = portal->nodes[!side];
3457 RemovePortalFromNodes(portal);
3459 // cut the portal into two portals, one on each side of the node plane
3460 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);
3462 if (!numfrontpoints)
3465 AddPortalToNodes(portal, back, other_node);
3467 AddPortalToNodes(portal, other_node, back);
3473 AddPortalToNodes(portal, front, other_node);
3475 AddPortalToNodes(portal, other_node, front);
3479 // the portal is split
3480 splitportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3481 temp = splitportal->chain;
3482 *splitportal = *portal;
3483 splitportal->chain = temp;
3484 for (i = 0;i < numbackpoints*3;i++)
3485 splitportal->points[i] = backpoints[i];
3486 splitportal->numpoints = numbackpoints;
3487 for (i = 0;i < numfrontpoints*3;i++)
3488 portal->points[i] = frontpoints[i];
3489 portal->numpoints = numfrontpoints;
3493 AddPortalToNodes(portal, front, other_node);
3494 AddPortalToNodes(splitportal, back, other_node);
3498 AddPortalToNodes(portal, other_node, front);
3499 AddPortalToNodes(splitportal, other_node, back);
3503 Mod_Q1BSP_RecursiveNodePortals(front);
3504 Mod_Q1BSP_RecursiveNodePortals(back);
3506 portalpointsbufferoffset -= 6*MAX_PORTALPOINTS;
3509 static void Mod_Q1BSP_MakePortals(void)
3511 Mem_ExpandableArray_NewArray(&portalarray, loadmodel->mempool, sizeof(portal_t), 1020*1024/sizeof(portal_t));
3512 portalpointsbufferoffset = 0;
3513 portalpointsbuffersize = 6*MAX_PORTALPOINTS*128;
3514 portalpointsbuffer = (double *)Mem_Alloc(loadmodel->mempool, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3515 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3516 Mem_Free(portalpointsbuffer);
3517 portalpointsbuffer = NULL;
3518 portalpointsbufferoffset = 0;
3519 portalpointsbuffersize = 0;
3520 Mod_Q1BSP_FinalizePortals();
3521 Mem_ExpandableArray_FreeArray(&portalarray);
3524 //Returns PVS data for a given point
3525 //(note: can return NULL)
3526 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3529 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3531 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3532 if (((mleaf_t *)node)->clusterindex >= 0)
3533 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3538 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)
3542 float d = PlaneDiff(org, node->plane);
3544 node = node->children[0];
3545 else if (d < -radius)
3546 node = node->children[1];
3549 // go down both sides
3550 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3551 node = node->children[1];
3554 // if this leaf is in a cluster, accumulate the pvs bits
3555 if (((mleaf_t *)node)->clusterindex >= 0)
3558 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3559 for (i = 0;i < pvsbytes;i++)
3560 pvsbuffer[i] |= pvs[i];
3564 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3565 //of the given point.
3566 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3568 int bytes = model->brush.num_pvsclusterbytes;
3569 bytes = min(bytes, pvsbufferlength);
3570 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3572 memset(pvsbuffer, 0xFF, bytes);
3576 memset(pvsbuffer, 0, bytes);
3577 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3581 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3586 VectorSubtract(inmaxs, inmins, size);
3587 if (cmodel->brush.ishlbsp)
3590 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3591 else if (size[0] <= 32)
3593 if (size[2] < 54) // pick the nearest of 36 or 72
3594 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3596 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3599 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3604 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3605 else if (size[0] <= 32)
3606 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3608 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3610 VectorCopy(inmins, outmins);
3611 VectorAdd(inmins, hull->clip_size, outmaxs);
3614 static int Mod_Q1BSP_CreateShadowMesh(dp_model_t *mod)
3617 int numshadowmeshtriangles = 0;
3618 msurface_t *surface;
3619 if (cls.state == ca_dedicated)
3621 // make a single combined shadow mesh to allow optimized shadow volume creation
3623 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3625 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3626 numshadowmeshtriangles += surface->num_triangles;
3628 mod->brush.shadowmesh = Mod_ShadowMesh_Begin(mod->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3629 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3630 if (surface->num_triangles > 0)
3631 Mod_ShadowMesh_AddMesh(mod->mempool, mod->brush.shadowmesh, NULL, NULL, NULL, mod->surfmesh.data_vertex3f, NULL, NULL, NULL, NULL, surface->num_triangles, (mod->surfmesh.data_element3i + 3 * surface->num_firsttriangle));
3632 mod->brush.shadowmesh = Mod_ShadowMesh_Finish(mod->mempool, mod->brush.shadowmesh, false, r_enableshadowvolumes.integer != 0, false);
3633 if (mod->brush.shadowmesh && mod->brush.shadowmesh->neighbor3i)
3634 Mod_BuildTriangleNeighbors(mod->brush.shadowmesh->neighbor3i, mod->brush.shadowmesh->element3i, mod->brush.shadowmesh->numtriangles);
3636 return numshadowmeshtriangles;
3639 void Mod_CollisionBIH_TraceLineAgainstSurfaces(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);
3641 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3646 float dist, modelyawradius, modelradius;
3647 msurface_t *surface;
3648 hullinfo_t hullinfo;
3649 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3650 model_brush_lightstyleinfo_t styleinfo[256];
3651 unsigned char *datapointer;
3653 mod->modeldatatypestring = "Q1BSP";
3655 mod->type = mod_brushq1;
3657 header = (dheader_t *)buffer;
3659 i = LittleLong(header->version);
3660 if (i != BSPVERSION && i != 30)
3661 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3662 mod->brush.ishlbsp = i == 30;
3664 // fill in hull info
3665 VectorClear (hullinfo.hullsizes[0][0]);
3666 VectorClear (hullinfo.hullsizes[0][1]);
3667 if (mod->brush.ishlbsp)
3669 mod->modeldatatypestring = "HLBSP";
3671 hullinfo.filehulls = 4;
3672 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3673 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3674 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3675 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3676 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3677 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3681 hullinfo.filehulls = 4;
3682 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3683 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3684 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3685 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3689 mod_base = (unsigned char*)buffer;
3690 for (i = 0; i < HEADER_LUMPS; i++)
3692 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3693 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3696 mod->soundfromcenter = true;
3697 mod->TraceBox = Mod_Q1BSP_TraceBox;
3698 mod->TraceLine = Mod_Q1BSP_TraceLineAgainstSurfaces; // LordHavoc: use the surface-hitting version of TraceLine in all cases
3699 mod->TracePoint = Mod_Q1BSP_TracePoint;
3700 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3701 mod->TraceLineAgainstSurfaces = Mod_Q1BSP_TraceLineAgainstSurfaces;
3702 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3703 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3704 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3705 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3706 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3707 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3708 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3709 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3710 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3711 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3712 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3713 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3714 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3715 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3716 mod->Draw = R_Q1BSP_Draw;
3717 mod->DrawDepth = R_Q1BSP_DrawDepth;
3718 mod->DrawDebug = R_Q1BSP_DrawDebug;
3719 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
3720 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3721 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3722 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3723 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3724 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3725 mod->DrawLight = R_Q1BSP_DrawLight;
3729 mod->brush.qw_md4sum = 0;
3730 mod->brush.qw_md4sum2 = 0;
3731 for (i = 0;i < HEADER_LUMPS;i++)
3734 if (i == LUMP_ENTITIES)
3736 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3737 mod->brush.qw_md4sum ^= LittleLong(temp);
3738 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3740 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3741 mod->brush.qw_md4sum2 ^= LittleLong(temp);
3744 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3745 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3746 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3747 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3748 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3749 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3750 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3751 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3752 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3753 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3754 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3755 // load submodels before leafs because they contain the number of vis leafs
3756 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3757 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3758 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3759 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3761 // check if the map supports transparent water rendering
3762 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3764 if (mod->brushq1.data_compressedpvs)
3765 Mem_Free(mod->brushq1.data_compressedpvs);
3766 mod->brushq1.data_compressedpvs = NULL;
3767 mod->brushq1.num_compressedpvs = 0;
3769 Mod_Q1BSP_MakeHull0();
3770 if (mod_bsp_portalize.integer)
3771 Mod_Q1BSP_MakePortals();
3773 mod->numframes = 2; // regular and alternate animation
3776 // make a single combined shadow mesh to allow optimized shadow volume creation
3777 Mod_Q1BSP_CreateShadowMesh(loadmodel);
3779 if (loadmodel->brush.numsubmodels)
3780 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3782 // LordHavoc: to clear the fog around the original quake submodel code, I
3784 // first of all, some background info on the submodels:
3785 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3786 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3787 // now the weird for loop itself:
3788 // the loop functions in an odd way, on each iteration it sets up the
3789 // current 'mod' model (which despite the confusing code IS the model of
3790 // the number i), at the end of the loop it duplicates the model to become
3791 // the next submodel, and loops back to set up the new submodel.
3793 // LordHavoc: now the explanation of my sane way (which works identically):
3794 // set up the world model, then on each submodel copy from the world model
3795 // and set up the submodel with the respective model info.
3796 totalstylesurfaces = 0;
3798 for (i = 0;i < mod->brush.numsubmodels;i++)
3800 memset(stylecounts, 0, sizeof(stylecounts));
3801 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3803 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3804 for (j = 0;j < MAXLIGHTMAPS;j++)
3805 stylecounts[surface->lightmapinfo->styles[j]]++;
3807 for (k = 0;k < 255;k++)
3811 totalstylesurfaces += stylecounts[k];
3814 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3815 for (i = 0;i < mod->brush.numsubmodels;i++)
3817 // LordHavoc: this code was originally at the end of this loop, but
3818 // has been transformed to something more readable at the start here.
3823 // duplicate the basic information
3824 dpsnprintf(name, sizeof(name), "*%i", i);
3825 mod = Mod_FindName(name, loadmodel->name);
3826 // copy the base model to this one
3828 // rename the clone back to its proper name
3829 strlcpy(mod->name, name, sizeof(mod->name));
3830 mod->brush.parentmodel = loadmodel;
3831 // textures and memory belong to the main model
3832 mod->texturepool = NULL;
3833 mod->mempool = NULL;
3834 mod->brush.GetPVS = NULL;
3835 mod->brush.FatPVS = NULL;
3836 mod->brush.BoxTouchingPVS = NULL;
3837 mod->brush.BoxTouchingLeafPVS = NULL;
3838 mod->brush.BoxTouchingVisibleLeafs = NULL;
3839 mod->brush.FindBoxClusters = NULL;
3840 mod->brush.LightPoint = NULL;
3841 mod->brush.AmbientSoundLevelsForPoint = NULL;
3844 mod->brush.submodel = i;
3846 if (loadmodel->brush.submodels)
3847 loadmodel->brush.submodels[i] = mod;
3849 bm = &mod->brushq1.submodels[i];
3851 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3852 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3854 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3855 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3858 mod->firstmodelsurface = bm->firstface;
3859 mod->nummodelsurfaces = bm->numfaces;
3861 // set node/leaf parents for this submodel
3862 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
3864 // make the model surface list (used by shadowing/lighting)
3865 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3866 Mod_MakeSortedSurfaces(mod);
3868 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3869 // (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)
3870 VectorCopy(bm->mins, mod->normalmins);
3871 VectorCopy(bm->maxs, mod->normalmaxs);
3872 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3873 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3874 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3875 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3876 modelradius = modelyawradius + modelradius * modelradius;
3877 modelyawradius = sqrt(modelyawradius);
3878 modelradius = sqrt(modelradius);
3879 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3880 mod->yawmins[2] = mod->normalmins[2];
3881 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
3882 mod->yawmaxs[2] = mod->normalmaxs[2];
3883 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3884 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3885 mod->radius = modelradius;
3886 mod->radius2 = modelradius * modelradius;
3888 // this gets altered below if sky or water is used
3889 mod->DrawSky = NULL;
3890 mod->DrawAddWaterPlanes = NULL;
3892 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3893 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3894 if (mod->nummodelsurfaces)
3896 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3897 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3899 if (j < mod->nummodelsurfaces)
3900 mod->DrawSky = R_Q1BSP_DrawSky;
3902 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3903 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
3905 if (j < mod->nummodelsurfaces)
3906 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3908 // build lightstyle update chains
3909 // (used to rapidly mark lightmapupdateflags on many surfaces
3910 // when d_lightstylevalue changes)
3911 memset(stylecounts, 0, sizeof(stylecounts));
3912 for (k = 0;k < mod->nummodelsurfaces;k++)
3914 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3915 for (j = 0;j < MAXLIGHTMAPS;j++)
3916 stylecounts[surface->lightmapinfo->styles[j]]++;
3918 mod->brushq1.num_lightstyles = 0;
3919 for (k = 0;k < 255;k++)
3923 styleinfo[mod->brushq1.num_lightstyles].style = k;
3924 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3925 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3926 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3927 remapstyles[k] = mod->brushq1.num_lightstyles;
3928 mod->brushq1.num_lightstyles++;
3931 for (k = 0;k < mod->nummodelsurfaces;k++)
3933 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3934 for (j = 0;j < MAXLIGHTMAPS;j++)
3936 if (surface->lightmapinfo->styles[j] != 255)
3938 int r = remapstyles[surface->lightmapinfo->styles[j]];
3939 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3943 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3944 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3948 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3949 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3951 //mod->brushq1.num_visleafs = bm->visleafs;
3953 // build a Bounding Interval Hierarchy for culling triangles in light rendering
3954 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
3956 if (mod_q1bsp_polygoncollisions.integer)
3958 mod->collision_bih = mod->render_bih;
3959 // point traces and contents checks still use the bsp tree
3960 mod->TraceLine = Mod_CollisionBIH_TraceLine;
3961 mod->TraceBox = Mod_CollisionBIH_TraceBox;
3962 mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
3963 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLineAgainstSurfaces;
3966 // generate VBOs and other shared data before cloning submodels
3970 Mod_Q1BSP_LoadMapBrushes();
3971 //Mod_Q1BSP_ProcessLightList();
3975 Con_DPrintf("Stats for q1bsp model \"%s\": %i faces, %i nodes, %i leafs, %i visleafs, %i visleafportals, mesh: %i vertices, %i triangles, %i surfaces\n", loadmodel->name, loadmodel->num_surfaces, loadmodel->brush.num_nodes, loadmodel->brush.num_leafs, mod->brush.num_pvsclusters, loadmodel->brush.num_portals, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->num_surfaces);
3978 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3982 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3989 in = (void *)(mod_base + l->fileofs);
3990 if (l->filelen % sizeof(*in))
3991 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3992 count = l->filelen / sizeof(*in);
3993 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3996 loadmodel->num = count;
3998 for (i = 0;i < count;i++, in++, out++)
4004 static void Mod_Q2BSP_LoadVertices(lump_t *l)
4011 in = (void *)(mod_base + l->fileofs);
4012 if (l->filelen % sizeof(*in))
4013 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4014 count = l->filelen / sizeof(*in);
4015 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4018 loadmodel->num = count;
4020 for (i = 0;i < count;i++, in++, out++)
4026 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
4033 in = (void *)(mod_base + l->fileofs);
4034 if (l->filelen % sizeof(*in))
4035 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
4036 count = l->filelen / sizeof(*in);
4037 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4040 loadmodel->num = count;
4042 for (i = 0;i < count;i++, in++, out++)
4048 static void Mod_Q2BSP_LoadNodes(lump_t *l)
4055 in = (void *)(mod_base + l->fileofs);
4056 if (l->filelen % sizeof(*in))
4057 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4058 count = l->filelen / sizeof(*in);
4059 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4062 loadmodel->num = count;
4064 for (i = 0;i < count;i++, in++, out++)
4070 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
4077 in = (void *)(mod_base + l->fileofs);
4078 if (l->filelen % sizeof(*in))
4079 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
4080 count = l->filelen / sizeof(*in);
4081 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4084 loadmodel->num = count;
4086 for (i = 0;i < count;i++, in++, out++)
4092 static void Mod_Q2BSP_LoadFaces(lump_t *l)
4099 in = (void *)(mod_base + l->fileofs);
4100 if (l->filelen % sizeof(*in))
4101 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4102 count = l->filelen / sizeof(*in);
4103 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4106 loadmodel->num = count;
4108 for (i = 0;i < count;i++, in++, out++)
4114 static void Mod_Q2BSP_LoadLighting(lump_t *l)
4121 in = (void *)(mod_base + l->fileofs);
4122 if (l->filelen % sizeof(*in))
4123 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
4124 count = l->filelen / sizeof(*in);
4125 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4128 loadmodel->num = count;
4130 for (i = 0;i < count;i++, in++, out++)
4136 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
4143 in = (void *)(mod_base + l->fileofs);
4144 if (l->filelen % sizeof(*in))
4145 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4146 count = l->filelen / sizeof(*in);
4147 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4150 loadmodel->num = count;
4152 for (i = 0;i < count;i++, in++, out++)
4158 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
4165 in = (void *)(mod_base + l->fileofs);
4166 if (l->filelen % sizeof(*in))
4167 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4168 count = l->filelen / sizeof(*in);
4169 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4172 loadmodel->num = count;
4174 for (i = 0;i < count;i++, in++, out++)
4180 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
4187 in = (void *)(mod_base + l->fileofs);
4188 if (l->filelen % sizeof(*in))
4189 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4190 count = l->filelen / sizeof(*in);
4191 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4194 loadmodel->num = count;
4196 for (i = 0;i < count;i++, in++, out++)
4202 static void Mod_Q2BSP_LoadEdges(lump_t *l)
4209 in = (void *)(mod_base + l->fileofs);
4210 if (l->filelen % sizeof(*in))
4211 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
4212 count = l->filelen / sizeof(*in);
4213 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4216 loadmodel->num = count;
4218 for (i = 0;i < count;i++, in++, out++)
4224 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
4231 in = (void *)(mod_base + l->fileofs);
4232 if (l->filelen % sizeof(*in))
4233 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
4234 count = l->filelen / sizeof(*in);
4235 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4238 loadmodel->num = count;
4240 for (i = 0;i < count;i++, in++, out++)
4246 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4253 in = (void *)(mod_base + l->fileofs);
4254 if (l->filelen % sizeof(*in))
4255 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4256 count = l->filelen / sizeof(*in);
4257 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4260 loadmodel->num = count;
4262 for (i = 0;i < count;i++, in++, out++)
4268 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4275 in = (void *)(mod_base + l->fileofs);
4276 if (l->filelen % sizeof(*in))
4277 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4278 count = l->filelen / sizeof(*in);
4279 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4282 loadmodel->num = count;
4284 for (i = 0;i < count;i++, in++, out++)
4290 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4297 in = (void *)(mod_base + l->fileofs);
4298 if (l->filelen % sizeof(*in))
4299 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4300 count = l->filelen / sizeof(*in);
4301 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4304 loadmodel->num = count;
4306 for (i = 0;i < count;i++, in++, out++)
4312 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4319 in = (void *)(mod_base + l->fileofs);
4320 if (l->filelen % sizeof(*in))
4321 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4322 count = l->filelen / sizeof(*in);
4323 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4326 loadmodel->num = count;
4328 for (i = 0;i < count;i++, in++, out++)
4334 static void Mod_Q2BSP_LoadModels(lump_t *l)
4341 in = (void *)(mod_base + l->fileofs);
4342 if (l->filelen % sizeof(*in))
4343 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4344 count = l->filelen / sizeof(*in);
4345 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4348 loadmodel->num = count;
4350 for (i = 0;i < count;i++, in++, out++)
4356 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4359 q2dheader_t *header;
4361 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4363 mod->modeldatatypestring = "Q2BSP";
4365 mod->type = mod_brushq2;
4367 header = (q2dheader_t *)buffer;
4369 i = LittleLong(header->version);
4370 if (i != Q2BSPVERSION)
4371 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4373 mod_base = (unsigned char *)header;
4375 // swap all the lumps
4376 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4377 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4379 mod->brush.qw_md4sum = 0;
4380 mod->brush.qw_md4sum2 = 0;
4381 for (i = 0;i < Q2HEADER_LUMPS;i++)
4383 if (i == Q2LUMP_ENTITIES)
4385 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4386 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4388 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4391 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4392 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4393 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4394 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4395 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4396 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4397 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4398 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4399 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4400 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4401 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4402 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4403 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4404 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4405 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4406 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4407 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4408 // LordHavoc: must go last because this makes the submodels
4409 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4412 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4413 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4415 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4418 char key[128], value[MAX_INPUTLINE];
4420 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4421 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4422 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4425 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4426 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4427 loadmodel->brush.entities[l->filelen] = 0;
4428 data = loadmodel->brush.entities;
4429 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4430 // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
4431 loadmodel->brushq3.deluxemapping = false;
4432 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4436 if (!COM_ParseToken_Simple(&data, false, false))
4438 if (com_token[0] == '}')
4439 break; // end of worldspawn
4440 if (com_token[0] == '_')
4441 strlcpy(key, com_token + 1, sizeof(key));
4443 strlcpy(key, com_token, sizeof(key));
4444 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4445 key[strlen(key)-1] = 0;
4446 if (!COM_ParseToken_Simple(&data, false, false))
4448 strlcpy(value, com_token, sizeof(value));
4449 if (!strcasecmp("gridsize", key)) // this one is case insensitive to 100% match q3map2
4451 #if _MSC_VER >= 1400
4452 #define sscanf sscanf_s
4455 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4456 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4458 VectorSet(v, 64, 64, 128);
4459 if(sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) != 3)
4460 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]);
4461 if (v[0] != 0 && v[1] != 0 && v[2] != 0)
4462 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4465 else if (!strcmp("deluxeMaps", key))
4467 if (!strcmp(com_token, "1"))
4469 loadmodel->brushq3.deluxemapping = true;
4470 loadmodel->brushq3.deluxemapping_modelspace = true;
4472 else if (!strcmp(com_token, "2"))
4474 loadmodel->brushq3.deluxemapping = true;
4475 loadmodel->brushq3.deluxemapping_modelspace = false;
4482 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4488 in = (q3dtexture_t *)(mod_base + l->fileofs);
4489 if (l->filelen % sizeof(*in))
4490 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4491 count = l->filelen / sizeof(*in);
4492 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4494 loadmodel->data_textures = out;
4495 loadmodel->num_textures = count;
4496 loadmodel->num_texturesperskin = loadmodel->num_textures;
4498 for (i = 0;i < count;i++)
4500 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4501 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4502 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4503 Mod_LoadTextureFromQ3Shader(out + i, out[i].name, true, true, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS);
4504 // restore the surfaceflags and supercontents
4505 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4506 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4510 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4516 in = (q3dplane_t *)(mod_base + l->fileofs);
4517 if (l->filelen % sizeof(*in))
4518 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4519 count = l->filelen / sizeof(*in);
4520 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4522 loadmodel->brush.data_planes = out;
4523 loadmodel->brush.num_planes = count;
4525 for (i = 0;i < count;i++, in++, out++)
4527 out->normal[0] = LittleFloat(in->normal[0]);
4528 out->normal[1] = LittleFloat(in->normal[1]);
4529 out->normal[2] = LittleFloat(in->normal[2]);
4530 out->dist = LittleFloat(in->dist);
4535 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4538 q3mbrushside_t *out;
4541 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4542 if (l->filelen % sizeof(*in))
4543 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4544 count = l->filelen / sizeof(*in);
4545 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4547 loadmodel->brush.data_brushsides = out;
4548 loadmodel->brush.num_brushsides = count;
4550 for (i = 0;i < count;i++, in++, out++)
4552 n = LittleLong(in->planeindex);
4553 if (n < 0 || n >= loadmodel->brush.num_planes)
4554 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4555 out->plane = loadmodel->brush.data_planes + n;
4556 n = LittleLong(in->textureindex);
4557 if (n < 0 || n >= loadmodel->num_textures)
4558 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4559 out->texture = loadmodel->data_textures + n;
4563 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4565 q3dbrushside_ig_t *in;
4566 q3mbrushside_t *out;
4569 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4570 if (l->filelen % sizeof(*in))
4571 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4572 count = l->filelen / sizeof(*in);
4573 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4575 loadmodel->brush.data_brushsides = out;
4576 loadmodel->brush.num_brushsides = count;
4578 for (i = 0;i < count;i++, in++, out++)
4580 n = LittleLong(in->planeindex);
4581 if (n < 0 || n >= loadmodel->brush.num_planes)
4582 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4583 out->plane = loadmodel->brush.data_planes + n;
4584 n = LittleLong(in->textureindex);
4585 if (n < 0 || n >= loadmodel->num_textures)
4586 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4587 out->texture = loadmodel->data_textures + n;
4591 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4595 int i, j, n, c, count, maxplanes, q3surfaceflags;
4596 colplanef_t *planes;
4598 in = (q3dbrush_t *)(mod_base + l->fileofs);
4599 if (l->filelen % sizeof(*in))
4600 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4601 count = l->filelen / sizeof(*in);
4602 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4604 loadmodel->brush.data_brushes = out;
4605 loadmodel->brush.num_brushes = count;
4610 for (i = 0;i < count;i++, in++, out++)
4612 n = LittleLong(in->firstbrushside);
4613 c = LittleLong(in->numbrushsides);
4614 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4615 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4616 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4617 out->numbrushsides = c;
4618 n = LittleLong(in->textureindex);
4619 if (n < 0 || n >= loadmodel->num_textures)
4620 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4621 out->texture = loadmodel->data_textures + n;
4623 // make a list of mplane_t structs to construct a colbrush from
4624 if (maxplanes < out->numbrushsides)
4626 maxplanes = out->numbrushsides;
4629 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4632 for (j = 0;j < out->numbrushsides;j++)
4634 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4635 planes[j].dist = out->firstbrushside[j].plane->dist;
4636 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4637 planes[j].texture = out->firstbrushside[j].texture;
4638 q3surfaceflags |= planes[j].q3surfaceflags;
4640 // make the colbrush from the planes
4641 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4643 // this whole loop can take a while (e.g. on redstarrepublic4)
4644 CL_KeepaliveMessage(false);
4650 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4656 in = (q3deffect_t *)(mod_base + l->fileofs);
4657 if (l->filelen % sizeof(*in))
4658 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4659 count = l->filelen / sizeof(*in);
4660 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4662 loadmodel->brushq3.data_effects = out;
4663 loadmodel->brushq3.num_effects = count;
4665 for (i = 0;i < count;i++, in++, out++)
4667 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4668 n = LittleLong(in->brushindex);
4669 if (n >= loadmodel->brush.num_brushes)
4671 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4674 out->brushindex = n;
4675 out->unknown = LittleLong(in->unknown);
4679 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4684 in = (q3dvertex_t *)(mod_base + l->fileofs);
4685 if (l->filelen % sizeof(*in))
4686 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4687 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4688 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4689 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4690 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4691 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4692 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4694 for (i = 0;i < count;i++, in++)
4696 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4697 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4698 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4699 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4700 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4701 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4702 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4703 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4704 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4705 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4706 // svector/tvector are calculated later in face loading
4707 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4708 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4709 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4710 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4711 if(in->color4ub[0] != 255 || in->color4ub[1] != 255 || in->color4ub[2] != 255)
4712 loadmodel->lit = true;
4716 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4722 in = (int *)(mod_base + l->fileofs);
4723 if (l->filelen % sizeof(int[3]))
4724 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4725 count = l->filelen / sizeof(*in);
4727 if(!loadmodel->brushq3.num_vertices)
4730 Con_Printf("Mod_Q3BSP_LoadTriangles: %s has triangles but no vertexes, broken compiler, ignoring problem\n", loadmodel->name);
4731 loadmodel->brushq3.num_triangles = 0;
4735 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4736 loadmodel->brushq3.num_triangles = count / 3;
4737 loadmodel->brushq3.data_element3i = out;
4739 for (i = 0;i < count;i++, in++, out++)
4741 *out = LittleLong(*in);
4742 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4744 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4750 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4752 q3dlightmap_t *input_pointer;
4770 int mergedrowsxcolumns;
4775 unsigned char *mergedpixels;
4776 unsigned char *mergeddeluxepixels;
4777 unsigned char *mergebuf;
4778 char mapname[MAX_QPATH];
4780 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4782 // defaults for q3bsp
4789 loadmodel->brushq3.lightmapsize = 128;
4791 if (cls.state == ca_dedicated)
4794 if(mod_q3bsp_nolightmaps.integer)
4800 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4801 if (developer_loading.integer)
4802 Con_Printf("Using internal lightmaps\n");
4803 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4804 if (l->filelen % sizeof(*input_pointer))
4805 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4806 count = l->filelen / sizeof(*input_pointer);
4807 for(i = 0; i < count; ++i)
4808 inpixels[i] = input_pointer[i].rgb;
4812 // no internal lightmaps
4813 // try external lightmaps
4814 if (developer_loading.integer)
4815 Con_Printf("Using external lightmaps\n");
4816 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4817 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false, false, NULL);
4821 // using EXTERNAL lightmaps instead
4822 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4824 Mem_Free(inpixels[0]);
4825 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4835 for(count = 1; ; ++count)
4837 inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false, false, NULL);
4838 if(!inpixels[count])
4839 break; // we got all of them
4840 if(image_width != size || image_height != size)
4842 Mem_Free(inpixels[count]);
4843 inpixels[count] = NULL;
4844 Con_Printf("Mod_Q3BSP_LoadLightmaps: mismatched lightmap size in %s - external lightmap %s/lm_%04d does not match earlier ones\n", loadmodel->name, mapname, count);
4850 loadmodel->brushq3.lightmapsize = size;
4851 loadmodel->brushq3.num_originallightmaps = count;
4853 // now check the surfaces to see if any of them index an odd numbered
4854 // lightmap, if so this is not a deluxemapped bsp file
4856 // also check what lightmaps are actually used, because q3map2 sometimes
4857 // (always?) makes an unused one at the end, which
4858 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4859 // reason when only one lightmap is used, which can throw off the
4860 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4861 // to see if the second lightmap is blank, if so it is not deluxemapped.
4862 // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
4863 // in Mod_Q3BSP_LoadEntities was failed
4864 if (!loadmodel->brushq3.deluxemapping)
4866 loadmodel->brushq3.deluxemapping = !(count & 1);
4867 loadmodel->brushq3.deluxemapping_modelspace = true;
4869 if (loadmodel->brushq3.deluxemapping)
4871 int facecount = faceslump->filelen / sizeof(q3dface_t);
4872 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4873 for (i = 0;i < facecount;i++)
4875 j = LittleLong(faces[i].lightmapindex);
4878 endlightmap = max(endlightmap, j + 1);
4879 if ((j & 1) || j + 1 >= count)
4881 loadmodel->brushq3.deluxemapping = false;
4888 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4889 // reason when only one lightmap is used, which can throw off the
4890 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4891 // to see if the second lightmap is blank, if so it is not deluxemapped.
4893 // further research has shown q3map2 sometimes creates a deluxemap and two
4894 // blank lightmaps, which must be handled properly as well
4895 if (endlightmap == 1 && count > 1)
4898 for (i = 0;i < size*size;i++)
4900 if (c[bytesperpixel*i + rgbmap[0]])
4902 if (c[bytesperpixel*i + rgbmap[1]])
4904 if (c[bytesperpixel*i + rgbmap[2]])
4909 // all pixels in the unused lightmap were black...
4910 loadmodel->brushq3.deluxemapping = false;
4915 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4917 // figure out what the most reasonable merge power is within limits
4919 // find the appropriate NxN dimensions to merge to, to avoid wasted space
4920 realcount = count >> (int)loadmodel->brushq3.deluxemapping;
4922 // figure out how big the merged texture has to be
4923 mergegoal = 128<<bound(0, mod_q3bsp_lightmapmergepower.integer, 6);
4924 mergegoal = bound(size, mergegoal, (int)vid.maxtexturesize_2d);
4925 while (mergegoal > size && mergegoal * mergegoal / 4 >= size * size * realcount)
4927 mergedwidth = mergegoal;
4928 mergedheight = mergegoal;
4929 // choose non-square size (2x1 aspect) if only half the space is used;
4930 // this really only happens when the entire set fits in one texture, if
4931 // there are multiple textures, we don't worry about shrinking the last
4932 // one to fit, because the driver prefers the same texture size on
4933 // consecutive draw calls...
4934 if (mergedwidth * mergedheight / 2 >= size*size*realcount)
4937 loadmodel->brushq3.num_lightmapmergedwidthpower = 0;
4938 loadmodel->brushq3.num_lightmapmergedheightpower = 0;
4939 while (mergedwidth > size<<loadmodel->brushq3.num_lightmapmergedwidthpower)
4940 loadmodel->brushq3.num_lightmapmergedwidthpower++;
4941 while (mergedheight > size<<loadmodel->brushq3.num_lightmapmergedheightpower)
4942 loadmodel->brushq3.num_lightmapmergedheightpower++;
4943 loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower = loadmodel->brushq3.num_lightmapmergedwidthpower + loadmodel->brushq3.num_lightmapmergedheightpower + (loadmodel->brushq3.deluxemapping ? 1 : 0);
4945 powerx = loadmodel->brushq3.num_lightmapmergedwidthpower;
4946 powery = loadmodel->brushq3.num_lightmapmergedheightpower;
4947 powerxy = powerx+powery;
4948 powerdxy = loadmodel->brushq3.deluxemapping + powerxy;
4950 mergedcolumns = 1 << powerx;
4951 mergedrows = 1 << powery;
4952 mergedrowsxcolumns = 1 << powerxy;
4954 loadmodel->brushq3.num_mergedlightmaps = (realcount + (1 << powerxy) - 1) >> powerxy;
4955 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4956 if (loadmodel->brushq3.deluxemapping)
4957 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4959 // allocate a texture pool if we need it
4960 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4961 loadmodel->texturepool = R_AllocTexturePool();
4963 mergedpixels = (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4);
4964 mergeddeluxepixels = loadmodel->brushq3.deluxemapping ? (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4) : NULL;
4965 for (i = 0;i < count;i++)
4967 // figure out which merged lightmap texture this fits into
4968 realindex = i >> (int)loadmodel->brushq3.deluxemapping;
4969 lightmapindex = i >> powerdxy;
4971 // choose the destination address
4972 mergebuf = (loadmodel->brushq3.deluxemapping && (i & 1)) ? mergeddeluxepixels : mergedpixels;
4973 mergebuf += 4 * (realindex & (mergedcolumns-1))*size + 4 * ((realindex >> powerx) & (mergedrows-1))*mergedwidth*size;
4974 if ((i & 1) == 0 || !loadmodel->brushq3.deluxemapping)
4975 Con_Printf("copying original lightmap %i (%ix%i) to %i (at %i,%i)\n", i, size, size, lightmapindex, (realindex & (mergedcolumns-1))*size, ((realindex >> powerx) & (mergedrows-1))*size);
4977 // convert pixels from RGB or BGRA while copying them into the destination rectangle
4978 for (j = 0;j < size;j++)
4979 for (k = 0;k < size;k++)
4981 mergebuf[(j*mergedwidth+k)*4+0] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[0]];
4982 mergebuf[(j*mergedwidth+k)*4+1] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[1]];
4983 mergebuf[(j*mergedwidth+k)*4+2] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[2]];
4984 mergebuf[(j*mergedwidth+k)*4+3] = 255;
4987 // upload texture if this was the last tile being written to the texture
4988 if (((realindex + 1) & (mergedrowsxcolumns - 1)) == 0 || (realindex + 1) == realcount)
4990 if (loadmodel->brushq3.deluxemapping && (i & 1))
4991 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), mergedwidth, mergedheight, mergeddeluxepixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
4993 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), mergedwidth, mergedheight, mergedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
4997 if (mergeddeluxepixels)
4998 Mem_Free(mergeddeluxepixels);
4999 Mem_Free(mergedpixels);
5002 for(i = 0; i < count; ++i)
5003 Mem_Free(inpixels[i]);
5007 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
5012 *collisionstride = stride;
5015 cnt = (num_triangles + stride - 1) / stride;
5016 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
5017 for(j = 0; j < cnt; ++j)
5019 mins = &((*collisionbbox6f)[6 * j + 0]);
5020 maxs = &((*collisionbbox6f)[6 * j + 3]);
5021 for(k = 0; k < stride; ++k)
5023 tri = j * stride + k;
5024 if(tri >= num_triangles)
5026 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
5027 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
5028 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
5029 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
5030 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
5031 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
5032 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
5033 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
5034 if(vert[0] < mins[0]) mins[0] = vert[0];
5035 if(vert[1] < mins[1]) mins[1] = vert[1];
5036 if(vert[2] < mins[2]) mins[2] = vert[2];
5037 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5038 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5039 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5040 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
5041 if(vert[0] < mins[0]) mins[0] = vert[0];
5042 if(vert[1] < mins[1]) mins[1] = vert[1];
5043 if(vert[2] < mins[2]) mins[2] = vert[2];
5044 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5045 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5046 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5051 *collisionbbox6f = NULL;
5054 typedef struct patchtess_s
5058 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
5061 float *originalvertex3f;
5064 #define PATCHTESS_SAME_LODGROUP(a,b) \
5066 (a).lodgroup[0] == (b).lodgroup[0] && \
5067 (a).lodgroup[1] == (b).lodgroup[1] && \
5068 (a).lodgroup[2] == (b).lodgroup[2] && \
5069 (a).lodgroup[3] == (b).lodgroup[3] && \
5070 (a).lodgroup[4] == (b).lodgroup[4] && \
5071 (a).lodgroup[5] == (b).lodgroup[5] \
5074 static void Mod_Q3BSP_LoadFaces(lump_t *l)
5076 q3dface_t *in, *oldin;
5077 msurface_t *out, *oldout;
5078 int i, oldi, j, n, count, invalidelements, patchsize[2], finalwidth, finalheight, xtess, ytess, finalvertices, finaltriangles, firstvertex, firstelement, type, oldnumtriangles, oldnumtriangles2, meshvertices, meshtriangles, collisionvertices, collisiontriangles, numvertices, numtriangles, cxtess, cytess;
5079 float lightmaptcbase[2], lightmaptcscale[2];
5080 //int *originalelement3i;
5081 //int *originalneighbor3i;
5082 float *originalvertex3f;
5083 //float *originalsvector3f;
5084 //float *originaltvector3f;
5085 float *originalnormal3f;
5086 float *originalcolor4f;
5087 float *originaltexcoordtexture2f;
5088 float *originaltexcoordlightmap2f;
5089 float *surfacecollisionvertex3f;
5090 int *surfacecollisionelement3i;
5092 patchtess_t *patchtess = NULL;
5093 int patchtesscount = 0;
5096 in = (q3dface_t *)(mod_base + l->fileofs);
5097 if (l->filelen % sizeof(*in))
5098 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
5099 count = l->filelen / sizeof(*in);
5100 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5102 loadmodel->data_surfaces = out;
5103 loadmodel->num_surfaces = count;
5106 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
5114 for (;i < count;i++, in++, out++)
5116 // check face type first
5117 type = LittleLong(in->type);
5118 if (type != Q3FACETYPE_FLAT
5119 && type != Q3FACETYPE_PATCH
5120 && type != Q3FACETYPE_MESH
5121 && type != Q3FACETYPE_FLARE)
5123 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
5127 n = LittleLong(in->textureindex);
5128 if (n < 0 || n >= loadmodel->num_textures)
5130 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
5133 out->texture = loadmodel->data_textures + n;
5134 n = LittleLong(in->effectindex);
5135 if (n < -1 || n >= loadmodel->brushq3.num_effects)
5137 if (developer_extra.integer)
5138 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
5144 out->effect = loadmodel->brushq3.data_effects + n;
5146 if (cls.state != ca_dedicated)
5148 out->lightmaptexture = NULL;
5149 out->deluxemaptexture = r_texture_blanknormalmap;
5150 n = LittleLong(in->lightmapindex);
5153 else if (n >= loadmodel->brushq3.num_originallightmaps)
5155 if(loadmodel->brushq3.num_originallightmaps != 0)
5156 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
5161 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5162 if (loadmodel->brushq3.deluxemapping)
5163 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5164 loadmodel->lit = true;
5168 firstvertex = LittleLong(in->firstvertex);
5169 numvertices = LittleLong(in->numvertices);
5170 firstelement = LittleLong(in->firstelement);
5171 numtriangles = LittleLong(in->numelements) / 3;
5172 if (numtriangles * 3 != LittleLong(in->numelements))
5174 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));
5177 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
5179 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);
5182 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
5184 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);
5189 case Q3FACETYPE_FLAT:
5190 case Q3FACETYPE_MESH:
5191 // no processing necessary
5193 case Q3FACETYPE_PATCH:
5194 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5195 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5196 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))
5198 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
5201 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5203 // convert patch to Q3FACETYPE_MESH
5204 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5205 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5206 // bound to user settings
5207 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
5208 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
5209 // bound to sanity settings
5210 xtess = bound(0, xtess, 1024);
5211 ytess = bound(0, ytess, 1024);
5213 // lower quality collision patches! Same procedure as before, but different cvars
5214 // convert patch to Q3FACETYPE_MESH
5215 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5216 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5217 // bound to user settings
5218 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
5219 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
5220 // bound to sanity settings
5221 cxtess = bound(0, cxtess, 1024);
5222 cytess = bound(0, cytess, 1024);
5224 // store it for the LOD grouping step
5225 patchtess[patchtesscount].info.xsize = patchsize[0];
5226 patchtess[patchtesscount].info.ysize = patchsize[1];
5227 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
5228 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
5229 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
5230 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
5232 patchtess[patchtesscount].surface_id = i;
5233 patchtess[patchtesscount].lodgroup[0] = LittleFloat(in->specific.patch.mins[0]);
5234 patchtess[patchtesscount].lodgroup[1] = LittleFloat(in->specific.patch.mins[1]);
5235 patchtess[patchtesscount].lodgroup[2] = LittleFloat(in->specific.patch.mins[2]);
5236 patchtess[patchtesscount].lodgroup[3] = LittleFloat(in->specific.patch.maxs[0]);
5237 patchtess[patchtesscount].lodgroup[4] = LittleFloat(in->specific.patch.maxs[1]);
5238 patchtess[patchtesscount].lodgroup[5] = LittleFloat(in->specific.patch.maxs[2]);
5239 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
5242 case Q3FACETYPE_FLARE:
5243 if (developer_extra.integer)
5244 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
5248 out->num_vertices = numvertices;
5249 out->num_triangles = numtriangles;
5250 meshvertices += out->num_vertices;
5251 meshtriangles += out->num_triangles;
5254 // Fix patches tesselations so that they make no seams
5258 for(i = 0; i < patchtesscount; ++i)
5260 for(j = i+1; j < patchtesscount; ++j)
5262 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
5265 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
5272 // Calculate resulting number of triangles
5273 collisionvertices = 0;
5274 collisiontriangles = 0;
5275 for(i = 0; i < patchtesscount; ++i)
5277 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
5278 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
5279 numvertices = finalwidth * finalheight;
5280 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5282 oldout[patchtess[i].surface_id].num_vertices = numvertices;
5283 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
5284 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
5285 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
5287 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_COLLISION].xtess);
5288 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_COLLISION].ytess);
5289 numvertices = finalwidth * finalheight;
5290 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5292 oldout[patchtess[i].surface_id].num_collisionvertices = numvertices;
5293 oldout[patchtess[i].surface_id].num_collisiontriangles = numtriangles;
5294 collisionvertices += oldout[patchtess[i].surface_id].num_collisionvertices;
5295 collisiontriangles += oldout[patchtess[i].surface_id].num_collisiontriangles;
5301 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
5302 if (collisiontriangles)
5304 loadmodel->brush.data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, collisionvertices * sizeof(float[3]));
5305 loadmodel->brush.data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, collisiontriangles * sizeof(int[3]));
5309 collisionvertices = 0;
5310 collisiontriangles = 0;
5311 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
5313 if (out->num_vertices < 3 || out->num_triangles < 1)
5316 type = LittleLong(in->type);
5317 firstvertex = LittleLong(in->firstvertex);
5318 firstelement = LittleLong(in->firstelement);
5319 out->num_firstvertex = meshvertices;
5320 out->num_firsttriangle = meshtriangles;
5321 out->num_firstcollisiontriangle = collisiontriangles;
5324 case Q3FACETYPE_FLAT:
5325 case Q3FACETYPE_MESH:
5326 // no processing necessary, except for lightmap merging
5327 for (j = 0;j < out->num_vertices;j++)
5329 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5330 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5331 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5332 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5333 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5334 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5335 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5336 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5337 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5338 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5339 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5340 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5341 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5342 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5344 for (j = 0;j < out->num_triangles*3;j++)
5345 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5347 case Q3FACETYPE_PATCH:
5348 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5349 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5350 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5351 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5352 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5353 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5354 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5356 xtess = ytess = cxtess = cytess = -1;
5357 for(j = 0; j < patchtesscount; ++j)
5358 if(patchtess[j].surface_id == i)
5360 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5361 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5362 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5363 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5368 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5369 xtess = ytess = cxtess = cytess = 0;
5372 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5373 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5374 finalvertices = finalwidth * finalheight;
5375 oldnumtriangles = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5376 type = Q3FACETYPE_MESH;
5377 // generate geometry
5378 // (note: normals are skipped because they get recalculated)
5379 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5380 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5381 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5382 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5383 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5384 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5386 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);
5388 if (developer_extra.integer)
5390 if (out->num_triangles < finaltriangles)
5391 Con_DPrintf("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);
5393 Con_DPrintf("Mod_Q3BSP_LoadFaces: %ix%i curve subdivided to %i vertices / %i triangles\n", patchsize[0], patchsize[1], out->num_vertices, out->num_triangles);
5395 // q3map does not put in collision brushes for curves... ugh
5396 // build the lower quality collision geometry
5397 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5398 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5399 finalvertices = finalwidth * finalheight;
5400 oldnumtriangles2 = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5402 // legacy collision geometry implementation
5403 out->deprecatedq3data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5404 out->deprecatedq3data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5405 out->num_collisionvertices = finalvertices;
5406 out->num_collisiontriangles = finaltriangles;
5407 Q3PatchTesselateFloat(3, sizeof(float[3]), out->deprecatedq3data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5408 Q3PatchTriangleElements(out->deprecatedq3data_collisionelement3i, finalwidth, finalheight, 0);
5410 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5411 Mod_SnapVertices(3, finalvertices, out->deprecatedq3data_collisionvertex3f, 1);
5413 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionvertex3f);
5415 // now optimize the collision mesh by finding triangle bboxes...
5416 Mod_Q3BSP_BuildBBoxes(out->deprecatedq3data_collisionelement3i, out->num_collisiontriangles, out->deprecatedq3data_collisionvertex3f, &out->deprecatedq3data_collisionbbox6f, &out->deprecatedq3num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5417 Mod_Q3BSP_BuildBBoxes(loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle, out->num_triangles, loadmodel->surfmesh.data_vertex3f, &out->deprecatedq3data_bbox6f, &out->deprecatedq3num_bboxstride, mod_q3bsp_curves_stride.integer);
5419 // store collision geometry for BIH collision tree
5420 surfacecollisionvertex3f = loadmodel->brush.data_collisionvertex3f + collisionvertices * 3;
5421 surfacecollisionelement3i = loadmodel->brush.data_collisionelement3i + collisiontriangles * 3;
5422 Q3PatchTesselateFloat(3, sizeof(float[3]), surfacecollisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5423 Q3PatchTriangleElements(surfacecollisionelement3i, finalwidth, finalheight, collisionvertices);
5424 Mod_SnapVertices(3, finalvertices, surfacecollisionvertex3f, 1);
5426 // remove this once the legacy code is removed
5428 int nc = out->num_collisiontriangles;
5430 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, surfacecollisionelement3i, surfacecollisionelement3i, loadmodel->brush.data_collisionvertex3f);
5432 if(nc != out->num_collisiontriangles)
5434 Con_Printf("number of collision triangles differs between BIH and BSP. FAIL.\n");
5439 if (developer_extra.integer)
5440 Con_DPrintf("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);
5442 collisionvertices += finalvertices;
5443 collisiontriangles += out->num_collisiontriangles;
5448 meshvertices += out->num_vertices;
5449 meshtriangles += out->num_triangles;
5450 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5451 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)
5453 if (invalidelements)
5455 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);
5456 for (j = 0;j < out->num_triangles * 3;j++)
5458 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5459 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)
5460 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5464 // calculate a bounding box
5465 VectorClear(out->mins);
5466 VectorClear(out->maxs);
5467 if (out->num_vertices)
5469 if (cls.state != ca_dedicated && out->lightmaptexture)
5471 // figure out which part of the merged lightmap this fits into
5472 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5473 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5474 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5475 lightmapindex &= mergewidth * mergeheight - 1;
5476 lightmaptcscale[0] = 1.0f / mergewidth;
5477 lightmaptcscale[1] = 1.0f / mergeheight;
5478 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5479 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5480 // modify the lightmap texcoords to match this region of the merged lightmap
5481 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5483 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5484 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5487 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5488 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5489 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5491 out->mins[0] = min(out->mins[0], v[0]);
5492 out->maxs[0] = max(out->maxs[0], v[0]);
5493 out->mins[1] = min(out->mins[1], v[1]);
5494 out->maxs[1] = max(out->maxs[1], v[1]);
5495 out->mins[2] = min(out->mins[2], v[2]);
5496 out->maxs[2] = max(out->maxs[2], v[2]);
5498 out->mins[0] -= 1.0f;
5499 out->mins[1] -= 1.0f;
5500 out->mins[2] -= 1.0f;
5501 out->maxs[0] += 1.0f;
5502 out->maxs[1] += 1.0f;
5503 out->maxs[2] += 1.0f;
5505 // set lightmap styles for consistency with q1bsp
5506 //out->lightmapinfo->styles[0] = 0;
5507 //out->lightmapinfo->styles[1] = 255;
5508 //out->lightmapinfo->styles[2] = 255;
5509 //out->lightmapinfo->styles[3] = 255;
5514 for (;i < count;i++, out++)
5516 if(out->num_vertices && out->num_triangles)
5518 if(out->num_vertices == 0)
5520 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no vertices, ignoring\n", i, out->texture ? out->texture->name : "(none)");
5521 if(out->num_triangles == 0)
5522 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no triangles, ignoring\n", i, out->texture ? out->texture->name : "(none)");
5524 else if(out->num_triangles == 0)
5525 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s, near %f %f %f) has no triangles, ignoring\n", i, out->texture ? out->texture->name : "(none)",
5526 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[0 * 3 + 0],
5527 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[1 * 3 + 0],
5528 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[2 * 3 + 0]);
5531 // for per pixel lighting
5532 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, r_smoothnormals_areaweighting.integer != 0);
5534 // generate ushort elements array if possible
5535 if (loadmodel->surfmesh.data_element3s)
5536 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5537 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5539 // free the no longer needed vertex data
5540 loadmodel->brushq3.num_vertices = 0;
5541 if (loadmodel->brushq3.data_vertex3f)
5542 Mem_Free(loadmodel->brushq3.data_vertex3f);
5543 loadmodel->brushq3.data_vertex3f = NULL;
5544 loadmodel->brushq3.data_normal3f = NULL;
5545 loadmodel->brushq3.data_texcoordtexture2f = NULL;
5546 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5547 loadmodel->brushq3.data_color4f = NULL;
5548 // free the no longer needed triangle data
5549 loadmodel->brushq3.num_triangles = 0;
5550 if (loadmodel->brushq3.data_element3i)
5551 Mem_Free(loadmodel->brushq3.data_element3i);
5552 loadmodel->brushq3.data_element3i = NULL;
5555 Mem_Free(patchtess);
5558 static void Mod_Q3BSP_LoadModels(lump_t *l)
5562 int i, j, n, c, count;
5564 in = (q3dmodel_t *)(mod_base + l->fileofs);
5565 if (l->filelen % sizeof(*in))
5566 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5567 count = l->filelen / sizeof(*in);
5568 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5570 loadmodel->brushq3.data_models = out;
5571 loadmodel->brushq3.num_models = count;
5573 for (i = 0;i < count;i++, in++, out++)
5575 for (j = 0;j < 3;j++)
5577 out->mins[j] = LittleFloat(in->mins[j]);
5578 out->maxs[j] = LittleFloat(in->maxs[j]);
5580 n = LittleLong(in->firstface);
5581 c = LittleLong(in->numfaces);
5582 if (n < 0 || n + c > loadmodel->num_surfaces)
5583 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5586 n = LittleLong(in->firstbrush);
5587 c = LittleLong(in->numbrushes);
5588 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5589 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5590 out->firstbrush = n;
5591 out->numbrushes = c;
5595 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5601 in = (int *)(mod_base + l->fileofs);
5602 if (l->filelen % sizeof(*in))
5603 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5604 count = l->filelen / sizeof(*in);
5605 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5607 loadmodel->brush.data_leafbrushes = out;
5608 loadmodel->brush.num_leafbrushes = count;
5610 for (i = 0;i < count;i++, in++, out++)
5612 n = LittleLong(*in);
5613 if (n < 0 || n >= loadmodel->brush.num_brushes)
5614 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5619 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5625 in = (int *)(mod_base + l->fileofs);
5626 if (l->filelen % sizeof(*in))
5627 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5628 count = l->filelen / sizeof(*in);
5629 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5631 loadmodel->brush.data_leafsurfaces = out;
5632 loadmodel->brush.num_leafsurfaces = count;
5634 for (i = 0;i < count;i++, in++, out++)
5636 n = LittleLong(*in);
5637 if (n < 0 || n >= loadmodel->num_surfaces)
5638 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5643 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5647 int i, j, n, c, count;
5649 in = (q3dleaf_t *)(mod_base + l->fileofs);
5650 if (l->filelen % sizeof(*in))
5651 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5652 count = l->filelen / sizeof(*in);
5653 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5655 loadmodel->brush.data_leafs = out;
5656 loadmodel->brush.num_leafs = count;
5658 for (i = 0;i < count;i++, in++, out++)
5662 out->clusterindex = LittleLong(in->clusterindex);
5663 out->areaindex = LittleLong(in->areaindex);
5664 for (j = 0;j < 3;j++)
5666 // yes the mins/maxs are ints
5667 out->mins[j] = LittleLong(in->mins[j]) - 1;
5668 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5670 n = LittleLong(in->firstleafface);
5671 c = LittleLong(in->numleaffaces);
5672 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5673 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5674 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5675 out->numleafsurfaces = c;
5676 n = LittleLong(in->firstleafbrush);
5677 c = LittleLong(in->numleafbrushes);
5678 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5679 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5680 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5681 out->numleafbrushes = c;
5685 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5691 in = (q3dnode_t *)(mod_base + l->fileofs);
5692 if (l->filelen % sizeof(*in))
5693 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5694 count = l->filelen / sizeof(*in);
5696 Host_Error("Mod_Q3BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
5697 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5699 loadmodel->brush.data_nodes = out;
5700 loadmodel->brush.num_nodes = count;
5702 for (i = 0;i < count;i++, in++, out++)
5705 n = LittleLong(in->planeindex);
5706 if (n < 0 || n >= loadmodel->brush.num_planes)
5707 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5708 out->plane = loadmodel->brush.data_planes + n;
5709 for (j = 0;j < 2;j++)
5711 n = LittleLong(in->childrenindex[j]);
5714 if (n >= loadmodel->brush.num_nodes)
5715 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5716 out->children[j] = loadmodel->brush.data_nodes + n;
5721 if (n >= loadmodel->brush.num_leafs)
5722 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5723 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5726 for (j = 0;j < 3;j++)
5728 // yes the mins/maxs are ints
5729 out->mins[j] = LittleLong(in->mins[j]) - 1;
5730 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5734 // set the parent pointers
5735 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5738 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5741 q3dlightgrid_t *out;
5744 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5745 if (l->filelen % sizeof(*in))
5746 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5747 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5748 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5749 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5750 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5751 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5752 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5753 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5754 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5755 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5756 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5757 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5758 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5759 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5760 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]);
5761 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]);
5763 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5766 if (l->filelen < count * (int)sizeof(*in))
5768 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]);
5769 return; // ignore the grid if we cannot understand it
5771 if (l->filelen != count * (int)sizeof(*in))
5772 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5773 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5774 loadmodel->brushq3.data_lightgrid = out;
5775 loadmodel->brushq3.num_lightgrid = count;
5776 // no swapping or validation necessary
5777 memcpy(out, in, count * (int)sizeof(*out));
5781 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5786 if (l->filelen == 0)
5789 // unvised maps often have cluster indices even without pvs, so check
5790 // leafs to find real number of clusters
5791 loadmodel->brush.num_pvsclusters = 1;
5792 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5793 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5796 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5797 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5798 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5799 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5803 in = (q3dpvs_t *)(mod_base + l->fileofs);
5805 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5807 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5808 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5809 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5810 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5811 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5812 if (l->filelen < totalchains + (int)sizeof(*in))
5813 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);
5815 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5816 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5819 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5821 int i, j, k, index[3];
5822 float transformed[3], blend1, blend2, blend, stylescale = 1;
5823 q3dlightgrid_t *a, *s;
5825 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5826 switch(vid.renderpath)
5828 case RENDERPATH_GL20:
5829 case RENDERPATH_D3D9:
5830 case RENDERPATH_D3D10:
5831 case RENDERPATH_D3D11:
5832 case RENDERPATH_SOFT:
5833 case RENDERPATH_GLES2:
5834 // LordHavoc: FIXME: is this true?
5835 stylescale = 1; // added while render
5837 case RENDERPATH_GL11:
5838 case RENDERPATH_GL13:
5839 stylescale = r_refdef.scene.rtlightstylevalue[0];
5843 if (!model->brushq3.num_lightgrid)
5845 ambientcolor[0] = stylescale;
5846 ambientcolor[1] = stylescale;
5847 ambientcolor[2] = stylescale;
5851 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5852 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5853 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5854 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5855 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5856 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5857 index[0] = (int)floor(transformed[0]);
5858 index[1] = (int)floor(transformed[1]);
5859 index[2] = (int)floor(transformed[2]);
5860 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5862 // now lerp the values
5863 VectorClear(diffusenormal);
5864 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5865 for (k = 0;k < 2;k++)
5867 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5868 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5870 for (j = 0;j < 2;j++)
5872 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5873 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5875 for (i = 0;i < 2;i++)
5877 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5878 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5880 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5881 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5882 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5883 // this uses the mod_md3_sin table because the values are
5884 // already in the 0-255 range, the 64+ bias fetches a cosine
5885 // instead of a sine value
5886 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5887 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5888 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5889 //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)));
5894 // normalize the light direction before turning
5895 VectorNormalize(diffusenormal);
5896 //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]);
5899 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
5902 double midf, mid[3];
5908 // find the point distances
5909 mplane_t *plane = node->plane;
5910 if (plane->type < 3)
5912 t1 = p1[plane->type] - plane->dist;
5913 t2 = p2[plane->type] - plane->dist;
5917 t1 = DotProduct (plane->normal, p1) - plane->dist;
5918 t2 = DotProduct (plane->normal, p2) - plane->dist;
5925 node = node->children[1];
5934 node = node->children[0];
5940 midf = t1 / (t1 - t2);
5941 VectorLerp(p1, midf, p2, mid);
5943 // recurse both sides, front side first
5944 // return 2 if empty is followed by solid (hit something)
5945 // do not return 2 if both are solid or both empty,
5946 // or if start is solid and end is empty
5947 // as these degenerate cases usually indicate the eye is in solid and
5948 // should see the target point anyway
5949 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
5952 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
5957 return ((mleaf_t *)node)->clusterindex < 0;
5960 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
5962 if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
5965 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
5966 return trace.fraction == 1;
5970 double tracestart[3], traceend[3];
5971 VectorCopy(start, tracestart);
5972 VectorCopy(end, traceend);
5973 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
5977 void Mod_CollisionBIH_TracePoint(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
5980 const bih_leaf_t *leaf;
5981 const bih_node_t *node;
5982 const colbrushf_t *brush;
5985 int nodestackpos = 0;
5986 int nodestack[1024];
5988 memset(trace, 0, sizeof(*trace));
5989 trace->fraction = 1;
5990 trace->realfraction = 1;
5991 trace->hitsupercontentsmask = hitsupercontentsmask;
5993 bih = &model->collision_bih;
5997 nodenum = bih->rootnode;
5998 nodestack[nodestackpos++] = nodenum;
5999 while (nodestackpos)
6001 nodenum = nodestack[--nodestackpos];
6002 node = bih->nodes + nodenum;
6004 if (!BoxesOverlap(start, start, node->mins, node->maxs))
6007 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6009 axis = node->type - BIH_SPLITX;
6010 if (start[axis] >= node->frontmin)
6011 nodestack[nodestackpos++] = node->front;
6012 if (start[axis] <= node->backmax)
6013 nodestack[nodestackpos++] = node->back;
6015 else if (node->type == BIH_UNORDERED)
6017 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6019 leaf = bih->leafs + node->children[axis];
6021 if (!BoxesOverlap(start, start, leaf->mins, leaf->maxs))
6027 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6028 Collision_TracePointBrushFloat(trace, start, brush);
6030 case BIH_COLLISIONTRIANGLE:
6031 // collision triangle - skipped because they have no volume
6033 case BIH_RENDERTRIANGLE:
6034 // render triangle - skipped because they have no volume
6042 void Mod_CollisionBIH_TraceLineShared(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, const bih_t *bih)
6044 const bih_leaf_t *leaf;
6045 const bih_node_t *node;
6046 const colbrushf_t *brush;
6048 const texture_t *texture;
6049 vec3_t nodebigmins, nodebigmaxs, nodestart, nodeend, sweepnodemins, sweepnodemaxs;
6050 vec_t d1, d2, d3, d4, f, nodestackline[1024][6];
6051 int axis, nodenum, nodestackpos = 0, nodestack[1024];
6056 if (VectorCompare(start, end))
6058 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6062 nodenum = bih->rootnode;
6064 memset(trace, 0, sizeof(*trace));
6065 trace->fraction = 1;
6066 trace->realfraction = 1;
6067 trace->hitsupercontentsmask = hitsupercontentsmask;
6070 nodestackline[nodestackpos][0] = start[0];
6071 nodestackline[nodestackpos][1] = start[1];
6072 nodestackline[nodestackpos][2] = start[2];
6073 nodestackline[nodestackpos][3] = end[0];
6074 nodestackline[nodestackpos][4] = end[1];
6075 nodestackline[nodestackpos][5] = end[2];
6076 nodestack[nodestackpos++] = nodenum;
6077 while (nodestackpos)
6079 nodenum = nodestack[--nodestackpos];
6080 node = bih->nodes + nodenum;
6081 VectorCopy(nodestackline[nodestackpos], nodestart);
6082 VectorCopy(nodestackline[nodestackpos] + 3, nodeend);
6083 sweepnodemins[0] = min(nodestart[0], nodeend[0]); sweepnodemins[1] = min(nodestart[1], nodeend[1]); sweepnodemins[2] = min(nodestart[2], nodeend[2]); sweepnodemaxs[0] = max(nodestart[0], nodeend[0]); sweepnodemaxs[1] = max(nodestart[1], nodeend[1]); sweepnodemaxs[2] = max(nodestart[2], nodeend[2]);
6084 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs))
6086 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6088 // recurse children of the split
6089 axis = node->type - BIH_SPLITX;
6090 d1 = node->backmax - nodestart[axis];
6091 d2 = node->backmax - nodeend[axis];
6092 d3 = nodestart[axis] - node->frontmin;
6093 d4 = nodeend[axis] - node->frontmin;
6094 switch((d1 < 0) | ((d2 < 0) << 1) | ((d3 < 0) << 2) | ((d4 < 0) << 3))
6096 case 0: /* >>>> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6097 case 1: /* <>>> */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6098 case 2: /* ><>> */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6099 case 3: /* <<>> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6100 case 4: /* >><> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6101 case 5: /* <><> */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6102 case 6: /* ><<> */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6103 case 7: /* <<<> */ f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6104 case 8: /* >>>< */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6105 case 9: /* <>>< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6106 case 10: /* ><>< */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6107 case 11: /* <<>< */ f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6108 case 12: /* >><< */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6109 case 13: /* <><< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6110 case 14: /* ><<< */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6111 case 15: /* <<<< */ break;
6114 else if (node->type == BIH_UNORDERED)
6116 // calculate sweep bounds for this node
6117 // copy node bounds into local variables
6118 VectorCopy(node->mins, nodebigmins);
6119 VectorCopy(node->maxs, nodebigmaxs);
6120 // clip line to this node bounds
6121 axis = 0; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6122 axis = 1; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6123 axis = 2; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6124 // some of the line intersected the enlarged node box
6125 // calculate sweep bounds for this node
6126 sweepnodemins[0] = min(nodestart[0], nodeend[0]); sweepnodemins[1] = min(nodestart[1], nodeend[1]); sweepnodemins[2] = min(nodestart[2], nodeend[2]); sweepnodemaxs[0] = max(nodestart[0], nodeend[0]); sweepnodemaxs[1] = max(nodestart[1], nodeend[1]); sweepnodemaxs[2] = max(nodestart[2], nodeend[2]);
6127 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6129 leaf = bih->leafs + node->children[axis];
6130 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, leaf->mins, leaf->maxs))
6135 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6136 Collision_TraceLineBrushFloat(trace, start, end, brush, brush);
6138 case BIH_COLLISIONTRIANGLE:
6139 if (!mod_q3bsp_curves_collisions.integer)
6141 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6142 texture = model->data_textures + leaf->textureindex;
6143 Collision_TraceLineTriangleFloat(trace, start, end, model->brush.data_collisionvertex3f + e[0] * 3, model->brush.data_collisionvertex3f + e[1] * 3, model->brush.data_collisionvertex3f + e[2] * 3, texture->supercontents, texture->surfaceflags, texture);
6145 case BIH_RENDERTRIANGLE:
6146 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6147 texture = model->data_textures + leaf->textureindex;
6148 Collision_TraceLineTriangleFloat(trace, start, end, model->surfmesh.data_vertex3f + e[0] * 3, model->surfmesh.data_vertex3f + e[1] * 3, model->surfmesh.data_vertex3f + e[2] * 3, texture->supercontents, texture->surfaceflags, texture);
6156 void Mod_CollisionBIH_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)
6158 if (VectorCompare(start, end))
6160 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6163 Mod_CollisionBIH_TraceLineShared(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, &model->collision_bih);
6166 void Mod_CollisionBIH_TraceBrush(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, colbrushf_t *thisbrush_start, colbrushf_t *thisbrush_end, int hitsupercontentsmask)
6169 const bih_leaf_t *leaf;
6170 const bih_node_t *node;
6171 const colbrushf_t *brush;
6173 const texture_t *texture;
6174 vec3_t start, end, startmins, startmaxs, endmins, endmaxs, mins, maxs;
6175 vec3_t nodebigmins, nodebigmaxs, nodestart, nodeend, sweepnodemins, sweepnodemaxs;
6176 vec_t d1, d2, d3, d4, f, nodestackline[1024][6];
6177 int axis, nodenum, nodestackpos = 0, nodestack[1024];
6179 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(thisbrush_start->mins, thisbrush_start->maxs) && VectorCompare(thisbrush_end->mins, thisbrush_end->maxs))
6181 if (VectorCompare(thisbrush_start->mins, thisbrush_end->mins))
6182 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, thisbrush_start->mins, hitsupercontentsmask);
6184 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, thisbrush_start->mins, thisbrush_end->mins, hitsupercontentsmask);
6188 bih = &model->collision_bih;
6191 nodenum = bih->rootnode;
6193 // box trace, performed as brush trace
6194 memset(trace, 0, sizeof(*trace));
6195 trace->fraction = 1;
6196 trace->realfraction = 1;
6197 trace->hitsupercontentsmask = hitsupercontentsmask;
6199 // calculate tracebox-like parameters for efficient culling
6200 VectorMAM(0.5f, thisbrush_start->mins, 0.5f, thisbrush_start->maxs, start);
6201 VectorMAM(0.5f, thisbrush_end->mins, 0.5f, thisbrush_end->maxs, end);
6202 VectorSubtract(thisbrush_start->mins, start, startmins);
6203 VectorSubtract(thisbrush_start->maxs, start, startmaxs);
6204 VectorSubtract(thisbrush_end->mins, end, endmins);
6205 VectorSubtract(thisbrush_end->maxs, end, endmaxs);
6206 mins[0] = min(startmins[0], endmins[0]);
6207 mins[1] = min(startmins[1], endmins[1]);
6208 mins[2] = min(startmins[2], endmins[2]);
6209 maxs[0] = max(startmaxs[0], endmaxs[0]);
6210 maxs[1] = max(startmaxs[1], endmaxs[1]);
6211 maxs[2] = max(startmaxs[2], endmaxs[2]);
6214 nodestackline[nodestackpos][0] = start[0];
6215 nodestackline[nodestackpos][1] = start[1];
6216 nodestackline[nodestackpos][2] = start[2];
6217 nodestackline[nodestackpos][3] = end[0];
6218 nodestackline[nodestackpos][4] = end[1];
6219 nodestackline[nodestackpos][5] = end[2];
6220 nodestack[nodestackpos++] = nodenum;
6221 while (nodestackpos)
6223 nodenum = nodestack[--nodestackpos];
6224 node = bih->nodes + nodenum;
6225 VectorCopy(nodestackline[nodestackpos], nodestart);
6226 VectorCopy(nodestackline[nodestackpos] + 3, nodeend);
6227 sweepnodemins[0] = min(nodestart[0], nodeend[0]) + mins[0]; sweepnodemins[1] = min(nodestart[1], nodeend[1]) + mins[1]; sweepnodemins[2] = min(nodestart[2], nodeend[2]) + mins[2]; sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + maxs[0]; sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + maxs[1]; sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + maxs[2];
6228 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs))
6230 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6232 // recurse children of the split
6233 axis = node->type - BIH_SPLITX;
6234 d1 = node->backmax - nodestart[axis] - mins[axis];
6235 d2 = node->backmax - nodeend[axis] - mins[axis];
6236 d3 = nodestart[axis] - node->frontmin + maxs[axis];
6237 d4 = nodeend[axis] - node->frontmin + maxs[axis];
6238 switch((d1 < 0) | ((d2 < 0) << 1) | ((d3 < 0) << 2) | ((d4 < 0) << 3))
6240 case 0: /* >>>> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6241 case 1: /* <>>> */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6242 case 2: /* ><>> */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6243 case 3: /* <<>> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6244 case 4: /* >><> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6245 case 5: /* <><> */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6246 case 6: /* ><<> */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6247 case 7: /* <<<> */ f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6248 case 8: /* >>>< */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6249 case 9: /* <>>< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6250 case 10: /* ><>< */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6251 case 11: /* <<>< */ f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6252 case 12: /* >><< */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6253 case 13: /* <><< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6254 case 14: /* ><<< */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6255 case 15: /* <<<< */ break;
6258 else if (node->type == BIH_UNORDERED)
6260 // calculate sweep bounds for this node
6261 // copy node bounds into local variables and expand to get Minkowski Sum of the two shapes
6262 VectorSubtract(node->mins, maxs, nodebigmins);
6263 VectorSubtract(node->maxs, mins, nodebigmaxs);
6264 // clip line to this node bounds
6265 axis = 0; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6266 axis = 1; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6267 axis = 2; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6268 // some of the line intersected the enlarged node box
6269 // calculate sweep bounds for this node
6270 sweepnodemins[0] = min(nodestart[0], nodeend[0]) + mins[0]; sweepnodemins[1] = min(nodestart[1], nodeend[1]) + mins[1]; sweepnodemins[2] = min(nodestart[2], nodeend[2]) + mins[2]; sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + maxs[0]; sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + maxs[1]; sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + maxs[2];
6271 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6273 leaf = bih->leafs + node->children[axis];
6274 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, leaf->mins, leaf->maxs))
6279 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6280 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6282 case BIH_COLLISIONTRIANGLE:
6283 if (!mod_q3bsp_curves_collisions.integer)
6285 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6286 texture = model->data_textures + leaf->textureindex;
6287 Collision_TraceBrushTriangleFloat(trace, thisbrush_start, thisbrush_end, model->brush.data_collisionvertex3f + e[0] * 3, model->brush.data_collisionvertex3f + e[1] * 3, model->brush.data_collisionvertex3f + e[2] * 3, texture->supercontents, texture->surfaceflags, texture);
6289 case BIH_RENDERTRIANGLE:
6290 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6291 texture = model->data_textures + leaf->textureindex;
6292 Collision_TraceBrushTriangleFloat(trace, thisbrush_start, thisbrush_end, model->surfmesh.data_vertex3f + e[0] * 3, model->surfmesh.data_vertex3f + e[1] * 3, model->surfmesh.data_vertex3f + e[2] * 3, texture->supercontents, texture->surfaceflags, texture);
6300 void Mod_CollisionBIH_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)
6302 colboxbrushf_t thisbrush_start, thisbrush_end;
6303 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6305 // box trace, performed as brush trace
6306 VectorAdd(start, boxmins, boxstartmins);
6307 VectorAdd(start, boxmaxs, boxstartmaxs);
6308 VectorAdd(end, boxmins, boxendmins);
6309 VectorAdd(end, boxmaxs, boxendmaxs);
6310 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6311 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6312 Mod_CollisionBIH_TraceBrush(model, frameblend, skeleton, trace, &thisbrush_start.brush, &thisbrush_end.brush, hitsupercontentsmask);
6316 int Mod_CollisionBIH_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6319 Mod_CollisionBIH_TracePoint(model, NULL, NULL, &trace, point, 0);
6320 return trace.startsupercontents;
6323 void Mod_CollisionBIH_TracePoint_Mesh(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, int hitsupercontentsmask)
6326 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6328 int hitsupercontents;
6329 VectorSet(end, start[0], start[1], model->normalmins[2]);
6331 memset(trace, 0, sizeof(*trace));
6332 trace->fraction = 1;
6333 trace->realfraction = 1;
6334 trace->hitsupercontentsmask = hitsupercontentsmask;
6336 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
6337 hitsupercontents = trace->hitsupercontents;
6338 memset(trace, 0, sizeof(*trace));
6339 trace->fraction = 1;
6340 trace->realfraction = 1;
6341 trace->hitsupercontentsmask = hitsupercontentsmask;
6342 trace->startsupercontents = hitsupercontents;
6346 int Mod_CollisionBIH_PointSuperContents_Mesh(struct model_s *model, int frame, const vec3_t start)
6349 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6352 VectorSet(end, start[0], start[1], model->normalmins[2]);
6353 memset(&trace, 0, sizeof(trace));
6355 trace.realfraction = 1;
6356 trace.hitsupercontentsmask = 0;
6357 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
6358 return trace.hitsupercontents;
6364 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
6369 // find which leaf the point is in
6371 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
6372 // point trace the brushes
6373 leaf = (mleaf_t *)node;
6374 for (i = 0;i < leaf->numleafbrushes;i++)
6376 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6377 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
6379 brush->markframe = markframe;
6380 Collision_TracePointBrushFloat(trace, point, brush);
6383 // can't do point traces on curves (they have no thickness)
6386 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)
6388 int i, startside, endside;
6389 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
6391 msurface_t *surface;
6394 // walk the tree until we hit a leaf, recursing for any split cases
6398 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6400 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[0], start, end, startfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6401 node = node->children[1];
6403 // abort if this part of the bsp tree can not be hit by this trace
6404 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6406 plane = node->plane;
6407 // axial planes are much more common than non-axial, so an optimized
6408 // axial case pays off here
6409 if (plane->type < 3)
6411 dist1 = start[plane->type] - plane->dist;
6412 dist2 = end[plane->type] - plane->dist;
6416 dist1 = DotProduct(start, plane->normal) - plane->dist;
6417 dist2 = DotProduct(end, plane->normal) - plane->dist;
6419 startside = dist1 < 0;
6420 endside = dist2 < 0;
6421 if (startside == endside)
6423 // most of the time the line fragment is on one side of the plane
6424 node = node->children[startside];
6428 // line crosses node plane, split the line
6429 dist1 = PlaneDiff(linestart, plane);
6430 dist2 = PlaneDiff(lineend, plane);
6431 midfrac = dist1 / (dist1 - dist2);
6432 VectorLerp(linestart, midfrac, lineend, mid);
6433 // take the near side first
6434 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6435 // if we found an impact on the front side, don't waste time
6436 // exploring the far side
6437 if (midfrac <= trace->realfraction)
6438 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6443 // abort if this part of the bsp tree can not be hit by this trace
6444 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6447 nodesegmentmins[0] = min(start[0], end[0]) - 1;
6448 nodesegmentmins[1] = min(start[1], end[1]) - 1;
6449 nodesegmentmins[2] = min(start[2], end[2]) - 1;
6450 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
6451 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
6452 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
6453 // line trace the brushes
6454 leaf = (mleaf_t *)node;
6456 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6459 for (i = 0;i < leaf->numleafbrushes;i++)
6461 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6462 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6464 brush->markframe = markframe;
6465 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
6468 // can't do point traces on curves (they have no thickness)
6469 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
6471 // line trace the curves
6472 for (i = 0;i < leaf->numleafsurfaces;i++)
6474 surface = model->data_surfaces + leaf->firstleafsurface[i];
6475 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6477 surface->deprecatedq3collisionmarkframe = markframe;
6478 Collision_TraceLineTriangleMeshFloat(trace, linestart, lineend, surface->num_collisiontriangles, surface->deprecatedq3data_collisionelement3i, surface->deprecatedq3data_collisionvertex3f, surface->deprecatedq3num_collisionbboxstride, surface->deprecatedq3data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
6484 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)
6490 msurface_t *surface;
6492 float nodesegmentmins[3], nodesegmentmaxs[3];
6493 // walk the tree until we hit a leaf, recursing for any split cases
6497 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6499 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6500 node = node->children[1];
6502 // abort if this part of the bsp tree can not be hit by this trace
6503 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6505 plane = node->plane;
6506 // axial planes are much more common than non-axial, so an optimized
6507 // axial case pays off here
6508 if (plane->type < 3)
6510 // this is an axial plane, compare bounding box directly to it and
6511 // recurse sides accordingly
6512 // recurse down node sides
6513 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
6514 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
6515 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
6516 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
6520 // this is a non-axial plane, so check if the start and end boxes
6521 // are both on one side of the plane to handle 'diagonal' cases
6522 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
6526 // segment crosses plane
6527 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6530 // if sides == 0 then the trace itself is bogus (Not A Number values),
6531 // in this case we simply pretend the trace hit nothing
6533 return; // ERROR: NAN bounding box!
6534 // take whichever side the segment box is on
6535 node = node->children[sides - 1];
6538 // abort if this part of the bsp tree can not be hit by this trace
6539 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6541 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
6542 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
6543 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
6544 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
6545 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
6546 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
6548 leaf = (mleaf_t *)node;
6550 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6553 for (i = 0;i < leaf->numleafbrushes;i++)
6555 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6556 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6558 brush->markframe = markframe;
6559 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6562 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
6564 for (i = 0;i < leaf->numleafsurfaces;i++)
6566 surface = model->data_surfaces + leaf->firstleafsurface[i];
6567 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6569 surface->deprecatedq3collisionmarkframe = markframe;
6570 Collision_TraceBrushTriangleMeshFloat(trace, thisbrush_start, thisbrush_end, surface->num_collisiontriangles, surface->deprecatedq3data_collisionelement3i, surface->deprecatedq3data_collisionvertex3f, surface->deprecatedq3num_collisionbboxstride, surface->deprecatedq3data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
6577 static int markframe = 0;
6579 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)
6583 memset(trace, 0, sizeof(*trace));
6584 trace->fraction = 1;
6585 trace->realfraction = 1;
6586 trace->hitsupercontentsmask = hitsupercontentsmask;
6587 if (mod_collision_bih.integer)
6588 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6589 else if (model->brush.submodel)
6591 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6592 if (brush->colbrushf)
6593 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
6596 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
6599 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)
6602 float segmentmins[3], segmentmaxs[3];
6603 msurface_t *surface;
6606 if (VectorCompare(start, end))
6608 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6612 memset(trace, 0, sizeof(*trace));
6613 trace->fraction = 1;
6614 trace->realfraction = 1;
6615 trace->hitsupercontentsmask = hitsupercontentsmask;
6616 segmentmins[0] = min(start[0], end[0]) - 1;
6617 segmentmins[1] = min(start[1], end[1]) - 1;
6618 segmentmins[2] = min(start[2], end[2]) - 1;
6619 segmentmaxs[0] = max(start[0], end[0]) + 1;
6620 segmentmaxs[1] = max(start[1], end[1]) + 1;
6621 segmentmaxs[2] = max(start[2], end[2]) + 1;
6622 if (mod_collision_bih.integer)
6623 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
6624 else if (model->brush.submodel)
6626 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6627 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6628 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6629 if (mod_q3bsp_curves_collisions.integer)
6630 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6631 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6632 Collision_TraceLineTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->deprecatedq3data_collisionelement3i, surface->deprecatedq3data_collisionvertex3f, surface->deprecatedq3num_collisionbboxstride, surface->deprecatedq3data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
6635 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
6638 void Mod_Q3BSP_TraceBrush(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, colbrushf_t *start, colbrushf_t *end, int hitsupercontentsmask)
6640 float segmentmins[3], segmentmaxs[3];
6642 msurface_t *surface;
6645 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(start->mins, start->maxs) && VectorCompare(end->mins, end->maxs))
6647 if (VectorCompare(start->mins, end->mins))
6648 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start->mins, hitsupercontentsmask);
6650 Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, start->mins, end->mins, hitsupercontentsmask);
6654 // box trace, performed as brush trace
6655 memset(trace, 0, sizeof(*trace));
6656 trace->fraction = 1;
6657 trace->realfraction = 1;
6658 trace->hitsupercontentsmask = hitsupercontentsmask;
6659 segmentmins[0] = min(start->mins[0], end->mins[0]);
6660 segmentmins[1] = min(start->mins[1], end->mins[1]);
6661 segmentmins[2] = min(start->mins[2], end->mins[2]);
6662 segmentmaxs[0] = max(start->maxs[0], end->maxs[0]);
6663 segmentmaxs[1] = max(start->maxs[1], end->maxs[1]);
6664 segmentmaxs[2] = max(start->maxs[2], end->maxs[2]);
6665 if (mod_collision_bih.integer)
6666 Mod_CollisionBIH_TraceBrush(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
6667 else if (model->brush.submodel)
6669 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6670 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6671 Collision_TraceBrushBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6672 if (mod_q3bsp_curves_collisions.integer)
6673 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6674 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6675 Collision_TraceBrushTriangleMeshFloat(trace, start, end, surface->num_collisiontriangles, surface->deprecatedq3data_collisionelement3i, surface->deprecatedq3data_collisionvertex3f, surface->deprecatedq3num_collisionbboxstride, surface->deprecatedq3data_collisionbbox6f, surface->texture->supercontents, surface->texture->surfaceflags, surface->texture, segmentmins, segmentmaxs);
6678 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, ++markframe, segmentmins, segmentmaxs);
6681 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)
6683 colboxbrushf_t thisbrush_start, thisbrush_end;
6684 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6686 // box trace, performed as brush trace
6687 VectorAdd(start, boxmins, boxstartmins);
6688 VectorAdd(start, boxmaxs, boxstartmaxs);
6689 VectorAdd(end, boxmins, boxendmins);
6690 VectorAdd(end, boxmaxs, boxendmaxs);
6691 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6692 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6693 Mod_Q3BSP_TraceBrush(model, frameblend, skeleton, trace, &thisbrush_start.brush, &thisbrush_end.brush, hitsupercontentsmask);
6696 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6699 int supercontents = 0;
6701 if (mod_collision_bih.integer)
6704 Mod_Q3BSP_TracePoint(model, NULL, NULL, &trace, point, 0);
6705 supercontents = trace.startsupercontents;
6707 // test if the point is inside each brush
6708 else if (model->brush.submodel)
6710 // submodels are effectively one leaf
6711 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6712 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6713 supercontents |= brush->colbrushf->supercontents;
6717 mnode_t *node = model->brush.data_nodes;
6719 // find which leaf the point is in
6721 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
6722 leaf = (mleaf_t *)node;
6723 // now check the brushes in the leaf
6724 for (i = 0;i < leaf->numleafbrushes;i++)
6726 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
6727 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6728 supercontents |= brush->colbrushf->supercontents;
6731 return supercontents;
6734 void Mod_CollisionBIH_TraceLineAgainstSurfaces(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)
6736 Mod_CollisionBIH_TraceLineShared(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, &model->render_bih);
6740 bih_t *Mod_MakeCollisionBIH(dp_model_t *model, qboolean userendersurfaces, bih_t *out)
6748 int nummodelbrushes = model->nummodelbrushes;
6749 int nummodelsurfaces = model->nummodelsurfaces;
6751 const int *collisionelement3i;
6752 const float *collisionvertex3f;
6753 const int *renderelement3i;
6754 const float *rendervertex3f;
6755 bih_leaf_t *bihleafs;
6756 bih_node_t *bihnodes;
6758 int *temp_leafsortscratch;
6759 const msurface_t *surface;
6760 const q3mbrush_t *brush;
6762 // find out how many BIH leaf nodes we need
6764 if (userendersurfaces)
6766 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6767 bihnumleafs += surface->num_triangles;
6771 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
6772 if (brush->colbrushf)
6774 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6776 if (surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS)
6777 bihnumleafs += surface->num_triangles + surface->num_collisiontriangles;
6779 bihnumleafs += surface->num_collisiontriangles;
6786 // allocate the memory for the BIH leaf nodes
6787 bihleafs = (bih_leaf_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_leaf_t) * bihnumleafs);
6789 // now populate the BIH leaf nodes
6792 // add render surfaces
6793 renderelement3i = model->surfmesh.data_element3i;
6794 rendervertex3f = model->surfmesh.data_vertex3f;
6795 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6797 for (triangleindex = 0, e = renderelement3i + 3*surface->num_firsttriangle;triangleindex < surface->num_triangles;triangleindex++, e += 3)
6799 if (!userendersurfaces && !(surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS))
6801 bihleafs[bihleafindex].type = BIH_RENDERTRIANGLE;
6802 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
6803 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
6804 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firsttriangle;
6805 bihleafs[bihleafindex].mins[0] = min(rendervertex3f[3*e[0]+0], min(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) - 1;
6806 bihleafs[bihleafindex].mins[1] = min(rendervertex3f[3*e[0]+1], min(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) - 1;
6807 bihleafs[bihleafindex].mins[2] = min(rendervertex3f[3*e[0]+2], min(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) - 1;
6808 bihleafs[bihleafindex].maxs[0] = max(rendervertex3f[3*e[0]+0], max(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) + 1;
6809 bihleafs[bihleafindex].maxs[1] = max(rendervertex3f[3*e[0]+1], max(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) + 1;
6810 bihleafs[bihleafindex].maxs[2] = max(rendervertex3f[3*e[0]+2], max(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) + 1;
6815 if (!userendersurfaces)
6817 // add collision brushes
6818 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
6820 if (!brush->colbrushf)
6822 bihleafs[bihleafindex].type = BIH_BRUSH;
6823 bihleafs[bihleafindex].textureindex = brush->texture - model->data_textures;
6824 bihleafs[bihleafindex].surfaceindex = -1;
6825 bihleafs[bihleafindex].itemindex = brushindex+model->firstmodelbrush;
6826 VectorCopy(brush->colbrushf->mins, bihleafs[bihleafindex].mins);
6827 VectorCopy(brush->colbrushf->maxs, bihleafs[bihleafindex].maxs);
6831 // add collision surfaces
6832 collisionelement3i = model->brush.data_collisionelement3i;
6833 collisionvertex3f = model->brush.data_collisionvertex3f;
6834 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6836 for (triangleindex = 0, e = collisionelement3i + 3*surface->num_firstcollisiontriangle;triangleindex < surface->num_collisiontriangles;triangleindex++, e += 3)
6838 bihleafs[bihleafindex].type = BIH_COLLISIONTRIANGLE;
6839 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
6840 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
6841 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firstcollisiontriangle;
6842 bihleafs[bihleafindex].mins[0] = min(collisionvertex3f[3*e[0]+0], min(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) - 1;
6843 bihleafs[bihleafindex].mins[1] = min(collisionvertex3f[3*e[0]+1], min(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) - 1;
6844 bihleafs[bihleafindex].mins[2] = min(collisionvertex3f[3*e[0]+2], min(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) - 1;
6845 bihleafs[bihleafindex].maxs[0] = max(collisionvertex3f[3*e[0]+0], max(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) + 1;
6846 bihleafs[bihleafindex].maxs[1] = max(collisionvertex3f[3*e[0]+1], max(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) + 1;
6847 bihleafs[bihleafindex].maxs[2] = max(collisionvertex3f[3*e[0]+2], max(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) + 1;
6853 // allocate buffers for the produced and temporary data
6854 bihmaxnodes = bihnumleafs + 1;
6855 bihnodes = (bih_node_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_node_t) * bihmaxnodes);
6856 temp_leafsort = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * bihnumleafs * 2);
6857 temp_leafsortscratch = temp_leafsort + bihnumleafs;
6860 BIH_Build(out, bihnumleafs, bihleafs, bihmaxnodes, bihnodes, temp_leafsort, temp_leafsortscratch);
6862 // we're done with the temporary data
6863 Mem_Free(temp_leafsort);
6865 // resize the BIH nodes array if it over-allocated
6866 if (out->maxnodes > out->numnodes)
6868 out->maxnodes = out->numnodes;
6869 out->nodes = (bih_node_t *)Mem_Realloc(loadmodel->mempool, out->nodes, out->numnodes * sizeof(bih_node_t));
6875 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
6877 int supercontents = 0;
6878 if (nativecontents & CONTENTSQ3_SOLID)
6879 supercontents |= SUPERCONTENTS_SOLID;
6880 if (nativecontents & CONTENTSQ3_WATER)
6881 supercontents |= SUPERCONTENTS_WATER;
6882 if (nativecontents & CONTENTSQ3_SLIME)
6883 supercontents |= SUPERCONTENTS_SLIME;
6884 if (nativecontents & CONTENTSQ3_LAVA)
6885 supercontents |= SUPERCONTENTS_LAVA;
6886 if (nativecontents & CONTENTSQ3_BODY)
6887 supercontents |= SUPERCONTENTS_BODY;
6888 if (nativecontents & CONTENTSQ3_CORPSE)
6889 supercontents |= SUPERCONTENTS_CORPSE;
6890 if (nativecontents & CONTENTSQ3_NODROP)
6891 supercontents |= SUPERCONTENTS_NODROP;
6892 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
6893 supercontents |= SUPERCONTENTS_PLAYERCLIP;
6894 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
6895 supercontents |= SUPERCONTENTS_MONSTERCLIP;
6896 if (nativecontents & CONTENTSQ3_DONOTENTER)
6897 supercontents |= SUPERCONTENTS_DONOTENTER;
6898 if (nativecontents & CONTENTSQ3_BOTCLIP)
6899 supercontents |= SUPERCONTENTS_BOTCLIP;
6900 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
6901 supercontents |= SUPERCONTENTS_OPAQUE;
6902 return supercontents;
6905 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
6907 int nativecontents = 0;
6908 if (supercontents & SUPERCONTENTS_SOLID)
6909 nativecontents |= CONTENTSQ3_SOLID;
6910 if (supercontents & SUPERCONTENTS_WATER)
6911 nativecontents |= CONTENTSQ3_WATER;
6912 if (supercontents & SUPERCONTENTS_SLIME)
6913 nativecontents |= CONTENTSQ3_SLIME;
6914 if (supercontents & SUPERCONTENTS_LAVA)
6915 nativecontents |= CONTENTSQ3_LAVA;
6916 if (supercontents & SUPERCONTENTS_BODY)
6917 nativecontents |= CONTENTSQ3_BODY;
6918 if (supercontents & SUPERCONTENTS_CORPSE)
6919 nativecontents |= CONTENTSQ3_CORPSE;
6920 if (supercontents & SUPERCONTENTS_NODROP)
6921 nativecontents |= CONTENTSQ3_NODROP;
6922 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
6923 nativecontents |= CONTENTSQ3_PLAYERCLIP;
6924 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
6925 nativecontents |= CONTENTSQ3_MONSTERCLIP;
6926 if (supercontents & SUPERCONTENTS_DONOTENTER)
6927 nativecontents |= CONTENTSQ3_DONOTENTER;
6928 if (supercontents & SUPERCONTENTS_BOTCLIP)
6929 nativecontents |= CONTENTSQ3_BOTCLIP;
6930 if (!(supercontents & SUPERCONTENTS_OPAQUE))
6931 nativecontents |= CONTENTSQ3_TRANSLUCENT;
6932 return nativecontents;
6935 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
6940 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
6941 node = node->children[1];
6943 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
6944 if (loadmodel->brush.num_leafs < numleafs)
6945 loadmodel->brush.num_leafs = numleafs;
6948 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
6951 q3dheader_t *header;
6952 float corner[3], yawradius, modelradius;
6954 mod->modeldatatypestring = "Q3BSP";
6956 mod->type = mod_brushq3;
6957 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
6960 header = (q3dheader_t *)buffer;
6961 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
6962 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
6964 i = LittleLong(header->version);
6965 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
6966 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
6968 mod->soundfromcenter = true;
6969 mod->TraceBox = Mod_Q3BSP_TraceBox;
6970 mod->TraceBrush = Mod_Q3BSP_TraceBrush;
6971 mod->TraceLine = Mod_Q3BSP_TraceLine;
6972 mod->TracePoint = Mod_Q3BSP_TracePoint;
6973 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
6974 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
6975 mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
6976 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
6977 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
6978 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
6979 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
6980 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
6981 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
6982 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
6983 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
6984 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
6985 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
6986 mod->brush.AmbientSoundLevelsForPoint = NULL;
6987 mod->brush.RoundUpToHullSize = NULL;
6988 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
6989 mod->Draw = R_Q1BSP_Draw;
6990 mod->DrawDepth = R_Q1BSP_DrawDepth;
6991 mod->DrawDebug = R_Q1BSP_DrawDebug;
6992 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
6993 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
6994 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
6995 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
6996 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
6997 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
6998 mod->DrawLight = R_Q1BSP_DrawLight;
7000 mod_base = (unsigned char *)header;
7002 // swap all the lumps
7003 header->ident = LittleLong(header->ident);
7004 header->version = LittleLong(header->version);
7005 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
7006 for (i = 0;i < lumps;i++)
7008 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
7009 if((char *) bufferend < (char *) buffer + j)
7010 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
7011 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
7012 if((char *) bufferend < (char *) buffer + j)
7013 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
7016 * NO, do NOT clear them!
7017 * they contain actual data referenced by other stuff.
7018 * Instead, before using the advertisements lump, check header->versio
7020 * Sorry, but otherwise it breaks memory of the first lump.
7021 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
7023 header->lumps[i].fileofs = 0;
7024 header->lumps[i].filelen = 0;
7028 mod->brush.qw_md4sum = 0;
7029 mod->brush.qw_md4sum2 = 0;
7030 for (i = 0;i < lumps;i++)
7032 if (i == Q3LUMP_ENTITIES)
7034 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7035 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
7037 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7039 // all this checksumming can take a while, so let's send keepalives here too
7040 CL_KeepaliveMessage(false);
7043 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
7044 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
7045 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
7046 if (header->version == Q3BSPVERSION_IG)
7047 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
7049 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
7050 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
7051 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
7052 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
7053 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
7054 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
7055 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
7056 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
7057 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
7058 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
7059 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
7060 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
7061 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
7062 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
7063 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
7065 // the MakePortals code works fine on the q3bsp data as well
7066 if (mod_bsp_portalize.integer)
7067 Mod_Q1BSP_MakePortals();
7069 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
7070 loadmodel->brush.supportwateralpha = true;
7072 // make a single combined shadow mesh to allow optimized shadow volume creation
7073 Mod_Q1BSP_CreateShadowMesh(loadmodel);
7075 loadmodel->brush.num_leafs = 0;
7076 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
7078 if (loadmodel->brush.numsubmodels)
7079 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7082 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7087 // duplicate the basic information
7088 dpsnprintf(name, sizeof(name), "*%i", i);
7089 mod = Mod_FindName(name, loadmodel->name);
7090 // copy the base model to this one
7092 // rename the clone back to its proper name
7093 strlcpy(mod->name, name, sizeof(mod->name));
7094 mod->brush.parentmodel = loadmodel;
7095 // textures and memory belong to the main model
7096 mod->texturepool = NULL;
7097 mod->mempool = NULL;
7098 mod->brush.GetPVS = NULL;
7099 mod->brush.FatPVS = NULL;
7100 mod->brush.BoxTouchingPVS = NULL;
7101 mod->brush.BoxTouchingLeafPVS = NULL;
7102 mod->brush.BoxTouchingVisibleLeafs = NULL;
7103 mod->brush.FindBoxClusters = NULL;
7104 mod->brush.LightPoint = NULL;
7105 mod->brush.AmbientSoundLevelsForPoint = NULL;
7107 mod->brush.submodel = i;
7108 if (loadmodel->brush.submodels)
7109 loadmodel->brush.submodels[i] = mod;
7111 // make the model surface list (used by shadowing/lighting)
7112 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
7113 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
7114 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
7115 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
7116 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
7117 Mod_MakeSortedSurfaces(mod);
7119 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
7120 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
7121 // enlarge the bounding box to enclose all geometry of this model,
7122 // because q3map2 sometimes lies (mostly to affect the lightgrid),
7123 // which can in turn mess up the farclip (as well as culling when
7124 // outside the level - an unimportant concern)
7126 //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]);
7127 for (j = 0;j < mod->nummodelsurfaces;j++)
7129 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7130 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7132 if (!surface->num_vertices)
7134 for (k = 0;k < surface->num_vertices;k++, v += 3)
7136 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7137 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7138 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7139 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7140 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7141 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7144 //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]);
7145 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7146 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7147 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7148 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7149 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7150 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7151 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7152 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7153 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7154 mod->yawmins[2] = mod->normalmins[2];
7155 mod->yawmaxs[2] = mod->normalmaxs[2];
7156 mod->radius = modelradius;
7157 mod->radius2 = modelradius * modelradius;
7159 // this gets altered below if sky or water is used
7160 mod->DrawSky = NULL;
7161 mod->DrawAddWaterPlanes = NULL;
7163 for (j = 0;j < mod->nummodelsurfaces;j++)
7164 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7166 if (j < mod->nummodelsurfaces)
7167 mod->DrawSky = R_Q1BSP_DrawSky;
7169 for (j = 0;j < mod->nummodelsurfaces;j++)
7170 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7172 if (j < mod->nummodelsurfaces)
7173 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
7175 Mod_MakeCollisionBIH(mod, false, &mod->collision_bih);
7176 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
7178 // generate VBOs and other shared data before cloning submodels
7183 Con_DPrintf("Stats for q3bsp model \"%s\": %i faces, %i nodes, %i leafs, %i clusters, %i clusterportals, mesh: %i vertices, %i triangles, %i surfaces\n", loadmodel->name, loadmodel->num_surfaces, loadmodel->brush.num_nodes, loadmodel->brush.num_leafs, mod->brush.num_pvsclusters, loadmodel->brush.num_portals, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->num_surfaces);
7186 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7188 int i = LittleLong(((int *)buffer)[1]);
7189 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
7190 Mod_Q3BSP_Load(mod,buffer, bufferend);
7191 else if (i == Q2BSPVERSION)
7192 Mod_Q2BSP_Load(mod,buffer, bufferend);
7194 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
7197 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7199 Host_Error("Mod_MAP_Load: not yet implemented");
7202 typedef struct objvertex_s
7213 static unsigned char nobsp_pvs[1] = {1};
7215 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
7217 const char *textbase = (char *)buffer, *text = textbase;
7221 char materialname[MAX_QPATH];
7222 int i, j, l, numvertices, firstvertex, firsttriangle, elementindex, vertexindex, surfacevertices, surfacetriangles, surfaceelements, submodelindex = 0;
7223 int index1, index2, index3;
7224 objvertex_t vfirst, vprev, vcurrent;
7227 int numtriangles = 0;
7228 int maxtriangles = 0;
7229 objvertex_t *vertices = NULL;
7231 int maxtextures = 0, numtextures = 0, textureindex = 0;
7232 int maxv = 0, numv = 1;
7233 int maxvt = 0, numvt = 1;
7234 int maxvn = 0, numvn = 1;
7235 char *texturenames = NULL;
7236 float dist, modelradius, modelyawradius, yawradius;
7243 objvertex_t *thisvertex = NULL;
7244 int vertexhashindex;
7245 int *vertexhashtable = NULL;
7246 objvertex_t *vertexhashdata = NULL;
7247 objvertex_t *vdata = NULL;
7248 int vertexhashsize = 0;
7249 int vertexhashcount = 0;
7250 skinfile_t *skinfiles = NULL;
7251 unsigned char *data = NULL;
7252 int *submodelfirstsurface;
7253 msurface_t *surface;
7254 msurface_t *tempsurfaces;
7256 memset(&vfirst, 0, sizeof(vfirst));
7257 memset(&vprev, 0, sizeof(vprev));
7258 memset(&vcurrent, 0, sizeof(vcurrent));
7260 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
7262 loadmodel->modeldatatypestring = "OBJ";
7264 loadmodel->type = mod_obj;
7265 loadmodel->soundfromcenter = true;
7266 loadmodel->TraceBox = Mod_CollisionBIH_TraceBox;
7267 loadmodel->TraceBrush = Mod_CollisionBIH_TraceBrush;
7268 loadmodel->TraceLine = Mod_CollisionBIH_TraceLine;
7269 loadmodel->TracePoint = Mod_CollisionBIH_TracePoint_Mesh;
7270 loadmodel->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7271 loadmodel->PointSuperContents = Mod_CollisionBIH_PointSuperContents_Mesh;
7272 loadmodel->brush.TraceLineOfSight = NULL;
7273 loadmodel->brush.SuperContentsFromNativeContents = NULL;
7274 loadmodel->brush.NativeContentsFromSuperContents = NULL;
7275 loadmodel->brush.GetPVS = NULL;
7276 loadmodel->brush.FatPVS = NULL;
7277 loadmodel->brush.BoxTouchingPVS = NULL;
7278 loadmodel->brush.BoxTouchingLeafPVS = NULL;
7279 loadmodel->brush.BoxTouchingVisibleLeafs = NULL;
7280 loadmodel->brush.FindBoxClusters = NULL;
7281 loadmodel->brush.LightPoint = NULL;
7282 loadmodel->brush.FindNonSolidLocation = NULL;
7283 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
7284 loadmodel->brush.RoundUpToHullSize = NULL;
7285 loadmodel->brush.PointInLeaf = NULL;
7286 loadmodel->Draw = R_Q1BSP_Draw;
7287 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
7288 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
7289 loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
7290 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
7291 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7292 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7293 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7294 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7295 loadmodel->DrawLight = R_Q1BSP_DrawLight;
7297 skinfiles = Mod_LoadSkinFiles();
7298 if (loadmodel->numskins < 1)
7299 loadmodel->numskins = 1;
7301 // make skinscenes for the skins (no groups)
7302 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
7303 for (i = 0;i < loadmodel->numskins;i++)
7305 loadmodel->skinscenes[i].firstframe = i;
7306 loadmodel->skinscenes[i].framecount = 1;
7307 loadmodel->skinscenes[i].loop = true;
7308 loadmodel->skinscenes[i].framerate = 10;
7314 // parse the OBJ text now
7317 static char emptyarg[1] = "";
7322 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
7323 line[linelen] = text[linelen];
7325 for (argc = 0;argc < 4;argc++)
7326 argv[argc] = emptyarg;
7329 while (*s == ' ' || *s == '\t')
7339 while (*s == ' ' || *s == '\t')
7349 if (argv[0][0] == '#')
7351 if (!strcmp(argv[0], "v"))
7355 maxv = max(maxv * 2, 1024);
7356 v = (float *)Mem_Realloc(tempmempool, v, maxv * sizeof(float[3]));
7358 v[numv*3+0] = atof(argv[1]);
7359 v[numv*3+2] = atof(argv[2]);
7360 v[numv*3+1] = atof(argv[3]);
7363 else if (!strcmp(argv[0], "vt"))
7367 maxvt = max(maxvt * 2, 1024);
7368 vt = (float *)Mem_Realloc(tempmempool, vt, maxvt * sizeof(float[2]));
7370 vt[numvt*2+0] = atof(argv[1]);
7371 vt[numvt*2+1] = 1-atof(argv[2]);
7374 else if (!strcmp(argv[0], "vn"))
7378 maxvn = max(maxvn * 2, 1024);
7379 vn = (float *)Mem_Realloc(tempmempool, vn, maxvn * sizeof(float[3]));
7381 vn[numvn*3+0] = atof(argv[1]);
7382 vn[numvn*3+2] = atof(argv[2]);
7383 vn[numvn*3+1] = atof(argv[3]);
7386 else if (!strcmp(argv[0], "f"))
7390 if (maxtextures <= numtextures)
7392 maxtextures = max(maxtextures * 2, 256);
7393 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7395 textureindex = numtextures++;
7396 strlcpy(texturenames + textureindex*MAX_QPATH, loadmodel->name, MAX_QPATH);
7398 for (j = 1;j < argc;j++)
7400 index1 = atoi(argv[j]);
7401 while(argv[j][0] && argv[j][0] != '/')
7405 index2 = atoi(argv[j]);
7406 while(argv[j][0] && argv[j][0] != '/')
7410 index3 = atoi(argv[j]);
7411 // negative refers to a recent vertex
7412 // zero means not specified
7413 // positive means an absolute vertex index
7415 index1 = numv - index1;
7417 index2 = numvt - index2;
7419 index3 = numvn - index3;
7420 vcurrent.nextindex = -1;
7421 vcurrent.textureindex = textureindex;
7422 vcurrent.submodelindex = submodelindex;
7423 if (v && index1 >= 0 && index1 < numv)
7424 VectorCopy(v + 3*index1, vcurrent.v);
7425 if (vt && index2 >= 0 && index2 < numvt)
7426 Vector2Copy(vt + 2*index2, vcurrent.vt);
7427 if (vn && index3 >= 0 && index3 < numvn)
7428 VectorCopy(vn + 3*index3, vcurrent.vn);
7429 if (numtriangles == 0)
7431 VectorCopy(vcurrent.v, mins);
7432 VectorCopy(vcurrent.v, maxs);
7436 mins[0] = min(mins[0], vcurrent.v[0]);
7437 mins[1] = min(mins[1], vcurrent.v[1]);
7438 mins[2] = min(mins[2], vcurrent.v[2]);
7439 maxs[0] = max(maxs[0], vcurrent.v[0]);
7440 maxs[1] = max(maxs[1], vcurrent.v[1]);
7441 maxs[2] = max(maxs[2], vcurrent.v[2]);
7447 if (maxtriangles <= numtriangles)
7449 maxtriangles = max(maxtriangles * 2, 32768);
7450 vertices = (objvertex_t*)Mem_Realloc(loadmodel->mempool, vertices, maxtriangles * sizeof(objvertex_t[3]));
7452 vertices[numtriangles*3+0] = vfirst;
7453 vertices[numtriangles*3+1] = vprev;
7454 vertices[numtriangles*3+2] = vcurrent;
7460 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
7462 submodelindex = atof(argv[1]);
7463 loadmodel->brush.numsubmodels = max(submodelindex + 1, loadmodel->brush.numsubmodels);
7465 else if (!strcmp(argv[0], "usemtl"))
7467 for (i = 0;i < numtextures;i++)
7468 if (!strcmp(texturenames+i*MAX_QPATH, argv[1]))
7470 if (i < numtextures)
7474 if (maxtextures <= numtextures)
7476 maxtextures = max(maxtextures * 2, 256);
7477 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7479 textureindex = numtextures++;
7480 strlcpy(texturenames + textureindex*MAX_QPATH, argv[1], MAX_QPATH);
7485 // now that we have the OBJ data loaded as-is, we can convert it
7487 // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
7488 VectorCopy(mins, loadmodel->normalmins);
7489 VectorCopy(maxs, loadmodel->normalmaxs);
7490 dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
7491 modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
7492 modelyawradius = dist*dist+modelyawradius*modelyawradius;
7493 modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
7494 modelradius = modelyawradius + modelradius * modelradius;
7495 modelyawradius = sqrt(modelyawradius);
7496 modelradius = sqrt(modelradius);
7497 loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
7498 loadmodel->yawmins[2] = loadmodel->normalmins[2];
7499 loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] = modelyawradius;
7500 loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
7501 loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
7502 loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] = modelradius;
7503 loadmodel->radius = modelradius;
7504 loadmodel->radius2 = modelradius * modelradius;
7506 // allocate storage for triangles
7507 loadmodel->surfmesh.data_element3i = (int *)Mem_Alloc(loadmodel->mempool, numtriangles * sizeof(int[3]));
7508 // allocate vertex hash structures to build an optimal vertex subset
7509 vertexhashsize = numtriangles*2;
7510 vertexhashtable = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * vertexhashsize);
7511 memset(vertexhashtable, 0xFF, sizeof(int) * vertexhashsize);
7512 vertexhashdata = (objvertex_t *)Mem_Alloc(loadmodel->mempool, sizeof(*vertexhashdata) * numtriangles*3);
7513 vertexhashcount = 0;
7515 // gather surface stats for assigning vertex/triangle ranges
7519 loadmodel->num_surfaces = 0;
7520 // allocate storage for the worst case number of surfaces, later we resize
7521 tempsurfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, numtextures * loadmodel->brush.numsubmodels * sizeof(msurface_t));
7522 submodelfirstsurface = (int *)Mem_Alloc(loadmodel->mempool, (loadmodel->brush.numsubmodels+1) * sizeof(int));
7523 surface = tempsurfaces;
7524 for (submodelindex = 0;submodelindex < loadmodel->brush.numsubmodels;submodelindex++)
7526 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7527 for (textureindex = 0;textureindex < numtextures;textureindex++)
7529 for (vertexindex = 0;vertexindex < numtriangles*3;vertexindex++)
7531 thisvertex = vertices + vertexindex;
7532 if (thisvertex->submodelindex == submodelindex && thisvertex->textureindex == textureindex)
7535 // skip the surface creation if there are no triangles for it
7536 if (vertexindex == numtriangles*3)
7538 // create a surface for these vertices
7539 surfacevertices = 0;
7540 surfaceelements = 0;
7541 // we hack in a texture index in the surface to be fixed up later...
7542 surface->texture = (texture_t *)((size_t)textureindex);
7543 // calculate bounds as we go
7544 VectorCopy(thisvertex->v, surface->mins);
7545 VectorCopy(thisvertex->v, surface->maxs);
7546 for (;vertexindex < numtriangles*3;vertexindex++)
7548 thisvertex = vertices + vertexindex;
7549 if (thisvertex->submodelindex != submodelindex)
7551 if (thisvertex->textureindex != textureindex)
7553 // add vertex to surface bounds
7554 surface->mins[0] = min(surface->mins[0], thisvertex->v[0]);
7555 surface->mins[1] = min(surface->mins[1], thisvertex->v[1]);
7556 surface->mins[2] = min(surface->mins[2], thisvertex->v[2]);
7557 surface->maxs[0] = max(surface->maxs[0], thisvertex->v[0]);
7558 surface->maxs[1] = max(surface->maxs[1], thisvertex->v[1]);
7559 surface->maxs[2] = max(surface->maxs[2], thisvertex->v[2]);
7560 // add the vertex if it is not found in the merged set, and
7561 // get its index (triangle element) for the surface
7562 vertexhashindex = (unsigned int)(thisvertex->v[0] * 3571 + thisvertex->v[0] * 1777 + thisvertex->v[0] * 457) % (unsigned int)vertexhashsize;
7563 for (i = vertexhashtable[vertexhashindex];i >= 0;i = vertexhashdata[i].nextindex)
7565 vdata = vertexhashdata + i;
7566 if (vdata->submodelindex == thisvertex->submodelindex && vdata->textureindex == thisvertex->textureindex && VectorCompare(thisvertex->v, vdata->v) && VectorCompare(thisvertex->vn, vdata->vn) && Vector2Compare(thisvertex->vt, vdata->vt))
7571 i = vertexhashcount++;
7572 vdata = vertexhashdata + i;
7573 *vdata = *thisvertex;
7574 vdata->nextindex = vertexhashtable[vertexhashindex];
7575 vertexhashtable[vertexhashindex] = i;
7578 loadmodel->surfmesh.data_element3i[elementindex++] = i;
7581 surfacetriangles = surfaceelements / 3;
7582 surface->num_vertices = surfacevertices;
7583 surface->num_triangles = surfacetriangles;
7584 surface->num_firstvertex = firstvertex;
7585 surface->num_firsttriangle = firsttriangle;
7586 firstvertex += surface->num_vertices;
7587 firsttriangle += surface->num_triangles;
7589 loadmodel->num_surfaces++;
7592 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7593 numvertices = firstvertex;
7594 loadmodel->data_surfaces = (msurface_t *)Mem_Realloc(loadmodel->mempool, tempsurfaces, loadmodel->num_surfaces * sizeof(msurface_t));
7595 tempsurfaces = NULL;
7597 // allocate storage for final mesh data
7598 loadmodel->num_textures = numtextures * loadmodel->numskins;
7599 loadmodel->num_texturesperskin = numtextures;
7600 data = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * sizeof(int) + loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t) + numtriangles * sizeof(int[3]) + (numvertices <= 65536 ? numtriangles * sizeof(unsigned short[3]) : 0) + (r_enableshadowvolumes.integer ? numtriangles * sizeof(int[3]) : 0) + numvertices * sizeof(float[14]) + loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7601 loadmodel->brush.submodels = (dp_model_t **)data;data += loadmodel->brush.numsubmodels * sizeof(dp_model_t *);
7602 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
7603 loadmodel->data_textures = (texture_t *)data;data += loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t);
7604 loadmodel->surfmesh.num_vertices = numvertices;
7605 loadmodel->surfmesh.num_triangles = numtriangles;
7606 if (r_enableshadowvolumes.integer)
7607 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += numtriangles * sizeof(int[3]);
7608 loadmodel->surfmesh.data_vertex3f = (float *)data;data += numvertices * sizeof(float[3]);
7609 loadmodel->surfmesh.data_svector3f = (float *)data;data += numvertices * sizeof(float[3]);
7610 loadmodel->surfmesh.data_tvector3f = (float *)data;data += numvertices * sizeof(float[3]);
7611 loadmodel->surfmesh.data_normal3f = (float *)data;data += numvertices * sizeof(float[3]);
7612 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += numvertices * sizeof(float[2]);
7613 if (loadmodel->surfmesh.num_vertices <= 65536)
7614 loadmodel->surfmesh.data_element3s = (unsigned short *)data;data += loadmodel->surfmesh.num_triangles * sizeof(unsigned short[3]);
7616 for (j = 0;j < loadmodel->surfmesh.num_vertices;j++)
7618 VectorCopy(vertexhashdata[j].v, loadmodel->surfmesh.data_vertex3f + 3*j);
7619 VectorCopy(vertexhashdata[j].vn, loadmodel->surfmesh.data_normal3f + 3*j);
7620 Vector2Copy(vertexhashdata[j].vt, loadmodel->surfmesh.data_texcoordtexture2f + 2*j);
7623 // load the textures
7624 for (textureindex = 0;textureindex < numtextures;textureindex++)
7625 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures + textureindex, skinfiles, texturenames + textureindex*MAX_QPATH, texturenames + textureindex*MAX_QPATH);
7626 Mod_FreeSkinFiles(skinfiles);
7628 // set the surface textures to their real values now that we loaded them...
7629 for (i = 0;i < loadmodel->num_surfaces;i++)
7630 loadmodel->data_surfaces[i].texture = loadmodel->data_textures + (size_t)loadmodel->data_surfaces[i].texture;
7634 Mem_Free(texturenames);
7638 Mem_Free(vertexhashtable);
7639 Mem_Free(vertexhashdata);
7641 // make a single combined shadow mesh to allow optimized shadow volume creation
7642 Mod_Q1BSP_CreateShadowMesh(loadmodel);
7644 // compute all the mesh information that was not loaded from the file
7645 if (loadmodel->surfmesh.data_element3s)
7646 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
7647 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
7648 Mod_ValidateElements(loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles, 0, loadmodel->surfmesh.num_vertices, __FILE__, __LINE__);
7649 // generate normals if the file did not have them
7650 if (!VectorLength2(loadmodel->surfmesh.data_normal3f))
7651 Mod_BuildNormals(0, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->surfmesh.data_vertex3f, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.data_normal3f, r_smoothnormals_areaweighting.integer != 0);
7652 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, r_smoothnormals_areaweighting.integer != 0);
7653 if (loadmodel->surfmesh.data_neighbor3i)
7654 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
7656 // if this is a worldmodel and has no BSP tree, create a fake one for the purpose
7657 loadmodel->brush.num_visleafs = 1;
7658 loadmodel->brush.num_leafs = 1;
7659 loadmodel->brush.num_nodes = 0;
7660 loadmodel->brush.num_leafsurfaces = loadmodel->num_surfaces;
7661 loadmodel->brush.data_leafs = (mleaf_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
7662 loadmodel->brush.data_nodes = (mnode_t *)loadmodel->brush.data_leafs;
7663 loadmodel->brush.num_pvsclusters = 1;
7664 loadmodel->brush.num_pvsclusterbytes = 1;
7665 loadmodel->brush.data_pvsclusters = nobsp_pvs;
7666 //if (loadmodel->num_nodes) loadmodel->data_nodes = (mnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_nodes * sizeof(mnode_t));
7667 //loadmodel->data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->num_leafsurfaces * sizeof(int));
7668 loadmodel->brush.data_leafsurfaces = loadmodel->sortedmodelsurfaces;
7669 VectorCopy(loadmodel->normalmins, loadmodel->brush.data_leafs->mins);
7670 VectorCopy(loadmodel->normalmaxs, loadmodel->brush.data_leafs->maxs);
7671 loadmodel->brush.data_leafs->combinedsupercontents = 0; // FIXME?
7672 loadmodel->brush.data_leafs->clusterindex = 0;
7673 loadmodel->brush.data_leafs->areaindex = 0;
7674 loadmodel->brush.data_leafs->numleafsurfaces = loadmodel->brush.num_leafsurfaces;
7675 loadmodel->brush.data_leafs->firstleafsurface = loadmodel->brush.data_leafsurfaces;
7676 loadmodel->brush.data_leafs->numleafbrushes = 0;
7677 loadmodel->brush.data_leafs->firstleafbrush = NULL;
7678 loadmodel->brush.supportwateralpha = true;
7680 if (loadmodel->brush.numsubmodels)
7681 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7684 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7689 // duplicate the basic information
7690 dpsnprintf(name, sizeof(name), "*%i", i);
7691 mod = Mod_FindName(name, loadmodel->name);
7692 // copy the base model to this one
7694 // rename the clone back to its proper name
7695 strlcpy(mod->name, name, sizeof(mod->name));
7696 mod->brush.parentmodel = loadmodel;
7697 // textures and memory belong to the main model
7698 mod->texturepool = NULL;
7699 mod->mempool = NULL;
7700 mod->brush.GetPVS = NULL;
7701 mod->brush.FatPVS = NULL;
7702 mod->brush.BoxTouchingPVS = NULL;
7703 mod->brush.BoxTouchingLeafPVS = NULL;
7704 mod->brush.BoxTouchingVisibleLeafs = NULL;
7705 mod->brush.FindBoxClusters = NULL;
7706 mod->brush.LightPoint = NULL;
7707 mod->brush.AmbientSoundLevelsForPoint = NULL;
7709 mod->brush.submodel = i;
7710 if (loadmodel->brush.submodels)
7711 loadmodel->brush.submodels[i] = mod;
7713 // make the model surface list (used by shadowing/lighting)
7714 mod->firstmodelsurface = submodelfirstsurface[i];
7715 mod->nummodelsurfaces = submodelfirstsurface[i+1] - submodelfirstsurface[i];
7716 mod->firstmodelbrush = 0;
7717 mod->nummodelbrushes = 0;
7718 mod->sortedmodelsurfaces = loadmodel->sortedmodelsurfaces + mod->firstmodelsurface;
7719 Mod_MakeSortedSurfaces(mod);
7721 VectorClear(mod->normalmins);
7722 VectorClear(mod->normalmaxs);
7724 for (j = 0;j < mod->nummodelsurfaces;j++)
7726 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7727 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7729 if (!surface->num_vertices)
7734 VectorCopy(v, mod->normalmins);
7735 VectorCopy(v, mod->normalmaxs);
7737 for (k = 0;k < surface->num_vertices;k++, v += 3)
7739 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7740 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7741 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7742 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7743 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7744 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7747 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7748 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7749 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7750 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7751 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7752 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7753 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7754 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7755 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7756 mod->yawmins[2] = mod->normalmins[2];
7757 mod->yawmaxs[2] = mod->normalmaxs[2];
7758 mod->radius = modelradius;
7759 mod->radius2 = modelradius * modelradius;
7761 // this gets altered below if sky or water is used
7762 mod->DrawSky = NULL;
7763 mod->DrawAddWaterPlanes = NULL;
7765 for (j = 0;j < mod->nummodelsurfaces;j++)
7766 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7768 if (j < mod->nummodelsurfaces)
7769 mod->DrawSky = R_Q1BSP_DrawSky;
7771 for (j = 0;j < mod->nummodelsurfaces;j++)
7772 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7774 if (j < mod->nummodelsurfaces)
7775 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
7777 Mod_MakeCollisionBIH(mod, true, &mod->collision_bih);
7778 mod->render_bih = mod->collision_bih;
7780 // generate VBOs and other shared data before cloning submodels
7785 Mem_Free(submodelfirstsurface);
7787 Con_DPrintf("Stats for obj model \"%s\": %i faces, %i nodes, %i leafs, %i clusters, %i clusterportals, mesh: %i vertices, %i triangles, %i surfaces\n", loadmodel->name, loadmodel->num_surfaces, loadmodel->brush.num_nodes, loadmodel->brush.num_leafs, mod->brush.num_pvsclusters, loadmodel->brush.num_portals, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->num_surfaces);
7790 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
7792 // we already have done PVS culling at this point...
7793 // so we don't need to do it again.
7796 vec3_t testorigin, mins, maxs;
7798 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
7799 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
7800 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
7802 if(model->brush.TraceLineOfSight(model, eye, testorigin))
7805 // expand the box a little
7806 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
7807 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
7808 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
7809 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
7810 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
7811 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
7813 for(i = 0; i != numsamples; ++i)
7815 testorigin[0] = lhrandom(mins[0], maxs[0]);
7816 testorigin[1] = lhrandom(mins[1], maxs[1]);
7817 testorigin[2] = lhrandom(mins[2], maxs[2]);
7819 if(model->brush.TraceLineOfSight(model, eye, testorigin))