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 r_trippy = {0, "r_trippy", "0", "easter egg"};
42 cvar_t r_fxaa = {CVAR_SAVE, "r_fxaa", "0", "fast approximate anti aliasing"};
43 cvar_t mod_noshader_default_offsetmapping = {CVAR_SAVE, "mod_noshader_default_offsetmapping", "1", "use offsetmapping by default on all surfaces that are not using q3 shader files"};
44 cvar_t mod_obj_orientation = {0, "mod_obj_orientation", "1", "fix orientation of OBJ models to the usual conventions (if zero, use coordinates as is)"};
45 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
46 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)"};
47 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)"};
48 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
49 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
50 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, ..."};
51 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)"};
52 cvar_t mod_q3bsp_tracelineofsight_brushes = {0, "mod_q3bsp_tracelineofsight_brushes", "0", "enables culling of entities behind detail brushes, curves, etc"};
53 cvar_t mod_q3bsp_sRGBlightmaps = {0, "mod_q3bsp_sRGBlightmaps", "0", "treat lightmaps from Q3 maps as sRGB when vid_sRGB is active"};
54 cvar_t mod_q3shader_default_offsetmapping = {CVAR_SAVE, "mod_q3shader_default_offsetmapping", "1", "use offsetmapping by default on all surfaces that are using q3 shader files"};
55 cvar_t mod_q3shader_default_offsetmapping_scale = {CVAR_SAVE, "mod_q3shader_default_offsetmapping_scale", "1", "default scale used for offsetmapping"};
56 cvar_t mod_q3shader_default_offsetmapping_bias = {CVAR_SAVE, "mod_q3shader_default_offsetmapping_bias", "0", "default bias used for offsetmapping"};
57 cvar_t mod_q3shader_default_polygonfactor = {0, "mod_q3shader_default_polygonfactor", "0", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
58 cvar_t mod_q3shader_default_polygonoffset = {0, "mod_q3shader_default_polygonoffset", "-2", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
59 cvar_t mod_q3shader_force_addalpha = {0, "mod_q3shader_force_addalpha", "0", "treat GL_ONE GL_ONE (or add) blendfunc as GL_SRC_ALPHA GL_ONE for compatibility with older DarkPlaces releases"};
60 cvar_t mod_q3shader_force_terrain_alphaflag = {0, "mod_q3shader_force_terrain_alphaflag", "0", "for multilayered terrain shaders force TEXF_ALPHA flag on both layers"};
62 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)"};
63 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"};
64 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"};
66 static texture_t mod_q1bsp_texture_solid;
67 static texture_t mod_q1bsp_texture_sky;
68 static texture_t mod_q1bsp_texture_lava;
69 static texture_t mod_q1bsp_texture_slime;
70 static texture_t mod_q1bsp_texture_water;
72 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end);
74 void Mod_BrushInit(void)
76 // Cvar_RegisterVariable(&r_subdivide_size);
77 Cvar_RegisterVariable(&mod_bsp_portalize);
78 Cvar_RegisterVariable(&r_novis);
79 Cvar_RegisterVariable(&r_nosurftextures);
80 Cvar_RegisterVariable(&r_subdivisions_tolerance);
81 Cvar_RegisterVariable(&r_subdivisions_mintess);
82 Cvar_RegisterVariable(&r_subdivisions_maxtess);
83 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
84 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
85 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
86 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
87 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
88 Cvar_RegisterVariable(&r_trippy);
89 Cvar_RegisterVariable(&r_fxaa);
90 Cvar_RegisterVariable(&mod_noshader_default_offsetmapping);
91 Cvar_RegisterVariable(&mod_obj_orientation);
92 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
93 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
94 Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
95 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
96 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
97 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
98 Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
99 Cvar_RegisterVariable(&mod_q3bsp_sRGBlightmaps);
100 Cvar_RegisterVariable(&mod_q3bsp_tracelineofsight_brushes);
101 Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping);
102 Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping_scale);
103 Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping_bias);
104 Cvar_RegisterVariable(&mod_q3shader_default_polygonfactor);
105 Cvar_RegisterVariable(&mod_q3shader_default_polygonoffset);
106 Cvar_RegisterVariable(&mod_q3shader_force_addalpha);
107 Cvar_RegisterVariable(&mod_q3shader_force_terrain_alphaflag);
108 Cvar_RegisterVariable(&mod_q1bsp_polygoncollisions);
109 Cvar_RegisterVariable(&mod_collision_bih);
110 Cvar_RegisterVariable(&mod_recalculatenodeboxes);
112 // these games were made for older DP engines and are no longer
113 // maintained; use this hack to show their textures properly
114 if(gamemode == GAME_NEXUIZ)
115 Cvar_SetQuick(&mod_q3shader_force_addalpha, "1");
117 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
118 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
119 mod_q1bsp_texture_solid.surfaceflags = 0;
120 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
122 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
123 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
124 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
125 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
127 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
128 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
129 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
130 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
132 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
133 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
134 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
135 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
137 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
138 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
139 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
140 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
143 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
150 // LordHavoc: modified to start at first clip node,
151 // in other words: first node of the (sub)model
152 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
154 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
156 return (mleaf_t *)node;
159 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
163 leaf = Mod_Q1BSP_PointInLeaf(model, p);
166 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
169 memcpy(out, leaf->ambient_sound_level, i);
175 memset(out, 0, outsize);
178 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
181 int nodestackindex = 0;
182 mnode_t *node, *nodestack[1024];
183 if (!model->brush.num_pvsclusters)
185 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
191 // node - recurse down the BSP tree
192 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
196 return -1; // ERROR: NAN bounding box!
197 // box is on one side of plane, take that path
198 node = node->children[sides-1];
202 // box crosses plane, take one path and remember the other
203 if (nodestackindex < 1024)
204 nodestack[nodestackindex++] = node->children[0];
205 node = node->children[1];
211 // leaf - add clusterindex to list
212 if (numclusters < maxclusters)
213 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
217 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
221 if (nodestackindex < 1024)
222 nodestack[nodestackindex++] = node->children[0];
223 node = node->children[1];
228 // leaf - add clusterindex to list
229 if (numclusters < maxclusters)
230 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
235 // try another path we didn't take earlier
236 if (nodestackindex == 0)
238 node = nodestack[--nodestackindex];
240 // return number of clusters found (even if more than the maxclusters)
244 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
246 int nodestackindex = 0;
247 mnode_t *node, *nodestack[1024];
248 if (!model->brush.num_pvsclusters)
250 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
256 // node - recurse down the BSP tree
257 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
261 return -1; // ERROR: NAN bounding box!
262 // box is on one side of plane, take that path
263 node = node->children[sides-1];
267 // box crosses plane, take one path and remember the other
268 if (nodestackindex < 1024)
269 nodestack[nodestackindex++] = node->children[0];
270 node = node->children[1];
276 // leaf - check cluster bit
277 int clusterindex = ((mleaf_t *)node)->clusterindex;
278 if (CHECKPVSBIT(pvs, clusterindex))
280 // it is visible, return immediately with the news
285 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
289 if (nodestackindex < 1024)
290 nodestack[nodestackindex++] = node->children[0];
291 node = node->children[1];
296 // leaf - check cluster bit
297 int clusterindex = ((mleaf_t *)node)->clusterindex;
298 if (CHECKPVSBIT(pvs, clusterindex))
300 // it is visible, return immediately with the news
306 // nothing to see here, try another path we didn't take earlier
307 if (nodestackindex == 0)
309 node = nodestack[--nodestackindex];
315 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
317 int nodestackindex = 0;
318 mnode_t *node, *nodestack[1024];
319 if (!model->brush.num_leafs)
321 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
327 // node - recurse down the BSP tree
328 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
332 return -1; // ERROR: NAN bounding box!
333 // box is on one side of plane, take that path
334 node = node->children[sides-1];
338 // box crosses plane, take one path and remember the other
339 if (nodestackindex < 1024)
340 nodestack[nodestackindex++] = node->children[0];
341 node = node->children[1];
347 // leaf - check cluster bit
348 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
349 if (CHECKPVSBIT(pvs, clusterindex))
351 // it is visible, return immediately with the news
356 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
360 if (nodestackindex < 1024)
361 nodestack[nodestackindex++] = node->children[0];
362 node = node->children[1];
367 // leaf - check cluster bit
368 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
369 if (CHECKPVSBIT(pvs, clusterindex))
371 // it is visible, return immediately with the news
377 // nothing to see here, try another path we didn't take earlier
378 if (nodestackindex == 0)
380 node = nodestack[--nodestackindex];
386 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
388 int nodestackindex = 0;
389 mnode_t *node, *nodestack[1024];
390 if (!model->brush.num_leafs)
392 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
398 // node - recurse down the BSP tree
399 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
403 return -1; // ERROR: NAN bounding box!
404 // box is on one side of plane, take that path
405 node = node->children[sides-1];
409 // box crosses plane, take one path and remember the other
410 if (nodestackindex < 1024)
411 nodestack[nodestackindex++] = node->children[0];
412 node = node->children[1];
418 // leaf - check if it is visible
419 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
421 // it is visible, return immediately with the news
426 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
430 if (nodestackindex < 1024)
431 nodestack[nodestackindex++] = node->children[0];
432 node = node->children[1];
437 // leaf - check if it is visible
438 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
440 // it is visible, return immediately with the news
446 // nothing to see here, try another path we didn't take earlier
447 if (nodestackindex == 0)
449 node = nodestack[--nodestackindex];
455 typedef struct findnonsolidlocationinfo_s
458 vec3_t absmin, absmax;
464 findnonsolidlocationinfo_t;
466 static void Mod_Q1BSP_FindNonSolidLocation_r_Triangle(findnonsolidlocationinfo_t *info, msurface_t *surface, int k)
469 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
471 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
472 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
473 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
474 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
475 VectorSubtract(vert[1], vert[0], edge[0]);
476 VectorSubtract(vert[2], vert[1], edge[1]);
477 CrossProduct(edge[1], edge[0], facenormal);
478 if (facenormal[0] || facenormal[1] || facenormal[2])
480 VectorNormalize(facenormal);
481 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
482 if (f <= info->bestdist && f >= -info->bestdist)
484 VectorSubtract(vert[0], vert[2], edge[2]);
485 VectorNormalize(edge[0]);
486 VectorNormalize(edge[1]);
487 VectorNormalize(edge[2]);
488 CrossProduct(facenormal, edge[0], edgenormal[0]);
489 CrossProduct(facenormal, edge[1], edgenormal[1]);
490 CrossProduct(facenormal, edge[2], edgenormal[2]);
492 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
493 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
494 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
496 // we got lucky, the center is within the face
497 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
501 if (info->bestdist > dist)
503 info->bestdist = dist;
504 VectorScale(facenormal, (info->radius - -dist), info->nudge);
509 if (info->bestdist > dist)
511 info->bestdist = dist;
512 VectorScale(facenormal, (info->radius - dist), info->nudge);
518 // check which edge or vertex the center is nearest
519 for (i = 0;i < 3;i++)
521 f = DotProduct(info->center, edge[i]);
522 if (f >= DotProduct(vert[0], edge[i])
523 && f <= DotProduct(vert[1], edge[i]))
526 VectorMA(info->center, -f, edge[i], point);
527 dist = sqrt(DotProduct(point, point));
528 if (info->bestdist > dist)
530 info->bestdist = dist;
531 VectorScale(point, (info->radius / dist), info->nudge);
533 // skip both vertex checks
534 // (both are further away than this edge)
539 // not on edge, check first vertex of edge
540 VectorSubtract(info->center, vert[i], point);
541 dist = sqrt(DotProduct(point, point));
542 if (info->bestdist > dist)
544 info->bestdist = dist;
545 VectorScale(point, (info->radius / dist), info->nudge);
554 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
556 int surfacenum, k, *mark;
558 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
560 surface = info->model->data_surfaces + *mark;
561 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
563 if(surface->deprecatedq3num_bboxstride > 0)
566 cnt = (surface->num_triangles + surface->deprecatedq3num_bboxstride - 1) / surface->deprecatedq3num_bboxstride;
567 for(i = 0; i < cnt; ++i)
569 if(BoxesOverlap(surface->deprecatedq3data_bbox6f + i * 6, surface->deprecatedq3data_bbox6f + i * 6 + 3, info->absmin, info->absmax))
571 for(k = 0; k < surface->deprecatedq3num_bboxstride; ++k)
573 tri = i * surface->deprecatedq3num_bboxstride + k;
574 if(tri >= surface->num_triangles)
576 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, tri);
583 for (k = 0;k < surface->num_triangles;k++)
585 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, k);
592 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
596 float f = PlaneDiff(info->center, node->plane);
597 if (f >= -info->bestdist)
598 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
599 if (f <= info->bestdist)
600 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
604 if (((mleaf_t *)node)->numleafsurfaces)
605 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
609 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
612 findnonsolidlocationinfo_t info;
618 VectorCopy(in, info.center);
619 info.radius = radius;
624 VectorClear(info.nudge);
625 info.bestdist = radius;
626 VectorCopy(info.center, info.absmin);
627 VectorCopy(info.center, info.absmax);
628 info.absmin[0] -= info.radius + 1;
629 info.absmin[1] -= info.radius + 1;
630 info.absmin[2] -= info.radius + 1;
631 info.absmax[0] += info.radius + 1;
632 info.absmax[1] += info.radius + 1;
633 info.absmax[2] += info.radius + 1;
634 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
635 VectorAdd(info.center, info.nudge, info.center);
637 while (info.bestdist < radius && ++i < 10);
638 VectorCopy(info.center, out);
641 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
643 switch(nativecontents)
648 return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
650 return SUPERCONTENTS_WATER;
652 return SUPERCONTENTS_SLIME;
654 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
656 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
661 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
663 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
664 return CONTENTS_SOLID;
665 if (supercontents & SUPERCONTENTS_SKY)
667 if (supercontents & SUPERCONTENTS_LAVA)
668 return CONTENTS_LAVA;
669 if (supercontents & SUPERCONTENTS_SLIME)
670 return CONTENTS_SLIME;
671 if (supercontents & SUPERCONTENTS_WATER)
672 return CONTENTS_WATER;
673 return CONTENTS_EMPTY;
676 typedef struct RecursiveHullCheckTraceInfo_s
678 // the hull we're tracing through
681 // the trace structure to fill in
684 // start, end, and end - start (in model space)
689 RecursiveHullCheckTraceInfo_t;
691 // 1/32 epsilon to keep floating point happy
692 #define DIST_EPSILON (0.03125)
694 #define HULLCHECKSTATE_EMPTY 0
695 #define HULLCHECKSTATE_SOLID 1
696 #define HULLCHECKSTATE_DONE 2
698 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
700 // status variables, these don't need to be saved on the stack when
701 // recursing... but are because this should be thread-safe
702 // (note: tracing against a bbox is not thread-safe, yet)
707 // variables that need to be stored on the stack when recursing
712 // keep looping until we hit a leaf
715 // find the point distances
716 node = t->hull->clipnodes + num;
717 plane = t->hull->planes + node->planenum;
719 // axial planes can be calculated more quickly without the DotProduct
722 t1 = p1[plane->type] - plane->dist;
723 t2 = p2[plane->type] - plane->dist;
727 t1 = DotProduct (plane->normal, p1) - plane->dist;
728 t2 = DotProduct (plane->normal, p2) - plane->dist;
731 // negative plane distances indicate children[1] (behind plane)
735 // if the line starts and ends on the same side of the plane, recurse
736 // into that child instantly
737 if (p1side == p2side)
739 #if COLLISIONPARANOID >= 3
745 // loop back and process the start child
746 num = node->children[p1side];
750 // find the midpoint where the line crosses the plane, use the
751 // original line for best accuracy
752 #if COLLISIONPARANOID >= 3
757 t1 = t->start[plane->type] - plane->dist;
758 t2 = t->end[plane->type] - plane->dist;
762 t1 = DotProduct (plane->normal, t->start) - plane->dist;
763 t2 = DotProduct (plane->normal, t->end) - plane->dist;
765 midf = t1 / (t1 - t2);
766 midf = bound(p1f, midf, p2f);
767 VectorMA(t->start, midf, t->dist, mid);
769 // we now have a mid point, essentially splitting the line into
770 // the segments in the near child and the far child, we can now
771 // recurse those in order and get their results
773 // recurse both sides, front side first
774 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[p1side], p1f, midf, p1, mid);
775 // if this side is not empty, return what it is (solid or done)
776 if (ret != HULLCHECKSTATE_EMPTY)
779 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[p2side], midf, p2f, mid, p2);
780 // if other side is not solid, return what it is (empty or done)
781 if (ret != HULLCHECKSTATE_SOLID)
784 // front is air and back is solid, this is the impact point...
786 // copy the plane information, flipping it if needed
789 t->trace->plane.dist = -plane->dist;
790 VectorNegate (plane->normal, t->trace->plane.normal);
794 t->trace->plane.dist = plane->dist;
795 VectorCopy (plane->normal, t->trace->plane.normal);
798 // calculate the return fraction which is nudged off the surface a bit
799 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
800 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
801 midf = (t1 - collision_impactnudge.value) / (t1 - t2);
802 t->trace->fraction = bound(0, midf, 1);
804 #if COLLISIONPARANOID >= 3
807 return HULLCHECKSTATE_DONE;
811 // we reached a leaf contents
814 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
815 if (!t->trace->startfound)
817 t->trace->startfound = true;
818 t->trace->startsupercontents |= num;
820 if (num & SUPERCONTENTS_LIQUIDSMASK)
821 t->trace->inwater = true;
823 t->trace->inopen = true;
824 if (num & SUPERCONTENTS_SOLID)
825 t->trace->hittexture = &mod_q1bsp_texture_solid;
826 else if (num & SUPERCONTENTS_SKY)
827 t->trace->hittexture = &mod_q1bsp_texture_sky;
828 else if (num & SUPERCONTENTS_LAVA)
829 t->trace->hittexture = &mod_q1bsp_texture_lava;
830 else if (num & SUPERCONTENTS_SLIME)
831 t->trace->hittexture = &mod_q1bsp_texture_slime;
833 t->trace->hittexture = &mod_q1bsp_texture_water;
834 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
835 t->trace->hitsupercontents = num;
836 if (num & t->trace->hitsupercontentsmask)
838 // if the first leaf is solid, set startsolid
839 if (t->trace->allsolid)
840 t->trace->startsolid = true;
841 #if COLLISIONPARANOID >= 3
844 return HULLCHECKSTATE_SOLID;
848 t->trace->allsolid = false;
849 #if COLLISIONPARANOID >= 3
852 return HULLCHECKSTATE_EMPTY;
856 //#if COLLISIONPARANOID < 2
857 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
860 mclipnode_t *nodes = t->hull->clipnodes;
861 mplane_t *planes = t->hull->planes;
863 VectorCopy(t->start, point);
866 plane = planes + nodes[num].planenum;
867 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
869 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
870 t->trace->startsupercontents |= num;
871 if (num & SUPERCONTENTS_LIQUIDSMASK)
872 t->trace->inwater = true;
874 t->trace->inopen = true;
875 if (num & t->trace->hitsupercontentsmask)
877 t->trace->allsolid = t->trace->startsolid = true;
878 return HULLCHECKSTATE_SOLID;
882 t->trace->allsolid = t->trace->startsolid = false;
883 return HULLCHECKSTATE_EMPTY;
888 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)
890 RecursiveHullCheckTraceInfo_t rhc;
892 memset(&rhc, 0, sizeof(rhc));
893 memset(trace, 0, sizeof(trace_t));
895 rhc.trace->fraction = 1;
896 rhc.trace->allsolid = true;
897 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
898 VectorCopy(start, rhc.start);
899 VectorCopy(start, rhc.end);
900 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
903 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);
905 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)
907 RecursiveHullCheckTraceInfo_t rhc;
909 if (VectorCompare(start, end))
911 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
915 // sometimes we want to traceline against polygons so we can report the texture that was hit rather than merely a contents, but using this method breaks one of negke's maps so it must be a cvar check...
916 if (sv_gameplayfix_q1bsptracelinereportstexture.integer)
918 Mod_Q1BSP_TraceLineAgainstSurfaces(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
922 memset(&rhc, 0, sizeof(rhc));
923 memset(trace, 0, sizeof(trace_t));
925 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
926 rhc.trace->fraction = 1;
927 rhc.trace->allsolid = true;
928 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
929 VectorCopy(start, rhc.start);
930 VectorCopy(end, rhc.end);
931 VectorSubtract(rhc.end, rhc.start, rhc.dist);
932 #if COLLISIONPARANOID >= 2
933 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]);
934 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
939 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
940 memset(&testtrace, 0, sizeof(trace_t));
941 rhc.trace = &testtrace;
942 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
943 rhc.trace->fraction = 1;
944 rhc.trace->allsolid = true;
945 VectorCopy(test, rhc.start);
946 VectorCopy(test, rhc.end);
947 VectorClear(rhc.dist);
948 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
949 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
950 if (!trace->startsolid && testtrace.startsolid)
951 Con_Printf(" - ended in solid!\n");
955 if (VectorLength2(rhc.dist))
956 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
958 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
962 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)
964 // this function currently only supports same size start and end
966 RecursiveHullCheckTraceInfo_t rhc;
968 if (VectorCompare(boxmins, boxmaxs))
970 if (VectorCompare(start, end))
971 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
973 Mod_Q1BSP_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
977 memset(&rhc, 0, sizeof(rhc));
978 memset(trace, 0, sizeof(trace_t));
980 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
981 rhc.trace->fraction = 1;
982 rhc.trace->allsolid = true;
983 VectorSubtract(boxmaxs, boxmins, boxsize);
985 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
986 else if (model->brush.ishlbsp)
988 // LordHavoc: this has to have a minor tolerance (the .1) because of
989 // minor float precision errors from the box being transformed around
990 if (boxsize[0] < 32.1)
992 if (boxsize[2] < 54) // pick the nearest of 36 or 72
993 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
995 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
998 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
1002 // LordHavoc: this has to have a minor tolerance (the .1) because of
1003 // minor float precision errors from the box being transformed around
1004 if (boxsize[0] < 32.1)
1005 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
1007 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
1009 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
1010 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
1011 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1012 #if COLLISIONPARANOID >= 2
1013 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]);
1014 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1019 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
1020 memset(&testtrace, 0, sizeof(trace_t));
1021 rhc.trace = &testtrace;
1022 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1023 rhc.trace->fraction = 1;
1024 rhc.trace->allsolid = true;
1025 VectorCopy(test, rhc.start);
1026 VectorCopy(test, rhc.end);
1027 VectorClear(rhc.dist);
1028 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1029 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
1030 if (!trace->startsolid && testtrace.startsolid)
1031 Con_Printf(" - ended in solid!\n");
1035 if (VectorLength2(rhc.dist))
1036 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1038 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1042 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
1044 int num = model->brushq1.hulls[0].firstclipnode;
1046 mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
1047 mplane_t *planes = model->brushq1.hulls[0].planes;
1050 plane = planes + nodes[num].planenum;
1051 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
1053 return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
1056 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)
1060 colplanef_t cbox_planes[6];
1062 cbox.hasaabbplanes = true;
1063 cbox.supercontents = boxsupercontents;
1066 cbox.numtriangles = 0;
1067 cbox.planes = cbox_planes;
1069 cbox.elements = NULL;
1077 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];
1078 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];
1079 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];
1080 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];
1081 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];
1082 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];
1083 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1084 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1085 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1086 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1087 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1088 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1089 memset(trace, 0, sizeof(trace_t));
1090 trace->hitsupercontentsmask = hitsupercontentsmask;
1091 trace->fraction = 1;
1092 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1094 RecursiveHullCheckTraceInfo_t rhc;
1095 static hull_t box_hull;
1096 static mclipnode_t box_clipnodes[6];
1097 static mplane_t box_planes[6];
1098 // fill in a default trace
1099 memset(&rhc, 0, sizeof(rhc));
1100 memset(trace, 0, sizeof(trace_t));
1101 //To keep everything totally uniform, bounding boxes are turned into small
1102 //BSP trees instead of being compared directly.
1103 // create a temp hull from bounding box sizes
1104 box_planes[0].dist = cmaxs[0] - mins[0];
1105 box_planes[1].dist = cmins[0] - maxs[0];
1106 box_planes[2].dist = cmaxs[1] - mins[1];
1107 box_planes[3].dist = cmins[1] - maxs[1];
1108 box_planes[4].dist = cmaxs[2] - mins[2];
1109 box_planes[5].dist = cmins[2] - maxs[2];
1110 #if COLLISIONPARANOID >= 3
1111 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]);
1114 if (box_hull.clipnodes == NULL)
1118 //Set up the planes and clipnodes so that the six floats of a bounding box
1119 //can just be stored out and get a proper hull_t structure.
1121 box_hull.clipnodes = box_clipnodes;
1122 box_hull.planes = box_planes;
1123 box_hull.firstclipnode = 0;
1124 box_hull.lastclipnode = 5;
1126 for (i = 0;i < 6;i++)
1128 box_clipnodes[i].planenum = i;
1132 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1134 box_clipnodes[i].children[side^1] = i + 1;
1136 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1138 box_planes[i].type = i>>1;
1139 box_planes[i].normal[i>>1] = 1;
1143 // trace a line through the generated clipping hull
1144 //rhc.boxsupercontents = boxsupercontents;
1145 rhc.hull = &box_hull;
1147 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1148 rhc.trace->fraction = 1;
1149 rhc.trace->allsolid = true;
1150 VectorCopy(start, rhc.start);
1151 VectorCopy(end, rhc.end);
1152 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1153 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1154 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1155 if (rhc.trace->startsupercontents)
1156 rhc.trace->startsupercontents = boxsupercontents;
1160 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)
1162 memset(trace, 0, sizeof(trace_t));
1163 trace->fraction = 1;
1164 if (BoxesOverlap(start, start, cmins, cmaxs))
1166 trace->startsupercontents |= boxsupercontents;
1167 if (hitsupercontentsmask & boxsupercontents)
1169 trace->startsolid = true;
1170 trace->allsolid = true;
1175 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1178 Mod_Q1BSP_TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
1179 return trace.fraction == 1;
1182 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)
1186 float mid, distz = endz - startz;
1190 switch (node->plane->type)
1193 node = node->children[x < node->plane->dist];
1194 continue; // loop back and process the new node
1196 node = node->children[y < node->plane->dist];
1197 continue; // loop back and process the new node
1199 side = startz < node->plane->dist;
1200 if ((endz < node->plane->dist) == side)
1202 node = node->children[side];
1203 continue; // loop back and process the new node
1205 // found an intersection
1206 mid = node->plane->dist;
1209 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1210 front += startz * node->plane->normal[2];
1211 back += endz * node->plane->normal[2];
1212 side = front < node->plane->dist;
1213 if ((back < node->plane->dist) == side)
1215 node = node->children[side];
1216 continue; // loop back and process the new node
1218 // found an intersection
1219 mid = startz + distz * (front - node->plane->dist) / (front - back);
1223 // go down front side
1224 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1225 return true; // hit something
1227 // check for impact on this node
1228 if (node->numsurfaces)
1231 int dsi, dti, lmwidth, lmheight;
1233 msurface_t *surface;
1234 unsigned char *lightmap;
1235 int maps, line3, size3;
1238 float scale, w, w00, w01, w10, w11;
1240 surface = model->data_surfaces + node->firstsurface;
1241 for (i = 0;i < node->numsurfaces;i++, surface++)
1243 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo || !surface->lightmapinfo->samples)
1244 continue; // no lightmaps
1246 // location we want to sample in the lightmap
1247 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;
1248 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;
1251 // thanks to jitspoe for pointing out that this int cast was
1252 // rounding toward zero, so we floor it
1253 dsi = (int)floor(ds);
1254 dti = (int)floor(dt);
1255 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1256 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1259 // we have to tolerate a position of lmwidth-1 for some rare
1260 // cases - in which case the sampling position still gets
1261 // clamped but the color gets interpolated to that edge.
1262 if (dsi >= 0 && dsi < lmwidth && dti >= 0 && dti < lmheight)
1264 // in the rare cases where we're sampling slightly off
1265 // the polygon, clamp the sampling position (we can still
1266 // interpolate outside it, where it becomes extrapolation)
1271 if (dsi > lmwidth-2)
1273 if (dti > lmheight-2)
1276 // calculate bilinear interpolation factors
1277 // and also multiply by fixedpoint conversion factors to
1278 // compensate for lightmaps being 0-255 (as 0-2), we use
1279 // r_refdef.scene.rtlightstylevalue here which is already
1280 // 0.000-2.148 range
1281 // (if we used r_refdef.scene.lightstylevalue this
1282 // divisor would be 32768 rather than 128)
1285 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 128.0f);
1286 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 128.0f);
1287 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 128.0f);
1288 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 128.0f);
1290 // values for pointer math
1291 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1292 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1294 // look up the pixel
1295 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1297 // bilinear filter each lightmap style, and sum them
1298 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1300 scale = r_refdef.scene.rtlightstylevalue[surface->lightmapinfo->styles[maps]];
1301 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1302 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1303 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1304 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1308 return true; // success
1313 // go down back side
1314 node = node->children[side ^ 1];
1316 distz = endz - startz;
1317 // loop back and process the new node
1320 // did not hit anything
1324 static void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1326 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1327 VectorSet(diffusenormal, 0, 0, 1);
1329 if (!model->brushq1.lightdata)
1331 VectorSet(ambientcolor, 1, 1, 1);
1332 VectorSet(diffusecolor, 0, 0, 0);
1336 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);
1339 static const texture_t *Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(RecursiveHullCheckTraceInfo_t *t, const dp_model_t *model, const mnode_t *node, double mid[3])
1344 const msurface_t *surface;
1349 float edgenormal[3];
1356 surface = model->data_surfaces + node->firstsurface;
1357 for (i = 0;i < node->numsurfaces;i++, surface++)
1359 // skip surfaces whose bounding box does not include the point
1360 // if (!BoxesOverlap(mid, mid, surface->mins, surface->maxs))
1362 // skip faces with contents we don't care about
1363 if (!(t->trace->hitsupercontentsmask & surface->texture->supercontents))
1365 // get the surface normal - since it is flat we know any vertex normal will suffice
1366 VectorCopy(model->surfmesh.data_normal3f + 3 * surface->num_firstvertex, normal);
1368 if (DotProduct(t->dist, normal) > 0)
1370 // iterate edges and see if the point is outside one of them
1371 for (j = 0, k = surface->num_vertices - 1;j < surface->num_vertices;k = j, j++)
1373 VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + k), v0);
1374 VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + j), v1);
1375 VectorSubtract(v0, v1, edgedir);
1376 CrossProduct(edgedir, normal, edgenormal);
1377 if (DotProduct(edgenormal, p) > DotProduct(edgenormal, v0))
1380 // if the point is outside one of the edges, it is not within the surface
1381 if (j < surface->num_vertices)
1384 // we hit a surface, this is the impact point...
1385 VectorCopy(normal, t->trace->plane.normal);
1386 t->trace->plane.dist = DotProduct(normal, p);
1388 // calculate the return fraction which is nudged off the surface a bit
1389 t1 = DotProduct(t->start, t->trace->plane.normal) - t->trace->plane.dist;
1390 t2 = DotProduct(t->end, t->trace->plane.normal) - t->trace->plane.dist;
1391 midf = (t1 - collision_impactnudge.value) / (t1 - t2);
1392 t->trace->fraction = bound(0, midf, 1);
1394 t->trace->hittexture = surface->texture->currentframe;
1395 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
1396 t->trace->hitsupercontents = t->trace->hittexture->supercontents;
1397 return surface->texture->currentframe;
1402 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])
1404 const mplane_t *plane;
1407 double midf, mid[3];
1408 const mleaf_t *leaf;
1412 plane = node->plane;
1413 if (plane->type < 3)
1415 t1 = p1[plane->type] - plane->dist;
1416 t2 = p2[plane->type] - plane->dist;
1420 t1 = DotProduct (plane->normal, p1) - plane->dist;
1421 t2 = DotProduct (plane->normal, p2) - plane->dist;
1427 node = node->children[1];
1436 node = node->children[0];
1442 // the line intersects, find intersection point
1443 // LordHavoc: this uses the original trace for maximum accuracy
1444 if (plane->type < 3)
1446 t1 = t->start[plane->type] - plane->dist;
1447 t2 = t->end[plane->type] - plane->dist;
1451 t1 = DotProduct (plane->normal, t->start) - plane->dist;
1452 t2 = DotProduct (plane->normal, t->end) - plane->dist;
1455 midf = t1 / (t1 - t2);
1456 VectorMA(t->start, midf, t->dist, mid);
1458 // recurse both sides, front side first, return if we hit a surface
1459 if (Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side], p1, mid) == HULLCHECKSTATE_DONE)
1460 return HULLCHECKSTATE_DONE;
1462 // test each surface on the node
1463 Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(t, model, node, mid);
1464 if (t->trace->hittexture)
1465 return HULLCHECKSTATE_DONE;
1467 // recurse back side
1468 return Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side ^ 1], mid, p2);
1470 leaf = (const mleaf_t *)node;
1471 side = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, leaf->contents);
1472 if (!t->trace->startfound)
1474 t->trace->startfound = true;
1475 t->trace->startsupercontents |= side;
1477 if (side & SUPERCONTENTS_LIQUIDSMASK)
1478 t->trace->inwater = true;
1480 t->trace->inopen = true;
1481 if (side & t->trace->hitsupercontentsmask)
1483 // if the first leaf is solid, set startsolid
1484 if (t->trace->allsolid)
1485 t->trace->startsolid = true;
1486 return HULLCHECKSTATE_SOLID;
1490 t->trace->allsolid = false;
1491 return HULLCHECKSTATE_EMPTY;
1495 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)
1497 RecursiveHullCheckTraceInfo_t rhc;
1499 memset(&rhc, 0, sizeof(rhc));
1500 memset(trace, 0, sizeof(trace_t));
1502 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1503 rhc.trace->fraction = 1;
1504 rhc.trace->allsolid = true;
1505 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
1506 VectorCopy(start, rhc.start);
1507 VectorCopy(end, rhc.end);
1508 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1509 Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(&rhc, model, model->brush.data_nodes + rhc.hull->firstclipnode, rhc.start, rhc.end);
1510 VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1513 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1516 unsigned char *outstart = out;
1517 while (out < outend)
1521 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));
1531 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));
1534 for (c = *in++;c > 0;c--)
1538 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));
1549 R_Q1BSP_LoadSplitSky
1551 A sky texture is 256*128, with the right side being a masked overlay
1554 static void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1559 unsigned int *solidpixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1560 unsigned int *alphapixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1562 // allocate a texture pool if we need it
1563 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1564 loadmodel->texturepool = R_AllocTexturePool();
1566 if (bytesperpixel == 4)
1568 for (y = 0;y < h;y++)
1570 for (x = 0;x < w;x++)
1572 solidpixels[y*w+x] = ((unsigned *)src)[y*width+x+w];
1573 alphapixels[y*w+x] = ((unsigned *)src)[y*width+x];
1579 // make an average value for the back to avoid
1580 // a fringe on the top level
1589 for (y = 0;y < h;y++)
1591 for (x = 0;x < w;x++)
1593 p = src[x*width+y+w];
1594 r += palette_rgb[p][0];
1595 g += palette_rgb[p][1];
1596 b += palette_rgb[p][2];
1599 bgra.b[2] = r/(w*h);
1600 bgra.b[1] = g/(w*h);
1601 bgra.b[0] = b/(w*h);
1603 for (y = 0;y < h;y++)
1605 for (x = 0;x < w;x++)
1607 solidpixels[y*w+x] = palette_bgra_complete[src[y*width+x+w]];
1609 alphapixels[y*w+x] = p ? palette_bgra_complete[p] : bgra.i;
1614 loadmodel->brush.solidskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_solidtexture", 0 , (unsigned char *) solidpixels, w, h, vid.sRGB3D);
1615 loadmodel->brush.alphaskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_alphatexture", TEXF_ALPHA, (unsigned char *) alphapixels, w, h, vid.sRGB3D);
1616 Mem_Free(solidpixels);
1617 Mem_Free(alphapixels);
1620 static void Mod_Q1BSP_LoadTextures(sizebuf_t *sb)
1622 int i, j, k, num, max, altmax, mtwidth, mtheight, doffset, incomplete, nummiptex = 0;
1623 skinframe_t *skinframe;
1624 texture_t *tx, *tx2, *anims[10], *altanims[10];
1625 texture_t backuptex;
1626 unsigned char *data, *mtdata;
1628 char mapname[MAX_QPATH], name[MAX_QPATH];
1629 unsigned char zeroopaque[4], zerotrans[4];
1632 Vector4Set(zeroopaque, 0, 0, 0, 255);
1633 Vector4Set(zerotrans, 0, 0, 0, 128);
1635 loadmodel->data_textures = NULL;
1637 // add two slots for notexture walls and notexture liquids
1640 nummiptex = MSG_ReadLittleLong(sb);
1641 loadmodel->num_textures = nummiptex + 2;
1642 loadmodel->num_texturesperskin = loadmodel->num_textures;
1646 loadmodel->num_textures = 2;
1647 loadmodel->num_texturesperskin = loadmodel->num_textures;
1650 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1652 // fill out all slots with notexture
1653 if (cls.state != ca_dedicated)
1654 skinframe = R_SkinFrame_LoadMissing();
1657 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1659 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1662 tx->basealpha = 1.0f;
1663 if (cls.state != ca_dedicated)
1665 tx->numskinframes = 1;
1666 tx->skinframerate = 1;
1667 tx->skinframes[0] = skinframe;
1668 tx->currentskinframe = tx->skinframes[0];
1670 tx->basematerialflags = MATERIALFLAG_WALL;
1671 if (i == loadmodel->num_textures - 1)
1673 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1674 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1675 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1679 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1680 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1682 tx->currentframe = tx;
1684 // clear water settings
1687 tx->refractfactor = 1;
1688 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1689 tx->reflectfactor = 1;
1690 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1691 tx->r_water_wateralpha = 1;
1692 tx->offsetmapping = OFFSETMAPPING_DEFAULT;
1693 tx->offsetscale = 1;
1695 tx->specularscalemod = 1;
1696 tx->specularpowermod = 1;
1697 tx->transparentsort = TRANSPARENTSORT_DISTANCE;
1698 // WHEN ADDING DEFAULTS HERE, REMEMBER TO PUT DEFAULTS IN ALL LOADERS
1699 // JUST GREP FOR "specularscalemod = 1".
1704 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1708 s = loadmodel->name;
1709 if (!strncasecmp(s, "maps/", 5))
1711 FS_StripExtension(s, mapname, sizeof(mapname));
1713 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1714 // LordHavoc: mostly rewritten map texture loader
1715 for (i = 0;i < nummiptex;i++)
1717 doffset = MSG_ReadLittleLong(sb);
1718 if (r_nosurftextures.integer)
1722 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1726 MSG_InitReadBuffer(&miptexsb, sb->data + doffset, sb->cursize - doffset);
1728 // copy name, but only up to 16 characters
1729 // (the output buffer can hold more than this, but the input buffer is
1731 for (j = 0;j < 16;j++)
1732 name[j] = MSG_ReadByte(&miptexsb);
1734 // pretty up the buffer (replacing any trailing garbage with 0)
1735 for (j = (int)strlen(name);j < 16;j++)
1740 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1741 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1744 mtwidth = MSG_ReadLittleLong(&miptexsb);
1745 mtheight = MSG_ReadLittleLong(&miptexsb);
1747 j = MSG_ReadLittleLong(&miptexsb);
1751 if (j < 40 || j + mtwidth * mtheight > miptexsb.cursize)
1753 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, name);
1756 mtdata = miptexsb.data + j;
1759 if ((mtwidth & 15) || (mtheight & 15))
1760 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, name);
1762 // LordHavoc: force all names to lowercase
1763 for (j = 0;name[j];j++)
1764 if (name[j] >= 'A' && name[j] <= 'Z')
1765 name[j] += 'a' - 'A';
1767 // LordHavoc: backup the texture_t because q3 shader loading overwrites it
1768 backuptex = loadmodel->data_textures[i];
1769 if (name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1771 loadmodel->data_textures[i] = backuptex;
1773 tx = loadmodel->data_textures + i;
1774 strlcpy(tx->name, name, sizeof(tx->name));
1775 tx->width = mtwidth;
1776 tx->height = mtheight;
1777 tx->basealpha = 1.0f;
1779 if (tx->name[0] == '*')
1781 if (!strncmp(tx->name, "*lava", 5))
1783 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1784 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1786 else if (!strncmp(tx->name, "*slime", 6))
1788 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1789 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1793 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1794 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1797 else if (!strncmp(tx->name, "sky", 3))
1799 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1800 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1801 // for the surface traceline we need to hit this surface as a solid...
1802 tx->supercontents |= SUPERCONTENTS_SOLID;
1806 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1807 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1810 if (cls.state != ca_dedicated)
1812 // LordHavoc: HL sky textures are entirely different than quake
1813 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == mtheight * 2)
1815 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va(vabuf, sizeof(vabuf), "textures/%s/%s", mapname, tx->name), false, false, false, NULL);
1817 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va(vabuf, sizeof(vabuf), "textures/%s", tx->name), false, false, false, NULL);
1818 if (data && image_width == image_height * 2)
1820 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1823 else if (mtdata != NULL)
1824 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1828 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va(vabuf, sizeof(vabuf), "textures/%s/%s", mapname, tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, false);
1830 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va(vabuf, sizeof(vabuf), "textures/%s", tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, false);
1832 tx->offsetmapping = OFFSETMAPPING_DEFAULT; // allow offsetmapping on external textures without a q3 shader
1835 // did not find external texture, load it from the bsp or wad3
1836 if (loadmodel->brush.ishlbsp)
1838 // internal texture overrides wad
1839 unsigned char *pixels, *freepixels;
1840 pixels = freepixels = NULL;
1842 pixels = W_ConvertWAD3TextureBGRA(&miptexsb);
1844 pixels = freepixels = W_GetTextureBGRA(tx->name);
1847 tx->width = image_width;
1848 tx->height = image_height;
1849 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, pixels, image_width, image_height, true);
1852 Mem_Free(freepixels);
1854 else if (mtdata) // texture included
1855 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1857 // if skinframe is still NULL the "missing" texture will be used
1859 tx->skinframes[0] = skinframe;
1861 // LordHavoc: some Tenebrae textures get replaced by black
1862 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1863 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA, zerotrans, 1, 1, false);
1864 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1865 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, 0, zeroopaque, 1, 1, false);
1868 tx->basematerialflags = MATERIALFLAG_WALL;
1869 if (tx->name[0] == '*')
1871 // LordHavoc: some turbulent textures should not be affected by wateralpha
1872 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1873 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1874 else if (!strncmp(tx->name,"*lava",5)
1875 || !strncmp(tx->name,"*teleport",9)
1876 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1877 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1879 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1880 if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1881 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1883 else if (tx->name[0] == '{') // fence textures
1885 tx->basematerialflags |= MATERIALFLAG_ALPHATEST | MATERIALFLAG_NOSHADOW;
1887 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1889 // replace the texture with black
1890 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1892 else if (!strncmp(tx->name, "sky", 3))
1893 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1894 else if (!strcmp(tx->name, "caulk"))
1895 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1896 else if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1897 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1899 // start out with no animation
1900 tx->currentframe = tx;
1901 tx->currentskinframe = tx->skinframes[0];
1902 tx->currentmaterialflags = tx->basematerialflags;
1905 // sequence the animations
1906 for (i = 0;i < nummiptex;i++)
1908 tx = loadmodel->data_textures + i;
1909 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1912 if ((num < '0' || num > '9') && (num < 'a' || num > 'j'))
1914 Con_Printf("Bad animating texture %s\n", tx->name);
1917 if (tx->anim_total[0] || tx->anim_total[1])
1918 continue; // already sequenced
1920 // find the number of frames in the animation
1921 memset(anims, 0, sizeof(anims));
1922 memset(altanims, 0, sizeof(altanims));
1924 for (j = i;j < nummiptex;j++)
1926 tx2 = loadmodel->data_textures + j;
1927 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1931 if (num >= '0' && num <= '9')
1932 anims[num - '0'] = tx2;
1933 else if (num >= 'a' && num <= 'j')
1934 altanims[num - 'a'] = tx2;
1935 // No need to warn otherwise - we already did above.
1939 for (j = 0;j < 10;j++)
1946 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1949 for (j = 0;j < max;j++)
1953 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1957 for (j = 0;j < altmax;j++)
1961 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1968 // If we have exactly one frame, something's wrong.
1969 if (max + altmax <= 1)
1971 Con_Printf("Texture %s is animated (leading +) but has only one frame\n", tx->name);
1976 // if there is no alternate animation, duplicate the primary
1977 // animation into the alternate
1979 for (k = 0;k < 10;k++)
1980 altanims[k] = anims[k];
1986 Con_Printf("Missing frame 0 of %s\n", tx->name);
1988 // however, we can handle this by duplicating the alternate animation into the primary
1990 for (k = 0;k < 10;k++)
1991 anims[k] = altanims[k];
1995 // link together the primary animation
1996 for (j = 0;j < max;j++)
1999 tx2->animated = 1; // q1bsp
2000 tx2->anim_total[0] = max;
2001 tx2->anim_total[1] = altmax;
2002 for (k = 0;k < 10;k++)
2004 tx2->anim_frames[0][k] = anims[k];
2005 tx2->anim_frames[1][k] = altanims[k];
2009 // if there really is an alternate anim...
2010 if (anims[0] != altanims[0])
2012 // link together the alternate animation
2013 for (j = 0;j < altmax;j++)
2016 tx2->animated = 1; // q1bsp
2017 // the primary/alternate are reversed here
2018 tx2->anim_total[0] = altmax;
2019 tx2->anim_total[1] = max;
2020 for (k = 0;k < 10;k++)
2022 tx2->anim_frames[0][k] = altanims[k];
2023 tx2->anim_frames[1][k] = anims[k];
2030 static void Mod_Q1BSP_LoadLighting(sizebuf_t *sb)
2033 unsigned char *in, *out, *data, d;
2034 char litfilename[MAX_QPATH];
2035 char dlitfilename[MAX_QPATH];
2036 fs_offset_t filesize;
2037 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
2039 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, sb->cursize);
2040 for (i = 0;i < sb->cursize;i++)
2041 loadmodel->brushq1.lightdata[i] = sb->data[i] >>= 1;
2043 else // LordHavoc: bsp version 29 (normal white lighting)
2045 // LordHavoc: hope is not lost yet, check for a .lit file to load
2046 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
2047 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
2048 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
2049 strlcat (litfilename, ".lit", sizeof (litfilename));
2050 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
2051 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
2054 if (filesize == (fs_offset_t)(8 + sb->cursize * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
2056 i = LittleLong(((int *)data)[1]);
2059 if (developer_loading.integer)
2060 Con_Printf("loaded %s\n", litfilename);
2061 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
2062 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
2064 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
2067 if (filesize == (fs_offset_t)(8 + sb->cursize * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
2069 i = LittleLong(((int *)data)[1]);
2072 if (developer_loading.integer)
2073 Con_Printf("loaded %s\n", dlitfilename);
2074 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
2075 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
2076 loadmodel->brushq3.deluxemapping_modelspace = false;
2077 loadmodel->brushq3.deluxemapping = true;
2086 Con_Printf("Unknown .lit file version (%d)\n", i);
2088 else if (filesize == 8)
2089 Con_Print("Empty .lit file, ignoring\n");
2091 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + sb->cursize * 3));
2098 // LordHavoc: oh well, expand the white lighting data
2101 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, sb->cursize*3);
2103 out = loadmodel->brushq1.lightdata;
2104 for (i = 0;i < sb->cursize;i++)
2114 static void Mod_Q1BSP_LoadVisibility(sizebuf_t *sb)
2116 loadmodel->brushq1.num_compressedpvs = 0;
2117 loadmodel->brushq1.data_compressedpvs = NULL;
2120 loadmodel->brushq1.num_compressedpvs = sb->cursize;
2121 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, sb->cursize);
2122 MSG_ReadBytes(sb, sb->cursize, loadmodel->brushq1.data_compressedpvs);
2125 // used only for HalfLife maps
2126 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
2128 char key[128], value[4096];
2132 if (!COM_ParseToken_Simple(&data, false, false, true))
2134 if (com_token[0] != '{')
2138 if (!COM_ParseToken_Simple(&data, false, false, true))
2140 if (com_token[0] == '}')
2141 break; // end of worldspawn
2142 if (com_token[0] == '_')
2143 strlcpy(key, com_token + 1, sizeof(key));
2145 strlcpy(key, com_token, sizeof(key));
2146 while (key[strlen(key)-1] == ' ') // remove trailing spaces
2147 key[strlen(key)-1] = 0;
2148 if (!COM_ParseToken_Simple(&data, false, false, true))
2150 dpsnprintf(value, sizeof(value), "%s", com_token);
2151 if (!strcmp("wad", key)) // for HalfLife maps
2153 if (loadmodel->brush.ishlbsp)
2156 for (i = 0;i < (int)sizeof(value);i++)
2157 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
2159 if (i < (int)sizeof(value) && value[i])
2161 for (;i < (int)sizeof(value);i++)
2163 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
2164 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
2166 else if (value[i] == ';' || value[i] == 0)
2170 W_LoadTextureWadFile(&value[j], false);
2182 static void Mod_Q1BSP_LoadEntities(sizebuf_t *sb)
2184 loadmodel->brush.entities = NULL;
2187 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, sb->cursize + 1);
2188 MSG_ReadBytes(sb, sb->cursize, (unsigned char *)loadmodel->brush.entities);
2189 loadmodel->brush.entities[sb->cursize] = 0;
2190 if (loadmodel->brush.ishlbsp)
2191 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
2195 static void Mod_Q1BSP_LoadVertexes(sizebuf_t *sb)
2199 int structsize = 12;
2201 if (sb->cursize % structsize)
2202 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
2203 count = sb->cursize / structsize;
2204 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2206 loadmodel->brushq1.vertexes = out;
2207 loadmodel->brushq1.numvertexes = count;
2209 for ( i=0 ; i<count ; i++, out++)
2211 out->position[0] = MSG_ReadLittleFloat(sb);
2212 out->position[1] = MSG_ReadLittleFloat(sb);
2213 out->position[2] = MSG_ReadLittleFloat(sb);
2217 static void Mod_Q1BSP_LoadSubmodels(sizebuf_t *sb, hullinfo_t *hullinfo)
2221 int structsize = (48+4*hullinfo->filehulls);
2223 if (sb->cursize % structsize)
2224 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
2226 count = sb->cursize / structsize;
2227 out = (mmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
2229 loadmodel->brushq1.submodels = out;
2230 loadmodel->brush.numsubmodels = count;
2232 for (i = 0; i < count; i++, out++)
2234 // spread out the mins / maxs by a pixel
2235 out->mins[0] = MSG_ReadLittleFloat(sb) - 1;
2236 out->mins[1] = MSG_ReadLittleFloat(sb) - 1;
2237 out->mins[2] = MSG_ReadLittleFloat(sb) - 1;
2238 out->maxs[0] = MSG_ReadLittleFloat(sb) + 1;
2239 out->maxs[1] = MSG_ReadLittleFloat(sb) + 1;
2240 out->maxs[2] = MSG_ReadLittleFloat(sb) + 1;
2241 out->origin[0] = MSG_ReadLittleFloat(sb);
2242 out->origin[1] = MSG_ReadLittleFloat(sb);
2243 out->origin[2] = MSG_ReadLittleFloat(sb);
2244 for (j = 0; j < hullinfo->filehulls; j++)
2245 out->headnode[j] = MSG_ReadLittleLong(sb);
2246 out->visleafs = MSG_ReadLittleLong(sb);
2247 out->firstface = MSG_ReadLittleLong(sb);
2248 out->numfaces = MSG_ReadLittleLong(sb);
2252 static void Mod_Q1BSP_LoadEdges(sizebuf_t *sb)
2256 int structsize = loadmodel->brush.isbsp2 ? 8 : 4;
2258 if (sb->cursize % structsize)
2259 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2260 count = sb->cursize / structsize;
2261 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2263 loadmodel->brushq1.edges = out;
2264 loadmodel->brushq1.numedges = count;
2266 for ( i=0 ; i<count ; i++, out++)
2268 if (loadmodel->brush.isbsp2)
2270 out->v[0] = (unsigned int)MSG_ReadLittleLong(sb);
2271 out->v[1] = (unsigned int)MSG_ReadLittleLong(sb);
2275 out->v[0] = (unsigned short)MSG_ReadLittleShort(sb);
2276 out->v[1] = (unsigned short)MSG_ReadLittleShort(sb);
2278 if ((int)out->v[0] >= loadmodel->brushq1.numvertexes || (int)out->v[1] >= loadmodel->brushq1.numvertexes)
2280 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);
2281 if(!loadmodel->brushq1.numvertexes)
2282 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2290 static void Mod_Q1BSP_LoadTexinfo(sizebuf_t *sb)
2293 int i, j, k, count, miptex;
2294 int structsize = 40;
2296 if (sb->cursize % structsize)
2297 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2298 count = sb->cursize / structsize;
2299 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2301 loadmodel->brushq1.texinfo = out;
2302 loadmodel->brushq1.numtexinfo = count;
2304 for (i = 0;i < count;i++, out++)
2306 for (k = 0;k < 2;k++)
2307 for (j = 0;j < 4;j++)
2308 out->vecs[k][j] = MSG_ReadLittleFloat(sb);
2310 miptex = MSG_ReadLittleLong(sb);
2311 out->q1flags = MSG_ReadLittleLong(sb);
2313 if (out->q1flags & TEX_SPECIAL)
2315 // if texture chosen is NULL or the shader needs a lightmap,
2316 // force to notexture water shader
2317 out->textureindex = loadmodel->num_textures - 1;
2321 // if texture chosen is NULL, force to notexture
2322 out->textureindex = loadmodel->num_textures - 2;
2324 // see if the specified miptex is valid and try to use it instead
2325 if (loadmodel->data_textures)
2327 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2328 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2330 out->textureindex = miptex;
2336 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2341 mins[0] = mins[1] = mins[2] = 9999;
2342 maxs[0] = maxs[1] = maxs[2] = -9999;
2344 for (i = 0;i < numverts;i++)
2346 for (j = 0;j < 3;j++, v++)
2356 #define MAX_SUBDIVPOLYTRIANGLES 4096
2357 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2359 static int subdivpolyverts, subdivpolytriangles;
2360 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2361 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2363 static int subdivpolylookupvert(vec3_t v)
2366 for (i = 0;i < subdivpolyverts;i++)
2367 if (subdivpolyvert[i][0] == v[0]
2368 && subdivpolyvert[i][1] == v[1]
2369 && subdivpolyvert[i][2] == v[2])
2371 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2372 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2373 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2374 return subdivpolyverts++;
2377 static void SubdividePolygon(int numverts, float *verts)
2379 int i, i1, i2, i3, f, b, c, p;
2380 vec3_t mins, maxs, front[256], back[256];
2381 float m, *pv, *cv, dist[256], frac;
2384 Host_Error("SubdividePolygon: ran out of verts in buffer");
2386 BoundPoly(numverts, verts, mins, maxs);
2388 for (i = 0;i < 3;i++)
2390 m = (mins[i] + maxs[i]) * 0.5;
2391 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2392 if (maxs[i] - m < 8)
2394 if (m - mins[i] < 8)
2398 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2399 dist[c] = cv[i] - m;
2402 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2406 VectorCopy(pv, front[f]);
2411 VectorCopy(pv, back[b]);
2414 if (dist[p] == 0 || dist[c] == 0)
2416 if ((dist[p] > 0) != (dist[c] > 0) )
2419 frac = dist[p] / (dist[p] - dist[c]);
2420 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2421 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2422 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2428 SubdividePolygon(f, front[0]);
2429 SubdividePolygon(b, back[0]);
2433 i1 = subdivpolylookupvert(verts);
2434 i2 = subdivpolylookupvert(verts + 3);
2435 for (i = 2;i < numverts;i++)
2437 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2439 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2443 i3 = subdivpolylookupvert(verts + i * 3);
2444 subdivpolyindex[subdivpolytriangles][0] = i1;
2445 subdivpolyindex[subdivpolytriangles][1] = i2;
2446 subdivpolyindex[subdivpolytriangles][2] = i3;
2448 subdivpolytriangles++;
2452 //Breaks a polygon up along axial 64 unit
2453 //boundaries so that turbulent and sky warps
2454 //can be done reasonably.
2455 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2461 subdivpolytriangles = 0;
2462 subdivpolyverts = 0;
2463 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2464 if (subdivpolytriangles < 1)
2465 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2467 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2468 mesh->num_vertices = subdivpolyverts;
2469 mesh->num_triangles = subdivpolytriangles;
2470 mesh->vertex = (surfvertex_t *)(mesh + 1);
2471 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2472 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2474 for (i = 0;i < mesh->num_triangles;i++)
2475 for (j = 0;j < 3;j++)
2476 mesh->index[i*3+j] = subdivpolyindex[i][j];
2478 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2480 VectorCopy(subdivpolyvert[i], v->v);
2481 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2482 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2487 extern cvar_t gl_max_lightmapsize;
2488 static void Mod_Q1BSP_LoadFaces(sizebuf_t *sb)
2490 msurface_t *surface;
2491 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples, lightmapoffset, texinfoindex;
2492 float texmins[2], texmaxs[2], val;
2493 rtexture_t *lightmaptexture, *deluxemaptexture;
2495 int structsize = loadmodel->brush.isbsp2 ? 28 : 20;
2497 if (sb->cursize % structsize)
2498 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2499 count = sb->cursize / structsize;
2500 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2501 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2503 loadmodel->num_surfaces = count;
2505 loadmodel->brushq1.firstrender = true;
2506 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2510 for (surfacenum = 0;surfacenum < count;surfacenum++)
2512 if (loadmodel->brush.isbsp2)
2513 numedges = BuffLittleLong(sb->data + structsize * surfacenum + 12);
2515 numedges = BuffLittleShort(sb->data + structsize * surfacenum + 8);
2516 totalverts += numedges;
2517 totaltris += numedges - 2;
2520 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2522 lightmaptexture = NULL;
2523 deluxemaptexture = r_texture_blanknormalmap;
2525 lightmapsize = bound(256, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d);
2526 totallightmapsamples = 0;
2530 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2532 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2533 // the struct on disk is the same in BSP29 (Q1), BSP30 (HL1), and IBSP38 (Q2)
2534 planenum = loadmodel->brush.isbsp2 ? MSG_ReadLittleLong(sb) : (unsigned short)MSG_ReadLittleShort(sb);
2535 /*side = */loadmodel->brush.isbsp2 ? MSG_ReadLittleLong(sb) : (unsigned short)MSG_ReadLittleShort(sb);
2536 firstedge = MSG_ReadLittleLong(sb);
2537 numedges = loadmodel->brush.isbsp2 ? MSG_ReadLittleLong(sb) : (unsigned short)MSG_ReadLittleShort(sb);
2538 texinfoindex = loadmodel->brush.isbsp2 ? MSG_ReadLittleLong(sb) : (unsigned short)MSG_ReadLittleShort(sb);
2539 for (i = 0;i < MAXLIGHTMAPS;i++)
2540 surface->lightmapinfo->styles[i] = MSG_ReadByte(sb);
2541 lightmapoffset = MSG_ReadLittleLong(sb);
2543 // FIXME: validate edges, texinfo, etc?
2544 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)
2545 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2546 if ((unsigned int) texinfoindex >= (unsigned int) loadmodel->brushq1.numtexinfo)
2547 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", texinfoindex, loadmodel->brushq1.numtexinfo);
2548 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2549 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2551 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + texinfoindex;
2552 surface->texture = loadmodel->data_textures + surface->lightmapinfo->texinfo->textureindex;
2554 // Q2BSP doesn't use lightmaps on sky or warped surfaces (water), but still has a lightofs of 0
2555 if (lightmapoffset == 0 && (surface->texture->q2flags & (Q2SURF_SKY | Q2SURF_WARP)))
2556 lightmapoffset = -1;
2558 //surface->flags = surface->texture->flags;
2559 //if (LittleShort(in->side))
2560 // surface->flags |= SURF_PLANEBACK;
2561 //surface->plane = loadmodel->brush.data_planes + planenum;
2563 surface->num_firstvertex = totalverts;
2564 surface->num_vertices = numedges;
2565 surface->num_firsttriangle = totaltris;
2566 surface->num_triangles = numedges - 2;
2567 totalverts += numedges;
2568 totaltris += numedges - 2;
2570 // convert edges back to a normal polygon
2571 for (i = 0;i < surface->num_vertices;i++)
2573 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2575 // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2577 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2579 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2580 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2581 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2582 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2583 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2584 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2585 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2586 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2589 for (i = 0;i < surface->num_triangles;i++)
2591 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2592 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2593 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2596 // compile additional data about the surface geometry
2597 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);
2598 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);
2599 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2601 // generate surface extents information
2602 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2603 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2604 for (i = 1;i < surface->num_vertices;i++)
2606 for (j = 0;j < 2;j++)
2608 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2609 texmins[j] = min(texmins[j], val);
2610 texmaxs[j] = max(texmaxs[j], val);
2613 for (i = 0;i < 2;i++)
2615 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2616 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2619 smax = surface->lightmapinfo->extents[0] >> 4;
2620 tmax = surface->lightmapinfo->extents[1] >> 4;
2621 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2622 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2625 surface->lightmaptexture = NULL;
2626 surface->deluxemaptexture = r_texture_blanknormalmap;
2627 if (lightmapoffset == -1)
2629 surface->lightmapinfo->samples = NULL;
2631 // give non-lightmapped water a 1x white lightmap
2632 if (!loadmodel->brush.isq2bsp && surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->q1flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2634 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2635 surface->lightmapinfo->styles[0] = 0;
2636 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2640 else if (loadmodel->brush.ishlbsp || loadmodel->brush.isq2bsp) // LordHavoc: HalfLife map (bsp version 30)
2641 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + lightmapoffset;
2642 else // LordHavoc: white lighting (bsp version 29)
2644 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (lightmapoffset * 3);
2645 if (loadmodel->brushq1.nmaplightdata)
2646 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (lightmapoffset * 3);
2649 // check if we should apply a lightmap to this
2650 if (!(surface->lightmapinfo->texinfo->q1flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2652 if (ssize > 256 || tsize > 256)
2653 Host_Error("Bad surface extents");
2655 if (lightmapsize < ssize)
2656 lightmapsize = ssize;
2657 if (lightmapsize < tsize)
2658 lightmapsize = tsize;
2660 totallightmapsamples += ssize*tsize;
2662 // force lightmap upload on first time seeing the surface
2664 // additionally this is used by the later code to see if a
2665 // lightmap is needed on this surface (rather than duplicating the
2667 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2668 loadmodel->lit = true;
2672 // small maps (such as ammo boxes especially) don't need big lightmap
2673 // textures, so this code tries to guess a good size based on
2674 // totallightmapsamples (size of the lightmaps lump basically), as well as
2675 // trying to max out the size if there is a lot of lightmap data to store
2676 // additionally, never choose a lightmapsize that is smaller than the
2677 // largest surface encountered (as it would fail)
2679 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < bound(128, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d)) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2682 // now that we've decided the lightmap texture size, we can do the rest
2683 if (cls.state != ca_dedicated)
2685 int stainmapsize = 0;
2686 mod_alloclightmap_state_t allocState;
2688 Mod_AllocLightmap_Init(&allocState, lightmapsize, lightmapsize);
2689 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2691 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2692 float u, v, ubase, vbase, uscale, vscale;
2694 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2697 smax = surface->lightmapinfo->extents[0] >> 4;
2698 tmax = surface->lightmapinfo->extents[1] >> 4;
2699 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2700 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2701 stainmapsize += ssize * tsize * 3;
2703 if (!lightmaptexture || !Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy))
2705 // allocate a texture pool if we need it
2706 if (loadmodel->texturepool == NULL)
2707 loadmodel->texturepool = R_AllocTexturePool();
2708 // could not find room, make a new lightmap
2709 loadmodel->brushq3.num_mergedlightmaps = lightmapnumber + 1;
2710 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_lightmaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_lightmaps[0]));
2711 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_deluxemaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_deluxemaps[0]));
2712 loadmodel->brushq3.data_lightmaps[lightmapnumber] = lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va(vabuf, sizeof(vabuf), "lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_ALLOWUPDATES, -1, NULL);
2713 if (loadmodel->brushq1.nmaplightdata)
2714 loadmodel->brushq3.data_deluxemaps[lightmapnumber] = deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va(vabuf, sizeof(vabuf), "deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_ALLOWUPDATES, -1, NULL);
2716 Mod_AllocLightmap_Reset(&allocState);
2717 Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy);
2719 surface->lightmaptexture = lightmaptexture;
2720 surface->deluxemaptexture = deluxemaptexture;
2721 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2722 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2724 uscale = 1.0f / (float)lightmapsize;
2725 vscale = 1.0f / (float)lightmapsize;
2726 ubase = lightmapx * uscale;
2727 vbase = lightmapy * vscale;
2729 for (i = 0;i < surface->num_vertices;i++)
2731 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);
2732 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);
2733 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2734 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2735 // LordHavoc: calc lightmap data offset for vertex lighting to use
2738 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2742 if (cl_stainmaps.integer)
2744 // allocate stainmaps for permanent marks on walls and clear white
2745 unsigned char *stainsamples = NULL;
2746 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2747 memset(stainsamples, 255, stainmapsize);
2749 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2751 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2753 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2754 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2755 surface->lightmapinfo->stainsamples = stainsamples;
2756 stainsamples += ssize * tsize * 3;
2761 // generate ushort elements array if possible
2762 if (loadmodel->surfmesh.data_element3s)
2763 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2764 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2767 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2770 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2771 node->parent = parent;
2774 // this is a node, recurse to children
2775 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2776 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2777 // combine supercontents of children
2778 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2783 mleaf_t *leaf = (mleaf_t *)node;
2784 // if this is a leaf, calculate supercontents mask from all collidable
2785 // primitives in the leaf (brushes and collision surfaces)
2786 // also flag if the leaf contains any collision surfaces
2787 leaf->combinedsupercontents = 0;
2788 // combine the supercontents values of all brushes in this leaf
2789 for (j = 0;j < leaf->numleafbrushes;j++)
2790 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2791 // check if this leaf contains any collision surfaces (q3 patches)
2792 for (j = 0;j < leaf->numleafsurfaces;j++)
2794 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2795 if (surface->num_collisiontriangles)
2797 leaf->containscollisionsurfaces = true;
2798 leaf->combinedsupercontents |= surface->texture->supercontents;
2804 static void Mod_Q1BSP_LoadNodes(sizebuf_t *sb)
2806 int i, j, count, p, child[2];
2808 int structsize = loadmodel->brush.isbsp2rmqe ? 32 : (loadmodel->brush.isbsp2 ? 44 : 24);
2810 if (sb->cursize % structsize)
2811 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2812 count = sb->cursize / structsize;
2814 Host_Error("Mod_Q1BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
2815 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2817 loadmodel->brush.data_nodes = out;
2818 loadmodel->brush.num_nodes = count;
2820 for ( i=0 ; i<count ; i++, out++)
2822 p = MSG_ReadLittleLong(sb);
2823 out->plane = loadmodel->brush.data_planes + p;
2825 if (loadmodel->brush.isbsp2rmqe)
2827 child[0] = MSG_ReadLittleLong(sb);
2828 child[1] = MSG_ReadLittleLong(sb);
2829 out->mins[0] = MSG_ReadLittleShort(sb);
2830 out->mins[1] = MSG_ReadLittleShort(sb);
2831 out->mins[2] = MSG_ReadLittleShort(sb);
2832 out->maxs[0] = MSG_ReadLittleShort(sb);
2833 out->maxs[1] = MSG_ReadLittleShort(sb);
2834 out->maxs[2] = MSG_ReadLittleShort(sb);
2835 out->firstsurface = MSG_ReadLittleLong(sb);
2836 out->numsurfaces = MSG_ReadLittleLong(sb);
2838 else if (loadmodel->brush.isbsp2)
2840 child[0] = MSG_ReadLittleLong(sb);
2841 child[1] = MSG_ReadLittleLong(sb);
2842 out->mins[0] = MSG_ReadLittleFloat(sb);
2843 out->mins[1] = MSG_ReadLittleFloat(sb);
2844 out->mins[2] = MSG_ReadLittleFloat(sb);
2845 out->maxs[0] = MSG_ReadLittleFloat(sb);
2846 out->maxs[1] = MSG_ReadLittleFloat(sb);
2847 out->maxs[2] = MSG_ReadLittleFloat(sb);
2848 out->firstsurface = MSG_ReadLittleLong(sb);
2849 out->numsurfaces = MSG_ReadLittleLong(sb);
2853 child[0] = (unsigned short)MSG_ReadLittleShort(sb);
2854 child[1] = (unsigned short)MSG_ReadLittleShort(sb);
2855 if (child[0] >= count)
2857 if (child[1] >= count)
2860 out->mins[0] = MSG_ReadLittleShort(sb);
2861 out->mins[1] = MSG_ReadLittleShort(sb);
2862 out->mins[2] = MSG_ReadLittleShort(sb);
2863 out->maxs[0] = MSG_ReadLittleShort(sb);
2864 out->maxs[1] = MSG_ReadLittleShort(sb);
2865 out->maxs[2] = MSG_ReadLittleShort(sb);
2867 out->firstsurface = (unsigned short)MSG_ReadLittleShort(sb);
2868 out->numsurfaces = (unsigned short)MSG_ReadLittleShort(sb);
2871 for (j=0 ; j<2 ; j++)
2873 // LordHavoc: this code supports broken bsp files produced by
2874 // arguire qbsp which can produce more than 32768 nodes, any value
2875 // below count is assumed to be a node number, any other value is
2876 // assumed to be a leaf number
2880 if (p < loadmodel->brush.num_nodes)
2881 out->children[j] = loadmodel->brush.data_nodes + p;
2884 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2885 // map it to the solid leaf
2886 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2891 // get leaf index as a positive value starting at 0 (-1 becomes 0, -2 becomes 1, etc)
2893 if (p < loadmodel->brush.num_leafs)
2894 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2897 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2898 // map it to the solid leaf
2899 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2905 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2908 static void Mod_Q1BSP_LoadLeafs(sizebuf_t *sb)
2911 int i, j, count, p, firstmarksurface, nummarksurfaces;
2912 int structsize = loadmodel->brush.isbsp2rmqe ? 32 : (loadmodel->brush.isbsp2 ? 44 : 28);
2914 if (sb->cursize % structsize)
2915 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2916 count = sb->cursize / structsize;
2917 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2919 loadmodel->brush.data_leafs = out;
2920 loadmodel->brush.num_leafs = count;
2921 // get visleafs from the submodel data
2922 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2923 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2924 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2925 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2927 // FIXME: this function could really benefit from some error checking
2928 for ( i=0 ; i<count ; i++, out++)
2930 out->contents = MSG_ReadLittleLong(sb);
2932 out->clusterindex = i - 1;
2933 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2934 out->clusterindex = -1;
2936 p = MSG_ReadLittleLong(sb);
2937 // ignore visofs errors on leaf 0 (solid)
2938 if (p >= 0 && out->clusterindex >= 0)
2940 if (p >= loadmodel->brushq1.num_compressedpvs)
2941 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2943 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);
2946 if (loadmodel->brush.isbsp2rmqe)
2948 out->mins[0] = MSG_ReadLittleShort(sb);
2949 out->mins[1] = MSG_ReadLittleShort(sb);
2950 out->mins[2] = MSG_ReadLittleShort(sb);
2951 out->maxs[0] = MSG_ReadLittleShort(sb);
2952 out->maxs[1] = MSG_ReadLittleShort(sb);
2953 out->maxs[2] = MSG_ReadLittleShort(sb);
2955 firstmarksurface = MSG_ReadLittleLong(sb);
2956 nummarksurfaces = MSG_ReadLittleLong(sb);
2958 else if (loadmodel->brush.isbsp2)
2960 out->mins[0] = MSG_ReadLittleFloat(sb);
2961 out->mins[1] = MSG_ReadLittleFloat(sb);
2962 out->mins[2] = MSG_ReadLittleFloat(sb);
2963 out->maxs[0] = MSG_ReadLittleFloat(sb);
2964 out->maxs[1] = MSG_ReadLittleFloat(sb);
2965 out->maxs[2] = MSG_ReadLittleFloat(sb);
2967 firstmarksurface = MSG_ReadLittleLong(sb);
2968 nummarksurfaces = MSG_ReadLittleLong(sb);
2972 out->mins[0] = MSG_ReadLittleShort(sb);
2973 out->mins[1] = MSG_ReadLittleShort(sb);
2974 out->mins[2] = MSG_ReadLittleShort(sb);
2975 out->maxs[0] = MSG_ReadLittleShort(sb);
2976 out->maxs[1] = MSG_ReadLittleShort(sb);
2977 out->maxs[2] = MSG_ReadLittleShort(sb);
2979 firstmarksurface = (unsigned short)MSG_ReadLittleShort(sb);
2980 nummarksurfaces = (unsigned short)MSG_ReadLittleShort(sb);
2983 if (firstmarksurface >= 0 && firstmarksurface + nummarksurfaces <= loadmodel->brush.num_leafsurfaces)
2985 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + firstmarksurface;
2986 out->numleafsurfaces = nummarksurfaces;
2990 Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", firstmarksurface, firstmarksurface+nummarksurfaces, 0, loadmodel->brush.num_leafsurfaces);
2991 out->firstleafsurface = NULL;
2992 out->numleafsurfaces = 0;
2995 for (j = 0;j < 4;j++)
2996 out->ambient_sound_level[j] = MSG_ReadByte(sb);
3000 static qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
3004 const unsigned char *pvs;
3005 // if there's no vis data, assume supported (because everything is visible all the time)
3006 if (!loadmodel->brush.data_pvsclusters)
3008 // check all liquid leafs to see if they can see into empty leafs, if any
3009 // can we can assume this map supports r_wateralpha
3010 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
3012 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
3014 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
3015 for (j = 0;j < loadmodel->brush.num_leafs;j++)
3016 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
3023 static void Mod_Q1BSP_LoadClipnodes(sizebuf_t *sb, hullinfo_t *hullinfo)
3028 int structsize = loadmodel->brush.isbsp2 ? 12 : 8;
3030 if (sb->cursize % structsize)
3031 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
3032 count = sb->cursize / structsize;
3033 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
3035 loadmodel->brushq1.clipnodes = out;
3036 loadmodel->brushq1.numclipnodes = count;
3038 for (i = 1; i < MAX_MAP_HULLS; i++)
3040 hull = &loadmodel->brushq1.hulls[i];
3041 hull->clipnodes = out;
3042 hull->firstclipnode = 0;
3043 hull->lastclipnode = count-1;
3044 hull->planes = loadmodel->brush.data_planes;
3045 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
3046 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
3047 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
3048 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
3049 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
3050 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
3051 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
3054 for (i=0 ; i<count ; i++, out++)
3056 out->planenum = MSG_ReadLittleLong(sb);
3057 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
3058 Host_Error("%s: Corrupt clipping hull(out of range planenum)", loadmodel->name);
3059 if (loadmodel->brush.isbsp2)
3061 out->children[0] = MSG_ReadLittleLong(sb);
3062 out->children[1] = MSG_ReadLittleLong(sb);
3063 if (out->children[0] >= count)
3064 Host_Error("%s: Corrupt clipping hull (invalid child index)", loadmodel->name);
3065 if (out->children[1] >= count)
3066 Host_Error("%s: Corrupt clipping hull (invalid child index)", loadmodel->name);
3070 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
3071 out->children[0] = (unsigned short)MSG_ReadLittleShort(sb);
3072 out->children[1] = (unsigned short)MSG_ReadLittleShort(sb);
3073 if (out->children[0] >= count)
3074 out->children[0] -= 65536;
3075 if (out->children[1] >= count)
3076 out->children[1] -= 65536;
3081 //Duplicate the drawing hull structure as a clipping hull
3082 static void Mod_Q1BSP_MakeHull0(void)
3089 hull = &loadmodel->brushq1.hulls[0];
3091 in = loadmodel->brush.data_nodes;
3092 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
3094 hull->clipnodes = out;
3095 hull->firstclipnode = 0;
3096 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
3097 hull->planes = loadmodel->brush.data_planes;
3099 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
3101 out->planenum = in->plane - loadmodel->brush.data_planes;
3102 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
3103 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
3107 static void Mod_Q1BSP_LoadLeaffaces(sizebuf_t *sb)
3110 int structsize = loadmodel->brush.isbsp2 ? 4 : 2;
3112 if (sb->cursize % structsize)
3113 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
3114 loadmodel->brush.num_leafsurfaces = sb->cursize / structsize;
3115 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
3117 if (loadmodel->brush.isbsp2)
3119 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
3121 j = MSG_ReadLittleLong(sb);
3122 if (j < 0 || j >= loadmodel->num_surfaces)
3123 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
3124 loadmodel->brush.data_leafsurfaces[i] = j;
3129 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
3131 j = (unsigned short) MSG_ReadLittleShort(sb);
3132 if (j >= loadmodel->num_surfaces)
3133 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
3134 loadmodel->brush.data_leafsurfaces[i] = j;
3139 static void Mod_Q1BSP_LoadSurfedges(sizebuf_t *sb)
3144 if (sb->cursize % structsize)
3145 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
3146 loadmodel->brushq1.numsurfedges = sb->cursize / structsize;
3147 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
3149 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
3150 loadmodel->brushq1.surfedges[i] = MSG_ReadLittleLong(sb);
3154 static void Mod_Q1BSP_LoadPlanes(sizebuf_t *sb)
3158 int structsize = 20;
3160 if (sb->cursize % structsize)
3161 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
3162 loadmodel->brush.num_planes = sb->cursize / structsize;
3163 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
3165 for (i = 0;i < loadmodel->brush.num_planes;i++, out++)
3167 out->normal[0] = MSG_ReadLittleFloat(sb);
3168 out->normal[1] = MSG_ReadLittleFloat(sb);
3169 out->normal[2] = MSG_ReadLittleFloat(sb);
3170 out->dist = MSG_ReadLittleFloat(sb);
3171 MSG_ReadLittleLong(sb); // type is not used, we use PlaneClassify
3176 static void Mod_Q1BSP_LoadMapBrushes(void)
3180 int submodel, numbrushes;
3181 qboolean firstbrush;
3182 char *text, *maptext;
3183 char mapfilename[MAX_QPATH];
3184 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
3185 strlcat (mapfilename, ".map", sizeof (mapfilename));
3186 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
3190 if (!COM_ParseToken_Simple(&data, false, false, true))
3195 if (!COM_ParseToken_Simple(&data, false, false, true))
3197 if (com_token[0] != '{')
3203 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
3206 if (!COM_ParseToken_Simple(&data, false, false, true))
3208 if (com_token[0] == '}')
3209 break; // end of entity
3210 if (com_token[0] == '{')
3217 if (submodel > loadmodel->brush.numsubmodels)
3219 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
3223 model = loadmodel->brush.submodels[submodel];
3230 if (!COM_ParseToken_Simple(&data, false, false, true))
3232 if (com_token[0] == '}')
3233 break; // end of brush
3234 // each brush face should be this format:
3235 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
3236 // FIXME: support hl .map format
3237 for (pointnum = 0;pointnum < 3;pointnum++)
3239 COM_ParseToken_Simple(&data, false, false, true);
3240 for (componentnum = 0;componentnum < 3;componentnum++)
3242 COM_ParseToken_Simple(&data, false, false, true);
3243 point[pointnum][componentnum] = atof(com_token);
3245 COM_ParseToken_Simple(&data, false, false, true);
3247 COM_ParseToken_Simple(&data, false, false, true);
3248 strlcpy(facetexture, com_token, sizeof(facetexture));
3249 COM_ParseToken_Simple(&data, false, false, true);
3250 //scroll_s = atof(com_token);
3251 COM_ParseToken_Simple(&data, false, false, true);
3252 //scroll_t = atof(com_token);
3253 COM_ParseToken_Simple(&data, false, false, true);
3254 //rotate = atof(com_token);
3255 COM_ParseToken_Simple(&data, false, false, true);
3256 //scale_s = atof(com_token);
3257 COM_ParseToken_Simple(&data, false, false, true);
3258 //scale_t = atof(com_token);
3259 TriangleNormal(point[0], point[1], point[2], planenormal);
3260 VectorNormalizeDouble(planenormal);
3261 planedist = DotProduct(point[0], planenormal);
3262 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
3272 #define MAX_PORTALPOINTS 64
3274 typedef struct portal_s
3277 mnode_t *nodes[2]; // [0] = front side of plane
3278 struct portal_s *next[2];
3280 double points[3*MAX_PORTALPOINTS];
3281 struct portal_s *chain; // all portals are linked into a list
3285 static memexpandablearray_t portalarray;
3287 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
3289 // process only nodes (leafs already had their box calculated)
3293 // calculate children first
3294 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
3295 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
3297 // make combined bounding box from children
3298 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
3299 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
3300 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
3301 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
3302 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
3303 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
3306 static void Mod_Q1BSP_FinalizePortals(void)
3308 int i, j, numportals, numpoints, portalindex, portalrange = (int)Mem_ExpandableArray_IndexRange(&portalarray);
3312 mleaf_t *leaf, *endleaf;
3314 // tally up portal and point counts and recalculate bounding boxes for all
3315 // leafs (because qbsp is very sloppy)
3316 leaf = loadmodel->brush.data_leafs;
3317 endleaf = leaf + loadmodel->brush.num_leafs;
3318 if (mod_recalculatenodeboxes.integer)
3320 for (;leaf < endleaf;leaf++)
3322 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
3323 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3328 for (portalindex = 0;portalindex < portalrange;portalindex++)
3330 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3333 // note: this check must match the one below or it will usually corrupt memory
3334 // 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
3335 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3338 numpoints += p->numpoints * 2;
3341 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3342 loadmodel->brush.num_portals = numportals;
3343 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3344 loadmodel->brush.num_portalpoints = numpoints;
3345 // clear all leaf portal chains
3346 for (i = 0;i < loadmodel->brush.num_leafs;i++)
3347 loadmodel->brush.data_leafs[i].portals = NULL;
3348 // process all portals in the global portal chain, while freeing them
3349 portal = loadmodel->brush.data_portals;
3350 point = loadmodel->brush.data_portalpoints;
3351 for (portalindex = 0;portalindex < portalrange;portalindex++)
3353 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3356 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3358 // note: this check must match the one above or it will usually corrupt memory
3359 // 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
3360 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3362 // first make the back to front portal(forward portal)
3363 portal->points = point;
3364 portal->numpoints = p->numpoints;
3365 portal->plane.dist = p->plane.dist;
3366 VectorCopy(p->plane.normal, portal->plane.normal);
3367 portal->here = (mleaf_t *)p->nodes[1];
3368 portal->past = (mleaf_t *)p->nodes[0];
3370 for (j = 0;j < portal->numpoints;j++)
3372 VectorCopy(p->points + j*3, point->position);
3375 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3376 PlaneClassify(&portal->plane);
3378 // link into leaf's portal chain
3379 portal->next = portal->here->portals;
3380 portal->here->portals = portal;
3382 // advance to next portal
3385 // then make the front to back portal(backward portal)
3386 portal->points = point;
3387 portal->numpoints = p->numpoints;
3388 portal->plane.dist = -p->plane.dist;
3389 VectorNegate(p->plane.normal, portal->plane.normal);
3390 portal->here = (mleaf_t *)p->nodes[0];
3391 portal->past = (mleaf_t *)p->nodes[1];
3393 for (j = portal->numpoints - 1;j >= 0;j--)
3395 VectorCopy(p->points + j*3, point->position);
3398 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3399 PlaneClassify(&portal->plane);
3401 // link into leaf's portal chain
3402 portal->next = portal->here->portals;
3403 portal->here->portals = portal;
3405 // advance to next portal
3408 // add the portal's polygon points to the leaf bounding boxes
3409 if (mod_recalculatenodeboxes.integer)
3411 for (i = 0;i < 2;i++)
3413 leaf = (mleaf_t *)p->nodes[i];
3414 for (j = 0;j < p->numpoints;j++)
3416 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3417 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3418 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3419 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3420 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3421 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3427 // now recalculate the node bounding boxes from the leafs
3428 if (mod_recalculatenodeboxes.integer)
3429 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3437 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3440 Host_Error("AddPortalToNodes: NULL front node");
3442 Host_Error("AddPortalToNodes: NULL back node");
3443 if (p->nodes[0] || p->nodes[1])
3444 Host_Error("AddPortalToNodes: already included");
3445 // 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
3447 p->nodes[0] = front;
3448 p->next[0] = (portal_t *)front->portals;
3449 front->portals = (mportal_t *)p;
3452 p->next[1] = (portal_t *)back->portals;
3453 back->portals = (mportal_t *)p;
3458 RemovePortalFromNode
3461 static void RemovePortalFromNodes(portal_t *portal)
3465 void **portalpointer;
3467 for (i = 0;i < 2;i++)
3469 node = portal->nodes[i];
3471 portalpointer = (void **) &node->portals;
3474 t = (portal_t *)*portalpointer;
3476 Host_Error("RemovePortalFromNodes: portal not in leaf");
3480 if (portal->nodes[0] == node)
3482 *portalpointer = portal->next[0];
3483 portal->nodes[0] = NULL;
3485 else if (portal->nodes[1] == node)
3487 *portalpointer = portal->next[1];
3488 portal->nodes[1] = NULL;
3491 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3495 if (t->nodes[0] == node)
3496 portalpointer = (void **) &t->next[0];
3497 else if (t->nodes[1] == node)
3498 portalpointer = (void **) &t->next[1];
3500 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3505 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3506 static double *portalpointsbuffer;
3507 static int portalpointsbufferoffset;
3508 static int portalpointsbuffersize;
3509 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3512 mnode_t *front, *back, *other_node;
3513 mplane_t clipplane, *plane;
3514 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3515 int numfrontpoints, numbackpoints;
3516 double *frontpoints, *backpoints;
3518 // if a leaf, we're done
3522 // get some space for our clipping operations to use
3523 if (portalpointsbuffersize < portalpointsbufferoffset + 6*MAX_PORTALPOINTS)
3525 portalpointsbuffersize = portalpointsbufferoffset * 2;
3526 portalpointsbuffer = (double *)Mem_Realloc(loadmodel->mempool, portalpointsbuffer, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3528 frontpoints = portalpointsbuffer + portalpointsbufferoffset;
3529 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3530 backpoints = portalpointsbuffer + portalpointsbufferoffset;
3531 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3533 plane = node->plane;
3535 front = node->children[0];
3536 back = node->children[1];
3538 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3540 // create the new portal by generating a polygon for the node plane,
3541 // and clipping it by all of the other portals(which came from nodes above this one)
3542 nodeportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3543 nodeportal->plane = *plane;
3545 // 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)
3546 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);
3547 nodeportal->numpoints = 4;
3548 // side = 0; // shut up compiler warning -> should be no longer needed, Host_Error is declared noreturn now
3549 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3551 clipplane = portal->plane;
3552 if (portal->nodes[0] == portal->nodes[1])
3553 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3554 if (portal->nodes[0] == node)
3556 else if (portal->nodes[1] == node)
3558 clipplane.dist = -clipplane.dist;
3559 VectorNegate(clipplane.normal, clipplane.normal);
3564 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3565 side = 0; // hush warning
3568 for (i = 0;i < nodeportal->numpoints*3;i++)
3569 frontpoints[i] = nodeportal->points[i];
3570 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);
3571 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3575 if (nodeportal->numpoints < 3)
3577 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3578 nodeportal->numpoints = 0;
3580 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3582 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3583 nodeportal->numpoints = 0;
3586 AddPortalToNodes(nodeportal, front, back);
3588 // split the portals of this node along this node's plane and assign them to the children of this node
3589 // (migrating the portals downward through the tree)
3590 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3592 if (portal->nodes[0] == portal->nodes[1])
3593 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3594 if (portal->nodes[0] == node)
3596 else if (portal->nodes[1] == node)
3600 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3601 side = 0; // hush warning
3603 nextportal = portal->next[side];
3604 if (!portal->numpoints)
3607 other_node = portal->nodes[!side];
3608 RemovePortalFromNodes(portal);
3610 // cut the portal into two portals, one on each side of the node plane
3611 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);
3613 if (!numfrontpoints)
3616 AddPortalToNodes(portal, back, other_node);
3618 AddPortalToNodes(portal, other_node, back);
3624 AddPortalToNodes(portal, front, other_node);
3626 AddPortalToNodes(portal, other_node, front);
3630 // the portal is split
3631 splitportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3632 temp = splitportal->chain;
3633 *splitportal = *portal;
3634 splitportal->chain = temp;
3635 for (i = 0;i < numbackpoints*3;i++)
3636 splitportal->points[i] = backpoints[i];
3637 splitportal->numpoints = numbackpoints;
3638 for (i = 0;i < numfrontpoints*3;i++)
3639 portal->points[i] = frontpoints[i];
3640 portal->numpoints = numfrontpoints;
3644 AddPortalToNodes(portal, front, other_node);
3645 AddPortalToNodes(splitportal, back, other_node);
3649 AddPortalToNodes(portal, other_node, front);
3650 AddPortalToNodes(splitportal, other_node, back);
3654 Mod_Q1BSP_RecursiveNodePortals(front);
3655 Mod_Q1BSP_RecursiveNodePortals(back);
3657 portalpointsbufferoffset -= 6*MAX_PORTALPOINTS;
3660 static void Mod_Q1BSP_MakePortals(void)
3662 Mem_ExpandableArray_NewArray(&portalarray, loadmodel->mempool, sizeof(portal_t), 1020*1024/sizeof(portal_t));
3663 portalpointsbufferoffset = 0;
3664 portalpointsbuffersize = 6*MAX_PORTALPOINTS*128;
3665 portalpointsbuffer = (double *)Mem_Alloc(loadmodel->mempool, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3666 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3667 Mem_Free(portalpointsbuffer);
3668 portalpointsbuffer = NULL;
3669 portalpointsbufferoffset = 0;
3670 portalpointsbuffersize = 0;
3671 Mod_Q1BSP_FinalizePortals();
3672 Mem_ExpandableArray_FreeArray(&portalarray);
3675 //Returns PVS data for a given point
3676 //(note: can return NULL)
3677 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3680 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3682 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3683 if (((mleaf_t *)node)->clusterindex >= 0)
3684 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3689 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)
3693 float d = PlaneDiff(org, node->plane);
3695 node = node->children[0];
3696 else if (d < -radius)
3697 node = node->children[1];
3700 // go down both sides
3701 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3702 node = node->children[1];
3705 // if this leaf is in a cluster, accumulate the pvs bits
3706 if (((mleaf_t *)node)->clusterindex >= 0)
3709 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3710 for (i = 0;i < pvsbytes;i++)
3711 pvsbuffer[i] |= pvs[i];
3715 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3716 //of the given point.
3717 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3719 int bytes = model->brush.num_pvsclusterbytes;
3720 bytes = min(bytes, pvsbufferlength);
3721 if (r_novis.integer || r_trippy.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3723 memset(pvsbuffer, 0xFF, bytes);
3727 memset(pvsbuffer, 0, bytes);
3728 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3732 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3737 VectorSubtract(inmaxs, inmins, size);
3738 if (cmodel->brush.ishlbsp)
3741 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3742 else if (size[0] <= 32)
3744 if (size[2] < 54) // pick the nearest of 36 or 72
3745 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3747 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3750 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3755 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3756 else if (size[0] <= 32)
3757 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3759 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3761 VectorCopy(inmins, outmins);
3762 VectorAdd(inmins, hull->clip_size, outmaxs);
3765 static int Mod_Q1BSP_CreateShadowMesh(dp_model_t *mod)
3768 int numshadowmeshtriangles = 0;
3769 msurface_t *surface;
3770 if (cls.state == ca_dedicated)
3772 // make a single combined shadow mesh to allow optimized shadow volume creation
3774 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3776 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3777 numshadowmeshtriangles += surface->num_triangles;
3779 mod->brush.shadowmesh = Mod_ShadowMesh_Begin(mod->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3780 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3781 if (surface->num_triangles > 0)
3782 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));
3783 mod->brush.shadowmesh = Mod_ShadowMesh_Finish(mod->mempool, mod->brush.shadowmesh, false, r_enableshadowvolumes.integer != 0, false);
3784 if (mod->brush.shadowmesh && mod->brush.shadowmesh->neighbor3i)
3785 Mod_BuildTriangleNeighbors(mod->brush.shadowmesh->neighbor3i, mod->brush.shadowmesh->element3i, mod->brush.shadowmesh->numtriangles);
3787 return numshadowmeshtriangles;
3790 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);
3792 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3795 sizebuf_t lumpsb[HEADER_LUMPS];
3797 float dist, modelyawradius, modelradius;
3798 msurface_t *surface;
3799 hullinfo_t hullinfo;
3800 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3801 model_brush_lightstyleinfo_t styleinfo[256];
3802 unsigned char *datapointer;
3805 MSG_InitReadBuffer(&sb, (unsigned char *)buffer, (unsigned char *)bufferend - (unsigned char *)buffer);
3807 mod->type = mod_brushq1;
3809 mod->brush.ishlbsp = false;
3810 mod->brush.isbsp2rmqe = false;
3811 mod->brush.isbsp2 = false;
3812 mod->brush.isq2bsp = false;
3813 mod->brush.isq3bsp = false;
3814 mod->brush.skymasking = true;
3815 i = MSG_ReadLittleLong(&sb);
3819 mod->modeldatatypestring = "Q1BSP";
3822 mod->brush.ishlbsp = true;
3823 mod->modeldatatypestring = "HLBSP";
3825 case ('2' + 'P' * 256 + 'S' * 65536 + 'B' * 16777216):
3826 mod->brush.isbsp2 = true;
3827 mod->brush.isbsp2rmqe = true; // like bsp2 except leaf/node bounds are 16bit (unexpanded)
3828 mod->modeldatatypestring = "Q1BSP2rmqe";
3830 case ('B' + 'S' * 256 + 'P' * 65536 + '2' * 16777216):
3831 mod->brush.isbsp2 = true;
3832 mod->modeldatatypestring = "Q1BSP2";
3835 mod->modeldatatypestring = "Unknown BSP";
3836 Host_Error("Mod_Q1BSP_Load: %s has wrong version number %i: supported versions are 29 (Quake), 30 (Half-Life), \"BSP2\" or \"2PSB\" (rmqe)", mod->name, i);
3840 // fill in hull info
3841 VectorClear (hullinfo.hullsizes[0][0]);
3842 VectorClear (hullinfo.hullsizes[0][1]);
3843 if (mod->brush.ishlbsp)
3845 hullinfo.filehulls = 4;
3846 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3847 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3848 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3849 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3850 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3851 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3855 hullinfo.filehulls = 4;
3856 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3857 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3858 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3859 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3863 for (i = 0; i < HEADER_LUMPS; i++)
3865 int offset = MSG_ReadLittleLong(&sb);
3866 int size = MSG_ReadLittleLong(&sb);
3867 if (offset < 0 || offset + size > sb.cursize)
3868 Host_Error("Mod_Q1BSP_Load: %s has invalid lump %i (offset %i, size %i, file size %i)\n", mod->name, i, offset, size, (int)sb.cursize);
3869 MSG_InitReadBuffer(&lumpsb[i], sb.data + offset, size);
3872 mod->soundfromcenter = true;
3873 mod->TraceBox = Mod_Q1BSP_TraceBox;
3874 mod->TraceLine = Mod_Q1BSP_TraceLine;
3875 mod->TracePoint = Mod_Q1BSP_TracePoint;
3876 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3877 mod->TraceLineAgainstSurfaces = Mod_Q1BSP_TraceLineAgainstSurfaces;
3878 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3879 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3880 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3881 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3882 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3883 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3884 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3885 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3886 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3887 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3888 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3889 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3890 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3891 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3892 mod->Draw = R_Q1BSP_Draw;
3893 mod->DrawDepth = R_Q1BSP_DrawDepth;
3894 mod->DrawDebug = R_Q1BSP_DrawDebug;
3895 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
3896 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3897 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3898 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3899 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3900 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3901 mod->DrawLight = R_Q1BSP_DrawLight;
3905 mod->brush.qw_md4sum = 0;
3906 mod->brush.qw_md4sum2 = 0;
3907 for (i = 0;i < HEADER_LUMPS;i++)
3910 if (i == LUMP_ENTITIES)
3912 temp = Com_BlockChecksum(lumpsb[i].data, lumpsb[i].cursize);
3913 mod->brush.qw_md4sum ^= LittleLong(temp);
3914 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3916 mod->brush.qw_md4sum2 ^= LittleLong(temp);
3919 Mod_Q1BSP_LoadEntities(&lumpsb[LUMP_ENTITIES]);
3920 Mod_Q1BSP_LoadVertexes(&lumpsb[LUMP_VERTEXES]);
3921 Mod_Q1BSP_LoadEdges(&lumpsb[LUMP_EDGES]);
3922 Mod_Q1BSP_LoadSurfedges(&lumpsb[LUMP_SURFEDGES]);
3923 Mod_Q1BSP_LoadTextures(&lumpsb[LUMP_TEXTURES]);
3924 Mod_Q1BSP_LoadLighting(&lumpsb[LUMP_LIGHTING]);
3925 Mod_Q1BSP_LoadPlanes(&lumpsb[LUMP_PLANES]);
3926 Mod_Q1BSP_LoadTexinfo(&lumpsb[LUMP_TEXINFO]);
3927 Mod_Q1BSP_LoadFaces(&lumpsb[LUMP_FACES]);
3928 Mod_Q1BSP_LoadLeaffaces(&lumpsb[LUMP_MARKSURFACES]);
3929 Mod_Q1BSP_LoadVisibility(&lumpsb[LUMP_VISIBILITY]);
3930 // load submodels before leafs because they contain the number of vis leafs
3931 Mod_Q1BSP_LoadSubmodels(&lumpsb[LUMP_MODELS], &hullinfo);
3932 Mod_Q1BSP_LoadLeafs(&lumpsb[LUMP_LEAFS]);
3933 Mod_Q1BSP_LoadNodes(&lumpsb[LUMP_NODES]);
3934 Mod_Q1BSP_LoadClipnodes(&lumpsb[LUMP_CLIPNODES], &hullinfo);
3936 for (i = 0; i < HEADER_LUMPS; i++)
3937 if (lumpsb[i].readcount != lumpsb[i].cursize && i != LUMP_TEXTURES && i != LUMP_LIGHTING)
3938 Host_Error("Lump %i incorrectly loaded (readcount %i, size %i)\n", i, lumpsb[i].readcount, lumpsb[i].cursize);
3940 // check if the map supports transparent water rendering
3941 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3943 // we don't need the compressed pvs data anymore
3944 if (mod->brushq1.data_compressedpvs)
3945 Mem_Free(mod->brushq1.data_compressedpvs);
3946 mod->brushq1.data_compressedpvs = NULL;
3947 mod->brushq1.num_compressedpvs = 0;
3949 Mod_Q1BSP_MakeHull0();
3950 if (mod_bsp_portalize.integer)
3951 Mod_Q1BSP_MakePortals();
3953 mod->numframes = 2; // regular and alternate animation
3956 // make a single combined shadow mesh to allow optimized shadow volume creation
3957 Mod_Q1BSP_CreateShadowMesh(loadmodel);
3959 if (loadmodel->brush.numsubmodels)
3960 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3962 // LordHavoc: to clear the fog around the original quake submodel code, I
3964 // first of all, some background info on the submodels:
3965 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3966 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3967 // now the weird for loop itself:
3968 // the loop functions in an odd way, on each iteration it sets up the
3969 // current 'mod' model (which despite the confusing code IS the model of
3970 // the number i), at the end of the loop it duplicates the model to become
3971 // the next submodel, and loops back to set up the new submodel.
3973 // LordHavoc: now the explanation of my sane way (which works identically):
3974 // set up the world model, then on each submodel copy from the world model
3975 // and set up the submodel with the respective model info.
3976 totalstylesurfaces = 0;
3978 for (i = 0;i < mod->brush.numsubmodels;i++)
3980 memset(stylecounts, 0, sizeof(stylecounts));
3981 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3983 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3984 for (j = 0;j < MAXLIGHTMAPS;j++)
3985 stylecounts[surface->lightmapinfo->styles[j]]++;
3987 for (k = 0;k < 255;k++)
3991 totalstylesurfaces += stylecounts[k];
3994 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3995 for (i = 0;i < mod->brush.numsubmodels;i++)
3997 // LordHavoc: this code was originally at the end of this loop, but
3998 // has been transformed to something more readable at the start here.
4003 // duplicate the basic information
4004 dpsnprintf(name, sizeof(name), "*%i", i);
4005 mod = Mod_FindName(name, loadmodel->name);
4006 // copy the base model to this one
4008 // rename the clone back to its proper name
4009 strlcpy(mod->name, name, sizeof(mod->name));
4010 mod->brush.parentmodel = loadmodel;
4011 // textures and memory belong to the main model
4012 mod->texturepool = NULL;
4013 mod->mempool = NULL;
4014 mod->brush.GetPVS = NULL;
4015 mod->brush.FatPVS = NULL;
4016 mod->brush.BoxTouchingPVS = NULL;
4017 mod->brush.BoxTouchingLeafPVS = NULL;
4018 mod->brush.BoxTouchingVisibleLeafs = NULL;
4019 mod->brush.FindBoxClusters = NULL;
4020 mod->brush.LightPoint = NULL;
4021 mod->brush.AmbientSoundLevelsForPoint = NULL;
4024 mod->brush.submodel = i;
4026 if (loadmodel->brush.submodels)
4027 loadmodel->brush.submodels[i] = mod;
4029 bm = &mod->brushq1.submodels[i];
4031 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
4032 for (j=1 ; j<MAX_MAP_HULLS ; j++)
4034 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
4035 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
4038 mod->firstmodelsurface = bm->firstface;
4039 mod->nummodelsurfaces = bm->numfaces;
4041 // set node/leaf parents for this submodel
4042 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
4044 // make the model surface list (used by shadowing/lighting)
4045 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
4046 Mod_MakeSortedSurfaces(mod);
4048 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
4049 // (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)
4050 VectorCopy(bm->mins, mod->normalmins);
4051 VectorCopy(bm->maxs, mod->normalmaxs);
4052 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
4053 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
4054 modelyawradius = dist*dist+modelyawradius*modelyawradius;
4055 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
4056 modelradius = modelyawradius + modelradius * modelradius;
4057 modelyawradius = sqrt(modelyawradius);
4058 modelradius = sqrt(modelradius);
4059 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
4060 mod->yawmins[2] = mod->normalmins[2];
4061 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
4062 mod->yawmaxs[2] = mod->normalmaxs[2];
4063 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
4064 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
4065 mod->radius = modelradius;
4066 mod->radius2 = modelradius * modelradius;
4068 // this gets altered below if sky or water is used
4069 mod->DrawSky = NULL;
4070 mod->DrawAddWaterPlanes = NULL;
4072 // scan surfaces for sky and water and flag the submodel as possessing these features or not
4073 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
4074 if (mod->nummodelsurfaces)
4076 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
4077 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
4079 if (j < mod->nummodelsurfaces)
4080 mod->DrawSky = R_Q1BSP_DrawSky;
4082 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
4083 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
4085 if (j < mod->nummodelsurfaces)
4086 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
4088 // build lightstyle update chains
4089 // (used to rapidly mark lightmapupdateflags on many surfaces
4090 // when d_lightstylevalue changes)
4091 memset(stylecounts, 0, sizeof(stylecounts));
4092 for (k = 0;k < mod->nummodelsurfaces;k++)
4094 surface = mod->data_surfaces + mod->firstmodelsurface + k;
4095 for (j = 0;j < MAXLIGHTMAPS;j++)
4096 stylecounts[surface->lightmapinfo->styles[j]]++;
4098 mod->brushq1.num_lightstyles = 0;
4099 for (k = 0;k < 255;k++)
4103 styleinfo[mod->brushq1.num_lightstyles].style = k;
4104 styleinfo[mod->brushq1.num_lightstyles].value = 0;
4105 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
4106 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
4107 remapstyles[k] = mod->brushq1.num_lightstyles;
4108 mod->brushq1.num_lightstyles++;
4111 for (k = 0;k < mod->nummodelsurfaces;k++)
4113 surface = mod->data_surfaces + mod->firstmodelsurface + k;
4114 for (j = 0;j < MAXLIGHTMAPS;j++)
4116 if (surface->lightmapinfo->styles[j] != 255)
4118 int r = remapstyles[surface->lightmapinfo->styles[j]];
4119 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
4123 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
4124 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
4128 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
4129 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
4131 //mod->brushq1.num_visleafs = bm->visleafs;
4133 // build a Bounding Interval Hierarchy for culling triangles in light rendering
4134 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
4136 if (mod_q1bsp_polygoncollisions.integer)
4138 mod->collision_bih = mod->render_bih;
4139 // point traces and contents checks still use the bsp tree
4140 mod->TraceLine = Mod_CollisionBIH_TraceLine;
4141 mod->TraceBox = Mod_CollisionBIH_TraceBox;
4142 mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
4143 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLineAgainstSurfaces;
4146 // generate VBOs and other shared data before cloning submodels
4150 Mod_Q1BSP_LoadMapBrushes();
4151 //Mod_Q1BSP_ProcessLightList();
4155 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);
4158 int Mod_Q2BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
4160 int supercontents = 0;
4161 if (nativecontents & CONTENTSQ2_SOLID)
4162 supercontents |= SUPERCONTENTS_SOLID;
4163 if (nativecontents & CONTENTSQ2_WATER)
4164 supercontents |= SUPERCONTENTS_WATER;
4165 if (nativecontents & CONTENTSQ2_SLIME)
4166 supercontents |= SUPERCONTENTS_SLIME;
4167 if (nativecontents & CONTENTSQ2_LAVA)
4168 supercontents |= SUPERCONTENTS_LAVA;
4169 if (nativecontents & CONTENTSQ2_MONSTER)
4170 supercontents |= SUPERCONTENTS_BODY;
4171 if (nativecontents & CONTENTSQ2_DEADMONSTER)
4172 supercontents |= SUPERCONTENTS_CORPSE;
4173 if (nativecontents & CONTENTSQ2_PLAYERCLIP)
4174 supercontents |= SUPERCONTENTS_PLAYERCLIP;
4175 if (nativecontents & CONTENTSQ2_MONSTERCLIP)
4176 supercontents |= SUPERCONTENTS_MONSTERCLIP;
4177 if (!(nativecontents & CONTENTSQ2_TRANSLUCENT))
4178 supercontents |= SUPERCONTENTS_OPAQUE;
4179 return supercontents;
4182 int Mod_Q2BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
4184 int nativecontents = 0;
4185 if (supercontents & SUPERCONTENTS_SOLID)
4186 nativecontents |= CONTENTSQ2_SOLID;
4187 if (supercontents & SUPERCONTENTS_WATER)
4188 nativecontents |= CONTENTSQ2_WATER;
4189 if (supercontents & SUPERCONTENTS_SLIME)
4190 nativecontents |= CONTENTSQ2_SLIME;
4191 if (supercontents & SUPERCONTENTS_LAVA)
4192 nativecontents |= CONTENTSQ2_LAVA;
4193 if (supercontents & SUPERCONTENTS_BODY)
4194 nativecontents |= CONTENTSQ2_MONSTER;
4195 if (supercontents & SUPERCONTENTS_CORPSE)
4196 nativecontents |= CONTENTSQ2_DEADMONSTER;
4197 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
4198 nativecontents |= CONTENTSQ2_PLAYERCLIP;
4199 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
4200 nativecontents |= CONTENTSQ2_MONSTERCLIP;
4201 if (!(supercontents & SUPERCONTENTS_OPAQUE))
4202 nativecontents |= CONTENTSQ2_TRANSLUCENT;
4203 return nativecontents;
4206 static void Mod_Q2BSP_LoadVisibility(sizebuf_t *sb)
4209 loadmodel->brushq1.num_compressedpvs = 0;
4210 loadmodel->brushq1.data_compressedpvs = NULL;
4211 loadmodel->brush.num_pvsclusters = 0;
4212 loadmodel->brush.num_pvsclusterbytes = 0;
4213 loadmodel->brush.data_pvsclusters = NULL;
4218 count = MSG_ReadLittleLong(sb);
4219 loadmodel->brush.num_pvsclusters = count;
4220 loadmodel->brush.num_pvsclusterbytes = (count+7)>>3;
4221 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*loadmodel->brush.num_pvsclusterbytes);
4222 for (i = 0;i < count;i++)
4224 int pvsofs = MSG_ReadLittleLong(sb);
4225 /*int phsofs = */MSG_ReadLittleLong(sb);
4226 // decompress the vis data for this cluster
4227 // (note this accesses the underlying data store of sb, which is kind of evil)
4228 Mod_Q1BSP_DecompressVis(sb->data + pvsofs, sb->data + sb->cursize, loadmodel->brush.data_pvsclusters + i * loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.data_pvsclusters + (i+1) * loadmodel->brush.num_pvsclusterbytes);
4230 // hush the loading error check later - we had to do random access on this lump, so we didn't read to the end
4231 sb->readcount = sb->cursize;
4234 static void Mod_Q2BSP_LoadNodes(sizebuf_t *sb)
4236 int i, j, count, p, child[2];
4238 int structsize = 28;
4240 if (sb->cursize % structsize)
4241 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4242 count = sb->cursize / structsize;
4244 Host_Error("Mod_Q2BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
4245 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
4247 loadmodel->brush.data_nodes = out;
4248 loadmodel->brush.num_nodes = count;
4250 for ( i=0 ; i<count ; i++, out++)
4252 p = MSG_ReadLittleLong(sb);
4253 out->plane = loadmodel->brush.data_planes + p;
4254 child[0] = MSG_ReadLittleLong(sb);
4255 child[1] = MSG_ReadLittleLong(sb);
4256 out->mins[0] = MSG_ReadLittleShort(sb);
4257 out->mins[1] = MSG_ReadLittleShort(sb);
4258 out->mins[2] = MSG_ReadLittleShort(sb);
4259 out->maxs[0] = MSG_ReadLittleShort(sb);
4260 out->maxs[1] = MSG_ReadLittleShort(sb);
4261 out->maxs[2] = MSG_ReadLittleShort(sb);
4262 out->firstsurface = (unsigned short)MSG_ReadLittleShort(sb);
4263 out->numsurfaces = (unsigned short)MSG_ReadLittleShort(sb);
4264 if (out->firstsurface + out->numsurfaces > (unsigned int)loadmodel->num_surfaces)
4266 Con_Printf("Mod_Q2BSP_LoadNodes: invalid surface index range %i+%i (file has only %i surfaces)\n", out->firstsurface, out->numsurfaces, loadmodel->num_surfaces);
4267 out->firstsurface = 0;
4268 out->numsurfaces = 0;
4270 for (j=0 ; j<2 ; j++)
4275 if (p < loadmodel->brush.num_nodes)
4276 out->children[j] = loadmodel->brush.data_nodes + p;
4279 Con_Printf("Mod_Q2BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
4280 // map it to the solid leaf
4281 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
4286 // get leaf index as a positive value starting at 0 (-1 becomes 0, -2 becomes 1, etc)
4288 if (p < loadmodel->brush.num_leafs)
4289 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
4292 Con_Printf("Mod_Q2BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
4293 // map it to the solid leaf
4294 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
4300 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
4303 static void Mod_Q2BSP_LoadTexinfo(sizebuf_t *sb)
4306 int i, j, k, l, count;
4307 int structsize = 76;
4308 int maxtextures = 1024; // hardcoded limit of quake2 engine, so we may as well use it as an upper bound
4309 char filename[MAX_QPATH];
4311 if (sb->cursize % structsize)
4312 Host_Error("Mod_Q2BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
4313 count = sb->cursize / structsize;
4314 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4315 loadmodel->brushq1.texinfo = out;
4316 loadmodel->brushq1.numtexinfo = count;
4317 loadmodel->num_texturesperskin = 0;
4318 loadmodel->data_textures = (texture_t*)Mem_Alloc(loadmodel->mempool, maxtextures * sizeof(texture_t));
4320 for (i = 0;i < count;i++, out++)
4322 for (k = 0;k < 2;k++)
4323 for (j = 0;j < 4;j++)
4324 out->vecs[k][j] = MSG_ReadLittleFloat(sb);
4326 out->q2flags = MSG_ReadLittleLong(sb);
4327 out->q2value = MSG_ReadLittleLong(sb);
4328 MSG_ReadBytes(sb, 32, (unsigned char*)out->q2texture);
4329 out->q2texture[31] = 0; // make absolutely sure it is terminated
4330 out->q2nexttexinfo = MSG_ReadLittleLong(sb);
4332 // find an existing match for the texture if possible
4333 dpsnprintf(filename, sizeof(filename), "textures/%s.wal", out->q2texture);
4334 for (j = 0;j < loadmodel->num_texturesperskin;j++)
4335 if (!strcmp(filename, loadmodel->data_textures[j].name) && out->q2flags == loadmodel->data_textures[j].q2flags)
4337 // if we don't find the texture, store the new texture
4338 if (j == loadmodel->num_texturesperskin)
4340 if (loadmodel->num_texturesperskin < maxtextures)
4342 texture_t *tx = loadmodel->data_textures + j;
4343 int q2flags = out->q2flags;
4344 unsigned char *walfile = NULL;
4345 fs_offset_t walfilesize = 0;
4346 Mod_LoadTextureFromQ3Shader(tx, filename, true, true, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS);
4347 // now read the .wal file to get metadata (even if a .tga was overriding it, we still need the wal data)
4348 walfile = FS_LoadFile(filename, tempmempool, true, &walfilesize);
4352 char q2animname32c[32];
4353 LoadWAL_GetMetadata(walfile, (int)walfilesize, &w, &h, &q2flags, &tx->q2value, &tx->q2contents, q2animname32c);
4356 tx->q2flags = q2flags;
4359 // also modify the texture to have the correct contents and such based on flags
4360 // note that we create multiple texture_t structures if q2flags differs
4361 if (q2flags & Q2SURF_LIGHT)
4363 // doesn't mean anything to us
4365 if (q2flags & Q2SURF_SLICK)
4367 // would be nice to support...
4369 if (q2flags & Q2SURF_SKY)
4371 // sky is a rather specific thing
4372 q2flags &= ~Q2SURF_NODRAW; // quake2 had a slightly different meaning than we have in mind here...
4373 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
4374 tx->supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE;
4375 tx->surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
4377 if (q2flags & Q2SURF_WARP)
4379 // we use a scroll instead of a warp
4380 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_FULLBRIGHT;
4381 // if it's also transparent, we can enable the WATERSHADER
4382 // but we do not set the WATERALPHA flag because we don't
4383 // want to honor r_wateralpha in q2bsp
4384 // (it would go against the artistic intent)
4385 if (q2flags & (Q2SURF_TRANS33 | Q2SURF_TRANS66))
4386 tx->basematerialflags |= MATERIALFLAG_WATERSHADER;
4388 if (q2flags & Q2SURF_TRANS33)
4390 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED;
4391 tx->basealpha = 0.3333f;
4392 tx->supercontents &= ~SUPERCONTENTS_OPAQUE;
4393 if (tx->q2contents & Q2CONTENTS_SOLID)
4394 tx->q2contents = (tx->q2contents & ~Q2CONTENTS_SOLID) | Q2CONTENTS_WINDOW;
4396 if (q2flags & Q2SURF_TRANS66)
4398 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED;
4399 tx->basealpha = 0.6667f;
4400 tx->supercontents &= ~SUPERCONTENTS_OPAQUE;
4401 if (tx->q2contents & Q2CONTENTS_SOLID)
4402 tx->q2contents = (tx->q2contents & ~Q2CONTENTS_SOLID) | Q2CONTENTS_WINDOW;
4404 if (q2flags & Q2SURF_FLOWING)
4406 tx->tcmods[0].tcmod = Q3TCMOD_SCROLL;
4407 tx->tcmods[0].parms[0] = -1.6f;
4408 tx->tcmods[0].parms[1] = 0.0f;
4410 if (q2flags & Q2SURF_NODRAW)
4412 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
4414 if (tx->q2contents & (Q2CONTENTS_TRANSLUCENT | Q2CONTENTS_MONSTERCLIP | Q2CONTENTS_PLAYERCLIP))
4415 tx->q2contents |= Q2CONTENTS_DETAIL;
4416 if (!(tx->q2contents & (Q2CONTENTS_SOLID | Q2CONTENTS_WINDOW | Q2CONTENTS_AUX | Q2CONTENTS_LAVA | Q2CONTENTS_SLIME | Q2CONTENTS_WATER | Q2CONTENTS_MIST | Q2CONTENTS_PLAYERCLIP | Q2CONTENTS_MONSTERCLIP | Q2CONTENTS_MIST)))
4417 tx->q2contents |= Q2CONTENTS_SOLID;
4418 if (tx->q2flags & (Q2SURF_HINT | Q2SURF_SKIP))
4420 tx->supercontents = Mod_Q2BSP_SuperContentsFromNativeContents(loadmodel, tx->q2contents);
4421 // set the current values to the base values
4422 tx->currentframe = tx;
4423 tx->currentskinframe = tx->skinframes[0];
4424 tx->currentmaterialflags = tx->basematerialflags;
4425 loadmodel->num_texturesperskin++;
4426 loadmodel->num_textures = loadmodel->num_texturesperskin;
4430 Con_Printf("Mod_Q2BSP_LoadTexinfo: max textures reached (%i)\n", maxtextures);
4431 j = 0; // use first texture and give up
4434 // store the index we found for this texture
4435 out->textureindex = j;
4438 // realloc the textures array now that we know how many we actually need
4439 loadmodel->data_textures = (texture_t*)Mem_Realloc(loadmodel->mempool, loadmodel->data_textures, loadmodel->num_texturesperskin * sizeof(texture_t));
4441 // now assemble the texture chains
4442 // if we encounter the textures out of order, the later ones won't mark the earlier ones in a sequence, so the earlier
4443 for (i = 0, out = loadmodel->brushq1.texinfo;i < count;i++, out++)
4446 texture_t *t = loadmodel->data_textures + out->textureindex;
4447 t->currentframe = t; // fix the reallocated pointer
4449 // if this is not animated, skip it
4450 // if this is already processed, skip it (part of an existing sequence)
4451 if (out->q2nexttexinfo == 0 || t->animated)
4454 // store the array of frames to use
4455 t->animated = 2; // q2bsp animation
4456 t->anim_total[0] = 0;
4457 t->anim_total[1] = 0;
4458 // gather up to 10 frames (we don't support more)
4459 for (j = i;j >= 0 && t->anim_total[0] < (int)(sizeof(t->anim_frames[0])/sizeof(t->anim_frames[0][0]));j = loadmodel->brushq1.texinfo[j].q2nexttexinfo)
4461 // detect looping and stop there
4462 if (t->anim_total[0] && loadmodel->brushq1.texinfo[j].textureindex == out->textureindex)
4464 t->anim_frames[0][t->anim_total[0]++] = &loadmodel->data_textures[loadmodel->brushq1.texinfo[j].textureindex];
4466 // we could look for the +a sequence here if this is the +0 sequence,
4467 // but it seems that quake2 did not implement that (even though the
4468 // files exist in the baseq2 content)
4470 // write the frame sequence to all the textures involved (just like
4471 // in the q1bsp loader)
4473 // note that this can overwrite the rest of the sequence - so if the
4474 // start of a sequence is found later than the other parts of the
4475 // sequence, it will go back and rewrite them correctly.
4476 for (k = 0;k < t->anim_total[0];k++)
4478 texture_t *txk = t->anim_frames[0][k];
4479 txk->animated = t->animated;
4480 txk->anim_total[0] = t->anim_total[0];
4481 for (l = 0;l < t->anim_total[0];l++)
4482 txk->anim_frames[0][l] = t->anim_frames[0][l];
4487 static void Mod_Q2BSP_LoadLighting(sizebuf_t *sb)
4489 // LordHavoc: this fits exactly the same format that we use in .lit files
4490 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, sb->cursize);
4491 MSG_ReadBytes(sb, sb->cursize, loadmodel->brushq1.lightdata);
4494 static void Mod_Q2BSP_LoadLeafs(sizebuf_t *sb)
4497 int i, j, count, firstmarksurface, nummarksurfaces, firstmarkbrush, nummarkbrushes;
4498 int structsize = 28;
4500 if (sb->cursize % structsize)
4501 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4502 count = sb->cursize / structsize;
4503 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
4505 loadmodel->brush.data_leafs = out;
4506 loadmodel->brush.num_leafs = count;
4508 // FIXME: this function could really benefit from some error checking
4509 for ( i=0 ; i<count ; i++, out++)
4511 out->contents = MSG_ReadLittleLong(sb);
4512 out->clusterindex = MSG_ReadLittleShort(sb);
4513 out->areaindex = MSG_ReadLittleShort(sb);
4514 out->mins[0] = MSG_ReadLittleShort(sb);
4515 out->mins[1] = MSG_ReadLittleShort(sb);
4516 out->mins[2] = MSG_ReadLittleShort(sb);
4517 out->maxs[0] = MSG_ReadLittleShort(sb);
4518 out->maxs[1] = MSG_ReadLittleShort(sb);
4519 out->maxs[2] = MSG_ReadLittleShort(sb);
4521 firstmarksurface = (unsigned short)MSG_ReadLittleShort(sb);
4522 nummarksurfaces = (unsigned short)MSG_ReadLittleShort(sb);
4523 firstmarkbrush = (unsigned short)MSG_ReadLittleShort(sb);
4524 nummarkbrushes = (unsigned short)MSG_ReadLittleShort(sb);
4526 for (j = 0;j < 4;j++)
4527 out->ambient_sound_level[j] = 0;
4529 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
4531 Con_Print("Mod_Q2BSP_LoadLeafs: invalid clusterindex\n");
4532 out->clusterindex = -1;
4535 if (firstmarksurface >= 0 && firstmarksurface + nummarksurfaces <= loadmodel->brush.num_leafsurfaces)
4537 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + firstmarksurface;
4538 out->numleafsurfaces = nummarksurfaces;
4542 Con_Printf("Mod_Q2BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", firstmarksurface, firstmarksurface+nummarksurfaces, 0, loadmodel->brush.num_leafsurfaces);
4543 out->firstleafsurface = NULL;
4544 out->numleafsurfaces = 0;
4547 if (firstmarkbrush >= 0 && firstmarkbrush + nummarkbrushes <= loadmodel->brush.num_leafbrushes)
4549 out->firstleafbrush = loadmodel->brush.data_leafbrushes + firstmarkbrush;
4550 out->numleafbrushes = nummarkbrushes;
4554 Con_Printf("Mod_Q2BSP_LoadLeafs: invalid leafbrush range %i:%i outside range %i:%i\n", firstmarkbrush, firstmarkbrush+nummarkbrushes, 0, loadmodel->brush.num_leafbrushes);
4555 out->firstleafbrush = NULL;
4556 out->numleafbrushes = 0;
4561 static void Mod_Q2BSP_LoadLeafBrushes(sizebuf_t *sb)
4566 if (sb->cursize % structsize)
4567 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4568 loadmodel->brush.num_leafbrushes = sb->cursize / structsize;
4569 loadmodel->brush.data_leafbrushes = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafbrushes * sizeof(int));
4571 for (i = 0;i < loadmodel->brush.num_leafbrushes;i++)
4573 j = (unsigned short) MSG_ReadLittleShort(sb);
4574 if (j >= loadmodel->brush.num_brushes)
4575 Host_Error("Mod_Q1BSP_LoadLeafBrushes: bad brush number");
4576 loadmodel->brush.data_leafbrushes[i] = j;
4580 static void Mod_Q2BSP_LoadBrushSides(sizebuf_t *sb)
4582 q3mbrushside_t *out;
4586 if (sb->cursize % structsize)
4587 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4588 count = sb->cursize / structsize;
4589 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4591 loadmodel->brush.data_brushsides = out;
4592 loadmodel->brush.num_brushsides = count;
4594 for (i = 0;i < count;i++, out++)
4596 n = (unsigned short)MSG_ReadLittleShort(sb);
4597 if (n < 0 || n >= loadmodel->brush.num_planes)
4598 Host_Error("Mod_Q2BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4599 out->plane = loadmodel->brush.data_planes + n;
4600 n = MSG_ReadLittleShort(sb);
4603 if (n >= loadmodel->brushq1.numtexinfo)
4604 Host_Error("Mod_Q2BSP_LoadBrushSides: invalid texinfo index %i (%i texinfos)", n, loadmodel->brushq1.numtexinfo);
4605 out->texture = loadmodel->data_textures + loadmodel->brushq1.texinfo[n].textureindex;
4609 //Con_Printf("Mod_Q2BSP_LoadBrushSides: brushside %i has texinfo index %i < 0, changing to generic texture!\n", i, n);
4610 out->texture = &mod_q1bsp_texture_solid;
4615 static void Mod_Q2BSP_LoadBrushes(sizebuf_t *sb)
4618 int i, j, firstside, numsides, contents, count, maxplanes, q3surfaceflags, supercontents;
4619 colplanef_t *planes;
4620 int structsize = 12;
4622 if (sb->cursize % structsize)
4623 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4624 count = sb->cursize / structsize;
4625 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4627 loadmodel->brush.data_brushes = out;
4628 loadmodel->brush.num_brushes = count;
4633 for (i = 0;i < count;i++, out++)
4635 firstside = MSG_ReadLittleLong(sb);
4636 numsides = MSG_ReadLittleLong(sb);
4637 contents = MSG_ReadLittleLong(sb);
4638 if (firstside < 0 || firstside + numsides > loadmodel->brush.num_brushsides)
4639 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", firstside, firstside + numsides, loadmodel->brush.num_brushsides);
4641 out->firstbrushside = loadmodel->brush.data_brushsides + firstside;
4642 out->numbrushsides = numsides;
4643 // not really the same... we should store the q2 contents
4644 out->texture = out->firstbrushside->texture;
4645 // convert the contents to our values
4646 supercontents = Mod_Q2BSP_SuperContentsFromNativeContents(loadmodel, contents);
4648 // make a list of mplane_t structs to construct a colbrush from
4649 if (maxplanes < out->numbrushsides)
4651 maxplanes = out->numbrushsides;
4654 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4657 for (j = 0;j < out->numbrushsides;j++)
4659 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4660 planes[j].dist = out->firstbrushside[j].plane->dist;
4661 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4662 planes[j].texture = out->firstbrushside[j].texture;
4663 q3surfaceflags |= planes[j].q3surfaceflags;
4664 // LordHavoc: kind of a mean hack here, but we want the surfaces to have the brush contents
4665 out->firstbrushside[j].texture->supercontents = supercontents;
4667 // make the colbrush from the planes
4668 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4670 // this whole loop can take a while (e.g. on redstarrepublic4)
4671 CL_KeepaliveMessage(false);
4677 static void Mod_Q2BSP_LoadPOP(sizebuf_t *sb)
4679 // this is probably a "proof of purchase" lump of some sort, it seems to be 0 size in most bsp files (but not q2dm1.bsp for instance)
4680 sb->readcount = sb->cursize;
4683 static void Mod_Q2BSP_LoadAreas(sizebuf_t *sb)
4685 // we currently don't use areas, they represent closable doors as vis blockers
4686 sb->readcount = sb->cursize;
4689 static void Mod_Q2BSP_LoadAreaPortals(sizebuf_t *sb)
4691 // we currently don't use areas, they represent closable doors as vis blockers
4692 sb->readcount = sb->cursize;
4695 static void Mod_Q2BSP_LoadSubmodels(sizebuf_t *sb)
4699 int structsize = 48;
4701 if (sb->cursize % structsize)
4702 Host_Error ("Mod_Q2BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
4704 count = sb->cursize / structsize;
4705 out = (mmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
4707 loadmodel->brushq1.submodels = out;
4708 loadmodel->brush.numsubmodels = count;
4710 // this is identical to the q1 submodel structure except for having 1 hull
4711 for (i = 0; i < count; i++, out++)
4713 // spread out the mins / maxs by a pixel
4714 out->mins[0] = MSG_ReadLittleFloat(sb) - 1;
4715 out->mins[1] = MSG_ReadLittleFloat(sb) - 1;
4716 out->mins[2] = MSG_ReadLittleFloat(sb) - 1;
4717 out->maxs[0] = MSG_ReadLittleFloat(sb) + 1;
4718 out->maxs[1] = MSG_ReadLittleFloat(sb) + 1;
4719 out->maxs[2] = MSG_ReadLittleFloat(sb) + 1;
4720 out->origin[0] = MSG_ReadLittleFloat(sb);
4721 out->origin[1] = MSG_ReadLittleFloat(sb);
4722 out->origin[2] = MSG_ReadLittleFloat(sb);
4723 out->headnode[0] = MSG_ReadLittleLong(sb);
4724 out->firstface = MSG_ReadLittleLong(sb);
4725 out->numfaces = MSG_ReadLittleLong(sb);
4729 static void Mod_Q2BSP_FindSubmodelBrushRange_r(dp_model_t *mod, mnode_t *node, int *first, int *last)
4735 Mod_Q2BSP_FindSubmodelBrushRange_r(mod, node->children[0], first, last);
4736 node = node->children[1];
4738 leaf = (mleaf_t*)node;
4739 for (i = 0;i < leaf->numleafbrushes;i++)
4741 int brushnum = leaf->firstleafbrush[i];
4742 if (*first > brushnum)
4744 if (*last < brushnum)
4749 static void Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4752 sizebuf_t lumpsb[Q2HEADER_LUMPS];
4754 float dist, modelyawradius, modelradius;
4755 msurface_t *surface;
4756 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
4757 model_brush_lightstyleinfo_t styleinfo[256];
4758 unsigned char *datapointer;
4761 MSG_InitReadBuffer(&sb, (unsigned char *)buffer, (unsigned char *)bufferend - (unsigned char *)buffer);
4763 mod->type = mod_brushq2;
4765 mod->brush.ishlbsp = false;
4766 mod->brush.isbsp2rmqe = false;
4767 mod->brush.isbsp2 = false;
4768 mod->brush.isq2bsp = true; // q1bsp loaders mostly work but we need a few tweaks
4769 mod->brush.isq3bsp = false;
4770 mod->brush.skymasking = true;
4771 mod->modeldatatypestring = "Q2BSP";
4773 i = MSG_ReadLittleLong(&sb);
4774 if (i != Q2BSPMAGIC)
4775 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4777 i = MSG_ReadLittleLong(&sb);
4778 if (i != Q2BSPVERSION)
4779 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4782 for (i = 0; i < Q2HEADER_LUMPS; i++)
4784 int offset = MSG_ReadLittleLong(&sb);
4785 int size = MSG_ReadLittleLong(&sb);
4786 if (offset < 0 || offset + size > sb.cursize)
4787 Host_Error("Mod_Q2BSP_Load: %s has invalid lump %i (offset %i, size %i, file size %i)\n", mod->name, i, offset, size, (int)sb.cursize);
4788 MSG_InitReadBuffer(&lumpsb[i], sb.data + offset, size);
4791 mod->soundfromcenter = true;
4792 mod->TracePoint = Mod_CollisionBIH_TracePoint;
4793 mod->TraceLine = Mod_CollisionBIH_TraceLine;
4794 mod->TraceBox = Mod_CollisionBIH_TraceBox;
4795 mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
4796 mod->PointSuperContents = Mod_CollisionBIH_PointSuperContents;
4797 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
4798 mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
4799 mod->brush.SuperContentsFromNativeContents = Mod_Q2BSP_SuperContentsFromNativeContents;
4800 mod->brush.NativeContentsFromSuperContents = Mod_Q2BSP_NativeContentsFromSuperContents;
4801 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
4802 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
4803 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
4804 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
4805 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
4806 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
4807 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
4808 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
4809 mod->brush.AmbientSoundLevelsForPoint = NULL;
4810 mod->brush.RoundUpToHullSize = NULL;
4811 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
4812 mod->Draw = R_Q1BSP_Draw;
4813 mod->DrawDepth = R_Q1BSP_DrawDepth;
4814 mod->DrawDebug = R_Q1BSP_DrawDebug;
4815 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
4816 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
4817 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
4818 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
4819 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
4820 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
4821 mod->DrawLight = R_Q1BSP_DrawLight;
4825 mod->brush.qw_md4sum = 0;
4826 mod->brush.qw_md4sum2 = 0;
4827 for (i = 0;i < Q2HEADER_LUMPS;i++)
4830 if (i == Q2LUMP_ENTITIES)
4832 temp = Com_BlockChecksum(lumpsb[i].data, lumpsb[i].cursize);
4833 mod->brush.qw_md4sum ^= LittleLong(temp);
4834 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4836 mod->brush.qw_md4sum2 ^= LittleLong(temp);
4839 // many of these functions are identical to Q1 loaders, so we use those where possible
4840 Mod_Q1BSP_LoadEntities(&lumpsb[Q2LUMP_ENTITIES]);
4841 Mod_Q1BSP_LoadVertexes(&lumpsb[Q2LUMP_VERTEXES]);
4842 Mod_Q1BSP_LoadEdges(&lumpsb[Q2LUMP_EDGES]);
4843 Mod_Q1BSP_LoadSurfedges(&lumpsb[Q2LUMP_SURFEDGES]);
4844 Mod_Q2BSP_LoadLighting(&lumpsb[Q2LUMP_LIGHTING]);
4845 Mod_Q1BSP_LoadPlanes(&lumpsb[Q2LUMP_PLANES]);
4846 Mod_Q2BSP_LoadTexinfo(&lumpsb[Q2LUMP_TEXINFO]);
4847 Mod_Q2BSP_LoadBrushSides(&lumpsb[Q2LUMP_BRUSHSIDES]);
4848 Mod_Q2BSP_LoadBrushes(&lumpsb[Q2LUMP_BRUSHES]);
4849 Mod_Q1BSP_LoadFaces(&lumpsb[Q2LUMP_FACES]);
4850 Mod_Q1BSP_LoadLeaffaces(&lumpsb[Q2LUMP_LEAFFACES]);
4851 Mod_Q2BSP_LoadLeafBrushes(&lumpsb[Q2LUMP_LEAFBRUSHES]);
4852 Mod_Q2BSP_LoadVisibility(&lumpsb[Q2LUMP_VISIBILITY]);
4853 Mod_Q2BSP_LoadPOP(&lumpsb[Q2LUMP_POP]);
4854 Mod_Q2BSP_LoadAreas(&lumpsb[Q2LUMP_AREAS]);
4855 Mod_Q2BSP_LoadAreaPortals(&lumpsb[Q2LUMP_AREAPORTALS]);
4856 Mod_Q2BSP_LoadLeafs(&lumpsb[Q2LUMP_LEAFS]);
4857 Mod_Q2BSP_LoadNodes(&lumpsb[Q2LUMP_NODES]);
4858 Mod_Q2BSP_LoadSubmodels(&lumpsb[Q2LUMP_MODELS]);
4860 for (i = 0; i < Q2HEADER_LUMPS; i++)
4861 if (lumpsb[i].readcount != lumpsb[i].cursize)
4862 Host_Error("Lump %i incorrectly loaded (readcount %i, size %i)\n", i, lumpsb[i].readcount, lumpsb[i].cursize);
4864 // we don't actually set MATERIALFLAG_WATERALPHA on anything, so this
4865 // doesn't enable the cvar, just indicates that transparent water is OK
4866 loadmodel->brush.supportwateralpha = true;
4868 // we don't need the compressed pvs data anymore
4869 if (mod->brushq1.data_compressedpvs)
4870 Mem_Free(mod->brushq1.data_compressedpvs);
4871 mod->brushq1.data_compressedpvs = NULL;
4872 mod->brushq1.num_compressedpvs = 0;
4874 // the MakePortals code works fine on the q2bsp data as well
4875 if (mod_bsp_portalize.integer)
4876 Mod_Q1BSP_MakePortals();
4878 mod->numframes = 0; // q2bsp animations are kind of special, frame is unbounded...
4881 // make a single combined shadow mesh to allow optimized shadow volume creation
4882 Mod_Q1BSP_CreateShadowMesh(loadmodel);
4884 if (loadmodel->brush.numsubmodels)
4885 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
4887 totalstylesurfaces = 0;
4889 for (i = 0;i < mod->brush.numsubmodels;i++)
4891 memset(stylecounts, 0, sizeof(stylecounts));
4892 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
4894 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
4895 for (j = 0;j < MAXLIGHTMAPS;j++)
4896 stylecounts[surface->lightmapinfo->styles[j]]++;
4898 for (k = 0;k < 255;k++)
4902 totalstylesurfaces += stylecounts[k];
4905 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
4906 // set up the world model, then on each submodel copy from the world model
4907 // and set up the submodel with the respective model info.
4909 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
4911 mnode_t *rootnode = NULL;
4912 int firstbrush = loadmodel->brush.num_brushes, lastbrush = 0;
4916 // duplicate the basic information
4917 dpsnprintf(name, sizeof(name), "*%i", i);
4918 mod = Mod_FindName(name, loadmodel->name);
4919 // copy the base model to this one
4921 // rename the clone back to its proper name
4922 strlcpy(mod->name, name, sizeof(mod->name));
4923 mod->brush.parentmodel = loadmodel;
4924 // textures and memory belong to the main model
4925 mod->texturepool = NULL;
4926 mod->mempool = NULL;
4927 mod->brush.GetPVS = NULL;
4928 mod->brush.FatPVS = NULL;
4929 mod->brush.BoxTouchingPVS = NULL;
4930 mod->brush.BoxTouchingLeafPVS = NULL;
4931 mod->brush.BoxTouchingVisibleLeafs = NULL;
4932 mod->brush.FindBoxClusters = NULL;
4933 mod->brush.LightPoint = NULL;
4934 mod->brush.AmbientSoundLevelsForPoint = NULL;
4936 mod->brush.submodel = i;
4937 if (loadmodel->brush.submodels)
4938 loadmodel->brush.submodels[i] = mod;
4940 bm = &mod->brushq1.submodels[i];
4942 // we store the headnode (there's only one in Q2BSP) as if it were the first hull
4943 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
4945 mod->firstmodelsurface = bm->firstface;
4946 mod->nummodelsurfaces = bm->numfaces;
4948 // set node/leaf parents for this submodel
4949 // note: if the root of this submodel is a leaf (headnode[0] < 0) then there is nothing to do...
4950 // (this happens in base3.bsp)
4951 if (bm->headnode[0] >= 0)
4952 rootnode = mod->brush.data_nodes + bm->headnode[0];
4954 rootnode = (mnode_t*)(mod->brush.data_leafs + -1 - bm->headnode[0]);
4955 Mod_Q1BSP_LoadNodes_RecursiveSetParent(rootnode, NULL);
4957 // make the model surface list (used by shadowing/lighting)
4958 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
4959 Mod_Q2BSP_FindSubmodelBrushRange_r(mod, rootnode, &firstbrush, &lastbrush);
4960 if (firstbrush <= lastbrush)
4962 mod->firstmodelbrush = firstbrush;
4963 mod->nummodelbrushes = lastbrush + 1 - firstbrush;
4967 mod->firstmodelbrush = 0;
4968 mod->nummodelbrushes = 0;
4970 Mod_MakeSortedSurfaces(mod);
4972 VectorCopy(bm->mins, mod->normalmins);
4973 VectorCopy(bm->maxs, mod->normalmaxs);
4974 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
4975 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
4976 modelyawradius = dist*dist+modelyawradius*modelyawradius;
4977 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
4978 modelradius = modelyawradius + modelradius * modelradius;
4979 modelyawradius = sqrt(modelyawradius);
4980 modelradius = sqrt(modelradius);
4981 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
4982 mod->yawmins[2] = mod->normalmins[2];
4983 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
4984 mod->yawmaxs[2] = mod->normalmaxs[2];
4985 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
4986 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
4987 mod->radius = modelradius;
4988 mod->radius2 = modelradius * modelradius;
4990 // this gets altered below if sky or water is used
4991 mod->DrawSky = NULL;
4992 mod->DrawAddWaterPlanes = NULL;
4994 // scan surfaces for sky and water and flag the submodel as possessing these features or not
4995 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
4996 if (mod->nummodelsurfaces)
4998 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
4999 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
5001 if (j < mod->nummodelsurfaces)
5002 mod->DrawSky = R_Q1BSP_DrawSky;
5004 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
5005 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
5007 if (j < mod->nummodelsurfaces)
5008 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
5010 // build lightstyle update chains
5011 // (used to rapidly mark lightmapupdateflags on many surfaces
5012 // when d_lightstylevalue changes)
5013 memset(stylecounts, 0, sizeof(stylecounts));
5014 for (k = 0;k < mod->nummodelsurfaces;k++)
5016 surface = mod->data_surfaces + mod->firstmodelsurface + k;
5017 for (j = 0;j < MAXLIGHTMAPS;j++)
5018 stylecounts[surface->lightmapinfo->styles[j]]++;
5020 mod->brushq1.num_lightstyles = 0;
5021 for (k = 0;k < 255;k++)
5025 styleinfo[mod->brushq1.num_lightstyles].style = k;
5026 styleinfo[mod->brushq1.num_lightstyles].value = 0;
5027 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
5028 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
5029 remapstyles[k] = mod->brushq1.num_lightstyles;
5030 mod->brushq1.num_lightstyles++;
5033 for (k = 0;k < mod->nummodelsurfaces;k++)
5035 surface = mod->data_surfaces + mod->firstmodelsurface + k;
5036 for (j = 0;j < MAXLIGHTMAPS;j++)
5038 if (surface->lightmapinfo->styles[j] != 255)
5040 int r = remapstyles[surface->lightmapinfo->styles[j]];
5041 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
5045 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
5046 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
5050 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
5052 //mod->brushq1.num_visleafs = bm->visleafs;
5054 // build a Bounding Interval Hierarchy for culling triangles in light rendering
5055 Mod_MakeCollisionBIH(mod, false, &mod->collision_bih);
5057 // build a Bounding Interval Hierarchy for culling brushes in collision detection
5058 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
5060 // generate VBOs and other shared data before cloning submodels
5066 Con_DPrintf("Stats for q2bsp 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);
5069 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
5070 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
5072 static void Mod_Q3BSP_LoadEntities(lump_t *l)
5075 char key[128], value[MAX_INPUTLINE];
5077 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
5078 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
5079 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
5082 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
5083 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
5084 loadmodel->brush.entities[l->filelen] = 0;
5085 data = loadmodel->brush.entities;
5086 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
5087 // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
5088 loadmodel->brushq3.deluxemapping = false;
5089 if (data && COM_ParseToken_Simple(&data, false, false, true) && com_token[0] == '{')
5093 if (!COM_ParseToken_Simple(&data, false, false, true))
5095 if (com_token[0] == '}')
5096 break; // end of worldspawn
5097 if (com_token[0] == '_')
5098 strlcpy(key, com_token + 1, sizeof(key));
5100 strlcpy(key, com_token, sizeof(key));
5101 while (key[strlen(key)-1] == ' ') // remove trailing spaces
5102 key[strlen(key)-1] = 0;
5103 if (!COM_ParseToken_Simple(&data, false, false, true))
5105 strlcpy(value, com_token, sizeof(value));
5106 if (!strcasecmp("gridsize", key)) // this one is case insensitive to 100% match q3map2
5108 #if _MSC_VER >= 1400
5109 #define sscanf sscanf_s
5112 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
5113 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
5115 VectorSet(v, 64, 64, 128);
5116 if(sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) != 3)
5117 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]);
5118 if (v[0] != 0 && v[1] != 0 && v[2] != 0)
5119 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
5122 else if (!strcmp("deluxeMaps", key))
5124 if (!strcmp(com_token, "1"))
5126 loadmodel->brushq3.deluxemapping = true;
5127 loadmodel->brushq3.deluxemapping_modelspace = true;
5129 else if (!strcmp(com_token, "2"))
5131 loadmodel->brushq3.deluxemapping = true;
5132 loadmodel->brushq3.deluxemapping_modelspace = false;
5139 static void Mod_Q3BSP_LoadTextures(lump_t *l)
5145 in = (q3dtexture_t *)(mod_base + l->fileofs);
5146 if (l->filelen % sizeof(*in))
5147 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
5148 count = l->filelen / sizeof(*in);
5149 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5151 loadmodel->data_textures = out;
5152 loadmodel->num_textures = count;
5153 loadmodel->num_texturesperskin = loadmodel->num_textures;
5155 for (i = 0;i < count;i++)
5157 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
5158 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
5159 Mod_LoadTextureFromQ3Shader(out + i, in[i].name, true, true, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS);
5160 // restore the surfaceflags and supercontents
5161 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
5162 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
5166 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
5172 in = (q3dplane_t *)(mod_base + l->fileofs);
5173 if (l->filelen % sizeof(*in))
5174 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
5175 count = l->filelen / sizeof(*in);
5176 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5178 loadmodel->brush.data_planes = out;
5179 loadmodel->brush.num_planes = count;
5181 for (i = 0;i < count;i++, in++, out++)
5183 out->normal[0] = LittleFloat(in->normal[0]);
5184 out->normal[1] = LittleFloat(in->normal[1]);
5185 out->normal[2] = LittleFloat(in->normal[2]);
5186 out->dist = LittleFloat(in->dist);
5191 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
5194 q3mbrushside_t *out;
5197 in = (q3dbrushside_t *)(mod_base + l->fileofs);
5198 if (l->filelen % sizeof(*in))
5199 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
5200 count = l->filelen / sizeof(*in);
5201 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5203 loadmodel->brush.data_brushsides = out;
5204 loadmodel->brush.num_brushsides = count;
5206 for (i = 0;i < count;i++, in++, out++)
5208 n = LittleLong(in->planeindex);
5209 if (n < 0 || n >= loadmodel->brush.num_planes)
5210 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5211 out->plane = loadmodel->brush.data_planes + n;
5212 n = LittleLong(in->textureindex);
5213 if (n < 0 || n >= loadmodel->num_textures)
5214 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
5215 out->texture = loadmodel->data_textures + n;
5219 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
5221 q3dbrushside_ig_t *in;
5222 q3mbrushside_t *out;
5225 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
5226 if (l->filelen % sizeof(*in))
5227 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
5228 count = l->filelen / sizeof(*in);
5229 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5231 loadmodel->brush.data_brushsides = out;
5232 loadmodel->brush.num_brushsides = count;
5234 for (i = 0;i < count;i++, in++, out++)
5236 n = LittleLong(in->planeindex);
5237 if (n < 0 || n >= loadmodel->brush.num_planes)
5238 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5239 out->plane = loadmodel->brush.data_planes + n;
5240 n = LittleLong(in->textureindex);
5241 if (n < 0 || n >= loadmodel->num_textures)
5242 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
5243 out->texture = loadmodel->data_textures + n;
5247 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
5251 int i, j, n, c, count, maxplanes, q3surfaceflags;
5252 colplanef_t *planes;
5254 in = (q3dbrush_t *)(mod_base + l->fileofs);
5255 if (l->filelen % sizeof(*in))
5256 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
5257 count = l->filelen / sizeof(*in);
5258 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5260 loadmodel->brush.data_brushes = out;
5261 loadmodel->brush.num_brushes = count;
5266 for (i = 0;i < count;i++, in++, out++)
5268 n = LittleLong(in->firstbrushside);
5269 c = LittleLong(in->numbrushsides);
5270 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
5271 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
5272 out->firstbrushside = loadmodel->brush.data_brushsides + n;
5273 out->numbrushsides = c;
5274 n = LittleLong(in->textureindex);
5275 if (n < 0 || n >= loadmodel->num_textures)
5276 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
5277 out->texture = loadmodel->data_textures + n;
5279 // make a list of mplane_t structs to construct a colbrush from
5280 if (maxplanes < out->numbrushsides)
5282 maxplanes = out->numbrushsides;
5285 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
5288 for (j = 0;j < out->numbrushsides;j++)
5290 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
5291 planes[j].dist = out->firstbrushside[j].plane->dist;
5292 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
5293 planes[j].texture = out->firstbrushside[j].texture;
5294 q3surfaceflags |= planes[j].q3surfaceflags;
5296 // make the colbrush from the planes
5297 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
5299 // this whole loop can take a while (e.g. on redstarrepublic4)
5300 CL_KeepaliveMessage(false);
5306 static void Mod_Q3BSP_LoadEffects(lump_t *l)
5312 in = (q3deffect_t *)(mod_base + l->fileofs);
5313 if (l->filelen % sizeof(*in))
5314 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
5315 count = l->filelen / sizeof(*in);
5316 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5318 loadmodel->brushq3.data_effects = out;
5319 loadmodel->brushq3.num_effects = count;
5321 for (i = 0;i < count;i++, in++, out++)
5323 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
5324 n = LittleLong(in->brushindex);
5325 if (n >= loadmodel->brush.num_brushes)
5327 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
5330 out->brushindex = n;
5331 out->unknown = LittleLong(in->unknown);
5335 static void Mod_Q3BSP_LoadVertices(lump_t *l)
5340 in = (q3dvertex_t *)(mod_base + l->fileofs);
5341 if (l->filelen % sizeof(*in))
5342 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
5343 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
5344 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
5345 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
5346 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
5347 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
5348 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
5350 for (i = 0;i < count;i++, in++)
5352 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
5353 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
5354 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
5355 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
5356 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
5357 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
5358 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
5359 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
5360 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
5361 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
5362 // svector/tvector are calculated later in face loading
5363 if(mod_q3bsp_sRGBlightmaps.integer)
5365 // if lightmaps are sRGB, vertex colors are sRGB too, so we need to linearize them
5366 // note: when this is in use, lightmap color 128 is no longer neutral, but "sRGB half power" is
5367 // working like this may be odd, but matches q3map2 -gamma 2.2
5368 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5370 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
5371 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
5372 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
5373 // we fix the brightness consistently via lightmapscale
5377 loadmodel->brushq3.data_color4f[i * 4 + 0] = Image_LinearFloatFromsRGB(in->color4ub[0]);
5378 loadmodel->brushq3.data_color4f[i * 4 + 1] = Image_LinearFloatFromsRGB(in->color4ub[1]);
5379 loadmodel->brushq3.data_color4f[i * 4 + 2] = Image_LinearFloatFromsRGB(in->color4ub[2]);
5384 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5386 loadmodel->brushq3.data_color4f[i * 4 + 0] = Image_sRGBFloatFromLinear_Lightmap(in->color4ub[0]);
5387 loadmodel->brushq3.data_color4f[i * 4 + 1] = Image_sRGBFloatFromLinear_Lightmap(in->color4ub[1]);
5388 loadmodel->brushq3.data_color4f[i * 4 + 2] = Image_sRGBFloatFromLinear_Lightmap(in->color4ub[2]);
5392 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
5393 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
5394 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
5397 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
5398 if(in->color4ub[0] != 255 || in->color4ub[1] != 255 || in->color4ub[2] != 255)
5399 loadmodel->lit = true;
5403 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
5409 in = (int *)(mod_base + l->fileofs);
5410 if (l->filelen % sizeof(int[3]))
5411 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
5412 count = l->filelen / sizeof(*in);
5414 if(!loadmodel->brushq3.num_vertices)
5417 Con_Printf("Mod_Q3BSP_LoadTriangles: %s has triangles but no vertexes, broken compiler, ignoring problem\n", loadmodel->name);
5418 loadmodel->brushq3.num_triangles = 0;
5422 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5423 loadmodel->brushq3.num_triangles = count / 3;
5424 loadmodel->brushq3.data_element3i = out;
5426 for (i = 0;i < count;i++, in++, out++)
5428 *out = LittleLong(*in);
5429 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
5431 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
5437 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
5439 q3dlightmap_t *input_pointer;
5457 int mergedrowsxcolumns;
5462 unsigned char *mergedpixels;
5463 unsigned char *mergeddeluxepixels;
5464 unsigned char *mergebuf;
5465 char mapname[MAX_QPATH];
5467 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
5470 // defaults for q3bsp
5477 loadmodel->brushq3.lightmapsize = 128;
5479 if (cls.state == ca_dedicated)
5482 if(mod_q3bsp_nolightmaps.integer)
5488 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
5489 if (developer_loading.integer)
5490 Con_Printf("Using internal lightmaps\n");
5491 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
5492 if (l->filelen % sizeof(*input_pointer))
5493 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
5494 count = l->filelen / sizeof(*input_pointer);
5495 for(i = 0; i < count; ++i)
5496 inpixels[i] = input_pointer[i].rgb;
5500 // no internal lightmaps
5501 // try external lightmaps
5502 if (developer_loading.integer)
5503 Con_Printf("Using external lightmaps\n");
5504 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
5505 inpixels[0] = loadimagepixelsbgra(va(vabuf, sizeof(vabuf), "%s/lm_%04d", mapname, 0), false, false, false, NULL);
5509 // using EXTERNAL lightmaps instead
5510 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
5512 Mem_Free(inpixels[0]);
5513 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
5523 for(count = 1; ; ++count)
5525 inpixels[count] = loadimagepixelsbgra(va(vabuf, sizeof(vabuf), "%s/lm_%04d", mapname, count), false, false, false, NULL);
5526 if(!inpixels[count])
5527 break; // we got all of them
5528 if(image_width != size || image_height != size)
5530 Mem_Free(inpixels[count]);
5531 inpixels[count] = NULL;
5532 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);
5538 loadmodel->brushq3.lightmapsize = size;
5539 loadmodel->brushq3.num_originallightmaps = count;
5541 // now check the surfaces to see if any of them index an odd numbered
5542 // lightmap, if so this is not a deluxemapped bsp file
5544 // also check what lightmaps are actually used, because q3map2 sometimes
5545 // (always?) makes an unused one at the end, which
5546 // q3map2 sometimes (or always?) makes a second blank lightmap for no
5547 // reason when only one lightmap is used, which can throw off the
5548 // deluxemapping detection method, so check 2-lightmap bsp's specifically
5549 // to see if the second lightmap is blank, if so it is not deluxemapped.
5550 // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
5551 // in Mod_Q3BSP_LoadEntities was failed
5552 if (!loadmodel->brushq3.deluxemapping)
5554 loadmodel->brushq3.deluxemapping = !(count & 1);
5555 loadmodel->brushq3.deluxemapping_modelspace = true;
5557 if (loadmodel->brushq3.deluxemapping)
5559 int facecount = faceslump->filelen / sizeof(q3dface_t);
5560 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
5561 for (i = 0;i < facecount;i++)
5563 j = LittleLong(faces[i].lightmapindex);
5566 endlightmap = max(endlightmap, j + 1);
5567 if ((j & 1) || j + 1 >= count)
5569 loadmodel->brushq3.deluxemapping = false;
5576 // q3map2 sometimes (or always?) makes a second blank lightmap for no
5577 // reason when only one lightmap is used, which can throw off the
5578 // deluxemapping detection method, so check 2-lightmap bsp's specifically
5579 // to see if the second lightmap is blank, if so it is not deluxemapped.
5581 // further research has shown q3map2 sometimes creates a deluxemap and two
5582 // blank lightmaps, which must be handled properly as well
5583 if (endlightmap == 1 && count > 1)
5586 for (i = 0;i < size*size;i++)
5588 if (c[bytesperpixel*i + rgbmap[0]])
5590 if (c[bytesperpixel*i + rgbmap[1]])
5592 if (c[bytesperpixel*i + rgbmap[2]])
5597 // all pixels in the unused lightmap were black...
5598 loadmodel->brushq3.deluxemapping = false;
5603 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
5605 // figure out what the most reasonable merge power is within limits
5607 // find the appropriate NxN dimensions to merge to, to avoid wasted space
5608 realcount = count >> (int)loadmodel->brushq3.deluxemapping;
5610 // figure out how big the merged texture has to be
5611 mergegoal = 128<<bound(0, mod_q3bsp_lightmapmergepower.integer, 6);
5612 mergegoal = bound(size, mergegoal, (int)vid.maxtexturesize_2d);
5613 while (mergegoal > size && mergegoal * mergegoal / 4 >= size * size * realcount)
5615 mergedwidth = mergegoal;
5616 mergedheight = mergegoal;
5617 // choose non-square size (2x1 aspect) if only half the space is used;
5618 // this really only happens when the entire set fits in one texture, if
5619 // there are multiple textures, we don't worry about shrinking the last
5620 // one to fit, because the driver prefers the same texture size on
5621 // consecutive draw calls...
5622 if (mergedwidth * mergedheight / 2 >= size*size*realcount)
5625 loadmodel->brushq3.num_lightmapmergedwidthpower = 0;
5626 loadmodel->brushq3.num_lightmapmergedheightpower = 0;
5627 while (mergedwidth > size<<loadmodel->brushq3.num_lightmapmergedwidthpower)
5628 loadmodel->brushq3.num_lightmapmergedwidthpower++;
5629 while (mergedheight > size<<loadmodel->brushq3.num_lightmapmergedheightpower)
5630 loadmodel->brushq3.num_lightmapmergedheightpower++;
5631 loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower = loadmodel->brushq3.num_lightmapmergedwidthpower + loadmodel->brushq3.num_lightmapmergedheightpower + (loadmodel->brushq3.deluxemapping ? 1 : 0);
5633 powerx = loadmodel->brushq3.num_lightmapmergedwidthpower;
5634 powery = loadmodel->brushq3.num_lightmapmergedheightpower;
5635 powerxy = powerx+powery;
5636 powerdxy = loadmodel->brushq3.deluxemapping + powerxy;
5638 mergedcolumns = 1 << powerx;
5639 mergedrows = 1 << powery;
5640 mergedrowsxcolumns = 1 << powerxy;
5642 loadmodel->brushq3.num_mergedlightmaps = (realcount + (1 << powerxy) - 1) >> powerxy;
5643 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
5644 if (loadmodel->brushq3.deluxemapping)
5645 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
5647 // allocate a texture pool if we need it
5648 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
5649 loadmodel->texturepool = R_AllocTexturePool();
5651 mergedpixels = (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4);
5652 mergeddeluxepixels = loadmodel->brushq3.deluxemapping ? (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4) : NULL;
5653 for (i = 0;i < count;i++)
5655 // figure out which merged lightmap texture this fits into
5656 realindex = i >> (int)loadmodel->brushq3.deluxemapping;
5657 lightmapindex = i >> powerdxy;
5659 // choose the destination address
5660 mergebuf = (loadmodel->brushq3.deluxemapping && (i & 1)) ? mergeddeluxepixels : mergedpixels;
5661 mergebuf += 4 * (realindex & (mergedcolumns-1))*size + 4 * ((realindex >> powerx) & (mergedrows-1))*mergedwidth*size;
5662 if ((i & 1) == 0 || !loadmodel->brushq3.deluxemapping)
5663 Con_DPrintf("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);
5665 // convert pixels from RGB or BGRA while copying them into the destination rectangle
5666 for (j = 0;j < size;j++)
5667 for (k = 0;k < size;k++)
5669 mergebuf[(j*mergedwidth+k)*4+0] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[0]];
5670 mergebuf[(j*mergedwidth+k)*4+1] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[1]];
5671 mergebuf[(j*mergedwidth+k)*4+2] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[2]];
5672 mergebuf[(j*mergedwidth+k)*4+3] = 255;
5675 // upload texture if this was the last tile being written to the texture
5676 if (((realindex + 1) & (mergedrowsxcolumns - 1)) == 0 || (realindex + 1) == realcount)
5678 if (loadmodel->brushq3.deluxemapping && (i & 1))
5679 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va(vabuf, sizeof(vabuf), "deluxemap%04i", lightmapindex), mergedwidth, mergedheight, mergeddeluxepixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
5682 if(mod_q3bsp_sRGBlightmaps.integer)
5685 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5687 t = TEXTYPE_BGRA; // in stupid fallback mode, we upload lightmaps in sRGB form and just fix their brightness
5688 // we fix the brightness consistently via lightmapscale
5691 t = TEXTYPE_SRGB_BGRA; // normally, we upload lightmaps in sRGB form (possibly downconverted to linear)
5692 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va(vabuf, sizeof(vabuf), "lightmap%04i", lightmapindex), mergedwidth, mergedheight, mergedpixels, t, TEXF_FORCELINEAR | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
5696 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5697 Image_MakesRGBColorsFromLinear_Lightmap(mergedpixels, mergedpixels, mergedwidth * mergedheight);
5698 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va(vabuf, sizeof(vabuf), "lightmap%04i", lightmapindex), mergedwidth, mergedheight, mergedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
5704 if (mergeddeluxepixels)
5705 Mem_Free(mergeddeluxepixels);
5706 Mem_Free(mergedpixels);
5709 for(i = 0; i < count; ++i)
5710 Mem_Free(inpixels[i]);
5714 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
5719 *collisionstride = stride;
5722 cnt = (num_triangles + stride - 1) / stride;
5723 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
5724 for(j = 0; j < cnt; ++j)
5726 mins = &((*collisionbbox6f)[6 * j + 0]);
5727 maxs = &((*collisionbbox6f)[6 * j + 3]);
5728 for(k = 0; k < stride; ++k)
5730 tri = j * stride + k;
5731 if(tri >= num_triangles)
5733 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
5734 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
5735 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
5736 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
5737 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
5738 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
5739 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
5740 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
5741 if(vert[0] < mins[0]) mins[0] = vert[0];
5742 if(vert[1] < mins[1]) mins[1] = vert[1];
5743 if(vert[2] < mins[2]) mins[2] = vert[2];
5744 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5745 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5746 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5747 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
5748 if(vert[0] < mins[0]) mins[0] = vert[0];
5749 if(vert[1] < mins[1]) mins[1] = vert[1];
5750 if(vert[2] < mins[2]) mins[2] = vert[2];
5751 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5752 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5753 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5758 *collisionbbox6f = NULL;
5761 typedef struct patchtess_s
5765 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
5768 float *originalvertex3f;
5771 #define PATCHTESS_SAME_LODGROUP(a,b) \
5773 (a).lodgroup[0] == (b).lodgroup[0] && \
5774 (a).lodgroup[1] == (b).lodgroup[1] && \
5775 (a).lodgroup[2] == (b).lodgroup[2] && \
5776 (a).lodgroup[3] == (b).lodgroup[3] && \
5777 (a).lodgroup[4] == (b).lodgroup[4] && \
5778 (a).lodgroup[5] == (b).lodgroup[5] \
5781 static void Mod_Q3BSP_LoadFaces(lump_t *l)
5783 q3dface_t *in, *oldin;
5784 msurface_t *out, *oldout;
5785 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;
5786 float lightmaptcbase[2], lightmaptcscale[2];
5787 //int *originalelement3i;
5788 //int *originalneighbor3i;
5789 float *originalvertex3f;
5790 //float *originalsvector3f;
5791 //float *originaltvector3f;
5792 float *originalnormal3f;
5793 float *originalcolor4f;
5794 float *originaltexcoordtexture2f;
5795 float *originaltexcoordlightmap2f;
5796 float *surfacecollisionvertex3f;
5797 int *surfacecollisionelement3i;
5799 patchtess_t *patchtess = NULL;
5800 int patchtesscount = 0;
5803 in = (q3dface_t *)(mod_base + l->fileofs);
5804 if (l->filelen % sizeof(*in))
5805 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
5806 count = l->filelen / sizeof(*in);
5807 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5809 loadmodel->data_surfaces = out;
5810 loadmodel->num_surfaces = count;
5813 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
5821 for (;i < count;i++, in++, out++)
5823 // check face type first
5824 type = LittleLong(in->type);
5825 if (type != Q3FACETYPE_FLAT
5826 && type != Q3FACETYPE_PATCH
5827 && type != Q3FACETYPE_MESH
5828 && type != Q3FACETYPE_FLARE)
5830 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
5834 n = LittleLong(in->textureindex);
5835 if (n < 0 || n >= loadmodel->num_textures)
5837 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
5840 out->texture = loadmodel->data_textures + n;
5841 n = LittleLong(in->effectindex);
5842 if (n < -1 || n >= loadmodel->brushq3.num_effects)
5844 if (developer_extra.integer)
5845 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
5851 out->effect = loadmodel->brushq3.data_effects + n;
5853 if (cls.state != ca_dedicated)
5855 out->lightmaptexture = NULL;
5856 out->deluxemaptexture = r_texture_blanknormalmap;
5857 n = LittleLong(in->lightmapindex);
5860 else if (n >= loadmodel->brushq3.num_originallightmaps)
5862 if(loadmodel->brushq3.num_originallightmaps != 0)
5863 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
5868 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5869 if (loadmodel->brushq3.deluxemapping)
5870 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5871 loadmodel->lit = true;
5875 firstvertex = LittleLong(in->firstvertex);
5876 numvertices = LittleLong(in->numvertices);
5877 firstelement = LittleLong(in->firstelement);
5878 numtriangles = LittleLong(in->numelements) / 3;
5879 if (numtriangles * 3 != LittleLong(in->numelements))
5881 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));
5884 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
5886 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);
5889 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
5891 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);
5896 case Q3FACETYPE_FLAT:
5897 case Q3FACETYPE_MESH:
5898 // no processing necessary
5900 case Q3FACETYPE_PATCH:
5901 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5902 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5903 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))
5905 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
5908 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5910 // convert patch to Q3FACETYPE_MESH
5911 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5912 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5913 // bound to user settings
5914 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
5915 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
5916 // bound to sanity settings
5917 xtess = bound(0, xtess, 1024);
5918 ytess = bound(0, ytess, 1024);
5920 // lower quality collision patches! Same procedure as before, but different cvars
5921 // convert patch to Q3FACETYPE_MESH
5922 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5923 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5924 // bound to user settings
5925 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
5926 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
5927 // bound to sanity settings
5928 cxtess = bound(0, cxtess, 1024);
5929 cytess = bound(0, cytess, 1024);
5931 // store it for the LOD grouping step
5932 patchtess[patchtesscount].info.xsize = patchsize[0];
5933 patchtess[patchtesscount].info.ysize = patchsize[1];
5934 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
5935 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
5936 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
5937 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
5939 patchtess[patchtesscount].surface_id = i;
5940 patchtess[patchtesscount].lodgroup[0] = LittleFloat(in->specific.patch.mins[0]);
5941 patchtess[patchtesscount].lodgroup[1] = LittleFloat(in->specific.patch.mins[1]);
5942 patchtess[patchtesscount].lodgroup[2] = LittleFloat(in->specific.patch.mins[2]);
5943 patchtess[patchtesscount].lodgroup[3] = LittleFloat(in->specific.patch.maxs[0]);
5944 patchtess[patchtesscount].lodgroup[4] = LittleFloat(in->specific.patch.maxs[1]);
5945 patchtess[patchtesscount].lodgroup[5] = LittleFloat(in->specific.patch.maxs[2]);
5946 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
5949 case Q3FACETYPE_FLARE:
5950 if (developer_extra.integer)
5951 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
5955 out->num_vertices = numvertices;
5956 out->num_triangles = numtriangles;
5957 meshvertices += out->num_vertices;
5958 meshtriangles += out->num_triangles;
5961 // Fix patches tesselations so that they make no seams
5965 for(i = 0; i < patchtesscount; ++i)
5967 for(j = i+1; j < patchtesscount; ++j)
5969 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
5972 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
5979 // Calculate resulting number of triangles
5980 collisionvertices = 0;
5981 collisiontriangles = 0;
5982 for(i = 0; i < patchtesscount; ++i)
5984 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
5985 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
5986 numvertices = finalwidth * finalheight;
5987 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5989 oldout[patchtess[i].surface_id].num_vertices = numvertices;
5990 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
5991 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
5992 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
5994 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_COLLISION].xtess);
5995 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_COLLISION].ytess);
5996 numvertices = finalwidth * finalheight;
5997 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5999 oldout[patchtess[i].surface_id].num_collisionvertices = numvertices;
6000 oldout[patchtess[i].surface_id].num_collisiontriangles = numtriangles;
6001 collisionvertices += oldout[patchtess[i].surface_id].num_collisionvertices;
6002 collisiontriangles += oldout[patchtess[i].surface_id].num_collisiontriangles;
6008 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
6009 if (collisiontriangles)
6011 loadmodel->brush.data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, collisionvertices * sizeof(float[3]));
6012 loadmodel->brush.data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, collisiontriangles * sizeof(int[3]));
6016 collisionvertices = 0;
6017 collisiontriangles = 0;
6018 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
6020 if (out->num_vertices < 3 || out->num_triangles < 1)
6023 type = LittleLong(in->type);
6024 firstvertex = LittleLong(in->firstvertex);
6025 firstelement = LittleLong(in->firstelement);
6026 out->num_firstvertex = meshvertices;
6027 out->num_firsttriangle = meshtriangles;
6028 out->num_firstcollisiontriangle = collisiontriangles;
6031 case Q3FACETYPE_FLAT:
6032 case Q3FACETYPE_MESH:
6033 // no processing necessary, except for lightmap merging
6034 for (j = 0;j < out->num_vertices;j++)
6036 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
6037 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
6038 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
6039 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
6040 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
6041 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
6042 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
6043 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
6044 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
6045 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
6046 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
6047 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
6048 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
6049 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
6051 for (j = 0;j < out->num_triangles*3;j++)
6052 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
6054 case Q3FACETYPE_PATCH:
6055 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
6056 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
6057 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
6058 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
6059 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
6060 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
6061 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
6063 xtess = ytess = cxtess = cytess = -1;
6064 for(j = 0; j < patchtesscount; ++j)
6065 if(patchtess[j].surface_id == i)
6067 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
6068 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
6069 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
6070 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
6075 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
6076 xtess = ytess = cxtess = cytess = 0;
6079 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
6080 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
6081 finalvertices = finalwidth * finalheight;
6082 oldnumtriangles = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
6083 type = Q3FACETYPE_MESH;
6084 // generate geometry
6085 // (note: normals are skipped because they get recalculated)
6086 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
6087 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
6088 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
6089 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
6090 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
6091 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
6093 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);
6095 if (developer_extra.integer)
6097 if (out->num_triangles < finaltriangles)
6098 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);
6100 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);
6102 // q3map does not put in collision brushes for curves... ugh
6103 // build the lower quality collision geometry
6104 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
6105 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
6106 finalvertices = finalwidth * finalheight;
6107 oldnumtriangles2 = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
6109 // legacy collision geometry implementation
6110 out->deprecatedq3data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
6111 out->deprecatedq3data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
6112 out->num_collisionvertices = finalvertices;
6113 out->num_collisiontriangles = finaltriangles;
6114 Q3PatchTesselateFloat(3, sizeof(float[3]), out->deprecatedq3data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
6115 Q3PatchTriangleElements(out->deprecatedq3data_collisionelement3i, finalwidth, finalheight, 0);
6117 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
6118 Mod_SnapVertices(3, finalvertices, out->deprecatedq3data_collisionvertex3f, 1);
6120 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionvertex3f);
6122 // now optimize the collision mesh by finding triangle bboxes...
6123 Mod_Q3BSP_BuildBBoxes(out->deprecatedq3data_collisionelement3i, out->num_collisiontriangles, out->deprecatedq3data_collisionvertex3f, &out->deprecatedq3data_collisionbbox6f, &out->deprecatedq3num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
6124 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);
6126 // store collision geometry for BIH collision tree
6127 surfacecollisionvertex3f = loadmodel->brush.data_collisionvertex3f + collisionvertices * 3;
6128 surfacecollisionelement3i = loadmodel->brush.data_collisionelement3i + collisiontriangles * 3;
6129 Q3PatchTesselateFloat(3, sizeof(float[3]), surfacecollisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
6130 Q3PatchTriangleElements(surfacecollisionelement3i, finalwidth, finalheight, collisionvertices);
6131 Mod_SnapVertices(3, finalvertices, surfacecollisionvertex3f, 1);
6133 // remove this once the legacy code is removed
6135 int nc = out->num_collisiontriangles;
6137 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, surfacecollisionelement3i, surfacecollisionelement3i, loadmodel->brush.data_collisionvertex3f);
6139 if(nc != out->num_collisiontriangles)
6141 Con_Printf("number of collision triangles differs between BIH and BSP. FAIL.\n");
6146 if (developer_extra.integer)
6147 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);
6149 collisionvertices += finalvertices;
6150 collisiontriangles += out->num_collisiontriangles;
6155 meshvertices += out->num_vertices;
6156 meshtriangles += out->num_triangles;
6157 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
6158 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)
6160 if (invalidelements)
6162 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);
6163 for (j = 0;j < out->num_triangles * 3;j++)
6165 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
6166 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)
6167 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
6171 // calculate a bounding box
6172 VectorClear(out->mins);
6173 VectorClear(out->maxs);
6174 if (out->num_vertices)
6176 if (cls.state != ca_dedicated && out->lightmaptexture)
6178 // figure out which part of the merged lightmap this fits into
6179 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
6180 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
6181 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
6182 lightmapindex &= mergewidth * mergeheight - 1;
6183 lightmaptcscale[0] = 1.0f / mergewidth;
6184 lightmaptcscale[1] = 1.0f / mergeheight;
6185 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
6186 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
6187 // modify the lightmap texcoords to match this region of the merged lightmap
6188 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
6190 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
6191 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
6194 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
6195 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
6196 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
6198 out->mins[0] = min(out->mins[0], v[0]);
6199 out->maxs[0] = max(out->maxs[0], v[0]);
6200 out->mins[1] = min(out->mins[1], v[1]);
6201 out->maxs[1] = max(out->maxs[1], v[1]);
6202 out->mins[2] = min(out->mins[2], v[2]);
6203 out->maxs[2] = max(out->maxs[2], v[2]);
6205 out->mins[0] -= 1.0f;
6206 out->mins[1] -= 1.0f;
6207 out->mins[2] -= 1.0f;
6208 out->maxs[0] += 1.0f;
6209 out->maxs[1] += 1.0f;
6210 out->maxs[2] += 1.0f;
6212 // set lightmap styles for consistency with q1bsp
6213 //out->lightmapinfo->styles[0] = 0;
6214 //out->lightmapinfo->styles[1] = 255;
6215 //out->lightmapinfo->styles[2] = 255;
6216 //out->lightmapinfo->styles[3] = 255;
6221 for (;i < count;i++, out++)
6223 if(out->num_vertices && out->num_triangles)
6225 if(out->num_vertices == 0)
6227 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no vertices, ignoring\n", i, out->texture ? out->texture->name : "(none)");
6228 if(out->num_triangles == 0)
6229 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no triangles, ignoring\n", i, out->texture ? out->texture->name : "(none)");
6231 else if(out->num_triangles == 0)
6232 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)",
6233 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[0 * 3 + 0],
6234 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[1 * 3 + 0],
6235 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[2 * 3 + 0]);
6238 // for per pixel lighting
6239 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);
6241 // generate ushort elements array if possible
6242 if (loadmodel->surfmesh.data_element3s)
6243 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
6244 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
6246 // free the no longer needed vertex data
6247 loadmodel->brushq3.num_vertices = 0;
6248 if (loadmodel->brushq3.data_vertex3f)
6249 Mem_Free(loadmodel->brushq3.data_vertex3f);
6250 loadmodel->brushq3.data_vertex3f = NULL;
6251 loadmodel->brushq3.data_normal3f = NULL;
6252 loadmodel->brushq3.data_texcoordtexture2f = NULL;
6253 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
6254 loadmodel->brushq3.data_color4f = NULL;
6255 // free the no longer needed triangle data
6256 loadmodel->brushq3.num_triangles = 0;
6257 if (loadmodel->brushq3.data_element3i)
6258 Mem_Free(loadmodel->brushq3.data_element3i);
6259 loadmodel->brushq3.data_element3i = NULL;
6262 Mem_Free(patchtess);
6265 static void Mod_Q3BSP_LoadModels(lump_t *l)
6269 int i, j, n, c, count;
6271 in = (q3dmodel_t *)(mod_base + l->fileofs);
6272 if (l->filelen % sizeof(*in))
6273 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
6274 count = l->filelen / sizeof(*in);
6275 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6277 loadmodel->brushq3.data_models = out;
6278 loadmodel->brushq3.num_models = count;
6280 for (i = 0;i < count;i++, in++, out++)
6282 for (j = 0;j < 3;j++)
6284 out->mins[j] = LittleFloat(in->mins[j]);
6285 out->maxs[j] = LittleFloat(in->maxs[j]);
6287 n = LittleLong(in->firstface);
6288 c = LittleLong(in->numfaces);
6289 if (n < 0 || n + c > loadmodel->num_surfaces)
6290 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
6293 n = LittleLong(in->firstbrush);
6294 c = LittleLong(in->numbrushes);
6295 if (n < 0 || n + c > loadmodel->brush.num_brushes)
6296 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
6297 out->firstbrush = n;
6298 out->numbrushes = c;
6302 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
6308 in = (int *)(mod_base + l->fileofs);
6309 if (l->filelen % sizeof(*in))
6310 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
6311 count = l->filelen / sizeof(*in);
6312 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6314 loadmodel->brush.data_leafbrushes = out;
6315 loadmodel->brush.num_leafbrushes = count;
6317 for (i = 0;i < count;i++, in++, out++)
6319 n = LittleLong(*in);
6320 if (n < 0 || n >= loadmodel->brush.num_brushes)
6321 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
6326 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
6332 in = (int *)(mod_base + l->fileofs);
6333 if (l->filelen % sizeof(*in))
6334 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
6335 count = l->filelen / sizeof(*in);
6336 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6338 loadmodel->brush.data_leafsurfaces = out;
6339 loadmodel->brush.num_leafsurfaces = count;
6341 for (i = 0;i < count;i++, in++, out++)
6343 n = LittleLong(*in);
6344 if (n < 0 || n >= loadmodel->num_surfaces)
6345 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
6350 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
6354 int i, j, n, c, count;
6356 in = (q3dleaf_t *)(mod_base + l->fileofs);
6357 if (l->filelen % sizeof(*in))
6358 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
6359 count = l->filelen / sizeof(*in);
6360 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6362 loadmodel->brush.data_leafs = out;
6363 loadmodel->brush.num_leafs = count;
6365 for (i = 0;i < count;i++, in++, out++)
6369 out->clusterindex = LittleLong(in->clusterindex);
6370 out->areaindex = LittleLong(in->areaindex);
6371 for (j = 0;j < 3;j++)
6373 // yes the mins/maxs are ints
6374 out->mins[j] = LittleLong(in->mins[j]) - 1;
6375 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
6377 n = LittleLong(in->firstleafface);
6378 c = LittleLong(in->numleaffaces);
6379 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
6380 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
6381 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
6382 out->numleafsurfaces = c;
6383 n = LittleLong(in->firstleafbrush);
6384 c = LittleLong(in->numleafbrushes);
6385 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
6386 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
6387 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
6388 out->numleafbrushes = c;
6392 static void Mod_Q3BSP_LoadNodes(lump_t *l)
6398 in = (q3dnode_t *)(mod_base + l->fileofs);
6399 if (l->filelen % sizeof(*in))
6400 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
6401 count = l->filelen / sizeof(*in);
6403 Host_Error("Mod_Q3BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
6404 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6406 loadmodel->brush.data_nodes = out;
6407 loadmodel->brush.num_nodes = count;
6409 for (i = 0;i < count;i++, in++, out++)
6412 n = LittleLong(in->planeindex);
6413 if (n < 0 || n >= loadmodel->brush.num_planes)
6414 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
6415 out->plane = loadmodel->brush.data_planes + n;
6416 for (j = 0;j < 2;j++)
6418 n = LittleLong(in->childrenindex[j]);
6421 if (n >= loadmodel->brush.num_nodes)
6422 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
6423 out->children[j] = loadmodel->brush.data_nodes + n;
6428 if (n >= loadmodel->brush.num_leafs)
6429 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
6430 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
6433 for (j = 0;j < 3;j++)
6435 // yes the mins/maxs are ints
6436 out->mins[j] = LittleLong(in->mins[j]) - 1;
6437 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
6441 // set the parent pointers
6442 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
6445 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
6448 q3dlightgrid_t *out;
6452 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
6453 if (l->filelen % sizeof(*in))
6454 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
6455 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
6456 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
6457 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
6458 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
6459 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
6460 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
6461 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
6462 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
6463 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
6464 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
6465 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
6466 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
6467 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
6468 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]);
6469 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]);
6471 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
6474 if (l->filelen < count * (int)sizeof(*in))
6476 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]);
6477 return; // ignore the grid if we cannot understand it
6479 if (l->filelen != count * (int)sizeof(*in))
6480 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
6481 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6482 loadmodel->brushq3.data_lightgrid = out;
6483 loadmodel->brushq3.num_lightgrid = count;
6484 // no swapping or validation necessary
6485 memcpy(out, in, count * (int)sizeof(*out));
6487 if(mod_q3bsp_sRGBlightmaps.integer)
6489 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
6491 // we fix the brightness consistently via lightmapscale
6495 for(i = 0; i < count; ++i)
6497 out[i].ambientrgb[0] = floor(Image_LinearFloatFromsRGB(out[i].ambientrgb[0]) * 255.0f + 0.5f);
6498 out[i].ambientrgb[1] = floor(Image_LinearFloatFromsRGB(out[i].ambientrgb[1]) * 255.0f + 0.5f);
6499 out[i].ambientrgb[2] = floor(Image_LinearFloatFromsRGB(out[i].ambientrgb[2]) * 255.0f + 0.5f);
6500 out[i].diffusergb[0] = floor(Image_LinearFloatFromsRGB(out[i].diffusergb[0]) * 255.0f + 0.5f);
6501 out[i].diffusergb[1] = floor(Image_LinearFloatFromsRGB(out[i].diffusergb[1]) * 255.0f + 0.5f);
6502 out[i].diffusergb[2] = floor(Image_LinearFloatFromsRGB(out[i].diffusergb[2]) * 255.0f + 0.5f);
6508 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
6510 for(i = 0; i < count; ++i)
6512 out[i].ambientrgb[0] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].ambientrgb[0]) * 255.0f + 0.5f);
6513 out[i].ambientrgb[1] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].ambientrgb[1]) * 255.0f + 0.5f);
6514 out[i].ambientrgb[2] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].ambientrgb[2]) * 255.0f + 0.5f);
6515 out[i].diffusergb[0] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].diffusergb[0]) * 255.0f + 0.5f);
6516 out[i].diffusergb[1] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].diffusergb[1]) * 255.0f + 0.5f);
6517 out[i].diffusergb[2] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].diffusergb[2]) * 255.0f + 0.5f);
6528 static void Mod_Q3BSP_LoadPVS(lump_t *l)
6533 if (l->filelen == 0)
6536 // unvised maps often have cluster indices even without pvs, so check
6537 // leafs to find real number of clusters
6538 loadmodel->brush.num_pvsclusters = 1;
6539 for (i = 0;i < loadmodel->brush.num_leafs;i++)
6540 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
6543 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
6544 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
6545 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
6546 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
6550 in = (q3dpvs_t *)(mod_base + l->fileofs);
6552 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
6554 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
6555 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
6556 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
6557 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
6558 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
6559 if (l->filelen < totalchains + (int)sizeof(*in))
6560 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);
6562 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
6563 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
6566 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
6568 int i, j, k, index[3];
6569 float transformed[3], blend1, blend2, blend, stylescale = 1;
6570 q3dlightgrid_t *a, *s;
6572 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
6573 switch(vid.renderpath)
6575 case RENDERPATH_GL20:
6576 case RENDERPATH_D3D9:
6577 case RENDERPATH_D3D10:
6578 case RENDERPATH_D3D11:
6579 case RENDERPATH_SOFT:
6580 case RENDERPATH_GLES2:
6581 // LordHavoc: FIXME: is this true?
6582 stylescale = 1; // added while render
6584 case RENDERPATH_GL11:
6585 case RENDERPATH_GL13:
6586 case RENDERPATH_GLES1:
6587 stylescale = r_refdef.scene.rtlightstylevalue[0];
6591 if (!model->brushq3.num_lightgrid)
6593 ambientcolor[0] = stylescale;
6594 ambientcolor[1] = stylescale;
6595 ambientcolor[2] = stylescale;
6599 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
6600 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
6601 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
6602 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
6603 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
6604 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
6605 index[0] = (int)floor(transformed[0]);
6606 index[1] = (int)floor(transformed[1]);
6607 index[2] = (int)floor(transformed[2]);
6608 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
6610 // now lerp the values
6611 VectorClear(diffusenormal);
6612 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
6613 for (k = 0;k < 2;k++)
6615 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
6616 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
6618 for (j = 0;j < 2;j++)
6620 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
6621 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
6623 for (i = 0;i < 2;i++)
6625 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
6626 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
6628 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
6629 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
6630 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
6631 // this uses the mod_md3_sin table because the values are
6632 // already in the 0-255 range, the 64+ bias fetches a cosine
6633 // instead of a sine value
6634 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
6635 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
6636 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
6637 //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)));
6642 // normalize the light direction before turning
6643 VectorNormalize(diffusenormal);
6644 //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]);
6647 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
6650 double midf, mid[3];
6656 // find the point distances
6657 mplane_t *plane = node->plane;
6658 if (plane->type < 3)
6660 t1 = p1[plane->type] - plane->dist;
6661 t2 = p2[plane->type] - plane->dist;
6665 t1 = DotProduct (plane->normal, p1) - plane->dist;
6666 t2 = DotProduct (plane->normal, p2) - plane->dist;
6673 node = node->children[1];
6682 node = node->children[0];
6688 midf = t1 / (t1 - t2);
6689 VectorLerp(p1, midf, p2, mid);
6691 // recurse both sides, front side first
6692 // return 2 if empty is followed by solid (hit something)
6693 // do not return 2 if both are solid or both empty,
6694 // or if start is solid and end is empty
6695 // as these degenerate cases usually indicate the eye is in solid and
6696 // should see the target point anyway
6697 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
6700 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
6705 return ((mleaf_t *)node)->clusterindex < 0;
6708 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
6710 if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
6713 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
6714 return trace.fraction == 1;
6718 double tracestart[3], traceend[3];
6719 VectorCopy(start, tracestart);
6720 VectorCopy(end, traceend);
6721 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
6725 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)
6728 const bih_leaf_t *leaf;
6729 const bih_node_t *node;
6730 const colbrushf_t *brush;
6733 int nodestackpos = 0;
6734 int nodestack[1024];
6736 memset(trace, 0, sizeof(*trace));
6737 trace->fraction = 1;
6738 trace->hitsupercontentsmask = hitsupercontentsmask;
6740 bih = &model->collision_bih;
6744 nodenum = bih->rootnode;
6745 nodestack[nodestackpos++] = nodenum;
6746 while (nodestackpos)
6748 nodenum = nodestack[--nodestackpos];
6749 node = bih->nodes + nodenum;
6751 if (!BoxesOverlap(start, start, node->mins, node->maxs))
6754 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6756 axis = node->type - BIH_SPLITX;
6757 if (start[axis] >= node->frontmin)
6758 nodestack[nodestackpos++] = node->front;
6759 if (start[axis] <= node->backmax)
6760 nodestack[nodestackpos++] = node->back;
6762 else if (node->type == BIH_UNORDERED)
6764 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6766 leaf = bih->leafs + node->children[axis];
6768 if (!BoxesOverlap(start, start, leaf->mins, leaf->maxs))
6774 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6775 Collision_TracePointBrushFloat(trace, start, brush);
6777 case BIH_COLLISIONTRIANGLE:
6778 // collision triangle - skipped because they have no volume
6780 case BIH_RENDERTRIANGLE:
6781 // render triangle - skipped because they have no volume
6789 static void Mod_CollisionBIH_TraceLineShared(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask, const bih_t *bih)
6791 const bih_leaf_t *leaf;
6792 const bih_node_t *node;
6793 const colbrushf_t *brush;
6795 const texture_t *texture;
6796 vec3_t nodebigmins, nodebigmaxs, nodestart, nodeend, sweepnodemins, sweepnodemaxs;
6797 vec_t d1, d2, d3, d4, f, nodestackline[1024][6];
6798 int axis, nodenum, nodestackpos = 0, nodestack[1024];
6803 if (VectorCompare(start, end))
6805 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6809 nodenum = bih->rootnode;
6811 memset(trace, 0, sizeof(*trace));
6812 trace->fraction = 1;
6813 trace->hitsupercontentsmask = hitsupercontentsmask;
6816 nodestackline[nodestackpos][0] = start[0];
6817 nodestackline[nodestackpos][1] = start[1];
6818 nodestackline[nodestackpos][2] = start[2];
6819 nodestackline[nodestackpos][3] = end[0];
6820 nodestackline[nodestackpos][4] = end[1];
6821 nodestackline[nodestackpos][5] = end[2];
6822 nodestack[nodestackpos++] = nodenum;
6823 while (nodestackpos)
6825 nodenum = nodestack[--nodestackpos];
6826 node = bih->nodes + nodenum;
6827 VectorCopy(nodestackline[nodestackpos], nodestart);
6828 VectorCopy(nodestackline[nodestackpos] + 3, nodeend);
6829 sweepnodemins[0] = min(nodestart[0], nodeend[0]) - 1;
6830 sweepnodemins[1] = min(nodestart[1], nodeend[1]) - 1;
6831 sweepnodemins[2] = min(nodestart[2], nodeend[2]) - 1;
6832 sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + 1;
6833 sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + 1;
6834 sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + 1;
6835 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs))
6837 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6839 // recurse children of the split
6840 axis = node->type - BIH_SPLITX;
6841 d1 = node->backmax - nodestart[axis];
6842 d2 = node->backmax - nodeend[axis];
6843 d3 = nodestart[axis] - node->frontmin;
6844 d4 = nodeend[axis] - node->frontmin;
6845 switch((d1 < 0) | ((d2 < 0) << 1) | ((d3 < 0) << 2) | ((d4 < 0) << 3))
6847 case 0: /* >>>> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6848 case 1: /* <>>> */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6849 case 2: /* ><>> */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6850 case 3: /* <<>> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6851 case 4: /* >><> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6852 case 5: /* <><> */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6853 case 6: /* ><<> */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6854 case 7: /* <<<> */ f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6855 case 8: /* >>>< */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6856 case 9: /* <>>< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6857 case 10: /* ><>< */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6858 case 11: /* <<>< */ f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6859 case 12: /* >><< */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6860 case 13: /* <><< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6861 case 14: /* ><<< */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6862 case 15: /* <<<< */ break;
6865 else if (node->type == BIH_UNORDERED)
6867 // calculate sweep bounds for this node
6868 // copy node bounds into local variables
6869 VectorCopy(node->mins, nodebigmins);
6870 VectorCopy(node->maxs, nodebigmaxs);
6871 // clip line to this node bounds
6872 axis = 0; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6873 axis = 1; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6874 axis = 2; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
6875 // some of the line intersected the enlarged node box
6876 // calculate sweep bounds for this node
6877 sweepnodemins[0] = min(nodestart[0], nodeend[0]) - 1;
6878 sweepnodemins[1] = min(nodestart[1], nodeend[1]) - 1;
6879 sweepnodemins[2] = min(nodestart[2], nodeend[2]) - 1;
6880 sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + 1;
6881 sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + 1;
6882 sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + 1;
6883 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6885 leaf = bih->leafs + node->children[axis];
6886 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, leaf->mins, leaf->maxs))
6891 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6892 Collision_TraceLineBrushFloat(trace, start, end, brush, brush);
6894 case BIH_COLLISIONTRIANGLE:
6895 if (!mod_q3bsp_curves_collisions.integer)
6897 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6898 texture = model->data_textures + leaf->textureindex;
6899 Collision_TraceLineTriangleFloat(trace, start, end, model->brush.data_collisionvertex3f + e[0] * 3, model->brush.data_collisionvertex3f + e[1] * 3, model->brush.data_collisionvertex3f + e[2] * 3, texture->supercontents, texture->surfaceflags, texture);
6901 case BIH_RENDERTRIANGLE:
6902 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6903 texture = model->data_textures + leaf->textureindex;
6904 Collision_TraceLineTriangleFloat(trace, start, end, model->surfmesh.data_vertex3f + e[0] * 3, model->surfmesh.data_vertex3f + e[1] * 3, model->surfmesh.data_vertex3f + e[2] * 3, texture->supercontents, texture->surfaceflags, texture);
6912 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)
6914 if (VectorCompare(start, end))
6916 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6919 Mod_CollisionBIH_TraceLineShared(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, &model->collision_bih);
6922 void Mod_CollisionBIH_TraceBrush(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, colbrushf_t *thisbrush_start, colbrushf_t *thisbrush_end, int hitsupercontentsmask)
6925 const bih_leaf_t *leaf;
6926 const bih_node_t *node;
6927 const colbrushf_t *brush;
6929 const texture_t *texture;
6930 vec3_t start, end, startmins, startmaxs, endmins, endmaxs, mins, maxs;
6931 vec3_t nodebigmins, nodebigmaxs, nodestart, nodeend, sweepnodemins, sweepnodemaxs;
6932 vec_t d1, d2, d3, d4, f, nodestackline[1024][6];
6933 int axis, nodenum, nodestackpos = 0, nodestack[1024];
6935 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(thisbrush_start->mins, thisbrush_start->maxs) && VectorCompare(thisbrush_end->mins, thisbrush_end->maxs))
6937 if (VectorCompare(thisbrush_start->mins, thisbrush_end->mins))
6938 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, thisbrush_start->mins, hitsupercontentsmask);
6940 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, thisbrush_start->mins, thisbrush_end->mins, hitsupercontentsmask);
6944 bih = &model->collision_bih;
6947 nodenum = bih->rootnode;
6949 // box trace, performed as brush trace
6950 memset(trace, 0, sizeof(*trace));
6951 trace->fraction = 1;
6952 trace->hitsupercontentsmask = hitsupercontentsmask;
6954 // calculate tracebox-like parameters for efficient culling
6955 VectorMAM(0.5f, thisbrush_start->mins, 0.5f, thisbrush_start->maxs, start);
6956 VectorMAM(0.5f, thisbrush_end->mins, 0.5f, thisbrush_end->maxs, end);
6957 VectorSubtract(thisbrush_start->mins, start, startmins);
6958 VectorSubtract(thisbrush_start->maxs, start, startmaxs);
6959 VectorSubtract(thisbrush_end->mins, end, endmins);
6960 VectorSubtract(thisbrush_end->maxs, end, endmaxs);
6961 mins[0] = min(startmins[0], endmins[0]);
6962 mins[1] = min(startmins[1], endmins[1]);
6963 mins[2] = min(startmins[2], endmins[2]);
6964 maxs[0] = max(startmaxs[0], endmaxs[0]);
6965 maxs[1] = max(startmaxs[1], endmaxs[1]);
6966 maxs[2] = max(startmaxs[2], endmaxs[2]);
6969 nodestackline[nodestackpos][0] = start[0];
6970 nodestackline[nodestackpos][1] = start[1];
6971 nodestackline[nodestackpos][2] = start[2];
6972 nodestackline[nodestackpos][3] = end[0];
6973 nodestackline[nodestackpos][4] = end[1];
6974 nodestackline[nodestackpos][5] = end[2];
6975 nodestack[nodestackpos++] = nodenum;
6976 while (nodestackpos)
6978 nodenum = nodestack[--nodestackpos];
6979 node = bih->nodes + nodenum;
6980 VectorCopy(nodestackline[nodestackpos], nodestart);
6981 VectorCopy(nodestackline[nodestackpos] + 3, nodeend);
6982 sweepnodemins[0] = min(nodestart[0], nodeend[0]) + mins[0] - 1;
6983 sweepnodemins[1] = min(nodestart[1], nodeend[1]) + mins[1] - 1;
6984 sweepnodemins[2] = min(nodestart[2], nodeend[2]) + mins[2] - 1;
6985 sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + maxs[0] + 1;
6986 sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + maxs[1] + 1;
6987 sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + maxs[2] + 1;
6988 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs))
6990 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6992 // recurse children of the split
6993 axis = node->type - BIH_SPLITX;
6994 d1 = node->backmax - nodestart[axis] - mins[axis];
6995 d2 = node->backmax - nodeend[axis] - mins[axis];
6996 d3 = nodestart[axis] - node->frontmin + maxs[axis];
6997 d4 = nodeend[axis] - node->frontmin + maxs[axis];
6998 switch((d1 < 0) | ((d2 < 0) << 1) | ((d3 < 0) << 2) | ((d4 < 0) << 3))
7000 case 0: /* >>>> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7001 case 1: /* <>>> */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7002 case 2: /* ><>> */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7003 case 3: /* <<>> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7004 case 4: /* >><> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7005 case 5: /* <><> */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7006 case 6: /* ><<> */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7007 case 7: /* <<<> */ f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7008 case 8: /* >>>< */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7009 case 9: /* <>>< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7010 case 10: /* ><>< */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7011 case 11: /* <<>< */ f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7012 case 12: /* >><< */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
7013 case 13: /* <><< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
7014 case 14: /* ><<< */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
7015 case 15: /* <<<< */ break;
7018 else if (node->type == BIH_UNORDERED)
7020 // calculate sweep bounds for this node
7021 // copy node bounds into local variables and expand to get Minkowski Sum of the two shapes
7022 VectorSubtract(node->mins, maxs, nodebigmins);
7023 VectorSubtract(node->maxs, mins, nodebigmaxs);
7024 // clip line to this node bounds
7025 axis = 0; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
7026 axis = 1; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
7027 axis = 2; d1 = nodestart[axis] - nodebigmins[axis]; d2 = nodeend[axis] - nodebigmins[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); } d1 = nodebigmaxs[axis] - nodestart[axis]; d2 = nodebigmaxs[axis] - nodeend[axis]; if (d1 < 0) { if (d2 < 0) continue; f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestart); } else if (d2 < 0) { f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodeend); }
7028 // some of the line intersected the enlarged node box
7029 // calculate sweep bounds for this node
7030 sweepnodemins[0] = min(nodestart[0], nodeend[0]) + mins[0] - 1;
7031 sweepnodemins[1] = min(nodestart[1], nodeend[1]) + mins[1] - 1;
7032 sweepnodemins[2] = min(nodestart[2], nodeend[2]) + mins[2] - 1;
7033 sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + maxs[0] + 1;
7034 sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + maxs[1] + 1;
7035 sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + maxs[2] + 1;
7036 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
7038 leaf = bih->leafs + node->children[axis];
7039 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, leaf->mins, leaf->maxs))
7044 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
7045 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
7047 case BIH_COLLISIONTRIANGLE:
7048 if (!mod_q3bsp_curves_collisions.integer)
7050 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
7051 texture = model->data_textures + leaf->textureindex;
7052 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);
7054 case BIH_RENDERTRIANGLE:
7055 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
7056 texture = model->data_textures + leaf->textureindex;
7057 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);
7065 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)
7067 colboxbrushf_t thisbrush_start, thisbrush_end;
7068 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
7070 // box trace, performed as brush trace
7071 VectorAdd(start, boxmins, boxstartmins);
7072 VectorAdd(start, boxmaxs, boxstartmaxs);
7073 VectorAdd(end, boxmins, boxendmins);
7074 VectorAdd(end, boxmaxs, boxendmaxs);
7075 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
7076 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
7077 Mod_CollisionBIH_TraceBrush(model, frameblend, skeleton, trace, &thisbrush_start.brush, &thisbrush_end.brush, hitsupercontentsmask);
7081 int Mod_CollisionBIH_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
7084 Mod_CollisionBIH_TracePoint(model, NULL, NULL, &trace, point, 0);
7085 return trace.startsupercontents;
7088 qboolean Mod_CollisionBIH_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
7091 Mod_CollisionBIH_TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
7092 return trace.fraction == 1;
7095 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)
7098 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
7100 int hitsupercontents;
7101 VectorSet(end, start[0], start[1], model->normalmins[2]);
7103 memset(trace, 0, sizeof(*trace));
7104 trace->fraction = 1;
7105 trace->hitsupercontentsmask = hitsupercontentsmask;
7107 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
7108 hitsupercontents = trace->hitsupercontents;
7109 memset(trace, 0, sizeof(*trace));
7110 trace->fraction = 1;
7111 trace->hitsupercontentsmask = hitsupercontentsmask;
7112 trace->startsupercontents = hitsupercontents;
7116 int Mod_CollisionBIH_PointSuperContents_Mesh(struct model_s *model, int frame, const vec3_t start)
7119 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
7122 VectorSet(end, start[0], start[1], model->normalmins[2]);
7123 memset(&trace, 0, sizeof(trace));
7125 trace.hitsupercontentsmask = 0;
7126 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
7127 return trace.hitsupercontents;
7133 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
7138 // find which leaf the point is in
7140 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
7141 // point trace the brushes
7142 leaf = (mleaf_t *)node;
7143 for (i = 0;i < leaf->numleafbrushes;i++)
7145 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
7146 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
7148 brush->markframe = markframe;
7149 Collision_TracePointBrushFloat(trace, point, brush);
7152 // can't do point traces on curves (they have no thickness)
7155 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)
7157 int i, startside, endside;
7158 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
7160 msurface_t *surface;
7163 // walk the tree until we hit a leaf, recursing for any split cases
7167 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
7169 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[0], start, end, startfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
7170 node = node->children[1];
7172 // abort if this part of the bsp tree can not be hit by this trace
7173 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
7175 plane = node->plane;
7176 // axial planes are much more common than non-axial, so an optimized
7177 // axial case pays off here
7178 if (plane->type < 3)
7180 dist1 = start[plane->type] - plane->dist;
7181 dist2 = end[plane->type] - plane->dist;
7185 dist1 = DotProduct(start, plane->normal) - plane->dist;
7186 dist2 = DotProduct(end, plane->normal) - plane->dist;
7188 startside = dist1 < 0;
7189 endside = dist2 < 0;
7190 if (startside == endside)
7192 // most of the time the line fragment is on one side of the plane
7193 node = node->children[startside];
7197 // line crosses node plane, split the line
7198 dist1 = PlaneDiff(linestart, plane);
7199 dist2 = PlaneDiff(lineend, plane);
7200 midfrac = dist1 / (dist1 - dist2);
7201 VectorLerp(linestart, midfrac, lineend, mid);
7202 // take the near side first
7203 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
7204 // if we found an impact on the front side, don't waste time
7205 // exploring the far side
7206 if (midfrac <= trace->fraction)
7207 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
7212 // abort if this part of the bsp tree can not be hit by this trace
7213 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
7216 nodesegmentmins[0] = min(start[0], end[0]) - 1;
7217 nodesegmentmins[1] = min(start[1], end[1]) - 1;
7218 nodesegmentmins[2] = min(start[2], end[2]) - 1;
7219 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
7220 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
7221 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
7222 // line trace the brushes
7223 leaf = (mleaf_t *)node;
7225 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
7228 for (i = 0;i < leaf->numleafbrushes;i++)
7230 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
7231 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
7233 brush->markframe = markframe;
7234 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
7237 // can't do point traces on curves (they have no thickness)
7238 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
7240 // line trace the curves
7241 for (i = 0;i < leaf->numleafsurfaces;i++)
7243 surface = model->data_surfaces + leaf->firstleafsurface[i];
7244 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
7246 surface->deprecatedq3collisionmarkframe = markframe;
7247 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);
7253 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)
7259 msurface_t *surface;
7261 float nodesegmentmins[3], nodesegmentmaxs[3];
7262 // walk the tree until we hit a leaf, recursing for any split cases
7266 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
7268 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
7269 node = node->children[1];
7271 // abort if this part of the bsp tree can not be hit by this trace
7272 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
7274 plane = node->plane;
7275 // axial planes are much more common than non-axial, so an optimized
7276 // axial case pays off here
7277 if (plane->type < 3)
7279 // this is an axial plane, compare bounding box directly to it and
7280 // recurse sides accordingly
7281 // recurse down node sides
7282 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
7283 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
7284 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
7285 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
7289 // this is a non-axial plane, so check if the start and end boxes
7290 // are both on one side of the plane to handle 'diagonal' cases
7291 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
7295 // segment crosses plane
7296 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
7299 // if sides == 0 then the trace itself is bogus (Not A Number values),
7300 // in this case we simply pretend the trace hit nothing
7302 return; // ERROR: NAN bounding box!
7303 // take whichever side the segment box is on
7304 node = node->children[sides - 1];
7307 // abort if this part of the bsp tree can not be hit by this trace
7308 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
7310 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
7311 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
7312 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
7313 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
7314 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
7315 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
7317 leaf = (mleaf_t *)node;
7319 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
7322 for (i = 0;i < leaf->numleafbrushes;i++)
7324 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
7325 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
7327 brush->markframe = markframe;
7328 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
7331 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
7333 for (i = 0;i < leaf->numleafsurfaces;i++)
7335 surface = model->data_surfaces + leaf->firstleafsurface[i];
7336 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
7338 surface->deprecatedq3collisionmarkframe = markframe;
7339 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);
7346 static int markframe = 0;
7348 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)
7352 memset(trace, 0, sizeof(*trace));
7353 trace->fraction = 1;
7354 trace->hitsupercontentsmask = hitsupercontentsmask;
7355 if (mod_collision_bih.integer)
7356 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
7357 else if (model->brush.submodel)
7359 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
7360 if (brush->colbrushf)
7361 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
7364 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
7367 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)
7370 float segmentmins[3], segmentmaxs[3];
7371 msurface_t *surface;
7374 if (VectorCompare(start, end))
7376 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
7380 memset(trace, 0, sizeof(*trace));
7381 trace->fraction = 1;
7382 trace->hitsupercontentsmask = hitsupercontentsmask;
7383 segmentmins[0] = min(start[0], end[0]) - 1;
7384 segmentmins[1] = min(start[1], end[1]) - 1;
7385 segmentmins[2] = min(start[2], end[2]) - 1;
7386 segmentmaxs[0] = max(start[0], end[0]) + 1;
7387 segmentmaxs[1] = max(start[1], end[1]) + 1;
7388 segmentmaxs[2] = max(start[2], end[2]) + 1;
7389 if (mod_collision_bih.integer)
7390 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
7391 else if (model->brush.submodel)
7393 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
7394 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
7395 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
7396 if (mod_q3bsp_curves_collisions.integer)
7397 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
7398 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
7399 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);
7402 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
7405 static 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)
7407 float segmentmins[3], segmentmaxs[3];
7409 msurface_t *surface;
7412 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(start->mins, start->maxs) && VectorCompare(end->mins, end->maxs))
7414 if (VectorCompare(start->mins, end->mins))
7415 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start->mins, hitsupercontentsmask);
7417 Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, start->mins, end->mins, hitsupercontentsmask);
7421 // box trace, performed as brush trace
7422 memset(trace, 0, sizeof(*trace));
7423 trace->fraction = 1;
7424 trace->hitsupercontentsmask = hitsupercontentsmask;
7425 segmentmins[0] = min(start->mins[0], end->mins[0]) - 1;
7426 segmentmins[1] = min(start->mins[1], end->mins[1]) - 1;
7427 segmentmins[2] = min(start->mins[2], end->mins[2]) - 1;
7428 segmentmaxs[0] = max(start->maxs[0], end->maxs[0]) + 1;
7429 segmentmaxs[1] = max(start->maxs[1], end->maxs[1]) + 1;
7430 segmentmaxs[2] = max(start->maxs[2], end->maxs[2]) + 1;
7431 if (mod_collision_bih.integer)
7432 Mod_CollisionBIH_TraceBrush(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
7433 else if (model->brush.submodel)
7435 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
7436 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
7437 Collision_TraceBrushBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
7438 if (mod_q3bsp_curves_collisions.integer)
7439 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
7440 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
7441 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);
7444 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, ++markframe, segmentmins, segmentmaxs);
7447 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)
7449 colboxbrushf_t thisbrush_start, thisbrush_end;
7450 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
7452 // box trace, performed as brush trace
7453 VectorAdd(start, boxmins, boxstartmins);
7454 VectorAdd(start, boxmaxs, boxstartmaxs);
7455 VectorAdd(end, boxmins, boxendmins);
7456 VectorAdd(end, boxmaxs, boxendmaxs);
7457 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
7458 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
7459 Mod_Q3BSP_TraceBrush(model, frameblend, skeleton, trace, &thisbrush_start.brush, &thisbrush_end.brush, hitsupercontentsmask);
7462 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
7465 int supercontents = 0;
7467 if (mod_collision_bih.integer)
7469 supercontents = Mod_CollisionBIH_PointSuperContents(model, frame, point);
7471 // test if the point is inside each brush
7472 else if (model->brush.submodel)
7474 // submodels are effectively one leaf
7475 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
7476 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
7477 supercontents |= brush->colbrushf->supercontents;
7481 mnode_t *node = model->brush.data_nodes;
7483 // find which leaf the point is in
7485 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
7486 leaf = (mleaf_t *)node;
7487 // now check the brushes in the leaf
7488 for (i = 0;i < leaf->numleafbrushes;i++)
7490 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
7491 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
7492 supercontents |= brush->colbrushf->supercontents;
7495 return supercontents;
7498 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)
7500 Mod_CollisionBIH_TraceLineShared(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, &model->render_bih);
7504 bih_t *Mod_MakeCollisionBIH(dp_model_t *model, qboolean userendersurfaces, bih_t *out)
7512 int nummodelbrushes = model->nummodelbrushes;
7513 int nummodelsurfaces = model->nummodelsurfaces;
7515 const int *collisionelement3i;
7516 const float *collisionvertex3f;
7517 const int *renderelement3i;
7518 const float *rendervertex3f;
7519 bih_leaf_t *bihleafs;
7520 bih_node_t *bihnodes;
7522 int *temp_leafsortscratch;
7523 const msurface_t *surface;
7524 const q3mbrush_t *brush;
7526 // find out how many BIH leaf nodes we need
7528 if (userendersurfaces)
7530 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7531 bihnumleafs += surface->num_triangles;
7535 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
7536 if (brush->colbrushf)
7538 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7540 if (surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS)
7541 bihnumleafs += surface->num_triangles + surface->num_collisiontriangles;
7543 bihnumleafs += surface->num_collisiontriangles;
7550 // allocate the memory for the BIH leaf nodes
7551 bihleafs = (bih_leaf_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_leaf_t) * bihnumleafs);
7553 // now populate the BIH leaf nodes
7556 // add render surfaces
7557 renderelement3i = model->surfmesh.data_element3i;
7558 rendervertex3f = model->surfmesh.data_vertex3f;
7559 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7561 for (triangleindex = 0, e = renderelement3i + 3*surface->num_firsttriangle;triangleindex < surface->num_triangles;triangleindex++, e += 3)
7563 if (!userendersurfaces && !(surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS))
7565 bihleafs[bihleafindex].type = BIH_RENDERTRIANGLE;
7566 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
7567 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
7568 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firsttriangle;
7569 bihleafs[bihleafindex].mins[0] = min(rendervertex3f[3*e[0]+0], min(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) - 1;
7570 bihleafs[bihleafindex].mins[1] = min(rendervertex3f[3*e[0]+1], min(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) - 1;
7571 bihleafs[bihleafindex].mins[2] = min(rendervertex3f[3*e[0]+2], min(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) - 1;
7572 bihleafs[bihleafindex].maxs[0] = max(rendervertex3f[3*e[0]+0], max(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) + 1;
7573 bihleafs[bihleafindex].maxs[1] = max(rendervertex3f[3*e[0]+1], max(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) + 1;
7574 bihleafs[bihleafindex].maxs[2] = max(rendervertex3f[3*e[0]+2], max(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) + 1;
7579 if (!userendersurfaces)
7581 // add collision brushes
7582 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
7584 if (!brush->colbrushf)
7586 bihleafs[bihleafindex].type = BIH_BRUSH;
7587 bihleafs[bihleafindex].textureindex = brush->texture - model->data_textures;
7588 bihleafs[bihleafindex].surfaceindex = -1;
7589 bihleafs[bihleafindex].itemindex = brushindex+model->firstmodelbrush;
7590 VectorCopy(brush->colbrushf->mins, bihleafs[bihleafindex].mins);
7591 VectorCopy(brush->colbrushf->maxs, bihleafs[bihleafindex].maxs);
7595 // add collision surfaces
7596 collisionelement3i = model->brush.data_collisionelement3i;
7597 collisionvertex3f = model->brush.data_collisionvertex3f;
7598 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7600 for (triangleindex = 0, e = collisionelement3i + 3*surface->num_firstcollisiontriangle;triangleindex < surface->num_collisiontriangles;triangleindex++, e += 3)
7602 bihleafs[bihleafindex].type = BIH_COLLISIONTRIANGLE;
7603 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
7604 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
7605 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firstcollisiontriangle;
7606 bihleafs[bihleafindex].mins[0] = min(collisionvertex3f[3*e[0]+0], min(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) - 1;
7607 bihleafs[bihleafindex].mins[1] = min(collisionvertex3f[3*e[0]+1], min(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) - 1;
7608 bihleafs[bihleafindex].mins[2] = min(collisionvertex3f[3*e[0]+2], min(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) - 1;
7609 bihleafs[bihleafindex].maxs[0] = max(collisionvertex3f[3*e[0]+0], max(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) + 1;
7610 bihleafs[bihleafindex].maxs[1] = max(collisionvertex3f[3*e[0]+1], max(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) + 1;
7611 bihleafs[bihleafindex].maxs[2] = max(collisionvertex3f[3*e[0]+2], max(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) + 1;
7617 // allocate buffers for the produced and temporary data
7618 bihmaxnodes = bihnumleafs + 1;
7619 bihnodes = (bih_node_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_node_t) * bihmaxnodes);
7620 temp_leafsort = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * bihnumleafs * 2);
7621 temp_leafsortscratch = temp_leafsort + bihnumleafs;
7624 BIH_Build(out, bihnumleafs, bihleafs, bihmaxnodes, bihnodes, temp_leafsort, temp_leafsortscratch);
7626 // we're done with the temporary data
7627 Mem_Free(temp_leafsort);
7629 // resize the BIH nodes array if it over-allocated
7630 if (out->maxnodes > out->numnodes)
7632 out->maxnodes = out->numnodes;
7633 out->nodes = (bih_node_t *)Mem_Realloc(loadmodel->mempool, out->nodes, out->numnodes * sizeof(bih_node_t));
7639 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
7641 int supercontents = 0;
7642 if (nativecontents & CONTENTSQ3_SOLID)
7643 supercontents |= SUPERCONTENTS_SOLID;
7644 if (nativecontents & CONTENTSQ3_WATER)
7645 supercontents |= SUPERCONTENTS_WATER;
7646 if (nativecontents & CONTENTSQ3_SLIME)
7647 supercontents |= SUPERCONTENTS_SLIME;
7648 if (nativecontents & CONTENTSQ3_LAVA)
7649 supercontents |= SUPERCONTENTS_LAVA;
7650 if (nativecontents & CONTENTSQ3_BODY)
7651 supercontents |= SUPERCONTENTS_BODY;
7652 if (nativecontents & CONTENTSQ3_CORPSE)
7653 supercontents |= SUPERCONTENTS_CORPSE;
7654 if (nativecontents & CONTENTSQ3_NODROP)
7655 supercontents |= SUPERCONTENTS_NODROP;
7656 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
7657 supercontents |= SUPERCONTENTS_PLAYERCLIP;
7658 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
7659 supercontents |= SUPERCONTENTS_MONSTERCLIP;
7660 if (nativecontents & CONTENTSQ3_DONOTENTER)
7661 supercontents |= SUPERCONTENTS_DONOTENTER;
7662 if (nativecontents & CONTENTSQ3_BOTCLIP)
7663 supercontents |= SUPERCONTENTS_BOTCLIP;
7664 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
7665 supercontents |= SUPERCONTENTS_OPAQUE;
7666 return supercontents;
7669 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
7671 int nativecontents = 0;
7672 if (supercontents & SUPERCONTENTS_SOLID)
7673 nativecontents |= CONTENTSQ3_SOLID;
7674 if (supercontents & SUPERCONTENTS_WATER)
7675 nativecontents |= CONTENTSQ3_WATER;
7676 if (supercontents & SUPERCONTENTS_SLIME)
7677 nativecontents |= CONTENTSQ3_SLIME;
7678 if (supercontents & SUPERCONTENTS_LAVA)
7679 nativecontents |= CONTENTSQ3_LAVA;
7680 if (supercontents & SUPERCONTENTS_BODY)
7681 nativecontents |= CONTENTSQ3_BODY;
7682 if (supercontents & SUPERCONTENTS_CORPSE)
7683 nativecontents |= CONTENTSQ3_CORPSE;
7684 if (supercontents & SUPERCONTENTS_NODROP)
7685 nativecontents |= CONTENTSQ3_NODROP;
7686 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
7687 nativecontents |= CONTENTSQ3_PLAYERCLIP;
7688 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
7689 nativecontents |= CONTENTSQ3_MONSTERCLIP;
7690 if (supercontents & SUPERCONTENTS_DONOTENTER)
7691 nativecontents |= CONTENTSQ3_DONOTENTER;
7692 if (supercontents & SUPERCONTENTS_BOTCLIP)
7693 nativecontents |= CONTENTSQ3_BOTCLIP;
7694 if (!(supercontents & SUPERCONTENTS_OPAQUE))
7695 nativecontents |= CONTENTSQ3_TRANSLUCENT;
7696 return nativecontents;
7699 static void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
7704 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
7705 node = node->children[1];
7707 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
7708 if (loadmodel->brush.num_leafs < numleafs)
7709 loadmodel->brush.num_leafs = numleafs;
7712 static void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7715 q3dheader_t *header;
7716 float corner[3], yawradius, modelradius;
7718 mod->modeldatatypestring = "Q3BSP";
7720 mod->type = mod_brushq3;
7721 mod->brush.ishlbsp = false;
7722 mod->brush.isbsp2rmqe = false;
7723 mod->brush.isbsp2 = false;
7724 mod->brush.isq2bsp = false;
7725 mod->brush.isq3bsp = true;
7726 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
7729 header = (q3dheader_t *)buffer;
7730 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
7731 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
7733 i = LittleLong(header->version);
7734 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
7735 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
7737 mod->soundfromcenter = true;
7738 mod->TraceBox = Mod_Q3BSP_TraceBox;
7739 mod->TraceBrush = Mod_Q3BSP_TraceBrush;
7740 mod->TraceLine = Mod_Q3BSP_TraceLine;
7741 mod->TracePoint = Mod_Q3BSP_TracePoint;
7742 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
7743 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7744 mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
7745 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
7746 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
7747 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
7748 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
7749 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
7750 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
7751 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
7752 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
7753 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
7754 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
7755 mod->brush.AmbientSoundLevelsForPoint = NULL;
7756 mod->brush.RoundUpToHullSize = NULL;
7757 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
7758 mod->Draw = R_Q1BSP_Draw;
7759 mod->DrawDepth = R_Q1BSP_DrawDepth;
7760 mod->DrawDebug = R_Q1BSP_DrawDebug;
7761 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
7762 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
7763 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7764 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7765 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7766 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7767 mod->DrawLight = R_Q1BSP_DrawLight;
7769 mod_base = (unsigned char *)header;
7771 // swap all the lumps
7772 header->ident = LittleLong(header->ident);
7773 header->version = LittleLong(header->version);
7774 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
7775 for (i = 0;i < lumps;i++)
7777 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
7778 if((char *) bufferend < (char *) buffer + j)
7779 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
7780 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
7781 if((char *) bufferend < (char *) buffer + j)
7782 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
7785 * NO, do NOT clear them!
7786 * they contain actual data referenced by other stuff.
7787 * Instead, before using the advertisements lump, check header->versio
7789 * Sorry, but otherwise it breaks memory of the first lump.
7790 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
7792 header->lumps[i].fileofs = 0;
7793 header->lumps[i].filelen = 0;
7797 mod->brush.qw_md4sum = 0;
7798 mod->brush.qw_md4sum2 = 0;
7799 for (i = 0;i < lumps;i++)
7801 if (i == Q3LUMP_ENTITIES)
7803 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7804 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
7806 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7808 // all this checksumming can take a while, so let's send keepalives here too
7809 CL_KeepaliveMessage(false);
7812 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
7813 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
7814 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
7815 if (header->version == Q3BSPVERSION_IG)
7816 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
7818 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
7819 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
7820 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
7821 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
7822 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
7823 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
7824 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
7825 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
7826 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
7827 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
7828 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
7829 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
7830 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
7831 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
7832 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
7834 // the MakePortals code works fine on the q3bsp data as well
7835 if (mod_bsp_portalize.integer)
7836 Mod_Q1BSP_MakePortals();
7838 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
7839 loadmodel->brush.supportwateralpha = true;
7841 // make a single combined shadow mesh to allow optimized shadow volume creation
7842 Mod_Q1BSP_CreateShadowMesh(loadmodel);
7844 loadmodel->brush.num_leafs = 0;
7845 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
7847 if (loadmodel->brush.numsubmodels)
7848 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7851 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7856 // duplicate the basic information
7857 dpsnprintf(name, sizeof(name), "*%i", i);
7858 mod = Mod_FindName(name, loadmodel->name);
7859 // copy the base model to this one
7861 // rename the clone back to its proper name
7862 strlcpy(mod->name, name, sizeof(mod->name));
7863 mod->brush.parentmodel = loadmodel;
7864 // textures and memory belong to the main model
7865 mod->texturepool = NULL;
7866 mod->mempool = NULL;
7867 mod->brush.GetPVS = NULL;
7868 mod->brush.FatPVS = NULL;
7869 mod->brush.BoxTouchingPVS = NULL;
7870 mod->brush.BoxTouchingLeafPVS = NULL;
7871 mod->brush.BoxTouchingVisibleLeafs = NULL;
7872 mod->brush.FindBoxClusters = NULL;
7873 mod->brush.LightPoint = NULL;
7874 mod->brush.AmbientSoundLevelsForPoint = NULL;
7876 mod->brush.submodel = i;
7877 if (loadmodel->brush.submodels)
7878 loadmodel->brush.submodels[i] = mod;
7880 // make the model surface list (used by shadowing/lighting)
7881 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
7882 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
7883 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
7884 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
7885 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
7886 Mod_MakeSortedSurfaces(mod);
7888 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
7889 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
7890 // enlarge the bounding box to enclose all geometry of this model,
7891 // because q3map2 sometimes lies (mostly to affect the lightgrid),
7892 // which can in turn mess up the farclip (as well as culling when
7893 // outside the level - an unimportant concern)
7895 //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]);
7896 for (j = 0;j < mod->nummodelsurfaces;j++)
7898 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7899 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7901 if (!surface->num_vertices)
7903 for (k = 0;k < surface->num_vertices;k++, v += 3)
7905 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7906 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7907 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7908 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7909 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7910 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7913 //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]);
7914 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7915 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7916 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7917 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7918 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7919 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7920 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7921 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7922 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7923 mod->yawmins[2] = mod->normalmins[2];
7924 mod->yawmaxs[2] = mod->normalmaxs[2];
7925 mod->radius = modelradius;
7926 mod->radius2 = modelradius * modelradius;
7928 // this gets altered below if sky or water is used
7929 mod->DrawSky = NULL;
7930 mod->DrawAddWaterPlanes = NULL;
7932 for (j = 0;j < mod->nummodelsurfaces;j++)
7933 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7935 if (j < mod->nummodelsurfaces)
7936 mod->DrawSky = R_Q1BSP_DrawSky;
7938 for (j = 0;j < mod->nummodelsurfaces;j++)
7939 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7941 if (j < mod->nummodelsurfaces)
7942 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
7944 Mod_MakeCollisionBIH(mod, false, &mod->collision_bih);
7945 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
7947 // generate VBOs and other shared data before cloning submodels
7952 if (mod_q3bsp_sRGBlightmaps.integer)
7954 if (vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
7956 // actually we do in sRGB fallback with sRGB lightmaps: Image_sRGBFloatFromLinear_Lightmap(Image_LinearFloatFromsRGBFloat(x))
7957 // neutral point is at Image_sRGBFloatFromLinearFloat(0.5)
7958 // so we need to map Image_sRGBFloatFromLinearFloat(0.5) to 0.5
7959 // factor is 0.5 / Image_sRGBFloatFromLinearFloat(0.5)
7960 //loadmodel->lightmapscale *= 0.679942f; // fixes neutral level
7962 else // if this is NOT set, regular rendering looks right by this requirement anyway
7965 // we want color 1 to do the same as without sRGB
7966 // so, we want to map 1 to Image_LinearFloatFromsRGBFloat(2) instead of to 2
7967 loadmodel->lightmapscale *= 2.476923f; // fixes max level
7970 // neutral level 0.5 gets uploaded as sRGB and becomes Image_LinearFloatFromsRGBFloat(0.5)
7971 // we need to undo that
7972 loadmodel->lightmapscale *= 2.336f; // fixes neutral level
7976 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);
7979 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7981 int i = LittleLong(((int *)buffer)[1]);
7982 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
7983 Mod_Q3BSP_Load(mod,buffer, bufferend);
7984 else if (i == Q2BSPVERSION)
7985 Mod_Q2BSP_Load(mod,buffer, bufferend);
7987 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
7990 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7992 Host_Error("Mod_MAP_Load: not yet implemented");
7995 typedef struct objvertex_s
8006 static unsigned char nobsp_pvs[1] = {1};
8008 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
8010 const char *textbase = (char *)buffer, *text = textbase;
8014 char materialname[MAX_QPATH];
8015 int i, j, l, numvertices, firstvertex, firsttriangle, elementindex, vertexindex, surfacevertices, surfacetriangles, surfaceelements, submodelindex = 0;
8016 int index1, index2, index3;
8017 objvertex_t vfirst, vprev, vcurrent;
8020 int numtriangles = 0;
8021 int maxtriangles = 0;
8022 objvertex_t *vertices = NULL;
8024 int maxtextures = 0, numtextures = 0, textureindex = 0;
8025 int maxv = 0, numv = 1;
8026 int maxvt = 0, numvt = 1;
8027 int maxvn = 0, numvn = 1;
8028 char *texturenames = NULL;
8029 float dist, modelradius, modelyawradius, yawradius;
8036 objvertex_t *thisvertex = NULL;
8037 int vertexhashindex;
8038 int *vertexhashtable = NULL;
8039 objvertex_t *vertexhashdata = NULL;
8040 objvertex_t *vdata = NULL;
8041 int vertexhashsize = 0;
8042 int vertexhashcount = 0;
8043 skinfile_t *skinfiles = NULL;
8044 unsigned char *data = NULL;
8045 int *submodelfirstsurface;
8046 msurface_t *surface;
8047 msurface_t *tempsurfaces;
8049 memset(&vfirst, 0, sizeof(vfirst));
8050 memset(&vprev, 0, sizeof(vprev));
8051 memset(&vcurrent, 0, sizeof(vcurrent));
8053 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
8055 loadmodel->modeldatatypestring = "OBJ";
8057 loadmodel->type = mod_obj;
8058 loadmodel->soundfromcenter = true;
8059 loadmodel->TraceBox = Mod_CollisionBIH_TraceBox;
8060 loadmodel->TraceBrush = Mod_CollisionBIH_TraceBrush;
8061 loadmodel->TraceLine = Mod_CollisionBIH_TraceLine;
8062 loadmodel->TracePoint = Mod_CollisionBIH_TracePoint_Mesh;
8063 loadmodel->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
8064 loadmodel->PointSuperContents = Mod_CollisionBIH_PointSuperContents_Mesh;
8065 loadmodel->brush.TraceLineOfSight = NULL;
8066 loadmodel->brush.SuperContentsFromNativeContents = NULL;
8067 loadmodel->brush.NativeContentsFromSuperContents = NULL;
8068 loadmodel->brush.GetPVS = NULL;
8069 loadmodel->brush.FatPVS = NULL;
8070 loadmodel->brush.BoxTouchingPVS = NULL;
8071 loadmodel->brush.BoxTouchingLeafPVS = NULL;
8072 loadmodel->brush.BoxTouchingVisibleLeafs = NULL;
8073 loadmodel->brush.FindBoxClusters = NULL;
8074 loadmodel->brush.LightPoint = NULL;
8075 loadmodel->brush.FindNonSolidLocation = NULL;
8076 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
8077 loadmodel->brush.RoundUpToHullSize = NULL;
8078 loadmodel->brush.PointInLeaf = NULL;
8079 loadmodel->Draw = R_Q1BSP_Draw;
8080 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
8081 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
8082 loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
8083 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
8084 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
8085 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
8086 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
8087 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
8088 loadmodel->DrawLight = R_Q1BSP_DrawLight;
8090 skinfiles = Mod_LoadSkinFiles();
8091 if (loadmodel->numskins < 1)
8092 loadmodel->numskins = 1;
8094 // make skinscenes for the skins (no groups)
8095 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
8096 for (i = 0;i < loadmodel->numskins;i++)
8098 loadmodel->skinscenes[i].firstframe = i;
8099 loadmodel->skinscenes[i].framecount = 1;
8100 loadmodel->skinscenes[i].loop = true;
8101 loadmodel->skinscenes[i].framerate = 10;
8107 // we always have model 0, i.e. the first "submodel"
8108 loadmodel->brush.numsubmodels = 1;
8110 // parse the OBJ text now
8113 static char emptyarg[1] = "";
8118 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
8119 line[linelen] = text[linelen];
8121 for (argc = 0;argc < 4;argc++)
8122 argv[argc] = emptyarg;
8125 while (*s == ' ' || *s == '\t')
8135 while (*s == ' ' || *s == '\t')
8145 if (argv[0][0] == '#')
8147 if (!strcmp(argv[0], "v"))
8151 maxv = max(maxv * 2, 1024);
8152 v = (float *)Mem_Realloc(tempmempool, v, maxv * sizeof(float[3]));
8154 if(mod_obj_orientation.integer)
8156 v[numv*3+0] = atof(argv[1]);
8157 v[numv*3+2] = atof(argv[2]);
8158 v[numv*3+1] = atof(argv[3]);
8162 v[numv*3+0] = atof(argv[1]);
8163 v[numv*3+1] = atof(argv[2]);
8164 v[numv*3+2] = atof(argv[3]);
8168 else if (!strcmp(argv[0], "vt"))
8172 maxvt = max(maxvt * 2, 1024);
8173 vt = (float *)Mem_Realloc(tempmempool, vt, maxvt * sizeof(float[2]));
8175 vt[numvt*2+0] = atof(argv[1]);
8176 vt[numvt*2+1] = 1-atof(argv[2]);
8179 else if (!strcmp(argv[0], "vn"))
8183 maxvn = max(maxvn * 2, 1024);
8184 vn = (float *)Mem_Realloc(tempmempool, vn, maxvn * sizeof(float[3]));
8186 if(mod_obj_orientation.integer)
8188 vn[numvn*3+0] = atof(argv[1]);
8189 vn[numvn*3+2] = atof(argv[2]);
8190 vn[numvn*3+1] = atof(argv[3]);
8194 vn[numvn*3+0] = atof(argv[1]);
8195 vn[numvn*3+1] = atof(argv[2]);
8196 vn[numvn*3+2] = atof(argv[3]);
8200 else if (!strcmp(argv[0], "f"))
8204 if (maxtextures <= numtextures)
8206 maxtextures = max(maxtextures * 2, 256);
8207 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
8209 textureindex = numtextures++;
8210 strlcpy(texturenames + textureindex*MAX_QPATH, loadmodel->name, MAX_QPATH);
8212 for (j = 1;j < argc;j++)
8214 index1 = atoi(argv[j]);
8215 while(argv[j][0] && argv[j][0] != '/')
8219 index2 = atoi(argv[j]);
8220 while(argv[j][0] && argv[j][0] != '/')
8224 index3 = atoi(argv[j]);
8225 // negative refers to a recent vertex
8226 // zero means not specified
8227 // positive means an absolute vertex index
8229 index1 = numv - index1;
8231 index2 = numvt - index2;
8233 index3 = numvn - index3;
8234 vcurrent.nextindex = -1;
8235 vcurrent.textureindex = textureindex;
8236 vcurrent.submodelindex = submodelindex;
8237 if (v && index1 >= 0 && index1 < numv)
8238 VectorCopy(v + 3*index1, vcurrent.v);
8239 if (vt && index2 >= 0 && index2 < numvt)
8240 Vector2Copy(vt + 2*index2, vcurrent.vt);
8241 if (vn && index3 >= 0 && index3 < numvn)
8242 VectorCopy(vn + 3*index3, vcurrent.vn);
8243 if (numtriangles == 0)
8245 VectorCopy(vcurrent.v, mins);
8246 VectorCopy(vcurrent.v, maxs);
8250 mins[0] = min(mins[0], vcurrent.v[0]);
8251 mins[1] = min(mins[1], vcurrent.v[1]);
8252 mins[2] = min(mins[2], vcurrent.v[2]);
8253 maxs[0] = max(maxs[0], vcurrent.v[0]);
8254 maxs[1] = max(maxs[1], vcurrent.v[1]);
8255 maxs[2] = max(maxs[2], vcurrent.v[2]);
8261 if (maxtriangles <= numtriangles)
8263 maxtriangles = max(maxtriangles * 2, 32768);
8264 vertices = (objvertex_t*)Mem_Realloc(loadmodel->mempool, vertices, maxtriangles * sizeof(objvertex_t[3]));
8266 if(mod_obj_orientation.integer)
8268 vertices[numtriangles*3+0] = vfirst;
8269 vertices[numtriangles*3+1] = vprev;
8270 vertices[numtriangles*3+2] = vcurrent;
8274 vertices[numtriangles*3+0] = vfirst;
8275 vertices[numtriangles*3+2] = vprev;
8276 vertices[numtriangles*3+1] = vcurrent;
8283 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
8285 submodelindex = atof(argv[1]);
8286 loadmodel->brush.numsubmodels = max(submodelindex + 1, loadmodel->brush.numsubmodels);
8288 else if (!strcmp(argv[0], "usemtl"))
8290 for (i = 0;i < numtextures;i++)
8291 if (!strcmp(texturenames+i*MAX_QPATH, argv[1]))
8293 if (i < numtextures)
8297 if (maxtextures <= numtextures)
8299 maxtextures = max(maxtextures * 2, 256);
8300 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
8302 textureindex = numtextures++;
8303 strlcpy(texturenames + textureindex*MAX_QPATH, argv[1], MAX_QPATH);
8308 // now that we have the OBJ data loaded as-is, we can convert it
8310 // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
8311 VectorCopy(mins, loadmodel->normalmins);
8312 VectorCopy(maxs, loadmodel->normalmaxs);
8313 dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
8314 modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
8315 modelyawradius = dist*dist+modelyawradius*modelyawradius;
8316 modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
8317 modelradius = modelyawradius + modelradius * modelradius;
8318 modelyawradius = sqrt(modelyawradius);
8319 modelradius = sqrt(modelradius);
8320 loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
8321 loadmodel->yawmins[2] = loadmodel->normalmins[2];
8322 loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] = modelyawradius;
8323 loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
8324 loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
8325 loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] = modelradius;
8326 loadmodel->radius = modelradius;
8327 loadmodel->radius2 = modelradius * modelradius;
8329 // allocate storage for triangles
8330 loadmodel->surfmesh.data_element3i = (int *)Mem_Alloc(loadmodel->mempool, numtriangles * sizeof(int[3]));
8331 // allocate vertex hash structures to build an optimal vertex subset
8332 vertexhashsize = numtriangles*2;
8333 vertexhashtable = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * vertexhashsize);
8334 memset(vertexhashtable, 0xFF, sizeof(int) * vertexhashsize);
8335 vertexhashdata = (objvertex_t *)Mem_Alloc(loadmodel->mempool, sizeof(*vertexhashdata) * numtriangles*3);
8336 vertexhashcount = 0;
8338 // gather surface stats for assigning vertex/triangle ranges
8342 loadmodel->num_surfaces = 0;
8343 // allocate storage for the worst case number of surfaces, later we resize
8344 tempsurfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, numtextures * loadmodel->brush.numsubmodels * sizeof(msurface_t));
8345 submodelfirstsurface = (int *)Mem_Alloc(loadmodel->mempool, (loadmodel->brush.numsubmodels+1) * sizeof(int));
8346 surface = tempsurfaces;
8347 for (submodelindex = 0;submodelindex < loadmodel->brush.numsubmodels;submodelindex++)
8349 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
8350 for (textureindex = 0;textureindex < numtextures;textureindex++)
8352 for (vertexindex = 0;vertexindex < numtriangles*3;vertexindex++)
8354 thisvertex = vertices + vertexindex;
8355 if (thisvertex->submodelindex == submodelindex && thisvertex->textureindex == textureindex)
8358 // skip the surface creation if there are no triangles for it
8359 if (vertexindex == numtriangles*3)
8361 // create a surface for these vertices
8362 surfacevertices = 0;
8363 surfaceelements = 0;
8364 // we hack in a texture index in the surface to be fixed up later...
8365 surface->texture = (texture_t *)((size_t)textureindex);
8366 // calculate bounds as we go
8367 VectorCopy(thisvertex->v, surface->mins);
8368 VectorCopy(thisvertex->v, surface->maxs);
8369 for (;vertexindex < numtriangles*3;vertexindex++)
8371 thisvertex = vertices + vertexindex;
8372 if (thisvertex->submodelindex != submodelindex)
8374 if (thisvertex->textureindex != textureindex)
8376 // add vertex to surface bounds
8377 surface->mins[0] = min(surface->mins[0], thisvertex->v[0]);
8378 surface->mins[1] = min(surface->mins[1], thisvertex->v[1]);
8379 surface->mins[2] = min(surface->mins[2], thisvertex->v[2]);
8380 surface->maxs[0] = max(surface->maxs[0], thisvertex->v[0]);
8381 surface->maxs[1] = max(surface->maxs[1], thisvertex->v[1]);
8382 surface->maxs[2] = max(surface->maxs[2], thisvertex->v[2]);
8383 // add the vertex if it is not found in the merged set, and
8384 // get its index (triangle element) for the surface
8385 vertexhashindex = (unsigned int)(thisvertex->v[0] * 3571 + thisvertex->v[0] * 1777 + thisvertex->v[0] * 457) % (unsigned int)vertexhashsize;
8386 for (i = vertexhashtable[vertexhashindex];i >= 0;i = vertexhashdata[i].nextindex)
8388 vdata = vertexhashdata + i;
8389 if (vdata->submodelindex == thisvertex->submodelindex && vdata->textureindex == thisvertex->textureindex && VectorCompare(thisvertex->v, vdata->v) && VectorCompare(thisvertex->vn, vdata->vn) && Vector2Compare(thisvertex->vt, vdata->vt))
8394 i = vertexhashcount++;
8395 vdata = vertexhashdata + i;
8396 *vdata = *thisvertex;
8397 vdata->nextindex = vertexhashtable[vertexhashindex];
8398 vertexhashtable[vertexhashindex] = i;
8401 loadmodel->surfmesh.data_element3i[elementindex++] = i;
8404 surfacetriangles = surfaceelements / 3;
8405 surface->num_vertices = surfacevertices;
8406 surface->num_triangles = surfacetriangles;
8407 surface->num_firstvertex = firstvertex;
8408 surface->num_firsttriangle = firsttriangle;
8409 firstvertex += surface->num_vertices;
8410 firsttriangle += surface->num_triangles;
8412 loadmodel->num_surfaces++;
8415 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
8416 numvertices = firstvertex;
8417 loadmodel->data_surfaces = (msurface_t *)Mem_Realloc(loadmodel->mempool, tempsurfaces, loadmodel->num_surfaces * sizeof(msurface_t));
8418 tempsurfaces = NULL;
8420 // allocate storage for final mesh data
8421 loadmodel->num_textures = numtextures * loadmodel->numskins;
8422 loadmodel->num_texturesperskin = numtextures;
8423 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 *));
8424 loadmodel->brush.submodels = (dp_model_t **)data;data += loadmodel->brush.numsubmodels * sizeof(dp_model_t *);
8425 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
8426 loadmodel->data_textures = (texture_t *)data;data += loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t);
8427 loadmodel->surfmesh.num_vertices = numvertices;
8428 loadmodel->surfmesh.num_triangles = numtriangles;
8429 if (r_enableshadowvolumes.integer)
8430 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += numtriangles * sizeof(int[3]);
8431 loadmodel->surfmesh.data_vertex3f = (float *)data;data += numvertices * sizeof(float[3]);
8432 loadmodel->surfmesh.data_svector3f = (float *)data;data += numvertices * sizeof(float[3]);
8433 loadmodel->surfmesh.data_tvector3f = (float *)data;data += numvertices * sizeof(float[3]);
8434 loadmodel->surfmesh.data_normal3f = (float *)data;data += numvertices * sizeof(float[3]);
8435 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += numvertices * sizeof(float[2]);
8436 if (loadmodel->surfmesh.num_vertices <= 65536)
8437 loadmodel->surfmesh.data_element3s = (unsigned short *)data;data += loadmodel->surfmesh.num_triangles * sizeof(unsigned short[3]);
8439 for (j = 0;j < loadmodel->surfmesh.num_vertices;j++)
8441 VectorCopy(vertexhashdata[j].v, loadmodel->surfmesh.data_vertex3f + 3*j);
8442 VectorCopy(vertexhashdata[j].vn, loadmodel->surfmesh.data_normal3f + 3*j);
8443 Vector2Copy(vertexhashdata[j].vt, loadmodel->surfmesh.data_texcoordtexture2f + 2*j);
8446 // load the textures
8447 for (textureindex = 0;textureindex < numtextures;textureindex++)
8448 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures + textureindex, skinfiles, texturenames + textureindex*MAX_QPATH, texturenames + textureindex*MAX_QPATH);
8449 Mod_FreeSkinFiles(skinfiles);
8451 // set the surface textures to their real values now that we loaded them...
8452 for (i = 0;i < loadmodel->num_surfaces;i++)
8453 loadmodel->data_surfaces[i].texture = loadmodel->data_textures + (size_t)loadmodel->data_surfaces[i].texture;
8457 Mem_Free(texturenames);
8461 Mem_Free(vertexhashtable);
8462 Mem_Free(vertexhashdata);
8464 // make a single combined shadow mesh to allow optimized shadow volume creation
8465 Mod_Q1BSP_CreateShadowMesh(loadmodel);
8467 // compute all the mesh information that was not loaded from the file
8468 if (loadmodel->surfmesh.data_element3s)
8469 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
8470 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
8471 Mod_ValidateElements(loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles, 0, loadmodel->surfmesh.num_vertices, __FILE__, __LINE__);
8472 // generate normals if the file did not have them
8473 if (!VectorLength2(loadmodel->surfmesh.data_normal3f))
8474 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);
8475 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);
8476 if (loadmodel->surfmesh.data_neighbor3i)
8477 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
8479 // if this is a worldmodel and has no BSP tree, create a fake one for the purpose
8480 loadmodel->brush.num_visleafs = 1;
8481 loadmodel->brush.num_leafs = 1;
8482 loadmodel->brush.num_nodes = 0;
8483 loadmodel->brush.num_leafsurfaces = loadmodel->num_surfaces;
8484 loadmodel->brush.data_leafs = (mleaf_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
8485 loadmodel->brush.data_nodes = (mnode_t *)loadmodel->brush.data_leafs;
8486 loadmodel->brush.num_pvsclusters = 1;
8487 loadmodel->brush.num_pvsclusterbytes = 1;
8488 loadmodel->brush.data_pvsclusters = nobsp_pvs;
8489 //if (loadmodel->num_nodes) loadmodel->data_nodes = (mnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_nodes * sizeof(mnode_t));
8490 //loadmodel->data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->num_leafsurfaces * sizeof(int));
8491 loadmodel->brush.data_leafsurfaces = loadmodel->sortedmodelsurfaces;
8492 VectorCopy(loadmodel->normalmins, loadmodel->brush.data_leafs->mins);
8493 VectorCopy(loadmodel->normalmaxs, loadmodel->brush.data_leafs->maxs);
8494 loadmodel->brush.data_leafs->combinedsupercontents = 0; // FIXME?
8495 loadmodel->brush.data_leafs->clusterindex = 0;
8496 loadmodel->brush.data_leafs->areaindex = 0;
8497 loadmodel->brush.data_leafs->numleafsurfaces = loadmodel->brush.num_leafsurfaces;
8498 loadmodel->brush.data_leafs->firstleafsurface = loadmodel->brush.data_leafsurfaces;
8499 loadmodel->brush.data_leafs->numleafbrushes = 0;
8500 loadmodel->brush.data_leafs->firstleafbrush = NULL;
8501 loadmodel->brush.supportwateralpha = true;
8503 if (loadmodel->brush.numsubmodels)
8504 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
8507 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
8512 // duplicate the basic information
8513 dpsnprintf(name, sizeof(name), "*%i", i);
8514 mod = Mod_FindName(name, loadmodel->name);
8515 // copy the base model to this one
8517 // rename the clone back to its proper name
8518 strlcpy(mod->name, name, sizeof(mod->name));
8519 mod->brush.parentmodel = loadmodel;
8520 // textures and memory belong to the main model
8521 mod->texturepool = NULL;
8522 mod->mempool = NULL;
8523 mod->brush.GetPVS = NULL;
8524 mod->brush.FatPVS = NULL;
8525 mod->brush.BoxTouchingPVS = NULL;
8526 mod->brush.BoxTouchingLeafPVS = NULL;
8527 mod->brush.BoxTouchingVisibleLeafs = NULL;
8528 mod->brush.FindBoxClusters = NULL;
8529 mod->brush.LightPoint = NULL;
8530 mod->brush.AmbientSoundLevelsForPoint = NULL;
8532 mod->brush.submodel = i;
8533 if (loadmodel->brush.submodels)
8534 loadmodel->brush.submodels[i] = mod;
8536 // make the model surface list (used by shadowing/lighting)
8537 mod->firstmodelsurface = submodelfirstsurface[i];
8538 mod->nummodelsurfaces = submodelfirstsurface[i+1] - submodelfirstsurface[i];
8539 mod->firstmodelbrush = 0;
8540 mod->nummodelbrushes = 0;
8541 mod->sortedmodelsurfaces = loadmodel->sortedmodelsurfaces + mod->firstmodelsurface;
8542 Mod_MakeSortedSurfaces(mod);
8544 VectorClear(mod->normalmins);
8545 VectorClear(mod->normalmaxs);
8547 for (j = 0;j < mod->nummodelsurfaces;j++)
8549 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
8550 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
8552 if (!surface->num_vertices)
8557 VectorCopy(v, mod->normalmins);
8558 VectorCopy(v, mod->normalmaxs);
8560 for (k = 0;k < surface->num_vertices;k++, v += 3)
8562 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
8563 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
8564 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
8565 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
8566 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
8567 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
8570 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
8571 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
8572 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
8573 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
8574 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
8575 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
8576 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
8577 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
8578 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
8579 mod->yawmins[2] = mod->normalmins[2];
8580 mod->yawmaxs[2] = mod->normalmaxs[2];
8581 mod->radius = modelradius;
8582 mod->radius2 = modelradius * modelradius;
8584 // this gets altered below if sky or water is used
8585 mod->DrawSky = NULL;
8586 mod->DrawAddWaterPlanes = NULL;
8588 for (j = 0;j < mod->nummodelsurfaces;j++)
8589 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
8591 if (j < mod->nummodelsurfaces)
8592 mod->DrawSky = R_Q1BSP_DrawSky;
8594 for (j = 0;j < mod->nummodelsurfaces;j++)
8595 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
8597 if (j < mod->nummodelsurfaces)
8598 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
8600 Mod_MakeCollisionBIH(mod, true, &mod->collision_bih);
8601 mod->render_bih = mod->collision_bih;
8603 // generate VBOs and other shared data before cloning submodels
8608 Mem_Free(submodelfirstsurface);
8610 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);