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);
1582 loadmodel->brush.alphaskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_alphatexture", TEXF_ALPHA, (unsigned char *) alphapixels, w, h);
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 zero[4];
1600 memset(zero, 0, sizeof(zero));
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_convertsRGB_skin.integer != 0, NULL);
1775 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), false, false, r_texture_convertsRGB_skin.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);
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 Vector4Set(zero, 128, 128, 128, 128);
1826 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA, zero, 1, 1);
1827 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1829 else if (!strncmp(tx->name,"*lava",5)
1830 || !strncmp(tx->name,"*teleport",9)
1831 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1832 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1834 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1835 if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1836 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1838 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1840 // replace the texture with black
1841 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, 0, zero, 1, 1);
1842 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1844 else if (!strncmp(tx->name, "sky", 3))
1845 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1846 else if (!strcmp(tx->name, "caulk"))
1847 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1848 else if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1849 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1851 // start out with no animation
1852 tx->currentframe = tx;
1853 tx->currentskinframe = tx->skinframes[0];
1857 // sequence the animations
1858 for (i = 0;i < m->nummiptex;i++)
1860 tx = loadmodel->data_textures + i;
1861 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1863 if (tx->anim_total[0] || tx->anim_total[1])
1864 continue; // already sequenced
1866 // find the number of frames in the animation
1867 memset(anims, 0, sizeof(anims));
1868 memset(altanims, 0, sizeof(altanims));
1870 for (j = i;j < m->nummiptex;j++)
1872 tx2 = loadmodel->data_textures + j;
1873 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1877 if (num >= '0' && num <= '9')
1878 anims[num - '0'] = tx2;
1879 else if (num >= 'a' && num <= 'j')
1880 altanims[num - 'a'] = tx2;
1882 Con_Printf("Bad animating texture %s\n", tx->name);
1886 for (j = 0;j < 10;j++)
1893 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1896 for (j = 0;j < max;j++)
1900 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1904 for (j = 0;j < altmax;j++)
1908 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1917 // if there is no alternate animation, duplicate the primary
1918 // animation into the alternate
1920 for (k = 0;k < 10;k++)
1921 altanims[k] = anims[k];
1924 // link together the primary animation
1925 for (j = 0;j < max;j++)
1928 tx2->animated = true;
1929 tx2->anim_total[0] = max;
1930 tx2->anim_total[1] = altmax;
1931 for (k = 0;k < 10;k++)
1933 tx2->anim_frames[0][k] = anims[k];
1934 tx2->anim_frames[1][k] = altanims[k];
1938 // if there really is an alternate anim...
1939 if (anims[0] != altanims[0])
1941 // link together the alternate animation
1942 for (j = 0;j < altmax;j++)
1945 tx2->animated = true;
1946 // the primary/alternate are reversed here
1947 tx2->anim_total[0] = altmax;
1948 tx2->anim_total[1] = max;
1949 for (k = 0;k < 10;k++)
1951 tx2->anim_frames[0][k] = altanims[k];
1952 tx2->anim_frames[1][k] = anims[k];
1959 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1962 unsigned char *in, *out, *data, d;
1963 char litfilename[MAX_QPATH];
1964 char dlitfilename[MAX_QPATH];
1965 fs_offset_t filesize;
1966 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1968 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1969 for (i=0; i<l->filelen; i++)
1970 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1972 else // LordHavoc: bsp version 29 (normal white lighting)
1974 // LordHavoc: hope is not lost yet, check for a .lit file to load
1975 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1976 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1977 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1978 strlcat (litfilename, ".lit", sizeof (litfilename));
1979 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1980 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1983 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1985 i = LittleLong(((int *)data)[1]);
1988 if (developer_loading.integer)
1989 Con_Printf("loaded %s\n", litfilename);
1990 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1991 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1993 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1996 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1998 i = LittleLong(((int *)data)[1]);
2001 if (developer_loading.integer)
2002 Con_Printf("loaded %s\n", dlitfilename);
2003 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
2004 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
2005 loadmodel->brushq3.deluxemapping_modelspace = false;
2006 loadmodel->brushq3.deluxemapping = true;
2015 Con_Printf("Unknown .lit file version (%d)\n", i);
2017 else if (filesize == 8)
2018 Con_Print("Empty .lit file, ignoring\n");
2020 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
2027 // LordHavoc: oh well, expand the white lighting data
2030 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
2031 in = mod_base + l->fileofs;
2032 out = loadmodel->brushq1.lightdata;
2033 for (i = 0;i < l->filelen;i++)
2043 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
2045 loadmodel->brushq1.num_compressedpvs = 0;
2046 loadmodel->brushq1.data_compressedpvs = NULL;
2049 loadmodel->brushq1.num_compressedpvs = l->filelen;
2050 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
2051 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
2054 // used only for HalfLife maps
2055 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
2057 char key[128], value[4096];
2061 if (!COM_ParseToken_Simple(&data, false, false))
2063 if (com_token[0] != '{')
2067 if (!COM_ParseToken_Simple(&data, false, false))
2069 if (com_token[0] == '}')
2070 break; // end of worldspawn
2071 if (com_token[0] == '_')
2072 strlcpy(key, com_token + 1, sizeof(key));
2074 strlcpy(key, com_token, sizeof(key));
2075 while (key[strlen(key)-1] == ' ') // remove trailing spaces
2076 key[strlen(key)-1] = 0;
2077 if (!COM_ParseToken_Simple(&data, false, false))
2079 dpsnprintf(value, sizeof(value), "%s", com_token);
2080 if (!strcmp("wad", key)) // for HalfLife maps
2082 if (loadmodel->brush.ishlbsp)
2085 for (i = 0;i < (int)sizeof(value);i++)
2086 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
2090 for (;i < (int)sizeof(value);i++)
2092 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
2093 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
2095 else if (value[i] == ';' || value[i] == 0)
2099 W_LoadTextureWadFile(&value[j], false);
2111 static void Mod_Q1BSP_LoadEntities(lump_t *l)
2113 loadmodel->brush.entities = NULL;
2116 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
2117 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
2118 loadmodel->brush.entities[l->filelen] = 0;
2119 if (loadmodel->brush.ishlbsp)
2120 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
2124 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
2130 in = (dvertex_t *)(mod_base + l->fileofs);
2131 if (l->filelen % sizeof(*in))
2132 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
2133 count = l->filelen / sizeof(*in);
2134 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2136 loadmodel->brushq1.vertexes = out;
2137 loadmodel->brushq1.numvertexes = count;
2139 for ( i=0 ; i<count ; i++, in++, out++)
2141 out->position[0] = LittleFloat(in->point[0]);
2142 out->position[1] = LittleFloat(in->point[1]);
2143 out->position[2] = LittleFloat(in->point[2]);
2147 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
2148 // can be used for this
2150 int SB_ReadInt (unsigned char **buffer)
2153 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
2159 float SB_ReadFloat (unsigned char **buffer)
2167 u.i = SB_ReadInt (buffer);
2171 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
2173 unsigned char *index;
2177 index = (unsigned char *)(mod_base + l->fileofs);
2178 if (l->filelen % (48+4*hullinfo->filehulls))
2179 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
2181 count = l->filelen / (48+4*hullinfo->filehulls);
2182 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
2184 loadmodel->brushq1.submodels = out;
2185 loadmodel->brush.numsubmodels = count;
2187 for (i = 0; i < count; i++, out++)
2189 // spread out the mins / maxs by a pixel
2190 out->mins[0] = SB_ReadFloat (&index) - 1;
2191 out->mins[1] = SB_ReadFloat (&index) - 1;
2192 out->mins[2] = SB_ReadFloat (&index) - 1;
2193 out->maxs[0] = SB_ReadFloat (&index) + 1;
2194 out->maxs[1] = SB_ReadFloat (&index) + 1;
2195 out->maxs[2] = SB_ReadFloat (&index) + 1;
2196 out->origin[0] = SB_ReadFloat (&index);
2197 out->origin[1] = SB_ReadFloat (&index);
2198 out->origin[2] = SB_ReadFloat (&index);
2199 for (j = 0; j < hullinfo->filehulls; j++)
2200 out->headnode[j] = SB_ReadInt (&index);
2201 out->visleafs = SB_ReadInt (&index);
2202 out->firstface = SB_ReadInt (&index);
2203 out->numfaces = SB_ReadInt (&index);
2207 static void Mod_Q1BSP_LoadEdges(lump_t *l)
2213 in = (dedge_t *)(mod_base + l->fileofs);
2214 if (l->filelen % sizeof(*in))
2215 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2216 count = l->filelen / sizeof(*in);
2217 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2219 loadmodel->brushq1.edges = out;
2220 loadmodel->brushq1.numedges = count;
2222 for ( i=0 ; i<count ; i++, in++, out++)
2224 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2225 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2226 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2228 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);
2229 if(!loadmodel->brushq1.numvertexes)
2230 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2238 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2242 int i, j, k, count, miptex;
2244 in = (texinfo_t *)(mod_base + l->fileofs);
2245 if (l->filelen % sizeof(*in))
2246 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2247 count = l->filelen / sizeof(*in);
2248 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2250 loadmodel->brushq1.texinfo = out;
2251 loadmodel->brushq1.numtexinfo = count;
2253 for (i = 0;i < count;i++, in++, out++)
2255 for (k = 0;k < 2;k++)
2256 for (j = 0;j < 4;j++)
2257 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2259 miptex = LittleLong(in->miptex);
2260 out->flags = LittleLong(in->flags);
2262 out->texture = NULL;
2263 if (loadmodel->data_textures)
2265 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2266 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2268 out->texture = loadmodel->data_textures + miptex;
2270 if (out->flags & TEX_SPECIAL)
2272 // if texture chosen is NULL or the shader needs a lightmap,
2273 // force to notexture water shader
2274 if (out->texture == NULL)
2275 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2279 // if texture chosen is NULL, force to notexture
2280 if (out->texture == NULL)
2281 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2287 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2292 mins[0] = mins[1] = mins[2] = 9999;
2293 maxs[0] = maxs[1] = maxs[2] = -9999;
2295 for (i = 0;i < numverts;i++)
2297 for (j = 0;j < 3;j++, v++)
2307 #define MAX_SUBDIVPOLYTRIANGLES 4096
2308 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2310 static int subdivpolyverts, subdivpolytriangles;
2311 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2312 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2314 static int subdivpolylookupvert(vec3_t v)
2317 for (i = 0;i < subdivpolyverts;i++)
2318 if (subdivpolyvert[i][0] == v[0]
2319 && subdivpolyvert[i][1] == v[1]
2320 && subdivpolyvert[i][2] == v[2])
2322 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2323 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2324 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2325 return subdivpolyverts++;
2328 static void SubdividePolygon(int numverts, float *verts)
2330 int i, i1, i2, i3, f, b, c, p;
2331 vec3_t mins, maxs, front[256], back[256];
2332 float m, *pv, *cv, dist[256], frac;
2335 Host_Error("SubdividePolygon: ran out of verts in buffer");
2337 BoundPoly(numverts, verts, mins, maxs);
2339 for (i = 0;i < 3;i++)
2341 m = (mins[i] + maxs[i]) * 0.5;
2342 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2343 if (maxs[i] - m < 8)
2345 if (m - mins[i] < 8)
2349 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2350 dist[c] = cv[i] - m;
2353 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2357 VectorCopy(pv, front[f]);
2362 VectorCopy(pv, back[b]);
2365 if (dist[p] == 0 || dist[c] == 0)
2367 if ((dist[p] > 0) != (dist[c] > 0) )
2370 frac = dist[p] / (dist[p] - dist[c]);
2371 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2372 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2373 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2379 SubdividePolygon(f, front[0]);
2380 SubdividePolygon(b, back[0]);
2384 i1 = subdivpolylookupvert(verts);
2385 i2 = subdivpolylookupvert(verts + 3);
2386 for (i = 2;i < numverts;i++)
2388 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2390 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2394 i3 = subdivpolylookupvert(verts + i * 3);
2395 subdivpolyindex[subdivpolytriangles][0] = i1;
2396 subdivpolyindex[subdivpolytriangles][1] = i2;
2397 subdivpolyindex[subdivpolytriangles][2] = i3;
2399 subdivpolytriangles++;
2403 //Breaks a polygon up along axial 64 unit
2404 //boundaries so that turbulent and sky warps
2405 //can be done reasonably.
2406 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2412 subdivpolytriangles = 0;
2413 subdivpolyverts = 0;
2414 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2415 if (subdivpolytriangles < 1)
2416 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2418 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2419 mesh->num_vertices = subdivpolyverts;
2420 mesh->num_triangles = subdivpolytriangles;
2421 mesh->vertex = (surfvertex_t *)(mesh + 1);
2422 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2423 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2425 for (i = 0;i < mesh->num_triangles;i++)
2426 for (j = 0;j < 3;j++)
2427 mesh->index[i*3+j] = subdivpolyindex[i][j];
2429 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2431 VectorCopy(subdivpolyvert[i], v->v);
2432 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2433 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2438 extern cvar_t gl_max_lightmapsize;
2439 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2442 msurface_t *surface;
2443 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2444 float texmins[2], texmaxs[2], val;
2445 rtexture_t *lightmaptexture, *deluxemaptexture;
2447 in = (dface_t *)(mod_base + l->fileofs);
2448 if (l->filelen % sizeof(*in))
2449 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2450 count = l->filelen / sizeof(*in);
2451 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2452 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2454 loadmodel->num_surfaces = count;
2456 loadmodel->brushq1.firstrender = true;
2457 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2461 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2463 numedges = (unsigned short)LittleShort(in->numedges);
2464 totalverts += numedges;
2465 totaltris += numedges - 2;
2468 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2470 lightmaptexture = NULL;
2471 deluxemaptexture = r_texture_blanknormalmap;
2473 lightmapsize = bound(256, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d);
2474 totallightmapsamples = 0;
2478 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2480 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2482 // FIXME: validate edges, texinfo, etc?
2483 firstedge = LittleLong(in->firstedge);
2484 numedges = (unsigned short)LittleShort(in->numedges);
2485 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)
2486 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2487 i = (unsigned short)LittleShort(in->texinfo);
2488 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2489 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2490 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2491 surface->texture = surface->lightmapinfo->texinfo->texture;
2493 planenum = (unsigned short)LittleShort(in->planenum);
2494 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2495 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2497 //surface->flags = surface->texture->flags;
2498 //if (LittleShort(in->side))
2499 // surface->flags |= SURF_PLANEBACK;
2500 //surface->plane = loadmodel->brush.data_planes + planenum;
2502 surface->num_firstvertex = totalverts;
2503 surface->num_vertices = numedges;
2504 surface->num_firsttriangle = totaltris;
2505 surface->num_triangles = numedges - 2;
2506 totalverts += numedges;
2507 totaltris += numedges - 2;
2509 // convert edges back to a normal polygon
2510 for (i = 0;i < surface->num_vertices;i++)
2512 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2514 // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2516 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2518 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2519 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2520 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2521 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2522 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2523 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2524 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2525 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2528 for (i = 0;i < surface->num_triangles;i++)
2530 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2531 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2532 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2535 // compile additional data about the surface geometry
2536 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);
2537 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);
2538 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2540 // generate surface extents information
2541 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2542 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2543 for (i = 1;i < surface->num_vertices;i++)
2545 for (j = 0;j < 2;j++)
2547 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2548 texmins[j] = min(texmins[j], val);
2549 texmaxs[j] = max(texmaxs[j], val);
2552 for (i = 0;i < 2;i++)
2554 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2555 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2558 smax = surface->lightmapinfo->extents[0] >> 4;
2559 tmax = surface->lightmapinfo->extents[1] >> 4;
2560 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2561 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2564 for (i = 0;i < MAXLIGHTMAPS;i++)
2565 surface->lightmapinfo->styles[i] = in->styles[i];
2566 surface->lightmaptexture = NULL;
2567 surface->deluxemaptexture = r_texture_blanknormalmap;
2568 i = LittleLong(in->lightofs);
2571 surface->lightmapinfo->samples = NULL;
2573 // give non-lightmapped water a 1x white lightmap
2574 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2576 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2577 surface->lightmapinfo->styles[0] = 0;
2578 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2582 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2583 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2584 else // LordHavoc: white lighting (bsp version 29)
2586 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2587 if (loadmodel->brushq1.nmaplightdata)
2588 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2591 // check if we should apply a lightmap to this
2592 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2594 if (ssize > 256 || tsize > 256)
2595 Host_Error("Bad surface extents");
2597 if (lightmapsize < ssize)
2598 lightmapsize = ssize;
2599 if (lightmapsize < tsize)
2600 lightmapsize = tsize;
2602 totallightmapsamples += ssize*tsize;
2604 // force lightmap upload on first time seeing the surface
2606 // additionally this is used by the later code to see if a
2607 // lightmap is needed on this surface (rather than duplicating the
2609 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2610 loadmodel->lit = true;
2614 // small maps (such as ammo boxes especially) don't need big lightmap
2615 // textures, so this code tries to guess a good size based on
2616 // totallightmapsamples (size of the lightmaps lump basically), as well as
2617 // trying to max out the size if there is a lot of lightmap data to store
2618 // additionally, never choose a lightmapsize that is smaller than the
2619 // largest surface encountered (as it would fail)
2621 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < bound(128, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d)) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2624 // now that we've decided the lightmap texture size, we can do the rest
2625 if (cls.state != ca_dedicated)
2627 int stainmapsize = 0;
2628 mod_alloclightmap_state_t allocState;
2630 Mod_AllocLightmap_Init(&allocState, lightmapsize, lightmapsize);
2631 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2633 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2634 float u, v, ubase, vbase, uscale, vscale;
2636 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2639 smax = surface->lightmapinfo->extents[0] >> 4;
2640 tmax = surface->lightmapinfo->extents[1] >> 4;
2641 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2642 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2643 stainmapsize += ssize * tsize * 3;
2645 if (!lightmaptexture || !Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy))
2647 // allocate a texture pool if we need it
2648 if (loadmodel->texturepool == NULL)
2649 loadmodel->texturepool = R_AllocTexturePool();
2650 // could not find room, make a new lightmap
2651 loadmodel->brushq3.num_mergedlightmaps = lightmapnumber + 1;
2652 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_lightmaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_lightmaps[0]));
2653 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_deluxemaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_deluxemaps[0]));
2654 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);
2655 if (loadmodel->brushq1.nmaplightdata)
2656 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);
2658 Mod_AllocLightmap_Reset(&allocState);
2659 Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy);
2661 surface->lightmaptexture = lightmaptexture;
2662 surface->deluxemaptexture = deluxemaptexture;
2663 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2664 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2666 uscale = 1.0f / (float)lightmapsize;
2667 vscale = 1.0f / (float)lightmapsize;
2668 ubase = lightmapx * uscale;
2669 vbase = lightmapy * vscale;
2671 for (i = 0;i < surface->num_vertices;i++)
2673 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);
2674 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);
2675 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2676 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2677 // LordHavoc: calc lightmap data offset for vertex lighting to use
2680 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2684 if (cl_stainmaps.integer)
2686 // allocate stainmaps for permanent marks on walls and clear white
2687 unsigned char *stainsamples = NULL;
2688 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2689 memset(stainsamples, 255, stainmapsize);
2691 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2693 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2695 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2696 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2697 surface->lightmapinfo->stainsamples = stainsamples;
2698 stainsamples += ssize * tsize * 3;
2703 // generate ushort elements array if possible
2704 if (loadmodel->surfmesh.data_element3s)
2705 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2706 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2709 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2712 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2713 node->parent = parent;
2716 // this is a node, recurse to children
2717 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2718 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2719 // combine supercontents of children
2720 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2725 mleaf_t *leaf = (mleaf_t *)node;
2726 // if this is a leaf, calculate supercontents mask from all collidable
2727 // primitives in the leaf (brushes and collision surfaces)
2728 // also flag if the leaf contains any collision surfaces
2729 leaf->combinedsupercontents = 0;
2730 // combine the supercontents values of all brushes in this leaf
2731 for (j = 0;j < leaf->numleafbrushes;j++)
2732 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2733 // check if this leaf contains any collision surfaces (q3 patches)
2734 for (j = 0;j < leaf->numleafsurfaces;j++)
2736 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2737 if (surface->num_collisiontriangles)
2739 leaf->containscollisionsurfaces = true;
2740 leaf->combinedsupercontents |= surface->texture->supercontents;
2746 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2752 in = (dnode_t *)(mod_base + l->fileofs);
2753 if (l->filelen % sizeof(*in))
2754 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2755 count = l->filelen / sizeof(*in);
2757 Host_Error("Mod_Q1BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
2758 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2760 loadmodel->brush.data_nodes = out;
2761 loadmodel->brush.num_nodes = count;
2763 for ( i=0 ; i<count ; i++, in++, out++)
2765 for (j=0 ; j<3 ; j++)
2767 out->mins[j] = LittleShort(in->mins[j]);
2768 out->maxs[j] = LittleShort(in->maxs[j]);
2771 p = LittleLong(in->planenum);
2772 out->plane = loadmodel->brush.data_planes + p;
2774 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2775 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2777 for (j=0 ; j<2 ; j++)
2779 // LordHavoc: this code supports broken bsp files produced by
2780 // arguire qbsp which can produce more than 32768 nodes, any value
2781 // below count is assumed to be a node number, any other value is
2782 // assumed to be a leaf number
2783 p = (unsigned short)LittleShort(in->children[j]);
2786 if (p < loadmodel->brush.num_nodes)
2787 out->children[j] = loadmodel->brush.data_nodes + p;
2790 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2791 // map it to the solid leaf
2792 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2797 // note this uses 65535 intentionally, -1 is leaf 0
2799 if (p < loadmodel->brush.num_leafs)
2800 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2803 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2804 // map it to the solid leaf
2805 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2811 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2814 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2820 in = (dleaf_t *)(mod_base + l->fileofs);
2821 if (l->filelen % sizeof(*in))
2822 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2823 count = l->filelen / sizeof(*in);
2824 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2826 loadmodel->brush.data_leafs = out;
2827 loadmodel->brush.num_leafs = count;
2828 // get visleafs from the submodel data
2829 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2830 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2831 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2832 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2834 for ( i=0 ; i<count ; i++, in++, out++)
2836 for (j=0 ; j<3 ; j++)
2838 out->mins[j] = LittleShort(in->mins[j]);
2839 out->maxs[j] = LittleShort(in->maxs[j]);
2842 // FIXME: this function could really benefit from some error checking
2844 out->contents = LittleLong(in->contents);
2846 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2847 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2848 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2850 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);
2851 out->firstleafsurface = NULL;
2852 out->numleafsurfaces = 0;
2855 out->clusterindex = i - 1;
2856 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2857 out->clusterindex = -1;
2859 p = LittleLong(in->visofs);
2860 // ignore visofs errors on leaf 0 (solid)
2861 if (p >= 0 && out->clusterindex >= 0)
2863 if (p >= loadmodel->brushq1.num_compressedpvs)
2864 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2866 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);
2869 for (j = 0;j < 4;j++)
2870 out->ambient_sound_level[j] = in->ambient_level[j];
2872 // FIXME: Insert caustics here
2876 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2880 const unsigned char *pvs;
2881 // if there's no vis data, assume supported (because everything is visible all the time)
2882 if (!loadmodel->brush.data_pvsclusters)
2884 // check all liquid leafs to see if they can see into empty leafs, if any
2885 // can we can assume this map supports r_wateralpha
2886 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2888 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2890 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2891 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2892 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2899 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2906 in = (dclipnode_t *)(mod_base + l->fileofs);
2907 if (l->filelen % sizeof(*in))
2908 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2909 count = l->filelen / sizeof(*in);
2910 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2912 loadmodel->brushq1.clipnodes = out;
2913 loadmodel->brushq1.numclipnodes = count;
2915 for (i = 1; i < MAX_MAP_HULLS; i++)
2917 hull = &loadmodel->brushq1.hulls[i];
2918 hull->clipnodes = out;
2919 hull->firstclipnode = 0;
2920 hull->lastclipnode = count-1;
2921 hull->planes = loadmodel->brush.data_planes;
2922 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2923 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2924 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2925 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2926 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2927 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2928 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2931 for (i=0 ; i<count ; i++, out++, in++)
2933 out->planenum = LittleLong(in->planenum);
2934 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2935 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2936 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2937 if (out->children[0] >= count)
2938 out->children[0] -= 65536;
2939 if (out->children[1] >= count)
2940 out->children[1] -= 65536;
2941 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2942 Host_Error("Corrupt clipping hull(out of range planenum)");
2946 //Duplicate the drawing hull structure as a clipping hull
2947 static void Mod_Q1BSP_MakeHull0(void)
2954 hull = &loadmodel->brushq1.hulls[0];
2956 in = loadmodel->brush.data_nodes;
2957 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2959 hull->clipnodes = out;
2960 hull->firstclipnode = 0;
2961 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2962 hull->planes = loadmodel->brush.data_planes;
2964 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2966 out->planenum = in->plane - loadmodel->brush.data_planes;
2967 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2968 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2972 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2977 in = (short *)(mod_base + l->fileofs);
2978 if (l->filelen % sizeof(*in))
2979 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2980 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2981 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2983 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2985 j = (unsigned short) LittleShort(in[i]);
2986 if (j >= loadmodel->num_surfaces)
2987 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2988 loadmodel->brush.data_leafsurfaces[i] = j;
2992 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2997 in = (int *)(mod_base + l->fileofs);
2998 if (l->filelen % sizeof(*in))
2999 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
3000 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
3001 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
3003 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
3004 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
3008 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
3014 in = (dplane_t *)(mod_base + l->fileofs);
3015 if (l->filelen % sizeof(*in))
3016 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
3018 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
3019 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
3021 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
3023 out->normal[0] = LittleFloat(in->normal[0]);
3024 out->normal[1] = LittleFloat(in->normal[1]);
3025 out->normal[2] = LittleFloat(in->normal[2]);
3026 out->dist = LittleFloat(in->dist);
3032 static void Mod_Q1BSP_LoadMapBrushes(void)
3036 int submodel, numbrushes;
3037 qboolean firstbrush;
3038 char *text, *maptext;
3039 char mapfilename[MAX_QPATH];
3040 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
3041 strlcat (mapfilename, ".map", sizeof (mapfilename));
3042 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
3046 if (!COM_ParseToken_Simple(&data, false, false))
3051 if (!COM_ParseToken_Simple(&data, false, false))
3053 if (com_token[0] != '{')
3059 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
3062 if (!COM_ParseToken_Simple(&data, false, false))
3064 if (com_token[0] == '}')
3065 break; // end of entity
3066 if (com_token[0] == '{')
3073 if (submodel > loadmodel->brush.numsubmodels)
3075 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
3079 model = loadmodel->brush.submodels[submodel];
3086 if (!COM_ParseToken_Simple(&data, false, false))
3088 if (com_token[0] == '}')
3089 break; // end of brush
3090 // each brush face should be this format:
3091 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
3092 // FIXME: support hl .map format
3093 for (pointnum = 0;pointnum < 3;pointnum++)
3095 COM_ParseToken_Simple(&data, false, false);
3096 for (componentnum = 0;componentnum < 3;componentnum++)
3098 COM_ParseToken_Simple(&data, false, false);
3099 point[pointnum][componentnum] = atof(com_token);
3101 COM_ParseToken_Simple(&data, false, false);
3103 COM_ParseToken_Simple(&data, false, false);
3104 strlcpy(facetexture, com_token, sizeof(facetexture));
3105 COM_ParseToken_Simple(&data, false, false);
3106 //scroll_s = atof(com_token);
3107 COM_ParseToken_Simple(&data, false, false);
3108 //scroll_t = atof(com_token);
3109 COM_ParseToken_Simple(&data, false, false);
3110 //rotate = atof(com_token);
3111 COM_ParseToken_Simple(&data, false, false);
3112 //scale_s = atof(com_token);
3113 COM_ParseToken_Simple(&data, false, false);
3114 //scale_t = atof(com_token);
3115 TriangleNormal(point[0], point[1], point[2], planenormal);
3116 VectorNormalizeDouble(planenormal);
3117 planedist = DotProduct(point[0], planenormal);
3118 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
3128 #define MAX_PORTALPOINTS 64
3130 typedef struct portal_s
3133 mnode_t *nodes[2]; // [0] = front side of plane
3134 struct portal_s *next[2];
3136 double points[3*MAX_PORTALPOINTS];
3137 struct portal_s *chain; // all portals are linked into a list
3141 static memexpandablearray_t portalarray;
3143 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
3145 // process only nodes (leafs already had their box calculated)
3149 // calculate children first
3150 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
3151 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
3153 // make combined bounding box from children
3154 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
3155 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
3156 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
3157 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
3158 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
3159 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
3162 static void Mod_Q1BSP_FinalizePortals(void)
3164 int i, j, numportals, numpoints, portalindex, portalrange = Mem_ExpandableArray_IndexRange(&portalarray);
3168 mleaf_t *leaf, *endleaf;
3170 // tally up portal and point counts and recalculate bounding boxes for all
3171 // leafs (because qbsp is very sloppy)
3172 leaf = loadmodel->brush.data_leafs;
3173 endleaf = leaf + loadmodel->brush.num_leafs;
3174 if (mod_recalculatenodeboxes.integer)
3176 for (;leaf < endleaf;leaf++)
3178 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
3179 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3184 for (portalindex = 0;portalindex < portalrange;portalindex++)
3186 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3189 // note: this check must match the one below or it will usually corrupt memory
3190 // 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
3191 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3194 numpoints += p->numpoints * 2;
3197 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3198 loadmodel->brush.num_portals = numportals;
3199 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3200 loadmodel->brush.num_portalpoints = numpoints;
3201 // clear all leaf portal chains
3202 for (i = 0;i < loadmodel->brush.num_leafs;i++)
3203 loadmodel->brush.data_leafs[i].portals = NULL;
3204 // process all portals in the global portal chain, while freeing them
3205 portal = loadmodel->brush.data_portals;
3206 point = loadmodel->brush.data_portalpoints;
3207 for (portalindex = 0;portalindex < portalrange;portalindex++)
3209 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3212 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3214 // note: this check must match the one above or it will usually corrupt memory
3215 // 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
3216 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3218 // first make the back to front portal(forward portal)
3219 portal->points = point;
3220 portal->numpoints = p->numpoints;
3221 portal->plane.dist = p->plane.dist;
3222 VectorCopy(p->plane.normal, portal->plane.normal);
3223 portal->here = (mleaf_t *)p->nodes[1];
3224 portal->past = (mleaf_t *)p->nodes[0];
3226 for (j = 0;j < portal->numpoints;j++)
3228 VectorCopy(p->points + j*3, point->position);
3231 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3232 PlaneClassify(&portal->plane);
3234 // link into leaf's portal chain
3235 portal->next = portal->here->portals;
3236 portal->here->portals = portal;
3238 // advance to next portal
3241 // then make the front to back portal(backward portal)
3242 portal->points = point;
3243 portal->numpoints = p->numpoints;
3244 portal->plane.dist = -p->plane.dist;
3245 VectorNegate(p->plane.normal, portal->plane.normal);
3246 portal->here = (mleaf_t *)p->nodes[0];
3247 portal->past = (mleaf_t *)p->nodes[1];
3249 for (j = portal->numpoints - 1;j >= 0;j--)
3251 VectorCopy(p->points + j*3, point->position);
3254 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3255 PlaneClassify(&portal->plane);
3257 // link into leaf's portal chain
3258 portal->next = portal->here->portals;
3259 portal->here->portals = portal;
3261 // advance to next portal
3264 // add the portal's polygon points to the leaf bounding boxes
3265 if (mod_recalculatenodeboxes.integer)
3267 for (i = 0;i < 2;i++)
3269 leaf = (mleaf_t *)p->nodes[i];
3270 for (j = 0;j < p->numpoints;j++)
3272 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3273 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3274 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3275 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3276 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3277 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3283 // now recalculate the node bounding boxes from the leafs
3284 if (mod_recalculatenodeboxes.integer)
3285 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3293 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3296 Host_Error("AddPortalToNodes: NULL front node");
3298 Host_Error("AddPortalToNodes: NULL back node");
3299 if (p->nodes[0] || p->nodes[1])
3300 Host_Error("AddPortalToNodes: already included");
3301 // 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
3303 p->nodes[0] = front;
3304 p->next[0] = (portal_t *)front->portals;
3305 front->portals = (mportal_t *)p;
3308 p->next[1] = (portal_t *)back->portals;
3309 back->portals = (mportal_t *)p;
3314 RemovePortalFromNode
3317 static void RemovePortalFromNodes(portal_t *portal)
3321 void **portalpointer;
3323 for (i = 0;i < 2;i++)
3325 node = portal->nodes[i];
3327 portalpointer = (void **) &node->portals;
3330 t = (portal_t *)*portalpointer;
3332 Host_Error("RemovePortalFromNodes: portal not in leaf");
3336 if (portal->nodes[0] == node)
3338 *portalpointer = portal->next[0];
3339 portal->nodes[0] = NULL;
3341 else if (portal->nodes[1] == node)
3343 *portalpointer = portal->next[1];
3344 portal->nodes[1] = NULL;
3347 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3351 if (t->nodes[0] == node)
3352 portalpointer = (void **) &t->next[0];
3353 else if (t->nodes[1] == node)
3354 portalpointer = (void **) &t->next[1];
3356 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3361 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3362 static double *portalpointsbuffer;
3363 static int portalpointsbufferoffset;
3364 static int portalpointsbuffersize;
3365 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3368 mnode_t *front, *back, *other_node;
3369 mplane_t clipplane, *plane;
3370 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3371 int numfrontpoints, numbackpoints;
3372 double *frontpoints, *backpoints;
3374 // if a leaf, we're done
3378 // get some space for our clipping operations to use
3379 if (portalpointsbuffersize < portalpointsbufferoffset + 6*MAX_PORTALPOINTS)
3381 portalpointsbuffersize = portalpointsbufferoffset * 2;
3382 portalpointsbuffer = (double *)Mem_Realloc(loadmodel->mempool, portalpointsbuffer, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3384 frontpoints = portalpointsbuffer + portalpointsbufferoffset;
3385 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3386 backpoints = portalpointsbuffer + portalpointsbufferoffset;
3387 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3389 plane = node->plane;
3391 front = node->children[0];
3392 back = node->children[1];
3394 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3396 // create the new portal by generating a polygon for the node plane,
3397 // and clipping it by all of the other portals(which came from nodes above this one)
3398 nodeportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3399 nodeportal->plane = *plane;
3401 // 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)
3402 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);
3403 nodeportal->numpoints = 4;
3404 side = 0; // shut up compiler warning
3405 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3407 clipplane = portal->plane;
3408 if (portal->nodes[0] == portal->nodes[1])
3409 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3410 if (portal->nodes[0] == node)
3412 else if (portal->nodes[1] == node)
3414 clipplane.dist = -clipplane.dist;
3415 VectorNegate(clipplane.normal, clipplane.normal);
3419 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3421 for (i = 0;i < nodeportal->numpoints*3;i++)
3422 frontpoints[i] = nodeportal->points[i];
3423 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);
3424 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3428 if (nodeportal->numpoints < 3)
3430 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3431 nodeportal->numpoints = 0;
3433 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3435 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3436 nodeportal->numpoints = 0;
3439 AddPortalToNodes(nodeportal, front, back);
3441 // split the portals of this node along this node's plane and assign them to the children of this node
3442 // (migrating the portals downward through the tree)
3443 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3445 if (portal->nodes[0] == portal->nodes[1])
3446 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3447 if (portal->nodes[0] == node)
3449 else if (portal->nodes[1] == node)
3452 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3453 nextportal = portal->next[side];
3454 if (!portal->numpoints)
3457 other_node = portal->nodes[!side];
3458 RemovePortalFromNodes(portal);
3460 // cut the portal into two portals, one on each side of the node plane
3461 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);
3463 if (!numfrontpoints)
3466 AddPortalToNodes(portal, back, other_node);
3468 AddPortalToNodes(portal, other_node, back);
3474 AddPortalToNodes(portal, front, other_node);
3476 AddPortalToNodes(portal, other_node, front);
3480 // the portal is split
3481 splitportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3482 temp = splitportal->chain;
3483 *splitportal = *portal;
3484 splitportal->chain = temp;
3485 for (i = 0;i < numbackpoints*3;i++)
3486 splitportal->points[i] = backpoints[i];
3487 splitportal->numpoints = numbackpoints;
3488 for (i = 0;i < numfrontpoints*3;i++)
3489 portal->points[i] = frontpoints[i];
3490 portal->numpoints = numfrontpoints;
3494 AddPortalToNodes(portal, front, other_node);
3495 AddPortalToNodes(splitportal, back, other_node);
3499 AddPortalToNodes(portal, other_node, front);
3500 AddPortalToNodes(splitportal, other_node, back);
3504 Mod_Q1BSP_RecursiveNodePortals(front);
3505 Mod_Q1BSP_RecursiveNodePortals(back);
3507 portalpointsbufferoffset -= 6*MAX_PORTALPOINTS;
3510 static void Mod_Q1BSP_MakePortals(void)
3512 Mem_ExpandableArray_NewArray(&portalarray, loadmodel->mempool, sizeof(portal_t), 1020*1024/sizeof(portal_t));
3513 portalpointsbufferoffset = 0;
3514 portalpointsbuffersize = 6*MAX_PORTALPOINTS*128;
3515 portalpointsbuffer = (double *)Mem_Alloc(loadmodel->mempool, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3516 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3517 Mem_Free(portalpointsbuffer);
3518 portalpointsbuffer = NULL;
3519 portalpointsbufferoffset = 0;
3520 portalpointsbuffersize = 0;
3521 Mod_Q1BSP_FinalizePortals();
3522 Mem_ExpandableArray_FreeArray(&portalarray);
3525 //Returns PVS data for a given point
3526 //(note: can return NULL)
3527 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3530 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3532 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3533 if (((mleaf_t *)node)->clusterindex >= 0)
3534 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3539 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)
3543 float d = PlaneDiff(org, node->plane);
3545 node = node->children[0];
3546 else if (d < -radius)
3547 node = node->children[1];
3550 // go down both sides
3551 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3552 node = node->children[1];
3555 // if this leaf is in a cluster, accumulate the pvs bits
3556 if (((mleaf_t *)node)->clusterindex >= 0)
3559 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3560 for (i = 0;i < pvsbytes;i++)
3561 pvsbuffer[i] |= pvs[i];
3565 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3566 //of the given point.
3567 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3569 int bytes = model->brush.num_pvsclusterbytes;
3570 bytes = min(bytes, pvsbufferlength);
3571 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3573 memset(pvsbuffer, 0xFF, bytes);
3577 memset(pvsbuffer, 0, bytes);
3578 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3582 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3587 VectorSubtract(inmaxs, inmins, size);
3588 if (cmodel->brush.ishlbsp)
3591 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3592 else if (size[0] <= 32)
3594 if (size[2] < 54) // pick the nearest of 36 or 72
3595 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3597 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3600 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3605 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3606 else if (size[0] <= 32)
3607 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3609 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3611 VectorCopy(inmins, outmins);
3612 VectorAdd(inmins, hull->clip_size, outmaxs);
3615 static int Mod_Q1BSP_CreateShadowMesh(dp_model_t *mod)
3618 int numshadowmeshtriangles = 0;
3619 msurface_t *surface;
3620 if (cls.state == ca_dedicated)
3622 // make a single combined shadow mesh to allow optimized shadow volume creation
3624 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3626 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3627 numshadowmeshtriangles += surface->num_triangles;
3629 mod->brush.shadowmesh = Mod_ShadowMesh_Begin(mod->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3630 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3631 if (surface->num_triangles > 0)
3632 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));
3633 mod->brush.shadowmesh = Mod_ShadowMesh_Finish(mod->mempool, mod->brush.shadowmesh, false, r_enableshadowvolumes.integer != 0, false);
3634 if (mod->brush.shadowmesh && mod->brush.shadowmesh->neighbor3i)
3635 Mod_BuildTriangleNeighbors(mod->brush.shadowmesh->neighbor3i, mod->brush.shadowmesh->element3i, mod->brush.shadowmesh->numtriangles);
3637 return numshadowmeshtriangles;
3640 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);
3642 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3647 float dist, modelyawradius, modelradius;
3648 msurface_t *surface;
3649 hullinfo_t hullinfo;
3650 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3651 model_brush_lightstyleinfo_t styleinfo[256];
3652 unsigned char *datapointer;
3654 mod->modeldatatypestring = "Q1BSP";
3656 mod->type = mod_brushq1;
3658 header = (dheader_t *)buffer;
3660 i = LittleLong(header->version);
3661 if (i != BSPVERSION && i != 30)
3662 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3663 mod->brush.ishlbsp = i == 30;
3665 // fill in hull info
3666 VectorClear (hullinfo.hullsizes[0][0]);
3667 VectorClear (hullinfo.hullsizes[0][1]);
3668 if (mod->brush.ishlbsp)
3670 mod->modeldatatypestring = "HLBSP";
3672 hullinfo.filehulls = 4;
3673 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3674 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3675 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3676 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3677 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3678 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3682 hullinfo.filehulls = 4;
3683 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3684 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3685 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3686 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3690 mod_base = (unsigned char*)buffer;
3691 for (i = 0; i < HEADER_LUMPS; i++)
3693 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3694 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3697 mod->soundfromcenter = true;
3698 mod->TraceBox = Mod_Q1BSP_TraceBox;
3699 mod->TraceLine = Mod_Q1BSP_TraceLineAgainstSurfaces; // LordHavoc: use the surface-hitting version of TraceLine in all cases
3700 mod->TracePoint = Mod_Q1BSP_TracePoint;
3701 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3702 mod->TraceLineAgainstSurfaces = Mod_Q1BSP_TraceLineAgainstSurfaces;
3703 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3704 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3705 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3706 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3707 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3708 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3709 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3710 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3711 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3712 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3713 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3714 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3715 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3716 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3717 mod->Draw = R_Q1BSP_Draw;
3718 mod->DrawDepth = R_Q1BSP_DrawDepth;
3719 mod->DrawDebug = R_Q1BSP_DrawDebug;
3720 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
3721 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3722 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3723 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3724 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3725 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3726 mod->DrawLight = R_Q1BSP_DrawLight;
3730 mod->brush.qw_md4sum = 0;
3731 mod->brush.qw_md4sum2 = 0;
3732 for (i = 0;i < HEADER_LUMPS;i++)
3735 if (i == LUMP_ENTITIES)
3737 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3738 mod->brush.qw_md4sum ^= LittleLong(temp);
3739 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3741 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3742 mod->brush.qw_md4sum2 ^= LittleLong(temp);
3745 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3746 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3747 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3748 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3749 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3750 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3751 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3752 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3753 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3754 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3755 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3756 // load submodels before leafs because they contain the number of vis leafs
3757 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3758 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3759 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3760 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3762 // check if the map supports transparent water rendering
3763 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3765 if (mod->brushq1.data_compressedpvs)
3766 Mem_Free(mod->brushq1.data_compressedpvs);
3767 mod->brushq1.data_compressedpvs = NULL;
3768 mod->brushq1.num_compressedpvs = 0;
3770 Mod_Q1BSP_MakeHull0();
3771 if (mod_bsp_portalize.integer)
3772 Mod_Q1BSP_MakePortals();
3774 mod->numframes = 2; // regular and alternate animation
3777 // make a single combined shadow mesh to allow optimized shadow volume creation
3778 Mod_Q1BSP_CreateShadowMesh(loadmodel);
3780 if (loadmodel->brush.numsubmodels)
3781 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3783 // LordHavoc: to clear the fog around the original quake submodel code, I
3785 // first of all, some background info on the submodels:
3786 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3787 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3788 // now the weird for loop itself:
3789 // the loop functions in an odd way, on each iteration it sets up the
3790 // current 'mod' model (which despite the confusing code IS the model of
3791 // the number i), at the end of the loop it duplicates the model to become
3792 // the next submodel, and loops back to set up the new submodel.
3794 // LordHavoc: now the explanation of my sane way (which works identically):
3795 // set up the world model, then on each submodel copy from the world model
3796 // and set up the submodel with the respective model info.
3797 totalstylesurfaces = 0;
3799 for (i = 0;i < mod->brush.numsubmodels;i++)
3801 memset(stylecounts, 0, sizeof(stylecounts));
3802 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3804 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3805 for (j = 0;j < MAXLIGHTMAPS;j++)
3806 stylecounts[surface->lightmapinfo->styles[j]]++;
3808 for (k = 0;k < 255;k++)
3812 totalstylesurfaces += stylecounts[k];
3815 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3816 for (i = 0;i < mod->brush.numsubmodels;i++)
3818 // LordHavoc: this code was originally at the end of this loop, but
3819 // has been transformed to something more readable at the start here.
3824 // duplicate the basic information
3825 dpsnprintf(name, sizeof(name), "*%i", i);
3826 mod = Mod_FindName(name, loadmodel->name);
3827 // copy the base model to this one
3829 // rename the clone back to its proper name
3830 strlcpy(mod->name, name, sizeof(mod->name));
3831 mod->brush.parentmodel = loadmodel;
3832 // textures and memory belong to the main model
3833 mod->texturepool = NULL;
3834 mod->mempool = NULL;
3835 mod->brush.GetPVS = NULL;
3836 mod->brush.FatPVS = NULL;
3837 mod->brush.BoxTouchingPVS = NULL;
3838 mod->brush.BoxTouchingLeafPVS = NULL;
3839 mod->brush.BoxTouchingVisibleLeafs = NULL;
3840 mod->brush.FindBoxClusters = NULL;
3841 mod->brush.LightPoint = NULL;
3842 mod->brush.AmbientSoundLevelsForPoint = NULL;
3845 mod->brush.submodel = i;
3847 if (loadmodel->brush.submodels)
3848 loadmodel->brush.submodels[i] = mod;
3850 bm = &mod->brushq1.submodels[i];
3852 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3853 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3855 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3856 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3859 mod->firstmodelsurface = bm->firstface;
3860 mod->nummodelsurfaces = bm->numfaces;
3862 // set node/leaf parents for this submodel
3863 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
3865 // make the model surface list (used by shadowing/lighting)
3866 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3867 Mod_MakeSortedSurfaces(mod);
3869 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3870 // (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)
3871 VectorCopy(bm->mins, mod->normalmins);
3872 VectorCopy(bm->maxs, mod->normalmaxs);
3873 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3874 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3875 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3876 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3877 modelradius = modelyawradius + modelradius * modelradius;
3878 modelyawradius = sqrt(modelyawradius);
3879 modelradius = sqrt(modelradius);
3880 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3881 mod->yawmins[2] = mod->normalmins[2];
3882 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
3883 mod->yawmaxs[2] = mod->normalmaxs[2];
3884 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3885 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3886 mod->radius = modelradius;
3887 mod->radius2 = modelradius * modelradius;
3889 // this gets altered below if sky or water is used
3890 mod->DrawSky = NULL;
3891 mod->DrawAddWaterPlanes = NULL;
3893 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3894 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3895 if (mod->nummodelsurfaces)
3897 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3898 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3900 if (j < mod->nummodelsurfaces)
3901 mod->DrawSky = R_Q1BSP_DrawSky;
3903 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3904 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
3906 if (j < mod->nummodelsurfaces)
3907 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3909 // build lightstyle update chains
3910 // (used to rapidly mark lightmapupdateflags on many surfaces
3911 // when d_lightstylevalue changes)
3912 memset(stylecounts, 0, sizeof(stylecounts));
3913 for (k = 0;k < mod->nummodelsurfaces;k++)
3915 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3916 for (j = 0;j < MAXLIGHTMAPS;j++)
3917 stylecounts[surface->lightmapinfo->styles[j]]++;
3919 mod->brushq1.num_lightstyles = 0;
3920 for (k = 0;k < 255;k++)
3924 styleinfo[mod->brushq1.num_lightstyles].style = k;
3925 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3926 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3927 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3928 remapstyles[k] = mod->brushq1.num_lightstyles;
3929 mod->brushq1.num_lightstyles++;
3932 for (k = 0;k < mod->nummodelsurfaces;k++)
3934 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3935 for (j = 0;j < MAXLIGHTMAPS;j++)
3937 if (surface->lightmapinfo->styles[j] != 255)
3939 int r = remapstyles[surface->lightmapinfo->styles[j]];
3940 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3944 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3945 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3949 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3950 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3952 //mod->brushq1.num_visleafs = bm->visleafs;
3954 // build a Bounding Interval Hierarchy for culling triangles in light rendering
3955 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
3957 if (mod_q1bsp_polygoncollisions.integer)
3959 mod->collision_bih = mod->render_bih;
3960 // point traces and contents checks still use the bsp tree
3961 mod->TraceLine = Mod_CollisionBIH_TraceLine;
3962 mod->TraceBox = Mod_CollisionBIH_TraceBox;
3963 mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
3964 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLineAgainstSurfaces;
3967 // generate VBOs and other shared data before cloning submodels
3971 Mod_Q1BSP_LoadMapBrushes();
3972 //Mod_Q1BSP_ProcessLightList();
3976 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);
3979 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3983 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3990 in = (void *)(mod_base + l->fileofs);
3991 if (l->filelen % sizeof(*in))
3992 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3993 count = l->filelen / sizeof(*in);
3994 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3997 loadmodel->num = count;
3999 for (i = 0;i < count;i++, in++, out++)
4005 static void Mod_Q2BSP_LoadVertices(lump_t *l)
4012 in = (void *)(mod_base + l->fileofs);
4013 if (l->filelen % sizeof(*in))
4014 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4015 count = l->filelen / sizeof(*in);
4016 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4019 loadmodel->num = count;
4021 for (i = 0;i < count;i++, in++, out++)
4027 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
4034 in = (void *)(mod_base + l->fileofs);
4035 if (l->filelen % sizeof(*in))
4036 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
4037 count = l->filelen / sizeof(*in);
4038 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4041 loadmodel->num = count;
4043 for (i = 0;i < count;i++, in++, out++)
4049 static void Mod_Q2BSP_LoadNodes(lump_t *l)
4056 in = (void *)(mod_base + l->fileofs);
4057 if (l->filelen % sizeof(*in))
4058 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4059 count = l->filelen / sizeof(*in);
4060 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4063 loadmodel->num = count;
4065 for (i = 0;i < count;i++, in++, out++)
4071 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
4078 in = (void *)(mod_base + l->fileofs);
4079 if (l->filelen % sizeof(*in))
4080 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
4081 count = l->filelen / sizeof(*in);
4082 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4085 loadmodel->num = count;
4087 for (i = 0;i < count;i++, in++, out++)
4093 static void Mod_Q2BSP_LoadFaces(lump_t *l)
4100 in = (void *)(mod_base + l->fileofs);
4101 if (l->filelen % sizeof(*in))
4102 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4103 count = l->filelen / sizeof(*in);
4104 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4107 loadmodel->num = count;
4109 for (i = 0;i < count;i++, in++, out++)
4115 static void Mod_Q2BSP_LoadLighting(lump_t *l)
4122 in = (void *)(mod_base + l->fileofs);
4123 if (l->filelen % sizeof(*in))
4124 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
4125 count = l->filelen / sizeof(*in);
4126 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4129 loadmodel->num = count;
4131 for (i = 0;i < count;i++, in++, out++)
4137 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
4144 in = (void *)(mod_base + l->fileofs);
4145 if (l->filelen % sizeof(*in))
4146 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4147 count = l->filelen / sizeof(*in);
4148 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4151 loadmodel->num = count;
4153 for (i = 0;i < count;i++, in++, out++)
4159 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
4166 in = (void *)(mod_base + l->fileofs);
4167 if (l->filelen % sizeof(*in))
4168 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4169 count = l->filelen / sizeof(*in);
4170 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4173 loadmodel->num = count;
4175 for (i = 0;i < count;i++, in++, out++)
4181 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
4188 in = (void *)(mod_base + l->fileofs);
4189 if (l->filelen % sizeof(*in))
4190 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4191 count = l->filelen / sizeof(*in);
4192 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4195 loadmodel->num = count;
4197 for (i = 0;i < count;i++, in++, out++)
4203 static void Mod_Q2BSP_LoadEdges(lump_t *l)
4210 in = (void *)(mod_base + l->fileofs);
4211 if (l->filelen % sizeof(*in))
4212 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
4213 count = l->filelen / sizeof(*in);
4214 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4217 loadmodel->num = count;
4219 for (i = 0;i < count;i++, in++, out++)
4225 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
4232 in = (void *)(mod_base + l->fileofs);
4233 if (l->filelen % sizeof(*in))
4234 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
4235 count = l->filelen / sizeof(*in);
4236 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4239 loadmodel->num = count;
4241 for (i = 0;i < count;i++, in++, out++)
4247 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4254 in = (void *)(mod_base + l->fileofs);
4255 if (l->filelen % sizeof(*in))
4256 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4257 count = l->filelen / sizeof(*in);
4258 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4261 loadmodel->num = count;
4263 for (i = 0;i < count;i++, in++, out++)
4269 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4276 in = (void *)(mod_base + l->fileofs);
4277 if (l->filelen % sizeof(*in))
4278 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4279 count = l->filelen / sizeof(*in);
4280 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4283 loadmodel->num = count;
4285 for (i = 0;i < count;i++, in++, out++)
4291 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4298 in = (void *)(mod_base + l->fileofs);
4299 if (l->filelen % sizeof(*in))
4300 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4301 count = l->filelen / sizeof(*in);
4302 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4305 loadmodel->num = count;
4307 for (i = 0;i < count;i++, in++, out++)
4313 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4320 in = (void *)(mod_base + l->fileofs);
4321 if (l->filelen % sizeof(*in))
4322 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4323 count = l->filelen / sizeof(*in);
4324 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4327 loadmodel->num = count;
4329 for (i = 0;i < count;i++, in++, out++)
4335 static void Mod_Q2BSP_LoadModels(lump_t *l)
4342 in = (void *)(mod_base + l->fileofs);
4343 if (l->filelen % sizeof(*in))
4344 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4345 count = l->filelen / sizeof(*in);
4346 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4349 loadmodel->num = count;
4351 for (i = 0;i < count;i++, in++, out++)
4357 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4360 q2dheader_t *header;
4362 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4364 mod->modeldatatypestring = "Q2BSP";
4366 mod->type = mod_brushq2;
4368 header = (q2dheader_t *)buffer;
4370 i = LittleLong(header->version);
4371 if (i != Q2BSPVERSION)
4372 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4374 mod_base = (unsigned char *)header;
4376 // swap all the lumps
4377 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4378 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4380 mod->brush.qw_md4sum = 0;
4381 mod->brush.qw_md4sum2 = 0;
4382 for (i = 0;i < Q2HEADER_LUMPS;i++)
4384 if (i == Q2LUMP_ENTITIES)
4386 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4387 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4389 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4392 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4393 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4394 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4395 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4396 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4397 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4398 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4399 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4400 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4401 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4402 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4403 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4404 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4405 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4406 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4407 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4408 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4409 // LordHavoc: must go last because this makes the submodels
4410 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4413 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4414 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4416 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4419 char key[128], value[MAX_INPUTLINE];
4421 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4422 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4423 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4426 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4427 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4428 loadmodel->brush.entities[l->filelen] = 0;
4429 data = loadmodel->brush.entities;
4430 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4431 // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
4432 loadmodel->brushq3.deluxemapping = false;
4433 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4437 if (!COM_ParseToken_Simple(&data, false, false))
4439 if (com_token[0] == '}')
4440 break; // end of worldspawn
4441 if (com_token[0] == '_')
4442 strlcpy(key, com_token + 1, sizeof(key));
4444 strlcpy(key, com_token, sizeof(key));
4445 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4446 key[strlen(key)-1] = 0;
4447 if (!COM_ParseToken_Simple(&data, false, false))
4449 strlcpy(value, com_token, sizeof(value));
4450 if (!strcasecmp("gridsize", key)) // this one is case insensitive to 100% match q3map2
4452 #if _MSC_VER >= 1400
4453 #define sscanf sscanf_s
4456 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4457 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4459 VectorSet(v, 64, 64, 128);
4460 if(sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) != 3)
4461 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]);
4462 if (v[0] != 0 && v[1] != 0 && v[2] != 0)
4463 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4466 else if (!strcmp("deluxeMaps", key))
4468 if (!strcmp(com_token, "1"))
4470 loadmodel->brushq3.deluxemapping = true;
4471 loadmodel->brushq3.deluxemapping_modelspace = true;
4473 else if (!strcmp(com_token, "2"))
4475 loadmodel->brushq3.deluxemapping = true;
4476 loadmodel->brushq3.deluxemapping_modelspace = false;
4483 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4489 in = (q3dtexture_t *)(mod_base + l->fileofs);
4490 if (l->filelen % sizeof(*in))
4491 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4492 count = l->filelen / sizeof(*in);
4493 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4495 loadmodel->data_textures = out;
4496 loadmodel->num_textures = count;
4497 loadmodel->num_texturesperskin = loadmodel->num_textures;
4499 for (i = 0;i < count;i++)
4501 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4502 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4503 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4504 Mod_LoadTextureFromQ3Shader(out + i, out[i].name, true, true, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS);
4505 // restore the surfaceflags and supercontents
4506 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4507 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4511 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4517 in = (q3dplane_t *)(mod_base + l->fileofs);
4518 if (l->filelen % sizeof(*in))
4519 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4520 count = l->filelen / sizeof(*in);
4521 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4523 loadmodel->brush.data_planes = out;
4524 loadmodel->brush.num_planes = count;
4526 for (i = 0;i < count;i++, in++, out++)
4528 out->normal[0] = LittleFloat(in->normal[0]);
4529 out->normal[1] = LittleFloat(in->normal[1]);
4530 out->normal[2] = LittleFloat(in->normal[2]);
4531 out->dist = LittleFloat(in->dist);
4536 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4539 q3mbrushside_t *out;
4542 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4543 if (l->filelen % sizeof(*in))
4544 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4545 count = l->filelen / sizeof(*in);
4546 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4548 loadmodel->brush.data_brushsides = out;
4549 loadmodel->brush.num_brushsides = count;
4551 for (i = 0;i < count;i++, in++, out++)
4553 n = LittleLong(in->planeindex);
4554 if (n < 0 || n >= loadmodel->brush.num_planes)
4555 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4556 out->plane = loadmodel->brush.data_planes + n;
4557 n = LittleLong(in->textureindex);
4558 if (n < 0 || n >= loadmodel->num_textures)
4559 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4560 out->texture = loadmodel->data_textures + n;
4564 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4566 q3dbrushside_ig_t *in;
4567 q3mbrushside_t *out;
4570 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4571 if (l->filelen % sizeof(*in))
4572 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4573 count = l->filelen / sizeof(*in);
4574 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4576 loadmodel->brush.data_brushsides = out;
4577 loadmodel->brush.num_brushsides = count;
4579 for (i = 0;i < count;i++, in++, out++)
4581 n = LittleLong(in->planeindex);
4582 if (n < 0 || n >= loadmodel->brush.num_planes)
4583 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4584 out->plane = loadmodel->brush.data_planes + n;
4585 n = LittleLong(in->textureindex);
4586 if (n < 0 || n >= loadmodel->num_textures)
4587 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4588 out->texture = loadmodel->data_textures + n;
4592 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4596 int i, j, n, c, count, maxplanes, q3surfaceflags;
4597 colplanef_t *planes;
4599 in = (q3dbrush_t *)(mod_base + l->fileofs);
4600 if (l->filelen % sizeof(*in))
4601 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4602 count = l->filelen / sizeof(*in);
4603 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4605 loadmodel->brush.data_brushes = out;
4606 loadmodel->brush.num_brushes = count;
4611 for (i = 0;i < count;i++, in++, out++)
4613 n = LittleLong(in->firstbrushside);
4614 c = LittleLong(in->numbrushsides);
4615 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4616 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4617 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4618 out->numbrushsides = c;
4619 n = LittleLong(in->textureindex);
4620 if (n < 0 || n >= loadmodel->num_textures)
4621 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4622 out->texture = loadmodel->data_textures + n;
4624 // make a list of mplane_t structs to construct a colbrush from
4625 if (maxplanes < out->numbrushsides)
4627 maxplanes = out->numbrushsides;
4630 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4633 for (j = 0;j < out->numbrushsides;j++)
4635 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4636 planes[j].dist = out->firstbrushside[j].plane->dist;
4637 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4638 planes[j].texture = out->firstbrushside[j].texture;
4639 q3surfaceflags |= planes[j].q3surfaceflags;
4641 // make the colbrush from the planes
4642 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4644 // this whole loop can take a while (e.g. on redstarrepublic4)
4645 CL_KeepaliveMessage(false);
4651 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4657 in = (q3deffect_t *)(mod_base + l->fileofs);
4658 if (l->filelen % sizeof(*in))
4659 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4660 count = l->filelen / sizeof(*in);
4661 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4663 loadmodel->brushq3.data_effects = out;
4664 loadmodel->brushq3.num_effects = count;
4666 for (i = 0;i < count;i++, in++, out++)
4668 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4669 n = LittleLong(in->brushindex);
4670 if (n >= loadmodel->brush.num_brushes)
4672 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4675 out->brushindex = n;
4676 out->unknown = LittleLong(in->unknown);
4680 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4685 in = (q3dvertex_t *)(mod_base + l->fileofs);
4686 if (l->filelen % sizeof(*in))
4687 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4688 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4689 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4690 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4691 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4692 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4693 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4695 for (i = 0;i < count;i++, in++)
4697 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4698 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4699 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4700 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4701 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4702 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4703 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4704 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4705 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4706 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4707 // svector/tvector are calculated later in face loading
4708 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4709 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4710 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4711 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4712 if(in->color4ub[0] != 255 || in->color4ub[1] != 255 || in->color4ub[2] != 255)
4713 loadmodel->lit = true;
4717 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4723 in = (int *)(mod_base + l->fileofs);
4724 if (l->filelen % sizeof(int[3]))
4725 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4726 count = l->filelen / sizeof(*in);
4728 if(!loadmodel->brushq3.num_vertices)
4731 Con_Printf("Mod_Q3BSP_LoadTriangles: %s has triangles but no vertexes, broken compiler, ignoring problem\n", loadmodel->name);
4732 loadmodel->brushq3.num_triangles = 0;
4736 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4737 loadmodel->brushq3.num_triangles = count / 3;
4738 loadmodel->brushq3.data_element3i = out;
4740 for (i = 0;i < count;i++, in++, out++)
4742 *out = LittleLong(*in);
4743 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4745 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4751 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4753 q3dlightmap_t *input_pointer;
4771 int mergedrowsxcolumns;
4776 unsigned char *mergedpixels;
4777 unsigned char *mergeddeluxepixels;
4778 unsigned char *mergebuf;
4779 char mapname[MAX_QPATH];
4781 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4783 // defaults for q3bsp
4790 loadmodel->brushq3.lightmapsize = 128;
4792 if (cls.state == ca_dedicated)
4795 if(mod_q3bsp_nolightmaps.integer)
4801 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4802 if (developer_loading.integer)
4803 Con_Printf("Using internal lightmaps\n");
4804 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4805 if (l->filelen % sizeof(*input_pointer))
4806 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4807 count = l->filelen / sizeof(*input_pointer);
4808 for(i = 0; i < count; ++i)
4809 inpixels[i] = input_pointer[i].rgb;
4813 // no internal lightmaps
4814 // try external lightmaps
4815 if (developer_loading.integer)
4816 Con_Printf("Using external lightmaps\n");
4817 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4818 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false, false, NULL);
4822 // using EXTERNAL lightmaps instead
4823 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4825 Mem_Free(inpixels[0]);
4826 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4836 for(count = 1; ; ++count)
4838 inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false, false, NULL);
4839 if(!inpixels[count])
4840 break; // we got all of them
4841 if(image_width != size || image_height != size)
4843 Mem_Free(inpixels[count]);
4844 inpixels[count] = NULL;
4845 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);
4851 loadmodel->brushq3.lightmapsize = size;
4852 loadmodel->brushq3.num_originallightmaps = count;
4854 // now check the surfaces to see if any of them index an odd numbered
4855 // lightmap, if so this is not a deluxemapped bsp file
4857 // also check what lightmaps are actually used, because q3map2 sometimes
4858 // (always?) makes an unused one at the end, which
4859 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4860 // reason when only one lightmap is used, which can throw off the
4861 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4862 // to see if the second lightmap is blank, if so it is not deluxemapped.
4863 // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
4864 // in Mod_Q3BSP_LoadEntities was failed
4865 if (!loadmodel->brushq3.deluxemapping)
4867 loadmodel->brushq3.deluxemapping = !(count & 1);
4868 loadmodel->brushq3.deluxemapping_modelspace = true;
4870 if (loadmodel->brushq3.deluxemapping)
4872 int facecount = faceslump->filelen / sizeof(q3dface_t);
4873 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4874 for (i = 0;i < facecount;i++)
4876 j = LittleLong(faces[i].lightmapindex);
4879 endlightmap = max(endlightmap, j + 1);
4880 if ((j & 1) || j + 1 >= count)
4882 loadmodel->brushq3.deluxemapping = false;
4889 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4890 // reason when only one lightmap is used, which can throw off the
4891 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4892 // to see if the second lightmap is blank, if so it is not deluxemapped.
4894 // further research has shown q3map2 sometimes creates a deluxemap and two
4895 // blank lightmaps, which must be handled properly as well
4896 if (endlightmap == 1 && count > 1)
4899 for (i = 0;i < size*size;i++)
4901 if (c[bytesperpixel*i + rgbmap[0]])
4903 if (c[bytesperpixel*i + rgbmap[1]])
4905 if (c[bytesperpixel*i + rgbmap[2]])
4910 // all pixels in the unused lightmap were black...
4911 loadmodel->brushq3.deluxemapping = false;
4916 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4918 // figure out what the most reasonable merge power is within limits
4920 // find the appropriate NxN dimensions to merge to, to avoid wasted space
4921 realcount = count >> (int)loadmodel->brushq3.deluxemapping;
4923 // figure out how big the merged texture has to be
4924 mergegoal = 128<<bound(0, mod_q3bsp_lightmapmergepower.integer, 6);
4925 mergegoal = bound(size, mergegoal, (int)vid.maxtexturesize_2d);
4926 while (mergegoal > size && mergegoal * mergegoal / 4 >= size * size * realcount)
4928 mergedwidth = mergegoal;
4929 mergedheight = mergegoal;
4930 // choose non-square size (2x1 aspect) if only half the space is used;
4931 // this really only happens when the entire set fits in one texture, if
4932 // there are multiple textures, we don't worry about shrinking the last
4933 // one to fit, because the driver prefers the same texture size on
4934 // consecutive draw calls...
4935 if (mergedwidth * mergedheight / 2 >= size*size*realcount)
4938 loadmodel->brushq3.num_lightmapmergedwidthpower = 0;
4939 loadmodel->brushq3.num_lightmapmergedheightpower = 0;
4940 while (mergedwidth > size<<loadmodel->brushq3.num_lightmapmergedwidthpower)
4941 loadmodel->brushq3.num_lightmapmergedwidthpower++;
4942 while (mergedheight > size<<loadmodel->brushq3.num_lightmapmergedheightpower)
4943 loadmodel->brushq3.num_lightmapmergedheightpower++;
4944 loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower = loadmodel->brushq3.num_lightmapmergedwidthpower + loadmodel->brushq3.num_lightmapmergedheightpower + (loadmodel->brushq3.deluxemapping ? 1 : 0);
4946 powerx = loadmodel->brushq3.num_lightmapmergedwidthpower;
4947 powery = loadmodel->brushq3.num_lightmapmergedheightpower;
4948 powerxy = powerx+powery;
4949 powerdxy = loadmodel->brushq3.deluxemapping + powerxy;
4951 mergedcolumns = 1 << powerx;
4952 mergedrows = 1 << powery;
4953 mergedrowsxcolumns = 1 << powerxy;
4955 loadmodel->brushq3.num_mergedlightmaps = (realcount + (1 << powerxy) - 1) >> powerxy;
4956 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4957 if (loadmodel->brushq3.deluxemapping)
4958 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4960 // allocate a texture pool if we need it
4961 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4962 loadmodel->texturepool = R_AllocTexturePool();
4964 mergedpixels = (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4);
4965 mergeddeluxepixels = loadmodel->brushq3.deluxemapping ? (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4) : NULL;
4966 for (i = 0;i < count;i++)
4968 // figure out which merged lightmap texture this fits into
4969 realindex = i >> (int)loadmodel->brushq3.deluxemapping;
4970 lightmapindex = i >> powerdxy;
4972 // choose the destination address
4973 mergebuf = (loadmodel->brushq3.deluxemapping && (i & 1)) ? mergeddeluxepixels : mergedpixels;
4974 mergebuf += 4 * (realindex & (mergedcolumns-1))*size + 4 * ((realindex >> powerx) & (mergedrows-1))*mergedwidth*size;
4975 if ((i & 1) == 0 || !loadmodel->brushq3.deluxemapping)
4976 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);
4978 // convert pixels from RGB or BGRA while copying them into the destination rectangle
4979 for (j = 0;j < size;j++)
4980 for (k = 0;k < size;k++)
4982 mergebuf[(j*mergedwidth+k)*4+0] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[0]];
4983 mergebuf[(j*mergedwidth+k)*4+1] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[1]];
4984 mergebuf[(j*mergedwidth+k)*4+2] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[2]];
4985 mergebuf[(j*mergedwidth+k)*4+3] = 255;
4988 // upload texture if this was the last tile being written to the texture
4989 if (((realindex + 1) & (mergedrowsxcolumns - 1)) == 0 || (realindex + 1) == realcount)
4991 if (loadmodel->brushq3.deluxemapping && (i & 1))
4992 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);
4994 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);
4998 if (mergeddeluxepixels)
4999 Mem_Free(mergeddeluxepixels);
5000 Mem_Free(mergedpixels);
5003 for(i = 0; i < count; ++i)
5004 Mem_Free(inpixels[i]);
5008 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
5013 *collisionstride = stride;
5016 cnt = (num_triangles + stride - 1) / stride;
5017 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
5018 for(j = 0; j < cnt; ++j)
5020 mins = &((*collisionbbox6f)[6 * j + 0]);
5021 maxs = &((*collisionbbox6f)[6 * j + 3]);
5022 for(k = 0; k < stride; ++k)
5024 tri = j * stride + k;
5025 if(tri >= num_triangles)
5027 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
5028 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
5029 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
5030 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
5031 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
5032 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
5033 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
5034 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
5035 if(vert[0] < mins[0]) mins[0] = vert[0];
5036 if(vert[1] < mins[1]) mins[1] = vert[1];
5037 if(vert[2] < mins[2]) mins[2] = vert[2];
5038 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5039 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5040 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5041 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
5042 if(vert[0] < mins[0]) mins[0] = vert[0];
5043 if(vert[1] < mins[1]) mins[1] = vert[1];
5044 if(vert[2] < mins[2]) mins[2] = vert[2];
5045 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5046 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5047 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5052 *collisionbbox6f = NULL;
5055 typedef struct patchtess_s
5059 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
5062 float *originalvertex3f;
5065 #define PATCHTESS_SAME_LODGROUP(a,b) \
5067 (a).lodgroup[0] == (b).lodgroup[0] && \
5068 (a).lodgroup[1] == (b).lodgroup[1] && \
5069 (a).lodgroup[2] == (b).lodgroup[2] && \
5070 (a).lodgroup[3] == (b).lodgroup[3] && \
5071 (a).lodgroup[4] == (b).lodgroup[4] && \
5072 (a).lodgroup[5] == (b).lodgroup[5] \
5075 static void Mod_Q3BSP_LoadFaces(lump_t *l)
5077 q3dface_t *in, *oldin;
5078 msurface_t *out, *oldout;
5079 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;
5080 float lightmaptcbase[2], lightmaptcscale[2];
5081 //int *originalelement3i;
5082 //int *originalneighbor3i;
5083 float *originalvertex3f;
5084 //float *originalsvector3f;
5085 //float *originaltvector3f;
5086 float *originalnormal3f;
5087 float *originalcolor4f;
5088 float *originaltexcoordtexture2f;
5089 float *originaltexcoordlightmap2f;
5090 float *surfacecollisionvertex3f;
5091 int *surfacecollisionelement3i;
5093 patchtess_t *patchtess = NULL;
5094 int patchtesscount = 0;
5097 in = (q3dface_t *)(mod_base + l->fileofs);
5098 if (l->filelen % sizeof(*in))
5099 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
5100 count = l->filelen / sizeof(*in);
5101 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5103 loadmodel->data_surfaces = out;
5104 loadmodel->num_surfaces = count;
5107 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
5115 for (;i < count;i++, in++, out++)
5117 // check face type first
5118 type = LittleLong(in->type);
5119 if (type != Q3FACETYPE_FLAT
5120 && type != Q3FACETYPE_PATCH
5121 && type != Q3FACETYPE_MESH
5122 && type != Q3FACETYPE_FLARE)
5124 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
5128 n = LittleLong(in->textureindex);
5129 if (n < 0 || n >= loadmodel->num_textures)
5131 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
5134 out->texture = loadmodel->data_textures + n;
5135 n = LittleLong(in->effectindex);
5136 if (n < -1 || n >= loadmodel->brushq3.num_effects)
5138 if (developer_extra.integer)
5139 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
5145 out->effect = loadmodel->brushq3.data_effects + n;
5147 if (cls.state != ca_dedicated)
5149 out->lightmaptexture = NULL;
5150 out->deluxemaptexture = r_texture_blanknormalmap;
5151 n = LittleLong(in->lightmapindex);
5154 else if (n >= loadmodel->brushq3.num_originallightmaps)
5156 if(loadmodel->brushq3.num_originallightmaps != 0)
5157 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
5162 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5163 if (loadmodel->brushq3.deluxemapping)
5164 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5165 loadmodel->lit = true;
5169 firstvertex = LittleLong(in->firstvertex);
5170 numvertices = LittleLong(in->numvertices);
5171 firstelement = LittleLong(in->firstelement);
5172 numtriangles = LittleLong(in->numelements) / 3;
5173 if (numtriangles * 3 != LittleLong(in->numelements))
5175 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));
5178 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
5180 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);
5183 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
5185 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);
5190 case Q3FACETYPE_FLAT:
5191 case Q3FACETYPE_MESH:
5192 // no processing necessary
5194 case Q3FACETYPE_PATCH:
5195 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5196 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5197 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))
5199 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
5202 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5204 // convert patch to Q3FACETYPE_MESH
5205 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5206 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5207 // bound to user settings
5208 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
5209 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
5210 // bound to sanity settings
5211 xtess = bound(0, xtess, 1024);
5212 ytess = bound(0, ytess, 1024);
5214 // lower quality collision patches! Same procedure as before, but different cvars
5215 // convert patch to Q3FACETYPE_MESH
5216 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5217 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5218 // bound to user settings
5219 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
5220 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
5221 // bound to sanity settings
5222 cxtess = bound(0, cxtess, 1024);
5223 cytess = bound(0, cytess, 1024);
5225 // store it for the LOD grouping step
5226 patchtess[patchtesscount].info.xsize = patchsize[0];
5227 patchtess[patchtesscount].info.ysize = patchsize[1];
5228 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
5229 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
5230 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
5231 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
5233 patchtess[patchtesscount].surface_id = i;
5234 patchtess[patchtesscount].lodgroup[0] = LittleFloat(in->specific.patch.mins[0]);
5235 patchtess[patchtesscount].lodgroup[1] = LittleFloat(in->specific.patch.mins[1]);
5236 patchtess[patchtesscount].lodgroup[2] = LittleFloat(in->specific.patch.mins[2]);
5237 patchtess[patchtesscount].lodgroup[3] = LittleFloat(in->specific.patch.maxs[0]);
5238 patchtess[patchtesscount].lodgroup[4] = LittleFloat(in->specific.patch.maxs[1]);
5239 patchtess[patchtesscount].lodgroup[5] = LittleFloat(in->specific.patch.maxs[2]);
5240 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
5243 case Q3FACETYPE_FLARE:
5244 if (developer_extra.integer)
5245 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
5249 out->num_vertices = numvertices;
5250 out->num_triangles = numtriangles;
5251 meshvertices += out->num_vertices;
5252 meshtriangles += out->num_triangles;
5255 // Fix patches tesselations so that they make no seams
5259 for(i = 0; i < patchtesscount; ++i)
5261 for(j = i+1; j < patchtesscount; ++j)
5263 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
5266 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
5273 // Calculate resulting number of triangles
5274 collisionvertices = 0;
5275 collisiontriangles = 0;
5276 for(i = 0; i < patchtesscount; ++i)
5278 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
5279 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
5280 numvertices = finalwidth * finalheight;
5281 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5283 oldout[patchtess[i].surface_id].num_vertices = numvertices;
5284 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
5285 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
5286 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
5288 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_COLLISION].xtess);
5289 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_COLLISION].ytess);
5290 numvertices = finalwidth * finalheight;
5291 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5293 oldout[patchtess[i].surface_id].num_collisionvertices = numvertices;
5294 oldout[patchtess[i].surface_id].num_collisiontriangles = numtriangles;
5295 collisionvertices += oldout[patchtess[i].surface_id].num_collisionvertices;
5296 collisiontriangles += oldout[patchtess[i].surface_id].num_collisiontriangles;
5302 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
5303 if (collisiontriangles)
5305 loadmodel->brush.data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, collisionvertices * sizeof(float[3]));
5306 loadmodel->brush.data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, collisiontriangles * sizeof(int[3]));
5310 collisionvertices = 0;
5311 collisiontriangles = 0;
5312 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
5314 if (out->num_vertices < 3 || out->num_triangles < 1)
5317 type = LittleLong(in->type);
5318 firstvertex = LittleLong(in->firstvertex);
5319 firstelement = LittleLong(in->firstelement);
5320 out->num_firstvertex = meshvertices;
5321 out->num_firsttriangle = meshtriangles;
5322 out->num_firstcollisiontriangle = collisiontriangles;
5325 case Q3FACETYPE_FLAT:
5326 case Q3FACETYPE_MESH:
5327 // no processing necessary, except for lightmap merging
5328 for (j = 0;j < out->num_vertices;j++)
5330 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5331 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5332 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5333 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5334 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5335 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5336 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5337 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5338 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5339 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5340 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5341 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5342 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5343 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5345 for (j = 0;j < out->num_triangles*3;j++)
5346 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5348 case Q3FACETYPE_PATCH:
5349 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5350 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5351 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5352 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5353 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5354 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5355 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5357 xtess = ytess = cxtess = cytess = -1;
5358 for(j = 0; j < patchtesscount; ++j)
5359 if(patchtess[j].surface_id == i)
5361 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5362 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5363 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5364 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5369 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5370 xtess = ytess = cxtess = cytess = 0;
5373 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5374 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5375 finalvertices = finalwidth * finalheight;
5376 oldnumtriangles = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5377 type = Q3FACETYPE_MESH;
5378 // generate geometry
5379 // (note: normals are skipped because they get recalculated)
5380 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5381 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5382 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5383 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5384 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5385 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5387 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);
5389 if (developer_extra.integer)
5391 if (out->num_triangles < finaltriangles)
5392 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);
5394 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);
5396 // q3map does not put in collision brushes for curves... ugh
5397 // build the lower quality collision geometry
5398 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5399 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5400 finalvertices = finalwidth * finalheight;
5401 oldnumtriangles2 = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5403 // legacy collision geometry implementation
5404 out->deprecatedq3data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5405 out->deprecatedq3data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5406 out->num_collisionvertices = finalvertices;
5407 out->num_collisiontriangles = finaltriangles;
5408 Q3PatchTesselateFloat(3, sizeof(float[3]), out->deprecatedq3data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5409 Q3PatchTriangleElements(out->deprecatedq3data_collisionelement3i, finalwidth, finalheight, 0);
5411 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5412 Mod_SnapVertices(3, finalvertices, out->deprecatedq3data_collisionvertex3f, 1);
5414 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionvertex3f);
5416 // now optimize the collision mesh by finding triangle bboxes...
5417 Mod_Q3BSP_BuildBBoxes(out->deprecatedq3data_collisionelement3i, out->num_collisiontriangles, out->deprecatedq3data_collisionvertex3f, &out->deprecatedq3data_collisionbbox6f, &out->deprecatedq3num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5418 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);
5420 // store collision geometry for BIH collision tree
5421 surfacecollisionvertex3f = loadmodel->brush.data_collisionvertex3f + collisionvertices * 3;
5422 surfacecollisionelement3i = loadmodel->brush.data_collisionelement3i + collisiontriangles * 3;
5423 Q3PatchTesselateFloat(3, sizeof(float[3]), surfacecollisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5424 Q3PatchTriangleElements(surfacecollisionelement3i, finalwidth, finalheight, collisionvertices);
5425 Mod_SnapVertices(3, finalvertices, surfacecollisionvertex3f, 1);
5427 // remove this once the legacy code is removed
5429 int nc = out->num_collisiontriangles;
5431 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, surfacecollisionelement3i, surfacecollisionelement3i, loadmodel->brush.data_collisionvertex3f);
5433 if(nc != out->num_collisiontriangles)
5435 Con_Printf("number of collision triangles differs between BIH and BSP. FAIL.\n");
5440 if (developer_extra.integer)
5441 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);
5443 collisionvertices += finalvertices;
5444 collisiontriangles += out->num_collisiontriangles;
5449 meshvertices += out->num_vertices;
5450 meshtriangles += out->num_triangles;
5451 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5452 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)
5454 if (invalidelements)
5456 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);
5457 for (j = 0;j < out->num_triangles * 3;j++)
5459 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5460 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)
5461 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5465 // calculate a bounding box
5466 VectorClear(out->mins);
5467 VectorClear(out->maxs);
5468 if (out->num_vertices)
5470 if (cls.state != ca_dedicated && out->lightmaptexture)
5472 // figure out which part of the merged lightmap this fits into
5473 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5474 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5475 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5476 lightmapindex &= mergewidth * mergeheight - 1;
5477 lightmaptcscale[0] = 1.0f / mergewidth;
5478 lightmaptcscale[1] = 1.0f / mergeheight;
5479 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5480 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5481 // modify the lightmap texcoords to match this region of the merged lightmap
5482 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5484 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5485 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5488 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5489 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5490 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5492 out->mins[0] = min(out->mins[0], v[0]);
5493 out->maxs[0] = max(out->maxs[0], v[0]);
5494 out->mins[1] = min(out->mins[1], v[1]);
5495 out->maxs[1] = max(out->maxs[1], v[1]);
5496 out->mins[2] = min(out->mins[2], v[2]);
5497 out->maxs[2] = max(out->maxs[2], v[2]);
5499 out->mins[0] -= 1.0f;
5500 out->mins[1] -= 1.0f;
5501 out->mins[2] -= 1.0f;
5502 out->maxs[0] += 1.0f;
5503 out->maxs[1] += 1.0f;
5504 out->maxs[2] += 1.0f;
5506 // set lightmap styles for consistency with q1bsp
5507 //out->lightmapinfo->styles[0] = 0;
5508 //out->lightmapinfo->styles[1] = 255;
5509 //out->lightmapinfo->styles[2] = 255;
5510 //out->lightmapinfo->styles[3] = 255;
5515 for (;i < count;i++, out++)
5517 if(out->num_vertices && out->num_triangles)
5519 if(out->num_vertices == 0)
5521 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no vertices, ignoring\n", i, out->texture ? out->texture->name : "(none)");
5522 if(out->num_triangles == 0)
5523 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no triangles, ignoring\n", i, out->texture ? out->texture->name : "(none)");
5525 else if(out->num_triangles == 0)
5526 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)",
5527 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[0 * 3 + 0],
5528 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[1 * 3 + 0],
5529 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[2 * 3 + 0]);
5532 // for per pixel lighting
5533 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);
5535 // generate ushort elements array if possible
5536 if (loadmodel->surfmesh.data_element3s)
5537 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5538 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5540 // free the no longer needed vertex data
5541 loadmodel->brushq3.num_vertices = 0;
5542 if (loadmodel->brushq3.data_vertex3f)
5543 Mem_Free(loadmodel->brushq3.data_vertex3f);
5544 loadmodel->brushq3.data_vertex3f = NULL;
5545 loadmodel->brushq3.data_normal3f = NULL;
5546 loadmodel->brushq3.data_texcoordtexture2f = NULL;
5547 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5548 loadmodel->brushq3.data_color4f = NULL;
5549 // free the no longer needed triangle data
5550 loadmodel->brushq3.num_triangles = 0;
5551 if (loadmodel->brushq3.data_element3i)
5552 Mem_Free(loadmodel->brushq3.data_element3i);
5553 loadmodel->brushq3.data_element3i = NULL;
5556 Mem_Free(patchtess);
5559 static void Mod_Q3BSP_LoadModels(lump_t *l)
5563 int i, j, n, c, count;
5565 in = (q3dmodel_t *)(mod_base + l->fileofs);
5566 if (l->filelen % sizeof(*in))
5567 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5568 count = l->filelen / sizeof(*in);
5569 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5571 loadmodel->brushq3.data_models = out;
5572 loadmodel->brushq3.num_models = count;
5574 for (i = 0;i < count;i++, in++, out++)
5576 for (j = 0;j < 3;j++)
5578 out->mins[j] = LittleFloat(in->mins[j]);
5579 out->maxs[j] = LittleFloat(in->maxs[j]);
5581 n = LittleLong(in->firstface);
5582 c = LittleLong(in->numfaces);
5583 if (n < 0 || n + c > loadmodel->num_surfaces)
5584 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5587 n = LittleLong(in->firstbrush);
5588 c = LittleLong(in->numbrushes);
5589 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5590 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5591 out->firstbrush = n;
5592 out->numbrushes = c;
5596 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5602 in = (int *)(mod_base + l->fileofs);
5603 if (l->filelen % sizeof(*in))
5604 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5605 count = l->filelen / sizeof(*in);
5606 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5608 loadmodel->brush.data_leafbrushes = out;
5609 loadmodel->brush.num_leafbrushes = count;
5611 for (i = 0;i < count;i++, in++, out++)
5613 n = LittleLong(*in);
5614 if (n < 0 || n >= loadmodel->brush.num_brushes)
5615 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5620 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5626 in = (int *)(mod_base + l->fileofs);
5627 if (l->filelen % sizeof(*in))
5628 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5629 count = l->filelen / sizeof(*in);
5630 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5632 loadmodel->brush.data_leafsurfaces = out;
5633 loadmodel->brush.num_leafsurfaces = count;
5635 for (i = 0;i < count;i++, in++, out++)
5637 n = LittleLong(*in);
5638 if (n < 0 || n >= loadmodel->num_surfaces)
5639 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5644 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5648 int i, j, n, c, count;
5650 in = (q3dleaf_t *)(mod_base + l->fileofs);
5651 if (l->filelen % sizeof(*in))
5652 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5653 count = l->filelen / sizeof(*in);
5654 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5656 loadmodel->brush.data_leafs = out;
5657 loadmodel->brush.num_leafs = count;
5659 for (i = 0;i < count;i++, in++, out++)
5663 out->clusterindex = LittleLong(in->clusterindex);
5664 out->areaindex = LittleLong(in->areaindex);
5665 for (j = 0;j < 3;j++)
5667 // yes the mins/maxs are ints
5668 out->mins[j] = LittleLong(in->mins[j]) - 1;
5669 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5671 n = LittleLong(in->firstleafface);
5672 c = LittleLong(in->numleaffaces);
5673 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5674 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5675 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5676 out->numleafsurfaces = c;
5677 n = LittleLong(in->firstleafbrush);
5678 c = LittleLong(in->numleafbrushes);
5679 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5680 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5681 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5682 out->numleafbrushes = c;
5686 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5692 in = (q3dnode_t *)(mod_base + l->fileofs);
5693 if (l->filelen % sizeof(*in))
5694 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5695 count = l->filelen / sizeof(*in);
5697 Host_Error("Mod_Q3BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
5698 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5700 loadmodel->brush.data_nodes = out;
5701 loadmodel->brush.num_nodes = count;
5703 for (i = 0;i < count;i++, in++, out++)
5706 n = LittleLong(in->planeindex);
5707 if (n < 0 || n >= loadmodel->brush.num_planes)
5708 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5709 out->plane = loadmodel->brush.data_planes + n;
5710 for (j = 0;j < 2;j++)
5712 n = LittleLong(in->childrenindex[j]);
5715 if (n >= loadmodel->brush.num_nodes)
5716 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5717 out->children[j] = loadmodel->brush.data_nodes + n;
5722 if (n >= loadmodel->brush.num_leafs)
5723 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5724 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5727 for (j = 0;j < 3;j++)
5729 // yes the mins/maxs are ints
5730 out->mins[j] = LittleLong(in->mins[j]) - 1;
5731 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5735 // set the parent pointers
5736 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5739 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5742 q3dlightgrid_t *out;
5745 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5746 if (l->filelen % sizeof(*in))
5747 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5748 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5749 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5750 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5751 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5752 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5753 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5754 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5755 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5756 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5757 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5758 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5759 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5760 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5761 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]);
5762 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]);
5764 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5767 if (l->filelen < count * (int)sizeof(*in))
5769 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]);
5770 return; // ignore the grid if we cannot understand it
5772 if (l->filelen != count * (int)sizeof(*in))
5773 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5774 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5775 loadmodel->brushq3.data_lightgrid = out;
5776 loadmodel->brushq3.num_lightgrid = count;
5777 // no swapping or validation necessary
5778 memcpy(out, in, count * (int)sizeof(*out));
5782 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5787 if (l->filelen == 0)
5790 // unvised maps often have cluster indices even without pvs, so check
5791 // leafs to find real number of clusters
5792 loadmodel->brush.num_pvsclusters = 1;
5793 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5794 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5797 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5798 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5799 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5800 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5804 in = (q3dpvs_t *)(mod_base + l->fileofs);
5806 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5808 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5809 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5810 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5811 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5812 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5813 if (l->filelen < totalchains + (int)sizeof(*in))
5814 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);
5816 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5817 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5820 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5822 int i, j, k, index[3];
5823 float transformed[3], blend1, blend2, blend, stylescale = 1;
5824 q3dlightgrid_t *a, *s;
5826 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5827 switch(vid.renderpath)
5829 case RENDERPATH_GL20:
5830 case RENDERPATH_D3D9:
5831 case RENDERPATH_D3D10:
5832 case RENDERPATH_D3D11:
5833 case RENDERPATH_SOFT:
5834 case RENDERPATH_GLES2:
5835 // LordHavoc: FIXME: is this true?
5836 stylescale = 1; // added while render
5838 case RENDERPATH_GL11:
5839 case RENDERPATH_GL13:
5840 stylescale = r_refdef.scene.rtlightstylevalue[0];
5844 if (!model->brushq3.num_lightgrid)
5846 ambientcolor[0] = stylescale;
5847 ambientcolor[1] = stylescale;
5848 ambientcolor[2] = stylescale;
5852 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5853 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5854 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5855 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5856 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5857 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5858 index[0] = (int)floor(transformed[0]);
5859 index[1] = (int)floor(transformed[1]);
5860 index[2] = (int)floor(transformed[2]);
5861 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5863 // now lerp the values
5864 VectorClear(diffusenormal);
5865 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5866 for (k = 0;k < 2;k++)
5868 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5869 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5871 for (j = 0;j < 2;j++)
5873 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5874 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5876 for (i = 0;i < 2;i++)
5878 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5879 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5881 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5882 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5883 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5884 // this uses the mod_md3_sin table because the values are
5885 // already in the 0-255 range, the 64+ bias fetches a cosine
5886 // instead of a sine value
5887 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5888 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5889 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5890 //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)));
5895 // normalize the light direction before turning
5896 VectorNormalize(diffusenormal);
5897 //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]);
5900 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
5903 double midf, mid[3];
5909 // find the point distances
5910 mplane_t *plane = node->plane;
5911 if (plane->type < 3)
5913 t1 = p1[plane->type] - plane->dist;
5914 t2 = p2[plane->type] - plane->dist;
5918 t1 = DotProduct (plane->normal, p1) - plane->dist;
5919 t2 = DotProduct (plane->normal, p2) - plane->dist;
5926 node = node->children[1];
5935 node = node->children[0];
5941 midf = t1 / (t1 - t2);
5942 VectorLerp(p1, midf, p2, mid);
5944 // recurse both sides, front side first
5945 // return 2 if empty is followed by solid (hit something)
5946 // do not return 2 if both are solid or both empty,
5947 // or if start is solid and end is empty
5948 // as these degenerate cases usually indicate the eye is in solid and
5949 // should see the target point anyway
5950 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
5953 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
5958 return ((mleaf_t *)node)->clusterindex < 0;
5961 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
5963 if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
5966 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
5967 return trace.fraction == 1;
5971 double tracestart[3], traceend[3];
5972 VectorCopy(start, tracestart);
5973 VectorCopy(end, traceend);
5974 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
5978 static void Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace_t *trace, dp_model_t *model, int nodenum, const vec3_t point)
5980 const bih_leaf_t *leaf;
5981 const bih_node_t *node;
5982 const colbrushf_t *brush;
5986 node = model->collision_bih.nodes + nodenum;
5988 if (!BoxesOverlap(point, point, node->mins, node->maxs))
5991 if (node->type == BIH_UNORDERED)
5993 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
5995 leaf = model->collision_bih.leafs + node->children[axis];
5997 if (!BoxesOverlap(point, point, leaf->mins, leaf->maxs))
6003 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6004 Collision_TracePointBrushFloat(trace, point, brush);
6006 case BIH_COLLISIONTRIANGLE:
6007 // collision triangle - skipped because they have no volume
6009 case BIH_RENDERTRIANGLE:
6010 // render triangle - skipped because they have no volume
6016 axis = node->type - BIH_SPLITX;
6017 if (point[axis] <= node->backmax)
6019 if (point[axis] >= node->frontmin)
6020 Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace, model, node->front, point);
6021 nodenum = node->back;
6023 else if (point[axis] >= node->frontmin)
6024 nodenum = node->front;
6025 else // no overlap with either child? just return
6030 static void Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace_t *trace, dp_model_t *model, bih_t *bih, int nodenum, const vec3_t start, const vec3_t end, const vec3_t linestart, const vec3_t lineend)
6032 const bih_leaf_t *leaf;
6033 const bih_node_t *node;
6034 const colbrushf_t *brush;
6036 const texture_t *texture;
6047 vec3_t clipped, newstart, newend;
6051 segmentmins[0] = min(start[0], end[0]);
6052 segmentmins[1] = min(start[1], end[1]);
6053 segmentmins[2] = min(start[2], end[2]);
6054 segmentmaxs[0] = max(start[0], end[0]);
6055 segmentmaxs[1] = max(start[1], end[1]);
6056 segmentmaxs[2] = max(start[2], end[2]);
6059 node = bih->nodes + nodenum;
6061 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6064 if (node->type == BIH_UNORDERED)
6066 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6068 leaf = model->collision_bih.leafs + node->children[axis];
6070 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6076 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6077 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
6079 case BIH_COLLISIONTRIANGLE:
6080 if (!mod_q3bsp_curves_collisions.integer)
6082 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6083 texture = model->data_textures + leaf->textureindex;
6084 Collision_TraceLineTriangleFloat(trace, linestart, lineend, 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);
6086 case BIH_RENDERTRIANGLE:
6087 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6088 texture = model->data_textures + leaf->textureindex;
6089 Collision_TraceLineTriangleFloat(trace, linestart, lineend, 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);
6095 axis = node->type - BIH_SPLITX;
6097 if (segmentmins[axis] <= node->backmax)
6099 if (segmentmaxs[axis] >= node->frontmin)
6100 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6101 nodenum = node->back;
6103 else if (segmentmaxs[axis] >= node->frontmin)
6104 nodenum = node->front;
6106 return; // trace falls between children
6108 frontdist1 = start[axis] - node->frontmin;
6109 frontdist2 = end[axis] - node->frontmin;
6110 backdist1 = start[axis] - node->backmax;
6111 backdist2 = end[axis] - node->backmax;
6124 if ((sideflags & 3) != 3)
6125 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6126 nodenum = node->back;
6128 else if ((sideflags & 3) != 3)
6129 nodenum = node->front;
6131 return; // trace falls between children
6136 // start end START END
6137 nodenum = node->front;
6140 // START end START END
6142 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6143 VectorLerp(start, frontfrac, end, newstart); start = newstart;
6144 segmentmins[0] = min(start[0], end[0]);
6145 segmentmins[1] = min(start[1], end[1]);
6146 segmentmins[2] = min(start[2], end[2]);
6147 segmentmaxs[0] = max(start[0], end[0]);
6148 segmentmaxs[1] = max(start[1], end[1]);
6149 segmentmaxs[2] = max(start[2], end[2]);
6151 nodenum = node->front;
6155 // start END START END
6156 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6157 VectorLerp(start, frontfrac, end, newend); end = newend;
6158 segmentmins[0] = min(start[0], end[0]);
6159 segmentmins[1] = min(start[1], end[1]);
6160 segmentmins[2] = min(start[2], end[2]);
6161 segmentmaxs[0] = max(start[0], end[0]);
6162 segmentmaxs[1] = max(start[1], end[1]);
6163 segmentmaxs[2] = max(start[2], end[2]);
6165 nodenum = node->front;
6168 // START END START END
6169 return; // line falls in gap between children
6171 // start end start END
6172 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6174 backfrac = backdist1 / (backdist1 - backdist2);
6175 VectorLerp(start, backfrac, end, newend); end = newend;
6176 segmentmins[0] = min(start[0], end[0]);
6177 segmentmins[1] = min(start[1], end[1]);
6178 segmentmins[2] = min(start[2], end[2]);
6179 segmentmaxs[0] = max(start[0], end[0]);
6180 segmentmaxs[1] = max(start[1], end[1]);
6181 segmentmaxs[2] = max(start[2], end[2]);
6183 nodenum = node->back;
6186 // START end start END
6188 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6189 VectorLerp(start, frontfrac, end, clipped);
6190 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, clipped, end, linestart, lineend);
6191 backfrac = backdist1 / (backdist1 - backdist2);
6192 VectorLerp(start, backfrac, end, newend); end = newend;
6193 segmentmins[0] = min(start[0], end[0]);
6194 segmentmins[1] = min(start[1], end[1]);
6195 segmentmins[2] = min(start[2], end[2]);
6196 segmentmaxs[0] = max(start[0], end[0]);
6197 segmentmaxs[1] = max(start[1], end[1]);
6198 segmentmaxs[2] = max(start[2], end[2]);
6200 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6202 nodenum = node->back;
6205 // start END start END
6207 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6208 VectorLerp(start, frontfrac, end, clipped);
6209 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, clipped, linestart, lineend);
6210 backfrac = backdist1 / (backdist1 - backdist2);
6211 VectorLerp(start, backfrac, end, newend); end = newend;
6212 segmentmins[0] = min(start[0], end[0]);
6213 segmentmins[1] = min(start[1], end[1]);
6214 segmentmins[2] = min(start[2], end[2]);
6215 segmentmaxs[0] = max(start[0], end[0]);
6216 segmentmaxs[1] = max(start[1], end[1]);
6217 segmentmaxs[2] = max(start[2], end[2]);
6219 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6221 nodenum = node->back;
6224 // START END start END
6226 backfrac = backdist1 / (backdist1 - backdist2);
6227 VectorLerp(start, backfrac, end, newend); end = newend;
6228 segmentmins[0] = min(start[0], end[0]);
6229 segmentmins[1] = min(start[1], end[1]);
6230 segmentmins[2] = min(start[2], end[2]);
6231 segmentmaxs[0] = max(start[0], end[0]);
6232 segmentmaxs[1] = max(start[1], end[1]);
6233 segmentmaxs[2] = max(start[2], end[2]);
6235 nodenum = node->back;
6238 // start end START end
6239 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6241 backfrac = backdist1 / (backdist1 - backdist2);
6242 VectorLerp(start, backfrac, end, newstart); start = newstart;
6243 segmentmins[0] = min(start[0], end[0]);
6244 segmentmins[1] = min(start[1], end[1]);
6245 segmentmins[2] = min(start[2], end[2]);
6246 segmentmaxs[0] = max(start[0], end[0]);
6247 segmentmaxs[1] = max(start[1], end[1]);
6248 segmentmaxs[2] = max(start[2], end[2]);
6250 nodenum = node->back;
6253 // START end START end
6255 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6256 VectorLerp(start, frontfrac, end, clipped);
6257 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, clipped, end, linestart, lineend);
6258 backfrac = backdist1 / (backdist1 - backdist2);
6259 VectorLerp(start, backfrac, end, newstart); start = newstart;
6260 segmentmins[0] = min(start[0], end[0]);
6261 segmentmins[1] = min(start[1], end[1]);
6262 segmentmins[2] = min(start[2], end[2]);
6263 segmentmaxs[0] = max(start[0], end[0]);
6264 segmentmaxs[1] = max(start[1], end[1]);
6265 segmentmaxs[2] = max(start[2], end[2]);
6267 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6269 nodenum = node->back;
6272 // start END START end
6274 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6275 VectorLerp(start, frontfrac, end, clipped);
6276 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, clipped, linestart, lineend);
6277 backfrac = backdist1 / (backdist1 - backdist2);
6278 VectorLerp(start, backfrac, end, newstart); start = newstart;
6279 segmentmins[0] = min(start[0], end[0]);
6280 segmentmins[1] = min(start[1], end[1]);
6281 segmentmins[2] = min(start[2], end[2]);
6282 segmentmaxs[0] = max(start[0], end[0]);
6283 segmentmaxs[1] = max(start[1], end[1]);
6284 segmentmaxs[2] = max(start[2], end[2]);
6286 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6288 nodenum = node->back;
6291 // START END START end
6293 backfrac = backdist1 / (backdist1 - backdist2);
6294 VectorLerp(start, backfrac, end, newstart); start = newstart;
6295 segmentmins[0] = min(start[0], end[0]);
6296 segmentmins[1] = min(start[1], end[1]);
6297 segmentmins[2] = min(start[2], end[2]);
6298 segmentmaxs[0] = max(start[0], end[0]);
6299 segmentmaxs[1] = max(start[1], end[1]);
6300 segmentmaxs[2] = max(start[2], end[2]);
6302 nodenum = node->back;
6305 // start end start end
6306 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6307 nodenum = node->back;
6310 // START end start end
6312 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6313 VectorLerp(start, frontfrac, end, clipped);
6314 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, clipped, end, linestart, lineend);
6316 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6318 nodenum = node->back;
6321 // start END start end
6323 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6324 VectorLerp(start, frontfrac, end, clipped);
6325 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, clipped, linestart, lineend);
6327 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6329 nodenum = node->back;
6332 // START END start end
6333 nodenum = node->back;
6341 static void Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace_t *trace, dp_model_t *model, int nodenum, const colbrushf_t *thisbrush_start, const colbrushf_t *thisbrush_end, const vec3_t segmentmins, const vec3_t segmentmaxs)
6343 const bih_leaf_t *leaf;
6344 const bih_node_t *node;
6345 const colbrushf_t *brush;
6347 const texture_t *texture;
6351 node = model->collision_bih.nodes + nodenum;
6352 if (node->type == BIH_UNORDERED)
6354 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6356 leaf = model->collision_bih.leafs + node->children[axis];
6358 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6364 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6365 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6367 case BIH_COLLISIONTRIANGLE:
6368 if (!mod_q3bsp_curves_collisions.integer)
6370 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6371 texture = model->data_textures + leaf->textureindex;
6372 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);
6374 case BIH_RENDERTRIANGLE:
6375 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6376 texture = model->data_textures + leaf->textureindex;
6377 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);
6383 axis = node->type - BIH_SPLITX;
6385 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6389 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, node->front, thisbrush_start, thisbrush_end, segmentmins, segmentmaxs);
6390 nodenum = node->back;
6393 if (segmentmins[axis] <= node->backmax)
6395 if (segmentmaxs[axis] >= node->frontmin)
6396 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, node->front, thisbrush_start, thisbrush_end, segmentmins, segmentmaxs);
6397 nodenum = node->back;
6399 else if (segmentmaxs[axis] >= node->frontmin)
6400 nodenum = node->front;
6402 return; // trace falls between children
6406 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)
6408 memset(trace, 0, sizeof(*trace));
6409 trace->fraction = 1;
6410 trace->realfraction = 1;
6411 trace->hitsupercontentsmask = hitsupercontentsmask;
6412 Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start);
6415 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)
6417 if (VectorCompare(start, end))
6419 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6423 memset(trace, 0, sizeof(*trace));
6424 trace->fraction = 1;
6425 trace->realfraction = 1;
6426 trace->hitsupercontentsmask = hitsupercontentsmask;
6427 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, &model->collision_bih, model->collision_bih.rootnode, start, end, start, end);
6430 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)
6432 float segmentmins[3], segmentmaxs[3];
6433 colboxbrushf_t thisbrush_start, thisbrush_end;
6434 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6436 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
6438 vec3_t shiftstart, shiftend;
6439 VectorAdd(start, boxmins, shiftstart);
6440 VectorAdd(end, boxmins, shiftend);
6441 if (VectorCompare(start, end))
6442 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, shiftstart, hitsupercontentsmask);
6444 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, shiftstart, shiftend, hitsupercontentsmask);
6448 // box trace, performed as brush trace
6449 memset(trace, 0, sizeof(*trace));
6450 trace->fraction = 1;
6451 trace->realfraction = 1;
6452 trace->hitsupercontentsmask = hitsupercontentsmask;
6453 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
6454 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
6455 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
6456 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
6457 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
6458 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
6459 VectorAdd(start, boxmins, boxstartmins);
6460 VectorAdd(start, boxmaxs, boxstartmaxs);
6461 VectorAdd(end, boxmins, boxendmins);
6462 VectorAdd(end, boxmaxs, boxendmaxs);
6463 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6464 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6465 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, &thisbrush_start.brush, &thisbrush_end.brush, segmentmins, segmentmaxs);
6468 void Mod_CollisionBIH_TraceBrush(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, colbrushf_t *start, colbrushf_t *end, int hitsupercontentsmask)
6470 float segmentmins[3], segmentmaxs[3];
6472 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(start->mins, start->maxs) && VectorCompare(end->mins, end->maxs))
6474 if (VectorCompare(start->mins, end->mins))
6475 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start->mins, hitsupercontentsmask);
6477 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start->mins, end->mins, hitsupercontentsmask);
6481 // box trace, performed as brush trace
6482 memset(trace, 0, sizeof(*trace));
6483 trace->fraction = 1;
6484 trace->realfraction = 1;
6485 trace->hitsupercontentsmask = hitsupercontentsmask;
6486 segmentmins[0] = min(start->mins[0], end->mins[0]);
6487 segmentmins[1] = min(start->mins[1], end->mins[1]);
6488 segmentmins[2] = min(start->mins[2], end->mins[2]);
6489 segmentmaxs[0] = max(start->maxs[0], end->maxs[0]);
6490 segmentmaxs[1] = max(start->maxs[1], end->maxs[1]);
6491 segmentmaxs[2] = max(start->maxs[2], end->maxs[2]);
6492 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, segmentmins, segmentmaxs);
6495 int Mod_CollisionBIH_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6498 Mod_CollisionBIH_TracePoint(model, NULL, NULL, &trace, point, 0);
6499 return trace.startsupercontents;
6502 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)
6505 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6507 int hitsupercontents;
6508 VectorSet(end, start[0], start[1], model->normalmins[2]);
6510 memset(trace, 0, sizeof(*trace));
6511 trace->fraction = 1;
6512 trace->realfraction = 1;
6513 trace->hitsupercontentsmask = hitsupercontentsmask;
6515 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, start, end);
6516 hitsupercontents = trace->hitsupercontents;
6517 memset(trace, 0, sizeof(*trace));
6518 trace->fraction = 1;
6519 trace->realfraction = 1;
6520 trace->hitsupercontentsmask = hitsupercontentsmask;
6521 trace->startsupercontents = hitsupercontents;
6525 int Mod_CollisionBIH_PointSuperContents_Mesh(struct model_s *model, int frame, const vec3_t start)
6528 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6531 VectorSet(end, start[0], start[1], model->normalmins[2]);
6532 memset(&trace, 0, sizeof(trace));
6534 trace.realfraction = 1;
6535 trace.hitsupercontentsmask = 0;
6536 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(&trace, model, model->collision_bih.rootnode, start, end, start, end);
6537 return trace.hitsupercontents;
6543 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
6548 // find which leaf the point is in
6550 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
6551 // point trace the brushes
6552 leaf = (mleaf_t *)node;
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(point, point, brush->mins, brush->maxs))
6558 brush->markframe = markframe;
6559 Collision_TracePointBrushFloat(trace, point, brush);
6562 // can't do point traces on curves (they have no thickness)
6565 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)
6567 int i, startside, endside;
6568 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
6570 msurface_t *surface;
6573 // walk the tree until we hit a leaf, recursing for any split cases
6577 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6579 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[0], start, end, startfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6580 node = node->children[1];
6582 // abort if this part of the bsp tree can not be hit by this trace
6583 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6585 plane = node->plane;
6586 // axial planes are much more common than non-axial, so an optimized
6587 // axial case pays off here
6588 if (plane->type < 3)
6590 dist1 = start[plane->type] - plane->dist;
6591 dist2 = end[plane->type] - plane->dist;
6595 dist1 = DotProduct(start, plane->normal) - plane->dist;
6596 dist2 = DotProduct(end, plane->normal) - plane->dist;
6598 startside = dist1 < 0;
6599 endside = dist2 < 0;
6600 if (startside == endside)
6602 // most of the time the line fragment is on one side of the plane
6603 node = node->children[startside];
6607 // line crosses node plane, split the line
6608 dist1 = PlaneDiff(linestart, plane);
6609 dist2 = PlaneDiff(lineend, plane);
6610 midfrac = dist1 / (dist1 - dist2);
6611 VectorLerp(linestart, midfrac, lineend, mid);
6612 // take the near side first
6613 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6614 // if we found an impact on the front side, don't waste time
6615 // exploring the far side
6616 if (midfrac <= trace->realfraction)
6617 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6622 // abort if this part of the bsp tree can not be hit by this trace
6623 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6626 nodesegmentmins[0] = min(start[0], end[0]) - 1;
6627 nodesegmentmins[1] = min(start[1], end[1]) - 1;
6628 nodesegmentmins[2] = min(start[2], end[2]) - 1;
6629 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
6630 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
6631 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
6632 // line trace the brushes
6633 leaf = (mleaf_t *)node;
6635 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6638 for (i = 0;i < leaf->numleafbrushes;i++)
6640 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6641 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6643 brush->markframe = markframe;
6644 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
6647 // can't do point traces on curves (they have no thickness)
6648 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
6650 // line trace the curves
6651 for (i = 0;i < leaf->numleafsurfaces;i++)
6653 surface = model->data_surfaces + leaf->firstleafsurface[i];
6654 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6656 surface->deprecatedq3collisionmarkframe = markframe;
6657 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);
6663 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)
6669 msurface_t *surface;
6671 float nodesegmentmins[3], nodesegmentmaxs[3];
6672 // walk the tree until we hit a leaf, recursing for any split cases
6676 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6678 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6679 node = node->children[1];
6681 // abort if this part of the bsp tree can not be hit by this trace
6682 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6684 plane = node->plane;
6685 // axial planes are much more common than non-axial, so an optimized
6686 // axial case pays off here
6687 if (plane->type < 3)
6689 // this is an axial plane, compare bounding box directly to it and
6690 // recurse sides accordingly
6691 // recurse down node sides
6692 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
6693 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
6694 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
6695 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
6699 // this is a non-axial plane, so check if the start and end boxes
6700 // are both on one side of the plane to handle 'diagonal' cases
6701 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
6705 // segment crosses plane
6706 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6709 // if sides == 0 then the trace itself is bogus (Not A Number values),
6710 // in this case we simply pretend the trace hit nothing
6712 return; // ERROR: NAN bounding box!
6713 // take whichever side the segment box is on
6714 node = node->children[sides - 1];
6717 // abort if this part of the bsp tree can not be hit by this trace
6718 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6720 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
6721 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
6722 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
6723 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
6724 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
6725 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
6727 leaf = (mleaf_t *)node;
6729 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6732 for (i = 0;i < leaf->numleafbrushes;i++)
6734 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6735 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6737 brush->markframe = markframe;
6738 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6741 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
6743 for (i = 0;i < leaf->numleafsurfaces;i++)
6745 surface = model->data_surfaces + leaf->firstleafsurface[i];
6746 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6748 surface->deprecatedq3collisionmarkframe = markframe;
6749 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);
6756 static int markframe = 0;
6758 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)
6762 memset(trace, 0, sizeof(*trace));
6763 trace->fraction = 1;
6764 trace->realfraction = 1;
6765 trace->hitsupercontentsmask = hitsupercontentsmask;
6766 if (mod_collision_bih.integer)
6767 Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start);
6768 else if (model->brush.submodel)
6770 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6771 if (brush->colbrushf)
6772 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
6775 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
6778 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)
6781 float segmentmins[3], segmentmaxs[3];
6782 msurface_t *surface;
6785 if (VectorCompare(start, end))
6787 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6791 memset(trace, 0, sizeof(*trace));
6792 trace->fraction = 1;
6793 trace->realfraction = 1;
6794 trace->hitsupercontentsmask = hitsupercontentsmask;
6795 segmentmins[0] = min(start[0], end[0]) - 1;
6796 segmentmins[1] = min(start[1], end[1]) - 1;
6797 segmentmins[2] = min(start[2], end[2]) - 1;
6798 segmentmaxs[0] = max(start[0], end[0]) + 1;
6799 segmentmaxs[1] = max(start[1], end[1]) + 1;
6800 segmentmaxs[2] = max(start[2], end[2]) + 1;
6801 if (mod_collision_bih.integer)
6802 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, &model->collision_bih, model->collision_bih.rootnode, start, end, start, end);
6803 else if (model->brush.submodel)
6805 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6806 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6807 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6808 if (mod_q3bsp_curves_collisions.integer)
6809 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6810 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6811 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);
6814 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
6817 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)
6820 float segmentmins[3], segmentmaxs[3];
6821 msurface_t *surface;
6823 colboxbrushf_t thisbrush_start, thisbrush_end;
6824 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6826 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
6828 vec3_t shiftstart, shiftend;
6829 VectorAdd(start, boxmins, shiftstart);
6830 VectorAdd(end, boxmins, shiftend);
6831 if (VectorCompare(start, end))
6832 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, shiftstart, hitsupercontentsmask);
6834 Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, shiftstart, shiftend, hitsupercontentsmask);
6838 // box trace, performed as brush trace
6839 memset(trace, 0, sizeof(*trace));
6840 trace->fraction = 1;
6841 trace->realfraction = 1;
6842 trace->hitsupercontentsmask = hitsupercontentsmask;
6843 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
6844 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
6845 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
6846 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
6847 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
6848 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
6849 VectorAdd(start, boxmins, boxstartmins);
6850 VectorAdd(start, boxmaxs, boxstartmaxs);
6851 VectorAdd(end, boxmins, boxendmins);
6852 VectorAdd(end, boxmaxs, boxendmaxs);
6853 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6854 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6855 if (mod_collision_bih.integer)
6856 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, &thisbrush_start.brush, &thisbrush_end.brush, segmentmins, segmentmaxs);
6857 else if (model->brush.submodel)
6859 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6860 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6861 Collision_TraceBrushBrushFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, brush->colbrushf, brush->colbrushf);
6862 if (mod_q3bsp_curves_collisions.integer)
6863 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6864 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6865 Collision_TraceBrushTriangleMeshFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, 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);
6868 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, &thisbrush_start.brush, &thisbrush_end.brush, ++markframe, segmentmins, segmentmaxs);
6871 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)
6873 float segmentmins[3], segmentmaxs[3];
6875 msurface_t *surface;
6878 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(start->mins, start->maxs) && VectorCompare(end->mins, end->maxs))
6880 if (VectorCompare(start->mins, end->mins))
6881 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start->mins, hitsupercontentsmask);
6883 Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, start->mins, end->mins, hitsupercontentsmask);
6887 // box trace, performed as brush trace
6888 memset(trace, 0, sizeof(*trace));
6889 trace->fraction = 1;
6890 trace->realfraction = 1;
6891 trace->hitsupercontentsmask = hitsupercontentsmask;
6892 segmentmins[0] = min(start->mins[0], end->mins[0]);
6893 segmentmins[1] = min(start->mins[1], end->mins[1]);
6894 segmentmins[2] = min(start->mins[2], end->mins[2]);
6895 segmentmaxs[0] = max(start->maxs[0], end->maxs[0]);
6896 segmentmaxs[1] = max(start->maxs[1], end->maxs[1]);
6897 segmentmaxs[2] = max(start->maxs[2], end->maxs[2]);
6898 if (mod_collision_bih.integer)
6899 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, segmentmins, segmentmaxs);
6900 else if (model->brush.submodel)
6902 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6903 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6904 Collision_TraceBrushBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6905 if (mod_q3bsp_curves_collisions.integer)
6906 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6907 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6908 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);
6911 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, ++markframe, segmentmins, segmentmaxs);
6914 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6917 int supercontents = 0;
6919 if (mod_collision_bih.integer)
6922 Mod_Q3BSP_TracePoint(model, NULL, NULL, &trace, point, 0);
6923 supercontents = trace.startsupercontents;
6925 // test if the point is inside each brush
6926 else if (model->brush.submodel)
6928 // submodels are effectively one leaf
6929 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6930 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6931 supercontents |= brush->colbrushf->supercontents;
6935 mnode_t *node = model->brush.data_nodes;
6937 // find which leaf the point is in
6939 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
6940 leaf = (mleaf_t *)node;
6941 // now check the brushes in the leaf
6942 for (i = 0;i < leaf->numleafbrushes;i++)
6944 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
6945 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6946 supercontents |= brush->colbrushf->supercontents;
6949 return supercontents;
6952 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)
6954 memset(trace, 0, sizeof(*trace));
6955 trace->fraction = 1;
6956 trace->realfraction = 1;
6957 trace->hitsupercontentsmask = hitsupercontentsmask;
6958 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, &model->render_bih, model->render_bih.rootnode, start, end, start, end);
6962 bih_t *Mod_MakeCollisionBIH(dp_model_t *model, qboolean userendersurfaces, bih_t *out)
6970 int nummodelbrushes = model->nummodelbrushes;
6971 int nummodelsurfaces = model->nummodelsurfaces;
6973 const int *collisionelement3i;
6974 const float *collisionvertex3f;
6975 const int *renderelement3i;
6976 const float *rendervertex3f;
6977 bih_leaf_t *bihleafs;
6978 bih_node_t *bihnodes;
6980 int *temp_leafsortscratch;
6981 const msurface_t *surface;
6982 const q3mbrush_t *brush;
6984 // find out how many BIH leaf nodes we need
6986 if (userendersurfaces)
6988 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6989 bihnumleafs += surface->num_triangles;
6993 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
6994 if (brush->colbrushf)
6996 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6998 if (surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS)
6999 bihnumleafs += surface->num_triangles + surface->num_collisiontriangles;
7001 bihnumleafs += surface->num_collisiontriangles;
7008 // allocate the memory for the BIH leaf nodes
7009 bihleafs = (bih_leaf_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_leaf_t) * bihnumleafs);
7011 // now populate the BIH leaf nodes
7014 // add render surfaces
7015 renderelement3i = model->surfmesh.data_element3i;
7016 rendervertex3f = model->surfmesh.data_vertex3f;
7017 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7019 for (triangleindex = 0, e = renderelement3i + 3*surface->num_firsttriangle;triangleindex < surface->num_triangles;triangleindex++, e += 3)
7021 if (!userendersurfaces && !(surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS))
7023 bihleafs[bihleafindex].type = BIH_RENDERTRIANGLE;
7024 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
7025 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
7026 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firsttriangle;
7027 bihleafs[bihleafindex].mins[0] = min(rendervertex3f[3*e[0]+0], min(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) - 1;
7028 bihleafs[bihleafindex].mins[1] = min(rendervertex3f[3*e[0]+1], min(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) - 1;
7029 bihleafs[bihleafindex].mins[2] = min(rendervertex3f[3*e[0]+2], min(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) - 1;
7030 bihleafs[bihleafindex].maxs[0] = max(rendervertex3f[3*e[0]+0], max(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) + 1;
7031 bihleafs[bihleafindex].maxs[1] = max(rendervertex3f[3*e[0]+1], max(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) + 1;
7032 bihleafs[bihleafindex].maxs[2] = max(rendervertex3f[3*e[0]+2], max(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) + 1;
7037 if (!userendersurfaces)
7039 // add collision brushes
7040 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
7042 if (!brush->colbrushf)
7044 bihleafs[bihleafindex].type = BIH_BRUSH;
7045 bihleafs[bihleafindex].textureindex = brush->texture - model->data_textures;
7046 bihleafs[bihleafindex].surfaceindex = -1;
7047 bihleafs[bihleafindex].itemindex = brushindex+model->firstmodelbrush;
7048 VectorCopy(brush->colbrushf->mins, bihleafs[bihleafindex].mins);
7049 VectorCopy(brush->colbrushf->maxs, bihleafs[bihleafindex].maxs);
7053 // add collision surfaces
7054 collisionelement3i = model->brush.data_collisionelement3i;
7055 collisionvertex3f = model->brush.data_collisionvertex3f;
7056 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7058 for (triangleindex = 0, e = collisionelement3i + 3*surface->num_firstcollisiontriangle;triangleindex < surface->num_collisiontriangles;triangleindex++, e += 3)
7060 bihleafs[bihleafindex].type = BIH_COLLISIONTRIANGLE;
7061 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
7062 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
7063 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firstcollisiontriangle;
7064 bihleafs[bihleafindex].mins[0] = min(collisionvertex3f[3*e[0]+0], min(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) - 1;
7065 bihleafs[bihleafindex].mins[1] = min(collisionvertex3f[3*e[0]+1], min(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) - 1;
7066 bihleafs[bihleafindex].mins[2] = min(collisionvertex3f[3*e[0]+2], min(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) - 1;
7067 bihleafs[bihleafindex].maxs[0] = max(collisionvertex3f[3*e[0]+0], max(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) + 1;
7068 bihleafs[bihleafindex].maxs[1] = max(collisionvertex3f[3*e[0]+1], max(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) + 1;
7069 bihleafs[bihleafindex].maxs[2] = max(collisionvertex3f[3*e[0]+2], max(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) + 1;
7075 // allocate buffers for the produced and temporary data
7076 bihmaxnodes = bihnumleafs + 1;
7077 bihnodes = (bih_node_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_node_t) * bihmaxnodes);
7078 temp_leafsort = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * bihnumleafs * 2);
7079 temp_leafsortscratch = temp_leafsort + bihnumleafs;
7082 BIH_Build(out, bihnumleafs, bihleafs, bihmaxnodes, bihnodes, temp_leafsort, temp_leafsortscratch);
7084 // we're done with the temporary data
7085 Mem_Free(temp_leafsort);
7087 // resize the BIH nodes array if it over-allocated
7088 if (out->maxnodes > out->numnodes)
7090 out->maxnodes = out->numnodes;
7091 out->nodes = (bih_node_t *)Mem_Realloc(loadmodel->mempool, out->nodes, out->numnodes * sizeof(bih_node_t));
7097 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
7099 int supercontents = 0;
7100 if (nativecontents & CONTENTSQ3_SOLID)
7101 supercontents |= SUPERCONTENTS_SOLID;
7102 if (nativecontents & CONTENTSQ3_WATER)
7103 supercontents |= SUPERCONTENTS_WATER;
7104 if (nativecontents & CONTENTSQ3_SLIME)
7105 supercontents |= SUPERCONTENTS_SLIME;
7106 if (nativecontents & CONTENTSQ3_LAVA)
7107 supercontents |= SUPERCONTENTS_LAVA;
7108 if (nativecontents & CONTENTSQ3_BODY)
7109 supercontents |= SUPERCONTENTS_BODY;
7110 if (nativecontents & CONTENTSQ3_CORPSE)
7111 supercontents |= SUPERCONTENTS_CORPSE;
7112 if (nativecontents & CONTENTSQ3_NODROP)
7113 supercontents |= SUPERCONTENTS_NODROP;
7114 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
7115 supercontents |= SUPERCONTENTS_PLAYERCLIP;
7116 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
7117 supercontents |= SUPERCONTENTS_MONSTERCLIP;
7118 if (nativecontents & CONTENTSQ3_DONOTENTER)
7119 supercontents |= SUPERCONTENTS_DONOTENTER;
7120 if (nativecontents & CONTENTSQ3_BOTCLIP)
7121 supercontents |= SUPERCONTENTS_BOTCLIP;
7122 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
7123 supercontents |= SUPERCONTENTS_OPAQUE;
7124 return supercontents;
7127 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
7129 int nativecontents = 0;
7130 if (supercontents & SUPERCONTENTS_SOLID)
7131 nativecontents |= CONTENTSQ3_SOLID;
7132 if (supercontents & SUPERCONTENTS_WATER)
7133 nativecontents |= CONTENTSQ3_WATER;
7134 if (supercontents & SUPERCONTENTS_SLIME)
7135 nativecontents |= CONTENTSQ3_SLIME;
7136 if (supercontents & SUPERCONTENTS_LAVA)
7137 nativecontents |= CONTENTSQ3_LAVA;
7138 if (supercontents & SUPERCONTENTS_BODY)
7139 nativecontents |= CONTENTSQ3_BODY;
7140 if (supercontents & SUPERCONTENTS_CORPSE)
7141 nativecontents |= CONTENTSQ3_CORPSE;
7142 if (supercontents & SUPERCONTENTS_NODROP)
7143 nativecontents |= CONTENTSQ3_NODROP;
7144 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
7145 nativecontents |= CONTENTSQ3_PLAYERCLIP;
7146 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
7147 nativecontents |= CONTENTSQ3_MONSTERCLIP;
7148 if (supercontents & SUPERCONTENTS_DONOTENTER)
7149 nativecontents |= CONTENTSQ3_DONOTENTER;
7150 if (supercontents & SUPERCONTENTS_BOTCLIP)
7151 nativecontents |= CONTENTSQ3_BOTCLIP;
7152 if (!(supercontents & SUPERCONTENTS_OPAQUE))
7153 nativecontents |= CONTENTSQ3_TRANSLUCENT;
7154 return nativecontents;
7157 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
7162 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
7163 node = node->children[1];
7165 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
7166 if (loadmodel->brush.num_leafs < numleafs)
7167 loadmodel->brush.num_leafs = numleafs;
7170 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7173 q3dheader_t *header;
7174 float corner[3], yawradius, modelradius;
7176 mod->modeldatatypestring = "Q3BSP";
7178 mod->type = mod_brushq3;
7179 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
7182 header = (q3dheader_t *)buffer;
7183 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
7184 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
7186 i = LittleLong(header->version);
7187 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
7188 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
7190 mod->soundfromcenter = true;
7191 mod->TraceBox = Mod_Q3BSP_TraceBox;
7192 mod->TraceBrush = Mod_Q3BSP_TraceBrush;
7193 mod->TraceLine = Mod_Q3BSP_TraceLine;
7194 mod->TracePoint = Mod_Q3BSP_TracePoint;
7195 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
7196 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7197 mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
7198 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
7199 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
7200 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
7201 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
7202 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
7203 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
7204 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
7205 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
7206 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
7207 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
7208 mod->brush.AmbientSoundLevelsForPoint = NULL;
7209 mod->brush.RoundUpToHullSize = NULL;
7210 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
7211 mod->Draw = R_Q1BSP_Draw;
7212 mod->DrawDepth = R_Q1BSP_DrawDepth;
7213 mod->DrawDebug = R_Q1BSP_DrawDebug;
7214 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
7215 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
7216 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7217 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7218 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7219 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7220 mod->DrawLight = R_Q1BSP_DrawLight;
7222 mod_base = (unsigned char *)header;
7224 // swap all the lumps
7225 header->ident = LittleLong(header->ident);
7226 header->version = LittleLong(header->version);
7227 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
7228 for (i = 0;i < lumps;i++)
7230 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
7231 if((char *) bufferend < (char *) buffer + j)
7232 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
7233 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
7234 if((char *) bufferend < (char *) buffer + j)
7235 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
7238 * NO, do NOT clear them!
7239 * they contain actual data referenced by other stuff.
7240 * Instead, before using the advertisements lump, check header->versio
7242 * Sorry, but otherwise it breaks memory of the first lump.
7243 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
7245 header->lumps[i].fileofs = 0;
7246 header->lumps[i].filelen = 0;
7250 mod->brush.qw_md4sum = 0;
7251 mod->brush.qw_md4sum2 = 0;
7252 for (i = 0;i < lumps;i++)
7254 if (i == Q3LUMP_ENTITIES)
7256 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7257 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
7259 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7261 // all this checksumming can take a while, so let's send keepalives here too
7262 CL_KeepaliveMessage(false);
7265 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
7266 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
7267 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
7268 if (header->version == Q3BSPVERSION_IG)
7269 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
7271 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
7272 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
7273 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
7274 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
7275 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
7276 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
7277 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
7278 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
7279 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
7280 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
7281 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
7282 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
7283 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
7284 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
7285 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
7287 // the MakePortals code works fine on the q3bsp data as well
7288 if (mod_bsp_portalize.integer)
7289 Mod_Q1BSP_MakePortals();
7291 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
7292 loadmodel->brush.supportwateralpha = true;
7294 // make a single combined shadow mesh to allow optimized shadow volume creation
7295 Mod_Q1BSP_CreateShadowMesh(loadmodel);
7297 loadmodel->brush.num_leafs = 0;
7298 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
7300 if (loadmodel->brush.numsubmodels)
7301 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7304 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7309 // duplicate the basic information
7310 dpsnprintf(name, sizeof(name), "*%i", i);
7311 mod = Mod_FindName(name, loadmodel->name);
7312 // copy the base model to this one
7314 // rename the clone back to its proper name
7315 strlcpy(mod->name, name, sizeof(mod->name));
7316 mod->brush.parentmodel = loadmodel;
7317 // textures and memory belong to the main model
7318 mod->texturepool = NULL;
7319 mod->mempool = NULL;
7320 mod->brush.GetPVS = NULL;
7321 mod->brush.FatPVS = NULL;
7322 mod->brush.BoxTouchingPVS = NULL;
7323 mod->brush.BoxTouchingLeafPVS = NULL;
7324 mod->brush.BoxTouchingVisibleLeafs = NULL;
7325 mod->brush.FindBoxClusters = NULL;
7326 mod->brush.LightPoint = NULL;
7327 mod->brush.AmbientSoundLevelsForPoint = NULL;
7329 mod->brush.submodel = i;
7330 if (loadmodel->brush.submodels)
7331 loadmodel->brush.submodels[i] = mod;
7333 // make the model surface list (used by shadowing/lighting)
7334 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
7335 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
7336 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
7337 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
7338 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
7339 Mod_MakeSortedSurfaces(mod);
7341 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
7342 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
7343 // enlarge the bounding box to enclose all geometry of this model,
7344 // because q3map2 sometimes lies (mostly to affect the lightgrid),
7345 // which can in turn mess up the farclip (as well as culling when
7346 // outside the level - an unimportant concern)
7348 //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]);
7349 for (j = 0;j < mod->nummodelsurfaces;j++)
7351 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7352 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7354 if (!surface->num_vertices)
7356 for (k = 0;k < surface->num_vertices;k++, v += 3)
7358 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7359 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7360 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7361 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7362 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7363 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7366 //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]);
7367 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7368 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7369 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7370 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7371 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7372 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7373 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7374 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7375 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7376 mod->yawmins[2] = mod->normalmins[2];
7377 mod->yawmaxs[2] = mod->normalmaxs[2];
7378 mod->radius = modelradius;
7379 mod->radius2 = modelradius * modelradius;
7381 // this gets altered below if sky or water is used
7382 mod->DrawSky = NULL;
7383 mod->DrawAddWaterPlanes = NULL;
7385 for (j = 0;j < mod->nummodelsurfaces;j++)
7386 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7388 if (j < mod->nummodelsurfaces)
7389 mod->DrawSky = R_Q1BSP_DrawSky;
7391 for (j = 0;j < mod->nummodelsurfaces;j++)
7392 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7394 if (j < mod->nummodelsurfaces)
7395 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
7397 Mod_MakeCollisionBIH(mod, false, &mod->collision_bih);
7398 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
7400 // generate VBOs and other shared data before cloning submodels
7405 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);
7408 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7410 int i = LittleLong(((int *)buffer)[1]);
7411 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
7412 Mod_Q3BSP_Load(mod,buffer, bufferend);
7413 else if (i == Q2BSPVERSION)
7414 Mod_Q2BSP_Load(mod,buffer, bufferend);
7416 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
7419 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7421 Host_Error("Mod_MAP_Load: not yet implemented");
7427 typedef struct objvertex_s
7438 static unsigned char nobsp_pvs[1] = {1};
7440 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
7442 const char *textbase = (char *)buffer, *text = textbase;
7446 char materialname[MAX_QPATH];
7447 int i, j, l, numvertices, firstvertex, firsttriangle, elementindex, vertexindex, surfacevertices, surfacetriangles, surfaceelements, submodelindex = 0;
7448 int index1, index2, index3;
7449 objvertex_t vfirst, vprev, vcurrent;
7452 int numtriangles = 0;
7453 int maxtriangles = 0;
7454 objvertex_t *vertices = NULL;
7456 int maxtextures = 0, numtextures = 0, textureindex = 0;
7457 int maxv = 0, numv = 1;
7458 int maxvt = 0, numvt = 1;
7459 int maxvn = 0, numvn = 1;
7460 char *texturenames = NULL;
7461 float dist, modelradius, modelyawradius, yawradius;
7468 objvertex_t *thisvertex = NULL;
7469 int vertexhashindex;
7470 int *vertexhashtable = NULL;
7471 objvertex_t *vertexhashdata = NULL;
7472 objvertex_t *vdata = NULL;
7473 int vertexhashsize = 0;
7474 int vertexhashcount = 0;
7475 skinfile_t *skinfiles = NULL;
7476 unsigned char *data = NULL;
7477 int *submodelfirstsurface;
7478 msurface_t *surface;
7479 msurface_t *tempsurfaces;
7481 memset(&vfirst, 0, sizeof(vfirst));
7482 memset(&vprev, 0, sizeof(vprev));
7483 memset(&vcurrent, 0, sizeof(vcurrent));
7485 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
7487 loadmodel->modeldatatypestring = "OBJ";
7489 loadmodel->type = mod_obj;
7490 loadmodel->soundfromcenter = true;
7491 loadmodel->TraceBox = Mod_CollisionBIH_TraceBox;
7492 loadmodel->TraceBrush = Mod_CollisionBIH_TraceBrush;
7493 loadmodel->TraceLine = Mod_CollisionBIH_TraceLine;
7494 loadmodel->TracePoint = Mod_CollisionBIH_TracePoint_Mesh;
7495 loadmodel->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7496 loadmodel->PointSuperContents = Mod_CollisionBIH_PointSuperContents_Mesh;
7497 loadmodel->brush.TraceLineOfSight = NULL;
7498 loadmodel->brush.SuperContentsFromNativeContents = NULL;
7499 loadmodel->brush.NativeContentsFromSuperContents = NULL;
7500 loadmodel->brush.GetPVS = NULL;
7501 loadmodel->brush.FatPVS = NULL;
7502 loadmodel->brush.BoxTouchingPVS = NULL;
7503 loadmodel->brush.BoxTouchingLeafPVS = NULL;
7504 loadmodel->brush.BoxTouchingVisibleLeafs = NULL;
7505 loadmodel->brush.FindBoxClusters = NULL;
7506 loadmodel->brush.LightPoint = NULL;
7507 loadmodel->brush.FindNonSolidLocation = NULL;
7508 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
7509 loadmodel->brush.RoundUpToHullSize = NULL;
7510 loadmodel->brush.PointInLeaf = NULL;
7511 loadmodel->Draw = R_Q1BSP_Draw;
7512 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
7513 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
7514 loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
7515 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
7516 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7517 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7518 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7519 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7520 loadmodel->DrawLight = R_Q1BSP_DrawLight;
7522 skinfiles = Mod_LoadSkinFiles();
7523 if (loadmodel->numskins < 1)
7524 loadmodel->numskins = 1;
7526 // make skinscenes for the skins (no groups)
7527 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
7528 for (i = 0;i < loadmodel->numskins;i++)
7530 loadmodel->skinscenes[i].firstframe = i;
7531 loadmodel->skinscenes[i].framecount = 1;
7532 loadmodel->skinscenes[i].loop = true;
7533 loadmodel->skinscenes[i].framerate = 10;
7539 // parse the OBJ text now
7542 static char emptyarg[1] = "";
7547 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
7548 line[linelen] = text[linelen];
7550 for (argc = 0;argc < 4;argc++)
7551 argv[argc] = emptyarg;
7554 while (*s == ' ' || *s == '\t')
7564 while (*s == ' ' || *s == '\t')
7574 if (argv[0][0] == '#')
7576 if (!strcmp(argv[0], "v"))
7580 maxv = max(maxv * 2, 1024);
7581 v = (float *)Mem_Realloc(tempmempool, v, maxv * sizeof(float[3]));
7583 v[numv*3+0] = atof(argv[1]);
7584 v[numv*3+2] = atof(argv[2]);
7585 v[numv*3+1] = atof(argv[3]);
7588 else if (!strcmp(argv[0], "vt"))
7592 maxvt = max(maxvt * 2, 1024);
7593 vt = (float *)Mem_Realloc(tempmempool, vt, maxvt * sizeof(float[2]));
7595 vt[numvt*2+0] = atof(argv[1]);
7596 vt[numvt*2+1] = 1-atof(argv[2]);
7599 else if (!strcmp(argv[0], "vn"))
7603 maxvn = max(maxvn * 2, 1024);
7604 vn = (float *)Mem_Realloc(tempmempool, vn, maxvn * sizeof(float[3]));
7606 vn[numvn*3+0] = atof(argv[1]);
7607 vn[numvn*3+2] = atof(argv[2]);
7608 vn[numvn*3+1] = atof(argv[3]);
7611 else if (!strcmp(argv[0], "f"))
7615 if (maxtextures <= numtextures)
7617 maxtextures = max(maxtextures * 2, 256);
7618 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7620 textureindex = numtextures++;
7621 strlcpy(texturenames + textureindex*MAX_QPATH, loadmodel->name, MAX_QPATH);
7623 for (j = 1;j < argc;j++)
7625 index1 = atoi(argv[j]);
7626 while(argv[j][0] && argv[j][0] != '/')
7630 index2 = atoi(argv[j]);
7631 while(argv[j][0] && argv[j][0] != '/')
7635 index3 = atoi(argv[j]);
7636 // negative refers to a recent vertex
7637 // zero means not specified
7638 // positive means an absolute vertex index
7640 index1 = numv - index1;
7642 index2 = numvt - index2;
7644 index3 = numvn - index3;
7645 vcurrent.nextindex = -1;
7646 vcurrent.textureindex = textureindex;
7647 vcurrent.submodelindex = submodelindex;
7648 if (v && index1 >= 0 && index1 < numv)
7649 VectorCopy(v + 3*index1, vcurrent.v);
7650 if (vt && index2 >= 0 && index2 < numvt)
7651 Vector2Copy(vt + 2*index2, vcurrent.vt);
7652 if (vn && index3 >= 0 && index3 < numvn)
7653 VectorCopy(vn + 3*index3, vcurrent.vn);
7654 if (numtriangles == 0)
7656 VectorCopy(vcurrent.v, mins);
7657 VectorCopy(vcurrent.v, maxs);
7661 mins[0] = min(mins[0], vcurrent.v[0]);
7662 mins[1] = min(mins[1], vcurrent.v[1]);
7663 mins[2] = min(mins[2], vcurrent.v[2]);
7664 maxs[0] = max(maxs[0], vcurrent.v[0]);
7665 maxs[1] = max(maxs[1], vcurrent.v[1]);
7666 maxs[2] = max(maxs[2], vcurrent.v[2]);
7672 if (maxtriangles <= numtriangles)
7674 maxtriangles = max(maxtriangles * 2, 32768);
7675 vertices = (objvertex_t*)Mem_Realloc(loadmodel->mempool, vertices, maxtriangles * sizeof(objvertex_t[3]));
7677 vertices[numtriangles*3+0] = vfirst;
7678 vertices[numtriangles*3+1] = vprev;
7679 vertices[numtriangles*3+2] = vcurrent;
7685 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
7687 submodelindex = atof(argv[1]);
7688 loadmodel->brush.numsubmodels = max(submodelindex + 1, loadmodel->brush.numsubmodels);
7690 else if (!strcmp(argv[0], "usemtl"))
7692 for (i = 0;i < numtextures;i++)
7693 if (!strcmp(texturenames+i*MAX_QPATH, argv[1]))
7695 if (i < numtextures)
7699 if (maxtextures <= numtextures)
7701 maxtextures = max(maxtextures * 2, 256);
7702 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7704 textureindex = numtextures++;
7705 strlcpy(texturenames + textureindex*MAX_QPATH, argv[1], MAX_QPATH);
7710 // now that we have the OBJ data loaded as-is, we can convert it
7712 // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
7713 VectorCopy(mins, loadmodel->normalmins);
7714 VectorCopy(maxs, loadmodel->normalmaxs);
7715 dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
7716 modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
7717 modelyawradius = dist*dist+modelyawradius*modelyawradius;
7718 modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
7719 modelradius = modelyawradius + modelradius * modelradius;
7720 modelyawradius = sqrt(modelyawradius);
7721 modelradius = sqrt(modelradius);
7722 loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
7723 loadmodel->yawmins[2] = loadmodel->normalmins[2];
7724 loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] = modelyawradius;
7725 loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
7726 loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
7727 loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] = modelradius;
7728 loadmodel->radius = modelradius;
7729 loadmodel->radius2 = modelradius * modelradius;
7731 // allocate storage for triangles
7732 loadmodel->surfmesh.data_element3i = (int *)Mem_Alloc(loadmodel->mempool, numtriangles * sizeof(int[3]));
7733 // allocate vertex hash structures to build an optimal vertex subset
7734 vertexhashsize = numtriangles*2;
7735 vertexhashtable = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * vertexhashsize);
7736 memset(vertexhashtable, 0xFF, sizeof(int) * vertexhashsize);
7737 vertexhashdata = (objvertex_t *)Mem_Alloc(loadmodel->mempool, sizeof(*vertexhashdata) * numtriangles*3);
7738 vertexhashcount = 0;
7740 // gather surface stats for assigning vertex/triangle ranges
7744 loadmodel->num_surfaces = 0;
7745 // allocate storage for the worst case number of surfaces, later we resize
7746 tempsurfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, numtextures * loadmodel->brush.numsubmodels * sizeof(msurface_t));
7747 submodelfirstsurface = (int *)Mem_Alloc(loadmodel->mempool, (loadmodel->brush.numsubmodels+1) * sizeof(int));
7748 surface = tempsurfaces;
7749 for (submodelindex = 0;submodelindex < loadmodel->brush.numsubmodels;submodelindex++)
7751 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7752 for (textureindex = 0;textureindex < numtextures;textureindex++)
7754 for (vertexindex = 0;vertexindex < numtriangles*3;vertexindex++)
7756 thisvertex = vertices + vertexindex;
7757 if (thisvertex->submodelindex == submodelindex && thisvertex->textureindex == textureindex)
7760 // skip the surface creation if there are no triangles for it
7761 if (vertexindex == numtriangles*3)
7763 // create a surface for these vertices
7764 surfacevertices = 0;
7765 surfaceelements = 0;
7766 // we hack in a texture index in the surface to be fixed up later...
7767 surface->texture = (texture_t *)((size_t)textureindex);
7768 // calculate bounds as we go
7769 VectorCopy(thisvertex->v, surface->mins);
7770 VectorCopy(thisvertex->v, surface->maxs);
7771 for (;vertexindex < numtriangles*3;vertexindex++)
7773 thisvertex = vertices + vertexindex;
7774 if (thisvertex->submodelindex != submodelindex)
7776 if (thisvertex->textureindex != textureindex)
7778 // add vertex to surface bounds
7779 surface->mins[0] = min(surface->mins[0], thisvertex->v[0]);
7780 surface->mins[1] = min(surface->mins[1], thisvertex->v[1]);
7781 surface->mins[2] = min(surface->mins[2], thisvertex->v[2]);
7782 surface->maxs[0] = max(surface->maxs[0], thisvertex->v[0]);
7783 surface->maxs[1] = max(surface->maxs[1], thisvertex->v[1]);
7784 surface->maxs[2] = max(surface->maxs[2], thisvertex->v[2]);
7785 // add the vertex if it is not found in the merged set, and
7786 // get its index (triangle element) for the surface
7787 vertexhashindex = (unsigned int)(thisvertex->v[0] * 3571 + thisvertex->v[0] * 1777 + thisvertex->v[0] * 457) % (unsigned int)vertexhashsize;
7788 for (i = vertexhashtable[vertexhashindex];i >= 0;i = vertexhashdata[i].nextindex)
7790 vdata = vertexhashdata + i;
7791 if (vdata->submodelindex == thisvertex->submodelindex && vdata->textureindex == thisvertex->textureindex && VectorCompare(thisvertex->v, vdata->v) && VectorCompare(thisvertex->vn, vdata->vn) && Vector2Compare(thisvertex->vt, vdata->vt))
7796 i = vertexhashcount++;
7797 vdata = vertexhashdata + i;
7798 *vdata = *thisvertex;
7799 vdata->nextindex = vertexhashtable[vertexhashindex];
7800 vertexhashtable[vertexhashindex] = i;
7803 loadmodel->surfmesh.data_element3i[elementindex++] = i;
7806 surfacetriangles = surfaceelements / 3;
7807 surface->num_vertices = surfacevertices;
7808 surface->num_triangles = surfacetriangles;
7809 surface->num_firstvertex = firstvertex;
7810 surface->num_firsttriangle = firsttriangle;
7811 firstvertex += surface->num_vertices;
7812 firsttriangle += surface->num_triangles;
7814 loadmodel->num_surfaces++;
7817 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7818 numvertices = firstvertex;
7819 loadmodel->data_surfaces = (msurface_t *)Mem_Realloc(loadmodel->mempool, tempsurfaces, loadmodel->num_surfaces * sizeof(msurface_t));
7820 tempsurfaces = NULL;
7822 // allocate storage for final mesh data
7823 loadmodel->num_textures = numtextures * loadmodel->numskins;
7824 loadmodel->num_texturesperskin = numtextures;
7825 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 *));
7826 loadmodel->brush.submodels = (dp_model_t **)data;data += loadmodel->brush.numsubmodels * sizeof(dp_model_t *);
7827 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
7828 loadmodel->data_textures = (texture_t *)data;data += loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t);
7829 loadmodel->surfmesh.num_vertices = numvertices;
7830 loadmodel->surfmesh.num_triangles = numtriangles;
7831 if (r_enableshadowvolumes.integer)
7832 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += numtriangles * sizeof(int[3]);
7833 loadmodel->surfmesh.data_vertex3f = (float *)data;data += numvertices * sizeof(float[3]);
7834 loadmodel->surfmesh.data_svector3f = (float *)data;data += numvertices * sizeof(float[3]);
7835 loadmodel->surfmesh.data_tvector3f = (float *)data;data += numvertices * sizeof(float[3]);
7836 loadmodel->surfmesh.data_normal3f = (float *)data;data += numvertices * sizeof(float[3]);
7837 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += numvertices * sizeof(float[2]);
7838 if (loadmodel->surfmesh.num_vertices <= 65536)
7839 loadmodel->surfmesh.data_element3s = (unsigned short *)data;data += loadmodel->surfmesh.num_triangles * sizeof(unsigned short[3]);
7841 for (j = 0;j < loadmodel->surfmesh.num_vertices;j++)
7843 VectorCopy(vertexhashdata[j].v, loadmodel->surfmesh.data_vertex3f + 3*j);
7844 VectorCopy(vertexhashdata[j].vn, loadmodel->surfmesh.data_normal3f + 3*j);
7845 Vector2Copy(vertexhashdata[j].vt, loadmodel->surfmesh.data_texcoordtexture2f + 2*j);
7848 // load the textures
7849 for (textureindex = 0;textureindex < numtextures;textureindex++)
7850 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures + textureindex, skinfiles, texturenames + textureindex*MAX_QPATH, texturenames + textureindex*MAX_QPATH);
7851 Mod_FreeSkinFiles(skinfiles);
7853 // set the surface textures to their real values now that we loaded them...
7854 for (i = 0;i < loadmodel->num_surfaces;i++)
7855 loadmodel->data_surfaces[i].texture = loadmodel->data_textures + (size_t)loadmodel->data_surfaces[i].texture;
7859 Mem_Free(texturenames);
7863 Mem_Free(vertexhashtable);
7864 Mem_Free(vertexhashdata);
7866 // make a single combined shadow mesh to allow optimized shadow volume creation
7867 Mod_Q1BSP_CreateShadowMesh(loadmodel);
7869 // compute all the mesh information that was not loaded from the file
7870 if (loadmodel->surfmesh.data_element3s)
7871 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
7872 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
7873 Mod_ValidateElements(loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles, 0, loadmodel->surfmesh.num_vertices, __FILE__, __LINE__);
7874 // generate normals if the file did not have them
7875 if (!VectorLength2(loadmodel->surfmesh.data_normal3f))
7876 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);
7877 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);
7878 if (loadmodel->surfmesh.data_neighbor3i)
7879 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
7881 // if this is a worldmodel and has no BSP tree, create a fake one for the purpose
7882 loadmodel->brush.num_visleafs = 1;
7883 loadmodel->brush.num_leafs = 1;
7884 loadmodel->brush.num_nodes = 0;
7885 loadmodel->brush.num_leafsurfaces = loadmodel->num_surfaces;
7886 loadmodel->brush.data_leafs = (mleaf_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
7887 loadmodel->brush.data_nodes = (mnode_t *)loadmodel->brush.data_leafs;
7888 loadmodel->brush.num_pvsclusters = 1;
7889 loadmodel->brush.num_pvsclusterbytes = 1;
7890 loadmodel->brush.data_pvsclusters = nobsp_pvs;
7891 //if (loadmodel->num_nodes) loadmodel->data_nodes = (mnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_nodes * sizeof(mnode_t));
7892 //loadmodel->data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->num_leafsurfaces * sizeof(int));
7893 loadmodel->brush.data_leafsurfaces = loadmodel->sortedmodelsurfaces;
7894 VectorCopy(loadmodel->normalmins, loadmodel->brush.data_leafs->mins);
7895 VectorCopy(loadmodel->normalmaxs, loadmodel->brush.data_leafs->maxs);
7896 loadmodel->brush.data_leafs->combinedsupercontents = 0; // FIXME?
7897 loadmodel->brush.data_leafs->clusterindex = 0;
7898 loadmodel->brush.data_leafs->areaindex = 0;
7899 loadmodel->brush.data_leafs->numleafsurfaces = loadmodel->brush.num_leafsurfaces;
7900 loadmodel->brush.data_leafs->firstleafsurface = loadmodel->brush.data_leafsurfaces;
7901 loadmodel->brush.data_leafs->numleafbrushes = 0;
7902 loadmodel->brush.data_leafs->firstleafbrush = NULL;
7903 loadmodel->brush.supportwateralpha = true;
7905 if (loadmodel->brush.numsubmodels)
7906 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7909 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7914 // duplicate the basic information
7915 dpsnprintf(name, sizeof(name), "*%i", i);
7916 mod = Mod_FindName(name, loadmodel->name);
7917 // copy the base model to this one
7919 // rename the clone back to its proper name
7920 strlcpy(mod->name, name, sizeof(mod->name));
7921 mod->brush.parentmodel = loadmodel;
7922 // textures and memory belong to the main model
7923 mod->texturepool = NULL;
7924 mod->mempool = NULL;
7925 mod->brush.GetPVS = NULL;
7926 mod->brush.FatPVS = NULL;
7927 mod->brush.BoxTouchingPVS = NULL;
7928 mod->brush.BoxTouchingLeafPVS = NULL;
7929 mod->brush.BoxTouchingVisibleLeafs = NULL;
7930 mod->brush.FindBoxClusters = NULL;
7931 mod->brush.LightPoint = NULL;
7932 mod->brush.AmbientSoundLevelsForPoint = NULL;
7934 mod->brush.submodel = i;
7935 if (loadmodel->brush.submodels)
7936 loadmodel->brush.submodels[i] = mod;
7938 // make the model surface list (used by shadowing/lighting)
7939 mod->firstmodelsurface = submodelfirstsurface[i];
7940 mod->nummodelsurfaces = submodelfirstsurface[i+1] - submodelfirstsurface[i];
7941 mod->firstmodelbrush = 0;
7942 mod->nummodelbrushes = 0;
7943 mod->sortedmodelsurfaces = loadmodel->sortedmodelsurfaces + mod->firstmodelsurface;
7944 Mod_MakeSortedSurfaces(mod);
7946 VectorClear(mod->normalmins);
7947 VectorClear(mod->normalmaxs);
7949 for (j = 0;j < mod->nummodelsurfaces;j++)
7951 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7952 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7954 if (!surface->num_vertices)
7959 VectorCopy(v, mod->normalmins);
7960 VectorCopy(v, mod->normalmaxs);
7962 for (k = 0;k < surface->num_vertices;k++, v += 3)
7964 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7965 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7966 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7967 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7968 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7969 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7972 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7973 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7974 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7975 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7976 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7977 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7978 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7979 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7980 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7981 mod->yawmins[2] = mod->normalmins[2];
7982 mod->yawmaxs[2] = mod->normalmaxs[2];
7983 mod->radius = modelradius;
7984 mod->radius2 = modelradius * modelradius;
7986 // this gets altered below if sky or water is used
7987 mod->DrawSky = NULL;
7988 mod->DrawAddWaterPlanes = NULL;
7990 for (j = 0;j < mod->nummodelsurfaces;j++)
7991 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7993 if (j < mod->nummodelsurfaces)
7994 mod->DrawSky = R_Q1BSP_DrawSky;
7996 for (j = 0;j < mod->nummodelsurfaces;j++)
7997 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7999 if (j < mod->nummodelsurfaces)
8000 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
8002 Mod_MakeCollisionBIH(mod, true, &mod->collision_bih);
8003 mod->render_bih = mod->collision_bih;
8005 // generate VBOs and other shared data before cloning submodels
8010 Mem_Free(submodelfirstsurface);
8012 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);
8027 typedef struct objvertex_s
8035 typedef struct objtriangle_s
8037 objvertex_t vertex[3];
8039 // these fields are used only in conversion to surfaces
8042 int surfacevertexindex[3];
8043 float edgeplane[3][4];
8049 struct objnode_s *children[2];
8050 struct objnode_s *parent;
8051 objtriangle_t *triangles;
8060 objnode_t *Mod_OBJ_BSPNodeForTriangles(objnode_t *parent, objtriangle_t *triangles, int numtriangles, const float *mins, const float *maxs, mem_expandablearray_t *nodesarray, int maxclippedtriangles, objtriangle_t *clippedfronttriangles, objtriangle_t *clippedbacktriangles)
8066 float bestnormal[3];
8071 int numfronttriangles;
8072 int numbacktriangles;
8077 float outfrontpoints[5][3];
8078 float outbackpoints[5][3];
8079 int neededfrontpoints;
8080 int neededbackpoints;
8084 node = (objnode_t *)Mem_ExpandableArray_AllocRecord(array);
8085 node->parent = parent;
8088 VectorCopy(triangles[0].vertex[0].v, mins);
8089 VectorCopy(triangles[0].vertex[0].v, maxs);
8091 else if (parent && parent->children[0] == node)
8093 VectorCopy(parent->mins, mins);
8094 Vectorcopy(parent->maxs, maxs);
8096 else if (parent && parent->children[1] == node)
8098 VectorCopy(parent->mins, mins);
8099 Vectorcopy(parent->maxs, maxs);
8106 for (i = 0;i < numtriangles;i++)
8108 for (j = 0;j < 3;j++)
8110 mins[0] = min(mins[0], triangles[i].vertex[j].v[0]);
8111 mins[1] = min(mins[1], triangles[i].vertex[j].v[1]);
8112 mins[2] = min(mins[2], triangles[i].vertex[j].v[2]);
8113 maxs[0] = max(maxs[0], triangles[i].vertex[j].v[0]);
8114 maxs[1] = max(maxs[1], triangles[i].vertex[j].v[1]);
8115 maxs[2] = max(maxs[2], triangles[i].vertex[j].v[2]);
8118 VectorCopy(mins, node->mins);
8119 VectorCopy(maxs, node->maxs);
8120 if (numtriangles <= mod_obj_leaftriangles.integer)
8123 loadmodel->brush.num_leafs++;
8124 node->triangles = triangles;
8125 node->numtriangles = numtriangles;
8130 loadmodel->brush.num_nodes++;
8131 // pick a splitting plane from the various choices available to us...
8132 // early splits simply halve the interval
8134 VectorClear(bestnormal);
8136 if (numtriangles <= mod_obj_splitterlimit.integer)
8137 limit = numtriangles;
8140 for (i = -3;i < limit;i++)
8144 // first we try 3 axial splits (kdtree-like)
8146 VectorClear(normal);
8148 dist = (mins[j] + maxs[j]) * 0.5f;
8152 // then we try each triangle plane
8153 TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
8154 VectorNormalize(normal);
8155 dist = DotProduct(normal, triangles[i].vertex[0].v);
8156 // use positive axial values whenever possible
8157 if (normal[0] == -1)
8159 if (normal[1] == -1)
8161 if (normal[2] == -1)
8163 // skip planes that match the current best
8164 if (VectorCompare(normal, bestnormal) && dist == bestdist)
8171 for (j = 0;j < numtriangles;j++)
8173 dists[0] = DotProduct(normal, triangles[j].vertex[0].v) - dist;
8174 dists[1] = DotProduct(normal, triangles[j].vertex[1].v) - dist;
8175 dists[2] = DotProduct(normal, triangles[j].vertex[2].v) - dist;
8176 if (dists[0] < -DIST_EPSILON || dists[1] < -DIST_EPSILON || dists[2] < -DIST_EPSILON)
8178 if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
8183 else if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
8188 // score is supposed to:
8189 // prefer axial splits
8190 // prefer evenly dividing the input triangles
8191 // prefer triangles on the plane
8192 // avoid triangles crossing the plane
8193 score = count_on*count_on - count_both*count_both + min(count_front, count_back)*(count_front+count_back);
8194 if (normal[0] == 1 || normal[1] == 1 || normal[2] == 1)
8196 if (i == -3 || bestscore < score)
8198 VectorCopy(normal, bestnormal);
8204 // now we have chosen an optimal split plane...
8206 // divide triangles by the splitting plane
8207 numfronttriangles = 0;
8208 numbacktriangles = 0;
8209 for (i = 0;i < numtriangles;i++)
8211 neededfrontpoints = 0;
8212 neededbackpoints = 0;
8214 PolygonF_Divide(3, triangles[i].vertex[0].v, bestnormal[0], bestnormal[1], bestnormal[2], bestdist, DIST_EPSILON, 5, outfrontpoints[0], &neededfrontpoints, 5, outbackpoints[0], &neededbackpoints, &countonpoints);
8215 if (countonpoints > 1)
8217 // triangle lies on plane, assign it to one child only
8218 TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
8219 if (DotProduct(bestnormal, normal) >= 0)
8221 // assign to front side child
8222 obj_fronttriangles[numfronttriangles++] = triangles[i];
8226 // assign to back side child
8227 obj_backtriangles[numbacktriangles++] = triangles[i];
8232 // convert clipped polygons to triangles
8233 for (j = 0;j < neededfrontpoints-2;j++)
8235 obj_fronttriangles[numfronttriangles] = triangles[i];
8236 VectorCopy(outfrontpoints[0], obj_fronttriangles[numfronttriangles].vertex[0].v);
8237 VectorCopy(outfrontpoints[j+1], obj_fronttriangles[numfronttriangles].vertex[1].v);
8238 VectorCopy(outfrontpoints[j+2], obj_fronttriangles[numfronttriangles].vertex[2].v);
8239 numfronttriangles++;
8241 for (j = 0;j < neededbackpoints-2;j++)
8243 obj_backtriangles[numbacktriangles] = triangles[i];
8244 VectorCopy(outbackpoints[0], obj_backtriangles[numbacktriangles].vertex[0].v);
8245 VectorCopy(outbackpoints[j+1], obj_backtriangles[numbacktriangles].vertex[1].v);
8246 VectorCopy(outbackpoints[j+2], obj_backtriangles[numbacktriangles].vertex[2].v);
8252 // now copy the triangles out of the big buffer
8253 if (numfronttriangles)
8255 fronttriangles = Mem_Alloc(loadmodel->mempool, fronttriangles * sizeof(*fronttriangles));
8256 memcpy(fronttriangles, obj_fronttriangles, numfronttriangles * sizeof(*fronttriangles));
8259 fronttriangles = NULL;
8260 if (numbacktriangles)
8262 backtriangles = Mem_Alloc(loadmodel->mempool, backtriangles * sizeof(*backtriangles));
8263 memcpy(backtriangles, obj_backtriangles, numbacktriangles * sizeof(*backtriangles));
8266 backtriangles = NULL;
8268 // free the original triangles we were given
8270 Mem_Free(triangles);
8274 // now create the children...
8275 node->children[0] = Mod_OBJ_BSPNodeForTriangles(node, fronttriangles, numfronttriangles, frontmins, frontmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
8276 node->children[1] = Mod_OBJ_BSPNodeForTriangles(node, backtriangles, numbacktriangles, backmins, backmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
8280 void Mod_OBJ_SnapVertex(float *v)
8283 float a = mod_obj_vertexprecision.value;
8285 v[0] -= floor(v[0] * a + 0.5f) * b;
8286 v[1] -= floor(v[1] * a + 0.5f) * b;
8287 v[2] -= floor(v[2] * a + 0.5f) * b;
8290 void Mod_OBJ_ConvertBSPNode(objnode_t *objnode, mnode_t *mnodeparent)
8292 if (objnode->children[0])
8294 // convert to mnode_t
8295 mnode_t *mnode = loadmodel->brush.data_nodes + loadmodel->brush.num_nodes++;
8296 mnode->parent = mnodeparent;
8297 mnode->plane = loadmodel->brush.data_planes + loadmodel->brush.num_planes++;
8298 VectorCopy(objnode->normal, mnode->plane->normal);
8299 mnode->plane->dist = objnode->dist;
8300 PlaneClassify(mnode->plane);
8301 VectorCopy(objnode->mins, mnode->mins);
8302 VectorCopy(objnode->maxs, mnode->maxs);
8303 // push combinedsupercontents up to the parent
8305 mnodeparent->combinedsupercontents |= mnode->combinedsupercontents;
8306 mnode->children[0] = Mod_OBJ_ConvertBSPNode(objnode->children[0], mnode);
8307 mnode->children[1] = Mod_OBJ_ConvertBSPNode(objnode->children[1], mnode);
8311 // convert to mleaf_t
8312 mleaf_t *mleaf = loadmodel->brush.data_leafs + loadmodel->brush.num_leafs++;
8313 mleaf->parent = mnodeparent;
8314 VectorCopy(objnode->mins, mleaf->mins);
8315 VectorCopy(objnode->maxs, mleaf->maxs);
8316 mleaf->clusterindex = loadmodel->brush.num_leafs - 1;
8317 if (objnode->numtriangles)
8319 objtriangle_t *triangles = objnode->triangles;
8320 int numtriangles = objnode->numtriangles;
8324 objvertex_t vertex[3];
8326 maxsurfaces = numtriangles;
8328 // calculate some more data on each triangle for surface gathering
8329 for (i = 0;i < numtriangles;i++)
8331 triangle = triangles + i;
8332 texture = loadmodel->data_textures + triangle->textureindex;
8333 Mod_OBJ_SnapVertex(triangle->vertex[0].v);
8334 Mod_OBJ_SnapVertex(triangle->vertex[1].v);
8335 Mod_OBJ_SnapVertex(triangle->vertex[2].v);
8336 TriangleNormal(triangle->vertex[0].v, triangle->vertex[1].v, triangle->vertex[2].v, normal);
8338 if (fabs(normal[axis]) < fabs(normal[1]))
8340 if (fabs(normal[axis]) < fabs(normal[2]))
8342 VectorClear(normal);
8344 triangle->axis = axis;
8345 VectorSubtract(triangle->vertex[1].v, triangle->vertex[0].v, edge[0]);
8346 VectorSubtract(triangle->vertex[2].v, triangle->vertex[1].v, edge[1]);
8347 VectorSubtract(triangle->vertex[0].v, triangle->vertex[2].v, edge[2]);
8348 CrossProduct(edge[0], normal, triangle->edgeplane[0]);
8349 CrossProduct(edge[1], normal, triangle->edgeplane[1]);
8350 CrossProduct(edge[2], normal, triangle->edgeplane[2]);
8351 VectorNormalize(triangle->edgeplane[0]);
8352 VectorNormalize(triangle->edgeplane[1]);
8353 VectorNormalize(triangle->edgeplane[2]);
8354 triangle->edgeplane[0][3] = DotProduct(triangle->edgeplane[0], triangle->vertex[0].v);
8355 triangle->edgeplane[1][3] = DotProduct(triangle->edgeplane[1], triangle->vertex[1].v);
8356 triangle->edgeplane[2][3] = DotProduct(triangle->edgeplane[2], triangle->vertex[2].v);
8357 triangle->surfaceindex = 0;
8358 // add to the combined supercontents while we're here...
8359 mleaf->combinedsupercontents |= texture->supercontents;
8362 for (i = 0;i < numtriangles;i++)
8364 // skip already-assigned triangles
8365 if (triangles[i].surfaceindex)
8367 texture = loadmodel->data_textures + triangles[i].textureindex;
8368 // assign a new surface to this triangle
8369 triangles[i].surfaceindex = surfaceindex++;
8370 axis = triangles[i].axis;
8372 // find the triangle's neighbors, this can take multiple passes
8377 for (j = i+1;j < numtriangles;j++)
8379 if (triangles[j].surfaceindex || triangles[j].axis != axis || triangles[j].texture != texture)
8381 triangle = triangles + j;
8382 for (k = i;k < j;k++)
8384 if (triangles[k].surfaceindex != surfaceindex)
8386 if (VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[0].v)
8387 || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[1].v)
8388 || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[2].v)
8389 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[0].v)
8390 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[1].v)
8391 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[2].v)
8392 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[0].v)
8393 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[1].v)
8394 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[2].v))
8396 // shares a vertex position
8400 for (k = 0;k < numvertices;k++)
8401 if (!VectorCompare(vertex[k].v, triangles[j].vertex[0].v) || !VectorCompare(vertex[k].v, triangles[j].vertex[1].v) || !VectorCompare(vertex[k].v, triangles[j].vertex[2].v))
8403 if (k == numvertices)
8404 break; // not a neighbor
8405 // this triangle is a neighbor and has the same axis and texture
8406 // check now if it overlaps in lightmap projection space
8407 triangles[j].surfaceindex;
8411 //triangles[i].surfaceindex = surfaceindex++;
8412 for (surfaceindex = 0;surfaceindex < numsurfaces;surfaceindex++)
8414 if (surfaces[surfaceindex].texture != texture)
8416 // check if any triangles already in this surface overlap in lightmap projection space
8423 // let the collision code simply use the surfaces
8424 mleaf->containscollisionsurfaces = mleaf->combinedsupercontents != 0;
8425 mleaf->numleafsurfaces = ?;
8426 mleaf->firstleafsurface = ?;
8428 // push combinedsupercontents up to the parent
8430 mnodeparent->combinedsupercontents |= mleaf->combinedsupercontents;
8435 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
8438 const char *textbase = (char *)buffer, *text = textbase;
8442 char materialname[MAX_QPATH];
8443 int j, index1, index2, index3, first, prev, index;
8446 int numtriangles = 0;
8447 int maxtriangles = 131072;
8448 objtriangle_t *triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
8450 int maxtextures = 256, numtextures = 0, textureindex = 0;
8451 int maxv = 1024, numv = 0;
8452 int maxvt = 1024, numvt = 0;
8453 int maxvn = 1024, numvn = 0;
8454 char **texturenames;
8455 float *v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
8456 float *vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
8457 float *vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
8458 objvertex_t vfirst, vprev, vcurrent;
8463 int maxverthash = 65536, numverthash = 0;
8464 int numhashindex = 65536;
8465 struct objverthash_s
8467 struct objverthash_s *next;
8473 *hash, **verthash = Mem_Alloc(tempmempool, numhashindex * sizeof(*verthash)), *verthashdata = Mem_Alloc(tempmempool, maxverthash * sizeof(*verthashdata)), *oldverthashdata;
8476 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
8478 loadmodel->modeldatatypestring = "OBJ";
8480 loadmodel->type = mod_obj;
8481 loadmodel->soundfromcenter = true;
8482 loadmodel->TraceBox = Mod_OBJ_TraceBox;
8483 loadmodel->TraceLine = Mod_OBJ_TraceLine;
8484 loadmodel->TracePoint = Mod_OBJ_TracePoint;
8485 loadmodel->PointSuperContents = Mod_OBJ_PointSuperContents;
8486 loadmodel->TraceLineAgainstSurfaces = Mod_OBJ_TraceLineAgainstSurfaces;
8487 loadmodel->brush.TraceLineOfSight = Mod_OBJ_TraceLineOfSight;
8488 loadmodel->brush.SuperContentsFromNativeContents = Mod_OBJ_SuperContentsFromNativeContents;
8489 loadmodel->brush.NativeContentsFromSuperContents = Mod_OBJ_NativeContentsFromSuperContents;
8490 loadmodel->brush.GetPVS = Mod_OBJ_GetPVS;
8491 loadmodel->brush.FatPVS = Mod_OBJ_FatPVS;
8492 loadmodel->brush.BoxTouchingPVS = Mod_OBJ_BoxTouchingPVS;
8493 loadmodel->brush.BoxTouchingLeafPVS = Mod_OBJ_BoxTouchingLeafPVS;
8494 loadmodel->brush.BoxTouchingVisibleLeafs = Mod_OBJ_BoxTouchingVisibleLeafs;
8495 loadmodel->brush.FindBoxClusters = Mod_OBJ_FindBoxClusters;
8496 loadmodel->brush.LightPoint = Mod_OBJ_LightPoint;
8497 loadmodel->brush.FindNonSolidLocation = Mod_OBJ_FindNonSolidLocation;
8498 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
8499 loadmodel->brush.RoundUpToHullSize = NULL;
8500 loadmodel->brush.PointInLeaf = Mod_OBJ_PointInLeaf;
8501 loadmodel->Draw = R_Q1BSP_Draw;
8502 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
8503 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
8504 loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
8505 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
8506 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
8507 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
8508 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
8509 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
8510 loadmodel->DrawLight = R_Q1BSP_DrawLight;
8515 // parse the OBJ text now
8522 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
8523 line[linelen] = text[linelen];
8525 for (argc = 0;argc < (int)(sizeof(argv)/sizeof(argv[0]));argc++)
8529 while (*s == ' ' || *s == '\t')
8539 while (*s == ' ' || *s == '\t')
8544 if (argv[0][0] == '#')
8546 if (!strcmp(argv[0], "v"))
8552 v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
8555 memcpy(v, oldv, numv * sizeof(float[3]));
8559 v[numv*3+0] = atof(argv[1]);
8560 v[numv*3+1] = atof(argv[2]);
8561 v[numv*3+2] = atof(argv[3]);
8564 else if (!strcmp(argv[0], "vt"))
8570 vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
8573 memcpy(vt, oldvt, numvt * sizeof(float[2]));
8577 vt[numvt*2+0] = atof(argv[1]);
8578 vt[numvt*2+1] = atof(argv[2]);
8581 else if (!strcmp(argv[0], "vn"))
8587 vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
8590 memcpy(vn, oldvn, numvn * sizeof(float[3]));
8594 vn[numvn*3+0] = atof(argv[1]);
8595 vn[numvn*3+1] = atof(argv[2]);
8596 vn[numvn*3+2] = atof(argv[3]);
8599 else if (!strcmp(argv[0], "f"))
8601 for (j = 1;j < argc;j++)
8603 index1 = atoi(argv[j]);
8604 while(argv[j][0] && argv[j][0] != '/')
8608 index2 = atoi(argv[j]);
8609 while(argv[j][0] && argv[j][0] != '/')
8613 index3 = atoi(argv[j]);
8614 // negative refers to a recent vertex
8615 // zero means not specified
8616 // positive means an absolute vertex index
8618 index1 = numv - index1;
8620 index2 = numvt - index2;
8622 index3 = numvn - index3;
8623 VectorCopy(v + 3*index1, vcurrent.v);
8624 Vector2Copy(vt + 2*index2, vcurrent.vt);
8625 VectorCopy(vn + 3*index3, vcurrent.vn);
8626 if (numtriangles == 0)
8628 VectorCopy(vcurrent.v, mins);
8629 VectorCopy(vcurrent.v, maxs);
8633 mins[0] = min(mins[0], vcurrent.v[0]);
8634 mins[1] = min(mins[1], vcurrent.v[1]);
8635 mins[2] = min(mins[2], vcurrent.v[2]);
8636 maxs[0] = max(maxs[0], vcurrent.v[0]);
8637 maxs[1] = max(maxs[1], vcurrent.v[1]);
8638 maxs[2] = max(maxs[2], vcurrent.v[2]);
8644 if (maxtriangles <= numtriangles)
8646 objtriangle_t *oldtriangles = triangles;
8648 triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
8651 memcpy(triangles, oldtriangles, maxtriangles * sizeof(*triangles));
8652 Mem_Free(oldtriangles);
8655 triangles[numtriangles].textureindex = textureindex;
8656 triangles[numtriangles].vertex[0] = vfirst;
8657 triangles[numtriangles].vertex[1] = vprev;
8658 triangles[numtriangles].vertex[2] = vcurrent;
8665 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
8667 else if (!!strcmp(argv[0], "usemtl"))
8669 for (i = 0;i < numtextures;i++)
8670 if (!strcmp(texturenames[numtextures], argv[1]))
8672 if (i < numtextures)
8673 texture = textures + i;
8676 if (maxtextures <= numtextures)
8678 texture_t *oldtextures = textures;
8680 textures = Mem_Alloc(tempmempool, maxtextures * sizeof(*textures));
8683 memcpy(textures, oldtextures, numtextures * sizeof(*textures));
8684 Mem_Free(oldtextures);
8687 textureindex = numtextures++;
8688 texturenames[textureindex] = Mem_Alloc(tempmempool, strlen(argv[1]) + 1);
8689 memcpy(texturenames[textureindex], argv[1], strlen(argv[1]) + 1);
8699 // now that we have the OBJ data loaded as-is, we can convert it
8701 // load the textures
8702 loadmodel->num_textures = numtextures;
8703 loadmodel->data_textures = Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
8704 for (i = 0;i < numtextures;i++)
8705 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, texturenames[i], true, true, TEXF_MIPMAP | TEXF_ALPHA | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS);
8707 // free the texturenames array since we are now done with it
8708 for (i = 0;i < numtextures;i++)
8710 Mem_Free(texturenames[i]);
8711 texturenames[i] = NULL;
8713 Mem_Free(texturenames);
8714 texturenames = NULL;
8716 // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
8717 VectorCopy(mins, loadmodel->normalmins);
8718 VectorCopy(maxs, loadmodel->normalmaxs);
8719 dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
8720 modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
8721 modelyawradius = dist*dist+modelyawradius*modelyawradius;
8722 modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
8723 modelradius = modelyawradius + modelradius * modelradius;
8724 modelyawradius = sqrt(modelyawradius);
8725 modelradius = sqrt(modelradius);
8726 loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
8727 loadmodel->yawmins[2] = loadmodel->normalmins[2];
8728 loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] = modelyawradius;
8729 loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
8730 loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
8731 loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] = modelradius;
8732 loadmodel->radius = modelradius;
8733 loadmodel->radius2 = modelradius * modelradius;
8735 // make sure the temp triangle buffer is big enough for BSP building
8736 maxclippedtriangles = numtriangles*4;
8737 if (numtriangles > 0)
8739 clippedfronttriangles = Mem_Alloc(loadmodel->mempool, maxclippedtriangles * 2 * sizeof(objtriangle_t));
8740 clippedbacktriangles = clippedfronttriangles + maxclippedtriangles;
8743 // generate a rough BSP tree from triangle data, we don't have to be too careful here, it only has to define the basic areas of the map
8744 loadmodel->brush.num_leafs = 0;
8745 loadmodel->brush.num_nodes = 0;
8746 Mem_ExpandableArray_NewArray(&nodesarray, loadmodel->mempool, sizeof(objnode_t), 1024);
8747 rootnode = Mod_OBJ_BSPNodeForTriangles(triangles, numtriangles, mins, maxs, &nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
8749 // convert the BSP tree to mnode_t and mleaf_t structures and convert the triangles to msurface_t...
8750 loadmodel->brush.data_leafs = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
8751 loadmodel->brush.data_nodes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mnode_t));
8752 loadmodel->brush.data_planes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mplane_t));
8753 loadmodel->brush.num_leafs = 0;
8754 loadmodel->brush.num_nodes = 0;
8755 loadmodel->brush.num_planes = 0;
8756 Mod_OBJ_ConvertAndFreeBSPNode(rootnode);
8758 if (clippedfronttriangles)
8759 Mem_Free(clippedfronttriangles);
8760 maxclippedtriangles = 0;
8761 clippedfronttriangles = NULL;
8762 clippedbacktriangles = NULL;
8764 --- NOTHING DONE PAST THIS POINT ---
8766 loadmodel->numskins = LittleLong(pinmodel->num_skins);
8767 numxyz = LittleLong(pinmodel->num_xyz);
8768 numst = LittleLong(pinmodel->num_st);
8769 loadmodel->surfmesh.num_triangles = LittleLong(pinmodel->num_tris);
8770 loadmodel->numframes = LittleLong(pinmodel->num_frames);
8771 loadmodel->surfmesh.num_morphframes = loadmodel->numframes;
8772 loadmodel->num_poses = loadmodel->surfmesh.num_morphframes;
8773 skinwidth = LittleLong(pinmodel->skinwidth);
8774 skinheight = LittleLong(pinmodel->skinheight);
8775 iskinwidth = 1.0f / skinwidth;
8776 iskinheight = 1.0f / skinheight;
8778 loadmodel->num_surfaces = 1;
8779 loadmodel->nummodelsurfaces = loadmodel->num_surfaces;
8780 data = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * sizeof(msurface_t) + loadmodel->num_surfaces * sizeof(int) + loadmodel->numframes * sizeof(animscene_t) + loadmodel->numframes * sizeof(float[6]) + loadmodel->surfmesh.num_triangles * sizeof(int[3]) + (r_enableshadowvolume.integer ? loadmodel->surfmesh.num_triangles * sizeof(int[3]) : 0));
8781 loadmodel->data_surfaces = (msurface_t *)data;data += loadmodel->num_surfaces * sizeof(msurface_t);
8782 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
8783 loadmodel->sortedmodelsurfaces[0] = 0;
8784 loadmodel->animscenes = (animscene_t *)data;data += loadmodel->numframes * sizeof(animscene_t);
8785 loadmodel->surfmesh.data_morphmd2framesize6f = (float *)data;data += loadmodel->numframes * sizeof(float[6]);
8786 loadmodel->surfmesh.data_element3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
8787 if (r_enableshadowvolumes.integer)
8788 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
8790 loadmodel->synctype = ST_RAND;
8793 inskin = (char *)(base + LittleLong(pinmodel->ofs_skins));
8794 skinfiles = Mod_LoadSkinFiles();
8797 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
8798 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
8799 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
8800 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures, skinfiles, "default", "");
8801 Mod_FreeSkinFiles(skinfiles);
8803 else if (loadmodel->numskins)
8805 // skins found (most likely not a player model)
8806 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
8807 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
8808 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
8809 for (i = 0;i < loadmodel->numskins;i++, inskin += MD2_SKINNAME)
8810 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i * loadmodel->num_surfaces, inskin, true, true, (r_mipskins.integer ? TEXF_MIPMAP : 0) | TEXF_ALPHA | TEXF_PICMIP | TEXF_COMPRESS);
8814 // no skins (most likely a player model)
8815 loadmodel->numskins = 1;
8816 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
8817 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
8818 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
8819 Mod_BuildAliasSkinFromSkinFrame(loadmodel->data_textures, NULL);
8822 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
8823 for (i = 0;i < loadmodel->numskins;i++)
8825 loadmodel->skinscenes[i].firstframe = i;
8826 loadmodel->skinscenes[i].framecount = 1;
8827 loadmodel->skinscenes[i].loop = true;
8828 loadmodel->skinscenes[i].framerate = 10;
8831 // load the triangles and stvert data
8832 inst = (unsigned short *)(base + LittleLong(pinmodel->ofs_st));
8833 intri = (md2triangle_t *)(base + LittleLong(pinmodel->ofs_tris));
8834 md2verthash = (struct md2verthash_s **)Mem_Alloc(tempmempool, 65536 * sizeof(hash));
8835 md2verthashdata = (struct md2verthash_s *)Mem_Alloc(tempmempool, loadmodel->surfmesh.num_triangles * 3 * sizeof(*hash));
8836 // swap the triangle list
8837 loadmodel->surfmesh.num_vertices = 0;
8838 for (i = 0;i < loadmodel->surfmesh.num_triangles;i++)
8840 for (j = 0;j < 3;j++)
8842 xyz = (unsigned short) LittleShort (intri[i].index_xyz[j]);
8843 st = (unsigned short) LittleShort (intri[i].index_st[j]);
8846 Con_Printf("%s has an invalid xyz index (%i) on triangle %i, resetting to 0\n", loadmodel->name, xyz, i);
8851 Con_Printf("%s has an invalid st index (%i) on triangle %i, resetting to 0\n", loadmodel->name, st, i);
8854 hashindex = (xyz * 256 + st) & 65535;
8855 for (hash = md2verthash[hashindex];hash;hash = hash->next)
8856 if (hash->xyz == xyz && hash->st == st)
8860 hash = md2verthashdata + loadmodel->surfmesh.num_vertices++;
8863 hash->next = md2verthash[hashindex];
8864 md2verthash[hashindex] = hash;
8866 loadmodel->surfmesh.data_element3i[i*3+j] = (hash - md2verthashdata);
8870 vertremap = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(int));
8871 data = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(float[2]) + loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t));
8872 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += loadmodel->surfmesh.num_vertices * sizeof(float[2]);
8873 loadmodel->surfmesh.data_morphmdlvertex = (trivertx_t *)data;data += loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t);
8874 for (i = 0;i < loadmodel->surfmesh.num_vertices;i++)
8877 hash = md2verthashdata + i;
8878 vertremap[i] = hash->xyz;
8879 sts = LittleShort(inst[hash->st*2+0]);
8880 stt = LittleShort(inst[hash->st*2+1]);
8881 if (sts < 0 || sts >= skinwidth || stt < 0 || stt >= skinheight)
8883 Con_Printf("%s has an invalid skin coordinate (%i %i) on vert %i, changing to 0 0\n", loadmodel->name, sts, stt, i);
8887 loadmodel->surfmesh.data_texcoordtexture2f[i*2+0] = sts * iskinwidth;
8888 loadmodel->surfmesh.data_texcoordtexture2f[i*2+1] = stt * iskinheight;
8891 Mem_Free(md2verthash);
8892 Mem_Free(md2verthashdata);
8894 // generate ushort elements array if possible
8895 if (loadmodel->surfmesh.num_vertices <= 65536)
8896 loadmodel->surfmesh.data_element3s = (unsigned short *)Mem_Alloc(loadmodel->mempool, sizeof(unsigned short[3]) * loadmodel->surfmesh.num_triangles);
8899 datapointer = (base + LittleLong(pinmodel->ofs_frames));
8900 for (i = 0;i < loadmodel->surfmesh.num_morphframes;i++)
8905 pinframe = (md2frame_t *)datapointer;
8906 datapointer += sizeof(md2frame_t);
8907 // store the frame scale/translate into the appropriate array
8908 for (j = 0;j < 3;j++)
8910 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+j] = LittleFloat(pinframe->scale[j]);
8911 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+3+j] = LittleFloat(pinframe->translate[j]);
8913 // convert the vertices
8914 v = (trivertx_t *)datapointer;
8915 out = loadmodel->surfmesh.data_morphmdlvertex + i * loadmodel->surfmesh.num_vertices;
8916 for (k = 0;k < loadmodel->surfmesh.num_vertices;k++)
8917 out[k] = v[vertremap[k]];
8918 datapointer += numxyz * sizeof(trivertx_t);
8920 strlcpy(loadmodel->animscenes[i].name, pinframe->name, sizeof(loadmodel->animscenes[i].name));
8921 loadmodel->animscenes[i].firstframe = i;
8922 loadmodel->animscenes[i].framecount = 1;
8923 loadmodel->animscenes[i].framerate = 10;
8924 loadmodel->animscenes[i].loop = true;
8927 Mem_Free(vertremap);
8929 Mod_MakeSortedSurfaces(loadmodel);
8930 if (loadmodel->surfmesh.data_neighbor3i)
8931 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
8932 Mod_Alias_CalculateBoundingBox();
8933 Mod_Alias_MorphMesh_CompileFrames();
8935 surface = loadmodel->data_surfaces;
8936 surface->texture = loadmodel->data_textures;
8937 surface->num_firsttriangle = 0;
8938 surface->num_triangles = loadmodel->surfmesh.num_triangles;
8939 surface->num_firstvertex = 0;
8940 surface->num_vertices = loadmodel->surfmesh.num_vertices;
8942 loadmodel->surfmesh.isanimated = false;
8944 if (loadmodel->surfmesh.data_element3s)
8945 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
8946 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
8949 #endif // !OBJASMODEL
8951 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
8953 // we already have done PVS culling at this point...
8954 // so we don't need to do it again.
8957 vec3_t testorigin, mins, maxs;
8959 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
8960 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
8961 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
8963 if(model->brush.TraceLineOfSight(model, eye, testorigin))
8966 // expand the box a little
8967 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
8968 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
8969 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
8970 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
8971 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
8972 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
8974 for(i = 0; i != numsamples; ++i)
8976 testorigin[0] = lhrandom(mins[0], maxs[0]);
8977 testorigin[1] = lhrandom(mins[1], maxs[1]);
8978 testorigin[2] = lhrandom(mins[2], maxs[2]);
8980 if(model->brush.TraceLineOfSight(model, eye, testorigin))