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_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"};
57 static texture_t mod_q1bsp_texture_solid;
58 static texture_t mod_q1bsp_texture_sky;
59 static texture_t mod_q1bsp_texture_lava;
60 static texture_t mod_q1bsp_texture_slime;
61 static texture_t mod_q1bsp_texture_water;
63 void Mod_BrushInit(void)
65 // Cvar_RegisterVariable(&r_subdivide_size);
66 Cvar_RegisterVariable(&mod_bsp_portalize);
67 Cvar_RegisterVariable(&r_novis);
68 Cvar_RegisterVariable(&r_nosurftextures);
69 Cvar_RegisterVariable(&r_subdivisions_tolerance);
70 Cvar_RegisterVariable(&r_subdivisions_mintess);
71 Cvar_RegisterVariable(&r_subdivisions_maxtess);
72 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
73 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
74 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
75 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
76 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
77 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
78 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
79 Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
80 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
81 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
82 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
83 Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
84 Cvar_RegisterVariable(&mod_q3bsp_tracelineofsight_brushes);
85 Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping);
86 Cvar_RegisterVariable(&mod_q3shader_default_polygonfactor);
87 Cvar_RegisterVariable(&mod_q3shader_default_polygonoffset);
88 Cvar_RegisterVariable(&mod_q1bsp_polygoncollisions);
89 Cvar_RegisterVariable(&mod_collision_bih);
90 Cvar_RegisterVariable(&mod_recalculatenodeboxes);
92 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
93 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
94 mod_q1bsp_texture_solid.surfaceflags = 0;
95 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
97 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
98 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
99 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
100 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
102 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
103 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
104 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
105 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
107 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
108 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
109 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
110 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
112 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
113 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
114 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
115 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
118 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
125 // LordHavoc: modified to start at first clip node,
126 // in other words: first node of the (sub)model
127 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
129 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
131 return (mleaf_t *)node;
134 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
138 leaf = Mod_Q1BSP_PointInLeaf(model, p);
141 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
144 memcpy(out, leaf->ambient_sound_level, i);
150 memset(out, 0, outsize);
153 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
156 int nodestackindex = 0;
157 mnode_t *node, *nodestack[1024];
158 if (!model->brush.num_pvsclusters)
160 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
166 // node - recurse down the BSP tree
167 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
171 return -1; // ERROR: NAN bounding box!
172 // box is on one side of plane, take that path
173 node = node->children[sides-1];
177 // box crosses plane, take one path and remember the other
178 if (nodestackindex < 1024)
179 nodestack[nodestackindex++] = node->children[0];
180 node = node->children[1];
186 // leaf - add clusterindex to list
187 if (numclusters < maxclusters)
188 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
192 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
196 if (nodestackindex < 1024)
197 nodestack[nodestackindex++] = node->children[0];
198 node = node->children[1];
203 // leaf - add clusterindex to list
204 if (numclusters < maxclusters)
205 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
210 // try another path we didn't take earlier
211 if (nodestackindex == 0)
213 node = nodestack[--nodestackindex];
215 // return number of clusters found (even if more than the maxclusters)
219 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
221 int nodestackindex = 0;
222 mnode_t *node, *nodestack[1024];
223 if (!model->brush.num_pvsclusters)
225 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
231 // node - recurse down the BSP tree
232 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
236 return -1; // ERROR: NAN bounding box!
237 // box is on one side of plane, take that path
238 node = node->children[sides-1];
242 // box crosses plane, take one path and remember the other
243 if (nodestackindex < 1024)
244 nodestack[nodestackindex++] = node->children[0];
245 node = node->children[1];
251 // leaf - check cluster bit
252 int clusterindex = ((mleaf_t *)node)->clusterindex;
253 if (CHECKPVSBIT(pvs, clusterindex))
255 // it is visible, return immediately with the news
260 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
264 if (nodestackindex < 1024)
265 nodestack[nodestackindex++] = node->children[0];
266 node = node->children[1];
271 // leaf - check cluster bit
272 int clusterindex = ((mleaf_t *)node)->clusterindex;
273 if (CHECKPVSBIT(pvs, clusterindex))
275 // it is visible, return immediately with the news
281 // nothing to see here, try another path we didn't take earlier
282 if (nodestackindex == 0)
284 node = nodestack[--nodestackindex];
290 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
292 int nodestackindex = 0;
293 mnode_t *node, *nodestack[1024];
294 if (!model->brush.num_leafs)
296 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
302 // node - recurse down the BSP tree
303 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
307 return -1; // ERROR: NAN bounding box!
308 // box is on one side of plane, take that path
309 node = node->children[sides-1];
313 // box crosses plane, take one path and remember the other
314 if (nodestackindex < 1024)
315 nodestack[nodestackindex++] = node->children[0];
316 node = node->children[1];
322 // leaf - check cluster bit
323 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
324 if (CHECKPVSBIT(pvs, clusterindex))
326 // it is visible, return immediately with the news
331 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
335 if (nodestackindex < 1024)
336 nodestack[nodestackindex++] = node->children[0];
337 node = node->children[1];
342 // leaf - check cluster bit
343 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
344 if (CHECKPVSBIT(pvs, clusterindex))
346 // it is visible, return immediately with the news
352 // nothing to see here, try another path we didn't take earlier
353 if (nodestackindex == 0)
355 node = nodestack[--nodestackindex];
361 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
363 int nodestackindex = 0;
364 mnode_t *node, *nodestack[1024];
365 if (!model->brush.num_leafs)
367 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
373 // node - recurse down the BSP tree
374 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
378 return -1; // ERROR: NAN bounding box!
379 // box is on one side of plane, take that path
380 node = node->children[sides-1];
384 // box crosses plane, take one path and remember the other
385 if (nodestackindex < 1024)
386 nodestack[nodestackindex++] = node->children[0];
387 node = node->children[1];
393 // leaf - check if it is visible
394 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
396 // it is visible, return immediately with the news
401 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
405 if (nodestackindex < 1024)
406 nodestack[nodestackindex++] = node->children[0];
407 node = node->children[1];
412 // leaf - check if it is visible
413 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
415 // it is visible, return immediately with the news
421 // nothing to see here, try another path we didn't take earlier
422 if (nodestackindex == 0)
424 node = nodestack[--nodestackindex];
430 typedef struct findnonsolidlocationinfo_s
433 vec3_t absmin, absmax;
439 findnonsolidlocationinfo_t;
441 static void Mod_Q1BSP_FindNonSolidLocation_r_Triangle(findnonsolidlocationinfo_t *info, msurface_t *surface, int k)
444 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
446 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
447 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
448 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
449 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
450 VectorSubtract(vert[1], vert[0], edge[0]);
451 VectorSubtract(vert[2], vert[1], edge[1]);
452 CrossProduct(edge[1], edge[0], facenormal);
453 if (facenormal[0] || facenormal[1] || facenormal[2])
455 VectorNormalize(facenormal);
456 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
457 if (f <= info->bestdist && f >= -info->bestdist)
459 VectorSubtract(vert[0], vert[2], edge[2]);
460 VectorNormalize(edge[0]);
461 VectorNormalize(edge[1]);
462 VectorNormalize(edge[2]);
463 CrossProduct(facenormal, edge[0], edgenormal[0]);
464 CrossProduct(facenormal, edge[1], edgenormal[1]);
465 CrossProduct(facenormal, edge[2], edgenormal[2]);
467 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
468 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
469 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
471 // we got lucky, the center is within the face
472 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
476 if (info->bestdist > dist)
478 info->bestdist = dist;
479 VectorScale(facenormal, (info->radius - -dist), info->nudge);
484 if (info->bestdist > dist)
486 info->bestdist = dist;
487 VectorScale(facenormal, (info->radius - dist), info->nudge);
493 // check which edge or vertex the center is nearest
494 for (i = 0;i < 3;i++)
496 f = DotProduct(info->center, edge[i]);
497 if (f >= DotProduct(vert[0], edge[i])
498 && f <= DotProduct(vert[1], edge[i]))
501 VectorMA(info->center, -f, edge[i], point);
502 dist = sqrt(DotProduct(point, point));
503 if (info->bestdist > dist)
505 info->bestdist = dist;
506 VectorScale(point, (info->radius / dist), info->nudge);
508 // skip both vertex checks
509 // (both are further away than this edge)
514 // not on edge, check first vertex of edge
515 VectorSubtract(info->center, vert[i], point);
516 dist = sqrt(DotProduct(point, point));
517 if (info->bestdist > dist)
519 info->bestdist = dist;
520 VectorScale(point, (info->radius / dist), info->nudge);
529 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
531 int surfacenum, k, *mark;
533 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
535 surface = info->model->data_surfaces + *mark;
536 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
538 if(surface->deprecatedq3num_bboxstride > 0)
541 cnt = (surface->num_triangles + surface->deprecatedq3num_bboxstride - 1) / surface->deprecatedq3num_bboxstride;
542 for(i = 0; i < cnt; ++i)
544 if(BoxesOverlap(surface->deprecatedq3data_bbox6f + i * 6, surface->deprecatedq3data_bbox6f + i * 6 + 3, info->absmin, info->absmax))
546 for(k = 0; k < surface->deprecatedq3num_bboxstride; ++k)
548 tri = i * surface->deprecatedq3num_bboxstride + k;
549 if(tri >= surface->num_triangles)
551 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, tri);
558 for (k = 0;k < surface->num_triangles;k++)
560 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, k);
567 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
571 float f = PlaneDiff(info->center, node->plane);
572 if (f >= -info->bestdist)
573 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
574 if (f <= info->bestdist)
575 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
579 if (((mleaf_t *)node)->numleafsurfaces)
580 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
584 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
587 findnonsolidlocationinfo_t info;
593 VectorCopy(in, info.center);
594 info.radius = radius;
599 VectorClear(info.nudge);
600 info.bestdist = radius;
601 VectorCopy(info.center, info.absmin);
602 VectorCopy(info.center, info.absmax);
603 info.absmin[0] -= info.radius + 1;
604 info.absmin[1] -= info.radius + 1;
605 info.absmin[2] -= info.radius + 1;
606 info.absmax[0] += info.radius + 1;
607 info.absmax[1] += info.radius + 1;
608 info.absmax[2] += info.radius + 1;
609 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
610 VectorAdd(info.center, info.nudge, info.center);
612 while (info.bestdist < radius && ++i < 10);
613 VectorCopy(info.center, out);
616 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
618 switch(nativecontents)
623 return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
625 return SUPERCONTENTS_WATER;
627 return SUPERCONTENTS_SLIME;
629 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
631 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
636 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
638 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
639 return CONTENTS_SOLID;
640 if (supercontents & SUPERCONTENTS_SKY)
642 if (supercontents & SUPERCONTENTS_LAVA)
643 return CONTENTS_LAVA;
644 if (supercontents & SUPERCONTENTS_SLIME)
645 return CONTENTS_SLIME;
646 if (supercontents & SUPERCONTENTS_WATER)
647 return CONTENTS_WATER;
648 return CONTENTS_EMPTY;
651 typedef struct RecursiveHullCheckTraceInfo_s
653 // the hull we're tracing through
656 // the trace structure to fill in
659 // start, end, and end - start (in model space)
664 RecursiveHullCheckTraceInfo_t;
666 // 1/32 epsilon to keep floating point happy
667 #define DIST_EPSILON (0.03125)
669 #define HULLCHECKSTATE_EMPTY 0
670 #define HULLCHECKSTATE_SOLID 1
671 #define HULLCHECKSTATE_DONE 2
673 extern cvar_t collision_prefernudgedfraction;
674 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
676 // status variables, these don't need to be saved on the stack when
677 // recursing... but are because this should be thread-safe
678 // (note: tracing against a bbox is not thread-safe, yet)
683 // variables that need to be stored on the stack when recursing
688 // LordHavoc: a goto! everyone flee in terror... :)
693 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
694 if (!t->trace->startfound)
696 t->trace->startfound = true;
697 t->trace->startsupercontents |= num;
699 if (num & SUPERCONTENTS_LIQUIDSMASK)
700 t->trace->inwater = true;
702 t->trace->inopen = true;
703 if (num & SUPERCONTENTS_SOLID)
704 t->trace->hittexture = &mod_q1bsp_texture_solid;
705 else if (num & SUPERCONTENTS_SKY)
706 t->trace->hittexture = &mod_q1bsp_texture_sky;
707 else if (num & SUPERCONTENTS_LAVA)
708 t->trace->hittexture = &mod_q1bsp_texture_lava;
709 else if (num & SUPERCONTENTS_SLIME)
710 t->trace->hittexture = &mod_q1bsp_texture_slime;
712 t->trace->hittexture = &mod_q1bsp_texture_water;
713 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
714 t->trace->hitsupercontents = num;
715 if (num & t->trace->hitsupercontentsmask)
717 // if the first leaf is solid, set startsolid
718 if (t->trace->allsolid)
719 t->trace->startsolid = true;
720 #if COLLISIONPARANOID >= 3
723 return HULLCHECKSTATE_SOLID;
727 t->trace->allsolid = false;
728 #if COLLISIONPARANOID >= 3
731 return HULLCHECKSTATE_EMPTY;
735 // find the point distances
736 node = t->hull->clipnodes + num;
738 plane = t->hull->planes + node->planenum;
741 t1 = p1[plane->type] - plane->dist;
742 t2 = p2[plane->type] - plane->dist;
746 t1 = DotProduct (plane->normal, p1) - plane->dist;
747 t2 = DotProduct (plane->normal, p2) - plane->dist;
754 #if COLLISIONPARANOID >= 3
757 num = node->children[1];
766 #if COLLISIONPARANOID >= 3
769 num = node->children[0];
775 // the line intersects, find intersection point
776 // LordHavoc: this uses the original trace for maximum accuracy
777 #if COLLISIONPARANOID >= 3
782 t1 = t->start[plane->type] - plane->dist;
783 t2 = t->end[plane->type] - plane->dist;
787 t1 = DotProduct (plane->normal, t->start) - plane->dist;
788 t2 = DotProduct (plane->normal, t->end) - plane->dist;
791 midf = t1 / (t1 - t2);
792 midf = bound(p1f, midf, p2f);
793 VectorMA(t->start, midf, t->dist, mid);
795 // recurse both sides, front side first
796 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
797 // if this side is not empty, return what it is (solid or done)
798 if (ret != HULLCHECKSTATE_EMPTY)
801 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
802 // if other side is not solid, return what it is (empty or done)
803 if (ret != HULLCHECKSTATE_SOLID)
806 // front is air and back is solid, this is the impact point...
809 t->trace->plane.dist = -plane->dist;
810 VectorNegate (plane->normal, t->trace->plane.normal);
814 t->trace->plane.dist = plane->dist;
815 VectorCopy (plane->normal, t->trace->plane.normal);
818 // calculate the true fraction
819 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
820 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
821 midf = t1 / (t1 - t2);
822 t->trace->realfraction = bound(0, midf, 1);
824 // calculate the return fraction which is nudged off the surface a bit
825 midf = (t1 - DIST_EPSILON) / (t1 - t2);
826 t->trace->fraction = bound(0, midf, 1);
828 if (collision_prefernudgedfraction.integer)
829 t->trace->realfraction = t->trace->fraction;
831 #if COLLISIONPARANOID >= 3
834 return HULLCHECKSTATE_DONE;
837 //#if COLLISIONPARANOID < 2
838 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
841 mclipnode_t *nodes = t->hull->clipnodes;
842 mplane_t *planes = t->hull->planes;
844 VectorCopy(t->start, point);
847 plane = planes + nodes[num].planenum;
848 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
850 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
851 t->trace->startsupercontents |= num;
852 if (num & SUPERCONTENTS_LIQUIDSMASK)
853 t->trace->inwater = true;
855 t->trace->inopen = true;
856 if (num & t->trace->hitsupercontentsmask)
858 t->trace->allsolid = t->trace->startsolid = true;
859 return HULLCHECKSTATE_SOLID;
863 t->trace->allsolid = t->trace->startsolid = false;
864 return HULLCHECKSTATE_EMPTY;
869 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)
871 RecursiveHullCheckTraceInfo_t rhc;
873 memset(&rhc, 0, sizeof(rhc));
874 memset(trace, 0, sizeof(trace_t));
876 rhc.trace->fraction = 1;
877 rhc.trace->realfraction = 1;
878 rhc.trace->allsolid = true;
879 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
880 VectorCopy(start, rhc.start);
881 VectorCopy(start, rhc.end);
882 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
885 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)
887 RecursiveHullCheckTraceInfo_t rhc;
889 if (VectorCompare(start, end))
891 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
895 memset(&rhc, 0, sizeof(rhc));
896 memset(trace, 0, sizeof(trace_t));
898 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
899 rhc.trace->fraction = 1;
900 rhc.trace->realfraction = 1;
901 rhc.trace->allsolid = true;
902 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
903 VectorCopy(start, rhc.start);
904 VectorCopy(end, rhc.end);
905 VectorSubtract(rhc.end, rhc.start, rhc.dist);
906 #if COLLISIONPARANOID >= 2
907 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]);
908 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
913 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
914 memset(&testtrace, 0, sizeof(trace_t));
915 rhc.trace = &testtrace;
916 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
917 rhc.trace->fraction = 1;
918 rhc.trace->realfraction = 1;
919 rhc.trace->allsolid = true;
920 VectorCopy(test, rhc.start);
921 VectorCopy(test, rhc.end);
922 VectorClear(rhc.dist);
923 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
924 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
925 if (!trace->startsolid && testtrace.startsolid)
926 Con_Printf(" - ended in solid!\n");
930 if (VectorLength2(rhc.dist))
931 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
933 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
937 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)
939 // this function currently only supports same size start and end
941 RecursiveHullCheckTraceInfo_t rhc;
943 if (VectorCompare(boxmins, boxmaxs))
945 if (VectorCompare(start, end))
946 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
948 Mod_Q1BSP_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
952 memset(&rhc, 0, sizeof(rhc));
953 memset(trace, 0, sizeof(trace_t));
955 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
956 rhc.trace->fraction = 1;
957 rhc.trace->realfraction = 1;
958 rhc.trace->allsolid = true;
959 VectorSubtract(boxmaxs, boxmins, boxsize);
961 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
962 else if (model->brush.ishlbsp)
964 // LordHavoc: this has to have a minor tolerance (the .1) because of
965 // minor float precision errors from the box being transformed around
966 if (boxsize[0] < 32.1)
968 if (boxsize[2] < 54) // pick the nearest of 36 or 72
969 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
971 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
974 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
978 // LordHavoc: this has to have a minor tolerance (the .1) because of
979 // minor float precision errors from the box being transformed around
980 if (boxsize[0] < 32.1)
981 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
983 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
985 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
986 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
987 VectorSubtract(rhc.end, rhc.start, rhc.dist);
988 #if COLLISIONPARANOID >= 2
989 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]);
990 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
995 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
996 memset(&testtrace, 0, sizeof(trace_t));
997 rhc.trace = &testtrace;
998 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
999 rhc.trace->fraction = 1;
1000 rhc.trace->realfraction = 1;
1001 rhc.trace->allsolid = true;
1002 VectorCopy(test, rhc.start);
1003 VectorCopy(test, rhc.end);
1004 VectorClear(rhc.dist);
1005 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1006 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
1007 if (!trace->startsolid && testtrace.startsolid)
1008 Con_Printf(" - ended in solid!\n");
1012 if (VectorLength2(rhc.dist))
1013 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1015 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1019 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
1021 int num = model->brushq1.hulls[0].firstclipnode;
1023 mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
1024 mplane_t *planes = model->brushq1.hulls[0].planes;
1027 plane = planes + nodes[num].planenum;
1028 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
1030 return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
1033 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)
1037 colplanef_t cbox_planes[6];
1039 cbox.hasaabbplanes = true;
1040 cbox.supercontents = boxsupercontents;
1043 cbox.numtriangles = 0;
1044 cbox.planes = cbox_planes;
1046 cbox.elements = NULL;
1054 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];
1055 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];
1056 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];
1057 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];
1058 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];
1059 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];
1060 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1061 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1062 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1063 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1064 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1065 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1066 memset(trace, 0, sizeof(trace_t));
1067 trace->hitsupercontentsmask = hitsupercontentsmask;
1068 trace->fraction = 1;
1069 trace->realfraction = 1;
1070 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1072 RecursiveHullCheckTraceInfo_t rhc;
1073 static hull_t box_hull;
1074 static mclipnode_t box_clipnodes[6];
1075 static mplane_t box_planes[6];
1076 // fill in a default trace
1077 memset(&rhc, 0, sizeof(rhc));
1078 memset(trace, 0, sizeof(trace_t));
1079 //To keep everything totally uniform, bounding boxes are turned into small
1080 //BSP trees instead of being compared directly.
1081 // create a temp hull from bounding box sizes
1082 box_planes[0].dist = cmaxs[0] - mins[0];
1083 box_planes[1].dist = cmins[0] - maxs[0];
1084 box_planes[2].dist = cmaxs[1] - mins[1];
1085 box_planes[3].dist = cmins[1] - maxs[1];
1086 box_planes[4].dist = cmaxs[2] - mins[2];
1087 box_planes[5].dist = cmins[2] - maxs[2];
1088 #if COLLISIONPARANOID >= 3
1089 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]);
1092 if (box_hull.clipnodes == NULL)
1096 //Set up the planes and clipnodes so that the six floats of a bounding box
1097 //can just be stored out and get a proper hull_t structure.
1099 box_hull.clipnodes = box_clipnodes;
1100 box_hull.planes = box_planes;
1101 box_hull.firstclipnode = 0;
1102 box_hull.lastclipnode = 5;
1104 for (i = 0;i < 6;i++)
1106 box_clipnodes[i].planenum = i;
1110 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1112 box_clipnodes[i].children[side^1] = i + 1;
1114 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1116 box_planes[i].type = i>>1;
1117 box_planes[i].normal[i>>1] = 1;
1121 // trace a line through the generated clipping hull
1122 //rhc.boxsupercontents = boxsupercontents;
1123 rhc.hull = &box_hull;
1125 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1126 rhc.trace->fraction = 1;
1127 rhc.trace->realfraction = 1;
1128 rhc.trace->allsolid = true;
1129 VectorCopy(start, rhc.start);
1130 VectorCopy(end, rhc.end);
1131 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1132 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1133 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1134 if (rhc.trace->startsupercontents)
1135 rhc.trace->startsupercontents = boxsupercontents;
1139 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)
1141 memset(trace, 0, sizeof(trace_t));
1142 trace->fraction = 1;
1143 trace->realfraction = 1;
1144 if (BoxesOverlap(start, start, cmins, cmaxs))
1146 trace->startsupercontents |= boxsupercontents;
1147 if (hitsupercontentsmask & boxsupercontents)
1149 trace->startsolid = true;
1150 trace->allsolid = true;
1155 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1158 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
1159 return trace.fraction == 1;
1162 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)
1166 float mid, distz = endz - startz;
1170 return false; // didn't hit anything
1172 switch (node->plane->type)
1175 node = node->children[x < node->plane->dist];
1178 node = node->children[y < node->plane->dist];
1181 side = startz < node->plane->dist;
1182 if ((endz < node->plane->dist) == side)
1184 node = node->children[side];
1187 // found an intersection
1188 mid = node->plane->dist;
1191 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1192 front += startz * node->plane->normal[2];
1193 back += endz * node->plane->normal[2];
1194 side = front < node->plane->dist;
1195 if ((back < node->plane->dist) == side)
1197 node = node->children[side];
1200 // found an intersection
1201 mid = startz + distz * (front - node->plane->dist) / (front - back);
1205 // go down front side
1206 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1207 return true; // hit something
1210 // check for impact on this node
1211 if (node->numsurfaces)
1213 int i, dsi, dti, lmwidth, lmheight;
1215 msurface_t *surface;
1216 unsigned char *lightmap;
1217 int maps, line3, size3;
1220 float scale, w, w00, w01, w10, w11;
1222 surface = model->data_surfaces + node->firstsurface;
1223 for (i = 0;i < node->numsurfaces;i++, surface++)
1225 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo || !surface->lightmapinfo->samples)
1226 continue; // no lightmaps
1228 // location we want to sample in the lightmap
1229 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;
1230 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;
1235 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1236 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1239 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1241 // calculate bilinear interpolation factors
1242 // and also multiply by fixedpoint conversion factors
1245 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1246 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1247 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1248 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1250 // values for pointer math
1251 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1252 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1254 // look up the pixel
1255 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1257 // bilinear filter each lightmap style, and sum them
1258 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1260 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1261 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1262 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1263 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1264 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1268 return true; // success
1273 // go down back side
1274 node = node->children[side ^ 1];
1276 distz = endz - startz;
1281 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1283 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1284 VectorSet(diffusenormal, 0, 0, 1);
1286 if (!model->brushq1.lightdata)
1288 VectorSet(ambientcolor, 1, 1, 1);
1289 VectorSet(diffusecolor, 0, 0, 0);
1293 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);
1296 static const texture_t *Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(RecursiveHullCheckTraceInfo_t *t, const dp_model_t *model, const mnode_t *node, double mid[3])
1301 const msurface_t *surface;
1306 float edgenormal[3];
1313 surface = model->data_surfaces + node->firstsurface;
1314 for (i = 0;i < node->numsurfaces;i++, surface++)
1316 // skip surfaces whose bounding box does not include the point
1317 // if (!BoxesOverlap(mid, mid, surface->mins, surface->maxs))
1319 // skip faces with contents we don't care about
1320 if (!(t->trace->hitsupercontentsmask & surface->texture->supercontents))
1322 // get the surface normal - since it is flat we know any vertex normal will suffice
1323 VectorCopy(model->surfmesh.data_normal3f + 3 * surface->num_firstvertex, normal);
1325 if (DotProduct(t->dist, normal) > 0)
1327 // iterate edges and see if the point is outside one of them
1328 for (j = 0, k = surface->num_vertices - 1;j < surface->num_vertices;k = j, j++)
1330 VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + k), v0);
1331 VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + j), v1);
1332 VectorSubtract(v0, v1, edgedir);
1333 CrossProduct(edgedir, normal, edgenormal);
1334 if (DotProduct(edgenormal, p) > DotProduct(edgenormal, v0))
1337 // if the point is outside one of the edges, it is not within the surface
1338 if (j < surface->num_vertices)
1341 // we hit a surface, this is the impact point...
1342 VectorCopy(normal, t->trace->plane.normal);
1343 t->trace->plane.dist = DotProduct(normal, p);
1345 // calculate the true fraction
1346 t1 = DotProduct(t->start, t->trace->plane.normal) - t->trace->plane.dist;
1347 t2 = DotProduct(t->end, t->trace->plane.normal) - t->trace->plane.dist;
1348 midf = t1 / (t1 - t2);
1349 t->trace->realfraction = midf;
1351 // calculate the return fraction which is nudged off the surface a bit
1352 midf = (t1 - DIST_EPSILON) / (t1 - t2);
1353 t->trace->fraction = bound(0, midf, 1);
1355 if (collision_prefernudgedfraction.integer)
1356 t->trace->realfraction = t->trace->fraction;
1358 t->trace->hittexture = surface->texture->currentframe;
1359 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
1360 t->trace->hitsupercontents = t->trace->hittexture->supercontents;
1361 return surface->texture->currentframe;
1366 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])
1368 const mplane_t *plane;
1371 double midf, mid[3];
1372 const mleaf_t *leaf;
1376 plane = node->plane;
1377 if (plane->type < 3)
1379 t1 = p1[plane->type] - plane->dist;
1380 t2 = p2[plane->type] - plane->dist;
1384 t1 = DotProduct (plane->normal, p1) - plane->dist;
1385 t2 = DotProduct (plane->normal, p2) - plane->dist;
1391 node = node->children[1];
1400 node = node->children[0];
1406 // the line intersects, find intersection point
1407 // LordHavoc: this uses the original trace for maximum accuracy
1408 if (plane->type < 3)
1410 t1 = t->start[plane->type] - plane->dist;
1411 t2 = t->end[plane->type] - plane->dist;
1415 t1 = DotProduct (plane->normal, t->start) - plane->dist;
1416 t2 = DotProduct (plane->normal, t->end) - plane->dist;
1419 midf = t1 / (t1 - t2);
1420 VectorMA(t->start, midf, t->dist, mid);
1422 // recurse both sides, front side first, return if we hit a surface
1423 if (Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side], p1, mid) == HULLCHECKSTATE_DONE)
1424 return HULLCHECKSTATE_DONE;
1426 // test each surface on the node
1427 Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(t, model, node, mid);
1428 if (t->trace->hittexture)
1429 return HULLCHECKSTATE_DONE;
1431 // recurse back side
1432 return Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side ^ 1], mid, p2);
1434 leaf = (const mleaf_t *)node;
1435 side = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, leaf->contents);
1436 if (!t->trace->startfound)
1438 t->trace->startfound = true;
1439 t->trace->startsupercontents |= side;
1441 if (side & SUPERCONTENTS_LIQUIDSMASK)
1442 t->trace->inwater = true;
1444 t->trace->inopen = true;
1445 if (side & t->trace->hitsupercontentsmask)
1447 // if the first leaf is solid, set startsolid
1448 if (t->trace->allsolid)
1449 t->trace->startsolid = true;
1450 return HULLCHECKSTATE_SOLID;
1454 t->trace->allsolid = false;
1455 return HULLCHECKSTATE_EMPTY;
1459 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)
1461 RecursiveHullCheckTraceInfo_t rhc;
1463 memset(&rhc, 0, sizeof(rhc));
1464 memset(trace, 0, sizeof(trace_t));
1466 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1467 rhc.trace->fraction = 1;
1468 rhc.trace->realfraction = 1;
1469 rhc.trace->allsolid = true;
1470 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
1471 VectorCopy(start, rhc.start);
1472 VectorCopy(end, rhc.end);
1473 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1474 Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(&rhc, model, model->brush.data_nodes + rhc.hull->firstclipnode, rhc.start, rhc.end);
1475 VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1478 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1481 unsigned char *outstart = out;
1482 while (out < outend)
1486 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));
1496 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));
1499 for (c = *in++;c > 0;c--)
1503 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));
1514 R_Q1BSP_LoadSplitSky
1516 A sky texture is 256*128, with the right side being a masked overlay
1519 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1524 unsigned int *solidpixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1525 unsigned int *alphapixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1527 // allocate a texture pool if we need it
1528 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1529 loadmodel->texturepool = R_AllocTexturePool();
1531 if (bytesperpixel == 4)
1533 for (y = 0;y < h;y++)
1535 for (x = 0;x < w;x++)
1537 solidpixels[y*w+x] = ((unsigned *)src)[y*width+x+w];
1538 alphapixels[y*w+x] = ((unsigned *)src)[y*width+x];
1544 // make an average value for the back to avoid
1545 // a fringe on the top level
1554 for (y = 0;y < h;y++)
1556 for (x = 0;x < w;x++)
1558 p = src[x*width+y+w];
1559 r += palette_rgb[p][0];
1560 g += palette_rgb[p][1];
1561 b += palette_rgb[p][2];
1564 bgra.b[2] = r/(w*h);
1565 bgra.b[1] = g/(w*h);
1566 bgra.b[0] = b/(w*h);
1568 for (y = 0;y < h;y++)
1570 for (x = 0;x < w;x++)
1572 solidpixels[y*w+x] = palette_bgra_complete[src[y*width+x+w]];
1574 alphapixels[y*w+x] = p ? palette_bgra_complete[p] : bgra.i;
1579 loadmodel->brush.solidskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_solidtexture", 0 , (unsigned char *) solidpixels, w, h);
1580 loadmodel->brush.alphaskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_alphatexture", TEXF_ALPHA, (unsigned char *) alphapixels, w, h);
1581 Mem_Free(solidpixels);
1582 Mem_Free(alphapixels);
1585 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1587 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1588 skinframe_t *skinframe;
1590 texture_t *tx, *tx2, *anims[10], *altanims[10];
1592 unsigned char *data, *mtdata;
1594 char mapname[MAX_QPATH], name[MAX_QPATH];
1595 unsigned char zero[4];
1597 memset(zero, 0, sizeof(zero));
1599 loadmodel->data_textures = NULL;
1601 // add two slots for notexture walls and notexture liquids
1604 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1605 m->nummiptex = LittleLong (m->nummiptex);
1606 loadmodel->num_textures = m->nummiptex + 2;
1607 loadmodel->num_texturesperskin = loadmodel->num_textures;
1612 loadmodel->num_textures = 2;
1613 loadmodel->num_texturesperskin = loadmodel->num_textures;
1616 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1618 // fill out all slots with notexture
1619 if (cls.state != ca_dedicated)
1620 skinframe = R_SkinFrame_LoadMissing();
1623 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1625 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1628 if (cls.state != ca_dedicated)
1630 tx->numskinframes = 1;
1631 tx->skinframerate = 1;
1632 tx->skinframes[0] = skinframe;
1633 tx->currentskinframe = tx->skinframes[0];
1635 tx->basematerialflags = MATERIALFLAG_WALL;
1636 if (i == loadmodel->num_textures - 1)
1638 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1639 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1640 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1644 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1645 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1647 tx->currentframe = tx;
1649 // clear water settings
1652 tx->refractfactor = 1;
1653 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1654 tx->reflectfactor = 1;
1655 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1656 tx->r_water_wateralpha = 1;
1657 tx->offsetmapping = OFFSETMAPPING_OFF;
1658 tx->offsetscale = 1;
1659 tx->specularscalemod = 1;
1660 tx->specularpowermod = 1;
1665 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1669 s = loadmodel->name;
1670 if (!strncasecmp(s, "maps/", 5))
1672 FS_StripExtension(s, mapname, sizeof(mapname));
1674 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1676 // LordHavoc: mostly rewritten map texture loader
1677 for (i = 0;i < m->nummiptex;i++)
1679 dofs[i] = LittleLong(dofs[i]);
1680 if (r_nosurftextures.integer)
1684 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1687 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1689 // copy name, but only up to 16 characters
1690 // (the output buffer can hold more than this, but the input buffer is
1692 for (j = 0;j < 16 && dmiptex->name[j];j++)
1693 name[j] = dmiptex->name[j];
1698 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1699 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1702 mtwidth = LittleLong(dmiptex->width);
1703 mtheight = LittleLong(dmiptex->height);
1705 j = LittleLong(dmiptex->offsets[0]);
1709 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1711 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1714 mtdata = (unsigned char *)dmiptex + j;
1717 if ((mtwidth & 15) || (mtheight & 15))
1718 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1720 // LordHavoc: force all names to lowercase
1721 for (j = 0;name[j];j++)
1722 if (name[j] >= 'A' && name[j] <= 'Z')
1723 name[j] += 'a' - 'A';
1725 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1728 tx = loadmodel->data_textures + i;
1729 strlcpy(tx->name, name, sizeof(tx->name));
1730 tx->width = mtwidth;
1731 tx->height = mtheight;
1733 if (tx->name[0] == '*')
1735 if (!strncmp(tx->name, "*lava", 5))
1737 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1738 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1740 else if (!strncmp(tx->name, "*slime", 6))
1742 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1743 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1747 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1748 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1751 else if (!strncmp(tx->name, "sky", 3))
1753 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1754 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1758 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1759 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1762 if (cls.state != ca_dedicated)
1764 // LordHavoc: HL sky textures are entirely different than quake
1765 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == mtheight * 2)
1767 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), false, false, r_texture_convertsRGB_skin.integer != 0, NULL);
1769 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), false, false, r_texture_convertsRGB_skin.integer != 0, NULL);
1770 if (data && image_width == image_height * 2)
1772 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1775 else if (mtdata != NULL)
1776 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1780 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);
1782 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);
1785 // did not find external texture, load it from the bsp or wad3
1786 if (loadmodel->brush.ishlbsp)
1788 // internal texture overrides wad
1789 unsigned char *pixels, *freepixels;
1790 pixels = freepixels = NULL;
1792 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1794 pixels = freepixels = W_GetTextureBGRA(tx->name);
1797 tx->width = image_width;
1798 tx->height = image_height;
1799 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, pixels, image_width, image_height);
1802 Mem_Free(freepixels);
1804 else if (mtdata) // texture included
1805 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1807 // if skinframe is still NULL the "missing" texture will be used
1809 tx->skinframes[0] = skinframe;
1812 tx->basematerialflags = MATERIALFLAG_WALL;
1813 if (tx->name[0] == '*')
1815 // LordHavoc: some turbulent textures should not be affected by wateralpha
1816 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1818 // replace the texture with transparent black
1819 Vector4Set(zero, 128, 128, 128, 128);
1820 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA, zero, 1, 1);
1821 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1823 else if (!strncmp(tx->name,"*lava",5)
1824 || !strncmp(tx->name,"*teleport",9)
1825 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1826 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1828 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1829 if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1830 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1832 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1834 // replace the texture with black
1835 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, 0, zero, 1, 1);
1836 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1838 else if (!strncmp(tx->name, "sky", 3))
1839 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1840 else if (!strcmp(tx->name, "caulk"))
1841 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1842 else if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1843 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1845 // start out with no animation
1846 tx->currentframe = tx;
1847 tx->currentskinframe = tx->skinframes[0];
1851 // sequence the animations
1852 for (i = 0;i < m->nummiptex;i++)
1854 tx = loadmodel->data_textures + i;
1855 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1857 if (tx->anim_total[0] || tx->anim_total[1])
1858 continue; // already sequenced
1860 // find the number of frames in the animation
1861 memset(anims, 0, sizeof(anims));
1862 memset(altanims, 0, sizeof(altanims));
1864 for (j = i;j < m->nummiptex;j++)
1866 tx2 = loadmodel->data_textures + j;
1867 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1871 if (num >= '0' && num <= '9')
1872 anims[num - '0'] = tx2;
1873 else if (num >= 'a' && num <= 'j')
1874 altanims[num - 'a'] = tx2;
1876 Con_Printf("Bad animating texture %s\n", tx->name);
1880 for (j = 0;j < 10;j++)
1887 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1890 for (j = 0;j < max;j++)
1894 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1898 for (j = 0;j < altmax;j++)
1902 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1911 // if there is no alternate animation, duplicate the primary
1912 // animation into the alternate
1914 for (k = 0;k < 10;k++)
1915 altanims[k] = anims[k];
1918 // link together the primary animation
1919 for (j = 0;j < max;j++)
1922 tx2->animated = true;
1923 tx2->anim_total[0] = max;
1924 tx2->anim_total[1] = altmax;
1925 for (k = 0;k < 10;k++)
1927 tx2->anim_frames[0][k] = anims[k];
1928 tx2->anim_frames[1][k] = altanims[k];
1932 // if there really is an alternate anim...
1933 if (anims[0] != altanims[0])
1935 // link together the alternate animation
1936 for (j = 0;j < altmax;j++)
1939 tx2->animated = true;
1940 // the primary/alternate are reversed here
1941 tx2->anim_total[0] = altmax;
1942 tx2->anim_total[1] = max;
1943 for (k = 0;k < 10;k++)
1945 tx2->anim_frames[0][k] = altanims[k];
1946 tx2->anim_frames[1][k] = anims[k];
1953 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1956 unsigned char *in, *out, *data, d;
1957 char litfilename[MAX_QPATH];
1958 char dlitfilename[MAX_QPATH];
1959 fs_offset_t filesize;
1960 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1962 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1963 for (i=0; i<l->filelen; i++)
1964 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1966 else // LordHavoc: bsp version 29 (normal white lighting)
1968 // LordHavoc: hope is not lost yet, check for a .lit file to load
1969 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1970 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1971 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1972 strlcat (litfilename, ".lit", sizeof (litfilename));
1973 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
1974 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
1977 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1979 i = LittleLong(((int *)data)[1]);
1982 if (developer_loading.integer)
1983 Con_Printf("loaded %s\n", litfilename);
1984 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1985 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
1987 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
1990 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
1992 i = LittleLong(((int *)data)[1]);
1995 if (developer_loading.integer)
1996 Con_Printf("loaded %s\n", dlitfilename);
1997 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
1998 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
1999 loadmodel->brushq3.deluxemapping_modelspace = false;
2000 loadmodel->brushq3.deluxemapping = true;
2009 Con_Printf("Unknown .lit file version (%d)\n", i);
2011 else if (filesize == 8)
2012 Con_Print("Empty .lit file, ignoring\n");
2014 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
2021 // LordHavoc: oh well, expand the white lighting data
2024 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
2025 in = mod_base + l->fileofs;
2026 out = loadmodel->brushq1.lightdata;
2027 for (i = 0;i < l->filelen;i++)
2037 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
2039 loadmodel->brushq1.num_compressedpvs = 0;
2040 loadmodel->brushq1.data_compressedpvs = NULL;
2043 loadmodel->brushq1.num_compressedpvs = l->filelen;
2044 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
2045 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
2048 // used only for HalfLife maps
2049 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
2051 char key[128], value[4096];
2055 if (!COM_ParseToken_Simple(&data, false, false))
2057 if (com_token[0] != '{')
2061 if (!COM_ParseToken_Simple(&data, false, false))
2063 if (com_token[0] == '}')
2064 break; // end of worldspawn
2065 if (com_token[0] == '_')
2066 strlcpy(key, com_token + 1, sizeof(key));
2068 strlcpy(key, com_token, sizeof(key));
2069 while (key[strlen(key)-1] == ' ') // remove trailing spaces
2070 key[strlen(key)-1] = 0;
2071 if (!COM_ParseToken_Simple(&data, false, false))
2073 dpsnprintf(value, sizeof(value), "%s", com_token);
2074 if (!strcmp("wad", key)) // for HalfLife maps
2076 if (loadmodel->brush.ishlbsp)
2079 for (i = 0;i < (int)sizeof(value);i++)
2080 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
2084 for (;i < (int)sizeof(value);i++)
2086 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
2087 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
2089 else if (value[i] == ';' || value[i] == 0)
2093 W_LoadTextureWadFile(&value[j], false);
2105 static void Mod_Q1BSP_LoadEntities(lump_t *l)
2107 loadmodel->brush.entities = NULL;
2110 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
2111 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
2112 loadmodel->brush.entities[l->filelen] = 0;
2113 if (loadmodel->brush.ishlbsp)
2114 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
2118 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
2124 in = (dvertex_t *)(mod_base + l->fileofs);
2125 if (l->filelen % sizeof(*in))
2126 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
2127 count = l->filelen / sizeof(*in);
2128 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2130 loadmodel->brushq1.vertexes = out;
2131 loadmodel->brushq1.numvertexes = count;
2133 for ( i=0 ; i<count ; i++, in++, out++)
2135 out->position[0] = LittleFloat(in->point[0]);
2136 out->position[1] = LittleFloat(in->point[1]);
2137 out->position[2] = LittleFloat(in->point[2]);
2141 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
2142 // can be used for this
2144 int SB_ReadInt (unsigned char **buffer)
2147 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
2153 float SB_ReadFloat (unsigned char **buffer)
2161 u.i = SB_ReadInt (buffer);
2165 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
2167 unsigned char *index;
2171 index = (unsigned char *)(mod_base + l->fileofs);
2172 if (l->filelen % (48+4*hullinfo->filehulls))
2173 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
2175 count = l->filelen / (48+4*hullinfo->filehulls);
2176 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
2178 loadmodel->brushq1.submodels = out;
2179 loadmodel->brush.numsubmodels = count;
2181 for (i = 0; i < count; i++, out++)
2183 // spread out the mins / maxs by a pixel
2184 out->mins[0] = SB_ReadFloat (&index) - 1;
2185 out->mins[1] = SB_ReadFloat (&index) - 1;
2186 out->mins[2] = SB_ReadFloat (&index) - 1;
2187 out->maxs[0] = SB_ReadFloat (&index) + 1;
2188 out->maxs[1] = SB_ReadFloat (&index) + 1;
2189 out->maxs[2] = SB_ReadFloat (&index) + 1;
2190 out->origin[0] = SB_ReadFloat (&index);
2191 out->origin[1] = SB_ReadFloat (&index);
2192 out->origin[2] = SB_ReadFloat (&index);
2193 for (j = 0; j < hullinfo->filehulls; j++)
2194 out->headnode[j] = SB_ReadInt (&index);
2195 out->visleafs = SB_ReadInt (&index);
2196 out->firstface = SB_ReadInt (&index);
2197 out->numfaces = SB_ReadInt (&index);
2201 static void Mod_Q1BSP_LoadEdges(lump_t *l)
2207 in = (dedge_t *)(mod_base + l->fileofs);
2208 if (l->filelen % sizeof(*in))
2209 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2210 count = l->filelen / sizeof(*in);
2211 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2213 loadmodel->brushq1.edges = out;
2214 loadmodel->brushq1.numedges = count;
2216 for ( i=0 ; i<count ; i++, in++, out++)
2218 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2219 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2220 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2222 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);
2223 if(!loadmodel->brushq1.numvertexes)
2224 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2232 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2236 int i, j, k, count, miptex;
2238 in = (texinfo_t *)(mod_base + l->fileofs);
2239 if (l->filelen % sizeof(*in))
2240 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2241 count = l->filelen / sizeof(*in);
2242 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2244 loadmodel->brushq1.texinfo = out;
2245 loadmodel->brushq1.numtexinfo = count;
2247 for (i = 0;i < count;i++, in++, out++)
2249 for (k = 0;k < 2;k++)
2250 for (j = 0;j < 4;j++)
2251 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2253 miptex = LittleLong(in->miptex);
2254 out->flags = LittleLong(in->flags);
2256 out->texture = NULL;
2257 if (loadmodel->data_textures)
2259 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2260 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2262 out->texture = loadmodel->data_textures + miptex;
2264 if (out->flags & TEX_SPECIAL)
2266 // if texture chosen is NULL or the shader needs a lightmap,
2267 // force to notexture water shader
2268 if (out->texture == NULL)
2269 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2273 // if texture chosen is NULL, force to notexture
2274 if (out->texture == NULL)
2275 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2281 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2286 mins[0] = mins[1] = mins[2] = 9999;
2287 maxs[0] = maxs[1] = maxs[2] = -9999;
2289 for (i = 0;i < numverts;i++)
2291 for (j = 0;j < 3;j++, v++)
2301 #define MAX_SUBDIVPOLYTRIANGLES 4096
2302 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2304 static int subdivpolyverts, subdivpolytriangles;
2305 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2306 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2308 static int subdivpolylookupvert(vec3_t v)
2311 for (i = 0;i < subdivpolyverts;i++)
2312 if (subdivpolyvert[i][0] == v[0]
2313 && subdivpolyvert[i][1] == v[1]
2314 && subdivpolyvert[i][2] == v[2])
2316 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2317 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2318 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2319 return subdivpolyverts++;
2322 static void SubdividePolygon(int numverts, float *verts)
2324 int i, i1, i2, i3, f, b, c, p;
2325 vec3_t mins, maxs, front[256], back[256];
2326 float m, *pv, *cv, dist[256], frac;
2329 Host_Error("SubdividePolygon: ran out of verts in buffer");
2331 BoundPoly(numverts, verts, mins, maxs);
2333 for (i = 0;i < 3;i++)
2335 m = (mins[i] + maxs[i]) * 0.5;
2336 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2337 if (maxs[i] - m < 8)
2339 if (m - mins[i] < 8)
2343 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2344 dist[c] = cv[i] - m;
2347 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2351 VectorCopy(pv, front[f]);
2356 VectorCopy(pv, back[b]);
2359 if (dist[p] == 0 || dist[c] == 0)
2361 if ((dist[p] > 0) != (dist[c] > 0) )
2364 frac = dist[p] / (dist[p] - dist[c]);
2365 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2366 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2367 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2373 SubdividePolygon(f, front[0]);
2374 SubdividePolygon(b, back[0]);
2378 i1 = subdivpolylookupvert(verts);
2379 i2 = subdivpolylookupvert(verts + 3);
2380 for (i = 2;i < numverts;i++)
2382 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2384 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2388 i3 = subdivpolylookupvert(verts + i * 3);
2389 subdivpolyindex[subdivpolytriangles][0] = i1;
2390 subdivpolyindex[subdivpolytriangles][1] = i2;
2391 subdivpolyindex[subdivpolytriangles][2] = i3;
2393 subdivpolytriangles++;
2397 //Breaks a polygon up along axial 64 unit
2398 //boundaries so that turbulent and sky warps
2399 //can be done reasonably.
2400 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2406 subdivpolytriangles = 0;
2407 subdivpolyverts = 0;
2408 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2409 if (subdivpolytriangles < 1)
2410 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2412 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2413 mesh->num_vertices = subdivpolyverts;
2414 mesh->num_triangles = subdivpolytriangles;
2415 mesh->vertex = (surfvertex_t *)(mesh + 1);
2416 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2417 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2419 for (i = 0;i < mesh->num_triangles;i++)
2420 for (j = 0;j < 3;j++)
2421 mesh->index[i*3+j] = subdivpolyindex[i][j];
2423 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2425 VectorCopy(subdivpolyvert[i], v->v);
2426 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2427 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2432 extern cvar_t gl_max_lightmapsize;
2433 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2436 msurface_t *surface;
2437 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2438 float texmins[2], texmaxs[2], val;
2439 rtexture_t *lightmaptexture, *deluxemaptexture;
2441 in = (dface_t *)(mod_base + l->fileofs);
2442 if (l->filelen % sizeof(*in))
2443 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2444 count = l->filelen / sizeof(*in);
2445 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2446 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2448 loadmodel->num_surfaces = count;
2450 loadmodel->brushq1.firstrender = true;
2451 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2455 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2457 numedges = (unsigned short)LittleShort(in->numedges);
2458 totalverts += numedges;
2459 totaltris += numedges - 2;
2462 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2464 lightmaptexture = NULL;
2465 deluxemaptexture = r_texture_blanknormalmap;
2467 lightmapsize = bound(256, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d);
2468 totallightmapsamples = 0;
2472 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2474 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2476 // FIXME: validate edges, texinfo, etc?
2477 firstedge = LittleLong(in->firstedge);
2478 numedges = (unsigned short)LittleShort(in->numedges);
2479 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)
2480 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2481 i = (unsigned short)LittleShort(in->texinfo);
2482 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2483 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2484 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2485 surface->texture = surface->lightmapinfo->texinfo->texture;
2487 planenum = (unsigned short)LittleShort(in->planenum);
2488 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2489 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2491 //surface->flags = surface->texture->flags;
2492 //if (LittleShort(in->side))
2493 // surface->flags |= SURF_PLANEBACK;
2494 //surface->plane = loadmodel->brush.data_planes + planenum;
2496 surface->num_firstvertex = totalverts;
2497 surface->num_vertices = numedges;
2498 surface->num_firsttriangle = totaltris;
2499 surface->num_triangles = numedges - 2;
2500 totalverts += numedges;
2501 totaltris += numedges - 2;
2503 // convert edges back to a normal polygon
2504 for (i = 0;i < surface->num_vertices;i++)
2506 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2508 // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2510 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2512 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2513 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2514 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2515 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2516 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2517 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2518 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2519 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2522 for (i = 0;i < surface->num_triangles;i++)
2524 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2525 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2526 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2529 // compile additional data about the surface geometry
2530 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);
2531 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);
2532 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2534 // generate surface extents information
2535 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2536 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2537 for (i = 1;i < surface->num_vertices;i++)
2539 for (j = 0;j < 2;j++)
2541 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2542 texmins[j] = min(texmins[j], val);
2543 texmaxs[j] = max(texmaxs[j], val);
2546 for (i = 0;i < 2;i++)
2548 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2549 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2552 smax = surface->lightmapinfo->extents[0] >> 4;
2553 tmax = surface->lightmapinfo->extents[1] >> 4;
2554 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2555 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2558 for (i = 0;i < MAXLIGHTMAPS;i++)
2559 surface->lightmapinfo->styles[i] = in->styles[i];
2560 surface->lightmaptexture = NULL;
2561 surface->deluxemaptexture = r_texture_blanknormalmap;
2562 i = LittleLong(in->lightofs);
2565 surface->lightmapinfo->samples = NULL;
2567 // give non-lightmapped water a 1x white lightmap
2568 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2570 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2571 surface->lightmapinfo->styles[0] = 0;
2572 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2576 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2577 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2578 else // LordHavoc: white lighting (bsp version 29)
2580 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2581 if (loadmodel->brushq1.nmaplightdata)
2582 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2585 // check if we should apply a lightmap to this
2586 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2588 if (ssize > 256 || tsize > 256)
2589 Host_Error("Bad surface extents");
2591 if (lightmapsize < ssize)
2592 lightmapsize = ssize;
2593 if (lightmapsize < tsize)
2594 lightmapsize = tsize;
2596 totallightmapsamples += ssize*tsize;
2598 // force lightmap upload on first time seeing the surface
2600 // additionally this is used by the later code to see if a
2601 // lightmap is needed on this surface (rather than duplicating the
2603 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2604 loadmodel->lit = true;
2608 // small maps (such as ammo boxes especially) don't need big lightmap
2609 // textures, so this code tries to guess a good size based on
2610 // totallightmapsamples (size of the lightmaps lump basically), as well as
2611 // trying to max out the size if there is a lot of lightmap data to store
2612 // additionally, never choose a lightmapsize that is smaller than the
2613 // largest surface encountered (as it would fail)
2615 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < bound(128, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d)) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2618 // now that we've decided the lightmap texture size, we can do the rest
2619 if (cls.state != ca_dedicated)
2621 int stainmapsize = 0;
2622 mod_alloclightmap_state_t allocState;
2624 Mod_AllocLightmap_Init(&allocState, lightmapsize, lightmapsize);
2625 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2627 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2628 float u, v, ubase, vbase, uscale, vscale;
2630 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2633 smax = surface->lightmapinfo->extents[0] >> 4;
2634 tmax = surface->lightmapinfo->extents[1] >> 4;
2635 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2636 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2637 stainmapsize += ssize * tsize * 3;
2639 if (!lightmaptexture || !Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy))
2641 // allocate a texture pool if we need it
2642 if (loadmodel->texturepool == NULL)
2643 loadmodel->texturepool = R_AllocTexturePool();
2644 // could not find room, make a new lightmap
2645 loadmodel->brushq3.num_mergedlightmaps = lightmapnumber + 1;
2646 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_lightmaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_lightmaps[0]));
2647 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_deluxemaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_deluxemaps[0]));
2648 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);
2649 if (loadmodel->brushq1.nmaplightdata)
2650 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);
2652 Mod_AllocLightmap_Reset(&allocState);
2653 Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy);
2655 surface->lightmaptexture = lightmaptexture;
2656 surface->deluxemaptexture = deluxemaptexture;
2657 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2658 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2660 uscale = 1.0f / (float)lightmapsize;
2661 vscale = 1.0f / (float)lightmapsize;
2662 ubase = lightmapx * uscale;
2663 vbase = lightmapy * vscale;
2665 for (i = 0;i < surface->num_vertices;i++)
2667 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);
2668 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);
2669 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2670 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2671 // LordHavoc: calc lightmap data offset for vertex lighting to use
2674 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2678 if (cl_stainmaps.integer)
2680 // allocate stainmaps for permanent marks on walls and clear white
2681 unsigned char *stainsamples = NULL;
2682 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2683 memset(stainsamples, 255, stainmapsize);
2685 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2687 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2689 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2690 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2691 surface->lightmapinfo->stainsamples = stainsamples;
2692 stainsamples += ssize * tsize * 3;
2697 // generate ushort elements array if possible
2698 if (loadmodel->surfmesh.data_element3s)
2699 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2700 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2703 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2706 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2707 node->parent = parent;
2710 // this is a node, recurse to children
2711 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2712 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2713 // combine supercontents of children
2714 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2719 mleaf_t *leaf = (mleaf_t *)node;
2720 // if this is a leaf, calculate supercontents mask from all collidable
2721 // primitives in the leaf (brushes and collision surfaces)
2722 // also flag if the leaf contains any collision surfaces
2723 leaf->combinedsupercontents = 0;
2724 // combine the supercontents values of all brushes in this leaf
2725 for (j = 0;j < leaf->numleafbrushes;j++)
2726 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2727 // check if this leaf contains any collision surfaces (q3 patches)
2728 for (j = 0;j < leaf->numleafsurfaces;j++)
2730 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2731 if (surface->num_collisiontriangles)
2733 leaf->containscollisionsurfaces = true;
2734 leaf->combinedsupercontents |= surface->texture->supercontents;
2740 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2746 in = (dnode_t *)(mod_base + l->fileofs);
2747 if (l->filelen % sizeof(*in))
2748 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2749 count = l->filelen / sizeof(*in);
2751 Host_Error("Mod_Q1BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
2752 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2754 loadmodel->brush.data_nodes = out;
2755 loadmodel->brush.num_nodes = count;
2757 for ( i=0 ; i<count ; i++, in++, out++)
2759 for (j=0 ; j<3 ; j++)
2761 out->mins[j] = LittleShort(in->mins[j]);
2762 out->maxs[j] = LittleShort(in->maxs[j]);
2765 p = LittleLong(in->planenum);
2766 out->plane = loadmodel->brush.data_planes + p;
2768 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2769 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2771 for (j=0 ; j<2 ; j++)
2773 // LordHavoc: this code supports broken bsp files produced by
2774 // arguire qbsp which can produce more than 32768 nodes, any value
2775 // below count is assumed to be a node number, any other value is
2776 // assumed to be a leaf number
2777 p = (unsigned short)LittleShort(in->children[j]);
2780 if (p < loadmodel->brush.num_nodes)
2781 out->children[j] = loadmodel->brush.data_nodes + p;
2784 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2785 // map it to the solid leaf
2786 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2791 // note this uses 65535 intentionally, -1 is leaf 0
2793 if (p < loadmodel->brush.num_leafs)
2794 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2797 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2798 // map it to the solid leaf
2799 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2805 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2808 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2814 in = (dleaf_t *)(mod_base + l->fileofs);
2815 if (l->filelen % sizeof(*in))
2816 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2817 count = l->filelen / sizeof(*in);
2818 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2820 loadmodel->brush.data_leafs = out;
2821 loadmodel->brush.num_leafs = count;
2822 // get visleafs from the submodel data
2823 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2824 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2825 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2826 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2828 for ( i=0 ; i<count ; i++, in++, out++)
2830 for (j=0 ; j<3 ; j++)
2832 out->mins[j] = LittleShort(in->mins[j]);
2833 out->maxs[j] = LittleShort(in->maxs[j]);
2836 // FIXME: this function could really benefit from some error checking
2838 out->contents = LittleLong(in->contents);
2840 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2841 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2842 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2844 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);
2845 out->firstleafsurface = NULL;
2846 out->numleafsurfaces = 0;
2849 out->clusterindex = i - 1;
2850 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2851 out->clusterindex = -1;
2853 p = LittleLong(in->visofs);
2854 // ignore visofs errors on leaf 0 (solid)
2855 if (p >= 0 && out->clusterindex >= 0)
2857 if (p >= loadmodel->brushq1.num_compressedpvs)
2858 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2860 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);
2863 for (j = 0;j < 4;j++)
2864 out->ambient_sound_level[j] = in->ambient_level[j];
2866 // FIXME: Insert caustics here
2870 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2874 const unsigned char *pvs;
2875 // if there's no vis data, assume supported (because everything is visible all the time)
2876 if (!loadmodel->brush.data_pvsclusters)
2878 // check all liquid leafs to see if they can see into empty leafs, if any
2879 // can we can assume this map supports r_wateralpha
2880 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2882 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2884 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2885 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2886 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2893 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2900 in = (dclipnode_t *)(mod_base + l->fileofs);
2901 if (l->filelen % sizeof(*in))
2902 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2903 count = l->filelen / sizeof(*in);
2904 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2906 loadmodel->brushq1.clipnodes = out;
2907 loadmodel->brushq1.numclipnodes = count;
2909 for (i = 1; i < MAX_MAP_HULLS; i++)
2911 hull = &loadmodel->brushq1.hulls[i];
2912 hull->clipnodes = out;
2913 hull->firstclipnode = 0;
2914 hull->lastclipnode = count-1;
2915 hull->planes = loadmodel->brush.data_planes;
2916 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2917 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2918 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2919 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2920 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2921 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2922 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2925 for (i=0 ; i<count ; i++, out++, in++)
2927 out->planenum = LittleLong(in->planenum);
2928 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2929 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2930 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2931 if (out->children[0] >= count)
2932 out->children[0] -= 65536;
2933 if (out->children[1] >= count)
2934 out->children[1] -= 65536;
2935 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2936 Host_Error("Corrupt clipping hull(out of range planenum)");
2940 //Duplicate the drawing hull structure as a clipping hull
2941 static void Mod_Q1BSP_MakeHull0(void)
2948 hull = &loadmodel->brushq1.hulls[0];
2950 in = loadmodel->brush.data_nodes;
2951 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2953 hull->clipnodes = out;
2954 hull->firstclipnode = 0;
2955 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2956 hull->planes = loadmodel->brush.data_planes;
2958 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2960 out->planenum = in->plane - loadmodel->brush.data_planes;
2961 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2962 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2966 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2971 in = (short *)(mod_base + l->fileofs);
2972 if (l->filelen % sizeof(*in))
2973 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
2974 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
2975 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
2977 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
2979 j = (unsigned short) LittleShort(in[i]);
2980 if (j >= loadmodel->num_surfaces)
2981 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
2982 loadmodel->brush.data_leafsurfaces[i] = j;
2986 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
2991 in = (int *)(mod_base + l->fileofs);
2992 if (l->filelen % sizeof(*in))
2993 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
2994 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
2995 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
2997 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
2998 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
3002 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
3008 in = (dplane_t *)(mod_base + l->fileofs);
3009 if (l->filelen % sizeof(*in))
3010 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
3012 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
3013 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
3015 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
3017 out->normal[0] = LittleFloat(in->normal[0]);
3018 out->normal[1] = LittleFloat(in->normal[1]);
3019 out->normal[2] = LittleFloat(in->normal[2]);
3020 out->dist = LittleFloat(in->dist);
3026 static void Mod_Q1BSP_LoadMapBrushes(void)
3030 int submodel, numbrushes;
3031 qboolean firstbrush;
3032 char *text, *maptext;
3033 char mapfilename[MAX_QPATH];
3034 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
3035 strlcat (mapfilename, ".map", sizeof (mapfilename));
3036 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
3040 if (!COM_ParseToken_Simple(&data, false, false))
3045 if (!COM_ParseToken_Simple(&data, false, false))
3047 if (com_token[0] != '{')
3053 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
3056 if (!COM_ParseToken_Simple(&data, false, false))
3058 if (com_token[0] == '}')
3059 break; // end of entity
3060 if (com_token[0] == '{')
3067 if (submodel > loadmodel->brush.numsubmodels)
3069 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
3073 model = loadmodel->brush.submodels[submodel];
3080 if (!COM_ParseToken_Simple(&data, false, false))
3082 if (com_token[0] == '}')
3083 break; // end of brush
3084 // each brush face should be this format:
3085 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
3086 // FIXME: support hl .map format
3087 for (pointnum = 0;pointnum < 3;pointnum++)
3089 COM_ParseToken_Simple(&data, false, false);
3090 for (componentnum = 0;componentnum < 3;componentnum++)
3092 COM_ParseToken_Simple(&data, false, false);
3093 point[pointnum][componentnum] = atof(com_token);
3095 COM_ParseToken_Simple(&data, false, false);
3097 COM_ParseToken_Simple(&data, false, false);
3098 strlcpy(facetexture, com_token, sizeof(facetexture));
3099 COM_ParseToken_Simple(&data, false, false);
3100 //scroll_s = atof(com_token);
3101 COM_ParseToken_Simple(&data, false, false);
3102 //scroll_t = atof(com_token);
3103 COM_ParseToken_Simple(&data, false, false);
3104 //rotate = atof(com_token);
3105 COM_ParseToken_Simple(&data, false, false);
3106 //scale_s = atof(com_token);
3107 COM_ParseToken_Simple(&data, false, false);
3108 //scale_t = atof(com_token);
3109 TriangleNormal(point[0], point[1], point[2], planenormal);
3110 VectorNormalizeDouble(planenormal);
3111 planedist = DotProduct(point[0], planenormal);
3112 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
3122 #define MAX_PORTALPOINTS 64
3124 typedef struct portal_s
3127 mnode_t *nodes[2]; // [0] = front side of plane
3128 struct portal_s *next[2];
3130 double points[3*MAX_PORTALPOINTS];
3131 struct portal_s *chain; // all portals are linked into a list
3135 static memexpandablearray_t portalarray;
3137 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
3139 // process only nodes (leafs already had their box calculated)
3143 // calculate children first
3144 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
3145 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
3147 // make combined bounding box from children
3148 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
3149 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
3150 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
3151 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
3152 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
3153 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
3156 static void Mod_Q1BSP_FinalizePortals(void)
3158 int i, j, numportals, numpoints, portalindex, portalrange = Mem_ExpandableArray_IndexRange(&portalarray);
3162 mleaf_t *leaf, *endleaf;
3164 // tally up portal and point counts and recalculate bounding boxes for all
3165 // leafs (because qbsp is very sloppy)
3166 leaf = loadmodel->brush.data_leafs;
3167 endleaf = leaf + loadmodel->brush.num_leafs;
3168 if (mod_recalculatenodeboxes.integer)
3170 for (;leaf < endleaf;leaf++)
3172 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
3173 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3178 for (portalindex = 0;portalindex < portalrange;portalindex++)
3180 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3183 // note: this check must match the one below or it will usually corrupt memory
3184 // 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
3185 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3188 numpoints += p->numpoints * 2;
3191 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3192 loadmodel->brush.num_portals = numportals;
3193 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3194 loadmodel->brush.num_portalpoints = numpoints;
3195 // clear all leaf portal chains
3196 for (i = 0;i < loadmodel->brush.num_leafs;i++)
3197 loadmodel->brush.data_leafs[i].portals = NULL;
3198 // process all portals in the global portal chain, while freeing them
3199 portal = loadmodel->brush.data_portals;
3200 point = loadmodel->brush.data_portalpoints;
3201 for (portalindex = 0;portalindex < portalrange;portalindex++)
3203 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3206 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3208 // note: this check must match the one above or it will usually corrupt memory
3209 // 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
3210 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3212 // first make the back to front portal(forward portal)
3213 portal->points = point;
3214 portal->numpoints = p->numpoints;
3215 portal->plane.dist = p->plane.dist;
3216 VectorCopy(p->plane.normal, portal->plane.normal);
3217 portal->here = (mleaf_t *)p->nodes[1];
3218 portal->past = (mleaf_t *)p->nodes[0];
3220 for (j = 0;j < portal->numpoints;j++)
3222 VectorCopy(p->points + j*3, point->position);
3225 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3226 PlaneClassify(&portal->plane);
3228 // link into leaf's portal chain
3229 portal->next = portal->here->portals;
3230 portal->here->portals = portal;
3232 // advance to next portal
3235 // then make the front to back portal(backward portal)
3236 portal->points = point;
3237 portal->numpoints = p->numpoints;
3238 portal->plane.dist = -p->plane.dist;
3239 VectorNegate(p->plane.normal, portal->plane.normal);
3240 portal->here = (mleaf_t *)p->nodes[0];
3241 portal->past = (mleaf_t *)p->nodes[1];
3243 for (j = portal->numpoints - 1;j >= 0;j--)
3245 VectorCopy(p->points + j*3, point->position);
3248 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3249 PlaneClassify(&portal->plane);
3251 // link into leaf's portal chain
3252 portal->next = portal->here->portals;
3253 portal->here->portals = portal;
3255 // advance to next portal
3258 // add the portal's polygon points to the leaf bounding boxes
3259 if (mod_recalculatenodeboxes.integer)
3261 for (i = 0;i < 2;i++)
3263 leaf = (mleaf_t *)p->nodes[i];
3264 for (j = 0;j < p->numpoints;j++)
3266 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3267 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3268 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3269 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3270 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3271 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3277 // now recalculate the node bounding boxes from the leafs
3278 if (mod_recalculatenodeboxes.integer)
3279 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3287 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3290 Host_Error("AddPortalToNodes: NULL front node");
3292 Host_Error("AddPortalToNodes: NULL back node");
3293 if (p->nodes[0] || p->nodes[1])
3294 Host_Error("AddPortalToNodes: already included");
3295 // 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
3297 p->nodes[0] = front;
3298 p->next[0] = (portal_t *)front->portals;
3299 front->portals = (mportal_t *)p;
3302 p->next[1] = (portal_t *)back->portals;
3303 back->portals = (mportal_t *)p;
3308 RemovePortalFromNode
3311 static void RemovePortalFromNodes(portal_t *portal)
3315 void **portalpointer;
3317 for (i = 0;i < 2;i++)
3319 node = portal->nodes[i];
3321 portalpointer = (void **) &node->portals;
3324 t = (portal_t *)*portalpointer;
3326 Host_Error("RemovePortalFromNodes: portal not in leaf");
3330 if (portal->nodes[0] == node)
3332 *portalpointer = portal->next[0];
3333 portal->nodes[0] = NULL;
3335 else if (portal->nodes[1] == node)
3337 *portalpointer = portal->next[1];
3338 portal->nodes[1] = NULL;
3341 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3345 if (t->nodes[0] == node)
3346 portalpointer = (void **) &t->next[0];
3347 else if (t->nodes[1] == node)
3348 portalpointer = (void **) &t->next[1];
3350 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3355 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3356 static double *portalpointsbuffer;
3357 static int portalpointsbufferoffset;
3358 static int portalpointsbuffersize;
3359 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3362 mnode_t *front, *back, *other_node;
3363 mplane_t clipplane, *plane;
3364 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3365 int numfrontpoints, numbackpoints;
3366 double *frontpoints, *backpoints;
3368 // if a leaf, we're done
3372 // get some space for our clipping operations to use
3373 if (portalpointsbuffersize < portalpointsbufferoffset + 6*MAX_PORTALPOINTS)
3375 portalpointsbuffersize = portalpointsbufferoffset * 2;
3376 portalpointsbuffer = (double *)Mem_Realloc(loadmodel->mempool, portalpointsbuffer, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3378 frontpoints = portalpointsbuffer + portalpointsbufferoffset;
3379 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3380 backpoints = portalpointsbuffer + portalpointsbufferoffset;
3381 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3383 plane = node->plane;
3385 front = node->children[0];
3386 back = node->children[1];
3388 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3390 // create the new portal by generating a polygon for the node plane,
3391 // and clipping it by all of the other portals(which came from nodes above this one)
3392 nodeportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3393 nodeportal->plane = *plane;
3395 // 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)
3396 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);
3397 nodeportal->numpoints = 4;
3398 side = 0; // shut up compiler warning
3399 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3401 clipplane = portal->plane;
3402 if (portal->nodes[0] == portal->nodes[1])
3403 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3404 if (portal->nodes[0] == node)
3406 else if (portal->nodes[1] == node)
3408 clipplane.dist = -clipplane.dist;
3409 VectorNegate(clipplane.normal, clipplane.normal);
3413 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3415 for (i = 0;i < nodeportal->numpoints*3;i++)
3416 frontpoints[i] = nodeportal->points[i];
3417 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);
3418 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3422 if (nodeportal->numpoints < 3)
3424 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3425 nodeportal->numpoints = 0;
3427 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3429 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3430 nodeportal->numpoints = 0;
3433 AddPortalToNodes(nodeportal, front, back);
3435 // split the portals of this node along this node's plane and assign them to the children of this node
3436 // (migrating the portals downward through the tree)
3437 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3439 if (portal->nodes[0] == portal->nodes[1])
3440 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3441 if (portal->nodes[0] == node)
3443 else if (portal->nodes[1] == node)
3446 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3447 nextportal = portal->next[side];
3448 if (!portal->numpoints)
3451 other_node = portal->nodes[!side];
3452 RemovePortalFromNodes(portal);
3454 // cut the portal into two portals, one on each side of the node plane
3455 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);
3457 if (!numfrontpoints)
3460 AddPortalToNodes(portal, back, other_node);
3462 AddPortalToNodes(portal, other_node, back);
3468 AddPortalToNodes(portal, front, other_node);
3470 AddPortalToNodes(portal, other_node, front);
3474 // the portal is split
3475 splitportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3476 temp = splitportal->chain;
3477 *splitportal = *portal;
3478 splitportal->chain = temp;
3479 for (i = 0;i < numbackpoints*3;i++)
3480 splitportal->points[i] = backpoints[i];
3481 splitportal->numpoints = numbackpoints;
3482 for (i = 0;i < numfrontpoints*3;i++)
3483 portal->points[i] = frontpoints[i];
3484 portal->numpoints = numfrontpoints;
3488 AddPortalToNodes(portal, front, other_node);
3489 AddPortalToNodes(splitportal, back, other_node);
3493 AddPortalToNodes(portal, other_node, front);
3494 AddPortalToNodes(splitportal, other_node, back);
3498 Mod_Q1BSP_RecursiveNodePortals(front);
3499 Mod_Q1BSP_RecursiveNodePortals(back);
3501 portalpointsbufferoffset -= 6*MAX_PORTALPOINTS;
3504 static void Mod_Q1BSP_MakePortals(void)
3506 Mem_ExpandableArray_NewArray(&portalarray, loadmodel->mempool, sizeof(portal_t), 1020*1024/sizeof(portal_t));
3507 portalpointsbufferoffset = 0;
3508 portalpointsbuffersize = 6*MAX_PORTALPOINTS*128;
3509 portalpointsbuffer = (double *)Mem_Alloc(loadmodel->mempool, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3510 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3511 Mem_Free(portalpointsbuffer);
3512 portalpointsbuffer = NULL;
3513 portalpointsbufferoffset = 0;
3514 portalpointsbuffersize = 0;
3515 Mod_Q1BSP_FinalizePortals();
3516 Mem_ExpandableArray_FreeArray(&portalarray);
3519 //Returns PVS data for a given point
3520 //(note: can return NULL)
3521 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3524 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3526 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3527 if (((mleaf_t *)node)->clusterindex >= 0)
3528 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3533 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)
3537 float d = PlaneDiff(org, node->plane);
3539 node = node->children[0];
3540 else if (d < -radius)
3541 node = node->children[1];
3544 // go down both sides
3545 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3546 node = node->children[1];
3549 // if this leaf is in a cluster, accumulate the pvs bits
3550 if (((mleaf_t *)node)->clusterindex >= 0)
3553 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3554 for (i = 0;i < pvsbytes;i++)
3555 pvsbuffer[i] |= pvs[i];
3559 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3560 //of the given point.
3561 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3563 int bytes = model->brush.num_pvsclusterbytes;
3564 bytes = min(bytes, pvsbufferlength);
3565 if (r_novis.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3567 memset(pvsbuffer, 0xFF, bytes);
3571 memset(pvsbuffer, 0, bytes);
3572 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3576 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3581 VectorSubtract(inmaxs, inmins, size);
3582 if (cmodel->brush.ishlbsp)
3585 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3586 else if (size[0] <= 32)
3588 if (size[2] < 54) // pick the nearest of 36 or 72
3589 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3591 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3594 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3599 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3600 else if (size[0] <= 32)
3601 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3603 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3605 VectorCopy(inmins, outmins);
3606 VectorAdd(inmins, hull->clip_size, outmaxs);
3609 static int Mod_Q1BSP_CreateShadowMesh(dp_model_t *mod)
3612 int numshadowmeshtriangles = 0;
3613 msurface_t *surface;
3614 if (cls.state == ca_dedicated)
3616 // make a single combined shadow mesh to allow optimized shadow volume creation
3618 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3620 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3621 numshadowmeshtriangles += surface->num_triangles;
3623 mod->brush.shadowmesh = Mod_ShadowMesh_Begin(mod->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3624 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3625 if (surface->num_triangles > 0)
3626 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));
3627 mod->brush.shadowmesh = Mod_ShadowMesh_Finish(mod->mempool, mod->brush.shadowmesh, false, r_enableshadowvolumes.integer != 0, false);
3628 if (mod->brush.shadowmesh && mod->brush.shadowmesh->neighbor3i)
3629 Mod_BuildTriangleNeighbors(mod->brush.shadowmesh->neighbor3i, mod->brush.shadowmesh->element3i, mod->brush.shadowmesh->numtriangles);
3631 return numshadowmeshtriangles;
3634 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);
3636 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3641 float dist, modelyawradius, modelradius;
3642 msurface_t *surface;
3643 hullinfo_t hullinfo;
3644 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3645 model_brush_lightstyleinfo_t styleinfo[256];
3646 unsigned char *datapointer;
3648 mod->modeldatatypestring = "Q1BSP";
3650 mod->type = mod_brushq1;
3652 header = (dheader_t *)buffer;
3654 i = LittleLong(header->version);
3655 if (i != BSPVERSION && i != 30)
3656 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3657 mod->brush.ishlbsp = i == 30;
3659 // fill in hull info
3660 VectorClear (hullinfo.hullsizes[0][0]);
3661 VectorClear (hullinfo.hullsizes[0][1]);
3662 if (mod->brush.ishlbsp)
3664 mod->modeldatatypestring = "HLBSP";
3666 hullinfo.filehulls = 4;
3667 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3668 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3669 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3670 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3671 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3672 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3676 hullinfo.filehulls = 4;
3677 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3678 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3679 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3680 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3684 mod_base = (unsigned char*)buffer;
3685 for (i = 0; i < HEADER_LUMPS; i++)
3687 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3688 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3691 mod->soundfromcenter = true;
3692 mod->TraceBox = Mod_Q1BSP_TraceBox;
3693 mod->TraceLine = Mod_Q1BSP_TraceLineAgainstSurfaces; // LordHavoc: use the surface-hitting version of TraceLine in all cases
3694 mod->TracePoint = Mod_Q1BSP_TracePoint;
3695 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3696 mod->TraceLineAgainstSurfaces = Mod_Q1BSP_TraceLineAgainstSurfaces;
3697 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3698 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3699 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3700 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3701 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3702 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3703 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3704 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3705 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3706 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3707 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3708 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3709 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3710 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3711 mod->Draw = R_Q1BSP_Draw;
3712 mod->DrawDepth = R_Q1BSP_DrawDepth;
3713 mod->DrawDebug = R_Q1BSP_DrawDebug;
3714 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
3715 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3716 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3717 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3718 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3719 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3720 mod->DrawLight = R_Q1BSP_DrawLight;
3724 mod->brush.qw_md4sum = 0;
3725 mod->brush.qw_md4sum2 = 0;
3726 for (i = 0;i < HEADER_LUMPS;i++)
3729 if (i == LUMP_ENTITIES)
3731 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3732 mod->brush.qw_md4sum ^= LittleLong(temp);
3733 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3735 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3736 mod->brush.qw_md4sum2 ^= LittleLong(temp);
3739 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3740 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3741 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3742 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3743 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3744 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3745 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3746 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3747 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3748 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3749 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3750 // load submodels before leafs because they contain the number of vis leafs
3751 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3752 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3753 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3754 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3756 // check if the map supports transparent water rendering
3757 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3759 if (mod->brushq1.data_compressedpvs)
3760 Mem_Free(mod->brushq1.data_compressedpvs);
3761 mod->brushq1.data_compressedpvs = NULL;
3762 mod->brushq1.num_compressedpvs = 0;
3764 Mod_Q1BSP_MakeHull0();
3765 if (mod_bsp_portalize.integer)
3766 Mod_Q1BSP_MakePortals();
3768 mod->numframes = 2; // regular and alternate animation
3771 // make a single combined shadow mesh to allow optimized shadow volume creation
3772 Mod_Q1BSP_CreateShadowMesh(loadmodel);
3774 if (loadmodel->brush.numsubmodels)
3775 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3777 // LordHavoc: to clear the fog around the original quake submodel code, I
3779 // first of all, some background info on the submodels:
3780 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3781 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3782 // now the weird for loop itself:
3783 // the loop functions in an odd way, on each iteration it sets up the
3784 // current 'mod' model (which despite the confusing code IS the model of
3785 // the number i), at the end of the loop it duplicates the model to become
3786 // the next submodel, and loops back to set up the new submodel.
3788 // LordHavoc: now the explanation of my sane way (which works identically):
3789 // set up the world model, then on each submodel copy from the world model
3790 // and set up the submodel with the respective model info.
3791 totalstylesurfaces = 0;
3793 for (i = 0;i < mod->brush.numsubmodels;i++)
3795 memset(stylecounts, 0, sizeof(stylecounts));
3796 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3798 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3799 for (j = 0;j < MAXLIGHTMAPS;j++)
3800 stylecounts[surface->lightmapinfo->styles[j]]++;
3802 for (k = 0;k < 255;k++)
3806 totalstylesurfaces += stylecounts[k];
3809 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3810 for (i = 0;i < mod->brush.numsubmodels;i++)
3812 // LordHavoc: this code was originally at the end of this loop, but
3813 // has been transformed to something more readable at the start here.
3818 // duplicate the basic information
3819 dpsnprintf(name, sizeof(name), "*%i", i);
3820 mod = Mod_FindName(name, loadmodel->name);
3821 // copy the base model to this one
3823 // rename the clone back to its proper name
3824 strlcpy(mod->name, name, sizeof(mod->name));
3825 mod->brush.parentmodel = loadmodel;
3826 // textures and memory belong to the main model
3827 mod->texturepool = NULL;
3828 mod->mempool = NULL;
3829 mod->brush.GetPVS = NULL;
3830 mod->brush.FatPVS = NULL;
3831 mod->brush.BoxTouchingPVS = NULL;
3832 mod->brush.BoxTouchingLeafPVS = NULL;
3833 mod->brush.BoxTouchingVisibleLeafs = NULL;
3834 mod->brush.FindBoxClusters = NULL;
3835 mod->brush.LightPoint = NULL;
3836 mod->brush.AmbientSoundLevelsForPoint = NULL;
3839 mod->brush.submodel = i;
3841 if (loadmodel->brush.submodels)
3842 loadmodel->brush.submodels[i] = mod;
3844 bm = &mod->brushq1.submodels[i];
3846 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3847 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3849 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3850 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3853 mod->firstmodelsurface = bm->firstface;
3854 mod->nummodelsurfaces = bm->numfaces;
3856 // set node/leaf parents for this submodel
3857 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
3859 // make the model surface list (used by shadowing/lighting)
3860 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3861 Mod_MakeSortedSurfaces(mod);
3863 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3864 // (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)
3865 VectorCopy(bm->mins, mod->normalmins);
3866 VectorCopy(bm->maxs, mod->normalmaxs);
3867 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3868 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3869 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3870 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3871 modelradius = modelyawradius + modelradius * modelradius;
3872 modelyawradius = sqrt(modelyawradius);
3873 modelradius = sqrt(modelradius);
3874 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3875 mod->yawmins[2] = mod->normalmins[2];
3876 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
3877 mod->yawmaxs[2] = mod->normalmaxs[2];
3878 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3879 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3880 mod->radius = modelradius;
3881 mod->radius2 = modelradius * modelradius;
3883 // this gets altered below if sky or water is used
3884 mod->DrawSky = NULL;
3885 mod->DrawAddWaterPlanes = NULL;
3887 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3888 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3889 if (mod->nummodelsurfaces)
3891 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3892 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3894 if (j < mod->nummodelsurfaces)
3895 mod->DrawSky = R_Q1BSP_DrawSky;
3897 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3898 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
3900 if (j < mod->nummodelsurfaces)
3901 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3903 // build lightstyle update chains
3904 // (used to rapidly mark lightmapupdateflags on many surfaces
3905 // when d_lightstylevalue changes)
3906 memset(stylecounts, 0, sizeof(stylecounts));
3907 for (k = 0;k < mod->nummodelsurfaces;k++)
3909 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3910 for (j = 0;j < MAXLIGHTMAPS;j++)
3911 stylecounts[surface->lightmapinfo->styles[j]]++;
3913 mod->brushq1.num_lightstyles = 0;
3914 for (k = 0;k < 255;k++)
3918 styleinfo[mod->brushq1.num_lightstyles].style = k;
3919 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3920 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3921 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3922 remapstyles[k] = mod->brushq1.num_lightstyles;
3923 mod->brushq1.num_lightstyles++;
3926 for (k = 0;k < mod->nummodelsurfaces;k++)
3928 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3929 for (j = 0;j < MAXLIGHTMAPS;j++)
3931 if (surface->lightmapinfo->styles[j] != 255)
3933 int r = remapstyles[surface->lightmapinfo->styles[j]];
3934 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3938 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3939 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3943 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3944 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3946 //mod->brushq1.num_visleafs = bm->visleafs;
3948 // build a Bounding Interval Hierarchy for culling triangles in light rendering
3949 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
3951 if (mod_q1bsp_polygoncollisions.integer)
3953 mod->collision_bih = mod->render_bih;
3954 // point traces and contents checks still use the bsp tree
3955 mod->TraceLine = Mod_CollisionBIH_TraceLine;
3956 mod->TraceBox = Mod_CollisionBIH_TraceBox;
3957 mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
3958 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLineAgainstSurfaces;
3961 // generate VBOs and other shared data before cloning submodels
3965 Mod_Q1BSP_LoadMapBrushes();
3966 //Mod_Q1BSP_ProcessLightList();
3970 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);
3973 static void Mod_Q2BSP_LoadEntities(lump_t *l)
3977 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
3984 in = (void *)(mod_base + l->fileofs);
3985 if (l->filelen % sizeof(*in))
3986 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
3987 count = l->filelen / sizeof(*in);
3988 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
3991 loadmodel->num = count;
3993 for (i = 0;i < count;i++, in++, out++)
3999 static void Mod_Q2BSP_LoadVertices(lump_t *l)
4006 in = (void *)(mod_base + l->fileofs);
4007 if (l->filelen % sizeof(*in))
4008 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4009 count = l->filelen / sizeof(*in);
4010 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4013 loadmodel->num = count;
4015 for (i = 0;i < count;i++, in++, out++)
4021 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
4028 in = (void *)(mod_base + l->fileofs);
4029 if (l->filelen % sizeof(*in))
4030 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
4031 count = l->filelen / sizeof(*in);
4032 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4035 loadmodel->num = count;
4037 for (i = 0;i < count;i++, in++, out++)
4043 static void Mod_Q2BSP_LoadNodes(lump_t *l)
4050 in = (void *)(mod_base + l->fileofs);
4051 if (l->filelen % sizeof(*in))
4052 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4053 count = l->filelen / sizeof(*in);
4054 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4057 loadmodel->num = count;
4059 for (i = 0;i < count;i++, in++, out++)
4065 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
4072 in = (void *)(mod_base + l->fileofs);
4073 if (l->filelen % sizeof(*in))
4074 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
4075 count = l->filelen / sizeof(*in);
4076 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4079 loadmodel->num = count;
4081 for (i = 0;i < count;i++, in++, out++)
4087 static void Mod_Q2BSP_LoadFaces(lump_t *l)
4094 in = (void *)(mod_base + l->fileofs);
4095 if (l->filelen % sizeof(*in))
4096 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4097 count = l->filelen / sizeof(*in);
4098 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4101 loadmodel->num = count;
4103 for (i = 0;i < count;i++, in++, out++)
4109 static void Mod_Q2BSP_LoadLighting(lump_t *l)
4116 in = (void *)(mod_base + l->fileofs);
4117 if (l->filelen % sizeof(*in))
4118 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
4119 count = l->filelen / sizeof(*in);
4120 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4123 loadmodel->num = count;
4125 for (i = 0;i < count;i++, in++, out++)
4131 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
4138 in = (void *)(mod_base + l->fileofs);
4139 if (l->filelen % sizeof(*in))
4140 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4141 count = l->filelen / sizeof(*in);
4142 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4145 loadmodel->num = count;
4147 for (i = 0;i < count;i++, in++, out++)
4153 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
4160 in = (void *)(mod_base + l->fileofs);
4161 if (l->filelen % sizeof(*in))
4162 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4163 count = l->filelen / sizeof(*in);
4164 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4167 loadmodel->num = count;
4169 for (i = 0;i < count;i++, in++, out++)
4175 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
4182 in = (void *)(mod_base + l->fileofs);
4183 if (l->filelen % sizeof(*in))
4184 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4185 count = l->filelen / sizeof(*in);
4186 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4189 loadmodel->num = count;
4191 for (i = 0;i < count;i++, in++, out++)
4197 static void Mod_Q2BSP_LoadEdges(lump_t *l)
4204 in = (void *)(mod_base + l->fileofs);
4205 if (l->filelen % sizeof(*in))
4206 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
4207 count = l->filelen / sizeof(*in);
4208 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4211 loadmodel->num = count;
4213 for (i = 0;i < count;i++, in++, out++)
4219 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
4226 in = (void *)(mod_base + l->fileofs);
4227 if (l->filelen % sizeof(*in))
4228 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
4229 count = l->filelen / sizeof(*in);
4230 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4233 loadmodel->num = count;
4235 for (i = 0;i < count;i++, in++, out++)
4241 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4248 in = (void *)(mod_base + l->fileofs);
4249 if (l->filelen % sizeof(*in))
4250 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4251 count = l->filelen / sizeof(*in);
4252 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4255 loadmodel->num = count;
4257 for (i = 0;i < count;i++, in++, out++)
4263 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4270 in = (void *)(mod_base + l->fileofs);
4271 if (l->filelen % sizeof(*in))
4272 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4273 count = l->filelen / sizeof(*in);
4274 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4277 loadmodel->num = count;
4279 for (i = 0;i < count;i++, in++, out++)
4285 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4292 in = (void *)(mod_base + l->fileofs);
4293 if (l->filelen % sizeof(*in))
4294 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4295 count = l->filelen / sizeof(*in);
4296 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4299 loadmodel->num = count;
4301 for (i = 0;i < count;i++, in++, out++)
4307 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4314 in = (void *)(mod_base + l->fileofs);
4315 if (l->filelen % sizeof(*in))
4316 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4317 count = l->filelen / sizeof(*in);
4318 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4321 loadmodel->num = count;
4323 for (i = 0;i < count;i++, in++, out++)
4329 static void Mod_Q2BSP_LoadModels(lump_t *l)
4336 in = (void *)(mod_base + l->fileofs);
4337 if (l->filelen % sizeof(*in))
4338 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4339 count = l->filelen / sizeof(*in);
4340 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4343 loadmodel->num = count;
4345 for (i = 0;i < count;i++, in++, out++)
4351 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4354 q2dheader_t *header;
4356 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4358 mod->modeldatatypestring = "Q2BSP";
4360 mod->type = mod_brushq2;
4362 header = (q2dheader_t *)buffer;
4364 i = LittleLong(header->version);
4365 if (i != Q2BSPVERSION)
4366 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4368 mod_base = (unsigned char *)header;
4370 // swap all the lumps
4371 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4372 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4374 mod->brush.qw_md4sum = 0;
4375 mod->brush.qw_md4sum2 = 0;
4376 for (i = 0;i < Q2HEADER_LUMPS;i++)
4378 if (i == Q2LUMP_ENTITIES)
4380 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4381 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4383 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4386 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4387 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4388 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4389 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4390 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4391 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4392 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4393 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4394 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4395 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4396 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4397 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4398 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4399 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4400 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4401 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4402 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4403 // LordHavoc: must go last because this makes the submodels
4404 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4407 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4408 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4410 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4413 char key[128], value[MAX_INPUTLINE];
4415 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4416 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4417 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4420 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4421 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4422 loadmodel->brush.entities[l->filelen] = 0;
4423 data = loadmodel->brush.entities;
4424 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4425 // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
4426 loadmodel->brushq3.deluxemapping = false;
4427 if (data && COM_ParseToken_Simple(&data, false, false) && com_token[0] == '{')
4431 if (!COM_ParseToken_Simple(&data, false, false))
4433 if (com_token[0] == '}')
4434 break; // end of worldspawn
4435 if (com_token[0] == '_')
4436 strlcpy(key, com_token + 1, sizeof(key));
4438 strlcpy(key, com_token, sizeof(key));
4439 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4440 key[strlen(key)-1] = 0;
4441 if (!COM_ParseToken_Simple(&data, false, false))
4443 strlcpy(value, com_token, sizeof(value));
4444 if (!strcasecmp("gridsize", key)) // this one is case insensitive to 100% match q3map2
4446 #if _MSC_VER >= 1400
4447 #define sscanf sscanf_s
4450 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4451 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4453 VectorSet(v, 64, 64, 128);
4454 if(sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) != 3)
4455 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]);
4456 if (v[0] != 0 && v[1] != 0 && v[2] != 0)
4457 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4460 else if (!strcmp("deluxeMaps", key))
4462 if (!strcmp(com_token, "1"))
4464 loadmodel->brushq3.deluxemapping = true;
4465 loadmodel->brushq3.deluxemapping_modelspace = true;
4467 else if (!strcmp(com_token, "2"))
4469 loadmodel->brushq3.deluxemapping = true;
4470 loadmodel->brushq3.deluxemapping_modelspace = false;
4477 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4483 in = (q3dtexture_t *)(mod_base + l->fileofs);
4484 if (l->filelen % sizeof(*in))
4485 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4486 count = l->filelen / sizeof(*in);
4487 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4489 loadmodel->data_textures = out;
4490 loadmodel->num_textures = count;
4491 loadmodel->num_texturesperskin = loadmodel->num_textures;
4493 for (i = 0;i < count;i++)
4495 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4496 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4497 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4498 Mod_LoadTextureFromQ3Shader(out + i, out[i].name, true, true, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS);
4499 // restore the surfaceflags and supercontents
4500 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4501 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4505 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4511 in = (q3dplane_t *)(mod_base + l->fileofs);
4512 if (l->filelen % sizeof(*in))
4513 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4514 count = l->filelen / sizeof(*in);
4515 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4517 loadmodel->brush.data_planes = out;
4518 loadmodel->brush.num_planes = count;
4520 for (i = 0;i < count;i++, in++, out++)
4522 out->normal[0] = LittleFloat(in->normal[0]);
4523 out->normal[1] = LittleFloat(in->normal[1]);
4524 out->normal[2] = LittleFloat(in->normal[2]);
4525 out->dist = LittleFloat(in->dist);
4530 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4533 q3mbrushside_t *out;
4536 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4537 if (l->filelen % sizeof(*in))
4538 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4539 count = l->filelen / sizeof(*in);
4540 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4542 loadmodel->brush.data_brushsides = out;
4543 loadmodel->brush.num_brushsides = count;
4545 for (i = 0;i < count;i++, in++, out++)
4547 n = LittleLong(in->planeindex);
4548 if (n < 0 || n >= loadmodel->brush.num_planes)
4549 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4550 out->plane = loadmodel->brush.data_planes + n;
4551 n = LittleLong(in->textureindex);
4552 if (n < 0 || n >= loadmodel->num_textures)
4553 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4554 out->texture = loadmodel->data_textures + n;
4558 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4560 q3dbrushside_ig_t *in;
4561 q3mbrushside_t *out;
4564 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4565 if (l->filelen % sizeof(*in))
4566 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4567 count = l->filelen / sizeof(*in);
4568 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4570 loadmodel->brush.data_brushsides = out;
4571 loadmodel->brush.num_brushsides = count;
4573 for (i = 0;i < count;i++, in++, out++)
4575 n = LittleLong(in->planeindex);
4576 if (n < 0 || n >= loadmodel->brush.num_planes)
4577 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4578 out->plane = loadmodel->brush.data_planes + n;
4579 n = LittleLong(in->textureindex);
4580 if (n < 0 || n >= loadmodel->num_textures)
4581 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4582 out->texture = loadmodel->data_textures + n;
4586 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4590 int i, j, n, c, count, maxplanes, q3surfaceflags;
4591 colplanef_t *planes;
4593 in = (q3dbrush_t *)(mod_base + l->fileofs);
4594 if (l->filelen % sizeof(*in))
4595 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4596 count = l->filelen / sizeof(*in);
4597 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4599 loadmodel->brush.data_brushes = out;
4600 loadmodel->brush.num_brushes = count;
4605 for (i = 0;i < count;i++, in++, out++)
4607 n = LittleLong(in->firstbrushside);
4608 c = LittleLong(in->numbrushsides);
4609 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4610 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4611 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4612 out->numbrushsides = c;
4613 n = LittleLong(in->textureindex);
4614 if (n < 0 || n >= loadmodel->num_textures)
4615 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4616 out->texture = loadmodel->data_textures + n;
4618 // make a list of mplane_t structs to construct a colbrush from
4619 if (maxplanes < out->numbrushsides)
4621 maxplanes = out->numbrushsides;
4624 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4627 for (j = 0;j < out->numbrushsides;j++)
4629 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4630 planes[j].dist = out->firstbrushside[j].plane->dist;
4631 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4632 planes[j].texture = out->firstbrushside[j].texture;
4633 q3surfaceflags |= planes[j].q3surfaceflags;
4635 // make the colbrush from the planes
4636 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4638 // this whole loop can take a while (e.g. on redstarrepublic4)
4639 CL_KeepaliveMessage(false);
4645 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4651 in = (q3deffect_t *)(mod_base + l->fileofs);
4652 if (l->filelen % sizeof(*in))
4653 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4654 count = l->filelen / sizeof(*in);
4655 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4657 loadmodel->brushq3.data_effects = out;
4658 loadmodel->brushq3.num_effects = count;
4660 for (i = 0;i < count;i++, in++, out++)
4662 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4663 n = LittleLong(in->brushindex);
4664 if (n >= loadmodel->brush.num_brushes)
4666 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4669 out->brushindex = n;
4670 out->unknown = LittleLong(in->unknown);
4674 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4679 in = (q3dvertex_t *)(mod_base + l->fileofs);
4680 if (l->filelen % sizeof(*in))
4681 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4682 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4683 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4684 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4685 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4686 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4687 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4689 for (i = 0;i < count;i++, in++)
4691 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4692 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4693 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4694 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4695 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4696 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4697 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4698 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4699 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4700 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4701 // svector/tvector are calculated later in face loading
4702 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4703 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4704 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4705 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4706 if(in->color4ub[0] != 255 || in->color4ub[1] != 255 || in->color4ub[2] != 255)
4707 loadmodel->lit = true;
4711 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4717 in = (int *)(mod_base + l->fileofs);
4718 if (l->filelen % sizeof(int[3]))
4719 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4720 count = l->filelen / sizeof(*in);
4722 if(!loadmodel->brushq3.num_vertices)
4725 Con_Printf("Mod_Q3BSP_LoadTriangles: %s has triangles but no vertexes, broken compiler, ignoring problem\n", loadmodel->name);
4726 loadmodel->brushq3.num_triangles = 0;
4730 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4731 loadmodel->brushq3.num_triangles = count / 3;
4732 loadmodel->brushq3.data_element3i = out;
4734 for (i = 0;i < count;i++, in++, out++)
4736 *out = LittleLong(*in);
4737 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4739 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4745 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4747 q3dlightmap_t *input_pointer;
4765 int mergedrowsxcolumns;
4770 unsigned char *mergedpixels;
4771 unsigned char *mergeddeluxepixels;
4772 unsigned char *mergebuf;
4773 char mapname[MAX_QPATH];
4775 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4777 // defaults for q3bsp
4784 loadmodel->brushq3.lightmapsize = 128;
4786 if (cls.state == ca_dedicated)
4789 if(mod_q3bsp_nolightmaps.integer)
4795 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4796 if (developer_loading.integer)
4797 Con_Printf("Using internal lightmaps\n");
4798 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4799 if (l->filelen % sizeof(*input_pointer))
4800 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4801 count = l->filelen / sizeof(*input_pointer);
4802 for(i = 0; i < count; ++i)
4803 inpixels[i] = input_pointer[i].rgb;
4807 // no internal lightmaps
4808 // try external lightmaps
4809 if (developer_loading.integer)
4810 Con_Printf("Using external lightmaps\n");
4811 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4812 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false, false, NULL);
4816 // using EXTERNAL lightmaps instead
4817 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4819 Mem_Free(inpixels[0]);
4820 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4830 for(count = 1; ; ++count)
4832 inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false, false, NULL);
4833 if(!inpixels[count])
4834 break; // we got all of them
4835 if(image_width != size || image_height != size)
4837 Mem_Free(inpixels[count]);
4838 inpixels[count] = NULL;
4839 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);
4845 loadmodel->brushq3.lightmapsize = size;
4846 loadmodel->brushq3.num_originallightmaps = count;
4848 // now check the surfaces to see if any of them index an odd numbered
4849 // lightmap, if so this is not a deluxemapped bsp file
4851 // also check what lightmaps are actually used, because q3map2 sometimes
4852 // (always?) makes an unused one at the end, which
4853 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4854 // reason when only one lightmap is used, which can throw off the
4855 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4856 // to see if the second lightmap is blank, if so it is not deluxemapped.
4857 // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
4858 // in Mod_Q3BSP_LoadEntities was failed
4859 if (!loadmodel->brushq3.deluxemapping)
4861 loadmodel->brushq3.deluxemapping = !(count & 1);
4862 loadmodel->brushq3.deluxemapping_modelspace = true;
4864 if (loadmodel->brushq3.deluxemapping)
4866 int facecount = faceslump->filelen / sizeof(q3dface_t);
4867 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4868 for (i = 0;i < facecount;i++)
4870 j = LittleLong(faces[i].lightmapindex);
4873 endlightmap = max(endlightmap, j + 1);
4874 if ((j & 1) || j + 1 >= count)
4876 loadmodel->brushq3.deluxemapping = false;
4883 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4884 // reason when only one lightmap is used, which can throw off the
4885 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4886 // to see if the second lightmap is blank, if so it is not deluxemapped.
4888 // further research has shown q3map2 sometimes creates a deluxemap and two
4889 // blank lightmaps, which must be handled properly as well
4890 if (endlightmap == 1 && count > 1)
4893 for (i = 0;i < size*size;i++)
4895 if (c[bytesperpixel*i + rgbmap[0]])
4897 if (c[bytesperpixel*i + rgbmap[1]])
4899 if (c[bytesperpixel*i + rgbmap[2]])
4904 // all pixels in the unused lightmap were black...
4905 loadmodel->brushq3.deluxemapping = false;
4910 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4912 // figure out what the most reasonable merge power is within limits
4914 // find the appropriate NxN dimensions to merge to, to avoid wasted space
4915 realcount = count >> (int)loadmodel->brushq3.deluxemapping;
4917 // figure out how big the merged texture has to be
4918 mergegoal = 128<<bound(0, mod_q3bsp_lightmapmergepower.integer, 6);
4919 mergegoal = bound(size, mergegoal, (int)vid.maxtexturesize_2d);
4920 while (mergegoal > size && mergegoal * mergegoal / 4 >= size * size * realcount)
4922 mergedwidth = mergegoal;
4923 mergedheight = mergegoal;
4924 // choose non-square size (2x1 aspect) if only half the space is used;
4925 // this really only happens when the entire set fits in one texture, if
4926 // there are multiple textures, we don't worry about shrinking the last
4927 // one to fit, because the driver prefers the same texture size on
4928 // consecutive draw calls...
4929 if (mergedwidth * mergedheight / 2 >= size*size*realcount)
4932 loadmodel->brushq3.num_lightmapmergedwidthpower = 0;
4933 loadmodel->brushq3.num_lightmapmergedheightpower = 0;
4934 while (mergedwidth > size<<loadmodel->brushq3.num_lightmapmergedwidthpower)
4935 loadmodel->brushq3.num_lightmapmergedwidthpower++;
4936 while (mergedheight > size<<loadmodel->brushq3.num_lightmapmergedheightpower)
4937 loadmodel->brushq3.num_lightmapmergedheightpower++;
4938 loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower = loadmodel->brushq3.num_lightmapmergedwidthpower + loadmodel->brushq3.num_lightmapmergedheightpower + (loadmodel->brushq3.deluxemapping ? 1 : 0);
4940 powerx = loadmodel->brushq3.num_lightmapmergedwidthpower;
4941 powery = loadmodel->brushq3.num_lightmapmergedheightpower;
4942 powerxy = powerx+powery;
4943 powerdxy = loadmodel->brushq3.deluxemapping + powerxy;
4945 mergedcolumns = 1 << powerx;
4946 mergedrows = 1 << powery;
4947 mergedrowsxcolumns = 1 << powerxy;
4949 loadmodel->brushq3.num_mergedlightmaps = (realcount + (1 << powerxy) - 1) >> powerxy;
4950 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4951 if (loadmodel->brushq3.deluxemapping)
4952 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
4954 // allocate a texture pool if we need it
4955 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
4956 loadmodel->texturepool = R_AllocTexturePool();
4958 mergedpixels = (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4);
4959 mergeddeluxepixels = loadmodel->brushq3.deluxemapping ? (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4) : NULL;
4960 for (i = 0;i < count;i++)
4962 // figure out which merged lightmap texture this fits into
4963 realindex = i >> (int)loadmodel->brushq3.deluxemapping;
4964 lightmapindex = i >> powerdxy;
4966 // choose the destination address
4967 mergebuf = (loadmodel->brushq3.deluxemapping && (i & 1)) ? mergeddeluxepixels : mergedpixels;
4968 mergebuf += 4 * (realindex & (mergedcolumns-1))*size + 4 * ((realindex >> powerx) & (mergedrows-1))*mergedwidth*size;
4969 if ((i & 1) == 0 || !loadmodel->brushq3.deluxemapping)
4970 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);
4972 // convert pixels from RGB or BGRA while copying them into the destination rectangle
4973 for (j = 0;j < size;j++)
4974 for (k = 0;k < size;k++)
4976 mergebuf[(j*mergedwidth+k)*4+0] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[0]];
4977 mergebuf[(j*mergedwidth+k)*4+1] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[1]];
4978 mergebuf[(j*mergedwidth+k)*4+2] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[2]];
4979 mergebuf[(j*mergedwidth+k)*4+3] = 255;
4982 // upload texture if this was the last tile being written to the texture
4983 if (((realindex + 1) & (mergedrowsxcolumns - 1)) == 0 || (realindex + 1) == realcount)
4985 if (loadmodel->brushq3.deluxemapping && (i & 1))
4986 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);
4988 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);
4992 if (mergeddeluxepixels)
4993 Mem_Free(mergeddeluxepixels);
4994 Mem_Free(mergedpixels);
4997 for(i = 0; i < count; ++i)
4998 Mem_Free(inpixels[i]);
5002 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
5007 *collisionstride = stride;
5010 cnt = (num_triangles + stride - 1) / stride;
5011 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
5012 for(j = 0; j < cnt; ++j)
5014 mins = &((*collisionbbox6f)[6 * j + 0]);
5015 maxs = &((*collisionbbox6f)[6 * j + 3]);
5016 for(k = 0; k < stride; ++k)
5018 tri = j * stride + k;
5019 if(tri >= num_triangles)
5021 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
5022 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
5023 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
5024 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
5025 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
5026 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
5027 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
5028 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
5029 if(vert[0] < mins[0]) mins[0] = vert[0];
5030 if(vert[1] < mins[1]) mins[1] = vert[1];
5031 if(vert[2] < mins[2]) mins[2] = vert[2];
5032 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5033 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5034 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5035 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
5036 if(vert[0] < mins[0]) mins[0] = vert[0];
5037 if(vert[1] < mins[1]) mins[1] = vert[1];
5038 if(vert[2] < mins[2]) mins[2] = vert[2];
5039 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5040 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5041 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5046 *collisionbbox6f = NULL;
5049 typedef struct patchtess_s
5053 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
5056 float *originalvertex3f;
5059 #define PATCHTESS_SAME_LODGROUP(a,b) \
5061 (a).lodgroup[0] == (b).lodgroup[0] && \
5062 (a).lodgroup[1] == (b).lodgroup[1] && \
5063 (a).lodgroup[2] == (b).lodgroup[2] && \
5064 (a).lodgroup[3] == (b).lodgroup[3] && \
5065 (a).lodgroup[4] == (b).lodgroup[4] && \
5066 (a).lodgroup[5] == (b).lodgroup[5] \
5069 static void Mod_Q3BSP_LoadFaces(lump_t *l)
5071 q3dface_t *in, *oldin;
5072 msurface_t *out, *oldout;
5073 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;
5074 float lightmaptcbase[2], lightmaptcscale[2];
5075 //int *originalelement3i;
5076 //int *originalneighbor3i;
5077 float *originalvertex3f;
5078 //float *originalsvector3f;
5079 //float *originaltvector3f;
5080 float *originalnormal3f;
5081 float *originalcolor4f;
5082 float *originaltexcoordtexture2f;
5083 float *originaltexcoordlightmap2f;
5084 float *surfacecollisionvertex3f;
5085 int *surfacecollisionelement3i;
5087 patchtess_t *patchtess = NULL;
5088 int patchtesscount = 0;
5091 in = (q3dface_t *)(mod_base + l->fileofs);
5092 if (l->filelen % sizeof(*in))
5093 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
5094 count = l->filelen / sizeof(*in);
5095 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5097 loadmodel->data_surfaces = out;
5098 loadmodel->num_surfaces = count;
5101 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
5109 for (;i < count;i++, in++, out++)
5111 // check face type first
5112 type = LittleLong(in->type);
5113 if (type != Q3FACETYPE_FLAT
5114 && type != Q3FACETYPE_PATCH
5115 && type != Q3FACETYPE_MESH
5116 && type != Q3FACETYPE_FLARE)
5118 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
5122 n = LittleLong(in->textureindex);
5123 if (n < 0 || n >= loadmodel->num_textures)
5125 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
5128 out->texture = loadmodel->data_textures + n;
5129 n = LittleLong(in->effectindex);
5130 if (n < -1 || n >= loadmodel->brushq3.num_effects)
5132 if (developer_extra.integer)
5133 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
5139 out->effect = loadmodel->brushq3.data_effects + n;
5141 if (cls.state != ca_dedicated)
5143 out->lightmaptexture = NULL;
5144 out->deluxemaptexture = r_texture_blanknormalmap;
5145 n = LittleLong(in->lightmapindex);
5148 else if (n >= loadmodel->brushq3.num_originallightmaps)
5150 if(loadmodel->brushq3.num_originallightmaps != 0)
5151 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
5156 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5157 if (loadmodel->brushq3.deluxemapping)
5158 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5159 loadmodel->lit = true;
5163 firstvertex = LittleLong(in->firstvertex);
5164 numvertices = LittleLong(in->numvertices);
5165 firstelement = LittleLong(in->firstelement);
5166 numtriangles = LittleLong(in->numelements) / 3;
5167 if (numtriangles * 3 != LittleLong(in->numelements))
5169 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));
5172 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
5174 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);
5177 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
5179 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);
5184 case Q3FACETYPE_FLAT:
5185 case Q3FACETYPE_MESH:
5186 // no processing necessary
5188 case Q3FACETYPE_PATCH:
5189 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5190 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5191 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))
5193 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
5196 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5198 // convert patch to Q3FACETYPE_MESH
5199 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5200 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5201 // bound to user settings
5202 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
5203 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
5204 // bound to sanity settings
5205 xtess = bound(0, xtess, 1024);
5206 ytess = bound(0, ytess, 1024);
5208 // lower quality collision patches! Same procedure as before, but different cvars
5209 // convert patch to Q3FACETYPE_MESH
5210 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5211 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5212 // bound to user settings
5213 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
5214 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
5215 // bound to sanity settings
5216 cxtess = bound(0, cxtess, 1024);
5217 cytess = bound(0, cytess, 1024);
5219 // store it for the LOD grouping step
5220 patchtess[patchtesscount].info.xsize = patchsize[0];
5221 patchtess[patchtesscount].info.ysize = patchsize[1];
5222 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
5223 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
5224 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
5225 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
5227 patchtess[patchtesscount].surface_id = i;
5228 patchtess[patchtesscount].lodgroup[0] = LittleFloat(in->specific.patch.mins[0]);
5229 patchtess[patchtesscount].lodgroup[1] = LittleFloat(in->specific.patch.mins[1]);
5230 patchtess[patchtesscount].lodgroup[2] = LittleFloat(in->specific.patch.mins[2]);
5231 patchtess[patchtesscount].lodgroup[3] = LittleFloat(in->specific.patch.maxs[0]);
5232 patchtess[patchtesscount].lodgroup[4] = LittleFloat(in->specific.patch.maxs[1]);
5233 patchtess[patchtesscount].lodgroup[5] = LittleFloat(in->specific.patch.maxs[2]);
5234 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
5237 case Q3FACETYPE_FLARE:
5238 if (developer_extra.integer)
5239 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
5243 out->num_vertices = numvertices;
5244 out->num_triangles = numtriangles;
5245 meshvertices += out->num_vertices;
5246 meshtriangles += out->num_triangles;
5249 // Fix patches tesselations so that they make no seams
5253 for(i = 0; i < patchtesscount; ++i)
5255 for(j = i+1; j < patchtesscount; ++j)
5257 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
5260 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
5267 // Calculate resulting number of triangles
5268 collisionvertices = 0;
5269 collisiontriangles = 0;
5270 for(i = 0; i < patchtesscount; ++i)
5272 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
5273 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
5274 numvertices = finalwidth * finalheight;
5275 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5277 oldout[patchtess[i].surface_id].num_vertices = numvertices;
5278 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
5279 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
5280 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
5282 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_COLLISION].xtess);
5283 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_COLLISION].ytess);
5284 numvertices = finalwidth * finalheight;
5285 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5287 oldout[patchtess[i].surface_id].num_collisionvertices = numvertices;
5288 oldout[patchtess[i].surface_id].num_collisiontriangles = numtriangles;
5289 collisionvertices += oldout[patchtess[i].surface_id].num_collisionvertices;
5290 collisiontriangles += oldout[patchtess[i].surface_id].num_collisiontriangles;
5296 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
5297 if (collisiontriangles)
5299 loadmodel->brush.data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, collisionvertices * sizeof(float[3]));
5300 loadmodel->brush.data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, collisiontriangles * sizeof(int[3]));
5304 collisionvertices = 0;
5305 collisiontriangles = 0;
5306 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
5308 if (out->num_vertices < 3 || out->num_triangles < 1)
5311 type = LittleLong(in->type);
5312 firstvertex = LittleLong(in->firstvertex);
5313 firstelement = LittleLong(in->firstelement);
5314 out->num_firstvertex = meshvertices;
5315 out->num_firsttriangle = meshtriangles;
5316 out->num_firstcollisiontriangle = collisiontriangles;
5319 case Q3FACETYPE_FLAT:
5320 case Q3FACETYPE_MESH:
5321 // no processing necessary, except for lightmap merging
5322 for (j = 0;j < out->num_vertices;j++)
5324 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5325 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5326 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5327 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5328 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5329 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5330 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5331 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5332 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5333 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5334 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5335 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5336 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5337 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5339 for (j = 0;j < out->num_triangles*3;j++)
5340 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5342 case Q3FACETYPE_PATCH:
5343 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5344 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5345 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5346 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5347 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5348 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5349 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5351 xtess = ytess = cxtess = cytess = -1;
5352 for(j = 0; j < patchtesscount; ++j)
5353 if(patchtess[j].surface_id == i)
5355 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5356 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5357 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5358 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5363 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5364 xtess = ytess = cxtess = cytess = 0;
5367 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5368 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5369 finalvertices = finalwidth * finalheight;
5370 oldnumtriangles = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5371 type = Q3FACETYPE_MESH;
5372 // generate geometry
5373 // (note: normals are skipped because they get recalculated)
5374 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5375 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5376 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5377 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5378 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5379 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5381 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);
5383 if (developer_extra.integer)
5385 if (out->num_triangles < finaltriangles)
5386 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);
5388 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);
5390 // q3map does not put in collision brushes for curves... ugh
5391 // build the lower quality collision geometry
5392 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5393 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5394 finalvertices = finalwidth * finalheight;
5395 oldnumtriangles2 = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5397 // legacy collision geometry implementation
5398 out->deprecatedq3data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5399 out->deprecatedq3data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5400 out->num_collisionvertices = finalvertices;
5401 out->num_collisiontriangles = finaltriangles;
5402 Q3PatchTesselateFloat(3, sizeof(float[3]), out->deprecatedq3data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5403 Q3PatchTriangleElements(out->deprecatedq3data_collisionelement3i, finalwidth, finalheight, 0);
5405 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5406 Mod_SnapVertices(3, finalvertices, out->deprecatedq3data_collisionvertex3f, 1);
5408 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionvertex3f);
5410 // now optimize the collision mesh by finding triangle bboxes...
5411 Mod_Q3BSP_BuildBBoxes(out->deprecatedq3data_collisionelement3i, out->num_collisiontriangles, out->deprecatedq3data_collisionvertex3f, &out->deprecatedq3data_collisionbbox6f, &out->deprecatedq3num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5412 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);
5414 // store collision geometry for BIH collision tree
5415 surfacecollisionvertex3f = loadmodel->brush.data_collisionvertex3f + collisionvertices * 3;
5416 surfacecollisionelement3i = loadmodel->brush.data_collisionelement3i + collisiontriangles * 3;
5417 Q3PatchTesselateFloat(3, sizeof(float[3]), surfacecollisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5418 Q3PatchTriangleElements(surfacecollisionelement3i, finalwidth, finalheight, collisionvertices);
5419 Mod_SnapVertices(3, finalvertices, surfacecollisionvertex3f, 1);
5421 // remove this once the legacy code is removed
5423 int nc = out->num_collisiontriangles;
5425 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, surfacecollisionelement3i, surfacecollisionelement3i, loadmodel->brush.data_collisionvertex3f);
5427 if(nc != out->num_collisiontriangles)
5429 Con_Printf("number of collision triangles differs between BIH and BSP. FAIL.\n");
5434 if (developer_extra.integer)
5435 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);
5437 collisionvertices += finalvertices;
5438 collisiontriangles += out->num_collisiontriangles;
5443 meshvertices += out->num_vertices;
5444 meshtriangles += out->num_triangles;
5445 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5446 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)
5448 if (invalidelements)
5450 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);
5451 for (j = 0;j < out->num_triangles * 3;j++)
5453 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5454 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)
5455 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5459 // calculate a bounding box
5460 VectorClear(out->mins);
5461 VectorClear(out->maxs);
5462 if (out->num_vertices)
5464 if (cls.state != ca_dedicated && out->lightmaptexture)
5466 // figure out which part of the merged lightmap this fits into
5467 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5468 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5469 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5470 lightmapindex &= mergewidth * mergeheight - 1;
5471 lightmaptcscale[0] = 1.0f / mergewidth;
5472 lightmaptcscale[1] = 1.0f / mergeheight;
5473 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5474 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5475 // modify the lightmap texcoords to match this region of the merged lightmap
5476 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5478 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5479 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5482 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5483 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5484 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5486 out->mins[0] = min(out->mins[0], v[0]);
5487 out->maxs[0] = max(out->maxs[0], v[0]);
5488 out->mins[1] = min(out->mins[1], v[1]);
5489 out->maxs[1] = max(out->maxs[1], v[1]);
5490 out->mins[2] = min(out->mins[2], v[2]);
5491 out->maxs[2] = max(out->maxs[2], v[2]);
5493 out->mins[0] -= 1.0f;
5494 out->mins[1] -= 1.0f;
5495 out->mins[2] -= 1.0f;
5496 out->maxs[0] += 1.0f;
5497 out->maxs[1] += 1.0f;
5498 out->maxs[2] += 1.0f;
5500 // set lightmap styles for consistency with q1bsp
5501 //out->lightmapinfo->styles[0] = 0;
5502 //out->lightmapinfo->styles[1] = 255;
5503 //out->lightmapinfo->styles[2] = 255;
5504 //out->lightmapinfo->styles[3] = 255;
5509 for (;i < count;i++, out++)
5511 if(out->num_vertices && out->num_triangles)
5513 if(out->num_vertices == 0)
5515 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no vertices, ignoring\n", i, out->texture ? out->texture->name : "(none)");
5516 if(out->num_triangles == 0)
5517 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no triangles, ignoring\n", i, out->texture ? out->texture->name : "(none)");
5519 else if(out->num_triangles == 0)
5520 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)",
5521 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[0 * 3 + 0],
5522 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[1 * 3 + 0],
5523 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[2 * 3 + 0]);
5526 // for per pixel lighting
5527 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);
5529 // generate ushort elements array if possible
5530 if (loadmodel->surfmesh.data_element3s)
5531 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5532 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5534 // free the no longer needed vertex data
5535 loadmodel->brushq3.num_vertices = 0;
5536 if (loadmodel->brushq3.data_vertex3f)
5537 Mem_Free(loadmodel->brushq3.data_vertex3f);
5538 loadmodel->brushq3.data_vertex3f = NULL;
5539 loadmodel->brushq3.data_normal3f = NULL;
5540 loadmodel->brushq3.data_texcoordtexture2f = NULL;
5541 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5542 loadmodel->brushq3.data_color4f = NULL;
5543 // free the no longer needed triangle data
5544 loadmodel->brushq3.num_triangles = 0;
5545 if (loadmodel->brushq3.data_element3i)
5546 Mem_Free(loadmodel->brushq3.data_element3i);
5547 loadmodel->brushq3.data_element3i = NULL;
5550 Mem_Free(patchtess);
5553 static void Mod_Q3BSP_LoadModels(lump_t *l)
5557 int i, j, n, c, count;
5559 in = (q3dmodel_t *)(mod_base + l->fileofs);
5560 if (l->filelen % sizeof(*in))
5561 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5562 count = l->filelen / sizeof(*in);
5563 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5565 loadmodel->brushq3.data_models = out;
5566 loadmodel->brushq3.num_models = count;
5568 for (i = 0;i < count;i++, in++, out++)
5570 for (j = 0;j < 3;j++)
5572 out->mins[j] = LittleFloat(in->mins[j]);
5573 out->maxs[j] = LittleFloat(in->maxs[j]);
5575 n = LittleLong(in->firstface);
5576 c = LittleLong(in->numfaces);
5577 if (n < 0 || n + c > loadmodel->num_surfaces)
5578 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5581 n = LittleLong(in->firstbrush);
5582 c = LittleLong(in->numbrushes);
5583 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5584 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5585 out->firstbrush = n;
5586 out->numbrushes = c;
5590 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5596 in = (int *)(mod_base + l->fileofs);
5597 if (l->filelen % sizeof(*in))
5598 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5599 count = l->filelen / sizeof(*in);
5600 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5602 loadmodel->brush.data_leafbrushes = out;
5603 loadmodel->brush.num_leafbrushes = count;
5605 for (i = 0;i < count;i++, in++, out++)
5607 n = LittleLong(*in);
5608 if (n < 0 || n >= loadmodel->brush.num_brushes)
5609 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5614 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5620 in = (int *)(mod_base + l->fileofs);
5621 if (l->filelen % sizeof(*in))
5622 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5623 count = l->filelen / sizeof(*in);
5624 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5626 loadmodel->brush.data_leafsurfaces = out;
5627 loadmodel->brush.num_leafsurfaces = count;
5629 for (i = 0;i < count;i++, in++, out++)
5631 n = LittleLong(*in);
5632 if (n < 0 || n >= loadmodel->num_surfaces)
5633 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5638 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5642 int i, j, n, c, count;
5644 in = (q3dleaf_t *)(mod_base + l->fileofs);
5645 if (l->filelen % sizeof(*in))
5646 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5647 count = l->filelen / sizeof(*in);
5648 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5650 loadmodel->brush.data_leafs = out;
5651 loadmodel->brush.num_leafs = count;
5653 for (i = 0;i < count;i++, in++, out++)
5657 out->clusterindex = LittleLong(in->clusterindex);
5658 out->areaindex = LittleLong(in->areaindex);
5659 for (j = 0;j < 3;j++)
5661 // yes the mins/maxs are ints
5662 out->mins[j] = LittleLong(in->mins[j]) - 1;
5663 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5665 n = LittleLong(in->firstleafface);
5666 c = LittleLong(in->numleaffaces);
5667 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5668 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5669 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5670 out->numleafsurfaces = c;
5671 n = LittleLong(in->firstleafbrush);
5672 c = LittleLong(in->numleafbrushes);
5673 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5674 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5675 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5676 out->numleafbrushes = c;
5680 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5686 in = (q3dnode_t *)(mod_base + l->fileofs);
5687 if (l->filelen % sizeof(*in))
5688 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5689 count = l->filelen / sizeof(*in);
5691 Host_Error("Mod_Q3BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
5692 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5694 loadmodel->brush.data_nodes = out;
5695 loadmodel->brush.num_nodes = count;
5697 for (i = 0;i < count;i++, in++, out++)
5700 n = LittleLong(in->planeindex);
5701 if (n < 0 || n >= loadmodel->brush.num_planes)
5702 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5703 out->plane = loadmodel->brush.data_planes + n;
5704 for (j = 0;j < 2;j++)
5706 n = LittleLong(in->childrenindex[j]);
5709 if (n >= loadmodel->brush.num_nodes)
5710 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5711 out->children[j] = loadmodel->brush.data_nodes + n;
5716 if (n >= loadmodel->brush.num_leafs)
5717 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5718 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5721 for (j = 0;j < 3;j++)
5723 // yes the mins/maxs are ints
5724 out->mins[j] = LittleLong(in->mins[j]) - 1;
5725 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5729 // set the parent pointers
5730 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5733 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5736 q3dlightgrid_t *out;
5739 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5740 if (l->filelen % sizeof(*in))
5741 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5742 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5743 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5744 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5745 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5746 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5747 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5748 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5749 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5750 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5751 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5752 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5753 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5754 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5755 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]);
5756 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]);
5758 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5761 if (l->filelen < count * (int)sizeof(*in))
5763 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]);
5764 return; // ignore the grid if we cannot understand it
5766 if (l->filelen != count * (int)sizeof(*in))
5767 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5768 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5769 loadmodel->brushq3.data_lightgrid = out;
5770 loadmodel->brushq3.num_lightgrid = count;
5771 // no swapping or validation necessary
5772 memcpy(out, in, count * (int)sizeof(*out));
5776 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5781 if (l->filelen == 0)
5784 // unvised maps often have cluster indices even without pvs, so check
5785 // leafs to find real number of clusters
5786 loadmodel->brush.num_pvsclusters = 1;
5787 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5788 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5791 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5792 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5793 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5794 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5798 in = (q3dpvs_t *)(mod_base + l->fileofs);
5800 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5802 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5803 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5804 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5805 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5806 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5807 if (l->filelen < totalchains + (int)sizeof(*in))
5808 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);
5810 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5811 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5814 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5816 int i, j, k, index[3];
5817 float transformed[3], blend1, blend2, blend, stylescale = 1;
5818 q3dlightgrid_t *a, *s;
5820 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5821 switch(vid.renderpath)
5823 case RENDERPATH_GL20:
5824 case RENDERPATH_D3D9:
5825 case RENDERPATH_D3D10:
5826 case RENDERPATH_D3D11:
5827 case RENDERPATH_SOFT:
5828 case RENDERPATH_GLES2:
5829 // LordHavoc: FIXME: is this true?
5830 stylescale = 1; // added while render
5832 case RENDERPATH_GL11:
5833 case RENDERPATH_GL13:
5834 stylescale = r_refdef.scene.rtlightstylevalue[0];
5838 if (!model->brushq3.num_lightgrid)
5840 ambientcolor[0] = stylescale;
5841 ambientcolor[1] = stylescale;
5842 ambientcolor[2] = stylescale;
5846 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5847 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5848 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5849 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5850 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5851 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
5852 index[0] = (int)floor(transformed[0]);
5853 index[1] = (int)floor(transformed[1]);
5854 index[2] = (int)floor(transformed[2]);
5855 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
5857 // now lerp the values
5858 VectorClear(diffusenormal);
5859 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
5860 for (k = 0;k < 2;k++)
5862 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
5863 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
5865 for (j = 0;j < 2;j++)
5867 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
5868 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
5870 for (i = 0;i < 2;i++)
5872 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
5873 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
5875 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
5876 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
5877 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
5878 // this uses the mod_md3_sin table because the values are
5879 // already in the 0-255 range, the 64+ bias fetches a cosine
5880 // instead of a sine value
5881 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5882 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
5883 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
5884 //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)));
5889 // normalize the light direction before turning
5890 VectorNormalize(diffusenormal);
5891 //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]);
5894 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
5897 double midf, mid[3];
5903 // find the point distances
5904 mplane_t *plane = node->plane;
5905 if (plane->type < 3)
5907 t1 = p1[plane->type] - plane->dist;
5908 t2 = p2[plane->type] - plane->dist;
5912 t1 = DotProduct (plane->normal, p1) - plane->dist;
5913 t2 = DotProduct (plane->normal, p2) - plane->dist;
5920 node = node->children[1];
5929 node = node->children[0];
5935 midf = t1 / (t1 - t2);
5936 VectorLerp(p1, midf, p2, mid);
5938 // recurse both sides, front side first
5939 // return 2 if empty is followed by solid (hit something)
5940 // do not return 2 if both are solid or both empty,
5941 // or if start is solid and end is empty
5942 // as these degenerate cases usually indicate the eye is in solid and
5943 // should see the target point anyway
5944 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
5947 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
5952 return ((mleaf_t *)node)->clusterindex < 0;
5955 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
5957 if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
5960 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
5961 return trace.fraction == 1;
5965 double tracestart[3], traceend[3];
5966 VectorCopy(start, tracestart);
5967 VectorCopy(end, traceend);
5968 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
5972 static void Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace_t *trace, dp_model_t *model, int nodenum, const vec3_t point)
5974 const bih_leaf_t *leaf;
5975 const bih_node_t *node;
5976 const colbrushf_t *brush;
5980 node = model->collision_bih.nodes + nodenum;
5982 if (!BoxesOverlap(point, point, node->mins, node->maxs))
5985 if (node->type == BIH_UNORDERED)
5987 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
5989 leaf = model->collision_bih.leafs + node->children[axis];
5991 if (!BoxesOverlap(point, point, leaf->mins, leaf->maxs))
5997 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
5998 Collision_TracePointBrushFloat(trace, point, brush);
6000 case BIH_COLLISIONTRIANGLE:
6001 // collision triangle - skipped because they have no volume
6003 case BIH_RENDERTRIANGLE:
6004 // render triangle - skipped because they have no volume
6010 axis = node->type - BIH_SPLITX;
6011 if (point[axis] <= node->backmax)
6013 if (point[axis] >= node->frontmin)
6014 Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace, model, node->front, point);
6015 nodenum = node->back;
6017 else if (point[axis] >= node->frontmin)
6018 nodenum = node->front;
6019 else // no overlap with either child? just return
6024 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)
6026 const bih_leaf_t *leaf;
6027 const bih_node_t *node;
6028 const colbrushf_t *brush;
6030 const texture_t *texture;
6041 vec3_t clipped, newstart, newend;
6045 segmentmins[0] = min(start[0], end[0]);
6046 segmentmins[1] = min(start[1], end[1]);
6047 segmentmins[2] = min(start[2], end[2]);
6048 segmentmaxs[0] = max(start[0], end[0]);
6049 segmentmaxs[1] = max(start[1], end[1]);
6050 segmentmaxs[2] = max(start[2], end[2]);
6053 node = bih->nodes + nodenum;
6055 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6058 if (node->type == BIH_UNORDERED)
6060 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6062 leaf = model->collision_bih.leafs + node->children[axis];
6064 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6070 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6071 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
6073 case BIH_COLLISIONTRIANGLE:
6074 if (!mod_q3bsp_curves_collisions.integer)
6076 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6077 texture = model->data_textures + leaf->textureindex;
6078 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);
6080 case BIH_RENDERTRIANGLE:
6081 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6082 texture = model->data_textures + leaf->textureindex;
6083 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);
6089 axis = node->type - BIH_SPLITX;
6091 if (segmentmins[axis] <= node->backmax)
6093 if (segmentmaxs[axis] >= node->frontmin)
6094 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6095 nodenum = node->back;
6097 else if (segmentmaxs[axis] >= node->frontmin)
6098 nodenum = node->front;
6100 return; // trace falls between children
6102 frontdist1 = start[axis] - node->frontmin;
6103 frontdist2 = end[axis] - node->frontmin;
6104 backdist1 = start[axis] - node->backmax;
6105 backdist2 = end[axis] - node->backmax;
6118 if ((sideflags & 3) != 3)
6119 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6120 nodenum = node->back;
6122 else if ((sideflags & 3) != 3)
6123 nodenum = node->front;
6125 return; // trace falls between children
6130 // start end START END
6131 nodenum = node->front;
6134 // START end START END
6136 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6137 VectorLerp(start, frontfrac, end, newstart); start = newstart;
6138 segmentmins[0] = min(start[0], end[0]);
6139 segmentmins[1] = min(start[1], end[1]);
6140 segmentmins[2] = min(start[2], end[2]);
6141 segmentmaxs[0] = max(start[0], end[0]);
6142 segmentmaxs[1] = max(start[1], end[1]);
6143 segmentmaxs[2] = max(start[2], end[2]);
6145 nodenum = node->front;
6149 // start END START END
6150 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6151 VectorLerp(start, frontfrac, end, newend); end = newend;
6152 segmentmins[0] = min(start[0], end[0]);
6153 segmentmins[1] = min(start[1], end[1]);
6154 segmentmins[2] = min(start[2], end[2]);
6155 segmentmaxs[0] = max(start[0], end[0]);
6156 segmentmaxs[1] = max(start[1], end[1]);
6157 segmentmaxs[2] = max(start[2], end[2]);
6159 nodenum = node->front;
6162 // START END START END
6163 return; // line falls in gap between children
6165 // start end start END
6166 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6168 backfrac = backdist1 / (backdist1 - backdist2);
6169 VectorLerp(start, backfrac, 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->back;
6180 // START end start END
6182 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6183 VectorLerp(start, frontfrac, end, clipped);
6184 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, clipped, end, linestart, lineend);
6185 backfrac = backdist1 / (backdist1 - backdist2);
6186 VectorLerp(start, backfrac, end, newend); end = newend;
6187 segmentmins[0] = min(start[0], end[0]);
6188 segmentmins[1] = min(start[1], end[1]);
6189 segmentmins[2] = min(start[2], end[2]);
6190 segmentmaxs[0] = max(start[0], end[0]);
6191 segmentmaxs[1] = max(start[1], end[1]);
6192 segmentmaxs[2] = max(start[2], end[2]);
6194 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6196 nodenum = node->back;
6199 // start END start END
6201 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6202 VectorLerp(start, frontfrac, end, clipped);
6203 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, clipped, linestart, lineend);
6204 backfrac = backdist1 / (backdist1 - backdist2);
6205 VectorLerp(start, backfrac, end, newend); end = newend;
6206 segmentmins[0] = min(start[0], end[0]);
6207 segmentmins[1] = min(start[1], end[1]);
6208 segmentmins[2] = min(start[2], end[2]);
6209 segmentmaxs[0] = max(start[0], end[0]);
6210 segmentmaxs[1] = max(start[1], end[1]);
6211 segmentmaxs[2] = max(start[2], end[2]);
6213 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6215 nodenum = node->back;
6218 // START END start END
6220 backfrac = backdist1 / (backdist1 - backdist2);
6221 VectorLerp(start, backfrac, end, newend); end = newend;
6222 segmentmins[0] = min(start[0], end[0]);
6223 segmentmins[1] = min(start[1], end[1]);
6224 segmentmins[2] = min(start[2], end[2]);
6225 segmentmaxs[0] = max(start[0], end[0]);
6226 segmentmaxs[1] = max(start[1], end[1]);
6227 segmentmaxs[2] = max(start[2], end[2]);
6229 nodenum = node->back;
6232 // start end START end
6233 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6235 backfrac = backdist1 / (backdist1 - backdist2);
6236 VectorLerp(start, backfrac, end, newstart); start = newstart;
6237 segmentmins[0] = min(start[0], end[0]);
6238 segmentmins[1] = min(start[1], end[1]);
6239 segmentmins[2] = min(start[2], end[2]);
6240 segmentmaxs[0] = max(start[0], end[0]);
6241 segmentmaxs[1] = max(start[1], end[1]);
6242 segmentmaxs[2] = max(start[2], end[2]);
6244 nodenum = node->back;
6247 // START end START end
6249 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6250 VectorLerp(start, frontfrac, end, clipped);
6251 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, clipped, end, linestart, lineend);
6252 backfrac = backdist1 / (backdist1 - backdist2);
6253 VectorLerp(start, backfrac, end, newstart); start = newstart;
6254 segmentmins[0] = min(start[0], end[0]);
6255 segmentmins[1] = min(start[1], end[1]);
6256 segmentmins[2] = min(start[2], end[2]);
6257 segmentmaxs[0] = max(start[0], end[0]);
6258 segmentmaxs[1] = max(start[1], end[1]);
6259 segmentmaxs[2] = max(start[2], end[2]);
6261 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6263 nodenum = node->back;
6266 // start END START end
6268 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6269 VectorLerp(start, frontfrac, end, clipped);
6270 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, clipped, linestart, lineend);
6271 backfrac = backdist1 / (backdist1 - backdist2);
6272 VectorLerp(start, backfrac, end, newstart); start = newstart;
6273 segmentmins[0] = min(start[0], end[0]);
6274 segmentmins[1] = min(start[1], end[1]);
6275 segmentmins[2] = min(start[2], end[2]);
6276 segmentmaxs[0] = max(start[0], end[0]);
6277 segmentmaxs[1] = max(start[1], end[1]);
6278 segmentmaxs[2] = max(start[2], end[2]);
6280 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6282 nodenum = node->back;
6285 // START END START end
6287 backfrac = backdist1 / (backdist1 - backdist2);
6288 VectorLerp(start, backfrac, end, newstart); start = newstart;
6289 segmentmins[0] = min(start[0], end[0]);
6290 segmentmins[1] = min(start[1], end[1]);
6291 segmentmins[2] = min(start[2], end[2]);
6292 segmentmaxs[0] = max(start[0], end[0]);
6293 segmentmaxs[1] = max(start[1], end[1]);
6294 segmentmaxs[2] = max(start[2], end[2]);
6296 nodenum = node->back;
6299 // start end start end
6300 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6301 nodenum = node->back;
6304 // START end start end
6306 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6307 VectorLerp(start, frontfrac, end, clipped);
6308 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, clipped, end, linestart, lineend);
6310 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6312 nodenum = node->back;
6315 // start END start end
6317 frontfrac = frontdist1 / (frontdist1 - frontdist2);
6318 VectorLerp(start, frontfrac, end, clipped);
6319 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, clipped, linestart, lineend);
6321 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, bih, node->front, start, end, linestart, lineend);
6323 nodenum = node->back;
6326 // START END start end
6327 nodenum = node->back;
6335 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)
6337 const bih_leaf_t *leaf;
6338 const bih_node_t *node;
6339 const colbrushf_t *brush;
6341 const texture_t *texture;
6345 node = model->collision_bih.nodes + nodenum;
6346 if (node->type == BIH_UNORDERED)
6348 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6350 leaf = model->collision_bih.leafs + node->children[axis];
6352 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6358 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6359 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6361 case BIH_COLLISIONTRIANGLE:
6362 if (!mod_q3bsp_curves_collisions.integer)
6364 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6365 texture = model->data_textures + leaf->textureindex;
6366 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);
6368 case BIH_RENDERTRIANGLE:
6369 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6370 texture = model->data_textures + leaf->textureindex;
6371 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);
6377 axis = node->type - BIH_SPLITX;
6379 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6383 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, node->front, thisbrush_start, thisbrush_end, segmentmins, segmentmaxs);
6384 nodenum = node->back;
6387 if (segmentmins[axis] <= node->backmax)
6389 if (segmentmaxs[axis] >= node->frontmin)
6390 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, node->front, thisbrush_start, thisbrush_end, segmentmins, segmentmaxs);
6391 nodenum = node->back;
6393 else if (segmentmaxs[axis] >= node->frontmin)
6394 nodenum = node->front;
6396 return; // trace falls between children
6400 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)
6402 memset(trace, 0, sizeof(*trace));
6403 trace->fraction = 1;
6404 trace->realfraction = 1;
6405 trace->hitsupercontentsmask = hitsupercontentsmask;
6406 Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start);
6409 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)
6411 if (VectorCompare(start, end))
6413 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6417 memset(trace, 0, sizeof(*trace));
6418 trace->fraction = 1;
6419 trace->realfraction = 1;
6420 trace->hitsupercontentsmask = hitsupercontentsmask;
6421 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, &model->collision_bih, model->collision_bih.rootnode, start, end, start, end);
6424 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)
6426 float segmentmins[3], segmentmaxs[3];
6427 colboxbrushf_t thisbrush_start, thisbrush_end;
6428 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6430 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
6432 vec3_t shiftstart, shiftend;
6433 VectorAdd(start, boxmins, shiftstart);
6434 VectorAdd(end, boxmins, shiftend);
6435 if (VectorCompare(start, end))
6436 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, shiftstart, hitsupercontentsmask);
6438 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, shiftstart, shiftend, hitsupercontentsmask);
6442 // box trace, performed as brush trace
6443 memset(trace, 0, sizeof(*trace));
6444 trace->fraction = 1;
6445 trace->realfraction = 1;
6446 trace->hitsupercontentsmask = hitsupercontentsmask;
6447 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
6448 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
6449 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
6450 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
6451 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
6452 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
6453 VectorAdd(start, boxmins, boxstartmins);
6454 VectorAdd(start, boxmaxs, boxstartmaxs);
6455 VectorAdd(end, boxmins, boxendmins);
6456 VectorAdd(end, boxmaxs, boxendmaxs);
6457 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6458 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6459 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, &thisbrush_start.brush, &thisbrush_end.brush, segmentmins, segmentmaxs);
6462 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)
6464 float segmentmins[3], segmentmaxs[3];
6466 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(start->mins, start->maxs) && VectorCompare(end->mins, end->maxs))
6468 if (VectorCompare(start->mins, end->mins))
6469 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start->mins, hitsupercontentsmask);
6471 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start->mins, end->mins, hitsupercontentsmask);
6475 // box trace, performed as brush trace
6476 memset(trace, 0, sizeof(*trace));
6477 trace->fraction = 1;
6478 trace->realfraction = 1;
6479 trace->hitsupercontentsmask = hitsupercontentsmask;
6480 segmentmins[0] = min(start->mins[0], end->mins[0]);
6481 segmentmins[1] = min(start->mins[1], end->mins[1]);
6482 segmentmins[2] = min(start->mins[2], end->mins[2]);
6483 segmentmaxs[0] = max(start->maxs[0], end->maxs[0]);
6484 segmentmaxs[1] = max(start->maxs[1], end->maxs[1]);
6485 segmentmaxs[2] = max(start->maxs[2], end->maxs[2]);
6486 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, segmentmins, segmentmaxs);
6489 int Mod_CollisionBIH_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6492 Mod_CollisionBIH_TracePoint(model, NULL, NULL, &trace, point, 0);
6493 return trace.startsupercontents;
6496 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)
6499 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6501 int hitsupercontents;
6502 VectorSet(end, start[0], start[1], model->normalmins[2]);
6504 memset(trace, 0, sizeof(*trace));
6505 trace->fraction = 1;
6506 trace->realfraction = 1;
6507 trace->hitsupercontentsmask = hitsupercontentsmask;
6509 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, start, end);
6510 hitsupercontents = trace->hitsupercontents;
6511 memset(trace, 0, sizeof(*trace));
6512 trace->fraction = 1;
6513 trace->realfraction = 1;
6514 trace->hitsupercontentsmask = hitsupercontentsmask;
6515 trace->startsupercontents = hitsupercontents;
6519 int Mod_CollisionBIH_PointSuperContents_Mesh(struct model_s *model, int frame, const vec3_t start)
6522 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6525 VectorSet(end, start[0], start[1], model->normalmins[2]);
6526 memset(&trace, 0, sizeof(trace));
6528 trace.realfraction = 1;
6529 trace.hitsupercontentsmask = 0;
6530 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(&trace, model, model->collision_bih.rootnode, start, end, start, end);
6531 return trace.hitsupercontents;
6537 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
6542 // find which leaf the point is in
6544 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
6545 // point trace the brushes
6546 leaf = (mleaf_t *)node;
6547 for (i = 0;i < leaf->numleafbrushes;i++)
6549 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6550 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
6552 brush->markframe = markframe;
6553 Collision_TracePointBrushFloat(trace, point, brush);
6556 // can't do point traces on curves (they have no thickness)
6559 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)
6561 int i, startside, endside;
6562 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
6564 msurface_t *surface;
6567 // walk the tree until we hit a leaf, recursing for any split cases
6571 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6573 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[0], start, end, startfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6574 node = node->children[1];
6576 // abort if this part of the bsp tree can not be hit by this trace
6577 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6579 plane = node->plane;
6580 // axial planes are much more common than non-axial, so an optimized
6581 // axial case pays off here
6582 if (plane->type < 3)
6584 dist1 = start[plane->type] - plane->dist;
6585 dist2 = end[plane->type] - plane->dist;
6589 dist1 = DotProduct(start, plane->normal) - plane->dist;
6590 dist2 = DotProduct(end, plane->normal) - plane->dist;
6592 startside = dist1 < 0;
6593 endside = dist2 < 0;
6594 if (startside == endside)
6596 // most of the time the line fragment is on one side of the plane
6597 node = node->children[startside];
6601 // line crosses node plane, split the line
6602 dist1 = PlaneDiff(linestart, plane);
6603 dist2 = PlaneDiff(lineend, plane);
6604 midfrac = dist1 / (dist1 - dist2);
6605 VectorLerp(linestart, midfrac, lineend, mid);
6606 // take the near side first
6607 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6608 // if we found an impact on the front side, don't waste time
6609 // exploring the far side
6610 if (midfrac <= trace->realfraction)
6611 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6616 // abort if this part of the bsp tree can not be hit by this trace
6617 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6620 nodesegmentmins[0] = min(start[0], end[0]) - 1;
6621 nodesegmentmins[1] = min(start[1], end[1]) - 1;
6622 nodesegmentmins[2] = min(start[2], end[2]) - 1;
6623 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
6624 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
6625 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
6626 // line trace the brushes
6627 leaf = (mleaf_t *)node;
6629 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6632 for (i = 0;i < leaf->numleafbrushes;i++)
6634 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6635 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6637 brush->markframe = markframe;
6638 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
6641 // can't do point traces on curves (they have no thickness)
6642 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
6644 // line trace the curves
6645 for (i = 0;i < leaf->numleafsurfaces;i++)
6647 surface = model->data_surfaces + leaf->firstleafsurface[i];
6648 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6650 surface->deprecatedq3collisionmarkframe = markframe;
6651 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);
6657 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)
6663 msurface_t *surface;
6665 float nodesegmentmins[3], nodesegmentmaxs[3];
6666 // walk the tree until we hit a leaf, recursing for any split cases
6670 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6672 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6673 node = node->children[1];
6675 // abort if this part of the bsp tree can not be hit by this trace
6676 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6678 plane = node->plane;
6679 // axial planes are much more common than non-axial, so an optimized
6680 // axial case pays off here
6681 if (plane->type < 3)
6683 // this is an axial plane, compare bounding box directly to it and
6684 // recurse sides accordingly
6685 // recurse down node sides
6686 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
6687 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
6688 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
6689 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
6693 // this is a non-axial plane, so check if the start and end boxes
6694 // are both on one side of the plane to handle 'diagonal' cases
6695 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
6699 // segment crosses plane
6700 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6703 // if sides == 0 then the trace itself is bogus (Not A Number values),
6704 // in this case we simply pretend the trace hit nothing
6706 return; // ERROR: NAN bounding box!
6707 // take whichever side the segment box is on
6708 node = node->children[sides - 1];
6711 // abort if this part of the bsp tree can not be hit by this trace
6712 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6714 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
6715 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
6716 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
6717 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
6718 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
6719 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
6721 leaf = (mleaf_t *)node;
6723 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6726 for (i = 0;i < leaf->numleafbrushes;i++)
6728 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6729 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6731 brush->markframe = markframe;
6732 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6735 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
6737 for (i = 0;i < leaf->numleafsurfaces;i++)
6739 surface = model->data_surfaces + leaf->firstleafsurface[i];
6740 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6742 surface->deprecatedq3collisionmarkframe = markframe;
6743 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);
6750 static int markframe = 0;
6752 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)
6756 memset(trace, 0, sizeof(*trace));
6757 trace->fraction = 1;
6758 trace->realfraction = 1;
6759 trace->hitsupercontentsmask = hitsupercontentsmask;
6760 if (mod_collision_bih.integer)
6761 Mod_CollisionBIH_TracePoint_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start);
6762 else if (model->brush.submodel)
6764 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6765 if (brush->colbrushf)
6766 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
6769 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
6772 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)
6775 float segmentmins[3], segmentmaxs[3];
6776 msurface_t *surface;
6779 if (VectorCompare(start, end))
6781 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6785 memset(trace, 0, sizeof(*trace));
6786 trace->fraction = 1;
6787 trace->realfraction = 1;
6788 trace->hitsupercontentsmask = hitsupercontentsmask;
6789 segmentmins[0] = min(start[0], end[0]) - 1;
6790 segmentmins[1] = min(start[1], end[1]) - 1;
6791 segmentmins[2] = min(start[2], end[2]) - 1;
6792 segmentmaxs[0] = max(start[0], end[0]) + 1;
6793 segmentmaxs[1] = max(start[1], end[1]) + 1;
6794 segmentmaxs[2] = max(start[2], end[2]) + 1;
6795 if (mod_collision_bih.integer)
6796 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, &model->collision_bih, model->collision_bih.rootnode, start, end, start, end);
6797 else if (model->brush.submodel)
6799 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6800 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6801 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6802 if (mod_q3bsp_curves_collisions.integer)
6803 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6804 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6805 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);
6808 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
6811 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)
6814 float segmentmins[3], segmentmaxs[3];
6815 msurface_t *surface;
6817 colboxbrushf_t thisbrush_start, thisbrush_end;
6818 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6820 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(boxmins, boxmaxs))
6822 vec3_t shiftstart, shiftend;
6823 VectorAdd(start, boxmins, shiftstart);
6824 VectorAdd(end, boxmins, shiftend);
6825 if (VectorCompare(start, end))
6826 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, shiftstart, hitsupercontentsmask);
6828 Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, shiftstart, shiftend, hitsupercontentsmask);
6832 // box trace, performed as brush trace
6833 memset(trace, 0, sizeof(*trace));
6834 trace->fraction = 1;
6835 trace->realfraction = 1;
6836 trace->hitsupercontentsmask = hitsupercontentsmask;
6837 segmentmins[0] = min(start[0], end[0]) + boxmins[0] - 1;
6838 segmentmins[1] = min(start[1], end[1]) + boxmins[1] - 1;
6839 segmentmins[2] = min(start[2], end[2]) + boxmins[2] - 1;
6840 segmentmaxs[0] = max(start[0], end[0]) + boxmaxs[0] + 1;
6841 segmentmaxs[1] = max(start[1], end[1]) + boxmaxs[1] + 1;
6842 segmentmaxs[2] = max(start[2], end[2]) + boxmaxs[2] + 1;
6843 VectorAdd(start, boxmins, boxstartmins);
6844 VectorAdd(start, boxmaxs, boxstartmaxs);
6845 VectorAdd(end, boxmins, boxendmins);
6846 VectorAdd(end, boxmaxs, boxendmaxs);
6847 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6848 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6849 if (mod_collision_bih.integer)
6850 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, &thisbrush_start.brush, &thisbrush_end.brush, segmentmins, segmentmaxs);
6851 else if (model->brush.submodel)
6853 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6854 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6855 Collision_TraceBrushBrushFloat(trace, &thisbrush_start.brush, &thisbrush_end.brush, brush->colbrushf, brush->colbrushf);
6856 if (mod_q3bsp_curves_collisions.integer)
6857 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6858 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6859 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);
6862 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, &thisbrush_start.brush, &thisbrush_end.brush, ++markframe, segmentmins, segmentmaxs);
6865 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)
6867 float segmentmins[3], segmentmaxs[3];
6869 msurface_t *surface;
6872 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(start->mins, start->maxs) && VectorCompare(end->mins, end->maxs))
6874 if (VectorCompare(start->mins, end->mins))
6875 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start->mins, hitsupercontentsmask);
6877 Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, start->mins, end->mins, hitsupercontentsmask);
6881 // box trace, performed as brush trace
6882 memset(trace, 0, sizeof(*trace));
6883 trace->fraction = 1;
6884 trace->realfraction = 1;
6885 trace->hitsupercontentsmask = hitsupercontentsmask;
6886 segmentmins[0] = min(start->mins[0], end->mins[0]);
6887 segmentmins[1] = min(start->mins[1], end->mins[1]);
6888 segmentmins[2] = min(start->mins[2], end->mins[2]);
6889 segmentmaxs[0] = max(start->maxs[0], end->maxs[0]);
6890 segmentmaxs[1] = max(start->maxs[1], end->maxs[1]);
6891 segmentmaxs[2] = max(start->maxs[2], end->maxs[2]);
6892 if (mod_collision_bih.integer)
6893 Mod_CollisionBIH_TraceBrush_RecursiveBIHNode(trace, model, model->collision_bih.rootnode, start, end, segmentmins, segmentmaxs);
6894 else if (model->brush.submodel)
6896 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6897 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6898 Collision_TraceBrushBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6899 if (mod_q3bsp_curves_collisions.integer)
6900 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6901 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6902 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);
6905 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, ++markframe, segmentmins, segmentmaxs);
6908 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6911 int supercontents = 0;
6913 if (mod_collision_bih.integer)
6916 Mod_Q3BSP_TracePoint(model, NULL, NULL, &trace, point, 0);
6917 supercontents = trace.startsupercontents;
6919 // test if the point is inside each brush
6920 else if (model->brush.submodel)
6922 // submodels are effectively one leaf
6923 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6924 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6925 supercontents |= brush->colbrushf->supercontents;
6929 mnode_t *node = model->brush.data_nodes;
6931 // find which leaf the point is in
6933 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
6934 leaf = (mleaf_t *)node;
6935 // now check the brushes in the leaf
6936 for (i = 0;i < leaf->numleafbrushes;i++)
6938 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
6939 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6940 supercontents |= brush->colbrushf->supercontents;
6943 return supercontents;
6946 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)
6948 memset(trace, 0, sizeof(*trace));
6949 trace->fraction = 1;
6950 trace->realfraction = 1;
6951 trace->hitsupercontentsmask = hitsupercontentsmask;
6952 Mod_CollisionBIH_TraceLine_RecursiveBIHNode(trace, model, &model->render_bih, model->render_bih.rootnode, start, end, start, end);
6956 bih_t *Mod_MakeCollisionBIH(dp_model_t *model, qboolean userendersurfaces, bih_t *out)
6964 int nummodelbrushes = model->nummodelbrushes;
6965 int nummodelsurfaces = model->nummodelsurfaces;
6967 const int *collisionelement3i;
6968 const float *collisionvertex3f;
6969 const int *renderelement3i;
6970 const float *rendervertex3f;
6971 bih_leaf_t *bihleafs;
6972 bih_node_t *bihnodes;
6974 int *temp_leafsortscratch;
6975 const msurface_t *surface;
6976 const q3mbrush_t *brush;
6978 // find out how many BIH leaf nodes we need
6980 if (userendersurfaces)
6982 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6983 bihnumleafs += surface->num_triangles;
6987 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
6988 if (brush->colbrushf)
6990 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6992 if (surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS)
6993 bihnumleafs += surface->num_triangles + surface->num_collisiontriangles;
6995 bihnumleafs += surface->num_collisiontriangles;
7002 // allocate the memory for the BIH leaf nodes
7003 bihleafs = (bih_leaf_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_leaf_t) * bihnumleafs);
7005 // now populate the BIH leaf nodes
7008 // add render surfaces
7009 renderelement3i = model->surfmesh.data_element3i;
7010 rendervertex3f = model->surfmesh.data_vertex3f;
7011 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7013 for (triangleindex = 0, e = renderelement3i + 3*surface->num_firsttriangle;triangleindex < surface->num_triangles;triangleindex++, e += 3)
7015 if (!userendersurfaces && !(surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS))
7017 bihleafs[bihleafindex].type = BIH_RENDERTRIANGLE;
7018 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
7019 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
7020 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firsttriangle;
7021 bihleafs[bihleafindex].mins[0] = min(rendervertex3f[3*e[0]+0], min(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) - 1;
7022 bihleafs[bihleafindex].mins[1] = min(rendervertex3f[3*e[0]+1], min(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) - 1;
7023 bihleafs[bihleafindex].mins[2] = min(rendervertex3f[3*e[0]+2], min(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) - 1;
7024 bihleafs[bihleafindex].maxs[0] = max(rendervertex3f[3*e[0]+0], max(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) + 1;
7025 bihleafs[bihleafindex].maxs[1] = max(rendervertex3f[3*e[0]+1], max(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) + 1;
7026 bihleafs[bihleafindex].maxs[2] = max(rendervertex3f[3*e[0]+2], max(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) + 1;
7031 if (!userendersurfaces)
7033 // add collision brushes
7034 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
7036 if (!brush->colbrushf)
7038 bihleafs[bihleafindex].type = BIH_BRUSH;
7039 bihleafs[bihleafindex].textureindex = brush->texture - model->data_textures;
7040 bihleafs[bihleafindex].surfaceindex = -1;
7041 bihleafs[bihleafindex].itemindex = brushindex+model->firstmodelbrush;
7042 VectorCopy(brush->colbrushf->mins, bihleafs[bihleafindex].mins);
7043 VectorCopy(brush->colbrushf->maxs, bihleafs[bihleafindex].maxs);
7047 // add collision surfaces
7048 collisionelement3i = model->brush.data_collisionelement3i;
7049 collisionvertex3f = model->brush.data_collisionvertex3f;
7050 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7052 for (triangleindex = 0, e = collisionelement3i + 3*surface->num_firstcollisiontriangle;triangleindex < surface->num_collisiontriangles;triangleindex++, e += 3)
7054 bihleafs[bihleafindex].type = BIH_COLLISIONTRIANGLE;
7055 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
7056 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
7057 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firstcollisiontriangle;
7058 bihleafs[bihleafindex].mins[0] = min(collisionvertex3f[3*e[0]+0], min(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) - 1;
7059 bihleafs[bihleafindex].mins[1] = min(collisionvertex3f[3*e[0]+1], min(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) - 1;
7060 bihleafs[bihleafindex].mins[2] = min(collisionvertex3f[3*e[0]+2], min(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) - 1;
7061 bihleafs[bihleafindex].maxs[0] = max(collisionvertex3f[3*e[0]+0], max(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) + 1;
7062 bihleafs[bihleafindex].maxs[1] = max(collisionvertex3f[3*e[0]+1], max(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) + 1;
7063 bihleafs[bihleafindex].maxs[2] = max(collisionvertex3f[3*e[0]+2], max(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) + 1;
7069 // allocate buffers for the produced and temporary data
7070 bihmaxnodes = bihnumleafs + 1;
7071 bihnodes = (bih_node_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_node_t) * bihmaxnodes);
7072 temp_leafsort = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * bihnumleafs * 2);
7073 temp_leafsortscratch = temp_leafsort + bihnumleafs;
7076 BIH_Build(out, bihnumleafs, bihleafs, bihmaxnodes, bihnodes, temp_leafsort, temp_leafsortscratch);
7078 // we're done with the temporary data
7079 Mem_Free(temp_leafsort);
7081 // resize the BIH nodes array if it over-allocated
7082 if (out->maxnodes > out->numnodes)
7084 out->maxnodes = out->numnodes;
7085 out->nodes = (bih_node_t *)Mem_Realloc(loadmodel->mempool, out->nodes, out->numnodes * sizeof(bih_node_t));
7091 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
7093 int supercontents = 0;
7094 if (nativecontents & CONTENTSQ3_SOLID)
7095 supercontents |= SUPERCONTENTS_SOLID;
7096 if (nativecontents & CONTENTSQ3_WATER)
7097 supercontents |= SUPERCONTENTS_WATER;
7098 if (nativecontents & CONTENTSQ3_SLIME)
7099 supercontents |= SUPERCONTENTS_SLIME;
7100 if (nativecontents & CONTENTSQ3_LAVA)
7101 supercontents |= SUPERCONTENTS_LAVA;
7102 if (nativecontents & CONTENTSQ3_BODY)
7103 supercontents |= SUPERCONTENTS_BODY;
7104 if (nativecontents & CONTENTSQ3_CORPSE)
7105 supercontents |= SUPERCONTENTS_CORPSE;
7106 if (nativecontents & CONTENTSQ3_NODROP)
7107 supercontents |= SUPERCONTENTS_NODROP;
7108 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
7109 supercontents |= SUPERCONTENTS_PLAYERCLIP;
7110 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
7111 supercontents |= SUPERCONTENTS_MONSTERCLIP;
7112 if (nativecontents & CONTENTSQ3_DONOTENTER)
7113 supercontents |= SUPERCONTENTS_DONOTENTER;
7114 if (nativecontents & CONTENTSQ3_BOTCLIP)
7115 supercontents |= SUPERCONTENTS_BOTCLIP;
7116 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
7117 supercontents |= SUPERCONTENTS_OPAQUE;
7118 return supercontents;
7121 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
7123 int nativecontents = 0;
7124 if (supercontents & SUPERCONTENTS_SOLID)
7125 nativecontents |= CONTENTSQ3_SOLID;
7126 if (supercontents & SUPERCONTENTS_WATER)
7127 nativecontents |= CONTENTSQ3_WATER;
7128 if (supercontents & SUPERCONTENTS_SLIME)
7129 nativecontents |= CONTENTSQ3_SLIME;
7130 if (supercontents & SUPERCONTENTS_LAVA)
7131 nativecontents |= CONTENTSQ3_LAVA;
7132 if (supercontents & SUPERCONTENTS_BODY)
7133 nativecontents |= CONTENTSQ3_BODY;
7134 if (supercontents & SUPERCONTENTS_CORPSE)
7135 nativecontents |= CONTENTSQ3_CORPSE;
7136 if (supercontents & SUPERCONTENTS_NODROP)
7137 nativecontents |= CONTENTSQ3_NODROP;
7138 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
7139 nativecontents |= CONTENTSQ3_PLAYERCLIP;
7140 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
7141 nativecontents |= CONTENTSQ3_MONSTERCLIP;
7142 if (supercontents & SUPERCONTENTS_DONOTENTER)
7143 nativecontents |= CONTENTSQ3_DONOTENTER;
7144 if (supercontents & SUPERCONTENTS_BOTCLIP)
7145 nativecontents |= CONTENTSQ3_BOTCLIP;
7146 if (!(supercontents & SUPERCONTENTS_OPAQUE))
7147 nativecontents |= CONTENTSQ3_TRANSLUCENT;
7148 return nativecontents;
7151 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
7156 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
7157 node = node->children[1];
7159 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
7160 if (loadmodel->brush.num_leafs < numleafs)
7161 loadmodel->brush.num_leafs = numleafs;
7164 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7167 q3dheader_t *header;
7168 float corner[3], yawradius, modelradius;
7170 mod->modeldatatypestring = "Q3BSP";
7172 mod->type = mod_brushq3;
7173 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
7176 header = (q3dheader_t *)buffer;
7177 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
7178 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
7180 i = LittleLong(header->version);
7181 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
7182 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
7184 mod->soundfromcenter = true;
7185 mod->TraceBox = Mod_Q3BSP_TraceBox;
7186 mod->TraceBrush = Mod_Q3BSP_TraceBrush;
7187 mod->TraceLine = Mod_Q3BSP_TraceLine;
7188 mod->TracePoint = Mod_Q3BSP_TracePoint;
7189 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
7190 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7191 mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
7192 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
7193 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
7194 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
7195 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
7196 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
7197 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
7198 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
7199 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
7200 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
7201 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
7202 mod->brush.AmbientSoundLevelsForPoint = NULL;
7203 mod->brush.RoundUpToHullSize = NULL;
7204 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
7205 mod->Draw = R_Q1BSP_Draw;
7206 mod->DrawDepth = R_Q1BSP_DrawDepth;
7207 mod->DrawDebug = R_Q1BSP_DrawDebug;
7208 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
7209 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
7210 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7211 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7212 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7213 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7214 mod->DrawLight = R_Q1BSP_DrawLight;
7216 mod_base = (unsigned char *)header;
7218 // swap all the lumps
7219 header->ident = LittleLong(header->ident);
7220 header->version = LittleLong(header->version);
7221 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
7222 for (i = 0;i < lumps;i++)
7224 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
7225 if((char *) bufferend < (char *) buffer + j)
7226 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
7227 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
7228 if((char *) bufferend < (char *) buffer + j)
7229 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
7232 * NO, do NOT clear them!
7233 * they contain actual data referenced by other stuff.
7234 * Instead, before using the advertisements lump, check header->versio
7236 * Sorry, but otherwise it breaks memory of the first lump.
7237 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
7239 header->lumps[i].fileofs = 0;
7240 header->lumps[i].filelen = 0;
7244 mod->brush.qw_md4sum = 0;
7245 mod->brush.qw_md4sum2 = 0;
7246 for (i = 0;i < lumps;i++)
7248 if (i == Q3LUMP_ENTITIES)
7250 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7251 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
7253 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7255 // all this checksumming can take a while, so let's send keepalives here too
7256 CL_KeepaliveMessage(false);
7259 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
7260 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
7261 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
7262 if (header->version == Q3BSPVERSION_IG)
7263 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
7265 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
7266 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
7267 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
7268 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
7269 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
7270 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
7271 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
7272 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
7273 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
7274 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
7275 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
7276 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
7277 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
7278 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
7279 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
7281 // the MakePortals code works fine on the q3bsp data as well
7282 if (mod_bsp_portalize.integer)
7283 Mod_Q1BSP_MakePortals();
7285 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
7286 loadmodel->brush.supportwateralpha = true;
7288 // make a single combined shadow mesh to allow optimized shadow volume creation
7289 Mod_Q1BSP_CreateShadowMesh(loadmodel);
7291 loadmodel->brush.num_leafs = 0;
7292 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
7294 if (loadmodel->brush.numsubmodels)
7295 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7298 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7303 // duplicate the basic information
7304 dpsnprintf(name, sizeof(name), "*%i", i);
7305 mod = Mod_FindName(name, loadmodel->name);
7306 // copy the base model to this one
7308 // rename the clone back to its proper name
7309 strlcpy(mod->name, name, sizeof(mod->name));
7310 mod->brush.parentmodel = loadmodel;
7311 // textures and memory belong to the main model
7312 mod->texturepool = NULL;
7313 mod->mempool = NULL;
7314 mod->brush.GetPVS = NULL;
7315 mod->brush.FatPVS = NULL;
7316 mod->brush.BoxTouchingPVS = NULL;
7317 mod->brush.BoxTouchingLeafPVS = NULL;
7318 mod->brush.BoxTouchingVisibleLeafs = NULL;
7319 mod->brush.FindBoxClusters = NULL;
7320 mod->brush.LightPoint = NULL;
7321 mod->brush.AmbientSoundLevelsForPoint = NULL;
7323 mod->brush.submodel = i;
7324 if (loadmodel->brush.submodels)
7325 loadmodel->brush.submodels[i] = mod;
7327 // make the model surface list (used by shadowing/lighting)
7328 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
7329 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
7330 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
7331 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
7332 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
7333 Mod_MakeSortedSurfaces(mod);
7335 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
7336 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
7337 // enlarge the bounding box to enclose all geometry of this model,
7338 // because q3map2 sometimes lies (mostly to affect the lightgrid),
7339 // which can in turn mess up the farclip (as well as culling when
7340 // outside the level - an unimportant concern)
7342 //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]);
7343 for (j = 0;j < mod->nummodelsurfaces;j++)
7345 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7346 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7348 if (!surface->num_vertices)
7350 for (k = 0;k < surface->num_vertices;k++, v += 3)
7352 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7353 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7354 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7355 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7356 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7357 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7360 //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]);
7361 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7362 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7363 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7364 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7365 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7366 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7367 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7368 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7369 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7370 mod->yawmins[2] = mod->normalmins[2];
7371 mod->yawmaxs[2] = mod->normalmaxs[2];
7372 mod->radius = modelradius;
7373 mod->radius2 = modelradius * modelradius;
7375 // this gets altered below if sky or water is used
7376 mod->DrawSky = NULL;
7377 mod->DrawAddWaterPlanes = NULL;
7379 for (j = 0;j < mod->nummodelsurfaces;j++)
7380 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7382 if (j < mod->nummodelsurfaces)
7383 mod->DrawSky = R_Q1BSP_DrawSky;
7385 for (j = 0;j < mod->nummodelsurfaces;j++)
7386 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7388 if (j < mod->nummodelsurfaces)
7389 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
7391 Mod_MakeCollisionBIH(mod, false, &mod->collision_bih);
7392 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
7394 // generate VBOs and other shared data before cloning submodels
7399 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);
7402 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7404 int i = LittleLong(((int *)buffer)[1]);
7405 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
7406 Mod_Q3BSP_Load(mod,buffer, bufferend);
7407 else if (i == Q2BSPVERSION)
7408 Mod_Q2BSP_Load(mod,buffer, bufferend);
7410 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
7413 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7415 Host_Error("Mod_MAP_Load: not yet implemented");
7421 typedef struct objvertex_s
7432 static unsigned char nobsp_pvs[1] = {1};
7434 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
7436 const char *textbase = (char *)buffer, *text = textbase;
7440 char materialname[MAX_QPATH];
7441 int i, j, l, numvertices, firstvertex, firsttriangle, elementindex, vertexindex, surfacevertices, surfacetriangles, surfaceelements, submodelindex = 0;
7442 int index1, index2, index3;
7443 objvertex_t vfirst, vprev, vcurrent;
7446 int numtriangles = 0;
7447 int maxtriangles = 0;
7448 objvertex_t *vertices = NULL;
7450 int maxtextures = 0, numtextures = 0, textureindex = 0;
7451 int maxv = 0, numv = 1;
7452 int maxvt = 0, numvt = 1;
7453 int maxvn = 0, numvn = 1;
7454 char *texturenames = NULL;
7455 float dist, modelradius, modelyawradius, yawradius;
7462 objvertex_t *thisvertex = NULL;
7463 int vertexhashindex;
7464 int *vertexhashtable = NULL;
7465 objvertex_t *vertexhashdata = NULL;
7466 objvertex_t *vdata = NULL;
7467 int vertexhashsize = 0;
7468 int vertexhashcount = 0;
7469 skinfile_t *skinfiles = NULL;
7470 unsigned char *data = NULL;
7471 int *submodelfirstsurface;
7472 msurface_t *surface;
7473 msurface_t *tempsurfaces;
7475 memset(&vfirst, 0, sizeof(vfirst));
7476 memset(&vprev, 0, sizeof(vprev));
7477 memset(&vcurrent, 0, sizeof(vcurrent));
7479 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
7481 loadmodel->modeldatatypestring = "OBJ";
7483 loadmodel->type = mod_obj;
7484 loadmodel->soundfromcenter = true;
7485 loadmodel->TraceBox = Mod_CollisionBIH_TraceBox;
7486 loadmodel->TraceBrush = Mod_CollisionBIH_TraceBrush;
7487 loadmodel->TraceLine = Mod_CollisionBIH_TraceLine;
7488 loadmodel->TracePoint = Mod_CollisionBIH_TracePoint_Mesh;
7489 loadmodel->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7490 loadmodel->PointSuperContents = Mod_CollisionBIH_PointSuperContents_Mesh;
7491 loadmodel->brush.TraceLineOfSight = NULL;
7492 loadmodel->brush.SuperContentsFromNativeContents = NULL;
7493 loadmodel->brush.NativeContentsFromSuperContents = NULL;
7494 loadmodel->brush.GetPVS = NULL;
7495 loadmodel->brush.FatPVS = NULL;
7496 loadmodel->brush.BoxTouchingPVS = NULL;
7497 loadmodel->brush.BoxTouchingLeafPVS = NULL;
7498 loadmodel->brush.BoxTouchingVisibleLeafs = NULL;
7499 loadmodel->brush.FindBoxClusters = NULL;
7500 loadmodel->brush.LightPoint = NULL;
7501 loadmodel->brush.FindNonSolidLocation = NULL;
7502 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
7503 loadmodel->brush.RoundUpToHullSize = NULL;
7504 loadmodel->brush.PointInLeaf = NULL;
7505 loadmodel->Draw = R_Q1BSP_Draw;
7506 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
7507 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
7508 loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
7509 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
7510 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7511 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7512 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7513 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7514 loadmodel->DrawLight = R_Q1BSP_DrawLight;
7516 skinfiles = Mod_LoadSkinFiles();
7517 if (loadmodel->numskins < 1)
7518 loadmodel->numskins = 1;
7520 // make skinscenes for the skins (no groups)
7521 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
7522 for (i = 0;i < loadmodel->numskins;i++)
7524 loadmodel->skinscenes[i].firstframe = i;
7525 loadmodel->skinscenes[i].framecount = 1;
7526 loadmodel->skinscenes[i].loop = true;
7527 loadmodel->skinscenes[i].framerate = 10;
7533 // parse the OBJ text now
7536 static char emptyarg[1] = "";
7541 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
7542 line[linelen] = text[linelen];
7544 for (argc = 0;argc < 4;argc++)
7545 argv[argc] = emptyarg;
7548 while (*s == ' ' || *s == '\t')
7558 while (*s == ' ' || *s == '\t')
7568 if (argv[0][0] == '#')
7570 if (!strcmp(argv[0], "v"))
7574 maxv = max(maxv * 2, 1024);
7575 v = (float *)Mem_Realloc(tempmempool, v, maxv * sizeof(float[3]));
7577 v[numv*3+0] = atof(argv[1]);
7578 v[numv*3+2] = atof(argv[2]);
7579 v[numv*3+1] = atof(argv[3]);
7582 else if (!strcmp(argv[0], "vt"))
7586 maxvt = max(maxvt * 2, 1024);
7587 vt = (float *)Mem_Realloc(tempmempool, vt, maxvt * sizeof(float[2]));
7589 vt[numvt*2+0] = atof(argv[1]);
7590 vt[numvt*2+1] = 1-atof(argv[2]);
7593 else if (!strcmp(argv[0], "vn"))
7597 maxvn = max(maxvn * 2, 1024);
7598 vn = (float *)Mem_Realloc(tempmempool, vn, maxvn * sizeof(float[3]));
7600 vn[numvn*3+0] = atof(argv[1]);
7601 vn[numvn*3+2] = atof(argv[2]);
7602 vn[numvn*3+1] = atof(argv[3]);
7605 else if (!strcmp(argv[0], "f"))
7609 if (maxtextures <= numtextures)
7611 maxtextures = max(maxtextures * 2, 256);
7612 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7614 textureindex = numtextures++;
7615 strlcpy(texturenames + textureindex*MAX_QPATH, loadmodel->name, MAX_QPATH);
7617 for (j = 1;j < argc;j++)
7619 index1 = atoi(argv[j]);
7620 while(argv[j][0] && argv[j][0] != '/')
7624 index2 = atoi(argv[j]);
7625 while(argv[j][0] && argv[j][0] != '/')
7629 index3 = atoi(argv[j]);
7630 // negative refers to a recent vertex
7631 // zero means not specified
7632 // positive means an absolute vertex index
7634 index1 = numv - index1;
7636 index2 = numvt - index2;
7638 index3 = numvn - index3;
7639 vcurrent.nextindex = -1;
7640 vcurrent.textureindex = textureindex;
7641 vcurrent.submodelindex = submodelindex;
7642 if (v && index1 >= 0 && index1 < numv)
7643 VectorCopy(v + 3*index1, vcurrent.v);
7644 if (vt && index2 >= 0 && index2 < numvt)
7645 Vector2Copy(vt + 2*index2, vcurrent.vt);
7646 if (vn && index3 >= 0 && index3 < numvn)
7647 VectorCopy(vn + 3*index3, vcurrent.vn);
7648 if (numtriangles == 0)
7650 VectorCopy(vcurrent.v, mins);
7651 VectorCopy(vcurrent.v, maxs);
7655 mins[0] = min(mins[0], vcurrent.v[0]);
7656 mins[1] = min(mins[1], vcurrent.v[1]);
7657 mins[2] = min(mins[2], vcurrent.v[2]);
7658 maxs[0] = max(maxs[0], vcurrent.v[0]);
7659 maxs[1] = max(maxs[1], vcurrent.v[1]);
7660 maxs[2] = max(maxs[2], vcurrent.v[2]);
7666 if (maxtriangles <= numtriangles)
7668 maxtriangles = max(maxtriangles * 2, 32768);
7669 vertices = (objvertex_t*)Mem_Realloc(loadmodel->mempool, vertices, maxtriangles * sizeof(objvertex_t[3]));
7671 vertices[numtriangles*3+0] = vfirst;
7672 vertices[numtriangles*3+1] = vprev;
7673 vertices[numtriangles*3+2] = vcurrent;
7679 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
7681 submodelindex = atof(argv[1]);
7682 loadmodel->brush.numsubmodels = max(submodelindex + 1, loadmodel->brush.numsubmodels);
7684 else if (!strcmp(argv[0], "usemtl"))
7686 for (i = 0;i < numtextures;i++)
7687 if (!strcmp(texturenames+i*MAX_QPATH, argv[1]))
7689 if (i < numtextures)
7693 if (maxtextures <= numtextures)
7695 maxtextures = max(maxtextures * 2, 256);
7696 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7698 textureindex = numtextures++;
7699 strlcpy(texturenames + textureindex*MAX_QPATH, argv[1], MAX_QPATH);
7704 // now that we have the OBJ data loaded as-is, we can convert it
7706 // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
7707 VectorCopy(mins, loadmodel->normalmins);
7708 VectorCopy(maxs, loadmodel->normalmaxs);
7709 dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
7710 modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
7711 modelyawradius = dist*dist+modelyawradius*modelyawradius;
7712 modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
7713 modelradius = modelyawradius + modelradius * modelradius;
7714 modelyawradius = sqrt(modelyawradius);
7715 modelradius = sqrt(modelradius);
7716 loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
7717 loadmodel->yawmins[2] = loadmodel->normalmins[2];
7718 loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] = modelyawradius;
7719 loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
7720 loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
7721 loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] = modelradius;
7722 loadmodel->radius = modelradius;
7723 loadmodel->radius2 = modelradius * modelradius;
7725 // allocate storage for triangles
7726 loadmodel->surfmesh.data_element3i = (int *)Mem_Alloc(loadmodel->mempool, numtriangles * sizeof(int[3]));
7727 // allocate vertex hash structures to build an optimal vertex subset
7728 vertexhashsize = numtriangles*2;
7729 vertexhashtable = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * vertexhashsize);
7730 memset(vertexhashtable, 0xFF, sizeof(int) * vertexhashsize);
7731 vertexhashdata = (objvertex_t *)Mem_Alloc(loadmodel->mempool, sizeof(*vertexhashdata) * numtriangles*3);
7732 vertexhashcount = 0;
7734 // gather surface stats for assigning vertex/triangle ranges
7738 loadmodel->num_surfaces = 0;
7739 // allocate storage for the worst case number of surfaces, later we resize
7740 tempsurfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, numtextures * loadmodel->brush.numsubmodels * sizeof(msurface_t));
7741 submodelfirstsurface = (int *)Mem_Alloc(loadmodel->mempool, (loadmodel->brush.numsubmodels+1) * sizeof(int));
7742 surface = tempsurfaces;
7743 for (submodelindex = 0;submodelindex < loadmodel->brush.numsubmodels;submodelindex++)
7745 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7746 for (textureindex = 0;textureindex < numtextures;textureindex++)
7748 for (vertexindex = 0;vertexindex < numtriangles*3;vertexindex++)
7750 thisvertex = vertices + vertexindex;
7751 if (thisvertex->submodelindex == submodelindex && thisvertex->textureindex == textureindex)
7754 // skip the surface creation if there are no triangles for it
7755 if (vertexindex == numtriangles*3)
7757 // create a surface for these vertices
7758 surfacevertices = 0;
7759 surfaceelements = 0;
7760 // we hack in a texture index in the surface to be fixed up later...
7761 surface->texture = (texture_t *)((size_t)textureindex);
7762 // calculate bounds as we go
7763 VectorCopy(thisvertex->v, surface->mins);
7764 VectorCopy(thisvertex->v, surface->maxs);
7765 for (;vertexindex < numtriangles*3;vertexindex++)
7767 thisvertex = vertices + vertexindex;
7768 if (thisvertex->submodelindex != submodelindex)
7770 if (thisvertex->textureindex != textureindex)
7772 // add vertex to surface bounds
7773 surface->mins[0] = min(surface->mins[0], thisvertex->v[0]);
7774 surface->mins[1] = min(surface->mins[1], thisvertex->v[1]);
7775 surface->mins[2] = min(surface->mins[2], thisvertex->v[2]);
7776 surface->maxs[0] = max(surface->maxs[0], thisvertex->v[0]);
7777 surface->maxs[1] = max(surface->maxs[1], thisvertex->v[1]);
7778 surface->maxs[2] = max(surface->maxs[2], thisvertex->v[2]);
7779 // add the vertex if it is not found in the merged set, and
7780 // get its index (triangle element) for the surface
7781 vertexhashindex = (unsigned int)(thisvertex->v[0] * 3571 + thisvertex->v[0] * 1777 + thisvertex->v[0] * 457) % (unsigned int)vertexhashsize;
7782 for (i = vertexhashtable[vertexhashindex];i >= 0;i = vertexhashdata[i].nextindex)
7784 vdata = vertexhashdata + i;
7785 if (vdata->submodelindex == thisvertex->submodelindex && vdata->textureindex == thisvertex->textureindex && VectorCompare(thisvertex->v, vdata->v) && VectorCompare(thisvertex->vn, vdata->vn) && Vector2Compare(thisvertex->vt, vdata->vt))
7790 i = vertexhashcount++;
7791 vdata = vertexhashdata + i;
7792 *vdata = *thisvertex;
7793 vdata->nextindex = vertexhashtable[vertexhashindex];
7794 vertexhashtable[vertexhashindex] = i;
7797 loadmodel->surfmesh.data_element3i[elementindex++] = i;
7800 surfacetriangles = surfaceelements / 3;
7801 surface->num_vertices = surfacevertices;
7802 surface->num_triangles = surfacetriangles;
7803 surface->num_firstvertex = firstvertex;
7804 surface->num_firsttriangle = firsttriangle;
7805 firstvertex += surface->num_vertices;
7806 firsttriangle += surface->num_triangles;
7808 loadmodel->num_surfaces++;
7811 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7812 numvertices = firstvertex;
7813 loadmodel->data_surfaces = (msurface_t *)Mem_Realloc(loadmodel->mempool, tempsurfaces, loadmodel->num_surfaces * sizeof(msurface_t));
7814 tempsurfaces = NULL;
7816 // allocate storage for final mesh data
7817 loadmodel->num_textures = numtextures * loadmodel->numskins;
7818 loadmodel->num_texturesperskin = numtextures;
7819 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 *));
7820 loadmodel->brush.submodels = (dp_model_t **)data;data += loadmodel->brush.numsubmodels * sizeof(dp_model_t *);
7821 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
7822 loadmodel->data_textures = (texture_t *)data;data += loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t);
7823 loadmodel->surfmesh.num_vertices = numvertices;
7824 loadmodel->surfmesh.num_triangles = numtriangles;
7825 if (r_enableshadowvolumes.integer)
7826 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += numtriangles * sizeof(int[3]);
7827 loadmodel->surfmesh.data_vertex3f = (float *)data;data += numvertices * sizeof(float[3]);
7828 loadmodel->surfmesh.data_svector3f = (float *)data;data += numvertices * sizeof(float[3]);
7829 loadmodel->surfmesh.data_tvector3f = (float *)data;data += numvertices * sizeof(float[3]);
7830 loadmodel->surfmesh.data_normal3f = (float *)data;data += numvertices * sizeof(float[3]);
7831 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += numvertices * sizeof(float[2]);
7832 if (loadmodel->surfmesh.num_vertices <= 65536)
7833 loadmodel->surfmesh.data_element3s = (unsigned short *)data;data += loadmodel->surfmesh.num_triangles * sizeof(unsigned short[3]);
7835 for (j = 0;j < loadmodel->surfmesh.num_vertices;j++)
7837 VectorCopy(vertexhashdata[j].v, loadmodel->surfmesh.data_vertex3f + 3*j);
7838 VectorCopy(vertexhashdata[j].vn, loadmodel->surfmesh.data_normal3f + 3*j);
7839 Vector2Copy(vertexhashdata[j].vt, loadmodel->surfmesh.data_texcoordtexture2f + 2*j);
7842 // load the textures
7843 for (textureindex = 0;textureindex < numtextures;textureindex++)
7844 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures + textureindex, skinfiles, texturenames + textureindex*MAX_QPATH, texturenames + textureindex*MAX_QPATH);
7845 Mod_FreeSkinFiles(skinfiles);
7847 // set the surface textures to their real values now that we loaded them...
7848 for (i = 0;i < loadmodel->num_surfaces;i++)
7849 loadmodel->data_surfaces[i].texture = loadmodel->data_textures + (size_t)loadmodel->data_surfaces[i].texture;
7853 Mem_Free(texturenames);
7857 Mem_Free(vertexhashtable);
7858 Mem_Free(vertexhashdata);
7860 // make a single combined shadow mesh to allow optimized shadow volume creation
7861 Mod_Q1BSP_CreateShadowMesh(loadmodel);
7863 // compute all the mesh information that was not loaded from the file
7864 if (loadmodel->surfmesh.data_element3s)
7865 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
7866 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
7867 Mod_ValidateElements(loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles, 0, loadmodel->surfmesh.num_vertices, __FILE__, __LINE__);
7868 // generate normals if the file did not have them
7869 if (!VectorLength2(loadmodel->surfmesh.data_normal3f))
7870 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);
7871 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);
7872 if (loadmodel->surfmesh.data_neighbor3i)
7873 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
7875 // if this is a worldmodel and has no BSP tree, create a fake one for the purpose
7876 loadmodel->brush.num_visleafs = 1;
7877 loadmodel->brush.num_leafs = 1;
7878 loadmodel->brush.num_nodes = 0;
7879 loadmodel->brush.num_leafsurfaces = loadmodel->num_surfaces;
7880 loadmodel->brush.data_leafs = (mleaf_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
7881 loadmodel->brush.data_nodes = (mnode_t *)loadmodel->brush.data_leafs;
7882 loadmodel->brush.num_pvsclusters = 1;
7883 loadmodel->brush.num_pvsclusterbytes = 1;
7884 loadmodel->brush.data_pvsclusters = nobsp_pvs;
7885 //if (loadmodel->num_nodes) loadmodel->data_nodes = (mnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_nodes * sizeof(mnode_t));
7886 //loadmodel->data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->num_leafsurfaces * sizeof(int));
7887 loadmodel->brush.data_leafsurfaces = loadmodel->sortedmodelsurfaces;
7888 VectorCopy(loadmodel->normalmins, loadmodel->brush.data_leafs->mins);
7889 VectorCopy(loadmodel->normalmaxs, loadmodel->brush.data_leafs->maxs);
7890 loadmodel->brush.data_leafs->combinedsupercontents = 0; // FIXME?
7891 loadmodel->brush.data_leafs->clusterindex = 0;
7892 loadmodel->brush.data_leafs->areaindex = 0;
7893 loadmodel->brush.data_leafs->numleafsurfaces = loadmodel->brush.num_leafsurfaces;
7894 loadmodel->brush.data_leafs->firstleafsurface = loadmodel->brush.data_leafsurfaces;
7895 loadmodel->brush.data_leafs->numleafbrushes = 0;
7896 loadmodel->brush.data_leafs->firstleafbrush = NULL;
7897 loadmodel->brush.supportwateralpha = true;
7899 if (loadmodel->brush.numsubmodels)
7900 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7903 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7908 // duplicate the basic information
7909 dpsnprintf(name, sizeof(name), "*%i", i);
7910 mod = Mod_FindName(name, loadmodel->name);
7911 // copy the base model to this one
7913 // rename the clone back to its proper name
7914 strlcpy(mod->name, name, sizeof(mod->name));
7915 mod->brush.parentmodel = loadmodel;
7916 // textures and memory belong to the main model
7917 mod->texturepool = NULL;
7918 mod->mempool = NULL;
7919 mod->brush.GetPVS = NULL;
7920 mod->brush.FatPVS = NULL;
7921 mod->brush.BoxTouchingPVS = NULL;
7922 mod->brush.BoxTouchingLeafPVS = NULL;
7923 mod->brush.BoxTouchingVisibleLeafs = NULL;
7924 mod->brush.FindBoxClusters = NULL;
7925 mod->brush.LightPoint = NULL;
7926 mod->brush.AmbientSoundLevelsForPoint = NULL;
7928 mod->brush.submodel = i;
7929 if (loadmodel->brush.submodels)
7930 loadmodel->brush.submodels[i] = mod;
7932 // make the model surface list (used by shadowing/lighting)
7933 mod->firstmodelsurface = submodelfirstsurface[i];
7934 mod->nummodelsurfaces = submodelfirstsurface[i+1] - submodelfirstsurface[i];
7935 mod->firstmodelbrush = 0;
7936 mod->nummodelbrushes = 0;
7937 mod->sortedmodelsurfaces = loadmodel->sortedmodelsurfaces + mod->firstmodelsurface;
7938 Mod_MakeSortedSurfaces(mod);
7940 VectorClear(mod->normalmins);
7941 VectorClear(mod->normalmaxs);
7943 for (j = 0;j < mod->nummodelsurfaces;j++)
7945 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7946 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7948 if (!surface->num_vertices)
7953 VectorCopy(v, mod->normalmins);
7954 VectorCopy(v, mod->normalmaxs);
7956 for (k = 0;k < surface->num_vertices;k++, v += 3)
7958 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7959 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7960 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7961 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7962 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7963 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7966 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7967 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7968 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7969 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7970 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7971 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7972 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7973 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7974 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7975 mod->yawmins[2] = mod->normalmins[2];
7976 mod->yawmaxs[2] = mod->normalmaxs[2];
7977 mod->radius = modelradius;
7978 mod->radius2 = modelradius * modelradius;
7980 // this gets altered below if sky or water is used
7981 mod->DrawSky = NULL;
7982 mod->DrawAddWaterPlanes = NULL;
7984 for (j = 0;j < mod->nummodelsurfaces;j++)
7985 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7987 if (j < mod->nummodelsurfaces)
7988 mod->DrawSky = R_Q1BSP_DrawSky;
7990 for (j = 0;j < mod->nummodelsurfaces;j++)
7991 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7993 if (j < mod->nummodelsurfaces)
7994 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
7996 Mod_MakeCollisionBIH(mod, true, &mod->collision_bih);
7997 mod->render_bih = mod->collision_bih;
7999 // generate VBOs and other shared data before cloning submodels
8004 Mem_Free(submodelfirstsurface);
8006 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);
8021 typedef struct objvertex_s
8029 typedef struct objtriangle_s
8031 objvertex_t vertex[3];
8033 // these fields are used only in conversion to surfaces
8036 int surfacevertexindex[3];
8037 float edgeplane[3][4];
8043 struct objnode_s *children[2];
8044 struct objnode_s *parent;
8045 objtriangle_t *triangles;
8054 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)
8060 float bestnormal[3];
8065 int numfronttriangles;
8066 int numbacktriangles;
8071 float outfrontpoints[5][3];
8072 float outbackpoints[5][3];
8073 int neededfrontpoints;
8074 int neededbackpoints;
8078 node = (objnode_t *)Mem_ExpandableArray_AllocRecord(array);
8079 node->parent = parent;
8082 VectorCopy(triangles[0].vertex[0].v, mins);
8083 VectorCopy(triangles[0].vertex[0].v, maxs);
8085 else if (parent && parent->children[0] == node)
8087 VectorCopy(parent->mins, mins);
8088 Vectorcopy(parent->maxs, maxs);
8090 else if (parent && parent->children[1] == node)
8092 VectorCopy(parent->mins, mins);
8093 Vectorcopy(parent->maxs, maxs);
8100 for (i = 0;i < numtriangles;i++)
8102 for (j = 0;j < 3;j++)
8104 mins[0] = min(mins[0], triangles[i].vertex[j].v[0]);
8105 mins[1] = min(mins[1], triangles[i].vertex[j].v[1]);
8106 mins[2] = min(mins[2], triangles[i].vertex[j].v[2]);
8107 maxs[0] = max(maxs[0], triangles[i].vertex[j].v[0]);
8108 maxs[1] = max(maxs[1], triangles[i].vertex[j].v[1]);
8109 maxs[2] = max(maxs[2], triangles[i].vertex[j].v[2]);
8112 VectorCopy(mins, node->mins);
8113 VectorCopy(maxs, node->maxs);
8114 if (numtriangles <= mod_obj_leaftriangles.integer)
8117 loadmodel->brush.num_leafs++;
8118 node->triangles = triangles;
8119 node->numtriangles = numtriangles;
8124 loadmodel->brush.num_nodes++;
8125 // pick a splitting plane from the various choices available to us...
8126 // early splits simply halve the interval
8128 VectorClear(bestnormal);
8130 if (numtriangles <= mod_obj_splitterlimit.integer)
8131 limit = numtriangles;
8134 for (i = -3;i < limit;i++)
8138 // first we try 3 axial splits (kdtree-like)
8140 VectorClear(normal);
8142 dist = (mins[j] + maxs[j]) * 0.5f;
8146 // then we try each triangle plane
8147 TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
8148 VectorNormalize(normal);
8149 dist = DotProduct(normal, triangles[i].vertex[0].v);
8150 // use positive axial values whenever possible
8151 if (normal[0] == -1)
8153 if (normal[1] == -1)
8155 if (normal[2] == -1)
8157 // skip planes that match the current best
8158 if (VectorCompare(normal, bestnormal) && dist == bestdist)
8165 for (j = 0;j < numtriangles;j++)
8167 dists[0] = DotProduct(normal, triangles[j].vertex[0].v) - dist;
8168 dists[1] = DotProduct(normal, triangles[j].vertex[1].v) - dist;
8169 dists[2] = DotProduct(normal, triangles[j].vertex[2].v) - dist;
8170 if (dists[0] < -DIST_EPSILON || dists[1] < -DIST_EPSILON || dists[2] < -DIST_EPSILON)
8172 if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
8177 else if (dists[0] > DIST_EPSILON || dists[1] > DIST_EPSILON || dists[2] > DIST_EPSILON)
8182 // score is supposed to:
8183 // prefer axial splits
8184 // prefer evenly dividing the input triangles
8185 // prefer triangles on the plane
8186 // avoid triangles crossing the plane
8187 score = count_on*count_on - count_both*count_both + min(count_front, count_back)*(count_front+count_back);
8188 if (normal[0] == 1 || normal[1] == 1 || normal[2] == 1)
8190 if (i == -3 || bestscore < score)
8192 VectorCopy(normal, bestnormal);
8198 // now we have chosen an optimal split plane...
8200 // divide triangles by the splitting plane
8201 numfronttriangles = 0;
8202 numbacktriangles = 0;
8203 for (i = 0;i < numtriangles;i++)
8205 neededfrontpoints = 0;
8206 neededbackpoints = 0;
8208 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);
8209 if (countonpoints > 1)
8211 // triangle lies on plane, assign it to one child only
8212 TriangleNormal(triangles[i].vertex[0].v, triangles[i].vertex[1].v, triangles[i].vertex[2].v, normal);
8213 if (DotProduct(bestnormal, normal) >= 0)
8215 // assign to front side child
8216 obj_fronttriangles[numfronttriangles++] = triangles[i];
8220 // assign to back side child
8221 obj_backtriangles[numbacktriangles++] = triangles[i];
8226 // convert clipped polygons to triangles
8227 for (j = 0;j < neededfrontpoints-2;j++)
8229 obj_fronttriangles[numfronttriangles] = triangles[i];
8230 VectorCopy(outfrontpoints[0], obj_fronttriangles[numfronttriangles].vertex[0].v);
8231 VectorCopy(outfrontpoints[j+1], obj_fronttriangles[numfronttriangles].vertex[1].v);
8232 VectorCopy(outfrontpoints[j+2], obj_fronttriangles[numfronttriangles].vertex[2].v);
8233 numfronttriangles++;
8235 for (j = 0;j < neededbackpoints-2;j++)
8237 obj_backtriangles[numbacktriangles] = triangles[i];
8238 VectorCopy(outbackpoints[0], obj_backtriangles[numbacktriangles].vertex[0].v);
8239 VectorCopy(outbackpoints[j+1], obj_backtriangles[numbacktriangles].vertex[1].v);
8240 VectorCopy(outbackpoints[j+2], obj_backtriangles[numbacktriangles].vertex[2].v);
8246 // now copy the triangles out of the big buffer
8247 if (numfronttriangles)
8249 fronttriangles = Mem_Alloc(loadmodel->mempool, fronttriangles * sizeof(*fronttriangles));
8250 memcpy(fronttriangles, obj_fronttriangles, numfronttriangles * sizeof(*fronttriangles));
8253 fronttriangles = NULL;
8254 if (numbacktriangles)
8256 backtriangles = Mem_Alloc(loadmodel->mempool, backtriangles * sizeof(*backtriangles));
8257 memcpy(backtriangles, obj_backtriangles, numbacktriangles * sizeof(*backtriangles));
8260 backtriangles = NULL;
8262 // free the original triangles we were given
8264 Mem_Free(triangles);
8268 // now create the children...
8269 node->children[0] = Mod_OBJ_BSPNodeForTriangles(node, fronttriangles, numfronttriangles, frontmins, frontmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
8270 node->children[1] = Mod_OBJ_BSPNodeForTriangles(node, backtriangles, numbacktriangles, backmins, backmaxs, nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
8274 void Mod_OBJ_SnapVertex(float *v)
8277 float a = mod_obj_vertexprecision.value;
8279 v[0] -= floor(v[0] * a + 0.5f) * b;
8280 v[1] -= floor(v[1] * a + 0.5f) * b;
8281 v[2] -= floor(v[2] * a + 0.5f) * b;
8284 void Mod_OBJ_ConvertBSPNode(objnode_t *objnode, mnode_t *mnodeparent)
8286 if (objnode->children[0])
8288 // convert to mnode_t
8289 mnode_t *mnode = loadmodel->brush.data_nodes + loadmodel->brush.num_nodes++;
8290 mnode->parent = mnodeparent;
8291 mnode->plane = loadmodel->brush.data_planes + loadmodel->brush.num_planes++;
8292 VectorCopy(objnode->normal, mnode->plane->normal);
8293 mnode->plane->dist = objnode->dist;
8294 PlaneClassify(mnode->plane);
8295 VectorCopy(objnode->mins, mnode->mins);
8296 VectorCopy(objnode->maxs, mnode->maxs);
8297 // push combinedsupercontents up to the parent
8299 mnodeparent->combinedsupercontents |= mnode->combinedsupercontents;
8300 mnode->children[0] = Mod_OBJ_ConvertBSPNode(objnode->children[0], mnode);
8301 mnode->children[1] = Mod_OBJ_ConvertBSPNode(objnode->children[1], mnode);
8305 // convert to mleaf_t
8306 mleaf_t *mleaf = loadmodel->brush.data_leafs + loadmodel->brush.num_leafs++;
8307 mleaf->parent = mnodeparent;
8308 VectorCopy(objnode->mins, mleaf->mins);
8309 VectorCopy(objnode->maxs, mleaf->maxs);
8310 mleaf->clusterindex = loadmodel->brush.num_leafs - 1;
8311 if (objnode->numtriangles)
8313 objtriangle_t *triangles = objnode->triangles;
8314 int numtriangles = objnode->numtriangles;
8318 objvertex_t vertex[3];
8320 maxsurfaces = numtriangles;
8322 // calculate some more data on each triangle for surface gathering
8323 for (i = 0;i < numtriangles;i++)
8325 triangle = triangles + i;
8326 texture = loadmodel->data_textures + triangle->textureindex;
8327 Mod_OBJ_SnapVertex(triangle->vertex[0].v);
8328 Mod_OBJ_SnapVertex(triangle->vertex[1].v);
8329 Mod_OBJ_SnapVertex(triangle->vertex[2].v);
8330 TriangleNormal(triangle->vertex[0].v, triangle->vertex[1].v, triangle->vertex[2].v, normal);
8332 if (fabs(normal[axis]) < fabs(normal[1]))
8334 if (fabs(normal[axis]) < fabs(normal[2]))
8336 VectorClear(normal);
8338 triangle->axis = axis;
8339 VectorSubtract(triangle->vertex[1].v, triangle->vertex[0].v, edge[0]);
8340 VectorSubtract(triangle->vertex[2].v, triangle->vertex[1].v, edge[1]);
8341 VectorSubtract(triangle->vertex[0].v, triangle->vertex[2].v, edge[2]);
8342 CrossProduct(edge[0], normal, triangle->edgeplane[0]);
8343 CrossProduct(edge[1], normal, triangle->edgeplane[1]);
8344 CrossProduct(edge[2], normal, triangle->edgeplane[2]);
8345 VectorNormalize(triangle->edgeplane[0]);
8346 VectorNormalize(triangle->edgeplane[1]);
8347 VectorNormalize(triangle->edgeplane[2]);
8348 triangle->edgeplane[0][3] = DotProduct(triangle->edgeplane[0], triangle->vertex[0].v);
8349 triangle->edgeplane[1][3] = DotProduct(triangle->edgeplane[1], triangle->vertex[1].v);
8350 triangle->edgeplane[2][3] = DotProduct(triangle->edgeplane[2], triangle->vertex[2].v);
8351 triangle->surfaceindex = 0;
8352 // add to the combined supercontents while we're here...
8353 mleaf->combinedsupercontents |= texture->supercontents;
8356 for (i = 0;i < numtriangles;i++)
8358 // skip already-assigned triangles
8359 if (triangles[i].surfaceindex)
8361 texture = loadmodel->data_textures + triangles[i].textureindex;
8362 // assign a new surface to this triangle
8363 triangles[i].surfaceindex = surfaceindex++;
8364 axis = triangles[i].axis;
8366 // find the triangle's neighbors, this can take multiple passes
8371 for (j = i+1;j < numtriangles;j++)
8373 if (triangles[j].surfaceindex || triangles[j].axis != axis || triangles[j].texture != texture)
8375 triangle = triangles + j;
8376 for (k = i;k < j;k++)
8378 if (triangles[k].surfaceindex != surfaceindex)
8380 if (VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[0].v)
8381 || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[1].v)
8382 || VectorCompare(triangles[k].vertex[0].v, triangles[j].vertex[2].v)
8383 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[0].v)
8384 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[1].v)
8385 || VectorCompare(triangles[k].vertex[1].v, triangles[j].vertex[2].v)
8386 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[0].v)
8387 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[1].v)
8388 || VectorCompare(triangles[k].vertex[2].v, triangles[j].vertex[2].v))
8390 // shares a vertex position
8394 for (k = 0;k < numvertices;k++)
8395 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))
8397 if (k == numvertices)
8398 break; // not a neighbor
8399 // this triangle is a neighbor and has the same axis and texture
8400 // check now if it overlaps in lightmap projection space
8401 triangles[j].surfaceindex;
8405 //triangles[i].surfaceindex = surfaceindex++;
8406 for (surfaceindex = 0;surfaceindex < numsurfaces;surfaceindex++)
8408 if (surfaces[surfaceindex].texture != texture)
8410 // check if any triangles already in this surface overlap in lightmap projection space
8417 // let the collision code simply use the surfaces
8418 mleaf->containscollisionsurfaces = mleaf->combinedsupercontents != 0;
8419 mleaf->numleafsurfaces = ?;
8420 mleaf->firstleafsurface = ?;
8422 // push combinedsupercontents up to the parent
8424 mnodeparent->combinedsupercontents |= mleaf->combinedsupercontents;
8429 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
8432 const char *textbase = (char *)buffer, *text = textbase;
8436 char materialname[MAX_QPATH];
8437 int j, index1, index2, index3, first, prev, index;
8440 int numtriangles = 0;
8441 int maxtriangles = 131072;
8442 objtriangle_t *triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
8444 int maxtextures = 256, numtextures = 0, textureindex = 0;
8445 int maxv = 1024, numv = 0;
8446 int maxvt = 1024, numvt = 0;
8447 int maxvn = 1024, numvn = 0;
8448 char **texturenames;
8449 float *v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
8450 float *vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
8451 float *vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
8452 objvertex_t vfirst, vprev, vcurrent;
8457 int maxverthash = 65536, numverthash = 0;
8458 int numhashindex = 65536;
8459 struct objverthash_s
8461 struct objverthash_s *next;
8467 *hash, **verthash = Mem_Alloc(tempmempool, numhashindex * sizeof(*verthash)), *verthashdata = Mem_Alloc(tempmempool, maxverthash * sizeof(*verthashdata)), *oldverthashdata;
8470 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
8472 loadmodel->modeldatatypestring = "OBJ";
8474 loadmodel->type = mod_obj;
8475 loadmodel->soundfromcenter = true;
8476 loadmodel->TraceBox = Mod_OBJ_TraceBox;
8477 loadmodel->TraceLine = Mod_OBJ_TraceLine;
8478 loadmodel->TracePoint = Mod_OBJ_TracePoint;
8479 loadmodel->PointSuperContents = Mod_OBJ_PointSuperContents;
8480 loadmodel->TraceLineAgainstSurfaces = Mod_OBJ_TraceLineAgainstSurfaces;
8481 loadmodel->brush.TraceLineOfSight = Mod_OBJ_TraceLineOfSight;
8482 loadmodel->brush.SuperContentsFromNativeContents = Mod_OBJ_SuperContentsFromNativeContents;
8483 loadmodel->brush.NativeContentsFromSuperContents = Mod_OBJ_NativeContentsFromSuperContents;
8484 loadmodel->brush.GetPVS = Mod_OBJ_GetPVS;
8485 loadmodel->brush.FatPVS = Mod_OBJ_FatPVS;
8486 loadmodel->brush.BoxTouchingPVS = Mod_OBJ_BoxTouchingPVS;
8487 loadmodel->brush.BoxTouchingLeafPVS = Mod_OBJ_BoxTouchingLeafPVS;
8488 loadmodel->brush.BoxTouchingVisibleLeafs = Mod_OBJ_BoxTouchingVisibleLeafs;
8489 loadmodel->brush.FindBoxClusters = Mod_OBJ_FindBoxClusters;
8490 loadmodel->brush.LightPoint = Mod_OBJ_LightPoint;
8491 loadmodel->brush.FindNonSolidLocation = Mod_OBJ_FindNonSolidLocation;
8492 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
8493 loadmodel->brush.RoundUpToHullSize = NULL;
8494 loadmodel->brush.PointInLeaf = Mod_OBJ_PointInLeaf;
8495 loadmodel->Draw = R_Q1BSP_Draw;
8496 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
8497 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
8498 loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
8499 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
8500 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
8501 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
8502 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
8503 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
8504 loadmodel->DrawLight = R_Q1BSP_DrawLight;
8509 // parse the OBJ text now
8516 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
8517 line[linelen] = text[linelen];
8519 for (argc = 0;argc < (int)(sizeof(argv)/sizeof(argv[0]));argc++)
8523 while (*s == ' ' || *s == '\t')
8533 while (*s == ' ' || *s == '\t')
8538 if (argv[0][0] == '#')
8540 if (!strcmp(argv[0], "v"))
8546 v = Mem_Alloc(tempmempool, maxv * sizeof(float[3]));
8549 memcpy(v, oldv, numv * sizeof(float[3]));
8553 v[numv*3+0] = atof(argv[1]);
8554 v[numv*3+1] = atof(argv[2]);
8555 v[numv*3+2] = atof(argv[3]);
8558 else if (!strcmp(argv[0], "vt"))
8564 vt = Mem_Alloc(tempmempool, maxvt * sizeof(float[2]));
8567 memcpy(vt, oldvt, numvt * sizeof(float[2]));
8571 vt[numvt*2+0] = atof(argv[1]);
8572 vt[numvt*2+1] = atof(argv[2]);
8575 else if (!strcmp(argv[0], "vn"))
8581 vn = Mem_Alloc(tempmempool, maxvn * sizeof(float[3]));
8584 memcpy(vn, oldvn, numvn * sizeof(float[3]));
8588 vn[numvn*3+0] = atof(argv[1]);
8589 vn[numvn*3+1] = atof(argv[2]);
8590 vn[numvn*3+2] = atof(argv[3]);
8593 else if (!strcmp(argv[0], "f"))
8595 for (j = 1;j < argc;j++)
8597 index1 = atoi(argv[j]);
8598 while(argv[j][0] && argv[j][0] != '/')
8602 index2 = atoi(argv[j]);
8603 while(argv[j][0] && argv[j][0] != '/')
8607 index3 = atoi(argv[j]);
8608 // negative refers to a recent vertex
8609 // zero means not specified
8610 // positive means an absolute vertex index
8612 index1 = numv - index1;
8614 index2 = numvt - index2;
8616 index3 = numvn - index3;
8617 VectorCopy(v + 3*index1, vcurrent.v);
8618 Vector2Copy(vt + 2*index2, vcurrent.vt);
8619 VectorCopy(vn + 3*index3, vcurrent.vn);
8620 if (numtriangles == 0)
8622 VectorCopy(vcurrent.v, mins);
8623 VectorCopy(vcurrent.v, maxs);
8627 mins[0] = min(mins[0], vcurrent.v[0]);
8628 mins[1] = min(mins[1], vcurrent.v[1]);
8629 mins[2] = min(mins[2], vcurrent.v[2]);
8630 maxs[0] = max(maxs[0], vcurrent.v[0]);
8631 maxs[1] = max(maxs[1], vcurrent.v[1]);
8632 maxs[2] = max(maxs[2], vcurrent.v[2]);
8638 if (maxtriangles <= numtriangles)
8640 objtriangle_t *oldtriangles = triangles;
8642 triangles = Mem_Alloc(tempmempool, maxtriangles * sizeof(*triangles));
8645 memcpy(triangles, oldtriangles, maxtriangles * sizeof(*triangles));
8646 Mem_Free(oldtriangles);
8649 triangles[numtriangles].textureindex = textureindex;
8650 triangles[numtriangles].vertex[0] = vfirst;
8651 triangles[numtriangles].vertex[1] = vprev;
8652 triangles[numtriangles].vertex[2] = vcurrent;
8659 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
8661 else if (!!strcmp(argv[0], "usemtl"))
8663 for (i = 0;i < numtextures;i++)
8664 if (!strcmp(texturenames[numtextures], argv[1]))
8666 if (i < numtextures)
8667 texture = textures + i;
8670 if (maxtextures <= numtextures)
8672 texture_t *oldtextures = textures;
8674 textures = Mem_Alloc(tempmempool, maxtextures * sizeof(*textures));
8677 memcpy(textures, oldtextures, numtextures * sizeof(*textures));
8678 Mem_Free(oldtextures);
8681 textureindex = numtextures++;
8682 texturenames[textureindex] = Mem_Alloc(tempmempool, strlen(argv[1]) + 1);
8683 memcpy(texturenames[textureindex], argv[1], strlen(argv[1]) + 1);
8693 // now that we have the OBJ data loaded as-is, we can convert it
8695 // load the textures
8696 loadmodel->num_textures = numtextures;
8697 loadmodel->data_textures = Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
8698 for (i = 0;i < numtextures;i++)
8699 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, texturenames[i], true, true, TEXF_MIPMAP | TEXF_ALPHA | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS);
8701 // free the texturenames array since we are now done with it
8702 for (i = 0;i < numtextures;i++)
8704 Mem_Free(texturenames[i]);
8705 texturenames[i] = NULL;
8707 Mem_Free(texturenames);
8708 texturenames = NULL;
8710 // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
8711 VectorCopy(mins, loadmodel->normalmins);
8712 VectorCopy(maxs, loadmodel->normalmaxs);
8713 dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
8714 modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
8715 modelyawradius = dist*dist+modelyawradius*modelyawradius;
8716 modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
8717 modelradius = modelyawradius + modelradius * modelradius;
8718 modelyawradius = sqrt(modelyawradius);
8719 modelradius = sqrt(modelradius);
8720 loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
8721 loadmodel->yawmins[2] = loadmodel->normalmins[2];
8722 loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] = modelyawradius;
8723 loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
8724 loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
8725 loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] = modelradius;
8726 loadmodel->radius = modelradius;
8727 loadmodel->radius2 = modelradius * modelradius;
8729 // make sure the temp triangle buffer is big enough for BSP building
8730 maxclippedtriangles = numtriangles*4;
8731 if (numtriangles > 0)
8733 clippedfronttriangles = Mem_Alloc(loadmodel->mempool, maxclippedtriangles * 2 * sizeof(objtriangle_t));
8734 clippedbacktriangles = clippedfronttriangles + maxclippedtriangles;
8737 // 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
8738 loadmodel->brush.num_leafs = 0;
8739 loadmodel->brush.num_nodes = 0;
8740 Mem_ExpandableArray_NewArray(&nodesarray, loadmodel->mempool, sizeof(objnode_t), 1024);
8741 rootnode = Mod_OBJ_BSPNodeForTriangles(triangles, numtriangles, mins, maxs, &nodesarray, maxclippedtriangles, clippedfronttriangles, clippedbacktriangles);
8743 // convert the BSP tree to mnode_t and mleaf_t structures and convert the triangles to msurface_t...
8744 loadmodel->brush.data_leafs = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
8745 loadmodel->brush.data_nodes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mnode_t));
8746 loadmodel->brush.data_planes = Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(mplane_t));
8747 loadmodel->brush.num_leafs = 0;
8748 loadmodel->brush.num_nodes = 0;
8749 loadmodel->brush.num_planes = 0;
8750 Mod_OBJ_ConvertAndFreeBSPNode(rootnode);
8752 if (clippedfronttriangles)
8753 Mem_Free(clippedfronttriangles);
8754 maxclippedtriangles = 0;
8755 clippedfronttriangles = NULL;
8756 clippedbacktriangles = NULL;
8758 --- NOTHING DONE PAST THIS POINT ---
8760 loadmodel->numskins = LittleLong(pinmodel->num_skins);
8761 numxyz = LittleLong(pinmodel->num_xyz);
8762 numst = LittleLong(pinmodel->num_st);
8763 loadmodel->surfmesh.num_triangles = LittleLong(pinmodel->num_tris);
8764 loadmodel->numframes = LittleLong(pinmodel->num_frames);
8765 loadmodel->surfmesh.num_morphframes = loadmodel->numframes;
8766 loadmodel->num_poses = loadmodel->surfmesh.num_morphframes;
8767 skinwidth = LittleLong(pinmodel->skinwidth);
8768 skinheight = LittleLong(pinmodel->skinheight);
8769 iskinwidth = 1.0f / skinwidth;
8770 iskinheight = 1.0f / skinheight;
8772 loadmodel->num_surfaces = 1;
8773 loadmodel->nummodelsurfaces = loadmodel->num_surfaces;
8774 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));
8775 loadmodel->data_surfaces = (msurface_t *)data;data += loadmodel->num_surfaces * sizeof(msurface_t);
8776 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
8777 loadmodel->sortedmodelsurfaces[0] = 0;
8778 loadmodel->animscenes = (animscene_t *)data;data += loadmodel->numframes * sizeof(animscene_t);
8779 loadmodel->surfmesh.data_morphmd2framesize6f = (float *)data;data += loadmodel->numframes * sizeof(float[6]);
8780 loadmodel->surfmesh.data_element3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
8781 if (r_enableshadowvolumes.integer)
8782 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += loadmodel->surfmesh.num_triangles * sizeof(int[3]);
8784 loadmodel->synctype = ST_RAND;
8787 inskin = (char *)(base + LittleLong(pinmodel->ofs_skins));
8788 skinfiles = Mod_LoadSkinFiles();
8791 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
8792 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
8793 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
8794 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures, skinfiles, "default", "");
8795 Mod_FreeSkinFiles(skinfiles);
8797 else if (loadmodel->numskins)
8799 // skins found (most likely not a player model)
8800 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
8801 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
8802 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
8803 for (i = 0;i < loadmodel->numskins;i++, inskin += MD2_SKINNAME)
8804 Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i * loadmodel->num_surfaces, inskin, true, true, (r_mipskins.integer ? TEXF_MIPMAP : 0) | TEXF_ALPHA | TEXF_PICMIP | TEXF_COMPRESS);
8808 // no skins (most likely a player model)
8809 loadmodel->numskins = 1;
8810 loadmodel->num_textures = loadmodel->num_surfaces * loadmodel->numskins;
8811 loadmodel->num_texturesperskin = loadmodel->num_surfaces;
8812 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t));
8813 Mod_BuildAliasSkinFromSkinFrame(loadmodel->data_textures, NULL);
8816 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
8817 for (i = 0;i < loadmodel->numskins;i++)
8819 loadmodel->skinscenes[i].firstframe = i;
8820 loadmodel->skinscenes[i].framecount = 1;
8821 loadmodel->skinscenes[i].loop = true;
8822 loadmodel->skinscenes[i].framerate = 10;
8825 // load the triangles and stvert data
8826 inst = (unsigned short *)(base + LittleLong(pinmodel->ofs_st));
8827 intri = (md2triangle_t *)(base + LittleLong(pinmodel->ofs_tris));
8828 md2verthash = (struct md2verthash_s **)Mem_Alloc(tempmempool, 65536 * sizeof(hash));
8829 md2verthashdata = (struct md2verthash_s *)Mem_Alloc(tempmempool, loadmodel->surfmesh.num_triangles * 3 * sizeof(*hash));
8830 // swap the triangle list
8831 loadmodel->surfmesh.num_vertices = 0;
8832 for (i = 0;i < loadmodel->surfmesh.num_triangles;i++)
8834 for (j = 0;j < 3;j++)
8836 xyz = (unsigned short) LittleShort (intri[i].index_xyz[j]);
8837 st = (unsigned short) LittleShort (intri[i].index_st[j]);
8840 Con_Printf("%s has an invalid xyz index (%i) on triangle %i, resetting to 0\n", loadmodel->name, xyz, i);
8845 Con_Printf("%s has an invalid st index (%i) on triangle %i, resetting to 0\n", loadmodel->name, st, i);
8848 hashindex = (xyz * 256 + st) & 65535;
8849 for (hash = md2verthash[hashindex];hash;hash = hash->next)
8850 if (hash->xyz == xyz && hash->st == st)
8854 hash = md2verthashdata + loadmodel->surfmesh.num_vertices++;
8857 hash->next = md2verthash[hashindex];
8858 md2verthash[hashindex] = hash;
8860 loadmodel->surfmesh.data_element3i[i*3+j] = (hash - md2verthashdata);
8864 vertremap = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->surfmesh.num_vertices * sizeof(int));
8865 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));
8866 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += loadmodel->surfmesh.num_vertices * sizeof(float[2]);
8867 loadmodel->surfmesh.data_morphmdlvertex = (trivertx_t *)data;data += loadmodel->surfmesh.num_vertices * loadmodel->surfmesh.num_morphframes * sizeof(trivertx_t);
8868 for (i = 0;i < loadmodel->surfmesh.num_vertices;i++)
8871 hash = md2verthashdata + i;
8872 vertremap[i] = hash->xyz;
8873 sts = LittleShort(inst[hash->st*2+0]);
8874 stt = LittleShort(inst[hash->st*2+1]);
8875 if (sts < 0 || sts >= skinwidth || stt < 0 || stt >= skinheight)
8877 Con_Printf("%s has an invalid skin coordinate (%i %i) on vert %i, changing to 0 0\n", loadmodel->name, sts, stt, i);
8881 loadmodel->surfmesh.data_texcoordtexture2f[i*2+0] = sts * iskinwidth;
8882 loadmodel->surfmesh.data_texcoordtexture2f[i*2+1] = stt * iskinheight;
8885 Mem_Free(md2verthash);
8886 Mem_Free(md2verthashdata);
8888 // generate ushort elements array if possible
8889 if (loadmodel->surfmesh.num_vertices <= 65536)
8890 loadmodel->surfmesh.data_element3s = (unsigned short *)Mem_Alloc(loadmodel->mempool, sizeof(unsigned short[3]) * loadmodel->surfmesh.num_triangles);
8893 datapointer = (base + LittleLong(pinmodel->ofs_frames));
8894 for (i = 0;i < loadmodel->surfmesh.num_morphframes;i++)
8899 pinframe = (md2frame_t *)datapointer;
8900 datapointer += sizeof(md2frame_t);
8901 // store the frame scale/translate into the appropriate array
8902 for (j = 0;j < 3;j++)
8904 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+j] = LittleFloat(pinframe->scale[j]);
8905 loadmodel->surfmesh.data_morphmd2framesize6f[i*6+3+j] = LittleFloat(pinframe->translate[j]);
8907 // convert the vertices
8908 v = (trivertx_t *)datapointer;
8909 out = loadmodel->surfmesh.data_morphmdlvertex + i * loadmodel->surfmesh.num_vertices;
8910 for (k = 0;k < loadmodel->surfmesh.num_vertices;k++)
8911 out[k] = v[vertremap[k]];
8912 datapointer += numxyz * sizeof(trivertx_t);
8914 strlcpy(loadmodel->animscenes[i].name, pinframe->name, sizeof(loadmodel->animscenes[i].name));
8915 loadmodel->animscenes[i].firstframe = i;
8916 loadmodel->animscenes[i].framecount = 1;
8917 loadmodel->animscenes[i].framerate = 10;
8918 loadmodel->animscenes[i].loop = true;
8921 Mem_Free(vertremap);
8923 Mod_MakeSortedSurfaces(loadmodel);
8924 if (loadmodel->surfmesh.data_neighbor3i)
8925 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
8926 Mod_Alias_CalculateBoundingBox();
8927 Mod_Alias_MorphMesh_CompileFrames();
8929 surface = loadmodel->data_surfaces;
8930 surface->texture = loadmodel->data_textures;
8931 surface->num_firsttriangle = 0;
8932 surface->num_triangles = loadmodel->surfmesh.num_triangles;
8933 surface->num_firstvertex = 0;
8934 surface->num_vertices = loadmodel->surfmesh.num_vertices;
8936 loadmodel->surfmesh.isanimated = false;
8938 if (loadmodel->surfmesh.data_element3s)
8939 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
8940 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
8943 #endif // !OBJASMODEL
8945 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
8947 // we already have done PVS culling at this point...
8948 // so we don't need to do it again.
8951 vec3_t testorigin, mins, maxs;
8953 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
8954 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
8955 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
8957 if(model->brush.TraceLineOfSight(model, eye, testorigin))
8960 // expand the box a little
8961 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
8962 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
8963 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
8964 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
8965 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
8966 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
8968 for(i = 0; i != numsamples; ++i)
8970 testorigin[0] = lhrandom(mins[0], maxs[0]);
8971 testorigin[1] = lhrandom(mins[1], maxs[1]);
8972 testorigin[2] = lhrandom(mins[2], maxs[2]);
8974 if(model->brush.TraceLineOfSight(model, eye, testorigin))