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_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
42 cvar_t mod_q3bsp_curves_collisions_stride = {0, "mod_q3bsp_curves_collisions_stride", "16", "collisions against curves: optimize performance by doing a combined collision check for this triangle amount first (-1 avoids any box tests)"};
43 cvar_t mod_q3bsp_curves_stride = {0, "mod_q3bsp_curves_stride", "16", "particle effect collisions against curves: optimize performance by doing a combined collision check for this triangle amount first (-1 avoids any box tests)"};
44 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
45 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
46 cvar_t mod_q3bsp_lightmapmergepower = {CVAR_SAVE, "mod_q3bsp_lightmapmergepower", "4", "merges the quake3 128x128 lightmap textures into larger lightmap group textures to speed up rendering, 1 = 256x256, 2 = 512x512, 3 = 1024x1024, 4 = 2048x2048, 5 = 4096x4096, ..."};
47 cvar_t mod_q3bsp_nolightmaps = {CVAR_SAVE, "mod_q3bsp_nolightmaps", "0", "do not load lightmaps in Q3BSP maps (to save video RAM, but be warned: it looks ugly)"};
48 cvar_t mod_q3bsp_tracelineofsight_brushes = {0, "mod_q3bsp_tracelineofsight_brushes", "0", "enables culling of entities behind detail brushes, curves, etc"};
49 cvar_t mod_q3shader_default_offsetmapping = {CVAR_SAVE, "mod_q3shader_default_offsetmapping", "1", "use offsetmapping by default on all surfaces"};
50 cvar_t mod_q3shader_default_polygonfactor = {0, "mod_q3shader_default_polygonfactor", "0", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
51 cvar_t mod_q3shader_default_polygonoffset = {0, "mod_q3shader_default_polygonoffset", "-2", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
53 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)"};
54 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"};
55 cvar_t mod_collision_bih_childrengrouping = {0, "mod_collision_bih_childrengrouping", "16", "this setting prevents excessive recursion depth in the BIH tree by building a shallow tree"};
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_q3bsp_curves_collisions);
79 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
80 Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
81 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
82 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
83 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
84 Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
85 Cvar_RegisterVariable(&mod_q3bsp_tracelineofsight_brushes);
86 Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping);
87 Cvar_RegisterVariable(&mod_q3shader_default_polygonfactor);
88 Cvar_RegisterVariable(&mod_q3shader_default_polygonoffset);
89 Cvar_RegisterVariable(&mod_q1bsp_polygoncollisions);
90 Cvar_RegisterVariable(&mod_collision_bih);
91 Cvar_RegisterVariable(&mod_collision_bih_childrengrouping);
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];
1594 unsigned char *data, *mtdata;
1596 char mapname[MAX_QPATH], name[MAX_QPATH];
1597 unsigned char zero[4];
1599 memset(zero, 0, sizeof(zero));
1601 loadmodel->data_textures = NULL;
1603 // add two slots for notexture walls and notexture liquids
1606 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1607 m->nummiptex = LittleLong (m->nummiptex);
1608 loadmodel->num_textures = m->nummiptex + 2;
1609 loadmodel->num_texturesperskin = loadmodel->num_textures;
1614 loadmodel->num_textures = 2;
1615 loadmodel->num_texturesperskin = loadmodel->num_textures;
1618 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1620 // fill out all slots with notexture
1621 if (cls.state != ca_dedicated)
1622 skinframe = R_SkinFrame_LoadMissing();
1625 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1627 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1630 if (cls.state != ca_dedicated)
1632 tx->numskinframes = 1;
1633 tx->skinframerate = 1;
1634 tx->skinframes[0] = skinframe;
1635 tx->currentskinframe = tx->skinframes[0];
1637 tx->basematerialflags = MATERIALFLAG_WALL;
1638 if (i == loadmodel->num_textures - 1)
1640 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1641 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1642 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1646 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1647 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1649 tx->currentframe = tx;
1651 // clear water settings
1654 tx->refractfactor = 1;
1655 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1656 tx->reflectfactor = 1;
1657 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1658 tx->r_water_wateralpha = 1;
1659 tx->offsetmapping = OFFSETMAPPING_OFF;
1660 tx->offsetscale = 1;
1661 tx->specularscalemod = 1;
1662 tx->specularpowermod = 1;
1667 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1671 s = loadmodel->name;
1672 if (!strncasecmp(s, "maps/", 5))
1674 FS_StripExtension(s, mapname, sizeof(mapname));
1676 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1678 // LordHavoc: mostly rewritten map texture loader
1679 for (i = 0;i < m->nummiptex;i++)
1681 dofs[i] = LittleLong(dofs[i]);
1682 if (r_nosurftextures.integer)
1686 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1689 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1691 // copy name, but only up to 16 characters
1692 // (the output buffer can hold more than this, but the input buffer is
1694 for (j = 0;j < 16 && dmiptex->name[j];j++)
1695 name[j] = dmiptex->name[j];
1700 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1701 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1704 mtwidth = LittleLong(dmiptex->width);
1705 mtheight = LittleLong(dmiptex->height);
1707 j = LittleLong(dmiptex->offsets[0]);
1711 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1713 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1716 mtdata = (unsigned char *)dmiptex + j;
1719 if ((mtwidth & 15) || (mtheight & 15))
1720 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1722 // LordHavoc: force all names to lowercase
1723 for (j = 0;name[j];j++)
1724 if (name[j] >= 'A' && name[j] <= 'Z')
1725 name[j] += 'a' - 'A';
1727 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1730 tx = loadmodel->data_textures + i;
1731 strlcpy(tx->name, name, sizeof(tx->name));
1732 tx->width = mtwidth;
1733 tx->height = mtheight;
1735 if (tx->name[0] == '*')
1737 if (!strncmp(tx->name, "*lava", 5))
1739 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1740 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1742 else if (!strncmp(tx->name, "*slime", 6))
1744 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1745 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1749 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1750 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1753 else if (!strncmp(tx->name, "sky", 3))
1755 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1756 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1760 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1761 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1764 if (cls.state != ca_dedicated)
1766 // LordHavoc: HL sky textures are entirely different than quake
1767 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == mtheight * 2)
1769 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), false, false, r_texture_convertsRGB_skin.integer != 0, NULL);
1771 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), false, false, r_texture_convertsRGB_skin.integer != 0, NULL);
1772 if (data && image_width == image_height * 2)
1774 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1777 else if (mtdata != NULL)
1778 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1782 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);
1784 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);
1787 // did not find external texture, load it from the bsp or wad3
1788 if (loadmodel->brush.ishlbsp)
1790 // internal texture overrides wad
1791 unsigned char *pixels, *freepixels;
1792 pixels = freepixels = NULL;
1794 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1796 pixels = freepixels = W_GetTextureBGRA(tx->name);
1799 tx->width = image_width;
1800 tx->height = image_height;
1801 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, pixels, image_width, image_height);
1804 Mem_Free(freepixels);
1806 else if (mtdata) // texture included
1807 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1809 // if skinframe is still NULL the "missing" texture will be used
1811 tx->skinframes[0] = skinframe;
1814 tx->basematerialflags = MATERIALFLAG_WALL;
1815 if (tx->name[0] == '*')
1817 // LordHavoc: some turbulent textures should not be affected by wateralpha
1818 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1820 // replace the texture with transparent black
1821 Vector4Set(zero, 128, 128, 128, 128);
1822 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA, zero, 1, 1);
1823 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1825 else if (!strncmp(tx->name,"*lava",5)
1826 || !strncmp(tx->name,"*teleport",9)
1827 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1828 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1830 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1831 if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1832 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1834 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1836 // replace the texture with black
1837 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, 0, zero, 1, 1);
1838 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1840 else if (!strncmp(tx->name, "sky", 3))
1841 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1842 else if (!strcmp(tx->name, "caulk"))
1843 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1844 else if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1845 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1847 // start out with no animation
1848 tx->currentframe = tx;
1849 tx->currentskinframe = tx->skinframes[0];
1853 // sequence the animations
1854 for (i = 0;i < m->nummiptex;i++)
1856 tx = loadmodel->data_textures + i;
1857 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1859 if (tx->anim_total[0] || tx->anim_total[1])
1860 continue; // already sequenced
1862 // find the number of frames in the animation
1863 memset(anims, 0, sizeof(anims));
1864 memset(altanims, 0, sizeof(altanims));
1866 for (j = i;j < m->nummiptex;j++)
1868 tx2 = loadmodel->data_textures + j;
1869 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1873 if (num >= '0' && num <= '9')
1874 anims[num - '0'] = tx2;
1875 else if (num >= 'a' && num <= 'j')
1876 altanims[num - 'a'] = tx2;
1878 Con_Printf("Bad animating texture %s\n", tx->name);
1882 for (j = 0;j < 10;j++)
1889 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1892 for (j = 0;j < max;j++)
1896 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1900 for (j = 0;j < altmax;j++)
1904 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1913 // if there is no alternate animation, duplicate the primary
1914 // animation into the alternate
1916 for (k = 0;k < 10;k++)
1917 altanims[k] = anims[k];
1920 // link together the primary animation
1921 for (j = 0;j < max;j++)
1924 tx2->animated = true;
1925 tx2->anim_total[0] = max;
1926 tx2->anim_total[1] = altmax;
1927 for (k = 0;k < 10;k++)
1929 tx2->anim_frames[0][k] = anims[k];
1930 tx2->anim_frames[1][k] = altanims[k];
1934 // if there really is an alternate anim...
1935 if (anims[0] != altanims[0])
1937 // link together the alternate animation
1938 for (j = 0;j < altmax;j++)
1941 tx2->animated = true;
1942 // the primary/alternate are reversed here
1943 tx2->anim_total[0] = altmax;
1944 tx2->anim_total[1] = max;
1945 for (k = 0;k < 10;k++)
1947 tx2->anim_frames[0][k] = altanims[k];
1948 tx2->anim_frames[1][k] = anims[k];
1955 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1958 unsigned char *in, *out, *data, d;
1959 char litfilename[MAX_QPATH];
1960 char dlitfilename[MAX_QPATH];
1961 fs_offset_t filesize;
1962 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1964 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1965 for (i=0; i<l->filelen; i++)
1966 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1968 else // LordHavoc: bsp version 29 (normal white lighting)
1970 // LordHavoc: hope is not lost yet, check for a .lit file to load
1971 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1972 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1973 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1974 strlcat (litfilename, ".lit", sizeof (litfilename));
1975 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1976 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1979 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1981 i = LittleLong(((int *)data)[1]);
1984 if (developer_loading.integer)
1985 Con_Printf("loaded %s\n", litfilename);
1986 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1987 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1989 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1992 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1994 i = LittleLong(((int *)data)[1]);
1997 if (developer_loading.integer)
1998 Con_Printf("loaded %s\n", dlitfilename);
1999 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
2000 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
2001 loadmodel->brushq3.deluxemapping_modelspace = false;
2002 loadmodel->brushq3.deluxemapping = true;
2011 Con_Printf("Unknown .lit file version (%d)\n", i);
2013 else if (filesize == 8)
2014 Con_Print("Empty .lit file, ignoring\n");
2016 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
2023 // LordHavoc: oh well, expand the white lighting data
2026 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
2027 in = mod_base + l->fileofs;
2028 out = loadmodel->brushq1.lightdata;
2029 for (i = 0;i < l->filelen;i++)
2039 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
2041 loadmodel->brushq1.num_compressedpvs = 0;
2042 loadmodel->brushq1.data_compressedpvs = NULL;
2045 loadmodel->brushq1.num_compressedpvs = l->filelen;
2046 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
2047 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
2050 // used only for HalfLife maps
2051 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
2053 char key[128], value[4096];
2057 if (!COM_ParseToken_Simple(&data, false, false))
2059 if (com_token[0] != '{')
2063 if (!COM_ParseToken_Simple(&data, false, false))
2065 if (com_token[0] == '}')
2066 break; // end of worldspawn
2067 if (com_token[0] == '_')
2068 strlcpy(key, com_token + 1, sizeof(key));
2070 strlcpy(key, com_token, sizeof(key));
2071 while (key[strlen(key)-1] == ' ') // remove trailing spaces
2072 key[strlen(key)-1] = 0;
2073 if (!COM_ParseToken_Simple(&data, false, false))
2075 dpsnprintf(value, sizeof(value), "%s", com_token);
2076 if (!strcmp("wad", key)) // for HalfLife maps
2078 if (loadmodel->brush.ishlbsp)
2081 for (i = 0;i < (int)sizeof(value);i++)
2082 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
2086 for (;i < (int)sizeof(value);i++)
2088 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
2089 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
2091 else if (value[i] == ';' || value[i] == 0)
2095 W_LoadTextureWadFile(&value[j], false);
2107 static void Mod_Q1BSP_LoadEntities(lump_t *l)
2109 loadmodel->brush.entities = NULL;
2112 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
2113 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
2114 loadmodel->brush.entities[l->filelen] = 0;
2115 if (loadmodel->brush.ishlbsp)
2116 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
2120 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
2126 in = (dvertex_t *)(mod_base + l->fileofs);
2127 if (l->filelen % sizeof(*in))
2128 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
2129 count = l->filelen / sizeof(*in);
2130 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2132 loadmodel->brushq1.vertexes = out;
2133 loadmodel->brushq1.numvertexes = count;
2135 for ( i=0 ; i<count ; i++, in++, out++)
2137 out->position[0] = LittleFloat(in->point[0]);
2138 out->position[1] = LittleFloat(in->point[1]);
2139 out->position[2] = LittleFloat(in->point[2]);
2143 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
2144 // can be used for this
2146 int SB_ReadInt (unsigned char **buffer)
2149 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
2155 float SB_ReadFloat (unsigned char **buffer)
2163 u.i = SB_ReadInt (buffer);
2167 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
2169 unsigned char *index;
2173 index = (unsigned char *)(mod_base + l->fileofs);
2174 if (l->filelen % (48+4*hullinfo->filehulls))
2175 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
2177 count = l->filelen / (48+4*hullinfo->filehulls);
2178 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
2180 loadmodel->brushq1.submodels = out;
2181 loadmodel->brush.numsubmodels = count;
2183 for (i = 0; i < count; i++, out++)
2185 // spread out the mins / maxs by a pixel
2186 out->mins[0] = SB_ReadFloat (&index) - 1;
2187 out->mins[1] = SB_ReadFloat (&index) - 1;
2188 out->mins[2] = SB_ReadFloat (&index) - 1;
2189 out->maxs[0] = SB_ReadFloat (&index) + 1;
2190 out->maxs[1] = SB_ReadFloat (&index) + 1;
2191 out->maxs[2] = SB_ReadFloat (&index) + 1;
2192 out->origin[0] = SB_ReadFloat (&index);
2193 out->origin[1] = SB_ReadFloat (&index);
2194 out->origin[2] = SB_ReadFloat (&index);
2195 for (j = 0; j < hullinfo->filehulls; j++)
2196 out->headnode[j] = SB_ReadInt (&index);
2197 out->visleafs = SB_ReadInt (&index);
2198 out->firstface = SB_ReadInt (&index);
2199 out->numfaces = SB_ReadInt (&index);
2203 static void Mod_Q1BSP_LoadEdges(lump_t *l)
2209 in = (dedge_t *)(mod_base + l->fileofs);
2210 if (l->filelen % sizeof(*in))
2211 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2212 count = l->filelen / sizeof(*in);
2213 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2215 loadmodel->brushq1.edges = out;
2216 loadmodel->brushq1.numedges = count;
2218 for ( i=0 ; i<count ; i++, in++, out++)
2220 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2221 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2222 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2224 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);
2225 if(!loadmodel->brushq1.numvertexes)
2226 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2234 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2238 int i, j, k, count, miptex;
2240 in = (texinfo_t *)(mod_base + l->fileofs);
2241 if (l->filelen % sizeof(*in))
2242 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2243 count = l->filelen / sizeof(*in);
2244 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2246 loadmodel->brushq1.texinfo = out;
2247 loadmodel->brushq1.numtexinfo = count;
2249 for (i = 0;i < count;i++, in++, out++)
2251 for (k = 0;k < 2;k++)
2252 for (j = 0;j < 4;j++)
2253 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2255 miptex = LittleLong(in->miptex);
2256 out->flags = LittleLong(in->flags);
2258 out->texture = NULL;
2259 if (loadmodel->data_textures)
2261 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2262 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2264 out->texture = loadmodel->data_textures + miptex;
2266 if (out->flags & TEX_SPECIAL)
2268 // if texture chosen is NULL or the shader needs a lightmap,
2269 // force to notexture water shader
2270 if (out->texture == NULL)
2271 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2275 // if texture chosen is NULL, force to notexture
2276 if (out->texture == NULL)
2277 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2283 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2288 mins[0] = mins[1] = mins[2] = 9999;
2289 maxs[0] = maxs[1] = maxs[2] = -9999;
2291 for (i = 0;i < numverts;i++)
2293 for (j = 0;j < 3;j++, v++)
2303 #define MAX_SUBDIVPOLYTRIANGLES 4096
2304 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2306 static int subdivpolyverts, subdivpolytriangles;
2307 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2308 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2310 static int subdivpolylookupvert(vec3_t v)
2313 for (i = 0;i < subdivpolyverts;i++)
2314 if (subdivpolyvert[i][0] == v[0]
2315 && subdivpolyvert[i][1] == v[1]
2316 && subdivpolyvert[i][2] == v[2])
2318 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2319 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2320 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2321 return subdivpolyverts++;
2324 static void SubdividePolygon(int numverts, float *verts)
2326 int i, i1, i2, i3, f, b, c, p;
2327 vec3_t mins, maxs, front[256], back[256];
2328 float m, *pv, *cv, dist[256], frac;
2331 Host_Error("SubdividePolygon: ran out of verts in buffer");
2333 BoundPoly(numverts, verts, mins, maxs);
2335 for (i = 0;i < 3;i++)
2337 m = (mins[i] + maxs[i]) * 0.5;
2338 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2339 if (maxs[i] - m < 8)
2341 if (m - mins[i] < 8)
2345 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2346 dist[c] = cv[i] - m;
2349 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2353 VectorCopy(pv, front[f]);
2358 VectorCopy(pv, back[b]);
2361 if (dist[p] == 0 || dist[c] == 0)
2363 if ((dist[p] > 0) != (dist[c] > 0) )
2366 frac = dist[p] / (dist[p] - dist[c]);
2367 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2368 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2369 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2375 SubdividePolygon(f, front[0]);
2376 SubdividePolygon(b, back[0]);
2380 i1 = subdivpolylookupvert(verts);
2381 i2 = subdivpolylookupvert(verts + 3);
2382 for (i = 2;i < numverts;i++)
2384 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2386 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2390 i3 = subdivpolylookupvert(verts + i * 3);
2391 subdivpolyindex[subdivpolytriangles][0] = i1;
2392 subdivpolyindex[subdivpolytriangles][1] = i2;
2393 subdivpolyindex[subdivpolytriangles][2] = i3;
2395 subdivpolytriangles++;
2399 //Breaks a polygon up along axial 64 unit
2400 //boundaries so that turbulent and sky warps
2401 //can be done reasonably.
2402 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2408 subdivpolytriangles = 0;
2409 subdivpolyverts = 0;
2410 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2411 if (subdivpolytriangles < 1)
2412 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2414 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2415 mesh->num_vertices = subdivpolyverts;
2416 mesh->num_triangles = subdivpolytriangles;
2417 mesh->vertex = (surfvertex_t *)(mesh + 1);
2418 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2419 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2421 for (i = 0;i < mesh->num_triangles;i++)
2422 for (j = 0;j < 3;j++)
2423 mesh->index[i*3+j] = subdivpolyindex[i][j];
2425 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2427 VectorCopy(subdivpolyvert[i], v->v);
2428 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2429 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2434 extern cvar_t gl_max_lightmapsize;
2435 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2438 msurface_t *surface;
2439 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2440 float texmins[2], texmaxs[2], val;
2441 rtexture_t *lightmaptexture, *deluxemaptexture;
2443 in = (dface_t *)(mod_base + l->fileofs);
2444 if (l->filelen % sizeof(*in))
2445 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2446 count = l->filelen / sizeof(*in);
2447 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2448 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2450 loadmodel->num_surfaces = count;
2452 loadmodel->brushq1.firstrender = true;
2453 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2457 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2459 numedges = (unsigned short)LittleShort(in->numedges);
2460 totalverts += numedges;
2461 totaltris += numedges - 2;
2464 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2466 lightmaptexture = NULL;
2467 deluxemaptexture = r_texture_blanknormalmap;
2469 lightmapsize = bound(256, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d);
2470 totallightmapsamples = 0;
2474 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2476 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2478 // FIXME: validate edges, texinfo, etc?
2479 firstedge = LittleLong(in->firstedge);
2480 numedges = (unsigned short)LittleShort(in->numedges);
2481 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)
2482 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2483 i = (unsigned short)LittleShort(in->texinfo);
2484 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2485 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2486 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2487 surface->texture = surface->lightmapinfo->texinfo->texture;
2489 planenum = (unsigned short)LittleShort(in->planenum);
2490 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2491 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2493 //surface->flags = surface->texture->flags;
2494 //if (LittleShort(in->side))
2495 // surface->flags |= SURF_PLANEBACK;
2496 //surface->plane = loadmodel->brush.data_planes + planenum;
2498 surface->num_firstvertex = totalverts;
2499 surface->num_vertices = numedges;
2500 surface->num_firsttriangle = totaltris;
2501 surface->num_triangles = numedges - 2;
2502 totalverts += numedges;
2503 totaltris += numedges - 2;
2505 // convert edges back to a normal polygon
2506 for (i = 0;i < surface->num_vertices;i++)
2508 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2510 // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2512 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2514 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2515 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2516 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2517 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2518 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2519 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2520 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2521 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2524 for (i = 0;i < surface->num_triangles;i++)
2526 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2527 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2528 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2531 // compile additional data about the surface geometry
2532 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);
2533 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);
2534 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2536 // generate surface extents information
2537 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2538 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2539 for (i = 1;i < surface->num_vertices;i++)
2541 for (j = 0;j < 2;j++)
2543 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2544 texmins[j] = min(texmins[j], val);
2545 texmaxs[j] = max(texmaxs[j], val);
2548 for (i = 0;i < 2;i++)
2550 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2551 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2554 smax = surface->lightmapinfo->extents[0] >> 4;
2555 tmax = surface->lightmapinfo->extents[1] >> 4;
2556 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2557 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2560 for (i = 0;i < MAXLIGHTMAPS;i++)
2561 surface->lightmapinfo->styles[i] = in->styles[i];
2562 surface->lightmaptexture = NULL;
2563 surface->deluxemaptexture = r_texture_blanknormalmap;
2564 i = LittleLong(in->lightofs);
2567 surface->lightmapinfo->samples = NULL;
2569 // give non-lightmapped water a 1x white lightmap
2570 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2572 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2573 surface->lightmapinfo->styles[0] = 0;
2574 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2578 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2579 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2580 else // LordHavoc: white lighting (bsp version 29)
2582 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2583 if (loadmodel->brushq1.nmaplightdata)
2584 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2587 // check if we should apply a lightmap to this
2588 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2590 if (ssize > 256 || tsize > 256)
2591 Host_Error("Bad surface extents");
2593 if (lightmapsize < ssize)
2594 lightmapsize = ssize;
2595 if (lightmapsize < tsize)
2596 lightmapsize = tsize;
2598 totallightmapsamples += ssize*tsize;
2600 // force lightmap upload on first time seeing the surface
2602 // additionally this is used by the later code to see if a
2603 // lightmap is needed on this surface (rather than duplicating the
2605 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2606 loadmodel->lit = true;
2610 // small maps (such as ammo boxes especially) don't need big lightmap
2611 // textures, so this code tries to guess a good size based on
2612 // totallightmapsamples (size of the lightmaps lump basically), as well as
2613 // trying to max out the size if there is a lot of lightmap data to store
2614 // additionally, never choose a lightmapsize that is smaller than the
2615 // largest surface encountered (as it would fail)
2617 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < bound(128, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d)) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2620 // now that we've decided the lightmap texture size, we can do the rest
2621 if (cls.state != ca_dedicated)
2623 int stainmapsize = 0;
2624 mod_alloclightmap_state_t allocState;
2626 Mod_AllocLightmap_Init(&allocState, lightmapsize, lightmapsize);
2627 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2629 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2630 float u, v, ubase, vbase, uscale, vscale;
2632 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2635 smax = surface->lightmapinfo->extents[0] >> 4;
2636 tmax = surface->lightmapinfo->extents[1] >> 4;
2637 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2638 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2639 stainmapsize += ssize * tsize * 3;
2641 if (!lightmaptexture || !Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy))
2643 // allocate a texture pool if we need it
2644 if (loadmodel->texturepool == NULL)
2645 loadmodel->texturepool = R_AllocTexturePool();
2646 // could not find room, make a new lightmap
2647 loadmodel->brushq3.num_mergedlightmaps = lightmapnumber + 1;
2648 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_lightmaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_lightmaps[0]));
2649 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_deluxemaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_deluxemaps[0]));
2650 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);
2651 if (loadmodel->brushq1.nmaplightdata)
2652 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);
2654 Mod_AllocLightmap_Reset(&allocState);
2655 Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy);
2657 surface->lightmaptexture = lightmaptexture;
2658 surface->deluxemaptexture = deluxemaptexture;
2659 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2660 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2662 uscale = 1.0f / (float)lightmapsize;
2663 vscale = 1.0f / (float)lightmapsize;
2664 ubase = lightmapx * uscale;
2665 vbase = lightmapy * vscale;
2667 for (i = 0;i < surface->num_vertices;i++)
2669 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);
2670 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);
2671 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2672 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2673 // LordHavoc: calc lightmap data offset for vertex lighting to use
2676 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2680 if (cl_stainmaps.integer)
2682 // allocate stainmaps for permanent marks on walls and clear white
2683 unsigned char *stainsamples = NULL;
2684 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2685 memset(stainsamples, 255, stainmapsize);
2687 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2689 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2691 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2692 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2693 surface->lightmapinfo->stainsamples = stainsamples;
2694 stainsamples += ssize * tsize * 3;
2699 // generate ushort elements array if possible
2700 if (loadmodel->surfmesh.data_element3s)
2701 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2702 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2705 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2708 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2709 node->parent = parent;
2712 // this is a node, recurse to children
2713 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2714 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2715 // combine supercontents of children
2716 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2721 mleaf_t *leaf = (mleaf_t *)node;
2722 // if this is a leaf, calculate supercontents mask from all collidable
2723 // primitives in the leaf (brushes and collision surfaces)
2724 // also flag if the leaf contains any collision surfaces
2725 leaf->combinedsupercontents = 0;
2726 // combine the supercontents values of all brushes in this leaf
2727 for (j = 0;j < leaf->numleafbrushes;j++)
2728 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2729 // check if this leaf contains any collision surfaces (q3 patches)
2730 for (j = 0;j < leaf->numleafsurfaces;j++)
2732 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2733 if (surface->num_collisiontriangles)
2735 leaf->containscollisionsurfaces = true;
2736 leaf->combinedsupercontents |= surface->texture->supercontents;
2742 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2748 in = (dnode_t *)(mod_base + l->fileofs);
2749 if (l->filelen % sizeof(*in))
2750 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2751 count = l->filelen / sizeof(*in);
2753 Host_Error("Mod_Q1BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
2754 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2756 loadmodel->brush.data_nodes = out;
2757 loadmodel->brush.num_nodes = count;
2759 for ( i=0 ; i<count ; i++, in++, out++)
2761 for (j=0 ; j<3 ; j++)
2763 out->mins[j] = LittleShort(in->mins[j]);
2764 out->maxs[j] = LittleShort(in->maxs[j]);
2767 p = LittleLong(in->planenum);
2768 out->plane = loadmodel->brush.data_planes + p;
2770 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2771 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2773 for (j=0 ; j<2 ; j++)
2775 // LordHavoc: this code supports broken bsp files produced by
2776 // arguire qbsp which can produce more than 32768 nodes, any value
2777 // below count is assumed to be a node number, any other value is
2778 // assumed to be a leaf number
2779 p = (unsigned short)LittleShort(in->children[j]);
2782 if (p < loadmodel->brush.num_nodes)
2783 out->children[j] = loadmodel->brush.data_nodes + p;
2786 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2787 // map it to the solid leaf
2788 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2793 // note this uses 65535 intentionally, -1 is leaf 0
2795 if (p < loadmodel->brush.num_leafs)
2796 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2799 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2800 // map it to the solid leaf
2801 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2807 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2810 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2816 in = (dleaf_t *)(mod_base + l->fileofs);
2817 if (l->filelen % sizeof(*in))
2818 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2819 count = l->filelen / sizeof(*in);
2820 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2822 loadmodel->brush.data_leafs = out;
2823 loadmodel->brush.num_leafs = count;
2824 // get visleafs from the submodel data
2825 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2826 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2827 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2828 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2830 for ( i=0 ; i<count ; i++, in++, out++)
2832 for (j=0 ; j<3 ; j++)
2834 out->mins[j] = LittleShort(in->mins[j]);
2835 out->maxs[j] = LittleShort(in->maxs[j]);
2838 // FIXME: this function could really benefit from some error checking
2840 out->contents = LittleLong(in->contents);
2842 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2843 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2844 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2846 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);
2847 out->firstleafsurface = NULL;
2848 out->numleafsurfaces = 0;
2851 out->clusterindex = i - 1;
2852 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2853 out->clusterindex = -1;
2855 p = LittleLong(in->visofs);
2856 // ignore visofs errors on leaf 0 (solid)
2857 if (p >= 0 && out->clusterindex >= 0)
2859 if (p >= loadmodel->brushq1.num_compressedpvs)
2860 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2862 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);
2865 for (j = 0;j < 4;j++)
2866 out->ambient_sound_level[j] = in->ambient_level[j];
2868 // FIXME: Insert caustics here
2872 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2876 const unsigned char *pvs;
2877 // if there's no vis data, assume supported (because everything is visible all the time)
2878 if (!loadmodel->brush.data_pvsclusters)
2880 // check all liquid leafs to see if they can see into empty leafs, if any
2881 // can we can assume this map supports r_wateralpha
2882 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2884 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2886 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2887 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2888 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2895 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2902 in = (dclipnode_t *)(mod_base + l->fileofs);
2903 if (l->filelen % sizeof(*in))
2904 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2905 count = l->filelen / sizeof(*in);
2906 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2908 loadmodel->brushq1.clipnodes = out;
2909 loadmodel->brushq1.numclipnodes = count;
2911 for (i = 1; i < MAX_MAP_HULLS; i++)
2913 hull = &loadmodel->brushq1.hulls[i];
2914 hull->clipnodes = out;
2915 hull->firstclipnode = 0;
2916 hull->lastclipnode = count-1;
2917 hull->planes = loadmodel->brush.data_planes;
2918 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2919 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2920 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2921 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2922 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2923 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2924 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2927 for (i=0 ; i<count ; i++, out++, in++)
2929 out->planenum = LittleLong(in->planenum);
2930 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2931 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2932 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2933 if (out->children[0] >= count)
2934 out->children[0] -= 65536;
2935 if (out->children[1] >= count)
2936 out->children[1] -= 65536;
2937 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2938 Host_Error("Corrupt clipping hull(out of range planenum)");
2942 //Duplicate the drawing hull structure as a clipping hull
2943 static void Mod_Q1BSP_MakeHull0(void)
2950 hull = &loadmodel->brushq1.hulls[0];
2952 in = loadmodel->brush.data_nodes;
2953 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2955 hull->clipnodes = out;
2956 hull->firstclipnode = 0;
2957 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2958 hull->planes = loadmodel->brush.data_planes;
2960 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2962 out->planenum = in->plane - loadmodel->brush.data_planes;
2963 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2964 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2968 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2973 in = (short *)(mod_base + l->fileofs);
2974 if (l->filelen % sizeof(*in))
2975 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2976 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2977 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2979 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2981 j = (unsigned short) LittleShort(in[i]);
2982 if (j >= loadmodel->num_surfaces)
2983 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2984 loadmodel->brush.data_leafsurfaces[i] = j;
2988 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2993 in = (int *)(mod_base + l->fileofs);
2994 if (l->filelen % sizeof(*in))
2995 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2996 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2997 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2999 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
3000 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
3004 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
3010 in = (dplane_t *)(mod_base + l->fileofs);
3011 if (l->filelen % sizeof(*in))
3012 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
3014 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
3015 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
3017 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
3019 out->normal[0] = LittleFloat(in->normal[0]);
3020 out->normal[1] = LittleFloat(in->normal[1]);
3021 out->normal[2] = LittleFloat(in->normal[2]);
3022 out->dist = LittleFloat(in->dist);
3028 static void Mod_Q1BSP_LoadMapBrushes(void)
3032 int submodel, numbrushes;
3033 qboolean firstbrush;
3034 char *text, *maptext;
3035 char mapfilename[MAX_QPATH];
3036 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
3037 strlcat (mapfilename, ".map", sizeof (mapfilename));
3038 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
3042 if (!COM_ParseToken_Simple(&data, false, false))
3047 if (!COM_ParseToken_Simple(&data, false, false))
3049 if (com_token[0] != '{')
3055 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
3058 if (!COM_ParseToken_Simple(&data, false, false))
3060 if (com_token[0] == '}')
3061 break; // end of entity
3062 if (com_token[0] == '{')
3069 if (submodel > loadmodel->brush.numsubmodels)
3071 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
3075 model = loadmodel->brush.submodels[submodel];
3082 if (!COM_ParseToken_Simple(&data, false, false))
3084 if (com_token[0] == '}')
3085 break; // end of brush
3086 // each brush face should be this format:
3087 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
3088 // FIXME: support hl .map format
3089 for (pointnum = 0;pointnum < 3;pointnum++)
3091 COM_ParseToken_Simple(&data, false, false);
3092 for (componentnum = 0;componentnum < 3;componentnum++)
3094 COM_ParseToken_Simple(&data, false, false);
3095 point[pointnum][componentnum] = atof(com_token);
3097 COM_ParseToken_Simple(&data, false, false);
3099 COM_ParseToken_Simple(&data, false, false);
3100 strlcpy(facetexture, com_token, sizeof(facetexture));
3101 COM_ParseToken_Simple(&data, false, false);
3102 //scroll_s = atof(com_token);
3103 COM_ParseToken_Simple(&data, false, false);
3104 //scroll_t = atof(com_token);
3105 COM_ParseToken_Simple(&data, false, false);
3106 //rotate = atof(com_token);
3107 COM_ParseToken_Simple(&data, false, false);
3108 //scale_s = atof(com_token);
3109 COM_ParseToken_Simple(&data, false, false);
3110 //scale_t = atof(com_token);
3111 TriangleNormal(point[0], point[1], point[2], planenormal);
3112 VectorNormalizeDouble(planenormal);
3113 planedist = DotProduct(point[0], planenormal);
3114 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
3124 #define MAX_PORTALPOINTS 64
3126 typedef struct portal_s
3129 mnode_t *nodes[2]; // [0] = front side of plane
3130 struct portal_s *next[2];
3132 double points[3*MAX_PORTALPOINTS];
3133 struct portal_s *chain; // all portals are linked into a list
3137 static memexpandablearray_t portalarray;
3139 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
3141 // process only nodes (leafs already had their box calculated)
3145 // calculate children first
3146 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
3147 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
3149 // make combined bounding box from children
3150 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
3151 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
3152 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
3153 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
3154 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
3155 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
3158 static void Mod_Q1BSP_FinalizePortals(void)
3160 int i, j, numportals, numpoints, portalindex, portalrange = Mem_ExpandableArray_IndexRange(&portalarray);
3164 mleaf_t *leaf, *endleaf;
3166 // tally up portal and point counts and recalculate bounding boxes for all
3167 // leafs (because qbsp is very sloppy)
3168 leaf = loadmodel->brush.data_leafs;
3169 endleaf = leaf + loadmodel->brush.num_leafs;
3170 if (mod_recalculatenodeboxes.integer)
3172 for (;leaf < endleaf;leaf++)
3174 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
3175 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3180 for (portalindex = 0;portalindex < portalrange;portalindex++)
3182 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3185 // note: this check must match the one below or it will usually corrupt memory
3186 // 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
3187 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3190 numpoints += p->numpoints * 2;
3193 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3194 loadmodel->brush.num_portals = numportals;
3195 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3196 loadmodel->brush.num_portalpoints = numpoints;
3197 // clear all leaf portal chains
3198 for (i = 0;i < loadmodel->brush.num_leafs;i++)
3199 loadmodel->brush.data_leafs[i].portals = NULL;
3200 // process all portals in the global portal chain, while freeing them
3201 portal = loadmodel->brush.data_portals;
3202 point = loadmodel->brush.data_portalpoints;
3203 for (portalindex = 0;portalindex < portalrange;portalindex++)
3205 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3208 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3210 // note: this check must match the one above or it will usually corrupt memory
3211 // 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
3212 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3214 // first make the back to front portal(forward portal)
3215 portal->points = point;
3216 portal->numpoints = p->numpoints;
3217 portal->plane.dist = p->plane.dist;
3218 VectorCopy(p->plane.normal, portal->plane.normal);
3219 portal->here = (mleaf_t *)p->nodes[1];
3220 portal->past = (mleaf_t *)p->nodes[0];
3222 for (j = 0;j < portal->numpoints;j++)
3224 VectorCopy(p->points + j*3, point->position);
3227 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3228 PlaneClassify(&portal->plane);
3230 // link into leaf's portal chain
3231 portal->next = portal->here->portals;
3232 portal->here->portals = portal;
3234 // advance to next portal
3237 // then make the front to back portal(backward portal)
3238 portal->points = point;
3239 portal->numpoints = p->numpoints;
3240 portal->plane.dist = -p->plane.dist;
3241 VectorNegate(p->plane.normal, portal->plane.normal);
3242 portal->here = (mleaf_t *)p->nodes[0];
3243 portal->past = (mleaf_t *)p->nodes[1];
3245 for (j = portal->numpoints - 1;j >= 0;j--)
3247 VectorCopy(p->points + j*3, point->position);
3250 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3251 PlaneClassify(&portal->plane);
3253 // link into leaf's portal chain
3254 portal->next = portal->here->portals;
3255 portal->here->portals = portal;
3257 // advance to next portal
3260 // add the portal's polygon points to the leaf bounding boxes
3261 if (mod_recalculatenodeboxes.integer)
3263 for (i = 0;i < 2;i++)
3265 leaf = (mleaf_t *)p->nodes[i];
3266 for (j = 0;j < p->numpoints;j++)
3268 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3269 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3270 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3271 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3272 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3273 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3279 // now recalculate the node bounding boxes from the leafs
3280 if (mod_recalculatenodeboxes.integer)
3281 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3289 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3292 Host_Error("AddPortalToNodes: NULL front node");
3294 Host_Error("AddPortalToNodes: NULL back node");
3295 if (p->nodes[0] || p->nodes[1])
3296 Host_Error("AddPortalToNodes: already included");
3297 // 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
3299 p->nodes[0] = front;
3300 p->next[0] = (portal_t *)front->portals;
3301 front->portals = (mportal_t *)p;
3304 p->next[1] = (portal_t *)back->portals;
3305 back->portals = (mportal_t *)p;
3310 RemovePortalFromNode
3313 static void RemovePortalFromNodes(portal_t *portal)
3317 void **portalpointer;
3319 for (i = 0;i < 2;i++)
3321 node = portal->nodes[i];
3323 portalpointer = (void **) &node->portals;
3326 t = (portal_t *)*portalpointer;
3328 Host_Error("RemovePortalFromNodes: portal not in leaf");
3332 if (portal->nodes[0] == node)
3334 *portalpointer = portal->next[0];
3335 portal->nodes[0] = NULL;
3337 else if (portal->nodes[1] == node)
3339 *portalpointer = portal->next[1];
3340 portal->nodes[1] = NULL;
3343 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3347 if (t->nodes[0] == node)
3348 portalpointer = (void **) &t->next[0];
3349 else if (t->nodes[1] == node)
3350 portalpointer = (void **) &t->next[1];
3352 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3357 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3358 static double *portalpointsbuffer;
3359 static int portalpointsbufferoffset;
3360 static int portalpointsbuffersize;
3361 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3364 mnode_t *front, *back, *other_node;
3365 mplane_t clipplane, *plane;
3366 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3367 int numfrontpoints, numbackpoints;
3368 double *frontpoints, *backpoints;
3370 // if a leaf, we're done
3374 // get some space for our clipping operations to use
3375 if (portalpointsbuffersize < portalpointsbufferoffset + 6*MAX_PORTALPOINTS)
3377 portalpointsbuffersize = portalpointsbufferoffset * 2;
3378 portalpointsbuffer = (double *)Mem_Realloc(loadmodel->mempool, portalpointsbuffer, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3380 frontpoints = portalpointsbuffer + portalpointsbufferoffset;
3381 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3382 backpoints = portalpointsbuffer + portalpointsbufferoffset;
3383 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3385 plane = node->plane;
3387 front = node->children[0];
3388 back = node->children[1];
3390 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3392 // create the new portal by generating a polygon for the node plane,
3393 // and clipping it by all of the other portals(which came from nodes above this one)
3394 nodeportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3395 nodeportal->plane = *plane;
3397 // 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)
3398 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);
3399 nodeportal->numpoints = 4;
3400 side = 0; // shut up compiler warning
3401 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3403 clipplane = portal->plane;
3404 if (portal->nodes[0] == portal->nodes[1])
3405 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3406 if (portal->nodes[0] == node)
3408 else if (portal->nodes[1] == node)
3410 clipplane.dist = -clipplane.dist;
3411 VectorNegate(clipplane.normal, clipplane.normal);
3415 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3417 for (i = 0;i < nodeportal->numpoints*3;i++)
3418 frontpoints[i] = nodeportal->points[i];
3419 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);
3420 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3424 if (nodeportal->numpoints < 3)
3426 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3427 nodeportal->numpoints = 0;
3429 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3431 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3432 nodeportal->numpoints = 0;
3435 AddPortalToNodes(nodeportal, front, back);
3437 // split the portals of this node along this node's plane and assign them to the children of this node
3438 // (migrating the portals downward through the tree)
3439 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3441 if (portal->nodes[0] == portal->nodes[1])
3442 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3443 if (portal->nodes[0] == node)
3445 else if (portal->nodes[1] == node)
3448 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3449 nextportal = portal->next[side];
3450 if (!portal->numpoints)
3453 other_node = portal->nodes[!side];
3454 RemovePortalFromNodes(portal);
3456 // cut the portal into two portals, one on each side of the node plane
3457 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);
3459 if (!numfrontpoints)
3462 AddPortalToNodes(portal, back, other_node);
3464 AddPortalToNodes(portal, other_node, back);
3470 AddPortalToNodes(portal, front, other_node);
3472 AddPortalToNodes(portal, other_node, front);
3476 // the portal is split
3477 splitportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3478 temp = splitportal->chain;
3479 *splitportal = *portal;
3480 splitportal->chain = temp;
3481 for (i = 0;i < numbackpoints*3;i++)
3482 splitportal->points[i] = backpoints[i];
3483 splitportal->numpoints = numbackpoints;
3484 for (i = 0;i < numfrontpoints*3;i++)
3485 portal->points[i] = frontpoints[i];
3486 portal->numpoints = numfrontpoints;
3490 AddPortalToNodes(portal, front, other_node);
3491 AddPortalToNodes(splitportal, back, other_node);
3495 AddPortalToNodes(portal, other_node, front);
3496 AddPortalToNodes(splitportal, other_node, back);
3500 Mod_Q1BSP_RecursiveNodePortals(front);
3501 Mod_Q1BSP_RecursiveNodePortals(back);
3503 portalpointsbufferoffset -= 6*MAX_PORTALPOINTS;
3506 static void Mod_Q1BSP_MakePortals(void)
3508 Mem_ExpandableArray_NewArray(&portalarray, loadmodel->mempool, sizeof(portal_t), 1020*1024/sizeof(portal_t));
3509 portalpointsbufferoffset = 0;
3510 portalpointsbuffersize = 6*MAX_PORTALPOINTS*128;
3511 portalpointsbuffer = (double *)Mem_Alloc(loadmodel->mempool, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3512 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3513 Mem_Free(portalpointsbuffer);
3514 portalpointsbuffer = NULL;
3515 portalpointsbufferoffset = 0;
3516 portalpointsbuffersize = 0;
3517 Mod_Q1BSP_FinalizePortals();
3518 Mem_ExpandableArray_FreeArray(&portalarray);
3521 //Returns PVS data for a given point
3522 //(note: can return NULL)
3523 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3526 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3528 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3529 if (((mleaf_t *)node)->clusterindex >= 0)
3530 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3535 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)
3539 float d = PlaneDiff(org, node->plane);
3541 node = node->children[0];
3542 else if (d < -radius)
3543 node = node->children[1];
3546 // go down both sides
3547 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3548 node = node->children[1];
3551 // if this leaf is in a cluster, accumulate the pvs bits
3552 if (((mleaf_t *)node)->clusterindex >= 0)
3555 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3556 for (i = 0;i < pvsbytes;i++)
3557 pvsbuffer[i] |= pvs[i];
3561 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3562 //of the given point.
3563 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3565 int bytes = model->brush.num_pvsclusterbytes;
3566 bytes = min(bytes, pvsbufferlength);
3567 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3569 memset(pvsbuffer, 0xFF, bytes);
3573 memset(pvsbuffer, 0, bytes);
3574 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3578 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3583 VectorSubtract(inmaxs, inmins, size);
3584 if (cmodel->brush.ishlbsp)
3587 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3588 else if (size[0] <= 32)
3590 if (size[2] < 54) // pick the nearest of 36 or 72
3591 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3593 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3596 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3601 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3602 else if (size[0] <= 32)
3603 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3605 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3607 VectorCopy(inmins, outmins);
3608 VectorAdd(inmins, hull->clip_size, outmaxs);
3611 static int Mod_Q1BSP_CreateShadowMesh(dp_model_t *mod)
3614 int numshadowmeshtriangles = 0;
3615 msurface_t *surface;
3616 if (cls.state == ca_dedicated)
3618 // make a single combined shadow mesh to allow optimized shadow volume creation
3620 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3622 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3623 numshadowmeshtriangles += surface->num_triangles;
3625 mod->brush.shadowmesh = Mod_ShadowMesh_Begin(mod->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3626 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3627 if (surface->num_triangles > 0)
3628 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));
3629 mod->brush.shadowmesh = Mod_ShadowMesh_Finish(mod->mempool, mod->brush.shadowmesh, false, r_enableshadowvolumes.integer != 0, false);
3630 if (mod->brush.shadowmesh && mod->brush.shadowmesh->neighbor3i)
3631 Mod_BuildTriangleNeighbors(mod->brush.shadowmesh->neighbor3i, mod->brush.shadowmesh->element3i, mod->brush.shadowmesh->numtriangles);
3633 return numshadowmeshtriangles;
3636 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);
3638 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3643 float dist, modelyawradius, modelradius;
3644 msurface_t *surface;
3645 hullinfo_t hullinfo;
3646 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3647 model_brush_lightstyleinfo_t styleinfo[256];
3648 unsigned char *datapointer;
3650 mod->modeldatatypestring = "Q1BSP";
3652 mod->type = mod_brushq1;
3654 header = (dheader_t *)buffer;
3656 i = LittleLong(header->version);
3657 if (i != BSPVERSION && i != 30)
3658 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3659 mod->brush.ishlbsp = i == 30;
3661 // fill in hull info
3662 VectorClear (hullinfo.hullsizes[0][0]);
3663 VectorClear (hullinfo.hullsizes[0][1]);
3664 if (mod->brush.ishlbsp)
3666 mod->modeldatatypestring = "HLBSP";
3668 hullinfo.filehulls = 4;
3669 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3670 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3671 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3672 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3673 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3674 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3678 hullinfo.filehulls = 4;
3679 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3680 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3681 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3682 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3686 mod_base = (unsigned char*)buffer;
3687 for (i = 0; i < HEADER_LUMPS; i++)
3689 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3690 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3693 mod->soundfromcenter = true;
3694 mod->TraceBox = Mod_Q1BSP_TraceBox;
3695 mod->TraceLine = Mod_Q1BSP_TraceLineAgainstSurfaces; // LordHavoc: use the surface-hitting version of TraceLine in all cases
3696 mod->TracePoint = Mod_Q1BSP_TracePoint;
3697 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3698 mod->TraceLineAgainstSurfaces = Mod_Q1BSP_TraceLineAgainstSurfaces;
3699 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3700 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3701 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3702 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3703 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3704 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3705 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3706 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3707 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3708 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3709 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3710 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3711 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3712 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3713 mod->Draw = R_Q1BSP_Draw;
3714 mod->DrawDepth = R_Q1BSP_DrawDepth;
3715 mod->DrawDebug = R_Q1BSP_DrawDebug;
3716 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
3717 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3718 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3719 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3720 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3721 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3722 mod->DrawLight = R_Q1BSP_DrawLight;
3726 mod->brush.qw_md4sum = 0;
3727 mod->brush.qw_md4sum2 = 0;
3728 for (i = 0;i < HEADER_LUMPS;i++)
3731 if (i == LUMP_ENTITIES)
3733 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3734 mod->brush.qw_md4sum ^= LittleLong(temp);
3735 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3737 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3738 mod->brush.qw_md4sum2 ^= LittleLong(temp);
3741 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3742 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3743 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3744 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3745 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3746 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3747 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3748 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3749 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3750 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3751 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3752 // load submodels before leafs because they contain the number of vis leafs
3753 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3754 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3755 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3756 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3758 // check if the map supports transparent water rendering
3759 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3761 if (mod->brushq1.data_compressedpvs)
3762 Mem_Free(mod->brushq1.data_compressedpvs);
3763 mod->brushq1.data_compressedpvs = NULL;
3764 mod->brushq1.num_compressedpvs = 0;
3766 Mod_Q1BSP_MakeHull0();
3767 if (mod_bsp_portalize.integer)
3768 Mod_Q1BSP_MakePortals();
3770 mod->numframes = 2; // regular and alternate animation
3773 // make a single combined shadow mesh to allow optimized shadow volume creation
3774 Mod_Q1BSP_CreateShadowMesh(loadmodel);
3776 if (loadmodel->brush.numsubmodels)
3777 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3779 // LordHavoc: to clear the fog around the original quake submodel code, I
3781 // first of all, some background info on the submodels:
3782 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3783 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3784 // now the weird for loop itself:
3785 // the loop functions in an odd way, on each iteration it sets up the
3786 // current 'mod' model (which despite the confusing code IS the model of
3787 // the number i), at the end of the loop it duplicates the model to become
3788 // the next submodel, and loops back to set up the new submodel.
3790 // LordHavoc: now the explanation of my sane way (which works identically):
3791 // set up the world model, then on each submodel copy from the world model
3792 // and set up the submodel with the respective model info.
3793 totalstylesurfaces = 0;
3795 for (i = 0;i < mod->brush.numsubmodels;i++)
3797 memset(stylecounts, 0, sizeof(stylecounts));
3798 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3800 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3801 for (j = 0;j < MAXLIGHTMAPS;j++)
3802 stylecounts[surface->lightmapinfo->styles[j]]++;
3804 for (k = 0;k < 255;k++)
3808 totalstylesurfaces += stylecounts[k];
3811 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3812 for (i = 0;i < mod->brush.numsubmodels;i++)
3814 // LordHavoc: this code was originally at the end of this loop, but
3815 // has been transformed to something more readable at the start here.
3820 // duplicate the basic information
3821 dpsnprintf(name, sizeof(name), "*%i", i);
3822 mod = Mod_FindName(name, loadmodel->name);
3823 // copy the base model to this one
3825 // rename the clone back to its proper name
3826 strlcpy(mod->name, name, sizeof(mod->name));
3827 mod->brush.parentmodel = loadmodel;
3828 // textures and memory belong to the main model
3829 mod->texturepool = NULL;
3830 mod->mempool = NULL;
3831 mod->brush.GetPVS = NULL;
3832 mod->brush.FatPVS = NULL;
3833 mod->brush.BoxTouchingPVS = NULL;
3834 mod->brush.BoxTouchingLeafPVS = NULL;
3835 mod->brush.BoxTouchingVisibleLeafs = NULL;
3836 mod->brush.FindBoxClusters = NULL;
3837 mod->brush.LightPoint = NULL;
3838 mod->brush.AmbientSoundLevelsForPoint = NULL;
3841 mod->brush.submodel = i;
3843 if (loadmodel->brush.submodels)
3844 loadmodel->brush.submodels[i] = mod;
3846 bm = &mod->brushq1.submodels[i];
3848 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3849 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3851 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3852 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3855 mod->firstmodelsurface = bm->firstface;
3856 mod->nummodelsurfaces = bm->numfaces;
3858 // set node/leaf parents for this submodel
3859 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
3861 // make the model surface list (used by shadowing/lighting)
3862 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3863 Mod_MakeSortedSurfaces(mod);
3865 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3866 // (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)
3867 VectorCopy(bm->mins, mod->normalmins);
3868 VectorCopy(bm->maxs, mod->normalmaxs);
3869 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3870 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3871 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3872 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3873 modelradius = modelyawradius + modelradius * modelradius;
3874 modelyawradius = sqrt(modelyawradius);
3875 modelradius = sqrt(modelradius);
3876 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3877 mod->yawmins[2] = mod->normalmins[2];
3878 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
3879 mod->yawmaxs[2] = mod->normalmaxs[2];
3880 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3881 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3882 mod->radius = modelradius;
3883 mod->radius2 = modelradius * modelradius;
3885 // this gets altered below if sky or water is used
3886 mod->DrawSky = NULL;
3887 mod->DrawAddWaterPlanes = NULL;
3889 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3890 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3891 if (mod->nummodelsurfaces)
3893 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3894 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3896 if (j < mod->nummodelsurfaces)
3897 mod->DrawSky = R_Q1BSP_DrawSky;
3899 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3900 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
3902 if (j < mod->nummodelsurfaces)
3903 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3905 // build lightstyle update chains
3906 // (used to rapidly mark lightmapupdateflags on many surfaces
3907 // when d_lightstylevalue changes)
3908 memset(stylecounts, 0, sizeof(stylecounts));
3909 for (k = 0;k < mod->nummodelsurfaces;k++)
3911 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3912 for (j = 0;j < MAXLIGHTMAPS;j++)
3913 stylecounts[surface->lightmapinfo->styles[j]]++;
3915 mod->brushq1.num_lightstyles = 0;
3916 for (k = 0;k < 255;k++)
3920 styleinfo[mod->brushq1.num_lightstyles].style = k;
3921 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3922 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3923 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3924 remapstyles[k] = mod->brushq1.num_lightstyles;
3925 mod->brushq1.num_lightstyles++;
3928 for (k = 0;k < mod->nummodelsurfaces;k++)
3930 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3931 for (j = 0;j < MAXLIGHTMAPS;j++)
3933 if (surface->lightmapinfo->styles[j] != 255)
3935 int r = remapstyles[surface->lightmapinfo->styles[j]];
3936 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3940 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3941 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3945 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3946 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3948 //mod->brushq1.num_visleafs = bm->visleafs;
3950 // build a Bounding Interval Hierarchy for culling triangles in light rendering
3951 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
3953 if (mod_q1bsp_polygoncollisions.integer)
3955 mod->collision_bih = mod->render_bih;
3956 // point traces and contents checks still use the bsp tree
3957 mod->TraceLine = Mod_CollisionBIH_TraceLine;
3958 mod->TraceBox = Mod_CollisionBIH_TraceBox;
3959 mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
3960 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLineAgainstSurfaces;
3963 // generate VBOs and other shared data before cloning submodels
3967 Mod_Q1BSP_LoadMapBrushes();
3968 //Mod_Q1BSP_ProcessLightList();
3972 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);
3975 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3979 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3986 in = (void *)(mod_base + l->fileofs);
3987 if (l->filelen % sizeof(*in))
3988 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3989 count = l->filelen / sizeof(*in);
3990 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3993 loadmodel->num = count;
3995 for (i = 0;i < count;i++, in++, out++)
4001 static void Mod_Q2BSP_LoadVertices(lump_t *l)
4008 in = (void *)(mod_base + l->fileofs);
4009 if (l->filelen % sizeof(*in))
4010 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4011 count = l->filelen / sizeof(*in);
4012 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4015 loadmodel->num = count;
4017 for (i = 0;i < count;i++, in++, out++)
4023 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
4030 in = (void *)(mod_base + l->fileofs);
4031 if (l->filelen % sizeof(*in))
4032 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
4033 count = l->filelen / sizeof(*in);
4034 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4037 loadmodel->num = count;
4039 for (i = 0;i < count;i++, in++, out++)
4045 static void Mod_Q2BSP_LoadNodes(lump_t *l)
4052 in = (void *)(mod_base + l->fileofs);
4053 if (l->filelen % sizeof(*in))
4054 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4055 count = l->filelen / sizeof(*in);
4056 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4059 loadmodel->num = count;
4061 for (i = 0;i < count;i++, in++, out++)
4067 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
4074 in = (void *)(mod_base + l->fileofs);
4075 if (l->filelen % sizeof(*in))
4076 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
4077 count = l->filelen / sizeof(*in);
4078 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4081 loadmodel->num = count;
4083 for (i = 0;i < count;i++, in++, out++)
4089 static void Mod_Q2BSP_LoadFaces(lump_t *l)
4096 in = (void *)(mod_base + l->fileofs);
4097 if (l->filelen % sizeof(*in))
4098 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4099 count = l->filelen / sizeof(*in);
4100 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4103 loadmodel->num = count;
4105 for (i = 0;i < count;i++, in++, out++)
4111 static void Mod_Q2BSP_LoadLighting(lump_t *l)
4118 in = (void *)(mod_base + l->fileofs);
4119 if (l->filelen % sizeof(*in))
4120 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
4121 count = l->filelen / sizeof(*in);
4122 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4125 loadmodel->num = count;
4127 for (i = 0;i < count;i++, in++, out++)
4133 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
4140 in = (void *)(mod_base + l->fileofs);
4141 if (l->filelen % sizeof(*in))
4142 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4143 count = l->filelen / sizeof(*in);
4144 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4147 loadmodel->num = count;
4149 for (i = 0;i < count;i++, in++, out++)
4155 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
4162 in = (void *)(mod_base + l->fileofs);
4163 if (l->filelen % sizeof(*in))
4164 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4165 count = l->filelen / sizeof(*in);
4166 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4169 loadmodel->num = count;
4171 for (i = 0;i < count;i++, in++, out++)
4177 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
4184 in = (void *)(mod_base + l->fileofs);
4185 if (l->filelen % sizeof(*in))
4186 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4187 count = l->filelen / sizeof(*in);
4188 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4191 loadmodel->num = count;
4193 for (i = 0;i < count;i++, in++, out++)
4199 static void Mod_Q2BSP_LoadEdges(lump_t *l)
4206 in = (void *)(mod_base + l->fileofs);
4207 if (l->filelen % sizeof(*in))
4208 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
4209 count = l->filelen / sizeof(*in);
4210 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4213 loadmodel->num = count;
4215 for (i = 0;i < count;i++, in++, out++)
4221 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
4228 in = (void *)(mod_base + l->fileofs);
4229 if (l->filelen % sizeof(*in))
4230 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
4231 count = l->filelen / sizeof(*in);
4232 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4235 loadmodel->num = count;
4237 for (i = 0;i < count;i++, in++, out++)
4243 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4250 in = (void *)(mod_base + l->fileofs);
4251 if (l->filelen % sizeof(*in))
4252 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4253 count = l->filelen / sizeof(*in);
4254 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4257 loadmodel->num = count;
4259 for (i = 0;i < count;i++, in++, out++)
4265 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4272 in = (void *)(mod_base + l->fileofs);
4273 if (l->filelen % sizeof(*in))
4274 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4275 count = l->filelen / sizeof(*in);
4276 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4279 loadmodel->num = count;
4281 for (i = 0;i < count;i++, in++, out++)
4287 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4294 in = (void *)(mod_base + l->fileofs);
4295 if (l->filelen % sizeof(*in))
4296 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4297 count = l->filelen / sizeof(*in);
4298 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4301 loadmodel->num = count;
4303 for (i = 0;i < count;i++, in++, out++)
4309 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4316 in = (void *)(mod_base + l->fileofs);
4317 if (l->filelen % sizeof(*in))
4318 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4319 count = l->filelen / sizeof(*in);
4320 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4323 loadmodel->num = count;
4325 for (i = 0;i < count;i++, in++, out++)
4331 static void Mod_Q2BSP_LoadModels(lump_t *l)
4338 in = (void *)(mod_base + l->fileofs);
4339 if (l->filelen % sizeof(*in))
4340 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4341 count = l->filelen / sizeof(*in);
4342 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4345 loadmodel->num = count;
4347 for (i = 0;i < count;i++, in++, out++)
4353 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4356 q2dheader_t *header;
4358 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4360 mod->modeldatatypestring = "Q2BSP";
4362 mod->type = mod_brushq2;
4364 header = (q2dheader_t *)buffer;
4366 i = LittleLong(header->version);
4367 if (i != Q2BSPVERSION)
4368 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4370 mod_base = (unsigned char *)header;
4372 // swap all the lumps
4373 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4374 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4376 mod->brush.qw_md4sum = 0;
4377 mod->brush.qw_md4sum2 = 0;
4378 for (i = 0;i < Q2HEADER_LUMPS;i++)
4380 if (i == Q2LUMP_ENTITIES)
4382 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4383 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4385 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4388 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4389 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4390 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4391 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4392 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4393 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4394 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4395 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4396 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4397 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4398 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4399 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4400 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4401 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4402 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4403 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4404 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4405 // LordHavoc: must go last because this makes the submodels
4406 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4409 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4410 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4412 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4415 char key[128], value[MAX_INPUTLINE];
4417 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4418 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4419 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4422 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4423 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4424 loadmodel->brush.entities[l->filelen] = 0;
4425 data = loadmodel->brush.entities;
4426 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4427 // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
4428 loadmodel->brushq3.deluxemapping = false;
4429 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4433 if (!COM_ParseToken_Simple(&data, false, false))
4435 if (com_token[0] == '}')
4436 break; // end of worldspawn
4437 if (com_token[0] == '_')
4438 strlcpy(key, com_token + 1, sizeof(key));
4440 strlcpy(key, com_token, sizeof(key));
4441 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4442 key[strlen(key)-1] = 0;
4443 if (!COM_ParseToken_Simple(&data, false, false))
4445 strlcpy(value, com_token, sizeof(value));
4446 if (!strcasecmp("gridsize", key)) // this one is case insensitive to 100% match q3map2
4448 #if _MSC_VER >= 1400
4449 #define sscanf sscanf_s
4452 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4453 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4455 VectorSet(v, 64, 64, 128);
4456 if(sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) != 3)
4457 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]);
4458 if (v[0] != 0 && v[1] != 0 && v[2] != 0)
4459 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4462 else if (!strcmp("deluxeMaps", key))
4464 if (!strcmp(com_token, "1"))
4466 loadmodel->brushq3.deluxemapping = true;
4467 loadmodel->brushq3.deluxemapping_modelspace = true;
4469 else if (!strcmp(com_token, "2"))
4471 loadmodel->brushq3.deluxemapping = true;
4472 loadmodel->brushq3.deluxemapping_modelspace = false;
4479 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4485 in = (q3dtexture_t *)(mod_base + l->fileofs);
4486 if (l->filelen % sizeof(*in))
4487 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4488 count = l->filelen / sizeof(*in);
4489 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4491 loadmodel->data_textures = out;
4492 loadmodel->num_textures = count;
4493 loadmodel->num_texturesperskin = loadmodel->num_textures;
4495 for (i = 0;i < count;i++)
4497 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4498 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4499 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4500 Mod_LoadTextureFromQ3Shader(out + i, out[i].name, true, true, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS);
4501 // restore the surfaceflags and supercontents
4502 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4503 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4507 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4513 in = (q3dplane_t *)(mod_base + l->fileofs);
4514 if (l->filelen % sizeof(*in))
4515 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4516 count = l->filelen / sizeof(*in);
4517 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4519 loadmodel->brush.data_planes = out;
4520 loadmodel->brush.num_planes = count;
4522 for (i = 0;i < count;i++, in++, out++)
4524 out->normal[0] = LittleFloat(in->normal[0]);
4525 out->normal[1] = LittleFloat(in->normal[1]);
4526 out->normal[2] = LittleFloat(in->normal[2]);
4527 out->dist = LittleFloat(in->dist);
4532 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4535 q3mbrushside_t *out;
4538 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4539 if (l->filelen % sizeof(*in))
4540 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4541 count = l->filelen / sizeof(*in);
4542 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4544 loadmodel->brush.data_brushsides = out;
4545 loadmodel->brush.num_brushsides = count;
4547 for (i = 0;i < count;i++, in++, out++)
4549 n = LittleLong(in->planeindex);
4550 if (n < 0 || n >= loadmodel->brush.num_planes)
4551 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4552 out->plane = loadmodel->brush.data_planes + n;
4553 n = LittleLong(in->textureindex);
4554 if (n < 0 || n >= loadmodel->num_textures)
4555 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4556 out->texture = loadmodel->data_textures + n;
4560 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4562 q3dbrushside_ig_t *in;
4563 q3mbrushside_t *out;
4566 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4567 if (l->filelen % sizeof(*in))
4568 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4569 count = l->filelen / sizeof(*in);
4570 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4572 loadmodel->brush.data_brushsides = out;
4573 loadmodel->brush.num_brushsides = count;
4575 for (i = 0;i < count;i++, in++, out++)
4577 n = LittleLong(in->planeindex);
4578 if (n < 0 || n >= loadmodel->brush.num_planes)
4579 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4580 out->plane = loadmodel->brush.data_planes + n;
4581 n = LittleLong(in->textureindex);
4582 if (n < 0 || n >= loadmodel->num_textures)
4583 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4584 out->texture = loadmodel->data_textures + n;
4588 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4592 int i, j, n, c, count, maxplanes, q3surfaceflags;
4593 colplanef_t *planes;
4595 in = (q3dbrush_t *)(mod_base + l->fileofs);
4596 if (l->filelen % sizeof(*in))
4597 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4598 count = l->filelen / sizeof(*in);
4599 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4601 loadmodel->brush.data_brushes = out;
4602 loadmodel->brush.num_brushes = count;
4607 for (i = 0;i < count;i++, in++, out++)
4609 n = LittleLong(in->firstbrushside);
4610 c = LittleLong(in->numbrushsides);
4611 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4612 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4613 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4614 out->numbrushsides = c;
4615 n = LittleLong(in->textureindex);
4616 if (n < 0 || n >= loadmodel->num_textures)
4617 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4618 out->texture = loadmodel->data_textures + n;
4620 // make a list of mplane_t structs to construct a colbrush from
4621 if (maxplanes < out->numbrushsides)
4623 maxplanes = out->numbrushsides;
4626 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4629 for (j = 0;j < out->numbrushsides;j++)
4631 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4632 planes[j].dist = out->firstbrushside[j].plane->dist;
4633 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4634 planes[j].texture = out->firstbrushside[j].texture;
4635 q3surfaceflags |= planes[j].q3surfaceflags;
4637 // make the colbrush from the planes
4638 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4640 // this whole loop can take a while (e.g. on redstarrepublic4)
4641 CL_KeepaliveMessage(false);
4647 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4653 in = (q3deffect_t *)(mod_base + l->fileofs);
4654 if (l->filelen % sizeof(*in))
4655 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4656 count = l->filelen / sizeof(*in);
4657 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4659 loadmodel->brushq3.data_effects = out;
4660 loadmodel->brushq3.num_effects = count;
4662 for (i = 0;i < count;i++, in++, out++)
4664 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4665 n = LittleLong(in->brushindex);
4666 if (n >= loadmodel->brush.num_brushes)
4668 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4671 out->brushindex = n;
4672 out->unknown = LittleLong(in->unknown);
4676 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4681 in = (q3dvertex_t *)(mod_base + l->fileofs);
4682 if (l->filelen % sizeof(*in))
4683 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4684 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4685 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4686 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4687 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4688 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4689 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4691 for (i = 0;i < count;i++, in++)
4693 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4694 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4695 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4696 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4697 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4698 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4699 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4700 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4701 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4702 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4703 // svector/tvector are calculated later in face loading
4704 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4705 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4706 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4707 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4708 if(in->color4ub[0] != 255 || in->color4ub[1] != 255 || in->color4ub[2] != 255)
4709 loadmodel->lit = true;
4713 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4719 in = (int *)(mod_base + l->fileofs);
4720 if (l->filelen % sizeof(int[3]))
4721 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4722 count = l->filelen / sizeof(*in);
4724 if(!loadmodel->brushq3.num_vertices)
4727 Con_Printf("Mod_Q3BSP_LoadTriangles: %s has triangles but no vertexes, broken compiler, ignoring problem\n", loadmodel->name);
4728 loadmodel->brushq3.num_triangles = 0;
4732 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4733 loadmodel->brushq3.num_triangles = count / 3;
4734 loadmodel->brushq3.data_element3i = out;
4736 for (i = 0;i < count;i++, in++, out++)
4738 *out = LittleLong(*in);
4739 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4741 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4747 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4749 q3dlightmap_t *input_pointer;
4767 int mergedrowsxcolumns;
4772 unsigned char *mergedpixels;
4773 unsigned char *mergeddeluxepixels;
4774 unsigned char *mergebuf;
4775 char mapname[MAX_QPATH];
4777 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4779 // defaults for q3bsp
4786 loadmodel->brushq3.lightmapsize = 128;
4788 if (cls.state == ca_dedicated)
4791 if(mod_q3bsp_nolightmaps.integer)
4797 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4798 if (developer_loading.integer)
4799 Con_Printf("Using internal lightmaps\n");
4800 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4801 if (l->filelen % sizeof(*input_pointer))
4802 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4803 count = l->filelen / sizeof(*input_pointer);
4804 for(i = 0; i < count; ++i)
4805 inpixels[i] = input_pointer[i].rgb;
4809 // no internal lightmaps
4810 // try external lightmaps
4811 if (developer_loading.integer)
4812 Con_Printf("Using external lightmaps\n");
4813 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4814 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false, false, NULL);
4818 // using EXTERNAL lightmaps instead
4819 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4821 Mem_Free(inpixels[0]);
4822 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4832 for(count = 1; ; ++count)
4834 inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false, false, NULL);
4835 if(!inpixels[count])
4836 break; // we got all of them
4837 if(image_width != size || image_height != size)
4839 Mem_Free(inpixels[count]);
4840 inpixels[count] = NULL;
4841 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);
4847 loadmodel->brushq3.lightmapsize = size;
4848 loadmodel->brushq3.num_originallightmaps = count;
4850 // now check the surfaces to see if any of them index an odd numbered
4851 // lightmap, if so this is not a deluxemapped bsp file
4853 // also check what lightmaps are actually used, because q3map2 sometimes
4854 // (always?) makes an unused one at the end, which
4855 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4856 // reason when only one lightmap is used, which can throw off the
4857 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4858 // to see if the second lightmap is blank, if so it is not deluxemapped.
4859 // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
4860 // in Mod_Q3BSP_LoadEntities was failed
4861 if (!loadmodel->brushq3.deluxemapping)
4863 loadmodel->brushq3.deluxemapping = !(count & 1);
4864 loadmodel->brushq3.deluxemapping_modelspace = true;
4866 if (loadmodel->brushq3.deluxemapping)
4868 int facecount = faceslump->filelen / sizeof(q3dface_t);
4869 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4870 for (i = 0;i < facecount;i++)
4872 j = LittleLong(faces[i].lightmapindex);
4875 endlightmap = max(endlightmap, j + 1);
4876 if ((j & 1) || j + 1 >= count)
4878 loadmodel->brushq3.deluxemapping = false;
4885 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4886 // reason when only one lightmap is used, which can throw off the
4887 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4888 // to see if the second lightmap is blank, if so it is not deluxemapped.
4890 // further research has shown q3map2 sometimes creates a deluxemap and two
4891 // blank lightmaps, which must be handled properly as well
4892 if (endlightmap == 1 && count > 1)
4895 for (i = 0;i < size*size;i++)
4897 if (c[bytesperpixel*i + rgbmap[0]])
4899 if (c[bytesperpixel*i + rgbmap[1]])
4901 if (c[bytesperpixel*i + rgbmap[2]])
4906 // all pixels in the unused lightmap were black...
4907 loadmodel->brushq3.deluxemapping = false;
4912 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4914 // figure out what the most reasonable merge power is within limits
4916 // find the appropriate NxN dimensions to merge to, to avoid wasted space
4917 realcount = count >> (int)loadmodel->brushq3.deluxemapping;
4919 // figure out how big the merged texture has to be
4920 mergegoal = 128<<bound(0, mod_q3bsp_lightmapmergepower.integer, 6);
4921 mergegoal = bound(size, mergegoal, (int)vid.maxtexturesize_2d);
4922 while (mergegoal > size && mergegoal * mergegoal / 4 >= size * size * realcount)
4924 mergedwidth = mergegoal;
4925 mergedheight = mergegoal;
4926 // choose non-square size (2x1 aspect) if only half the space is used;
4927 // this really only happens when the entire set fits in one texture, if
4928 // there are multiple textures, we don't worry about shrinking the last
4929 // one to fit, because the driver prefers the same texture size on
4930 // consecutive draw calls...
4931 if (mergedwidth * mergedheight / 2 >= size*size*realcount)
4934 loadmodel->brushq3.num_lightmapmergedwidthpower = 0;
4935 loadmodel->brushq3.num_lightmapmergedheightpower = 0;
4936 while (mergedwidth > size<<loadmodel->brushq3.num_lightmapmergedwidthpower)
4937 loadmodel->brushq3.num_lightmapmergedwidthpower++;
4938 while (mergedheight > size<<loadmodel->brushq3.num_lightmapmergedheightpower)
4939 loadmodel->brushq3.num_lightmapmergedheightpower++;
4940 loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower = loadmodel->brushq3.num_lightmapmergedwidthpower + loadmodel->brushq3.num_lightmapmergedheightpower + (loadmodel->brushq3.deluxemapping ? 1 : 0);
4942 powerx = loadmodel->brushq3.num_lightmapmergedwidthpower;
4943 powery = loadmodel->brushq3.num_lightmapmergedheightpower;
4944 powerxy = powerx+powery;
4945 powerdxy = loadmodel->brushq3.deluxemapping + powerxy;
4947 mergedcolumns = 1 << powerx;
4948 mergedrows = 1 << powery;
4949 mergedrowsxcolumns = 1 << powerxy;
4951 loadmodel->brushq3.num_mergedlightmaps = (realcount + (1 << powerxy) - 1) >> powerxy;
4952 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4953 if (loadmodel->brushq3.deluxemapping)
4954 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4956 // allocate a texture pool if we need it
4957 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4958 loadmodel->texturepool = R_AllocTexturePool();
4960 mergedpixels = (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4);
4961 mergeddeluxepixels = loadmodel->brushq3.deluxemapping ? (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4) : NULL;
4962 for (i = 0;i < count;i++)
4964 // figure out which merged lightmap texture this fits into
4965 realindex = i >> (int)loadmodel->brushq3.deluxemapping;
4966 lightmapindex = i >> powerdxy;
4968 // choose the destination address
4969 mergebuf = (loadmodel->brushq3.deluxemapping && (i & 1)) ? mergeddeluxepixels : mergedpixels;
4970 mergebuf += 4 * (realindex & (mergedcolumns-1))*size + 4 * ((realindex >> powerx) & (mergedrows-1))*mergedwidth*size;
4971 if ((i & 1) == 0 || !loadmodel->brushq3.deluxemapping)
4972 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);
4974 // convert pixels from RGB or BGRA while copying them into the destination rectangle
4975 for (j = 0;j < size;j++)
4976 for (k = 0;k < size;k++)
4978 mergebuf[(j*mergedwidth+k)*4+0] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[0]];
4979 mergebuf[(j*mergedwidth+k)*4+1] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[1]];
4980 mergebuf[(j*mergedwidth+k)*4+2] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[2]];
4981 mergebuf[(j*mergedwidth+k)*4+3] = 255;
4984 // upload texture if this was the last tile being written to the texture
4985 if (((realindex + 1) & (mergedrowsxcolumns - 1)) == 0 || (realindex + 1) == realcount)
4987 if (loadmodel->brushq3.deluxemapping && (i & 1))
4988 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);
4990 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);
4994 if (mergeddeluxepixels)
4995 Mem_Free(mergeddeluxepixels);
4996 Mem_Free(mergedpixels);
4999 for(i = 0; i < count; ++i)
5000 Mem_Free(inpixels[i]);
5004 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
5009 *collisionstride = stride;
5012 cnt = (num_triangles + stride - 1) / stride;
5013 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
5014 for(j = 0; j < cnt; ++j)
5016 mins = &((*collisionbbox6f)[6 * j + 0]);
5017 maxs = &((*collisionbbox6f)[6 * j + 3]);
5018 for(k = 0; k < stride; ++k)
5020 tri = j * stride + k;
5021 if(tri >= num_triangles)
5023 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
5024 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
5025 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
5026 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
5027 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
5028 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
5029 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
5030 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
5031 if(vert[0] < mins[0]) mins[0] = vert[0];
5032 if(vert[1] < mins[1]) mins[1] = vert[1];
5033 if(vert[2] < mins[2]) mins[2] = vert[2];
5034 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5035 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5036 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5037 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
5038 if(vert[0] < mins[0]) mins[0] = vert[0];
5039 if(vert[1] < mins[1]) mins[1] = vert[1];
5040 if(vert[2] < mins[2]) mins[2] = vert[2];
5041 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5042 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5043 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5048 *collisionbbox6f = NULL;
5051 typedef struct patchtess_s
5055 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
5058 float *originalvertex3f;
5061 #define PATCHTESS_SAME_LODGROUP(a,b) \
5063 (a).lodgroup[0] == (b).lodgroup[0] && \
5064 (a).lodgroup[1] == (b).lodgroup[1] && \
5065 (a).lodgroup[2] == (b).lodgroup[2] && \
5066 (a).lodgroup[3] == (b).lodgroup[3] && \
5067 (a).lodgroup[4] == (b).lodgroup[4] && \
5068 (a).lodgroup[5] == (b).lodgroup[5] \
5071 static void Mod_Q3BSP_LoadFaces(lump_t *l)
5073 q3dface_t *in, *oldin;
5074 msurface_t *out, *oldout;
5075 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;
5076 float lightmaptcbase[2], lightmaptcscale[2];
5077 //int *originalelement3i;
5078 //int *originalneighbor3i;
5079 float *originalvertex3f;
5080 //float *originalsvector3f;
5081 //float *originaltvector3f;
5082 float *originalnormal3f;
5083 float *originalcolor4f;
5084 float *originaltexcoordtexture2f;
5085 float *originaltexcoordlightmap2f;
5086 float *surfacecollisionvertex3f;
5087 int *surfacecollisionelement3i;
5089 patchtess_t *patchtess = NULL;
5090 int patchtesscount = 0;
5093 in = (q3dface_t *)(mod_base + l->fileofs);
5094 if (l->filelen % sizeof(*in))
5095 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
5096 count = l->filelen / sizeof(*in);
5097 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5099 loadmodel->data_surfaces = out;
5100 loadmodel->num_surfaces = count;
5103 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
5111 for (;i < count;i++, in++, out++)
5113 // check face type first
5114 type = LittleLong(in->type);
5115 if (type != Q3FACETYPE_FLAT
5116 && type != Q3FACETYPE_PATCH
5117 && type != Q3FACETYPE_MESH
5118 && type != Q3FACETYPE_FLARE)
5120 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
5124 n = LittleLong(in->textureindex);
5125 if (n < 0 || n >= loadmodel->num_textures)
5127 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
5130 out->texture = loadmodel->data_textures + n;
5131 n = LittleLong(in->effectindex);
5132 if (n < -1 || n >= loadmodel->brushq3.num_effects)
5134 if (developer_extra.integer)
5135 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
5141 out->effect = loadmodel->brushq3.data_effects + n;
5143 if (cls.state != ca_dedicated)
5145 out->lightmaptexture = NULL;
5146 out->deluxemaptexture = r_texture_blanknormalmap;
5147 n = LittleLong(in->lightmapindex);
5150 else if (n >= loadmodel->brushq3.num_originallightmaps)
5152 if(loadmodel->brushq3.num_originallightmaps != 0)
5153 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
5158 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5159 if (loadmodel->brushq3.deluxemapping)
5160 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5161 loadmodel->lit = true;
5165 firstvertex = LittleLong(in->firstvertex);
5166 numvertices = LittleLong(in->numvertices);
5167 firstelement = LittleLong(in->firstelement);
5168 numtriangles = LittleLong(in->numelements) / 3;
5169 if (numtriangles * 3 != LittleLong(in->numelements))
5171 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));
5174 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
5176 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);
5179 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
5181 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);
5186 case Q3FACETYPE_FLAT:
5187 case Q3FACETYPE_MESH:
5188 // no processing necessary
5190 case Q3FACETYPE_PATCH:
5191 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5192 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5193 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))
5195 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
5198 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5200 // convert patch to Q3FACETYPE_MESH
5201 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5202 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5203 // bound to user settings
5204 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
5205 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
5206 // bound to sanity settings
5207 xtess = bound(0, xtess, 1024);
5208 ytess = bound(0, ytess, 1024);
5210 // lower quality collision patches! Same procedure as before, but different cvars
5211 // convert patch to Q3FACETYPE_MESH
5212 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5213 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5214 // bound to user settings
5215 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
5216 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
5217 // bound to sanity settings
5218 cxtess = bound(0, cxtess, 1024);
5219 cytess = bound(0, cytess, 1024);
5221 // store it for the LOD grouping step
5222 patchtess[patchtesscount].info.xsize = patchsize[0];
5223 patchtess[patchtesscount].info.ysize = patchsize[1];
5224 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
5225 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
5226 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
5227 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
5229 patchtess[patchtesscount].surface_id = i;
5230 patchtess[patchtesscount].lodgroup[0] = LittleFloat(in->specific.patch.mins[0]);
5231 patchtess[patchtesscount].lodgroup[1] = LittleFloat(in->specific.patch.mins[1]);
5232 patchtess[patchtesscount].lodgroup[2] = LittleFloat(in->specific.patch.mins[2]);
5233 patchtess[patchtesscount].lodgroup[3] = LittleFloat(in->specific.patch.maxs[0]);
5234 patchtess[patchtesscount].lodgroup[4] = LittleFloat(in->specific.patch.maxs[1]);
5235 patchtess[patchtesscount].lodgroup[5] = LittleFloat(in->specific.patch.maxs[2]);
5236 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
5239 case Q3FACETYPE_FLARE:
5240 if (developer_extra.integer)
5241 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
5245 out->num_vertices = numvertices;
5246 out->num_triangles = numtriangles;
5247 meshvertices += out->num_vertices;
5248 meshtriangles += out->num_triangles;
5251 // Fix patches tesselations so that they make no seams
5255 for(i = 0; i < patchtesscount; ++i)
5257 for(j = i+1; j < patchtesscount; ++j)
5259 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
5262 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
5269 // Calculate resulting number of triangles
5270 collisionvertices = 0;
5271 collisiontriangles = 0;
5272 for(i = 0; i < patchtesscount; ++i)
5274 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
5275 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
5276 numvertices = finalwidth * finalheight;
5277 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5279 oldout[patchtess[i].surface_id].num_vertices = numvertices;
5280 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
5281 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
5282 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
5284 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_COLLISION].xtess);
5285 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_COLLISION].ytess);
5286 numvertices = finalwidth * finalheight;
5287 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5289 oldout[patchtess[i].surface_id].num_collisionvertices = numvertices;
5290 oldout[patchtess[i].surface_id].num_collisiontriangles = numtriangles;
5291 collisionvertices += oldout[patchtess[i].surface_id].num_collisionvertices;
5292 collisiontriangles += oldout[patchtess[i].surface_id].num_collisiontriangles;
5298 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
5299 if (collisiontriangles)
5301 loadmodel->brush.data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, collisionvertices * sizeof(float[3]));
5302 loadmodel->brush.data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, collisiontriangles * sizeof(int[3]));
5306 collisionvertices = 0;
5307 collisiontriangles = 0;
5308 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
5310 if (out->num_vertices < 3 || out->num_triangles < 1)
5313 type = LittleLong(in->type);
5314 firstvertex = LittleLong(in->firstvertex);
5315 firstelement = LittleLong(in->firstelement);
5316 out->num_firstvertex = meshvertices;
5317 out->num_firsttriangle = meshtriangles;
5318 out->num_firstcollisiontriangle = collisiontriangles;
5321 case Q3FACETYPE_FLAT:
5322 case Q3FACETYPE_MESH:
5323 // no processing necessary, except for lightmap merging
5324 for (j = 0;j < out->num_vertices;j++)
5326 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5327 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5328 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5329 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5330 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5331 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5332 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5333 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5334 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5335 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5336 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5337 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5338 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5339 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5341 for (j = 0;j < out->num_triangles*3;j++)
5342 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5344 case Q3FACETYPE_PATCH:
5345 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5346 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5347 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5348 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5349 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5350 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5351 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5353 xtess = ytess = cxtess = cytess = -1;
5354 for(j = 0; j < patchtesscount; ++j)
5355 if(patchtess[j].surface_id == i)
5357 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5358 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5359 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5360 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5365 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5366 xtess = ytess = cxtess = cytess = 0;
5369 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5370 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5371 finalvertices = finalwidth * finalheight;
5372 oldnumtriangles = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5373 type = Q3FACETYPE_MESH;
5374 // generate geometry
5375 // (note: normals are skipped because they get recalculated)
5376 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5377 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5378 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5379 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5380 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5381 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5383 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);
5385 if (developer_extra.integer)
5387 if (out->num_triangles < finaltriangles)
5388 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);
5390 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);
5392 // q3map does not put in collision brushes for curves... ugh
5393 // build the lower quality collision geometry
5394 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5395 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5396 finalvertices = finalwidth * finalheight;
5397 oldnumtriangles2 = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5399 // legacy collision geometry implementation
5400 out->deprecatedq3data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5401 out->deprecatedq3data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5402 out->num_collisionvertices = finalvertices;
5403 out->num_collisiontriangles = finaltriangles;
5404 Q3PatchTesselateFloat(3, sizeof(float[3]), out->deprecatedq3data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5405 Q3PatchTriangleElements(out->deprecatedq3data_collisionelement3i, finalwidth, finalheight, 0);
5407 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5408 Mod_SnapVertices(3, finalvertices, out->deprecatedq3data_collisionvertex3f, 1);
5410 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionvertex3f);
5412 // now optimize the collision mesh by finding triangle bboxes...
5413 Mod_Q3BSP_BuildBBoxes(out->deprecatedq3data_collisionelement3i, out->num_collisiontriangles, out->deprecatedq3data_collisionvertex3f, &out->deprecatedq3data_collisionbbox6f, &out->deprecatedq3num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5414 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);
5416 // store collision geometry for BIH collision tree
5417 surfacecollisionvertex3f = loadmodel->brush.data_collisionvertex3f + collisionvertices * 3;
5418 surfacecollisionelement3i = loadmodel->brush.data_collisionelement3i + collisiontriangles * 3;
5419 Q3PatchTesselateFloat(3, sizeof(float[3]), surfacecollisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5420 Q3PatchTriangleElements(surfacecollisionelement3i, finalwidth, finalheight, collisionvertices);
5421 Mod_SnapVertices(3, finalvertices, surfacecollisionvertex3f, 1);
5423 // remove this once the legacy code is removed
5425 int nc = out->num_collisiontriangles;
5427 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, surfacecollisionelement3i, surfacecollisionelement3i, loadmodel->brush.data_collisionvertex3f);
5429 if(nc != out->num_collisiontriangles)
5431 Con_Printf("number of collision triangles differs between BIH and BSP. FAIL.\n");
5436 if (developer_extra.integer)
5437 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);
5439 collisionvertices += finalvertices;
5440 collisiontriangles += out->num_collisiontriangles;
5445 meshvertices += out->num_vertices;
5446 meshtriangles += out->num_triangles;
5447 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5448 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)
5450 if (invalidelements)
5452 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);
5453 for (j = 0;j < out->num_triangles * 3;j++)
5455 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5456 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)
5457 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5461 // calculate a bounding box
5462 VectorClear(out->mins);
5463 VectorClear(out->maxs);
5464 if (out->num_vertices)
5466 if (cls.state != ca_dedicated && out->lightmaptexture)
5468 // figure out which part of the merged lightmap this fits into
5469 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5470 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5471 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5472 lightmapindex &= mergewidth * mergeheight - 1;
5473 lightmaptcscale[0] = 1.0f / mergewidth;
5474 lightmaptcscale[1] = 1.0f / mergeheight;
5475 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5476 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5477 // modify the lightmap texcoords to match this region of the merged lightmap
5478 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5480 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5481 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5484 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5485 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5486 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5488 out->mins[0] = min(out->mins[0], v[0]);
5489 out->maxs[0] = max(out->maxs[0], v[0]);
5490 out->mins[1] = min(out->mins[1], v[1]);
5491 out->maxs[1] = max(out->maxs[1], v[1]);
5492 out->mins[2] = min(out->mins[2], v[2]);
5493 out->maxs[2] = max(out->maxs[2], v[2]);
5495 out->mins[0] -= 1.0f;
5496 out->mins[1] -= 1.0f;
5497 out->mins[2] -= 1.0f;
5498 out->maxs[0] += 1.0f;
5499 out->maxs[1] += 1.0f;
5500 out->maxs[2] += 1.0f;
5502 // set lightmap styles for consistency with q1bsp
5503 //out->lightmapinfo->styles[0] = 0;
5504 //out->lightmapinfo->styles[1] = 255;
5505 //out->lightmapinfo->styles[2] = 255;
5506 //out->lightmapinfo->styles[3] = 255;
5511 for (;i < count;i++, out++)
5513 if(out->num_vertices && out->num_triangles)
5515 if(out->num_vertices == 0)
5517 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no vertices, ignoring\n", i, out->texture ? out->texture->name : "(none)");
5518 if(out->num_triangles == 0)
5519 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no triangles, ignoring\n", i, out->texture ? out->texture->name : "(none)");
5521 else if(out->num_triangles == 0)
5522 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)",
5523 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[0 * 3 + 0],
5524 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[1 * 3 + 0],
5525 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[2 * 3 + 0]);
5528 // for per pixel lighting
5529 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);
5531 // generate ushort elements array if possible
5532 if (loadmodel->surfmesh.data_element3s)
5533 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5534 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5536 // free the no longer needed vertex data
5537 loadmodel->brushq3.num_vertices = 0;
5538 if (loadmodel->brushq3.data_vertex3f)
5539 Mem_Free(loadmodel->brushq3.data_vertex3f);
5540 loadmodel->brushq3.data_vertex3f = NULL;
5541 loadmodel->brushq3.data_normal3f = NULL;
5542 loadmodel->brushq3.data_texcoordtexture2f = NULL;
5543 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5544 loadmodel->brushq3.data_color4f = NULL;
5545 // free the no longer needed triangle data
5546 loadmodel->brushq3.num_triangles = 0;
5547 if (loadmodel->brushq3.data_element3i)
5548 Mem_Free(loadmodel->brushq3.data_element3i);
5549 loadmodel->brushq3.data_element3i = NULL;
5552 Mem_Free(patchtess);
5555 static void Mod_Q3BSP_LoadModels(lump_t *l)
5559 int i, j, n, c, count;
5561 in = (q3dmodel_t *)(mod_base + l->fileofs);
5562 if (l->filelen % sizeof(*in))
5563 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5564 count = l->filelen / sizeof(*in);
5565 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5567 loadmodel->brushq3.data_models = out;
5568 loadmodel->brushq3.num_models = count;
5570 for (i = 0;i < count;i++, in++, out++)
5572 for (j = 0;j < 3;j++)
5574 out->mins[j] = LittleFloat(in->mins[j]);
5575 out->maxs[j] = LittleFloat(in->maxs[j]);
5577 n = LittleLong(in->firstface);
5578 c = LittleLong(in->numfaces);
5579 if (n < 0 || n + c > loadmodel->num_surfaces)
5580 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5583 n = LittleLong(in->firstbrush);
5584 c = LittleLong(in->numbrushes);
5585 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5586 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5587 out->firstbrush = n;
5588 out->numbrushes = c;
5592 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5598 in = (int *)(mod_base + l->fileofs);
5599 if (l->filelen % sizeof(*in))
5600 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5601 count = l->filelen / sizeof(*in);
5602 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5604 loadmodel->brush.data_leafbrushes = out;
5605 loadmodel->brush.num_leafbrushes = count;
5607 for (i = 0;i < count;i++, in++, out++)
5609 n = LittleLong(*in);
5610 if (n < 0 || n >= loadmodel->brush.num_brushes)
5611 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5616 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5622 in = (int *)(mod_base + l->fileofs);
5623 if (l->filelen % sizeof(*in))
5624 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5625 count = l->filelen / sizeof(*in);
5626 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5628 loadmodel->brush.data_leafsurfaces = out;
5629 loadmodel->brush.num_leafsurfaces = count;
5631 for (i = 0;i < count;i++, in++, out++)
5633 n = LittleLong(*in);
5634 if (n < 0 || n >= loadmodel->num_surfaces)
5635 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5640 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5644 int i, j, n, c, count;
5646 in = (q3dleaf_t *)(mod_base + l->fileofs);
5647 if (l->filelen % sizeof(*in))
5648 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5649 count = l->filelen / sizeof(*in);
5650 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5652 loadmodel->brush.data_leafs = out;
5653 loadmodel->brush.num_leafs = count;
5655 for (i = 0;i < count;i++, in++, out++)
5659 out->clusterindex = LittleLong(in->clusterindex);
5660 out->areaindex = LittleLong(in->areaindex);
5661 for (j = 0;j < 3;j++)
5663 // yes the mins/maxs are ints
5664 out->mins[j] = LittleLong(in->mins[j]) - 1;
5665 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5667 n = LittleLong(in->firstleafface);
5668 c = LittleLong(in->numleaffaces);
5669 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5670 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5671 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5672 out->numleafsurfaces = c;
5673 n = LittleLong(in->firstleafbrush);
5674 c = LittleLong(in->numleafbrushes);
5675 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5676 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5677 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5678 out->numleafbrushes = c;
5682 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5688 in = (q3dnode_t *)(mod_base + l->fileofs);
5689 if (l->filelen % sizeof(*in))
5690 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5691 count = l->filelen / sizeof(*in);
5693 Host_Error("Mod_Q3BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
5694 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5696 loadmodel->brush.data_nodes = out;
5697 loadmodel->brush.num_nodes = count;
5699 for (i = 0;i < count;i++, in++, out++)
5702 n = LittleLong(in->planeindex);
5703 if (n < 0 || n >= loadmodel->brush.num_planes)
5704 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5705 out->plane = loadmodel->brush.data_planes + n;
5706 for (j = 0;j < 2;j++)
5708 n = LittleLong(in->childrenindex[j]);
5711 if (n >= loadmodel->brush.num_nodes)
5712 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5713 out->children[j] = loadmodel->brush.data_nodes + n;
5718 if (n >= loadmodel->brush.num_leafs)
5719 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5720 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5723 for (j = 0;j < 3;j++)
5725 // yes the mins/maxs are ints
5726 out->mins[j] = LittleLong(in->mins[j]) - 1;
5727 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5731 // set the parent pointers
5732 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5735 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5738 q3dlightgrid_t *out;
5741 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5742 if (l->filelen % sizeof(*in))
5743 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5744 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5745 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5746 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5747 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5748 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5749 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5750 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5751 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5752 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5753 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5754 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5755 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5756 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5757 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]);
5758 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]);
5760 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5763 if (l->filelen < count * (int)sizeof(*in))
5765 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]);
5766 return; // ignore the grid if we cannot understand it
5768 if (l->filelen != count * (int)sizeof(*in))
5769 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5770 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5771 loadmodel->brushq3.data_lightgrid = out;
5772 loadmodel->brushq3.num_lightgrid = count;
5773 // no swapping or validation necessary
5774 memcpy(out, in, count * (int)sizeof(*out));
5778 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5783 if (l->filelen == 0)
5786 // unvised maps often have cluster indices even without pvs, so check
5787 // leafs to find real number of clusters
5788 loadmodel->brush.num_pvsclusters = 1;
5789 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5790 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5793 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5794 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5795 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5796 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5800 in = (q3dpvs_t *)(mod_base + l->fileofs);
5802 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5804 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5805 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5806 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5807 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5808 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5809 if (l->filelen < totalchains + (int)sizeof(*in))
5810 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);
5812 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5813 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5816 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5818 int i, j, k, index[3];
5819 float transformed[3], blend1, blend2, blend, stylescale = 1;
5820 q3dlightgrid_t *a, *s;
5822 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5823 switch(vid.renderpath)
5825 case RENDERPATH_GL20:
5826 case RENDERPATH_D3D9:
5827 case RENDERPATH_D3D10:
5828 case RENDERPATH_D3D11:
5829 case RENDERPATH_SOFT:
5830 case RENDERPATH_GLES2:
5831 // LordHavoc: FIXME: is this true?
5832 stylescale = 1; // added while render
5834 case RENDERPATH_GL11:
5835 case RENDERPATH_GL13:
5836 stylescale = r_refdef.scene.rtlightstylevalue[0];
5840 if (!model->brushq3.num_lightgrid)
5842 ambientcolor[0] = stylescale;
5843 ambientcolor[1] = stylescale;
5844 ambientcolor[2] = stylescale;
5848 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5849 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5850 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5851 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5852 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5853 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5854 index[0] = (int)floor(transformed[0]);
5855 index[1] = (int)floor(transformed[1]);
5856 index[2] = (int)floor(transformed[2]);
5857 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5859 // now lerp the values
5860 VectorClear(diffusenormal);
5861 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5862 for (k = 0;k < 2;k++)
5864 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5865 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5867 for (j = 0;j < 2;j++)
5869 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5870 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5872 for (i = 0;i < 2;i++)
5874 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5875 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5877 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5878 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5879 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5880 // this uses the mod_md3_sin table because the values are
5881 // already in the 0-255 range, the 64+ bias fetches a cosine
5882 // instead of a sine value
5883 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5884 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5885 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5886 //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)));
5891 // normalize the light direction before turning
5892 VectorNormalize(diffusenormal);
5893 //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]);
5896 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
5899 double midf, mid[3];
5905 // find the point distances
5906 mplane_t *plane = node->plane;
5907 if (plane->type < 3)
5909 t1 = p1[plane->type] - plane->dist;
5910 t2 = p2[plane->type] - plane->dist;
5914 t1 = DotProduct (plane->normal, p1) - plane->dist;
5915 t2 = DotProduct (plane->normal, p2) - plane->dist;
5922 node = node->children[1];
5931 node = node->children[0];
5937 midf = t1 / (t1 - t2);
5938 VectorLerp(p1, midf, p2, mid);
5940 // recurse both sides, front side first
5941 // return 2 if empty is followed by solid (hit something)
5942 // do not return 2 if both are solid or both empty,
5943 // or if start is solid and end is empty
5944 // as these degenerate cases usually indicate the eye is in solid and
5945 // should see the target point anyway
5946 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
5949 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
5954 return ((mleaf_t *)node)->clusterindex < 0;
5957 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
5959 if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
5962 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
5963 return trace.fraction == 1;
5967 double tracestart[3], traceend[3];
5968 VectorCopy(start, tracestart);
5969 VectorCopy(end, traceend);
5970 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
5974 static void Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace_t *trace, dp_model_t *model, int nodenum, const vec3_t point)
5976 const bih_leaf_t *leaf;
5977 const bih_node_t *node;
5978 const colbrushf_t *brush;
5980 while (nodenum >= 0)
5982 node = model->collision_bih.nodes + nodenum;
5983 if (node->type == BIH_UNORDERED)
5985 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
5987 leaf = model->collision_bih.leafs + node->children[axis];
5989 if (!BoxesOverlap(point, point, leaf->mins, leaf->maxs))
5995 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
5996 Collision_TracePointBrushFloat(trace, point, brush);
5998 case BIH_COLLISIONTRIANGLE:
5999 // collision triangle - skipped because they have no volume
6001 case BIH_RENDERTRIANGLE:
6002 // render triangle - skipped because they have no volume
6008 axis = node->type - BIH_SPLITX;
6009 if (point[axis] <= node->backmax)
6011 if (point[axis] >= node->frontmin)
6012 Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace, model, node->front, point);
6013 nodenum = node->back;
6015 else if (point[axis] >= node->frontmin)
6016 nodenum = node->front;
6017 else // no overlap with either child? just return
6020 if (!model->collision_bih.leafs)
6022 leaf = model->collision_bih.leafs + (-1-nodenum);
6024 if (!BoxesOverlap(point, point, leaf->mins, leaf->maxs))
6030 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6031 Collision_TracePointBrushFloat(trace, point, brush);
6033 case BIH_COLLISIONTRIANGLE:
6034 // collision triangle - skipped because they have no volume
6036 case BIH_RENDERTRIANGLE:
6037 // render triangle - skipped because they have no volume
6042 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)
6044 const bih_leaf_t *leaf;
6045 const bih_node_t *node;
6046 const colbrushf_t *brush;
6048 const texture_t *texture;
6059 vec3_t clipped, newstart, newend;
6063 segmentmins[0] = min(start[0], end[0]);
6064 segmentmins[1] = min(start[1], end[1]);
6065 segmentmins[2] = min(start[2], end[2]);
6066 segmentmaxs[0] = max(start[0], end[0]);
6067 segmentmaxs[1] = max(start[1], end[1]);
6068 segmentmaxs[2] = max(start[2], end[2]);
6069 while (nodenum >= 0)
6071 node = bih->nodes + nodenum;
6073 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6076 if (node->type == BIH_UNORDERED)
6078 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6080 leaf = model->collision_bih.leafs + node->children[axis];
6082 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6088 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6089 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
6091 case BIH_COLLISIONTRIANGLE:
6092 if (!mod_q3bsp_curves_collisions.integer)
6094 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6095 texture = model->data_textures + leaf->textureindex;
6096 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);
6098 case BIH_RENDERTRIANGLE:
6099 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6100 texture = model->data_textures + leaf->textureindex;
6101 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);
6107 axis = node->type - BIH_SPLITX;
6109 if (segmentmins[axis] <= node->backmax)
6111 if (segmentmaxs[axis] >= node->frontmin)
6112 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6113 nodenum = node->back;
6115 else if (segmentmaxs[axis] >= node->frontmin)
6116 nodenum = node->front;
6118 return; // trace falls between children
6120 frontdist1 = start[axis] - node->frontmin;
6121 frontdist2 = end[axis] - node->frontmin;
6122 backdist1 = start[axis] - node->backmax;
6123 backdist2 = end[axis] - node->backmax;
6136 if ((sideflags & 3) != 3)
6137 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6138 nodenum = node->back;
6140 else if ((sideflags & 3) != 3)
6141 nodenum = node->front;
6143 return; // trace falls between children
6148 // start end START END
6149 nodenum = node->front;
6152 // START end START END
6154 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6155 VectorLerp(start, frontfrac, end, newstart); start = newstart;
6156 segmentmins[0] = min(start[0], end[0]);
6157 segmentmins[1] = min(start[1], end[1]);
6158 segmentmins[2] = min(start[2], end[2]);
6159 segmentmaxs[0] = max(start[0], end[0]);
6160 segmentmaxs[1] = max(start[1], end[1]);
6161 segmentmaxs[2] = max(start[2], end[2]);
6163 nodenum = node->front;
6167 // start END START END
6168 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6169 VectorLerp(start, frontfrac, end, newend); end = newend;
6170 segmentmins[0] = min(start[0], end[0]);
6171 segmentmins[1] = min(start[1], end[1]);
6172 segmentmins[2] = min(start[2], end[2]);
6173 segmentmaxs[0] = max(start[0], end[0]);
6174 segmentmaxs[1] = max(start[1], end[1]);
6175 segmentmaxs[2] = max(start[2], end[2]);
6177 nodenum = node->front;
6180 // START END START END
6181 return; // line falls in gap between children
6183 // start end start END
6184 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6186 backfrac = backdist1 / (backdist1 - backdist2);
6187 VectorLerp(start, backfrac, end, newend); end = newend;
6188 segmentmins[0] = min(start[0], end[0]);
6189 segmentmins[1] = min(start[1], end[1]);
6190 segmentmins[2] = min(start[2], end[2]);
6191 segmentmaxs[0] = max(start[0], end[0]);
6192 segmentmaxs[1] = max(start[1], end[1]);
6193 segmentmaxs[2] = max(start[2], end[2]);
6195 nodenum = node->back;
6198 // START end start END
6200 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6201 VectorLerp(start, frontfrac, end, clipped);
6202 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, clipped, end, linestart, lineend);
6203 backfrac = backdist1 / (backdist1 - backdist2);
6204 VectorLerp(start, backfrac, end, newend); end = newend;
6205 segmentmins[0] = min(start[0], end[0]);
6206 segmentmins[1] = min(start[1], end[1]);
6207 segmentmins[2] = min(start[2], end[2]);
6208 segmentmaxs[0] = max(start[0], end[0]);
6209 segmentmaxs[1] = max(start[1], end[1]);
6210 segmentmaxs[2] = max(start[2], end[2]);
6212 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6214 nodenum = node->back;
6217 // start END start END
6219 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6220 VectorLerp(start, frontfrac, end, clipped);
6221 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, clipped, linestart, lineend);
6222 backfrac = backdist1 / (backdist1 - backdist2);
6223 VectorLerp(start, backfrac, end, newend); end = newend;
6224 segmentmins[0] = min(start[0], end[0]);
6225 segmentmins[1] = min(start[1], end[1]);
6226 segmentmins[2] = min(start[2], end[2]);
6227 segmentmaxs[0] = max(start[0], end[0]);
6228 segmentmaxs[1] = max(start[1], end[1]);
6229 segmentmaxs[2] = max(start[2], end[2]);
6231 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6233 nodenum = node->back;
6236 // START END start END
6238 backfrac = backdist1 / (backdist1 - backdist2);
6239 VectorLerp(start, backfrac, end, newend); end = newend;
6240 segmentmins[0] = min(start[0], end[0]);
6241 segmentmins[1] = min(start[1], end[1]);
6242 segmentmins[2] = min(start[2], end[2]);
6243 segmentmaxs[0] = max(start[0], end[0]);
6244 segmentmaxs[1] = max(start[1], end[1]);
6245 segmentmaxs[2] = max(start[2], end[2]);
6247 nodenum = node->back;
6250 // start end START end
6251 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6253 backfrac = backdist1 / (backdist1 - backdist2);
6254 VectorLerp(start, backfrac, end, newstart); start = newstart;
6255 segmentmins[0] = min(start[0], end[0]);
6256 segmentmins[1] = min(start[1], end[1]);
6257 segmentmins[2] = min(start[2], end[2]);
6258 segmentmaxs[0] = max(start[0], end[0]);
6259 segmentmaxs[1] = max(start[1], end[1]);
6260 segmentmaxs[2] = max(start[2], end[2]);
6262 nodenum = node->back;
6265 // START end START end
6267 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6268 VectorLerp(start, frontfrac, end, clipped);
6269 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, clipped, end, linestart, lineend);
6270 backfrac = backdist1 / (backdist1 - backdist2);
6271 VectorLerp(start, backfrac, end, newstart); start = newstart;
6272 segmentmins[0] = min(start[0], end[0]);
6273 segmentmins[1] = min(start[1], end[1]);
6274 segmentmins[2] = min(start[2], end[2]);
6275 segmentmaxs[0] = max(start[0], end[0]);
6276 segmentmaxs[1] = max(start[1], end[1]);
6277 segmentmaxs[2] = max(start[2], end[2]);
6279 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6281 nodenum = node->back;
6284 // start END START end
6286 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6287 VectorLerp(start, frontfrac, end, clipped);
6288 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, clipped, linestart, lineend);
6289 backfrac = backdist1 / (backdist1 - backdist2);
6290 VectorLerp(start, backfrac, end, newstart); start = newstart;
6291 segmentmins[0] = min(start[0], end[0]);
6292 segmentmins[1] = min(start[1], end[1]);
6293 segmentmins[2] = min(start[2], end[2]);
6294 segmentmaxs[0] = max(start[0], end[0]);
6295 segmentmaxs[1] = max(start[1], end[1]);
6296 segmentmaxs[2] = max(start[2], end[2]);
6298 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6300 nodenum = node->back;
6303 // START END START end
6305 backfrac = backdist1 / (backdist1 - backdist2);
6306 VectorLerp(start, backfrac, end, newstart); start = newstart;
6307 segmentmins[0] = min(start[0], end[0]);
6308 segmentmins[1] = min(start[1], end[1]);
6309 segmentmins[2] = min(start[2], end[2]);
6310 segmentmaxs[0] = max(start[0], end[0]);
6311 segmentmaxs[1] = max(start[1], end[1]);
6312 segmentmaxs[2] = max(start[2], end[2]);
6314 nodenum = node->back;
6317 // start end start end
6318 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6319 nodenum = node->back;
6322 // START end start end
6324 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6325 VectorLerp(start, frontfrac, end, clipped);
6326 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, clipped, end, linestart, lineend);
6328 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6330 nodenum = node->back;
6333 // start END start end
6335 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6336 VectorLerp(start, frontfrac, end, clipped);
6337 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, clipped, linestart, lineend);
6339 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6341 nodenum = node->back;
6344 // START END start end
6345 nodenum = node->back;
6353 leaf = bih->leafs + (-1-nodenum);
6355 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6361 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6362 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
6364 case BIH_COLLISIONTRIANGLE:
6365 if (!mod_q3bsp_curves_collisions.integer)
6367 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6368 texture = model->data_textures + leaf->textureindex;
6369 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);
6371 case BIH_RENDERTRIANGLE:
6372 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6373 texture = model->data_textures + leaf->textureindex;
6374 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);
6379 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)
6381 const bih_leaf_t *leaf;
6382 const bih_node_t *node;
6383 const colbrushf_t *brush;
6385 const texture_t *texture;
6387 while (nodenum >= 0)
6389 node = model->collision_bih.nodes + nodenum;
6390 if (node->type == BIH_UNORDERED)
6392 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6394 leaf = model->collision_bih.leafs + node->children[axis];
6396 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6402 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6403 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6405 case BIH_COLLISIONTRIANGLE:
6406 if (!mod_q3bsp_curves_collisions.integer)
6408 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6409 texture = model->data_textures + leaf->textureindex;
6410 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);
6412 case BIH_RENDERTRIANGLE:
6413 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6414 texture = model->data_textures + leaf->textureindex;
6415 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);
6421 axis = node->type - BIH_SPLITX;
6423 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6427 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, node->front, thisbrush_start, thisbrush_end, segmentmins, segmentmaxs);
6428 nodenum = node->back;
6431 if (segmentmins[axis] <= node->backmax)
6433 if (segmentmaxs[axis] >= node->frontmin)
6434 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, node->front, thisbrush_start, thisbrush_end, segmentmins, segmentmaxs);
6435 nodenum = node->back;
6437 else if (segmentmaxs[axis] >= node->frontmin)
6438 nodenum = node->front;
6440 return; // trace falls between children
6442 if (!model->collision_bih.leafs)
6444 leaf = model->collision_bih.leafs + (-1-nodenum);
6446 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6452 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6453 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6455 case BIH_COLLISIONTRIANGLE:
6456 if (!mod_q3bsp_curves_collisions.integer)
6458 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6459 texture = model->data_textures + leaf->textureindex;
6460 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);
6462 case BIH_RENDERTRIANGLE:
6463 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6464 texture = model->data_textures + leaf->textureindex;
6465 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);
6470 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)
6472 memset(trace, 0, sizeof(*trace));
6473 trace->fraction = 1;
6474 trace->realfraction = 1;
6475 trace->hitsupercontentsmask = hitsupercontentsmask;
6476 Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start);
6479 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)
6481 if (VectorCompare(start, end))
6483 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6487 memset(trace, 0, sizeof(*trace));
6488 trace->fraction = 1;
6489 trace->realfraction = 1;
6490 trace->hitsupercontentsmask = hitsupercontentsmask;
6491 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, &model->collision_bih, model->collision_bih.rootnode, start, end, start, end);
6494 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)
6496 float segmentmins[3], segmentmaxs[3];
6497 colboxbrushf_t thisbrush_start, thisbrush_end;
6498 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6500 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
6502 vec3_t shiftstart, shiftend;
6503 VectorAdd(start, boxmins, shiftstart);
6504 VectorAdd(end, boxmins, shiftend);
6505 if (VectorCompare(start, end))
6506 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, shiftstart, hitsupercontentsmask);
6508 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, shiftstart, shiftend, hitsupercontentsmask);
6512 // box trace, performed as brush trace
6513 memset(trace, 0, sizeof(*trace));
6514 trace->fraction = 1;
6515 trace->realfraction = 1;
6516 trace->hitsupercontentsmask = hitsupercontentsmask;
6517 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
6518 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
6519 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
6520 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
6521 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
6522 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
6523 VectorAdd(start, boxmins, boxstartmins);
6524 VectorAdd(start, boxmaxs, boxstartmaxs);
6525 VectorAdd(end, boxmins, boxendmins);
6526 VectorAdd(end, boxmaxs, boxendmaxs);
6527 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6528 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6529 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, &thisbrush_start.brush, &thisbrush_end.brush, segmentmins, segmentmaxs);
6532 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)
6534 float segmentmins[3], segmentmaxs[3];
6536 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(start->mins, start->maxs) && VectorCompare(end->mins, end->maxs))
6538 if (VectorCompare(start->mins, end->mins))
6539 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start->mins, hitsupercontentsmask);
6541 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start->mins, end->mins, hitsupercontentsmask);
6545 // box trace, performed as brush trace
6546 memset(trace, 0, sizeof(*trace));
6547 trace->fraction = 1;
6548 trace->realfraction = 1;
6549 trace->hitsupercontentsmask = hitsupercontentsmask;
6550 segmentmins[0] = min(start->mins[0], end->mins[0]);
6551 segmentmins[1] = min(start->mins[1], end->mins[1]);
6552 segmentmins[2] = min(start->mins[2], end->mins[2]);
6553 segmentmaxs[0] = max(start->maxs[0], end->maxs[0]);
6554 segmentmaxs[1] = max(start->maxs[1], end->maxs[1]);
6555 segmentmaxs[2] = max(start->maxs[2], end->maxs[2]);
6556 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, segmentmins, segmentmaxs);
6559 int Mod_CollisionBIH_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6562 Mod_CollisionBIH_TracePoint(model, NULL, NULL, &trace, point, 0);
6563 return trace.startsupercontents;
6566 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)
6569 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6571 int hitsupercontents;
6572 VectorSet(end, start[0], start[1], model->normalmins[2]);
6574 memset(trace, 0, sizeof(*trace));
6575 trace->fraction = 1;
6576 trace->realfraction = 1;
6577 trace->hitsupercontentsmask = hitsupercontentsmask;
6579 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, start, end);
6580 hitsupercontents = trace->hitsupercontents;
6581 memset(trace, 0, sizeof(*trace));
6582 trace->fraction = 1;
6583 trace->realfraction = 1;
6584 trace->hitsupercontentsmask = hitsupercontentsmask;
6585 trace->startsupercontents = hitsupercontents;
6589 int Mod_CollisionBIH_PointSuperContents_Mesh(struct model_s *model, int frame, const vec3_t start)
6592 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6595 VectorSet(end, start[0], start[1], model->normalmins[2]);
6596 memset(&trace, 0, sizeof(trace));
6598 trace.realfraction = 1;
6599 trace.hitsupercontentsmask = 0;
6600 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(&trace, model, model->collision_bih.rootnode, start, end, start, end);
6601 return trace.hitsupercontents;
6607 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
6612 // find which leaf the point is in
6614 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
6615 // point trace the brushes
6616 leaf = (mleaf_t *)node;
6617 for (i = 0;i < leaf->numleafbrushes;i++)
6619 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6620 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
6622 brush->markframe = markframe;
6623 Collision_TracePointBrushFloat(trace, point, brush);
6626 // can't do point traces on curves (they have no thickness)
6629 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)
6631 int i, startside, endside;
6632 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
6634 msurface_t *surface;
6637 // walk the tree until we hit a leaf, recursing for any split cases
6641 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6643 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[0], start, end, startfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6644 node = node->children[1];
6646 // abort if this part of the bsp tree can not be hit by this trace
6647 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6649 plane = node->plane;
6650 // axial planes are much more common than non-axial, so an optimized
6651 // axial case pays off here
6652 if (plane->type < 3)
6654 dist1 = start[plane->type] - plane->dist;
6655 dist2 = end[plane->type] - plane->dist;
6659 dist1 = DotProduct(start, plane->normal) - plane->dist;
6660 dist2 = DotProduct(end, plane->normal) - plane->dist;
6662 startside = dist1 < 0;
6663 endside = dist2 < 0;
6664 if (startside == endside)
6666 // most of the time the line fragment is on one side of the plane
6667 node = node->children[startside];
6671 // line crosses node plane, split the line
6672 dist1 = PlaneDiff(linestart, plane);
6673 dist2 = PlaneDiff(lineend, plane);
6674 midfrac = dist1 / (dist1 - dist2);
6675 VectorLerp(linestart, midfrac, lineend, mid);
6676 // take the near side first
6677 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6678 // if we found an impact on the front side, don't waste time
6679 // exploring the far side
6680 if (midfrac <= trace->realfraction)
6681 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6686 // abort if this part of the bsp tree can not be hit by this trace
6687 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6690 nodesegmentmins[0] = min(start[0], end[0]) - 1;
6691 nodesegmentmins[1] = min(start[1], end[1]) - 1;
6692 nodesegmentmins[2] = min(start[2], end[2]) - 1;
6693 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
6694 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
6695 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
6696 // line trace the brushes
6697 leaf = (mleaf_t *)node;
6699 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6702 for (i = 0;i < leaf->numleafbrushes;i++)
6704 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6705 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6707 brush->markframe = markframe;
6708 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
6711 // can't do point traces on curves (they have no thickness)
6712 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
6714 // line trace the curves
6715 for (i = 0;i < leaf->numleafsurfaces;i++)
6717 surface = model->data_surfaces + leaf->firstleafsurface[i];
6718 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6720 surface->deprecatedq3collisionmarkframe = markframe;
6721 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);
6727 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)
6733 msurface_t *surface;
6735 float nodesegmentmins[3], nodesegmentmaxs[3];
6736 // walk the tree until we hit a leaf, recursing for any split cases
6740 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6742 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6743 node = node->children[1];
6745 // abort if this part of the bsp tree can not be hit by this trace
6746 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6748 plane = node->plane;
6749 // axial planes are much more common than non-axial, so an optimized
6750 // axial case pays off here
6751 if (plane->type < 3)
6753 // this is an axial plane, compare bounding box directly to it and
6754 // recurse sides accordingly
6755 // recurse down node sides
6756 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
6757 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
6758 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
6759 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
6763 // this is a non-axial plane, so check if the start and end boxes
6764 // are both on one side of the plane to handle 'diagonal' cases
6765 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
6769 // segment crosses plane
6770 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6773 // if sides == 0 then the trace itself is bogus (Not A Number values),
6774 // in this case we simply pretend the trace hit nothing
6776 return; // ERROR: NAN bounding box!
6777 // take whichever side the segment box is on
6778 node = node->children[sides - 1];
6781 // abort if this part of the bsp tree can not be hit by this trace
6782 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6784 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
6785 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
6786 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
6787 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
6788 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
6789 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
6791 leaf = (mleaf_t *)node;
6793 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6796 for (i = 0;i < leaf->numleafbrushes;i++)
6798 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6799 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6801 brush->markframe = markframe;
6802 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6805 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
6807 for (i = 0;i < leaf->numleafsurfaces;i++)
6809 surface = model->data_surfaces + leaf->firstleafsurface[i];
6810 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6812 surface->deprecatedq3collisionmarkframe = markframe;
6813 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);
6820 static int markframe = 0;
6822 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)
6826 memset(trace, 0, sizeof(*trace));
6827 trace->fraction = 1;
6828 trace->realfraction = 1;
6829 trace->hitsupercontentsmask = hitsupercontentsmask;
6830 if (mod_collision_bih.integer)
6831 Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start);
6832 else if (model->brush.submodel)
6834 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6835 if (brush->colbrushf)
6836 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
6839 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
6842 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)
6845 float segmentmins[3], segmentmaxs[3];
6846 msurface_t *surface;
6849 if (VectorCompare(start, end))
6851 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6855 memset(trace, 0, sizeof(*trace));
6856 trace->fraction = 1;
6857 trace->realfraction = 1;
6858 trace->hitsupercontentsmask = hitsupercontentsmask;
6859 segmentmins[0] = min(start[0], end[0]) - 1;
6860 segmentmins[1] = min(start[1], end[1]) - 1;
6861 segmentmins[2] = min(start[2], end[2]) - 1;
6862 segmentmaxs[0] = max(start[0], end[0]) + 1;
6863 segmentmaxs[1] = max(start[1], end[1]) + 1;
6864 segmentmaxs[2] = max(start[2], end[2]) + 1;
6865 if (mod_collision_bih.integer)
6866 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, &model->collision_bih, model->collision_bih.rootnode, start, end, start, end);
6867 else if (model->brush.submodel)
6869 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6870 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6871 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6872 if (mod_q3bsp_curves_collisions.integer)
6873 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6874 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6875 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);
6878 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
6881 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)
6884 float segmentmins[3], segmentmaxs[3];
6885 msurface_t *surface;
6887 colboxbrushf_t thisbrush_start, thisbrush_end;
6888 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6890 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
6892 vec3_t shiftstart, shiftend;
6893 VectorAdd(start, boxmins, shiftstart);
6894 VectorAdd(end, boxmins, shiftend);
6895 if (VectorCompare(start, end))
6896 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, shiftstart, hitsupercontentsmask);
6898 Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, shiftstart, shiftend, hitsupercontentsmask);
6902 // box trace, performed as brush trace
6903 memset(trace, 0, sizeof(*trace));
6904 trace->fraction = 1;
6905 trace->realfraction = 1;
6906 trace->hitsupercontentsmask = hitsupercontentsmask;
6907 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
6908 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
6909 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
6910 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
6911 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
6912 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
6913 VectorAdd(start, boxmins, boxstartmins);
6914 VectorAdd(start, boxmaxs, boxstartmaxs);
6915 VectorAdd(end, boxmins, boxendmins);
6916 VectorAdd(end, boxmaxs, boxendmaxs);
6917 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6918 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6919 if (mod_collision_bih.integer)
6920 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, &thisbrush_start.brush, &thisbrush_end.brush, segmentmins, segmentmaxs);
6921 else if (model->brush.submodel)
6923 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6924 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6925 Collision_TraceBrushBrushFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, brush->colbrushf, brush->colbrushf);
6926 if (mod_q3bsp_curves_collisions.integer)
6927 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6928 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6929 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);
6932 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, &thisbrush_start.brush, &thisbrush_end.brush, ++markframe, segmentmins, segmentmaxs);
6935 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)
6937 float segmentmins[3], segmentmaxs[3];
6939 msurface_t *surface;
6942 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(start->mins, start->maxs) && VectorCompare(end->mins, end->maxs))
6944 if (VectorCompare(start->mins, end->mins))
6945 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start->mins, hitsupercontentsmask);
6947 Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, start->mins, end->mins, hitsupercontentsmask);
6951 // box trace, performed as brush trace
6952 memset(trace, 0, sizeof(*trace));
6953 trace->fraction = 1;
6954 trace->realfraction = 1;
6955 trace->hitsupercontentsmask = hitsupercontentsmask;
6956 segmentmins[0] = min(start->mins[0], end->mins[0]);
6957 segmentmins[1] = min(start->mins[1], end->mins[1]);
6958 segmentmins[2] = min(start->mins[2], end->mins[2]);
6959 segmentmaxs[0] = max(start->maxs[0], end->maxs[0]);
6960 segmentmaxs[1] = max(start->maxs[1], end->maxs[1]);
6961 segmentmaxs[2] = max(start->maxs[2], end->maxs[2]);
6962 if (mod_collision_bih.integer)
6963 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, segmentmins, segmentmaxs);
6964 else if (model->brush.submodel)
6966 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6967 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6968 Collision_TraceBrushBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6969 if (mod_q3bsp_curves_collisions.integer)
6970 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6971 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6972 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);
6975 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, ++markframe, segmentmins, segmentmaxs);
6978 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6981 int supercontents = 0;
6983 if (mod_collision_bih.integer)
6986 Mod_Q3BSP_TracePoint(model, NULL, NULL, &trace, point, 0);
6987 supercontents = trace.startsupercontents;
6989 // test if the point is inside each brush
6990 else if (model->brush.submodel)
6992 // submodels are effectively one leaf
6993 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6994 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6995 supercontents |= brush->colbrushf->supercontents;
6999 mnode_t *node = model->brush.data_nodes;
7001 // find which leaf the point is in
7003 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
7004 leaf = (mleaf_t *)node;
7005 // now check the brushes in the leaf
7006 for (i = 0;i < leaf->numleafbrushes;i++)
7008 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
7009 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
7010 supercontents |= brush->colbrushf->supercontents;
7013 return supercontents;
7016 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)
7018 memset(trace, 0, sizeof(*trace));
7019 trace->fraction = 1;
7020 trace->realfraction = 1;
7021 trace->hitsupercontentsmask = hitsupercontentsmask;
7022 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, &model->render_bih, model->render_bih.rootnode, start, end, start, end);
7026 bih_t *Mod_MakeCollisionBIH(dp_model_t *model, qboolean userendersurfaces, bih_t *out)
7034 int nummodelbrushes = model->nummodelbrushes;
7035 int nummodelsurfaces = model->nummodelsurfaces;
7037 const int *collisionelement3i;
7038 const float *collisionvertex3f;
7039 const int *renderelement3i;
7040 const float *rendervertex3f;
7041 bih_leaf_t *bihleafs;
7042 bih_node_t *bihnodes;
7044 int *temp_leafsortscratch;
7045 const msurface_t *surface;
7046 const q3mbrush_t *brush;
7048 // find out how many BIH leaf nodes we need
7050 if (userendersurfaces)
7052 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7053 bihnumleafs += surface->num_triangles;
7057 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
7058 if (brush->colbrushf)
7060 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7062 if (surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS)
7063 bihnumleafs += surface->num_triangles + surface->num_collisiontriangles;
7065 bihnumleafs += surface->num_collisiontriangles;
7072 // allocate the memory for the BIH leaf nodes
7073 bihleafs = (bih_leaf_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_leaf_t) * bihnumleafs);
7075 // now populate the BIH leaf nodes
7078 // add render surfaces
7079 renderelement3i = model->surfmesh.data_element3i;
7080 rendervertex3f = model->surfmesh.data_vertex3f;
7081 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7083 for (triangleindex = 0, e = renderelement3i + 3*surface->num_firsttriangle;triangleindex < surface->num_triangles;triangleindex++, e += 3)
7085 if (!userendersurfaces && !(surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS))
7087 bihleafs[bihleafindex].type = BIH_RENDERTRIANGLE;
7088 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
7089 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
7090 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firsttriangle;
7091 bihleafs[bihleafindex].mins[0] = min(rendervertex3f[3*e[0]+0], min(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) - 1;
7092 bihleafs[bihleafindex].mins[1] = min(rendervertex3f[3*e[0]+1], min(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) - 1;
7093 bihleafs[bihleafindex].mins[2] = min(rendervertex3f[3*e[0]+2], min(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) - 1;
7094 bihleafs[bihleafindex].maxs[0] = max(rendervertex3f[3*e[0]+0], max(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) + 1;
7095 bihleafs[bihleafindex].maxs[1] = max(rendervertex3f[3*e[0]+1], max(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) + 1;
7096 bihleafs[bihleafindex].maxs[2] = max(rendervertex3f[3*e[0]+2], max(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) + 1;
7101 if (!userendersurfaces)
7103 // add collision brushes
7104 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
7106 if (!brush->colbrushf)
7108 bihleafs[bihleafindex].type = BIH_BRUSH;
7109 bihleafs[bihleafindex].textureindex = brush->texture - model->data_textures;
7110 bihleafs[bihleafindex].surfaceindex = -1;
7111 bihleafs[bihleafindex].itemindex = brushindex+model->firstmodelbrush;
7112 VectorCopy(brush->colbrushf->mins, bihleafs[bihleafindex].mins);
7113 VectorCopy(brush->colbrushf->maxs, bihleafs[bihleafindex].maxs);
7117 // add collision surfaces
7118 collisionelement3i = model->brush.data_collisionelement3i;
7119 collisionvertex3f = model->brush.data_collisionvertex3f;
7120 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7122 for (triangleindex = 0, e = collisionelement3i + 3*surface->num_firstcollisiontriangle;triangleindex < surface->num_collisiontriangles;triangleindex++, e += 3)
7124 bihleafs[bihleafindex].type = BIH_COLLISIONTRIANGLE;
7125 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
7126 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
7127 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firstcollisiontriangle;
7128 bihleafs[bihleafindex].mins[0] = min(collisionvertex3f[3*e[0]+0], min(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) - 1;
7129 bihleafs[bihleafindex].mins[1] = min(collisionvertex3f[3*e[0]+1], min(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) - 1;
7130 bihleafs[bihleafindex].mins[2] = min(collisionvertex3f[3*e[0]+2], min(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) - 1;
7131 bihleafs[bihleafindex].maxs[0] = max(collisionvertex3f[3*e[0]+0], max(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) + 1;
7132 bihleafs[bihleafindex].maxs[1] = max(collisionvertex3f[3*e[0]+1], max(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) + 1;
7133 bihleafs[bihleafindex].maxs[2] = max(collisionvertex3f[3*e[0]+2], max(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) + 1;
7139 // allocate buffers for the produced and temporary data
7140 bihmaxnodes = bihnumleafs - 1;
7141 bihnodes = (bih_node_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_node_t) * bihmaxnodes);
7142 temp_leafsort = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * bihnumleafs * 2);
7143 temp_leafsortscratch = temp_leafsort + bihnumleafs;
7146 BIH_Build(out, bihnumleafs, bihleafs, bihmaxnodes, bihnodes, temp_leafsort, temp_leafsortscratch, mod_collision_bih_childrengrouping.integer);
7148 // we're done with the temporary data
7149 Mem_Free(temp_leafsort);
7151 // resize the BIH nodes array if it over-allocated
7152 if (out->maxnodes > out->numnodes)
7154 out->maxnodes = out->numnodes;
7155 out->nodes = (bih_node_t *)Mem_Realloc(loadmodel->mempool, out->nodes, out->numnodes * sizeof(bih_node_t));
7161 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
7163 int supercontents = 0;
7164 if (nativecontents & CONTENTSQ3_SOLID)
7165 supercontents |= SUPERCONTENTS_SOLID;
7166 if (nativecontents & CONTENTSQ3_WATER)
7167 supercontents |= SUPERCONTENTS_WATER;
7168 if (nativecontents & CONTENTSQ3_SLIME)
7169 supercontents |= SUPERCONTENTS_SLIME;
7170 if (nativecontents & CONTENTSQ3_LAVA)
7171 supercontents |= SUPERCONTENTS_LAVA;
7172 if (nativecontents & CONTENTSQ3_BODY)
7173 supercontents |= SUPERCONTENTS_BODY;
7174 if (nativecontents & CONTENTSQ3_CORPSE)
7175 supercontents |= SUPERCONTENTS_CORPSE;
7176 if (nativecontents & CONTENTSQ3_NODROP)
7177 supercontents |= SUPERCONTENTS_NODROP;
7178 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
7179 supercontents |= SUPERCONTENTS_PLAYERCLIP;
7180 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
7181 supercontents |= SUPERCONTENTS_MONSTERCLIP;
7182 if (nativecontents & CONTENTSQ3_DONOTENTER)
7183 supercontents |= SUPERCONTENTS_DONOTENTER;
7184 if (nativecontents & CONTENTSQ3_BOTCLIP)
7185 supercontents |= SUPERCONTENTS_BOTCLIP;
7186 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
7187 supercontents |= SUPERCONTENTS_OPAQUE;
7188 return supercontents;
7191 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
7193 int nativecontents = 0;
7194 if (supercontents & SUPERCONTENTS_SOLID)
7195 nativecontents |= CONTENTSQ3_SOLID;
7196 if (supercontents & SUPERCONTENTS_WATER)
7197 nativecontents |= CONTENTSQ3_WATER;
7198 if (supercontents & SUPERCONTENTS_SLIME)
7199 nativecontents |= CONTENTSQ3_SLIME;
7200 if (supercontents & SUPERCONTENTS_LAVA)
7201 nativecontents |= CONTENTSQ3_LAVA;
7202 if (supercontents & SUPERCONTENTS_BODY)
7203 nativecontents |= CONTENTSQ3_BODY;
7204 if (supercontents & SUPERCONTENTS_CORPSE)
7205 nativecontents |= CONTENTSQ3_CORPSE;
7206 if (supercontents & SUPERCONTENTS_NODROP)
7207 nativecontents |= CONTENTSQ3_NODROP;
7208 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
7209 nativecontents |= CONTENTSQ3_PLAYERCLIP;
7210 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
7211 nativecontents |= CONTENTSQ3_MONSTERCLIP;
7212 if (supercontents & SUPERCONTENTS_DONOTENTER)
7213 nativecontents |= CONTENTSQ3_DONOTENTER;
7214 if (supercontents & SUPERCONTENTS_BOTCLIP)
7215 nativecontents |= CONTENTSQ3_BOTCLIP;
7216 if (!(supercontents & SUPERCONTENTS_OPAQUE))
7217 nativecontents |= CONTENTSQ3_TRANSLUCENT;
7218 return nativecontents;
7221 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
7226 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
7227 node = node->children[1];
7229 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
7230 if (loadmodel->brush.num_leafs < numleafs)
7231 loadmodel->brush.num_leafs = numleafs;
7234 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7237 q3dheader_t *header;
7238 float corner[3], yawradius, modelradius;
7240 mod->modeldatatypestring = "Q3BSP";
7242 mod->type = mod_brushq3;
7243 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
7246 header = (q3dheader_t *)buffer;
7247 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
7248 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
7250 i = LittleLong(header->version);
7251 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
7252 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
7254 mod->soundfromcenter = true;
7255 mod->TraceBox = Mod_Q3BSP_TraceBox;
7256 mod->TraceBrush = Mod_Q3BSP_TraceBrush;
7257 mod->TraceLine = Mod_Q3BSP_TraceLine;
7258 mod->TracePoint = Mod_Q3BSP_TracePoint;
7259 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
7260 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7261 mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
7262 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
7263 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
7264 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
7265 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
7266 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
7267 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
7268 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
7269 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
7270 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
7271 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
7272 mod->brush.AmbientSoundLevelsForPoint = NULL;
7273 mod->brush.RoundUpToHullSize = NULL;
7274 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
7275 mod->Draw = R_Q1BSP_Draw;
7276 mod->DrawDepth = R_Q1BSP_DrawDepth;
7277 mod->DrawDebug = R_Q1BSP_DrawDebug;
7278 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
7279 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
7280 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7281 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7282 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7283 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7284 mod->DrawLight = R_Q1BSP_DrawLight;
7286 mod_base = (unsigned char *)header;
7288 // swap all the lumps
7289 header->ident = LittleLong(header->ident);
7290 header->version = LittleLong(header->version);
7291 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
7292 for (i = 0;i < lumps;i++)
7294 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
7295 if((char *) bufferend < (char *) buffer + j)
7296 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
7297 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
7298 if((char *) bufferend < (char *) buffer + j)
7299 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
7302 * NO, do NOT clear them!
7303 * they contain actual data referenced by other stuff.
7304 * Instead, before using the advertisements lump, check header->versio
7306 * Sorry, but otherwise it breaks memory of the first lump.
7307 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
7309 header->lumps[i].fileofs = 0;
7310 header->lumps[i].filelen = 0;
7314 mod->brush.qw_md4sum = 0;
7315 mod->brush.qw_md4sum2 = 0;
7316 for (i = 0;i < lumps;i++)
7318 if (i == Q3LUMP_ENTITIES)
7320 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7321 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
7323 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7325 // all this checksumming can take a while, so let's send keepalives here too
7326 CL_KeepaliveMessage(false);
7329 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
7330 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
7331 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
7332 if (header->version == Q3BSPVERSION_IG)
7333 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
7335 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
7336 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
7337 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
7338 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
7339 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
7340 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
7341 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
7342 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
7343 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
7344 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
7345 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
7346 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
7347 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
7348 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
7349 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
7351 // the MakePortals code works fine on the q3bsp data as well
7352 if (mod_bsp_portalize.integer)
7353 Mod_Q1BSP_MakePortals();
7355 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
7356 loadmodel->brush.supportwateralpha = true;
7358 // make a single combined shadow mesh to allow optimized shadow volume creation
7359 Mod_Q1BSP_CreateShadowMesh(loadmodel);
7361 loadmodel->brush.num_leafs = 0;
7362 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
7364 if (loadmodel->brush.numsubmodels)
7365 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7368 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7373 // duplicate the basic information
7374 dpsnprintf(name, sizeof(name), "*%i", i);
7375 mod = Mod_FindName(name, loadmodel->name);
7376 // copy the base model to this one
7378 // rename the clone back to its proper name
7379 strlcpy(mod->name, name, sizeof(mod->name));
7380 mod->brush.parentmodel = loadmodel;
7381 // textures and memory belong to the main model
7382 mod->texturepool = NULL;
7383 mod->mempool = NULL;
7384 mod->brush.GetPVS = NULL;
7385 mod->brush.FatPVS = NULL;
7386 mod->brush.BoxTouchingPVS = NULL;
7387 mod->brush.BoxTouchingLeafPVS = NULL;
7388 mod->brush.BoxTouchingVisibleLeafs = NULL;
7389 mod->brush.FindBoxClusters = NULL;
7390 mod->brush.LightPoint = NULL;
7391 mod->brush.AmbientSoundLevelsForPoint = NULL;
7393 mod->brush.submodel = i;
7394 if (loadmodel->brush.submodels)
7395 loadmodel->brush.submodels[i] = mod;
7397 // make the model surface list (used by shadowing/lighting)
7398 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
7399 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
7400 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
7401 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
7402 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
7403 Mod_MakeSortedSurfaces(mod);
7405 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
7406 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
7407 // enlarge the bounding box to enclose all geometry of this model,
7408 // because q3map2 sometimes lies (mostly to affect the lightgrid),
7409 // which can in turn mess up the farclip (as well as culling when
7410 // outside the level - an unimportant concern)
7412 //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]);
7413 for (j = 0;j < mod->nummodelsurfaces;j++)
7415 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7416 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7418 if (!surface->num_vertices)
7420 for (k = 0;k < surface->num_vertices;k++, v += 3)
7422 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7423 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7424 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7425 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7426 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7427 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7430 //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]);
7431 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7432 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7433 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7434 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7435 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7436 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7437 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7438 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7439 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7440 mod->yawmins[2] = mod->normalmins[2];
7441 mod->yawmaxs[2] = mod->normalmaxs[2];
7442 mod->radius = modelradius;
7443 mod->radius2 = modelradius * modelradius;
7445 // this gets altered below if sky or water is used
7446 mod->DrawSky = NULL;
7447 mod->DrawAddWaterPlanes = NULL;
7449 for (j = 0;j < mod->nummodelsurfaces;j++)
7450 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7452 if (j < mod->nummodelsurfaces)
7453 mod->DrawSky = R_Q1BSP_DrawSky;
7455 for (j = 0;j < mod->nummodelsurfaces;j++)
7456 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7458 if (j < mod->nummodelsurfaces)
7459 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
7461 Mod_MakeCollisionBIH(mod, false, &mod->collision_bih);
7462 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
7464 // generate VBOs and other shared data before cloning submodels
7469 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);
7472 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7474 int i = LittleLong(((int *)buffer)[1]);
7475 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
7476 Mod_Q3BSP_Load(mod,buffer, bufferend);
7477 else if (i == Q2BSPVERSION)
7478 Mod_Q2BSP_Load(mod,buffer, bufferend);
7480 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
7483 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7485 Host_Error("Mod_MAP_Load: not yet implemented");
7491 typedef struct objvertex_s
7502 static unsigned char nobsp_pvs[1] = {1};
7504 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
7506 const char *textbase = (char *)buffer, *text = textbase;
7510 char materialname[MAX_QPATH];
7511 int i, j, l, numvertices, firstvertex, firsttriangle, elementindex, vertexindex, surfacevertices, surfacetriangles, surfaceelements, submodelindex = 0;
7512 int index1, index2, index3;
7513 objvertex_t vfirst, vprev, vcurrent;
7516 int numtriangles = 0;
7517 int maxtriangles = 0;
7518 objvertex_t *vertices = NULL;
7520 int maxtextures = 0, numtextures = 0, textureindex = 0;
7521 int maxv = 0, numv = 1;
7522 int maxvt = 0, numvt = 1;
7523 int maxvn = 0, numvn = 1;
7524 char *texturenames = NULL;
7525 float dist, modelradius, modelyawradius, yawradius;
7532 objvertex_t *thisvertex = NULL;
7533 int vertexhashindex;
7534 int *vertexhashtable = NULL;
7535 objvertex_t *vertexhashdata = NULL;
7536 objvertex_t *vdata = NULL;
7537 int vertexhashsize = 0;
7538 int vertexhashcount = 0;
7539 skinfile_t *skinfiles = NULL;
7540 unsigned char *data = NULL;
7541 int *submodelfirstsurface;
7542 msurface_t *surface;
7543 msurface_t *tempsurfaces;
7545 memset(&vfirst, 0, sizeof(vfirst));
7546 memset(&vprev, 0, sizeof(vprev));
7547 memset(&vcurrent, 0, sizeof(vcurrent));
7549 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
7551 loadmodel->modeldatatypestring = "OBJ";
7553 loadmodel->type = mod_obj;
7554 loadmodel->soundfromcenter = true;
7555 loadmodel->TraceBox = Mod_CollisionBIH_TraceBox;
7556 loadmodel->TraceBrush = Mod_CollisionBIH_TraceBrush;
7557 loadmodel->TraceLine = Mod_CollisionBIH_TraceLine;
7558 loadmodel->TracePoint = Mod_CollisionBIH_TracePoint_Mesh;
7559 loadmodel->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7560 loadmodel->PointSuperContents = Mod_CollisionBIH_PointSuperContents_Mesh;
7561 loadmodel->brush.TraceLineOfSight = NULL;
7562 loadmodel->brush.SuperContentsFromNativeContents = NULL;
7563 loadmodel->brush.NativeContentsFromSuperContents = NULL;
7564 loadmodel->brush.GetPVS = NULL;
7565 loadmodel->brush.FatPVS = NULL;
7566 loadmodel->brush.BoxTouchingPVS = NULL;
7567 loadmodel->brush.BoxTouchingLeafPVS = NULL;
7568 loadmodel->brush.BoxTouchingVisibleLeafs = NULL;
7569 loadmodel->brush.FindBoxClusters = NULL;
7570 loadmodel->brush.LightPoint = NULL;
7571 loadmodel->brush.FindNonSolidLocation = NULL;
7572 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
7573 loadmodel->brush.RoundUpToHullSize = NULL;
7574 loadmodel->brush.PointInLeaf = NULL;
7575 loadmodel->Draw = R_Q1BSP_Draw;
7576 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
7577 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
7578 loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
7579 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
7580 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7581 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7582 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7583 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7584 loadmodel->DrawLight = R_Q1BSP_DrawLight;
7586 skinfiles = Mod_LoadSkinFiles();
7587 if (loadmodel->numskins < 1)
7588 loadmodel->numskins = 1;
7590 // make skinscenes for the skins (no groups)
7591 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
7592 for (i = 0;i < loadmodel->numskins;i++)
7594 loadmodel->skinscenes[i].firstframe = i;
7595 loadmodel->skinscenes[i].framecount = 1;
7596 loadmodel->skinscenes[i].loop = true;
7597 loadmodel->skinscenes[i].framerate = 10;
7603 // parse the OBJ text now
7606 static char emptyarg[1] = "";
7611 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
7612 line[linelen] = text[linelen];
7614 for (argc = 0;argc < 4;argc++)
7615 argv[argc] = emptyarg;
7618 while (*s == ' ' || *s == '\t')
7628 while (*s == ' ' || *s == '\t')
7638 if (argv[0][0] == '#')
7640 if (!strcmp(argv[0], "v"))
7644 maxv = max(maxv * 2, 1024);
7645 v = (float *)Mem_Realloc(tempmempool, v, maxv * sizeof(float[3]));
7647 v[numv*3+0] = atof(argv[1]);
7648 v[numv*3+2] = atof(argv[2]);
7649 v[numv*3+1] = atof(argv[3]);
7652 else if (!strcmp(argv[0], "vt"))
7656 maxvt = max(maxvt * 2, 1024);
7657 vt = (float *)Mem_Realloc(tempmempool, vt, maxvt * sizeof(float[2]));
7659 vt[numvt*2+0] = atof(argv[1]);
7660 vt[numvt*2+1] = 1-atof(argv[2]);
7663 else if (!strcmp(argv[0], "vn"))
7667 maxvn = max(maxvn * 2, 1024);
7668 vn = (float *)Mem_Realloc(tempmempool, vn, maxvn * sizeof(float[3]));
7670 vn[numvn*3+0] = atof(argv[1]);
7671 vn[numvn*3+2] = atof(argv[2]);
7672 vn[numvn*3+1] = atof(argv[3]);
7675 else if (!strcmp(argv[0], "f"))
7679 if (maxtextures <= numtextures)
7681 maxtextures = max(maxtextures * 2, 256);
7682 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7684 textureindex = numtextures++;
7685 strlcpy(texturenames + textureindex*MAX_QPATH, loadmodel->name, MAX_QPATH);
7687 for (j = 1;j < argc;j++)
7689 index1 = atoi(argv[j]);
7690 while(argv[j][0] && argv[j][0] != '/')
7694 index2 = atoi(argv[j]);
7695 while(argv[j][0] && argv[j][0] != '/')
7699 index3 = atoi(argv[j]);
7700 // negative refers to a recent vertex
7701 // zero means not specified
7702 // positive means an absolute vertex index
7704 index1 = numv - index1;
7706 index2 = numvt - index2;
7708 index3 = numvn - index3;
7709 vcurrent.nextindex = -1;
7710 vcurrent.textureindex = textureindex;
7711 vcurrent.submodelindex = submodelindex;
7712 if (v && index1 >= 0 && index1 < numv)
7713 VectorCopy(v + 3*index1, vcurrent.v);
7714 if (vt && index2 >= 0 && index2 < numvt)
7715 Vector2Copy(vt + 2*index2, vcurrent.vt);
7716 if (vn && index3 >= 0 && index3 < numvn)
7717 VectorCopy(vn + 3*index3, vcurrent.vn);
7718 if (numtriangles == 0)
7720 VectorCopy(vcurrent.v, mins);
7721 VectorCopy(vcurrent.v, maxs);
7725 mins[0] = min(mins[0], vcurrent.v[0]);
7726 mins[1] = min(mins[1], vcurrent.v[1]);
7727 mins[2] = min(mins[2], vcurrent.v[2]);
7728 maxs[0] = max(maxs[0], vcurrent.v[0]);
7729 maxs[1] = max(maxs[1], vcurrent.v[1]);
7730 maxs[2] = max(maxs[2], vcurrent.v[2]);
7736 if (maxtriangles <= numtriangles)
7738 maxtriangles = max(maxtriangles * 2, 32768);
7739 vertices = (objvertex_t*)Mem_Realloc(loadmodel->mempool, vertices, maxtriangles * sizeof(objvertex_t[3]));
7741 vertices[numtriangles*3+0] = vfirst;
7742 vertices[numtriangles*3+1] = vprev;
7743 vertices[numtriangles*3+2] = vcurrent;
7749 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
7751 submodelindex = atof(argv[1]);
7752 loadmodel->brush.numsubmodels = max(submodelindex + 1, loadmodel->brush.numsubmodels);
7754 else if (!strcmp(argv[0], "usemtl"))
7756 for (i = 0;i < numtextures;i++)
7757 if (!strcmp(texturenames+i*MAX_QPATH, argv[1]))
7759 if (i < numtextures)
7763 if (maxtextures <= numtextures)
7765 maxtextures = max(maxtextures * 2, 256);
7766 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7768 textureindex = numtextures++;
7769 strlcpy(texturenames + textureindex*MAX_QPATH, argv[1], MAX_QPATH);
7774 // now that we have the OBJ data loaded as-is, we can convert it
7776 // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
7777 VectorCopy(mins, loadmodel->normalmins);
7778 VectorCopy(maxs, loadmodel->normalmaxs);
7779 dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
7780 modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
7781 modelyawradius = dist*dist+modelyawradius*modelyawradius;
7782 modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
7783 modelradius = modelyawradius + modelradius * modelradius;
7784 modelyawradius = sqrt(modelyawradius);
7785 modelradius = sqrt(modelradius);
7786 loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
7787 loadmodel->yawmins[2] = loadmodel->normalmins[2];
7788 loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] = modelyawradius;
7789 loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
7790 loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
7791 loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] = modelradius;
7792 loadmodel->radius = modelradius;
7793 loadmodel->radius2 = modelradius * modelradius;
7795 // allocate storage for triangles
7796 loadmodel->surfmesh.data_element3i = (int *)Mem_Alloc(loadmodel->mempool, numtriangles * sizeof(int[3]));
7797 // allocate vertex hash structures to build an optimal vertex subset
7798 vertexhashsize = numtriangles*2;
7799 vertexhashtable = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * vertexhashsize);
7800 memset(vertexhashtable, 0xFF, sizeof(int) * vertexhashsize);
7801 vertexhashdata = (objvertex_t *)Mem_Alloc(loadmodel->mempool, sizeof(*vertexhashdata) * numtriangles*3);
7802 vertexhashcount = 0;
7804 // gather surface stats for assigning vertex/triangle ranges
7808 loadmodel->num_surfaces = 0;
7809 // allocate storage for the worst case number of surfaces, later we resize
7810 tempsurfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, numtextures * loadmodel->brush.numsubmodels * sizeof(msurface_t));
7811 submodelfirstsurface = (int *)Mem_Alloc(loadmodel->mempool, (loadmodel->brush.numsubmodels+1) * sizeof(int));
7812 surface = tempsurfaces;
7813 for (submodelindex = 0;submodelindex < loadmodel->brush.numsubmodels;submodelindex++)
7815 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7816 for (textureindex = 0;textureindex < numtextures;textureindex++)
7818 for (vertexindex = 0;vertexindex < numtriangles*3;vertexindex++)
7820 thisvertex = vertices + vertexindex;
7821 if (thisvertex->submodelindex == submodelindex && thisvertex->textureindex == textureindex)
7824 // skip the surface creation if there are no triangles for it
7825 if (vertexindex == numtriangles*3)
7827 // create a surface for these vertices
7828 surfacevertices = 0;
7829 surfaceelements = 0;
7830 // we hack in a texture index in the surface to be fixed up later...
7831 surface->texture = (texture_t *)((size_t)textureindex);
7832 // calculate bounds as we go
7833 VectorCopy(thisvertex->v, surface->mins);
7834 VectorCopy(thisvertex->v, surface->maxs);
7835 for (;vertexindex < numtriangles*3;vertexindex++)
7837 thisvertex = vertices + vertexindex;
7838 if (thisvertex->submodelindex != submodelindex)
7840 if (thisvertex->textureindex != textureindex)
7842 // add vertex to surface bounds
7843 surface->mins[0] = min(surface->mins[0], thisvertex->v[0]);
7844 surface->mins[1] = min(surface->mins[1], thisvertex->v[1]);
7845 surface->mins[2] = min(surface->mins[2], thisvertex->v[2]);
7846 surface->maxs[0] = max(surface->maxs[0], thisvertex->v[0]);
7847 surface->maxs[1] = max(surface->maxs[1], thisvertex->v[1]);
7848 surface->maxs[2] = max(surface->maxs[2], thisvertex->v[2]);
7849 // add the vertex if it is not found in the merged set, and
7850 // get its index (triangle element) for the surface
7851 vertexhashindex = (unsigned int)(thisvertex->v[0] * 3571 + thisvertex->v[0] * 1777 + thisvertex->v[0] * 457) % (unsigned int)vertexhashsize;
7852 for (i = vertexhashtable[vertexhashindex];i >= 0;i = vertexhashdata[i].nextindex)
7854 vdata = vertexhashdata + i;
7855 if (vdata->submodelindex == thisvertex->submodelindex && vdata->textureindex == thisvertex->textureindex && VectorCompare(thisvertex->v, vdata->v) && VectorCompare(thisvertex->vn, vdata->vn) && Vector2Compare(thisvertex->vt, vdata->vt))
7860 i = vertexhashcount++;
7861 vdata = vertexhashdata + i;
7862 *vdata = *thisvertex;
7863 vdata->nextindex = vertexhashtable[vertexhashindex];
7864 vertexhashtable[vertexhashindex] = i;
7867 loadmodel->surfmesh.data_element3i[elementindex++] = i;
7870 surfacetriangles = surfaceelements / 3;
7871 surface->num_vertices = surfacevertices;
7872 surface->num_triangles = surfacetriangles;
7873 surface->num_firstvertex = firstvertex;
7874 surface->num_firsttriangle = firsttriangle;
7875 firstvertex += surface->num_vertices;
7876 firsttriangle += surface->num_triangles;
7878 loadmodel->num_surfaces++;
7881 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7882 numvertices = firstvertex;
7883 loadmodel->data_surfaces = (msurface_t *)Mem_Realloc(loadmodel->mempool, tempsurfaces, loadmodel->num_surfaces * sizeof(msurface_t));
7884 tempsurfaces = NULL;
7886 // allocate storage for final mesh data
7887 loadmodel->num_textures = numtextures * loadmodel->numskins;
7888 loadmodel->num_texturesperskin = numtextures;
7889 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 *));
7890 loadmodel->brush.submodels = (dp_model_t **)data;data += loadmodel->brush.numsubmodels * sizeof(dp_model_t *);
7891 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
7892 loadmodel->data_textures = (texture_t *)data;data += loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t);
7893 loadmodel->surfmesh.num_vertices = numvertices;
7894 loadmodel->surfmesh.num_triangles = numtriangles;
7895 if (r_enableshadowvolumes.integer)
7896 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += numtriangles * sizeof(int[3]);
7897 loadmodel->surfmesh.data_vertex3f = (float *)data;data += numvertices * sizeof(float[3]);
7898 loadmodel->surfmesh.data_svector3f = (float *)data;data += numvertices * sizeof(float[3]);
7899 loadmodel->surfmesh.data_tvector3f = (float *)data;data += numvertices * sizeof(float[3]);
7900 loadmodel->surfmesh.data_normal3f = (float *)data;data += numvertices * sizeof(float[3]);
7901 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += numvertices * sizeof(float[2]);
7902 if (loadmodel->surfmesh.num_vertices <= 65536)
7903 loadmodel->surfmesh.data_element3s = (unsigned short *)data;data += loadmodel->surfmesh.num_triangles * sizeof(unsigned short[3]);
7905 for (j = 0;j < loadmodel->surfmesh.num_vertices;j++)
7907 VectorCopy(vertexhashdata[j].v, loadmodel->surfmesh.data_vertex3f + 3*j);
7908 VectorCopy(vertexhashdata[j].vn, loadmodel->surfmesh.data_normal3f + 3*j);
7909 Vector2Copy(vertexhashdata[j].vt, loadmodel->surfmesh.data_texcoordtexture2f + 2*j);
7912 // load the textures
7913 for (textureindex = 0;textureindex < numtextures;textureindex++)
7914 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures + textureindex, skinfiles, texturenames + textureindex*MAX_QPATH, texturenames + textureindex*MAX_QPATH);
7915 Mod_FreeSkinFiles(skinfiles);
7917 // set the surface textures to their real values now that we loaded them...
7918 for (i = 0;i < loadmodel->num_surfaces;i++)
7919 loadmodel->data_surfaces[i].texture = loadmodel->data_textures + (size_t)loadmodel->data_surfaces[i].texture;
7923 Mem_Free(texturenames);
7927 Mem_Free(vertexhashtable);
7928 Mem_Free(vertexhashdata);
7930 // make a single combined shadow mesh to allow optimized shadow volume creation
7931 Mod_Q1BSP_CreateShadowMesh(loadmodel);
7933 // compute all the mesh information that was not loaded from the file
7934 if (loadmodel->surfmesh.data_element3s)
7935 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
7936 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
7937 Mod_ValidateElements(loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles, 0, loadmodel->surfmesh.num_vertices, __FILE__, __LINE__);
7938 // generate normals if the file did not have them
7939 if (!VectorLength2(loadmodel->surfmesh.data_normal3f))
7940 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);
7941 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);
7942 if (loadmodel->surfmesh.data_neighbor3i)
7943 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
7945 // if this is a worldmodel and has no BSP tree, create a fake one for the purpose
7946 loadmodel->brush.num_visleafs = 1;
7947 loadmodel->brush.num_leafs = 1;
7948 loadmodel->brush.num_nodes = 0;
7949 loadmodel->brush.num_leafsurfaces = loadmodel->num_surfaces;
7950 loadmodel->brush.data_leafs = (mleaf_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
7951 loadmodel->brush.data_nodes = (mnode_t *)loadmodel->brush.data_leafs;
7952 loadmodel->brush.num_pvsclusters = 1;
7953 loadmodel->brush.num_pvsclusterbytes = 1;
7954 loadmodel->brush.data_pvsclusters = nobsp_pvs;
7955 //if (loadmodel->num_nodes) loadmodel->data_nodes = (mnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_nodes * sizeof(mnode_t));
7956 //loadmodel->data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->num_leafsurfaces * sizeof(int));
7957 loadmodel->brush.data_leafsurfaces = loadmodel->sortedmodelsurfaces;
7958 VectorCopy(loadmodel->normalmins, loadmodel->brush.data_leafs->mins);
7959 VectorCopy(loadmodel->normalmaxs, loadmodel->brush.data_leafs->maxs);
7960 loadmodel->brush.data_leafs->combinedsupercontents = 0; // FIXME?
7961 loadmodel->brush.data_leafs->clusterindex = 0;
7962 loadmodel->brush.data_leafs->areaindex = 0;
7963 loadmodel->brush.data_leafs->numleafsurfaces = loadmodel->brush.num_leafsurfaces;
7964 loadmodel->brush.data_leafs->firstleafsurface = loadmodel->brush.data_leafsurfaces;
7965 loadmodel->brush.data_leafs->numleafbrushes = 0;
7966 loadmodel->brush.data_leafs->firstleafbrush = NULL;
7967 loadmodel->brush.supportwateralpha = true;
7969 if (loadmodel->brush.numsubmodels)
7970 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7973 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7978 // duplicate the basic information
7979 dpsnprintf(name, sizeof(name), "*%i", i);
7980 mod = Mod_FindName(name, loadmodel->name);
7981 // copy the base model to this one
7983 // rename the clone back to its proper name
7984 strlcpy(mod->name, name, sizeof(mod->name));
7985 mod->brush.parentmodel = loadmodel;
7986 // textures and memory belong to the main model
7987 mod->texturepool = NULL;
7988 mod->mempool = NULL;
7989 mod->brush.GetPVS = NULL;
7990 mod->brush.FatPVS = NULL;
7991 mod->brush.BoxTouchingPVS = NULL;
7992 mod->brush.BoxTouchingLeafPVS = NULL;
7993 mod->brush.BoxTouchingVisibleLeafs = NULL;
7994 mod->brush.FindBoxClusters = NULL;
7995 mod->brush.LightPoint = NULL;
7996 mod->brush.AmbientSoundLevelsForPoint = NULL;
7998 mod->brush.submodel = i;
7999 if (loadmodel->brush.submodels)
8000 loadmodel->brush.submodels[i] = mod;
8002 // make the model surface list (used by shadowing/lighting)
8003 mod->firstmodelsurface = submodelfirstsurface[i];
8004 mod->nummodelsurfaces = submodelfirstsurface[i+1] - submodelfirstsurface[i];
8005 mod->firstmodelbrush = 0;
8006 mod->nummodelbrushes = 0;
8007 mod->sortedmodelsurfaces = loadmodel->sortedmodelsurfaces + mod->firstmodelsurface;
8008 Mod_MakeSortedSurfaces(mod);
8010 VectorClear(mod->normalmins);
8011 VectorClear(mod->normalmaxs);
8013 for (j = 0;j < mod->nummodelsurfaces;j++)
8015 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
8016 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
8018 if (!surface->num_vertices)
8023 VectorCopy(v, mod->normalmins);
8024 VectorCopy(v, mod->normalmaxs);
8026 for (k = 0;k < surface->num_vertices;k++, v += 3)
8028 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
8029 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
8030 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
8031 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
8032 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
8033 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
8036 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
8037 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
8038 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
8039 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
8040 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
8041 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
8042 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
8043 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
8044 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
8045 mod->yawmins[2] = mod->normalmins[2];
8046 mod->yawmaxs[2] = mod->normalmaxs[2];
8047 mod->radius = modelradius;
8048 mod->radius2 = modelradius * modelradius;
8050 // this gets altered below if sky or water is used
8051 mod->DrawSky = NULL;
8052 mod->DrawAddWaterPlanes = NULL;
8054 for (j = 0;j < mod->nummodelsurfaces;j++)
8055 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
8057 if (j < mod->nummodelsurfaces)
8058 mod->DrawSky = R_Q1BSP_DrawSky;
8060 for (j = 0;j < mod->nummodelsurfaces;j++)
8061 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
8063 if (j < mod->nummodelsurfaces)
8064 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
8066 Mod_MakeCollisionBIH(mod, true, &mod->collision_bih);
8067 mod->render_bih = mod->collision_bih;
8069 // generate VBOs and other shared data before cloning submodels
8074 Mem_Free(submodelfirstsurface);
8076 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);
8091 typedef struct objvertex_s
8099 typedef struct objtriangle_s
8101 objvertex_t vertex[3];
8103 // these fields are used only in conversion to surfaces
8106 int surfacevertexindex[3];
8107 float edgeplane[3][4];
8113 struct objnode_s *children[2];
8114 struct objnode_s *parent;
8115 objtriangle_t *triangles;
8124 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)
8130 float bestnormal[3];
8135 int numfronttriangles;
8136 int numbacktriangles;
8141 float outfrontpoints[5][3];
8142 float outbackpoints[5][3];
8143 int neededfrontpoints;
8144 int neededbackpoints;
8148 node = (objnode_t *)Mem_ExpandableArray_AllocRecord(array);
8149 node->parent = parent;
8152 VectorCopy(triangles[0].vertex[0].v, mins);
8153 VectorCopy(triangles[0].vertex[0].v, maxs);
8155 else if (parent && parent->children[0] == node)
8157 VectorCopy(parent->mins, mins);
8158 Vectorcopy(parent->maxs, maxs);
8160 else if (parent && parent->children[1] == node)
8162 VectorCopy(parent->mins, mins);
8163 Vectorcopy(parent->maxs, maxs);
8170 for (i = 0;i < numtriangles;i++)
8172 for (j = 0;j < 3;j++)
8174 mins[0] = min(mins[0], triangles[i].vertex[j].v[0]);
8175 mins[1] = min(mins[1], triangles[i].vertex[j].v[1]);
8176 mins[2] = min(mins[2], triangles[i].vertex[j].v[2]);
8177 maxs[0] = max(maxs[0], triangles[i].vertex[j].v[0]);
8178 maxs[1] = max(maxs[1], triangles[i].vertex[j].v[1]);
8179 maxs[2] = max(maxs[2], triangles[i].vertex[j].v[2]);
8182 VectorCopy(mins, node->mins);
8183 VectorCopy(maxs, node->maxs);
8184 if (numtriangles <= mod_obj_leaftriangles.integer)
8187 loadmodel->brush.num_leafs++;
8188 node->triangles = triangles;
8189 node->numtriangles = numtriangles;
8194 loadmodel->brush.num_nodes++;
8195 // pick a splitting plane from the various choices available to us...
8196 // early splits simply halve the interval
8198 VectorClear(bestnormal);
8200 if (numtriangles <= mod_obj_splitterlimit.integer)
8201 limit = numtriangles;
8204 for (i = -3;i < limit;i++)
8208 // first we try 3 axial splits (kdtree-like)
8210 VectorClear(normal);
8212 dist = (mins[j] + maxs[j]) * 0.5f;
8216 // then we try each triangle plane
8217 TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
8218 VectorNormalize(normal);
8219 dist = DotProduct(normal, triangles[i].vertex[0].v);
8220 // use positive axial values whenever possible
8221 if (normal[0] == -1)
8223 if (normal[1] == -1)
8225 if (normal[2] == -1)
8227 // skip planes that match the current best
8228 if (VectorCompare(normal, bestnormal) && dist == bestdist)
8235 for (j = 0;j < numtriangles;j++)
8237 dists[0] = DotProduct(normal, triangles[j].vertex[0].v) - dist;
8238 dists[1] = DotProduct(normal, triangles[j].vertex[1].v) - dist;
8239 dists[2] = DotProduct(normal, triangles[j].vertex[2].v) - dist;
8240 if (dists[0] < -DIST_EPSILON || dists[1] < -DIST_EPSILON || dists[2] < -DIST_EPSILON)
8242 if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
8247 else if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
8252 // score is supposed to:
8253 // prefer axial splits
8254 // prefer evenly dividing the input triangles
8255 // prefer triangles on the plane
8256 // avoid triangles crossing the plane
8257 score = count_on*count_on - count_both*count_both + min(count_front, count_back)*(count_front+count_back);
8258 if (normal[0] == 1 || normal[1] == 1 || normal[2] == 1)
8260 if (i == -3 || bestscore < score)
8262 VectorCopy(normal, bestnormal);
8268 // now we have chosen an optimal split plane...
8270 // divide triangles by the splitting plane
8271 numfronttriangles = 0;
8272 numbacktriangles = 0;
8273 for (i = 0;i < numtriangles;i++)
8275 neededfrontpoints = 0;
8276 neededbackpoints = 0;
8278 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);
8279 if (countonpoints > 1)
8281 // triangle lies on plane, assign it to one child only
8282 TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
8283 if (DotProduct(bestnormal, normal) >= 0)
8285 // assign to front side child
8286 obj_fronttriangles[numfronttriangles++] = triangles[i];
8290 // assign to back side child
8291 obj_backtriangles[numbacktriangles++] = triangles[i];
8296 // convert clipped polygons to triangles
8297 for (j = 0;j < neededfrontpoints-2;j++)
8299 obj_fronttriangles[numfronttriangles] = triangles[i];
8300 VectorCopy(outfrontpoints[0], obj_fronttriangles[numfronttriangles].vertex[0].v);
8301 VectorCopy(outfrontpoints[j+1], obj_fronttriangles[numfronttriangles].vertex[1].v);
8302 VectorCopy(outfrontpoints[j+2], obj_fronttriangles[numfronttriangles].vertex[2].v);
8303 numfronttriangles++;
8305 for (j = 0;j < neededbackpoints-2;j++)
8307 obj_backtriangles[numbacktriangles] = triangles[i];
8308 VectorCopy(outbackpoints[0], obj_backtriangles[numbacktriangles].vertex[0].v);
8309 VectorCopy(outbackpoints[j+1], obj_backtriangles[numbacktriangles].vertex[1].v);
8310 VectorCopy(outbackpoints[j+2], obj_backtriangles[numbacktriangles].vertex[2].v);
8316 // now copy the triangles out of the big buffer
8317 if (numfronttriangles)
8319 fronttriangles = Mem_Alloc(loadmodel->mempool, fronttriangles * sizeof(*fronttriangles));
8320 memcpy(fronttriangles, obj_fronttriangles, numfronttriangles * sizeof(*fronttriangles));
8323 fronttriangles = NULL;
8324 if (numbacktriangles)
8326 backtriangles = Mem_Alloc(loadmodel->mempool, backtriangles * sizeof(*backtriangles));
8327 memcpy(backtriangles, obj_backtriangles, numbacktriangles * sizeof(*backtriangles));
8330 backtriangles = NULL;
8332 // free the original triangles we were given
8334 Mem_Free(triangles);
8338 // now create the children...
8339 node->children[0] = Mod_OBJ_BSPNodeForTriangles(node, fronttriangles, numfronttriangles, frontmins, frontmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
8340 node->children[1] = Mod_OBJ_BSPNodeForTriangles(node, backtriangles, numbacktriangles, backmins, backmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
8344 void Mod_OBJ_SnapVertex(float *v)
8347 float a = mod_obj_vertexprecision.value;
8349 v[0] -= floor(v[0] * a + 0.5f) * b;
8350 v[1] -= floor(v[1] * a + 0.5f) * b;
8351 v[2] -= floor(v[2] * a + 0.5f) * b;
8354 void Mod_OBJ_ConvertBSPNode(objnode_t *objnode, mnode_t *mnodeparent)
8356 if (objnode->children[0])
8358 // convert to mnode_t
8359 mnode_t *mnode = loadmodel->brush.data_nodes + loadmodel->brush.num_nodes++;
8360 mnode->parent = mnodeparent;
8361 mnode->plane = loadmodel->brush.data_planes + loadmodel->brush.num_planes++;
8362 VectorCopy(objnode->normal, mnode->plane->normal);
8363 mnode->plane->dist = objnode->dist;
8364 PlaneClassify(mnode->plane);
8365 VectorCopy(objnode->mins, mnode->mins);
8366 VectorCopy(objnode->maxs, mnode->maxs);
8367 // push combinedsupercontents up to the parent
8369 mnodeparent->combinedsupercontents |= mnode->combinedsupercontents;
8370 mnode->children[0] = Mod_OBJ_ConvertBSPNode(objnode->children[0], mnode);
8371 mnode->children[1] = Mod_OBJ_ConvertBSPNode(objnode->children[1], mnode);
8375 // convert to mleaf_t
8376 mleaf_t *mleaf = loadmodel->brush.data_leafs + loadmodel->brush.num_leafs++;
8377 mleaf->parent = mnodeparent;
8378 VectorCopy(objnode->mins, mleaf->mins);
8379 VectorCopy(objnode->maxs, mleaf->maxs);
8380 mleaf->clusterindex = loadmodel->brush.num_leafs - 1;
8381 if (objnode->numtriangles)
8383 objtriangle_t *triangles = objnode->triangles;
8384 int numtriangles = objnode->numtriangles;
8388 objvertex_t vertex[3];
8390 maxsurfaces = numtriangles;
8392 // calculate some more data on each triangle for surface gathering
8393 for (i = 0;i < numtriangles;i++)
8395 triangle = triangles + i;
8396 texture = loadmodel->data_textures + triangle->textureindex;
8397 Mod_OBJ_SnapVertex(triangle->vertex[0].v);
8398 Mod_OBJ_SnapVertex(triangle->vertex[1].v);
8399 Mod_OBJ_SnapVertex(triangle->vertex[2].v);
8400 TriangleNormal(triangle->vertex[0].v, triangle->vertex[1].v, triangle->vertex[2].v, normal);
8402 if (fabs(normal[axis]) < fabs(normal[1]))
8404 if (fabs(normal[axis]) < fabs(normal[2]))
8406 VectorClear(normal);
8408 triangle->axis = axis;
8409 VectorSubtract(triangle->vertex[1].v, triangle->vertex[0].v, edge[0]);
8410 VectorSubtract(triangle->vertex[2].v, triangle->vertex[1].v, edge[1]);
8411 VectorSubtract(triangle->vertex[0].v, triangle->vertex[2].v, edge[2]);
8412 CrossProduct(edge[0], normal, triangle->edgeplane[0]);
8413 CrossProduct(edge[1], normal, triangle->edgeplane[1]);
8414 CrossProduct(edge[2], normal, triangle->edgeplane[2]);
8415 VectorNormalize(triangle->edgeplane[0]);
8416 VectorNormalize(triangle->edgeplane[1]);
8417 VectorNormalize(triangle->edgeplane[2]);
8418 triangle->edgeplane[0][3] = DotProduct(triangle->edgeplane[0], triangle->vertex[0].v);
8419 triangle->edgeplane[1][3] = DotProduct(triangle->edgeplane[1], triangle->vertex[1].v);
8420 triangle->edgeplane[2][3] = DotProduct(triangle->edgeplane[2], triangle->vertex[2].v);
8421 triangle->surfaceindex = 0;
8422 // add to the combined supercontents while we're here...
8423 mleaf->combinedsupercontents |= texture->supercontents;
8426 for (i = 0;i < numtriangles;i++)
8428 // skip already-assigned triangles
8429 if (triangles[i].surfaceindex)
8431 texture = loadmodel->data_textures + triangles[i].textureindex;
8432 // assign a new surface to this triangle
8433 triangles[i].surfaceindex = surfaceindex++;
8434 axis = triangles[i].axis;
8436 // find the triangle's neighbors, this can take multiple passes
8441 for (j = i+1;j < numtriangles;j++)
8443 if (triangles[j].surfaceindex || triangles[j].axis != axis || triangles[j].texture != texture)
8445 triangle = triangles + j;
8446 for (k = i;k < j;k++)
8448 if (triangles[k].surfaceindex != surfaceindex)
8450 if (VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[0].v)
8451 || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[1].v)
8452 || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[2].v)
8453 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[0].v)
8454 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[1].v)
8455 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[2].v)
8456 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[0].v)
8457 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[1].v)
8458 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[2].v))
8460 // shares a vertex position
8464 for (k = 0;k < numvertices;k++)
8465 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))
8467 if (k == numvertices)
8468 break; // not a neighbor
8469 // this triangle is a neighbor and has the same axis and texture
8470 // check now if it overlaps in lightmap projection space
8471 triangles[j].surfaceindex;
8475 //triangles[i].surfaceindex = surfaceindex++;
8476 for (surfaceindex = 0;surfaceindex < numsurfaces;surfaceindex++)
8478 if (surfaces[surfaceindex].texture != texture)
8480 // check if any triangles already in this surface overlap in lightmap projection space
8487 // let the collision code simply use the surfaces
8488 mleaf->containscollisionsurfaces = mleaf->combinedsupercontents != 0;
8489 mleaf->numleafsurfaces = ?;
8490 mleaf->firstleafsurface = ?;
8492 // push combinedsupercontents up to the parent
8494 mnodeparent->combinedsupercontents |= mleaf->combinedsupercontents;
8499 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
8502 const char *textbase = (char *)buffer, *text = textbase;
8506 char materialname[MAX_QPATH];
8507 int j, index1, index2, index3, first, prev, index;
8510 int numtriangles = 0;
8511 int maxtriangles = 131072;
8512 objtriangle_t *triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
8514 int maxtextures = 256, numtextures = 0, textureindex = 0;
8515 int maxv = 1024, numv = 0;
8516 int maxvt = 1024, numvt = 0;
8517 int maxvn = 1024, numvn = 0;
8518 char **texturenames;
8519 float *v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
8520 float *vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
8521 float *vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
8522 objvertex_t vfirst, vprev, vcurrent;
8527 int maxverthash = 65536, numverthash = 0;
8528 int numhashindex = 65536;
8529 struct objverthash_s
8531 struct objverthash_s *next;
8537 *hash, **verthash = Mem_Alloc(tempmempool, numhashindex * sizeof(*verthash)), *verthashdata = Mem_Alloc(tempmempool, maxverthash * sizeof(*verthashdata)), *oldverthashdata;
8540 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
8542 loadmodel->modeldatatypestring = "OBJ";
8544 loadmodel->type = mod_obj;
8545 loadmodel->soundfromcenter = true;
8546 loadmodel->TraceBox = Mod_OBJ_TraceBox;
8547 loadmodel->TraceLine = Mod_OBJ_TraceLine;
8548 loadmodel->TracePoint = Mod_OBJ_TracePoint;
8549 loadmodel->PointSuperContents = Mod_OBJ_PointSuperContents;
8550 loadmodel->TraceLineAgainstSurfaces = Mod_OBJ_TraceLineAgainstSurfaces;
8551 loadmodel->brush.TraceLineOfSight = Mod_OBJ_TraceLineOfSight;
8552 loadmodel->brush.SuperContentsFromNativeContents = Mod_OBJ_SuperContentsFromNativeContents;
8553 loadmodel->brush.NativeContentsFromSuperContents = Mod_OBJ_NativeContentsFromSuperContents;
8554 loadmodel->brush.GetPVS = Mod_OBJ_GetPVS;
8555 loadmodel->brush.FatPVS = Mod_OBJ_FatPVS;
8556 loadmodel->brush.BoxTouchingPVS = Mod_OBJ_BoxTouchingPVS;
8557 loadmodel->brush.BoxTouchingLeafPVS = Mod_OBJ_BoxTouchingLeafPVS;
8558 loadmodel->brush.BoxTouchingVisibleLeafs = Mod_OBJ_BoxTouchingVisibleLeafs;
8559 loadmodel->brush.FindBoxClusters = Mod_OBJ_FindBoxClusters;
8560 loadmodel->brush.LightPoint = Mod_OBJ_LightPoint;
8561 loadmodel->brush.FindNonSolidLocation = Mod_OBJ_FindNonSolidLocation;
8562 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
8563 loadmodel->brush.RoundUpToHullSize = NULL;
8564 loadmodel->brush.PointInLeaf = Mod_OBJ_PointInLeaf;
8565 loadmodel->Draw = R_Q1BSP_Draw;
8566 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
8567 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
8568 loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
8569 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
8570 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
8571 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
8572 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
8573 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
8574 loadmodel->DrawLight = R_Q1BSP_DrawLight;
8579 // parse the OBJ text now
8586 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
8587 line[linelen] = text[linelen];
8589 for (argc = 0;argc < (int)(sizeof(argv)/sizeof(argv[0]));argc++)
8593 while (*s == ' ' || *s == '\t')
8603 while (*s == ' ' || *s == '\t')
8608 if (argv[0][0] == '#')
8610 if (!strcmp(argv[0], "v"))
8616 v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
8619 memcpy(v, oldv, numv * sizeof(float[3]));
8623 v[numv*3+0] = atof(argv[1]);
8624 v[numv*3+1] = atof(argv[2]);
8625 v[numv*3+2] = atof(argv[3]);
8628 else if (!strcmp(argv[0], "vt"))
8634 vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
8637 memcpy(vt, oldvt, numvt * sizeof(float[2]));
8641 vt[numvt*2+0] = atof(argv[1]);
8642 vt[numvt*2+1] = atof(argv[2]);
8645 else if (!strcmp(argv[0], "vn"))
8651 vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
8654 memcpy(vn, oldvn, numvn * sizeof(float[3]));
8658 vn[numvn*3+0] = atof(argv[1]);
8659 vn[numvn*3+1] = atof(argv[2]);
8660 vn[numvn*3+2] = atof(argv[3]);
8663 else if (!strcmp(argv[0], "f"))
8665 for (j = 1;j < argc;j++)
8667 index1 = atoi(argv[j]);
8668 while(argv[j][0] && argv[j][0] != '/')
8672 index2 = atoi(argv[j]);
8673 while(argv[j][0] && argv[j][0] != '/')
8677 index3 = atoi(argv[j]);
8678 // negative refers to a recent vertex
8679 // zero means not specified
8680 // positive means an absolute vertex index
8682 index1 = numv - index1;
8684 index2 = numvt - index2;
8686 index3 = numvn - index3;
8687 VectorCopy(v + 3*index1, vcurrent.v);
8688 Vector2Copy(vt + 2*index2, vcurrent.vt);
8689 VectorCopy(vn + 3*index3, vcurrent.vn);
8690 if (numtriangles == 0)
8692 VectorCopy(vcurrent.v, mins);
8693 VectorCopy(vcurrent.v, maxs);
8697 mins[0] = min(mins[0], vcurrent.v[0]);
8698 mins[1] = min(mins[1], vcurrent.v[1]);
8699 mins[2] = min(mins[2], vcurrent.v[2]);
8700 maxs[0] = max(maxs[0], vcurrent.v[0]);
8701 maxs[1] = max(maxs[1], vcurrent.v[1]);
8702 maxs[2] = max(maxs[2], vcurrent.v[2]);
8708 if (maxtriangles <= numtriangles)
8710 objtriangle_t *oldtriangles = triangles;
8712 triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
8715 memcpy(triangles, oldtriangles, maxtriangles * sizeof(*triangles));
8716 Mem_Free(oldtriangles);
8719 triangles[numtriangles].textureindex = textureindex;
8720 triangles[numtriangles].vertex[0] = vfirst;
8721 triangles[numtriangles].vertex[1] = vprev;
8722 triangles[numtriangles].vertex[2] = vcurrent;
8729 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
8731 else if (!!strcmp(argv[0], "usemtl"))
8733 for (i = 0;i < numtextures;i++)
8734 if (!strcmp(texturenames[numtextures], argv[1]))
8736 if (i < numtextures)
8737 texture = textures + i;
8740 if (maxtextures <= numtextures)
8742 texture_t *oldtextures = textures;
8744 textures = Mem_Alloc(tempmempool, maxtextures * sizeof(*textures));
8747 memcpy(textures, oldtextures, numtextures * sizeof(*textures));
8748 Mem_Free(oldtextures);
8751 textureindex = numtextures++;
8752 texturenames[textureindex] = Mem_Alloc(tempmempool, strlen(argv[1]) + 1);
8753 memcpy(texturenames[textureindex], argv[1], strlen(argv[1]) + 1);
8763 // now that we have the OBJ data loaded as-is, we can convert it
8765 // load the textures
8766 loadmodel->num_textures = numtextures;
8767 loadmodel->data_textures = Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
8768 for (i = 0;i < numtextures;i++)
8769 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, texturenames[i], true, true, TEXF_MIPMAP | TEXF_ALPHA | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS);
8771 // free the texturenames array since we are now done with it
8772 for (i = 0;i < numtextures;i++)
8774 Mem_Free(texturenames[i]);
8775 texturenames[i] = NULL;
8777 Mem_Free(texturenames);
8778 texturenames = NULL;
8780 // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
8781 VectorCopy(mins, loadmodel->normalmins);
8782 VectorCopy(maxs, loadmodel->normalmaxs);
8783 dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
8784 modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
8785 modelyawradius = dist*dist+modelyawradius*modelyawradius;
8786 modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
8787 modelradius = modelyawradius + modelradius * modelradius;
8788 modelyawradius = sqrt(modelyawradius);
8789 modelradius = sqrt(modelradius);
8790 loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
8791 loadmodel->yawmins[2] = loadmodel->normalmins[2];
8792 loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] = modelyawradius;
8793 loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
8794 loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
8795 loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] = modelradius;
8796 loadmodel->radius = modelradius;
8797 loadmodel->radius2 = modelradius * modelradius;
8799 // make sure the temp triangle buffer is big enough for BSP building
8800 maxclippedtriangles = numtriangles*4;
8801 if (numtriangles > 0)
8803 clippedfronttriangles = Mem_Alloc(loadmodel->mempool, maxclippedtriangles * 2 * sizeof(objtriangle_t));
8804 clippedbacktriangles = clippedfronttriangles + maxclippedtriangles;
8807 // 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
8808 loadmodel->brush.num_leafs = 0;
8809 loadmodel->brush.num_nodes = 0;
8810 Mem_ExpandableArray_NewArray(&nodesarray, loadmodel->mempool, sizeof(objnode_t), 1024);
8811 rootnode = Mod_OBJ_BSPNodeForTriangles(triangles, numtriangles, mins, maxs, &nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
8813 // convert the BSP tree to mnode_t and mleaf_t structures and convert the triangles to msurface_t...
8814 loadmodel->brush.data_leafs = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
8815 loadmodel->brush.data_nodes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mnode_t));
8816 loadmodel->brush.data_planes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mplane_t));
8817 loadmodel->brush.num_leafs = 0;
8818 loadmodel->brush.num_nodes = 0;
8819 loadmodel->brush.num_planes = 0;
8820 Mod_OBJ_ConvertAndFreeBSPNode(rootnode);
8822 if (clippedfronttriangles)
8823 Mem_Free(clippedfronttriangles);
8824 maxclippedtriangles = 0;
8825 clippedfronttriangles = NULL;
8826 clippedbacktriangles = NULL;
8828 --- NOTHING DONE PAST THIS POINT ---
8830 loadmodel->numskins = LittleLong(pinmodel->num_skins);
8831 numxyz = LittleLong(pinmodel->num_xyz);
8832 numst = LittleLong(pinmodel->num_st);
8833 loadmodel->surfmesh.num_triangles = LittleLong(pinmodel->num_tris);
8834 loadmodel->numframes = LittleLong(pinmodel->num_frames);
8835 loadmodel->surfmesh.num_morphframes = loadmodel->numframes;
8836 loadmodel->num_poses = loadmodel->surfmesh.num_morphframes;
8837 skinwidth = LittleLong(pinmodel->skinwidth);
8838 skinheight = LittleLong(pinmodel->skinheight);
8839 iskinwidth = 1.0f / skinwidth;
8840 iskinheight = 1.0f / skinheight;
8842 loadmodel->num_surfaces = 1;
8843 loadmodel->nummodelsurfaces = loadmodel->num_surfaces;
8844 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));
8845 loadmodel->data_surfaces = (msurface_t *)data;data += loadmodel->num_surfaces * sizeof(msurface_t);
8846 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
8847 loadmodel->sortedmodelsurfaces[0] = 0;
8848 loadmodel->animscenes = (animscene_t *)data;data += loadmodel->numframes * sizeof(animscene_t);
8849 loadmodel->surfmesh.data_morphmd2framesize6f = (float *)data;data += loadmodel->numframes * sizeof(float[6]);
8850 loadmodel->surfmesh.data_element3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
8851 if (r_enableshadowvolumes.integer)
8852 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
8854 loadmodel->synctype = ST_RAND;
8857 inskin = (char *)(base + LittleLong(pinmodel->ofs_skins));
8858 skinfiles = Mod_LoadSkinFiles();
8861 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
8862 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
8863 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
8864 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures, skinfiles, "default", "");
8865 Mod_FreeSkinFiles(skinfiles);
8867 else if (loadmodel->numskins)
8869 // skins found (most likely not a player model)
8870 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
8871 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
8872 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
8873 for (i = 0;i < loadmodel->numskins;i++, inskin += MD2_SKINNAME)
8874 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i * loadmodel->num_surfaces, inskin, true, true, (r_mipskins.integer ? TEXF_MIPMAP : 0) | TEXF_ALPHA | TEXF_PICMIP | TEXF_COMPRESS);
8878 // no skins (most likely a player model)
8879 loadmodel->numskins = 1;
8880 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
8881 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
8882 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
8883 Mod_BuildAliasSkinFromSkinFrame(loadmodel->data_textures, NULL);
8886 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
8887 for (i = 0;i < loadmodel->numskins;i++)
8889 loadmodel->skinscenes[i].firstframe = i;
8890 loadmodel->skinscenes[i].framecount = 1;
8891 loadmodel->skinscenes[i].loop = true;
8892 loadmodel->skinscenes[i].framerate = 10;
8895 // load the triangles and stvert data
8896 inst = (unsigned short *)(base + LittleLong(pinmodel->ofs_st));
8897 intri = (md2triangle_t *)(base + LittleLong(pinmodel->ofs_tris));
8898 md2verthash = (struct md2verthash_s **)Mem_Alloc(tempmempool, 65536 * sizeof(hash));
8899 md2verthashdata = (struct md2verthash_s *)Mem_Alloc(tempmempool, loadmodel->surfmesh.num_triangles * 3 * sizeof(*hash));
8900 // swap the triangle list
8901 loadmodel->surfmesh.num_vertices = 0;
8902 for (i = 0;i < loadmodel->surfmesh.num_triangles;i++)
8904 for (j = 0;j < 3;j++)
8906 xyz = (unsigned short) LittleShort (intri[i].index_xyz[j]);
8907 st = (unsigned short) LittleShort (intri[i].index_st[j]);
8910 Con_Printf("%s has an invalid xyz index (%i) on triangle %i, resetting to 0\n", loadmodel->name, xyz, i);
8915 Con_Printf("%s has an invalid st index (%i) on triangle %i, resetting to 0\n", loadmodel->name, st, i);
8918 hashindex = (xyz * 256 + st) & 65535;
8919 for (hash = md2verthash[hashindex];hash;hash = hash->next)
8920 if (hash->xyz == xyz && hash->st == st)
8924 hash = md2verthashdata + loadmodel->surfmesh.num_vertices++;
8927 hash->next = md2verthash[hashindex];
8928 md2verthash[hashindex] = hash;
8930 loadmodel->surfmesh.data_element3i[i*3+j] = (hash - md2verthashdata);
8934 vertremap = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(int));
8935 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));
8936 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += loadmodel->surfmesh.num_vertices * sizeof(float[2]);
8937 loadmodel->surfmesh.data_morphmdlvertex = (trivertx_t *)data;data += loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t);
8938 for (i = 0;i < loadmodel->surfmesh.num_vertices;i++)
8941 hash = md2verthashdata + i;
8942 vertremap[i] = hash->xyz;
8943 sts = LittleShort(inst[hash->st*2+0]);
8944 stt = LittleShort(inst[hash->st*2+1]);
8945 if (sts < 0 || sts >= skinwidth || stt < 0 || stt >= skinheight)
8947 Con_Printf("%s has an invalid skin coordinate (%i %i) on vert %i, changing to 0 0\n", loadmodel->name, sts, stt, i);
8951 loadmodel->surfmesh.data_texcoordtexture2f[i*2+0] = sts * iskinwidth;
8952 loadmodel->surfmesh.data_texcoordtexture2f[i*2+1] = stt * iskinheight;
8955 Mem_Free(md2verthash);
8956 Mem_Free(md2verthashdata);
8958 // generate ushort elements array if possible
8959 if (loadmodel->surfmesh.num_vertices <= 65536)
8960 loadmodel->surfmesh.data_element3s = (unsigned short *)Mem_Alloc(loadmodel->mempool, sizeof(unsigned short[3]) * loadmodel->surfmesh.num_triangles);
8963 datapointer = (base + LittleLong(pinmodel->ofs_frames));
8964 for (i = 0;i < loadmodel->surfmesh.num_morphframes;i++)
8969 pinframe = (md2frame_t *)datapointer;
8970 datapointer += sizeof(md2frame_t);
8971 // store the frame scale/translate into the appropriate array
8972 for (j = 0;j < 3;j++)
8974 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+j] = LittleFloat(pinframe->scale[j]);
8975 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+3+j] = LittleFloat(pinframe->translate[j]);
8977 // convert the vertices
8978 v = (trivertx_t *)datapointer;
8979 out = loadmodel->surfmesh.data_morphmdlvertex + i * loadmodel->surfmesh.num_vertices;
8980 for (k = 0;k < loadmodel->surfmesh.num_vertices;k++)
8981 out[k] = v[vertremap[k]];
8982 datapointer += numxyz * sizeof(trivertx_t);
8984 strlcpy(loadmodel->animscenes[i].name, pinframe->name, sizeof(loadmodel->animscenes[i].name));
8985 loadmodel->animscenes[i].firstframe = i;
8986 loadmodel->animscenes[i].framecount = 1;
8987 loadmodel->animscenes[i].framerate = 10;
8988 loadmodel->animscenes[i].loop = true;
8991 Mem_Free(vertremap);
8993 Mod_MakeSortedSurfaces(loadmodel);
8994 if (loadmodel->surfmesh.data_neighbor3i)
8995 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
8996 Mod_Alias_CalculateBoundingBox();
8997 Mod_Alias_MorphMesh_CompileFrames();
8999 surface = loadmodel->data_surfaces;
9000 surface->texture = loadmodel->data_textures;
9001 surface->num_firsttriangle = 0;
9002 surface->num_triangles = loadmodel->surfmesh.num_triangles;
9003 surface->num_firstvertex = 0;
9004 surface->num_vertices = loadmodel->surfmesh.num_vertices;
9006 loadmodel->surfmesh.isanimated = false;
9008 if (loadmodel->surfmesh.data_element3s)
9009 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
9010 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
9013 #endif // !OBJASMODEL
9015 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
9017 // we already have done PVS culling at this point...
9018 // so we don't need to do it again.
9021 vec3_t testorigin, mins, maxs;
9023 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
9024 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
9025 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
9027 if(model->brush.TraceLineOfSight(model, eye, testorigin))
9030 // expand the box a little
9031 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
9032 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
9033 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
9034 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
9035 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
9036 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
9038 for(i = 0; i != numsamples; ++i)
9040 testorigin[0] = lhrandom(mins[0], maxs[0]);
9041 testorigin[1] = lhrandom(mins[1], maxs[1]);
9042 testorigin[2] = lhrandom(mins[2], maxs[2]);
9044 if(model->brush.TraceLineOfSight(model, eye, testorigin))