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 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"};
43 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
44 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)"};
45 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)"};
46 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
47 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
48 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, ..."};
49 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)"};
50 cvar_t mod_q3bsp_tracelineofsight_brushes = {0, "mod_q3bsp_tracelineofsight_brushes", "0", "enables culling of entities behind detail brushes, curves, etc"};
51 cvar_t mod_q3bsp_sRGBlightmaps = {0, "mod_q3bsp_sRGBlightmaps", "0", "treat lightmaps from Q3 maps as sRGB when vid_sRGB is active"};
52 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"};
53 cvar_t mod_q3shader_default_offsetmapping_scale = {CVAR_SAVE, "mod_q3shader_default_offsetmapping_scale", "1", "default scale used for offsetmapping"};
54 cvar_t mod_q3shader_default_offsetmapping_bias = {CVAR_SAVE, "mod_q3shader_default_offsetmapping_bias", "0", "default bias used for offsetmapping"};
55 cvar_t mod_q3shader_default_polygonfactor = {0, "mod_q3shader_default_polygonfactor", "0", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
56 cvar_t mod_q3shader_default_polygonoffset = {0, "mod_q3shader_default_polygonoffset", "-2", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
57 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"};
58 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)"};
59 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"};
60 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"};
61 extern cvar_t vid_sRGB;
62 extern cvar_t vid_sRGB_fallback;
64 static texture_t mod_q1bsp_texture_solid;
65 static texture_t mod_q1bsp_texture_sky;
66 static texture_t mod_q1bsp_texture_lava;
67 static texture_t mod_q1bsp_texture_slime;
68 static texture_t mod_q1bsp_texture_water;
70 void Mod_BrushInit(void)
72 // Cvar_RegisterVariable(&r_subdivide_size);
73 Cvar_RegisterVariable(&mod_bsp_portalize);
74 Cvar_RegisterVariable(&r_novis);
75 Cvar_RegisterVariable(&r_nosurftextures);
76 Cvar_RegisterVariable(&r_subdivisions_tolerance);
77 Cvar_RegisterVariable(&r_subdivisions_mintess);
78 Cvar_RegisterVariable(&r_subdivisions_maxtess);
79 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
80 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
81 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
82 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
83 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
84 Cvar_RegisterVariable(&r_trippy);
85 Cvar_RegisterVariable(&mod_noshader_default_offsetmapping);
86 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
87 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
88 Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
89 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
90 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
91 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
92 Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
93 Cvar_RegisterVariable(&mod_q3bsp_sRGBlightmaps);
94 Cvar_RegisterVariable(&mod_q3bsp_tracelineofsight_brushes);
95 Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping);
96 Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping_scale);
97 Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping_bias);
98 Cvar_RegisterVariable(&mod_q3shader_default_polygonfactor);
99 Cvar_RegisterVariable(&mod_q3shader_default_polygonoffset);
100 Cvar_RegisterVariable(&mod_q3shader_force_addalpha);
101 Cvar_RegisterVariable(&mod_q1bsp_polygoncollisions);
102 Cvar_RegisterVariable(&mod_collision_bih);
103 Cvar_RegisterVariable(&mod_recalculatenodeboxes);
105 // these games were made for older DP engines and are no longer
106 // maintained; use this hack to show their textures properly
107 if(gamemode == GAME_NEXUIZ)
108 Cvar_SetQuick(&mod_q3shader_force_addalpha, "1");
110 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
111 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
112 mod_q1bsp_texture_solid.surfaceflags = 0;
113 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
115 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
116 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
117 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
118 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
120 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
121 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
122 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
123 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
125 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
126 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
127 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
128 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
130 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
131 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
132 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
133 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
136 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
143 // LordHavoc: modified to start at first clip node,
144 // in other words: first node of the (sub)model
145 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
147 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
149 return (mleaf_t *)node;
152 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
156 leaf = Mod_Q1BSP_PointInLeaf(model, p);
159 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
162 memcpy(out, leaf->ambient_sound_level, i);
168 memset(out, 0, outsize);
171 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
174 int nodestackindex = 0;
175 mnode_t *node, *nodestack[1024];
176 if (!model->brush.num_pvsclusters)
178 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
184 // node - recurse down the BSP tree
185 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
189 return -1; // ERROR: NAN bounding box!
190 // box is on one side of plane, take that path
191 node = node->children[sides-1];
195 // box crosses plane, take one path and remember the other
196 if (nodestackindex < 1024)
197 nodestack[nodestackindex++] = node->children[0];
198 node = node->children[1];
204 // leaf - add clusterindex to list
205 if (numclusters < maxclusters)
206 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
210 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
214 if (nodestackindex < 1024)
215 nodestack[nodestackindex++] = node->children[0];
216 node = node->children[1];
221 // leaf - add clusterindex to list
222 if (numclusters < maxclusters)
223 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
228 // try another path we didn't take earlier
229 if (nodestackindex == 0)
231 node = nodestack[--nodestackindex];
233 // return number of clusters found (even if more than the maxclusters)
237 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
239 int nodestackindex = 0;
240 mnode_t *node, *nodestack[1024];
241 if (!model->brush.num_pvsclusters)
243 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
249 // node - recurse down the BSP tree
250 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
254 return -1; // ERROR: NAN bounding box!
255 // box is on one side of plane, take that path
256 node = node->children[sides-1];
260 // box crosses plane, take one path and remember the other
261 if (nodestackindex < 1024)
262 nodestack[nodestackindex++] = node->children[0];
263 node = node->children[1];
269 // leaf - check cluster bit
270 int clusterindex = ((mleaf_t *)node)->clusterindex;
271 if (CHECKPVSBIT(pvs, clusterindex))
273 // it is visible, return immediately with the news
278 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
282 if (nodestackindex < 1024)
283 nodestack[nodestackindex++] = node->children[0];
284 node = node->children[1];
289 // leaf - check cluster bit
290 int clusterindex = ((mleaf_t *)node)->clusterindex;
291 if (CHECKPVSBIT(pvs, clusterindex))
293 // it is visible, return immediately with the news
299 // nothing to see here, try another path we didn't take earlier
300 if (nodestackindex == 0)
302 node = nodestack[--nodestackindex];
308 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
310 int nodestackindex = 0;
311 mnode_t *node, *nodestack[1024];
312 if (!model->brush.num_leafs)
314 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
320 // node - recurse down the BSP tree
321 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
325 return -1; // ERROR: NAN bounding box!
326 // box is on one side of plane, take that path
327 node = node->children[sides-1];
331 // box crosses plane, take one path and remember the other
332 if (nodestackindex < 1024)
333 nodestack[nodestackindex++] = node->children[0];
334 node = node->children[1];
340 // leaf - check cluster bit
341 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
342 if (CHECKPVSBIT(pvs, clusterindex))
344 // it is visible, return immediately with the news
349 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
353 if (nodestackindex < 1024)
354 nodestack[nodestackindex++] = node->children[0];
355 node = node->children[1];
360 // leaf - check cluster bit
361 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
362 if (CHECKPVSBIT(pvs, clusterindex))
364 // it is visible, return immediately with the news
370 // nothing to see here, try another path we didn't take earlier
371 if (nodestackindex == 0)
373 node = nodestack[--nodestackindex];
379 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
381 int nodestackindex = 0;
382 mnode_t *node, *nodestack[1024];
383 if (!model->brush.num_leafs)
385 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
391 // node - recurse down the BSP tree
392 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
396 return -1; // ERROR: NAN bounding box!
397 // box is on one side of plane, take that path
398 node = node->children[sides-1];
402 // box crosses plane, take one path and remember the other
403 if (nodestackindex < 1024)
404 nodestack[nodestackindex++] = node->children[0];
405 node = node->children[1];
411 // leaf - check if it is visible
412 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
414 // it is visible, return immediately with the news
419 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
423 if (nodestackindex < 1024)
424 nodestack[nodestackindex++] = node->children[0];
425 node = node->children[1];
430 // leaf - check if it is visible
431 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
433 // it is visible, return immediately with the news
439 // nothing to see here, try another path we didn't take earlier
440 if (nodestackindex == 0)
442 node = nodestack[--nodestackindex];
448 typedef struct findnonsolidlocationinfo_s
451 vec3_t absmin, absmax;
457 findnonsolidlocationinfo_t;
459 static void Mod_Q1BSP_FindNonSolidLocation_r_Triangle(findnonsolidlocationinfo_t *info, msurface_t *surface, int k)
462 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
464 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
465 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
466 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
467 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
468 VectorSubtract(vert[1], vert[0], edge[0]);
469 VectorSubtract(vert[2], vert[1], edge[1]);
470 CrossProduct(edge[1], edge[0], facenormal);
471 if (facenormal[0] || facenormal[1] || facenormal[2])
473 VectorNormalize(facenormal);
474 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
475 if (f <= info->bestdist && f >= -info->bestdist)
477 VectorSubtract(vert[0], vert[2], edge[2]);
478 VectorNormalize(edge[0]);
479 VectorNormalize(edge[1]);
480 VectorNormalize(edge[2]);
481 CrossProduct(facenormal, edge[0], edgenormal[0]);
482 CrossProduct(facenormal, edge[1], edgenormal[1]);
483 CrossProduct(facenormal, edge[2], edgenormal[2]);
485 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
486 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
487 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
489 // we got lucky, the center is within the face
490 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
494 if (info->bestdist > dist)
496 info->bestdist = dist;
497 VectorScale(facenormal, (info->radius - -dist), info->nudge);
502 if (info->bestdist > dist)
504 info->bestdist = dist;
505 VectorScale(facenormal, (info->radius - dist), info->nudge);
511 // check which edge or vertex the center is nearest
512 for (i = 0;i < 3;i++)
514 f = DotProduct(info->center, edge[i]);
515 if (f >= DotProduct(vert[0], edge[i])
516 && f <= DotProduct(vert[1], edge[i]))
519 VectorMA(info->center, -f, edge[i], point);
520 dist = sqrt(DotProduct(point, point));
521 if (info->bestdist > dist)
523 info->bestdist = dist;
524 VectorScale(point, (info->radius / dist), info->nudge);
526 // skip both vertex checks
527 // (both are further away than this edge)
532 // not on edge, check first vertex of edge
533 VectorSubtract(info->center, vert[i], point);
534 dist = sqrt(DotProduct(point, point));
535 if (info->bestdist > dist)
537 info->bestdist = dist;
538 VectorScale(point, (info->radius / dist), info->nudge);
547 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
549 int surfacenum, k, *mark;
551 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
553 surface = info->model->data_surfaces + *mark;
554 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
556 if(surface->deprecatedq3num_bboxstride > 0)
559 cnt = (surface->num_triangles + surface->deprecatedq3num_bboxstride - 1) / surface->deprecatedq3num_bboxstride;
560 for(i = 0; i < cnt; ++i)
562 if(BoxesOverlap(surface->deprecatedq3data_bbox6f + i * 6, surface->deprecatedq3data_bbox6f + i * 6 + 3, info->absmin, info->absmax))
564 for(k = 0; k < surface->deprecatedq3num_bboxstride; ++k)
566 tri = i * surface->deprecatedq3num_bboxstride + k;
567 if(tri >= surface->num_triangles)
569 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, tri);
576 for (k = 0;k < surface->num_triangles;k++)
578 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, k);
585 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
589 float f = PlaneDiff(info->center, node->plane);
590 if (f >= -info->bestdist)
591 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
592 if (f <= info->bestdist)
593 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
597 if (((mleaf_t *)node)->numleafsurfaces)
598 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
602 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
605 findnonsolidlocationinfo_t info;
611 VectorCopy(in, info.center);
612 info.radius = radius;
617 VectorClear(info.nudge);
618 info.bestdist = radius;
619 VectorCopy(info.center, info.absmin);
620 VectorCopy(info.center, info.absmax);
621 info.absmin[0] -= info.radius + 1;
622 info.absmin[1] -= info.radius + 1;
623 info.absmin[2] -= info.radius + 1;
624 info.absmax[0] += info.radius + 1;
625 info.absmax[1] += info.radius + 1;
626 info.absmax[2] += info.radius + 1;
627 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
628 VectorAdd(info.center, info.nudge, info.center);
630 while (info.bestdist < radius && ++i < 10);
631 VectorCopy(info.center, out);
634 int Mod_Q1BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
636 switch(nativecontents)
641 return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
643 return SUPERCONTENTS_WATER;
645 return SUPERCONTENTS_SLIME;
647 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
649 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
654 int Mod_Q1BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
656 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
657 return CONTENTS_SOLID;
658 if (supercontents & SUPERCONTENTS_SKY)
660 if (supercontents & SUPERCONTENTS_LAVA)
661 return CONTENTS_LAVA;
662 if (supercontents & SUPERCONTENTS_SLIME)
663 return CONTENTS_SLIME;
664 if (supercontents & SUPERCONTENTS_WATER)
665 return CONTENTS_WATER;
666 return CONTENTS_EMPTY;
669 typedef struct RecursiveHullCheckTraceInfo_s
671 // the hull we're tracing through
674 // the trace structure to fill in
677 // start, end, and end - start (in model space)
682 RecursiveHullCheckTraceInfo_t;
684 // 1/32 epsilon to keep floating point happy
685 #define DIST_EPSILON (0.03125)
687 #define HULLCHECKSTATE_EMPTY 0
688 #define HULLCHECKSTATE_SOLID 1
689 #define HULLCHECKSTATE_DONE 2
691 extern cvar_t collision_prefernudgedfraction;
692 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
694 // status variables, these don't need to be saved on the stack when
695 // recursing... but are because this should be thread-safe
696 // (note: tracing against a bbox is not thread-safe, yet)
701 // variables that need to be stored on the stack when recursing
706 // LordHavoc: a goto! everyone flee in terror... :)
711 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
712 if (!t->trace->startfound)
714 t->trace->startfound = true;
715 t->trace->startsupercontents |= num;
717 if (num & SUPERCONTENTS_LIQUIDSMASK)
718 t->trace->inwater = true;
720 t->trace->inopen = true;
721 if (num & SUPERCONTENTS_SOLID)
722 t->trace->hittexture = &mod_q1bsp_texture_solid;
723 else if (num & SUPERCONTENTS_SKY)
724 t->trace->hittexture = &mod_q1bsp_texture_sky;
725 else if (num & SUPERCONTENTS_LAVA)
726 t->trace->hittexture = &mod_q1bsp_texture_lava;
727 else if (num & SUPERCONTENTS_SLIME)
728 t->trace->hittexture = &mod_q1bsp_texture_slime;
730 t->trace->hittexture = &mod_q1bsp_texture_water;
731 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
732 t->trace->hitsupercontents = num;
733 if (num & t->trace->hitsupercontentsmask)
735 // if the first leaf is solid, set startsolid
736 if (t->trace->allsolid)
737 t->trace->startsolid = true;
738 #if COLLISIONPARANOID >= 3
741 return HULLCHECKSTATE_SOLID;
745 t->trace->allsolid = false;
746 #if COLLISIONPARANOID >= 3
749 return HULLCHECKSTATE_EMPTY;
753 // find the point distances
754 node = t->hull->clipnodes + num;
756 plane = t->hull->planes + node->planenum;
759 t1 = p1[plane->type] - plane->dist;
760 t2 = p2[plane->type] - plane->dist;
764 t1 = DotProduct (plane->normal, p1) - plane->dist;
765 t2 = DotProduct (plane->normal, p2) - plane->dist;
772 #if COLLISIONPARANOID >= 3
775 num = node->children[1];
784 #if COLLISIONPARANOID >= 3
787 num = node->children[0];
793 // the line intersects, find intersection point
794 // LordHavoc: this uses the original trace for maximum accuracy
795 #if COLLISIONPARANOID >= 3
800 t1 = t->start[plane->type] - plane->dist;
801 t2 = t->end[plane->type] - plane->dist;
805 t1 = DotProduct (plane->normal, t->start) - plane->dist;
806 t2 = DotProduct (plane->normal, t->end) - plane->dist;
809 midf = t1 / (t1 - t2);
810 midf = bound(p1f, midf, p2f);
811 VectorMA(t->start, midf, t->dist, mid);
813 // recurse both sides, front side first
814 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side], p1f, midf, p1, mid);
815 // if this side is not empty, return what it is (solid or done)
816 if (ret != HULLCHECKSTATE_EMPTY)
819 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[side ^ 1], midf, p2f, mid, p2);
820 // if other side is not solid, return what it is (empty or done)
821 if (ret != HULLCHECKSTATE_SOLID)
824 // front is air and back is solid, this is the impact point...
827 t->trace->plane.dist = -plane->dist;
828 VectorNegate (plane->normal, t->trace->plane.normal);
832 t->trace->plane.dist = plane->dist;
833 VectorCopy (plane->normal, t->trace->plane.normal);
836 // calculate the true fraction
837 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
838 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
839 midf = t1 / (t1 - t2);
840 t->trace->realfraction = bound(0, midf, 1);
842 // calculate the return fraction which is nudged off the surface a bit
843 midf = (t1 - DIST_EPSILON) / (t1 - t2);
844 t->trace->fraction = bound(0, midf, 1);
846 if (collision_prefernudgedfraction.integer)
847 t->trace->realfraction = t->trace->fraction;
849 #if COLLISIONPARANOID >= 3
852 return HULLCHECKSTATE_DONE;
855 //#if COLLISIONPARANOID < 2
856 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
859 mclipnode_t *nodes = t->hull->clipnodes;
860 mplane_t *planes = t->hull->planes;
862 VectorCopy(t->start, point);
865 plane = planes + nodes[num].planenum;
866 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
868 num = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
869 t->trace->startsupercontents |= num;
870 if (num & SUPERCONTENTS_LIQUIDSMASK)
871 t->trace->inwater = true;
873 t->trace->inopen = true;
874 if (num & t->trace->hitsupercontentsmask)
876 t->trace->allsolid = t->trace->startsolid = true;
877 return HULLCHECKSTATE_SOLID;
881 t->trace->allsolid = t->trace->startsolid = false;
882 return HULLCHECKSTATE_EMPTY;
887 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)
889 RecursiveHullCheckTraceInfo_t rhc;
891 memset(&rhc, 0, sizeof(rhc));
892 memset(trace, 0, sizeof(trace_t));
894 rhc.trace->fraction = 1;
895 rhc.trace->realfraction = 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_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)
905 RecursiveHullCheckTraceInfo_t rhc;
907 if (VectorCompare(start, end))
909 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
913 memset(&rhc, 0, sizeof(rhc));
914 memset(trace, 0, sizeof(trace_t));
916 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
917 rhc.trace->fraction = 1;
918 rhc.trace->realfraction = 1;
919 rhc.trace->allsolid = true;
920 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
921 VectorCopy(start, rhc.start);
922 VectorCopy(end, rhc.end);
923 VectorSubtract(rhc.end, rhc.start, rhc.dist);
924 #if COLLISIONPARANOID >= 2
925 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]);
926 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
931 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
932 memset(&testtrace, 0, sizeof(trace_t));
933 rhc.trace = &testtrace;
934 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
935 rhc.trace->fraction = 1;
936 rhc.trace->realfraction = 1;
937 rhc.trace->allsolid = true;
938 VectorCopy(test, rhc.start);
939 VectorCopy(test, rhc.end);
940 VectorClear(rhc.dist);
941 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
942 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
943 if (!trace->startsolid && testtrace.startsolid)
944 Con_Printf(" - ended in solid!\n");
948 if (VectorLength2(rhc.dist))
949 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
951 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
955 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)
957 // this function currently only supports same size start and end
959 RecursiveHullCheckTraceInfo_t rhc;
961 if (VectorCompare(boxmins, boxmaxs))
963 if (VectorCompare(start, end))
964 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
966 Mod_Q1BSP_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
970 memset(&rhc, 0, sizeof(rhc));
971 memset(trace, 0, sizeof(trace_t));
973 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
974 rhc.trace->fraction = 1;
975 rhc.trace->realfraction = 1;
976 rhc.trace->allsolid = true;
977 VectorSubtract(boxmaxs, boxmins, boxsize);
979 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
980 else if (model->brush.ishlbsp)
982 // LordHavoc: this has to have a minor tolerance (the .1) because of
983 // minor float precision errors from the box being transformed around
984 if (boxsize[0] < 32.1)
986 if (boxsize[2] < 54) // pick the nearest of 36 or 72
987 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
989 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
992 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
996 // LordHavoc: this has to have a minor tolerance (the .1) because of
997 // minor float precision errors from the box being transformed around
998 if (boxsize[0] < 32.1)
999 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
1001 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
1003 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
1004 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
1005 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1006 #if COLLISIONPARANOID >= 2
1007 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]);
1008 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1013 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
1014 memset(&testtrace, 0, sizeof(trace_t));
1015 rhc.trace = &testtrace;
1016 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1017 rhc.trace->fraction = 1;
1018 rhc.trace->realfraction = 1;
1019 rhc.trace->allsolid = true;
1020 VectorCopy(test, rhc.start);
1021 VectorCopy(test, rhc.end);
1022 VectorClear(rhc.dist);
1023 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1024 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
1025 if (!trace->startsolid && testtrace.startsolid)
1026 Con_Printf(" - ended in solid!\n");
1030 if (VectorLength2(rhc.dist))
1031 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1033 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1037 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
1039 int num = model->brushq1.hulls[0].firstclipnode;
1041 mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
1042 mplane_t *planes = model->brushq1.hulls[0].planes;
1045 plane = planes + nodes[num].planenum;
1046 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
1048 return Mod_Q1BSP_SuperContentsFromNativeContents(NULL, num);
1051 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)
1055 colplanef_t cbox_planes[6];
1057 cbox.hasaabbplanes = true;
1058 cbox.supercontents = boxsupercontents;
1061 cbox.numtriangles = 0;
1062 cbox.planes = cbox_planes;
1064 cbox.elements = NULL;
1072 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];
1073 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];
1074 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];
1075 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];
1076 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];
1077 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];
1078 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1079 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1080 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1081 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1082 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1083 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1084 memset(trace, 0, sizeof(trace_t));
1085 trace->hitsupercontentsmask = hitsupercontentsmask;
1086 trace->fraction = 1;
1087 trace->realfraction = 1;
1088 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1090 RecursiveHullCheckTraceInfo_t rhc;
1091 static hull_t box_hull;
1092 static mclipnode_t box_clipnodes[6];
1093 static mplane_t box_planes[6];
1094 // fill in a default trace
1095 memset(&rhc, 0, sizeof(rhc));
1096 memset(trace, 0, sizeof(trace_t));
1097 //To keep everything totally uniform, bounding boxes are turned into small
1098 //BSP trees instead of being compared directly.
1099 // create a temp hull from bounding box sizes
1100 box_planes[0].dist = cmaxs[0] - mins[0];
1101 box_planes[1].dist = cmins[0] - maxs[0];
1102 box_planes[2].dist = cmaxs[1] - mins[1];
1103 box_planes[3].dist = cmins[1] - maxs[1];
1104 box_planes[4].dist = cmaxs[2] - mins[2];
1105 box_planes[5].dist = cmins[2] - maxs[2];
1106 #if COLLISIONPARANOID >= 3
1107 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]);
1110 if (box_hull.clipnodes == NULL)
1114 //Set up the planes and clipnodes so that the six floats of a bounding box
1115 //can just be stored out and get a proper hull_t structure.
1117 box_hull.clipnodes = box_clipnodes;
1118 box_hull.planes = box_planes;
1119 box_hull.firstclipnode = 0;
1120 box_hull.lastclipnode = 5;
1122 for (i = 0;i < 6;i++)
1124 box_clipnodes[i].planenum = i;
1128 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1130 box_clipnodes[i].children[side^1] = i + 1;
1132 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1134 box_planes[i].type = i>>1;
1135 box_planes[i].normal[i>>1] = 1;
1139 // trace a line through the generated clipping hull
1140 //rhc.boxsupercontents = boxsupercontents;
1141 rhc.hull = &box_hull;
1143 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1144 rhc.trace->fraction = 1;
1145 rhc.trace->realfraction = 1;
1146 rhc.trace->allsolid = true;
1147 VectorCopy(start, rhc.start);
1148 VectorCopy(end, rhc.end);
1149 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1150 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1151 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1152 if (rhc.trace->startsupercontents)
1153 rhc.trace->startsupercontents = boxsupercontents;
1157 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)
1159 memset(trace, 0, sizeof(trace_t));
1160 trace->fraction = 1;
1161 trace->realfraction = 1;
1162 if (BoxesOverlap(start, start, cmins, cmaxs))
1164 trace->startsupercontents |= boxsupercontents;
1165 if (hitsupercontentsmask & boxsupercontents)
1167 trace->startsolid = true;
1168 trace->allsolid = true;
1173 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
1176 Mod_Q1BSP_TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
1177 return trace.fraction == 1;
1180 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)
1184 float mid, distz = endz - startz;
1188 return false; // didn't hit anything
1190 switch (node->plane->type)
1193 node = node->children[x < node->plane->dist];
1196 node = node->children[y < node->plane->dist];
1199 side = startz < node->plane->dist;
1200 if ((endz < node->plane->dist) == side)
1202 node = node->children[side];
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];
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
1228 // check for impact on this node
1229 if (node->numsurfaces)
1231 int i, 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;
1253 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1254 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1257 if (dsi >= 0 && dsi < lmwidth-1 && dti >= 0 && dti < lmheight-1)
1259 // calculate bilinear interpolation factors
1260 // and also multiply by fixedpoint conversion factors
1263 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1264 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 32768.0f);
1265 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1266 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 32768.0f);
1268 // values for pointer math
1269 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1270 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1272 // look up the pixel
1273 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1275 // bilinear filter each lightmap style, and sum them
1276 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1278 scale = r_refdef.scene.lightstylevalue[surface->lightmapinfo->styles[maps]];
1279 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1280 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1281 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1282 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1286 return true; // success
1291 // go down back side
1292 node = node->children[side ^ 1];
1294 distz = endz - startz;
1299 void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1301 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1302 VectorSet(diffusenormal, 0, 0, 1);
1304 if (!model->brushq1.lightdata)
1306 VectorSet(ambientcolor, 1, 1, 1);
1307 VectorSet(diffusecolor, 0, 0, 0);
1311 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);
1314 static const texture_t *Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(RecursiveHullCheckTraceInfo_t *t, const dp_model_t *model, const mnode_t *node, double mid[3])
1319 const msurface_t *surface;
1324 float edgenormal[3];
1331 surface = model->data_surfaces + node->firstsurface;
1332 for (i = 0;i < node->numsurfaces;i++, surface++)
1334 // skip surfaces whose bounding box does not include the point
1335 // if (!BoxesOverlap(mid, mid, surface->mins, surface->maxs))
1337 // skip faces with contents we don't care about
1338 if (!(t->trace->hitsupercontentsmask & surface->texture->supercontents))
1340 // get the surface normal - since it is flat we know any vertex normal will suffice
1341 VectorCopy(model->surfmesh.data_normal3f + 3 * surface->num_firstvertex, normal);
1343 if (DotProduct(t->dist, normal) > 0)
1345 // iterate edges and see if the point is outside one of them
1346 for (j = 0, k = surface->num_vertices - 1;j < surface->num_vertices;k = j, j++)
1348 VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + k), v0);
1349 VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + j), v1);
1350 VectorSubtract(v0, v1, edgedir);
1351 CrossProduct(edgedir, normal, edgenormal);
1352 if (DotProduct(edgenormal, p) > DotProduct(edgenormal, v0))
1355 // if the point is outside one of the edges, it is not within the surface
1356 if (j < surface->num_vertices)
1359 // we hit a surface, this is the impact point...
1360 VectorCopy(normal, t->trace->plane.normal);
1361 t->trace->plane.dist = DotProduct(normal, p);
1363 // calculate the true fraction
1364 t1 = DotProduct(t->start, t->trace->plane.normal) - t->trace->plane.dist;
1365 t2 = DotProduct(t->end, t->trace->plane.normal) - t->trace->plane.dist;
1366 midf = t1 / (t1 - t2);
1367 t->trace->realfraction = midf;
1369 // calculate the return fraction which is nudged off the surface a bit
1370 midf = (t1 - DIST_EPSILON) / (t1 - t2);
1371 t->trace->fraction = bound(0, midf, 1);
1373 if (collision_prefernudgedfraction.integer)
1374 t->trace->realfraction = t->trace->fraction;
1376 t->trace->hittexture = surface->texture->currentframe;
1377 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
1378 t->trace->hitsupercontents = t->trace->hittexture->supercontents;
1379 return surface->texture->currentframe;
1384 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])
1386 const mplane_t *plane;
1389 double midf, mid[3];
1390 const mleaf_t *leaf;
1394 plane = node->plane;
1395 if (plane->type < 3)
1397 t1 = p1[plane->type] - plane->dist;
1398 t2 = p2[plane->type] - plane->dist;
1402 t1 = DotProduct (plane->normal, p1) - plane->dist;
1403 t2 = DotProduct (plane->normal, p2) - plane->dist;
1409 node = node->children[1];
1418 node = node->children[0];
1424 // the line intersects, find intersection point
1425 // LordHavoc: this uses the original trace for maximum accuracy
1426 if (plane->type < 3)
1428 t1 = t->start[plane->type] - plane->dist;
1429 t2 = t->end[plane->type] - plane->dist;
1433 t1 = DotProduct (plane->normal, t->start) - plane->dist;
1434 t2 = DotProduct (plane->normal, t->end) - plane->dist;
1437 midf = t1 / (t1 - t2);
1438 VectorMA(t->start, midf, t->dist, mid);
1440 // recurse both sides, front side first, return if we hit a surface
1441 if (Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side], p1, mid) == HULLCHECKSTATE_DONE)
1442 return HULLCHECKSTATE_DONE;
1444 // test each surface on the node
1445 Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(t, model, node, mid);
1446 if (t->trace->hittexture)
1447 return HULLCHECKSTATE_DONE;
1449 // recurse back side
1450 return Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side ^ 1], mid, p2);
1452 leaf = (const mleaf_t *)node;
1453 side = Mod_Q1BSP_SuperContentsFromNativeContents(NULL, leaf->contents);
1454 if (!t->trace->startfound)
1456 t->trace->startfound = true;
1457 t->trace->startsupercontents |= side;
1459 if (side & SUPERCONTENTS_LIQUIDSMASK)
1460 t->trace->inwater = true;
1462 t->trace->inopen = true;
1463 if (side & t->trace->hitsupercontentsmask)
1465 // if the first leaf is solid, set startsolid
1466 if (t->trace->allsolid)
1467 t->trace->startsolid = true;
1468 return HULLCHECKSTATE_SOLID;
1472 t->trace->allsolid = false;
1473 return HULLCHECKSTATE_EMPTY;
1477 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)
1479 RecursiveHullCheckTraceInfo_t rhc;
1481 memset(&rhc, 0, sizeof(rhc));
1482 memset(trace, 0, sizeof(trace_t));
1484 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1485 rhc.trace->fraction = 1;
1486 rhc.trace->realfraction = 1;
1487 rhc.trace->allsolid = true;
1488 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
1489 VectorCopy(start, rhc.start);
1490 VectorCopy(end, rhc.end);
1491 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1492 Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(&rhc, model, model->brush.data_nodes + rhc.hull->firstclipnode, rhc.start, rhc.end);
1493 VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1496 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1499 unsigned char *outstart = out;
1500 while (out < outend)
1504 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));
1514 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));
1517 for (c = *in++;c > 0;c--)
1521 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));
1532 R_Q1BSP_LoadSplitSky
1534 A sky texture is 256*128, with the right side being a masked overlay
1537 void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1542 unsigned int *solidpixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1543 unsigned int *alphapixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1545 // allocate a texture pool if we need it
1546 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1547 loadmodel->texturepool = R_AllocTexturePool();
1549 if (bytesperpixel == 4)
1551 for (y = 0;y < h;y++)
1553 for (x = 0;x < w;x++)
1555 solidpixels[y*w+x] = ((unsigned *)src)[y*width+x+w];
1556 alphapixels[y*w+x] = ((unsigned *)src)[y*width+x];
1562 // make an average value for the back to avoid
1563 // a fringe on the top level
1572 for (y = 0;y < h;y++)
1574 for (x = 0;x < w;x++)
1576 p = src[x*width+y+w];
1577 r += palette_rgb[p][0];
1578 g += palette_rgb[p][1];
1579 b += palette_rgb[p][2];
1582 bgra.b[2] = r/(w*h);
1583 bgra.b[1] = g/(w*h);
1584 bgra.b[0] = b/(w*h);
1586 for (y = 0;y < h;y++)
1588 for (x = 0;x < w;x++)
1590 solidpixels[y*w+x] = palette_bgra_complete[src[y*width+x+w]];
1592 alphapixels[y*w+x] = p ? palette_bgra_complete[p] : bgra.i;
1597 loadmodel->brush.solidskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_solidtexture", 0 , (unsigned char *) solidpixels, w, h, vid.sRGB3D);
1598 loadmodel->brush.alphaskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_alphatexture", TEXF_ALPHA, (unsigned char *) alphapixels, w, h, vid.sRGB3D);
1599 Mem_Free(solidpixels);
1600 Mem_Free(alphapixels);
1603 static void Mod_Q1BSP_LoadTextures(lump_t *l)
1605 int i, j, k, num, max, altmax, mtwidth, mtheight, *dofs, incomplete;
1606 skinframe_t *skinframe;
1608 texture_t *tx, *tx2, *anims[10], *altanims[10];
1609 texture_t backuptex;
1611 unsigned char *data, *mtdata;
1613 char mapname[MAX_QPATH], name[MAX_QPATH];
1614 unsigned char zeroopaque[4], zerotrans[4];
1615 Vector4Set(zeroopaque, 0, 0, 0, 255);
1616 Vector4Set(zerotrans, 0, 0, 0, 128);
1618 loadmodel->data_textures = NULL;
1620 // add two slots for notexture walls and notexture liquids
1623 m = (dmiptexlump_t *)(mod_base + l->fileofs);
1624 m->nummiptex = LittleLong (m->nummiptex);
1625 loadmodel->num_textures = m->nummiptex + 2;
1626 loadmodel->num_texturesperskin = loadmodel->num_textures;
1631 loadmodel->num_textures = 2;
1632 loadmodel->num_texturesperskin = loadmodel->num_textures;
1635 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1637 // fill out all slots with notexture
1638 if (cls.state != ca_dedicated)
1639 skinframe = R_SkinFrame_LoadMissing();
1642 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1644 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1647 if (cls.state != ca_dedicated)
1649 tx->numskinframes = 1;
1650 tx->skinframerate = 1;
1651 tx->skinframes[0] = skinframe;
1652 tx->currentskinframe = tx->skinframes[0];
1654 tx->basematerialflags = MATERIALFLAG_WALL;
1655 if (i == loadmodel->num_textures - 1)
1657 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1658 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1659 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1663 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1664 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1666 tx->currentframe = tx;
1668 // clear water settings
1671 tx->refractfactor = 1;
1672 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1673 tx->reflectfactor = 1;
1674 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1675 tx->r_water_wateralpha = 1;
1676 tx->offsetmapping = OFFSETMAPPING_DEFAULT;
1677 tx->offsetscale = 1;
1679 tx->specularscalemod = 1;
1680 tx->specularpowermod = 1;
1685 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1689 s = loadmodel->name;
1690 if (!strncasecmp(s, "maps/", 5))
1692 FS_StripExtension(s, mapname, sizeof(mapname));
1694 // just to work around bounds checking when debugging with it (array index out of bounds error thing)
1696 // LordHavoc: mostly rewritten map texture loader
1697 for (i = 0;i < m->nummiptex;i++)
1699 dofs[i] = LittleLong(dofs[i]);
1700 if (r_nosurftextures.integer)
1704 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1707 dmiptex = (miptex_t *)((unsigned char *)m + dofs[i]);
1709 // copy name, but only up to 16 characters
1710 // (the output buffer can hold more than this, but the input buffer is
1712 for (j = 0;j < 16 && dmiptex->name[j];j++)
1713 name[j] = dmiptex->name[j];
1718 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1719 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1722 mtwidth = LittleLong(dmiptex->width);
1723 mtheight = LittleLong(dmiptex->height);
1725 j = LittleLong(dmiptex->offsets[0]);
1729 if (j < 40 || j + mtwidth * mtheight > l->filelen)
1731 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, dmiptex->name);
1734 mtdata = (unsigned char *)dmiptex + j;
1737 if ((mtwidth & 15) || (mtheight & 15))
1738 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, dmiptex->name);
1740 // LordHavoc: force all names to lowercase
1741 for (j = 0;name[j];j++)
1742 if (name[j] >= 'A' && name[j] <= 'Z')
1743 name[j] += 'a' - 'A';
1745 // LordHavoc: backup the texture_t because q3 shader loading overwrites it
1746 backuptex = loadmodel->data_textures[i];
1747 if (dmiptex->name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->data_textures + i, name, false, false, 0))
1749 loadmodel->data_textures[i] = backuptex;
1751 tx = loadmodel->data_textures + i;
1752 strlcpy(tx->name, name, sizeof(tx->name));
1753 tx->width = mtwidth;
1754 tx->height = mtheight;
1756 if (tx->name[0] == '*')
1758 if (!strncmp(tx->name, "*lava", 5))
1760 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1761 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1763 else if (!strncmp(tx->name, "*slime", 6))
1765 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1766 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1770 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1771 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1774 else if (!strncmp(tx->name, "sky", 3))
1776 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1777 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1778 tx->supercontents |= SUPERCONTENTS_SOLID; // for the surface traceline we need to hit this surface as a solid...
1782 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1783 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1786 if (cls.state != ca_dedicated)
1788 // LordHavoc: HL sky textures are entirely different than quake
1789 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == mtheight * 2)
1791 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), false, false, false, NULL);
1793 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), false, false, false, NULL);
1794 if (data && image_width == image_height * 2)
1796 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1799 else if (mtdata != NULL)
1800 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1804 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s/%s", mapname, tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, false);
1806 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va("textures/%s", tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, false);
1808 tx->offsetmapping = OFFSETMAPPING_DEFAULT; // allow offsetmapping on external textures without a q3 shader
1811 // did not find external texture, load it from the bsp or wad3
1812 if (loadmodel->brush.ishlbsp)
1814 // internal texture overrides wad
1815 unsigned char *pixels, *freepixels;
1816 pixels = freepixels = NULL;
1818 pixels = W_ConvertWAD3TextureBGRA(dmiptex);
1820 pixels = freepixels = W_GetTextureBGRA(tx->name);
1823 tx->width = image_width;
1824 tx->height = image_height;
1825 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, pixels, image_width, image_height, true);
1828 Mem_Free(freepixels);
1830 else if (mtdata) // texture included
1831 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1833 // if skinframe is still NULL the "missing" texture will be used
1835 tx->skinframes[0] = skinframe;
1837 // LordHavoc: some Tenebrae textures get replaced by black
1838 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1839 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA, zerotrans, 1, 1, false);
1840 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1841 tx->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, 0, zeroopaque, 1, 1, false);
1844 tx->basematerialflags = MATERIALFLAG_WALL;
1845 if (tx->name[0] == '*')
1847 // LordHavoc: some turbulent textures should not be affected by wateralpha
1848 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1849 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1850 else if (!strncmp(tx->name,"*lava",5)
1851 || !strncmp(tx->name,"*teleport",9)
1852 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1853 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1855 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1856 if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1857 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1859 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1861 // replace the texture with black
1862 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1864 else if (!strncmp(tx->name, "sky", 3))
1865 tx->basematerialflags = MATERIALFLAG_SKY | MATERIALFLAG_NOSHADOW;
1866 else if (!strcmp(tx->name, "caulk"))
1867 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1868 else if (tx->skinframes[0] && tx->skinframes[0]->hasalpha)
1869 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1871 // start out with no animation
1872 tx->currentframe = tx;
1873 tx->currentskinframe = tx->skinframes[0];
1874 tx->currentmaterialflags = tx->basematerialflags;
1877 // sequence the animations
1878 for (i = 0;i < m->nummiptex;i++)
1880 tx = loadmodel->data_textures + i;
1881 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1883 if (tx->anim_total[0] || tx->anim_total[1])
1884 continue; // already sequenced
1886 // find the number of frames in the animation
1887 memset(anims, 0, sizeof(anims));
1888 memset(altanims, 0, sizeof(altanims));
1890 for (j = i;j < m->nummiptex;j++)
1892 tx2 = loadmodel->data_textures + j;
1893 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
1897 if (num >= '0' && num <= '9')
1898 anims[num - '0'] = tx2;
1899 else if (num >= 'a' && num <= 'j')
1900 altanims[num - 'a'] = tx2;
1902 Con_Printf("Bad animating texture %s\n", tx->name);
1906 for (j = 0;j < 10;j++)
1913 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
1916 for (j = 0;j < max;j++)
1920 Con_Printf("Missing frame %i of %s\n", j, tx->name);
1924 for (j = 0;j < altmax;j++)
1928 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
1937 // if there is no alternate animation, duplicate the primary
1938 // animation into the alternate
1940 for (k = 0;k < 10;k++)
1941 altanims[k] = anims[k];
1944 // link together the primary animation
1945 for (j = 0;j < max;j++)
1948 tx2->animated = true;
1949 tx2->anim_total[0] = max;
1950 tx2->anim_total[1] = altmax;
1951 for (k = 0;k < 10;k++)
1953 tx2->anim_frames[0][k] = anims[k];
1954 tx2->anim_frames[1][k] = altanims[k];
1958 // if there really is an alternate anim...
1959 if (anims[0] != altanims[0])
1961 // link together the alternate animation
1962 for (j = 0;j < altmax;j++)
1965 tx2->animated = true;
1966 // the primary/alternate are reversed here
1967 tx2->anim_total[0] = altmax;
1968 tx2->anim_total[1] = max;
1969 for (k = 0;k < 10;k++)
1971 tx2->anim_frames[0][k] = altanims[k];
1972 tx2->anim_frames[1][k] = anims[k];
1979 static void Mod_Q1BSP_LoadLighting(lump_t *l)
1982 unsigned char *in, *out, *data, d;
1983 char litfilename[MAX_QPATH];
1984 char dlitfilename[MAX_QPATH];
1985 fs_offset_t filesize;
1986 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
1988 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
1989 for (i=0; i<l->filelen; i++)
1990 loadmodel->brushq1.lightdata[i] = mod_base[l->fileofs+i] >>= 1;
1992 else // LordHavoc: bsp version 29 (normal white lighting)
1994 // LordHavoc: hope is not lost yet, check for a .lit file to load
1995 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
1996 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
1997 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
1998 strlcat (litfilename, ".lit", sizeof (litfilename));
1999 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
2000 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
2003 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
2005 i = LittleLong(((int *)data)[1]);
2008 if (developer_loading.integer)
2009 Con_Printf("loaded %s\n", litfilename);
2010 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
2011 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
2013 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
2016 if (filesize == (fs_offset_t)(8 + l->filelen * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
2018 i = LittleLong(((int *)data)[1]);
2021 if (developer_loading.integer)
2022 Con_Printf("loaded %s\n", dlitfilename);
2023 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
2024 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
2025 loadmodel->brushq3.deluxemapping_modelspace = false;
2026 loadmodel->brushq3.deluxemapping = true;
2035 Con_Printf("Unknown .lit file version (%d)\n", i);
2037 else if (filesize == 8)
2038 Con_Print("Empty .lit file, ignoring\n");
2040 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + l->filelen * 3));
2047 // LordHavoc: oh well, expand the white lighting data
2050 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen*3);
2051 in = mod_base + l->fileofs;
2052 out = loadmodel->brushq1.lightdata;
2053 for (i = 0;i < l->filelen;i++)
2063 static void Mod_Q1BSP_LoadVisibility(lump_t *l)
2065 loadmodel->brushq1.num_compressedpvs = 0;
2066 loadmodel->brushq1.data_compressedpvs = NULL;
2069 loadmodel->brushq1.num_compressedpvs = l->filelen;
2070 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, l->filelen);
2071 memcpy(loadmodel->brushq1.data_compressedpvs, mod_base + l->fileofs, l->filelen);
2074 // used only for HalfLife maps
2075 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
2077 char key[128], value[4096];
2081 if (!COM_ParseToken_Simple(&data, false, false, true))
2083 if (com_token[0] != '{')
2087 if (!COM_ParseToken_Simple(&data, false, false, true))
2089 if (com_token[0] == '}')
2090 break; // end of worldspawn
2091 if (com_token[0] == '_')
2092 strlcpy(key, com_token + 1, sizeof(key));
2094 strlcpy(key, com_token, sizeof(key));
2095 while (key[strlen(key)-1] == ' ') // remove trailing spaces
2096 key[strlen(key)-1] = 0;
2097 if (!COM_ParseToken_Simple(&data, false, false, true))
2099 dpsnprintf(value, sizeof(value), "%s", com_token);
2100 if (!strcmp("wad", key)) // for HalfLife maps
2102 if (loadmodel->brush.ishlbsp)
2105 for (i = 0;i < (int)sizeof(value);i++)
2106 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
2110 for (;i < (int)sizeof(value);i++)
2112 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
2113 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
2115 else if (value[i] == ';' || value[i] == 0)
2119 W_LoadTextureWadFile(&value[j], false);
2131 static void Mod_Q1BSP_LoadEntities(lump_t *l)
2133 loadmodel->brush.entities = NULL;
2136 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
2137 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
2138 loadmodel->brush.entities[l->filelen] = 0;
2139 if (loadmodel->brush.ishlbsp)
2140 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
2144 static void Mod_Q1BSP_LoadVertexes(lump_t *l)
2150 in = (dvertex_t *)(mod_base + l->fileofs);
2151 if (l->filelen % sizeof(*in))
2152 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
2153 count = l->filelen / sizeof(*in);
2154 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2156 loadmodel->brushq1.vertexes = out;
2157 loadmodel->brushq1.numvertexes = count;
2159 for ( i=0 ; i<count ; i++, in++, out++)
2161 out->position[0] = LittleFloat(in->point[0]);
2162 out->position[1] = LittleFloat(in->point[1]);
2163 out->position[2] = LittleFloat(in->point[2]);
2167 // The following two functions should be removed and MSG_* or SZ_* function sets adjusted so they
2168 // can be used for this
2170 int SB_ReadInt (unsigned char **buffer)
2173 i = ((*buffer)[0]) + 256*((*buffer)[1]) + 65536*((*buffer)[2]) + 16777216*((*buffer)[3]);
2179 float SB_ReadFloat (unsigned char **buffer)
2187 u.i = SB_ReadInt (buffer);
2191 static void Mod_Q1BSP_LoadSubmodels(lump_t *l, hullinfo_t *hullinfo)
2193 unsigned char *index;
2197 index = (unsigned char *)(mod_base + l->fileofs);
2198 if (l->filelen % (48+4*hullinfo->filehulls))
2199 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
2201 count = l->filelen / (48+4*hullinfo->filehulls);
2202 out = (dmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
2204 loadmodel->brushq1.submodels = out;
2205 loadmodel->brush.numsubmodels = count;
2207 for (i = 0; i < count; i++, out++)
2209 // spread out the mins / maxs by a pixel
2210 out->mins[0] = SB_ReadFloat (&index) - 1;
2211 out->mins[1] = SB_ReadFloat (&index) - 1;
2212 out->mins[2] = SB_ReadFloat (&index) - 1;
2213 out->maxs[0] = SB_ReadFloat (&index) + 1;
2214 out->maxs[1] = SB_ReadFloat (&index) + 1;
2215 out->maxs[2] = SB_ReadFloat (&index) + 1;
2216 out->origin[0] = SB_ReadFloat (&index);
2217 out->origin[1] = SB_ReadFloat (&index);
2218 out->origin[2] = SB_ReadFloat (&index);
2219 for (j = 0; j < hullinfo->filehulls; j++)
2220 out->headnode[j] = SB_ReadInt (&index);
2221 out->visleafs = SB_ReadInt (&index);
2222 out->firstface = SB_ReadInt (&index);
2223 out->numfaces = SB_ReadInt (&index);
2227 static void Mod_Q1BSP_LoadEdges(lump_t *l)
2233 in = (dedge_t *)(mod_base + l->fileofs);
2234 if (l->filelen % sizeof(*in))
2235 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2236 count = l->filelen / sizeof(*in);
2237 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2239 loadmodel->brushq1.edges = out;
2240 loadmodel->brushq1.numedges = count;
2242 for ( i=0 ; i<count ; i++, in++, out++)
2244 out->v[0] = (unsigned short)LittleShort(in->v[0]);
2245 out->v[1] = (unsigned short)LittleShort(in->v[1]);
2246 if (out->v[0] >= loadmodel->brushq1.numvertexes || out->v[1] >= loadmodel->brushq1.numvertexes)
2248 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);
2249 if(!loadmodel->brushq1.numvertexes)
2250 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2258 static void Mod_Q1BSP_LoadTexinfo(lump_t *l)
2262 int i, j, k, count, miptex;
2264 in = (texinfo_t *)(mod_base + l->fileofs);
2265 if (l->filelen % sizeof(*in))
2266 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2267 count = l->filelen / sizeof(*in);
2268 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2270 loadmodel->brushq1.texinfo = out;
2271 loadmodel->brushq1.numtexinfo = count;
2273 for (i = 0;i < count;i++, in++, out++)
2275 for (k = 0;k < 2;k++)
2276 for (j = 0;j < 4;j++)
2277 out->vecs[k][j] = LittleFloat(in->vecs[k][j]);
2279 miptex = LittleLong(in->miptex);
2280 out->flags = LittleLong(in->flags);
2282 out->texture = NULL;
2283 if (loadmodel->data_textures)
2285 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2286 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2288 out->texture = loadmodel->data_textures + miptex;
2290 if (out->flags & TEX_SPECIAL)
2292 // if texture chosen is NULL or the shader needs a lightmap,
2293 // force to notexture water shader
2294 if (out->texture == NULL)
2295 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 1);
2299 // if texture chosen is NULL, force to notexture
2300 if (out->texture == NULL)
2301 out->texture = loadmodel->data_textures + (loadmodel->num_textures - 2);
2307 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2312 mins[0] = mins[1] = mins[2] = 9999;
2313 maxs[0] = maxs[1] = maxs[2] = -9999;
2315 for (i = 0;i < numverts;i++)
2317 for (j = 0;j < 3;j++, v++)
2327 #define MAX_SUBDIVPOLYTRIANGLES 4096
2328 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2330 static int subdivpolyverts, subdivpolytriangles;
2331 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2332 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2334 static int subdivpolylookupvert(vec3_t v)
2337 for (i = 0;i < subdivpolyverts;i++)
2338 if (subdivpolyvert[i][0] == v[0]
2339 && subdivpolyvert[i][1] == v[1]
2340 && subdivpolyvert[i][2] == v[2])
2342 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2343 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2344 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2345 return subdivpolyverts++;
2348 static void SubdividePolygon(int numverts, float *verts)
2350 int i, i1, i2, i3, f, b, c, p;
2351 vec3_t mins, maxs, front[256], back[256];
2352 float m, *pv, *cv, dist[256], frac;
2355 Host_Error("SubdividePolygon: ran out of verts in buffer");
2357 BoundPoly(numverts, verts, mins, maxs);
2359 for (i = 0;i < 3;i++)
2361 m = (mins[i] + maxs[i]) * 0.5;
2362 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2363 if (maxs[i] - m < 8)
2365 if (m - mins[i] < 8)
2369 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2370 dist[c] = cv[i] - m;
2373 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2377 VectorCopy(pv, front[f]);
2382 VectorCopy(pv, back[b]);
2385 if (dist[p] == 0 || dist[c] == 0)
2387 if ((dist[p] > 0) != (dist[c] > 0) )
2390 frac = dist[p] / (dist[p] - dist[c]);
2391 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2392 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2393 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2399 SubdividePolygon(f, front[0]);
2400 SubdividePolygon(b, back[0]);
2404 i1 = subdivpolylookupvert(verts);
2405 i2 = subdivpolylookupvert(verts + 3);
2406 for (i = 2;i < numverts;i++)
2408 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2410 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2414 i3 = subdivpolylookupvert(verts + i * 3);
2415 subdivpolyindex[subdivpolytriangles][0] = i1;
2416 subdivpolyindex[subdivpolytriangles][1] = i2;
2417 subdivpolyindex[subdivpolytriangles][2] = i3;
2419 subdivpolytriangles++;
2423 //Breaks a polygon up along axial 64 unit
2424 //boundaries so that turbulent and sky warps
2425 //can be done reasonably.
2426 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2432 subdivpolytriangles = 0;
2433 subdivpolyverts = 0;
2434 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2435 if (subdivpolytriangles < 1)
2436 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2438 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2439 mesh->num_vertices = subdivpolyverts;
2440 mesh->num_triangles = subdivpolytriangles;
2441 mesh->vertex = (surfvertex_t *)(mesh + 1);
2442 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2443 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2445 for (i = 0;i < mesh->num_triangles;i++)
2446 for (j = 0;j < 3;j++)
2447 mesh->index[i*3+j] = subdivpolyindex[i][j];
2449 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2451 VectorCopy(subdivpolyvert[i], v->v);
2452 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2453 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2458 extern cvar_t gl_max_lightmapsize;
2459 static void Mod_Q1BSP_LoadFaces(lump_t *l)
2462 msurface_t *surface;
2463 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples;
2464 float texmins[2], texmaxs[2], val;
2465 rtexture_t *lightmaptexture, *deluxemaptexture;
2467 in = (dface_t *)(mod_base + l->fileofs);
2468 if (l->filelen % sizeof(*in))
2469 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2470 count = l->filelen / sizeof(*in);
2471 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2472 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2474 loadmodel->num_surfaces = count;
2476 loadmodel->brushq1.firstrender = true;
2477 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2481 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs);surfacenum < count;surfacenum++, in++)
2483 numedges = (unsigned short)LittleShort(in->numedges);
2484 totalverts += numedges;
2485 totaltris += numedges - 2;
2488 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false, false);
2490 lightmaptexture = NULL;
2491 deluxemaptexture = r_texture_blanknormalmap;
2493 lightmapsize = bound(256, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d);
2494 totallightmapsamples = 0;
2498 for (surfacenum = 0, in = (dface_t *)(mod_base + l->fileofs), surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, in++, surface++)
2500 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2502 // FIXME: validate edges, texinfo, etc?
2503 firstedge = LittleLong(in->firstedge);
2504 numedges = (unsigned short)LittleShort(in->numedges);
2505 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)
2506 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2507 i = (unsigned short)LittleShort(in->texinfo);
2508 if ((unsigned int) i >= (unsigned int) loadmodel->brushq1.numtexinfo)
2509 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", i, loadmodel->brushq1.numtexinfo);
2510 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + i;
2511 surface->texture = surface->lightmapinfo->texinfo->texture;
2513 planenum = (unsigned short)LittleShort(in->planenum);
2514 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2515 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2517 //surface->flags = surface->texture->flags;
2518 //if (LittleShort(in->side))
2519 // surface->flags |= SURF_PLANEBACK;
2520 //surface->plane = loadmodel->brush.data_planes + planenum;
2522 surface->num_firstvertex = totalverts;
2523 surface->num_vertices = numedges;
2524 surface->num_firsttriangle = totaltris;
2525 surface->num_triangles = numedges - 2;
2526 totalverts += numedges;
2527 totaltris += numedges - 2;
2529 // convert edges back to a normal polygon
2530 for (i = 0;i < surface->num_vertices;i++)
2532 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2534 // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2536 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2538 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2539 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2540 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2541 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2542 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2543 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2544 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2545 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2548 for (i = 0;i < surface->num_triangles;i++)
2550 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2551 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2552 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2555 // compile additional data about the surface geometry
2556 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);
2557 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);
2558 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2560 // generate surface extents information
2561 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2562 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2563 for (i = 1;i < surface->num_vertices;i++)
2565 for (j = 0;j < 2;j++)
2567 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2568 texmins[j] = min(texmins[j], val);
2569 texmaxs[j] = max(texmaxs[j], val);
2572 for (i = 0;i < 2;i++)
2574 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2575 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2578 smax = surface->lightmapinfo->extents[0] >> 4;
2579 tmax = surface->lightmapinfo->extents[1] >> 4;
2580 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2581 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2584 for (i = 0;i < MAXLIGHTMAPS;i++)
2585 surface->lightmapinfo->styles[i] = in->styles[i];
2586 surface->lightmaptexture = NULL;
2587 surface->deluxemaptexture = r_texture_blanknormalmap;
2588 i = LittleLong(in->lightofs);
2591 surface->lightmapinfo->samples = NULL;
2593 // give non-lightmapped water a 1x white lightmap
2594 if (surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2596 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2597 surface->lightmapinfo->styles[0] = 0;
2598 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2602 else if (loadmodel->brush.ishlbsp) // LordHavoc: HalfLife map (bsp version 30)
2603 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + i;
2604 else // LordHavoc: white lighting (bsp version 29)
2606 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (i * 3);
2607 if (loadmodel->brushq1.nmaplightdata)
2608 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (i * 3);
2611 // check if we should apply a lightmap to this
2612 if (!(surface->lightmapinfo->texinfo->flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2614 if (ssize > 256 || tsize > 256)
2615 Host_Error("Bad surface extents");
2617 if (lightmapsize < ssize)
2618 lightmapsize = ssize;
2619 if (lightmapsize < tsize)
2620 lightmapsize = tsize;
2622 totallightmapsamples += ssize*tsize;
2624 // force lightmap upload on first time seeing the surface
2626 // additionally this is used by the later code to see if a
2627 // lightmap is needed on this surface (rather than duplicating the
2629 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2630 loadmodel->lit = true;
2634 // small maps (such as ammo boxes especially) don't need big lightmap
2635 // textures, so this code tries to guess a good size based on
2636 // totallightmapsamples (size of the lightmaps lump basically), as well as
2637 // trying to max out the size if there is a lot of lightmap data to store
2638 // additionally, never choose a lightmapsize that is smaller than the
2639 // largest surface encountered (as it would fail)
2641 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < bound(128, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d)) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2644 // now that we've decided the lightmap texture size, we can do the rest
2645 if (cls.state != ca_dedicated)
2647 int stainmapsize = 0;
2648 mod_alloclightmap_state_t allocState;
2650 Mod_AllocLightmap_Init(&allocState, lightmapsize, lightmapsize);
2651 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2653 int i, iu, iv, lightmapx = 0, lightmapy = 0;
2654 float u, v, ubase, vbase, uscale, vscale;
2656 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2659 smax = surface->lightmapinfo->extents[0] >> 4;
2660 tmax = surface->lightmapinfo->extents[1] >> 4;
2661 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2662 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2663 stainmapsize += ssize * tsize * 3;
2665 if (!lightmaptexture || !Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy))
2667 // allocate a texture pool if we need it
2668 if (loadmodel->texturepool == NULL)
2669 loadmodel->texturepool = R_AllocTexturePool();
2670 // could not find room, make a new lightmap
2671 loadmodel->brushq3.num_mergedlightmaps = lightmapnumber + 1;
2672 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_lightmaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_lightmaps[0]));
2673 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_deluxemaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_deluxemaps[0]));
2674 loadmodel->brushq3.data_lightmaps[lightmapnumber] = lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_ALLOWUPDATES, -1, NULL);
2675 if (loadmodel->brushq1.nmaplightdata)
2676 loadmodel->brushq3.data_deluxemaps[lightmapnumber] = deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_ALLOWUPDATES, -1, NULL);
2678 Mod_AllocLightmap_Reset(&allocState);
2679 Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy);
2681 surface->lightmaptexture = lightmaptexture;
2682 surface->deluxemaptexture = deluxemaptexture;
2683 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2684 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2686 uscale = 1.0f / (float)lightmapsize;
2687 vscale = 1.0f / (float)lightmapsize;
2688 ubase = lightmapx * uscale;
2689 vbase = lightmapy * vscale;
2691 for (i = 0;i < surface->num_vertices;i++)
2693 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);
2694 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);
2695 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2696 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2697 // LordHavoc: calc lightmap data offset for vertex lighting to use
2700 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2704 if (cl_stainmaps.integer)
2706 // allocate stainmaps for permanent marks on walls and clear white
2707 unsigned char *stainsamples = NULL;
2708 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2709 memset(stainsamples, 255, stainmapsize);
2711 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2713 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2715 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2716 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2717 surface->lightmapinfo->stainsamples = stainsamples;
2718 stainsamples += ssize * tsize * 3;
2723 // generate ushort elements array if possible
2724 if (loadmodel->surfmesh.data_element3s)
2725 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2726 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2729 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2732 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2733 node->parent = parent;
2736 // this is a node, recurse to children
2737 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2738 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2739 // combine supercontents of children
2740 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2745 mleaf_t *leaf = (mleaf_t *)node;
2746 // if this is a leaf, calculate supercontents mask from all collidable
2747 // primitives in the leaf (brushes and collision surfaces)
2748 // also flag if the leaf contains any collision surfaces
2749 leaf->combinedsupercontents = 0;
2750 // combine the supercontents values of all brushes in this leaf
2751 for (j = 0;j < leaf->numleafbrushes;j++)
2752 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2753 // check if this leaf contains any collision surfaces (q3 patches)
2754 for (j = 0;j < leaf->numleafsurfaces;j++)
2756 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2757 if (surface->num_collisiontriangles)
2759 leaf->containscollisionsurfaces = true;
2760 leaf->combinedsupercontents |= surface->texture->supercontents;
2766 static void Mod_Q1BSP_LoadNodes(lump_t *l)
2772 in = (dnode_t *)(mod_base + l->fileofs);
2773 if (l->filelen % sizeof(*in))
2774 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2775 count = l->filelen / sizeof(*in);
2777 Host_Error("Mod_Q1BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
2778 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2780 loadmodel->brush.data_nodes = out;
2781 loadmodel->brush.num_nodes = count;
2783 for ( i=0 ; i<count ; i++, in++, out++)
2785 for (j=0 ; j<3 ; j++)
2787 out->mins[j] = LittleShort(in->mins[j]);
2788 out->maxs[j] = LittleShort(in->maxs[j]);
2791 p = LittleLong(in->planenum);
2792 out->plane = loadmodel->brush.data_planes + p;
2794 out->firstsurface = (unsigned short)LittleShort(in->firstface);
2795 out->numsurfaces = (unsigned short)LittleShort(in->numfaces);
2797 for (j=0 ; j<2 ; j++)
2799 // LordHavoc: this code supports broken bsp files produced by
2800 // arguire qbsp which can produce more than 32768 nodes, any value
2801 // below count is assumed to be a node number, any other value is
2802 // assumed to be a leaf number
2803 p = (unsigned short)LittleShort(in->children[j]);
2806 if (p < loadmodel->brush.num_nodes)
2807 out->children[j] = loadmodel->brush.data_nodes + p;
2810 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2811 // map it to the solid leaf
2812 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2817 // note this uses 65535 intentionally, -1 is leaf 0
2819 if (p < loadmodel->brush.num_leafs)
2820 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2823 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2824 // map it to the solid leaf
2825 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2831 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2834 static void Mod_Q1BSP_LoadLeafs(lump_t *l)
2840 in = (dleaf_t *)(mod_base + l->fileofs);
2841 if (l->filelen % sizeof(*in))
2842 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2843 count = l->filelen / sizeof(*in);
2844 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2846 loadmodel->brush.data_leafs = out;
2847 loadmodel->brush.num_leafs = count;
2848 // get visleafs from the submodel data
2849 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2850 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2851 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2852 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2854 for ( i=0 ; i<count ; i++, in++, out++)
2856 for (j=0 ; j<3 ; j++)
2858 out->mins[j] = LittleShort(in->mins[j]);
2859 out->maxs[j] = LittleShort(in->maxs[j]);
2862 // FIXME: this function could really benefit from some error checking
2864 out->contents = LittleLong(in->contents);
2866 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + (unsigned short)LittleShort(in->firstmarksurface);
2867 out->numleafsurfaces = (unsigned short)LittleShort(in->nummarksurfaces);
2868 if ((unsigned short)LittleShort(in->firstmarksurface) + out->numleafsurfaces > loadmodel->brush.num_leafsurfaces)
2870 Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", (int)(out->firstleafsurface - loadmodel->brush.data_leafsurfaces), (int)(out->firstleafsurface + out->numleafsurfaces - loadmodel->brush.data_leafsurfaces), 0, loadmodel->brush.num_leafsurfaces);
2871 out->firstleafsurface = NULL;
2872 out->numleafsurfaces = 0;
2875 out->clusterindex = i - 1;
2876 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
2877 out->clusterindex = -1;
2879 p = LittleLong(in->visofs);
2880 // ignore visofs errors on leaf 0 (solid)
2881 if (p >= 0 && out->clusterindex >= 0)
2883 if (p >= loadmodel->brushq1.num_compressedpvs)
2884 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
2886 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);
2889 for (j = 0;j < 4;j++)
2890 out->ambient_sound_level[j] = in->ambient_level[j];
2892 // FIXME: Insert caustics here
2896 qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
2900 const unsigned char *pvs;
2901 // if there's no vis data, assume supported (because everything is visible all the time)
2902 if (!loadmodel->brush.data_pvsclusters)
2904 // check all liquid leafs to see if they can see into empty leafs, if any
2905 // can we can assume this map supports r_wateralpha
2906 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
2908 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
2910 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
2911 for (j = 0;j < loadmodel->brush.num_leafs;j++)
2912 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
2919 static void Mod_Q1BSP_LoadClipnodes(lump_t *l, hullinfo_t *hullinfo)
2926 in = (dclipnode_t *)(mod_base + l->fileofs);
2927 if (l->filelen % sizeof(*in))
2928 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
2929 count = l->filelen / sizeof(*in);
2930 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2932 loadmodel->brushq1.clipnodes = out;
2933 loadmodel->brushq1.numclipnodes = count;
2935 for (i = 1; i < MAX_MAP_HULLS; i++)
2937 hull = &loadmodel->brushq1.hulls[i];
2938 hull->clipnodes = out;
2939 hull->firstclipnode = 0;
2940 hull->lastclipnode = count-1;
2941 hull->planes = loadmodel->brush.data_planes;
2942 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
2943 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
2944 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
2945 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
2946 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
2947 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
2948 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
2951 for (i=0 ; i<count ; i++, out++, in++)
2953 out->planenum = LittleLong(in->planenum);
2954 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
2955 out->children[0] = (unsigned short)LittleShort(in->children[0]);
2956 out->children[1] = (unsigned short)LittleShort(in->children[1]);
2957 if (out->children[0] >= count)
2958 out->children[0] -= 65536;
2959 if (out->children[1] >= count)
2960 out->children[1] -= 65536;
2961 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
2962 Host_Error("Corrupt clipping hull(out of range planenum)");
2966 //Duplicate the drawing hull structure as a clipping hull
2967 static void Mod_Q1BSP_MakeHull0(void)
2974 hull = &loadmodel->brushq1.hulls[0];
2976 in = loadmodel->brush.data_nodes;
2977 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
2979 hull->clipnodes = out;
2980 hull->firstclipnode = 0;
2981 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
2982 hull->planes = loadmodel->brush.data_planes;
2984 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
2986 out->planenum = in->plane - loadmodel->brush.data_planes;
2987 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
2988 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
2992 static void Mod_Q1BSP_LoadLeaffaces(lump_t *l)
2997 in = (short *)(mod_base + l->fileofs);
2998 if (l->filelen % sizeof(*in))
2999 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
3000 loadmodel->brush.num_leafsurfaces = l->filelen / sizeof(*in);
3001 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
3003 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
3005 j = (unsigned short) LittleShort(in[i]);
3006 if (j >= loadmodel->num_surfaces)
3007 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
3008 loadmodel->brush.data_leafsurfaces[i] = j;
3012 static void Mod_Q1BSP_LoadSurfedges(lump_t *l)
3017 in = (int *)(mod_base + l->fileofs);
3018 if (l->filelen % sizeof(*in))
3019 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
3020 loadmodel->brushq1.numsurfedges = l->filelen / sizeof(*in);
3021 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
3023 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
3024 loadmodel->brushq1.surfedges[i] = LittleLong(in[i]);
3028 static void Mod_Q1BSP_LoadPlanes(lump_t *l)
3034 in = (dplane_t *)(mod_base + l->fileofs);
3035 if (l->filelen % sizeof(*in))
3036 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
3038 loadmodel->brush.num_planes = l->filelen / sizeof(*in);
3039 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
3041 for (i = 0;i < loadmodel->brush.num_planes;i++, in++, out++)
3043 out->normal[0] = LittleFloat(in->normal[0]);
3044 out->normal[1] = LittleFloat(in->normal[1]);
3045 out->normal[2] = LittleFloat(in->normal[2]);
3046 out->dist = LittleFloat(in->dist);
3052 static void Mod_Q1BSP_LoadMapBrushes(void)
3056 int submodel, numbrushes;
3057 qboolean firstbrush;
3058 char *text, *maptext;
3059 char mapfilename[MAX_QPATH];
3060 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
3061 strlcat (mapfilename, ".map", sizeof (mapfilename));
3062 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
3066 if (!COM_ParseToken_Simple(&data, false, false, true))
3071 if (!COM_ParseToken_Simple(&data, false, false, true))
3073 if (com_token[0] != '{')
3079 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
3082 if (!COM_ParseToken_Simple(&data, false, false, true))
3084 if (com_token[0] == '}')
3085 break; // end of entity
3086 if (com_token[0] == '{')
3093 if (submodel > loadmodel->brush.numsubmodels)
3095 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
3099 model = loadmodel->brush.submodels[submodel];
3106 if (!COM_ParseToken_Simple(&data, false, false, true))
3108 if (com_token[0] == '}')
3109 break; // end of brush
3110 // each brush face should be this format:
3111 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
3112 // FIXME: support hl .map format
3113 for (pointnum = 0;pointnum < 3;pointnum++)
3115 COM_ParseToken_Simple(&data, false, false, true);
3116 for (componentnum = 0;componentnum < 3;componentnum++)
3118 COM_ParseToken_Simple(&data, false, false, true);
3119 point[pointnum][componentnum] = atof(com_token);
3121 COM_ParseToken_Simple(&data, false, false, true);
3123 COM_ParseToken_Simple(&data, false, false, true);
3124 strlcpy(facetexture, com_token, sizeof(facetexture));
3125 COM_ParseToken_Simple(&data, false, false, true);
3126 //scroll_s = atof(com_token);
3127 COM_ParseToken_Simple(&data, false, false, true);
3128 //scroll_t = atof(com_token);
3129 COM_ParseToken_Simple(&data, false, false, true);
3130 //rotate = atof(com_token);
3131 COM_ParseToken_Simple(&data, false, false, true);
3132 //scale_s = atof(com_token);
3133 COM_ParseToken_Simple(&data, false, false, true);
3134 //scale_t = atof(com_token);
3135 TriangleNormal(point[0], point[1], point[2], planenormal);
3136 VectorNormalizeDouble(planenormal);
3137 planedist = DotProduct(point[0], planenormal);
3138 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
3148 #define MAX_PORTALPOINTS 64
3150 typedef struct portal_s
3153 mnode_t *nodes[2]; // [0] = front side of plane
3154 struct portal_s *next[2];
3156 double points[3*MAX_PORTALPOINTS];
3157 struct portal_s *chain; // all portals are linked into a list
3161 static memexpandablearray_t portalarray;
3163 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
3165 // process only nodes (leafs already had their box calculated)
3169 // calculate children first
3170 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
3171 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
3173 // make combined bounding box from children
3174 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
3175 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
3176 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
3177 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
3178 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
3179 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
3182 static void Mod_Q1BSP_FinalizePortals(void)
3184 int i, j, numportals, numpoints, portalindex, portalrange = Mem_ExpandableArray_IndexRange(&portalarray);
3188 mleaf_t *leaf, *endleaf;
3190 // tally up portal and point counts and recalculate bounding boxes for all
3191 // leafs (because qbsp is very sloppy)
3192 leaf = loadmodel->brush.data_leafs;
3193 endleaf = leaf + loadmodel->brush.num_leafs;
3194 if (mod_recalculatenodeboxes.integer)
3196 for (;leaf < endleaf;leaf++)
3198 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
3199 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3204 for (portalindex = 0;portalindex < portalrange;portalindex++)
3206 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3209 // note: this check must match the one below or it will usually corrupt memory
3210 // 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
3211 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3214 numpoints += p->numpoints * 2;
3217 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3218 loadmodel->brush.num_portals = numportals;
3219 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3220 loadmodel->brush.num_portalpoints = numpoints;
3221 // clear all leaf portal chains
3222 for (i = 0;i < loadmodel->brush.num_leafs;i++)
3223 loadmodel->brush.data_leafs[i].portals = NULL;
3224 // process all portals in the global portal chain, while freeing them
3225 portal = loadmodel->brush.data_portals;
3226 point = loadmodel->brush.data_portalpoints;
3227 for (portalindex = 0;portalindex < portalrange;portalindex++)
3229 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3232 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3234 // note: this check must match the one above or it will usually corrupt memory
3235 // 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
3236 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3238 // first make the back to front portal(forward portal)
3239 portal->points = point;
3240 portal->numpoints = p->numpoints;
3241 portal->plane.dist = p->plane.dist;
3242 VectorCopy(p->plane.normal, portal->plane.normal);
3243 portal->here = (mleaf_t *)p->nodes[1];
3244 portal->past = (mleaf_t *)p->nodes[0];
3246 for (j = 0;j < portal->numpoints;j++)
3248 VectorCopy(p->points + j*3, point->position);
3251 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3252 PlaneClassify(&portal->plane);
3254 // link into leaf's portal chain
3255 portal->next = portal->here->portals;
3256 portal->here->portals = portal;
3258 // advance to next portal
3261 // then make the front to back portal(backward portal)
3262 portal->points = point;
3263 portal->numpoints = p->numpoints;
3264 portal->plane.dist = -p->plane.dist;
3265 VectorNegate(p->plane.normal, portal->plane.normal);
3266 portal->here = (mleaf_t *)p->nodes[0];
3267 portal->past = (mleaf_t *)p->nodes[1];
3269 for (j = portal->numpoints - 1;j >= 0;j--)
3271 VectorCopy(p->points + j*3, point->position);
3274 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3275 PlaneClassify(&portal->plane);
3277 // link into leaf's portal chain
3278 portal->next = portal->here->portals;
3279 portal->here->portals = portal;
3281 // advance to next portal
3284 // add the portal's polygon points to the leaf bounding boxes
3285 if (mod_recalculatenodeboxes.integer)
3287 for (i = 0;i < 2;i++)
3289 leaf = (mleaf_t *)p->nodes[i];
3290 for (j = 0;j < p->numpoints;j++)
3292 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3293 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3294 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3295 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3296 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3297 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3303 // now recalculate the node bounding boxes from the leafs
3304 if (mod_recalculatenodeboxes.integer)
3305 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3313 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3316 Host_Error("AddPortalToNodes: NULL front node");
3318 Host_Error("AddPortalToNodes: NULL back node");
3319 if (p->nodes[0] || p->nodes[1])
3320 Host_Error("AddPortalToNodes: already included");
3321 // 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
3323 p->nodes[0] = front;
3324 p->next[0] = (portal_t *)front->portals;
3325 front->portals = (mportal_t *)p;
3328 p->next[1] = (portal_t *)back->portals;
3329 back->portals = (mportal_t *)p;
3334 RemovePortalFromNode
3337 static void RemovePortalFromNodes(portal_t *portal)
3341 void **portalpointer;
3343 for (i = 0;i < 2;i++)
3345 node = portal->nodes[i];
3347 portalpointer = (void **) &node->portals;
3350 t = (portal_t *)*portalpointer;
3352 Host_Error("RemovePortalFromNodes: portal not in leaf");
3356 if (portal->nodes[0] == node)
3358 *portalpointer = portal->next[0];
3359 portal->nodes[0] = NULL;
3361 else if (portal->nodes[1] == node)
3363 *portalpointer = portal->next[1];
3364 portal->nodes[1] = NULL;
3367 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3371 if (t->nodes[0] == node)
3372 portalpointer = (void **) &t->next[0];
3373 else if (t->nodes[1] == node)
3374 portalpointer = (void **) &t->next[1];
3376 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3381 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3382 static double *portalpointsbuffer;
3383 static int portalpointsbufferoffset;
3384 static int portalpointsbuffersize;
3385 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3388 mnode_t *front, *back, *other_node;
3389 mplane_t clipplane, *plane;
3390 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3391 int numfrontpoints, numbackpoints;
3392 double *frontpoints, *backpoints;
3394 // if a leaf, we're done
3398 // get some space for our clipping operations to use
3399 if (portalpointsbuffersize < portalpointsbufferoffset + 6*MAX_PORTALPOINTS)
3401 portalpointsbuffersize = portalpointsbufferoffset * 2;
3402 portalpointsbuffer = (double *)Mem_Realloc(loadmodel->mempool, portalpointsbuffer, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3404 frontpoints = portalpointsbuffer + portalpointsbufferoffset;
3405 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3406 backpoints = portalpointsbuffer + portalpointsbufferoffset;
3407 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3409 plane = node->plane;
3411 front = node->children[0];
3412 back = node->children[1];
3414 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3416 // create the new portal by generating a polygon for the node plane,
3417 // and clipping it by all of the other portals(which came from nodes above this one)
3418 nodeportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3419 nodeportal->plane = *plane;
3421 // 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)
3422 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);
3423 nodeportal->numpoints = 4;
3424 side = 0; // shut up compiler warning
3425 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3427 clipplane = portal->plane;
3428 if (portal->nodes[0] == portal->nodes[1])
3429 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3430 if (portal->nodes[0] == node)
3432 else if (portal->nodes[1] == node)
3434 clipplane.dist = -clipplane.dist;
3435 VectorNegate(clipplane.normal, clipplane.normal);
3439 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3441 for (i = 0;i < nodeportal->numpoints*3;i++)
3442 frontpoints[i] = nodeportal->points[i];
3443 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);
3444 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3448 if (nodeportal->numpoints < 3)
3450 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3451 nodeportal->numpoints = 0;
3453 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3455 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3456 nodeportal->numpoints = 0;
3459 AddPortalToNodes(nodeportal, front, back);
3461 // split the portals of this node along this node's plane and assign them to the children of this node
3462 // (migrating the portals downward through the tree)
3463 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3465 if (portal->nodes[0] == portal->nodes[1])
3466 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3467 if (portal->nodes[0] == node)
3469 else if (portal->nodes[1] == node)
3472 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3473 nextportal = portal->next[side];
3474 if (!portal->numpoints)
3477 other_node = portal->nodes[!side];
3478 RemovePortalFromNodes(portal);
3480 // cut the portal into two portals, one on each side of the node plane
3481 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);
3483 if (!numfrontpoints)
3486 AddPortalToNodes(portal, back, other_node);
3488 AddPortalToNodes(portal, other_node, back);
3494 AddPortalToNodes(portal, front, other_node);
3496 AddPortalToNodes(portal, other_node, front);
3500 // the portal is split
3501 splitportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3502 temp = splitportal->chain;
3503 *splitportal = *portal;
3504 splitportal->chain = temp;
3505 for (i = 0;i < numbackpoints*3;i++)
3506 splitportal->points[i] = backpoints[i];
3507 splitportal->numpoints = numbackpoints;
3508 for (i = 0;i < numfrontpoints*3;i++)
3509 portal->points[i] = frontpoints[i];
3510 portal->numpoints = numfrontpoints;
3514 AddPortalToNodes(portal, front, other_node);
3515 AddPortalToNodes(splitportal, back, other_node);
3519 AddPortalToNodes(portal, other_node, front);
3520 AddPortalToNodes(splitportal, other_node, back);
3524 Mod_Q1BSP_RecursiveNodePortals(front);
3525 Mod_Q1BSP_RecursiveNodePortals(back);
3527 portalpointsbufferoffset -= 6*MAX_PORTALPOINTS;
3530 static void Mod_Q1BSP_MakePortals(void)
3532 Mem_ExpandableArray_NewArray(&portalarray, loadmodel->mempool, sizeof(portal_t), 1020*1024/sizeof(portal_t));
3533 portalpointsbufferoffset = 0;
3534 portalpointsbuffersize = 6*MAX_PORTALPOINTS*128;
3535 portalpointsbuffer = (double *)Mem_Alloc(loadmodel->mempool, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3536 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3537 Mem_Free(portalpointsbuffer);
3538 portalpointsbuffer = NULL;
3539 portalpointsbufferoffset = 0;
3540 portalpointsbuffersize = 0;
3541 Mod_Q1BSP_FinalizePortals();
3542 Mem_ExpandableArray_FreeArray(&portalarray);
3545 //Returns PVS data for a given point
3546 //(note: can return NULL)
3547 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3550 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3552 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3553 if (((mleaf_t *)node)->clusterindex >= 0)
3554 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3559 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)
3563 float d = PlaneDiff(org, node->plane);
3565 node = node->children[0];
3566 else if (d < -radius)
3567 node = node->children[1];
3570 // go down both sides
3571 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3572 node = node->children[1];
3575 // if this leaf is in a cluster, accumulate the pvs bits
3576 if (((mleaf_t *)node)->clusterindex >= 0)
3579 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3580 for (i = 0;i < pvsbytes;i++)
3581 pvsbuffer[i] |= pvs[i];
3585 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3586 //of the given point.
3587 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3589 int bytes = model->brush.num_pvsclusterbytes;
3590 bytes = min(bytes, pvsbufferlength);
3591 if (r_novis.integer || r_trippy.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3593 memset(pvsbuffer, 0xFF, bytes);
3597 memset(pvsbuffer, 0, bytes);
3598 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3602 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3607 VectorSubtract(inmaxs, inmins, size);
3608 if (cmodel->brush.ishlbsp)
3611 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3612 else if (size[0] <= 32)
3614 if (size[2] < 54) // pick the nearest of 36 or 72
3615 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3617 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3620 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3625 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3626 else if (size[0] <= 32)
3627 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3629 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3631 VectorCopy(inmins, outmins);
3632 VectorAdd(inmins, hull->clip_size, outmaxs);
3635 static int Mod_Q1BSP_CreateShadowMesh(dp_model_t *mod)
3638 int numshadowmeshtriangles = 0;
3639 msurface_t *surface;
3640 if (cls.state == ca_dedicated)
3642 // make a single combined shadow mesh to allow optimized shadow volume creation
3644 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3646 surface->num_firstshadowmeshtriangle = numshadowmeshtriangles;
3647 numshadowmeshtriangles += surface->num_triangles;
3649 mod->brush.shadowmesh = Mod_ShadowMesh_Begin(mod->mempool, numshadowmeshtriangles * 3, numshadowmeshtriangles, NULL, NULL, NULL, false, false, true);
3650 for (j = 0, surface = mod->data_surfaces;j < mod->num_surfaces;j++, surface++)
3651 if (surface->num_triangles > 0)
3652 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));
3653 mod->brush.shadowmesh = Mod_ShadowMesh_Finish(mod->mempool, mod->brush.shadowmesh, false, r_enableshadowvolumes.integer != 0, false);
3654 if (mod->brush.shadowmesh && mod->brush.shadowmesh->neighbor3i)
3655 Mod_BuildTriangleNeighbors(mod->brush.shadowmesh->neighbor3i, mod->brush.shadowmesh->element3i, mod->brush.shadowmesh->numtriangles);
3657 return numshadowmeshtriangles;
3660 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);
3662 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3667 float dist, modelyawradius, modelradius;
3668 msurface_t *surface;
3669 hullinfo_t hullinfo;
3670 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3671 model_brush_lightstyleinfo_t styleinfo[256];
3672 unsigned char *datapointer;
3674 mod->modeldatatypestring = "Q1BSP";
3676 mod->type = mod_brushq1;
3678 header = (dheader_t *)buffer;
3680 i = LittleLong(header->version);
3681 if (i != BSPVERSION && i != 30)
3682 Host_Error("Mod_Q1BSP_Load: %s has wrong version number(%i should be %i(Quake) or 30(HalfLife)", mod->name, i, BSPVERSION);
3683 mod->brush.ishlbsp = i == 30;
3685 // fill in hull info
3686 VectorClear (hullinfo.hullsizes[0][0]);
3687 VectorClear (hullinfo.hullsizes[0][1]);
3688 if (mod->brush.ishlbsp)
3690 mod->modeldatatypestring = "HLBSP";
3692 hullinfo.filehulls = 4;
3693 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3694 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3695 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3696 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3697 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3698 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3702 hullinfo.filehulls = 4;
3703 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3704 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3705 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3706 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3710 mod_base = (unsigned char*)buffer;
3711 for (i = 0; i < HEADER_LUMPS; i++)
3713 header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs);
3714 header->lumps[i].filelen = LittleLong(header->lumps[i].filelen);
3717 mod->soundfromcenter = true;
3718 mod->TraceBox = Mod_Q1BSP_TraceBox;
3719 if (sv_gameplayfix_q1bsptracelinereportstexture.integer)
3720 mod->TraceLine = Mod_Q1BSP_TraceLineAgainstSurfaces; // LordHavoc: use the surface-hitting version of TraceLine in all cases
3722 mod->TraceLine = Mod_Q1BSP_TraceLine;
3723 mod->TracePoint = Mod_Q1BSP_TracePoint;
3724 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3725 mod->TraceLineAgainstSurfaces = Mod_Q1BSP_TraceLineAgainstSurfaces;
3726 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3727 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3728 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3729 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3730 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3731 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3732 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3733 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3734 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3735 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3736 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3737 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3738 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3739 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3740 mod->Draw = R_Q1BSP_Draw;
3741 mod->DrawDepth = R_Q1BSP_DrawDepth;
3742 mod->DrawDebug = R_Q1BSP_DrawDebug;
3743 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
3744 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3745 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3746 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3747 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
3748 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
3749 mod->DrawLight = R_Q1BSP_DrawLight;
3753 mod->brush.qw_md4sum = 0;
3754 mod->brush.qw_md4sum2 = 0;
3755 for (i = 0;i < HEADER_LUMPS;i++)
3758 if (i == LUMP_ENTITIES)
3760 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3761 mod->brush.qw_md4sum ^= LittleLong(temp);
3762 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3764 temp = Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
3765 mod->brush.qw_md4sum2 ^= LittleLong(temp);
3768 Mod_Q1BSP_LoadEntities(&header->lumps[LUMP_ENTITIES]);
3769 Mod_Q1BSP_LoadVertexes(&header->lumps[LUMP_VERTEXES]);
3770 Mod_Q1BSP_LoadEdges(&header->lumps[LUMP_EDGES]);
3771 Mod_Q1BSP_LoadSurfedges(&header->lumps[LUMP_SURFEDGES]);
3772 Mod_Q1BSP_LoadTextures(&header->lumps[LUMP_TEXTURES]);
3773 Mod_Q1BSP_LoadLighting(&header->lumps[LUMP_LIGHTING]);
3774 Mod_Q1BSP_LoadPlanes(&header->lumps[LUMP_PLANES]);
3775 Mod_Q1BSP_LoadTexinfo(&header->lumps[LUMP_TEXINFO]);
3776 Mod_Q1BSP_LoadFaces(&header->lumps[LUMP_FACES]);
3777 Mod_Q1BSP_LoadLeaffaces(&header->lumps[LUMP_MARKSURFACES]);
3778 Mod_Q1BSP_LoadVisibility(&header->lumps[LUMP_VISIBILITY]);
3779 // load submodels before leafs because they contain the number of vis leafs
3780 Mod_Q1BSP_LoadSubmodels(&header->lumps[LUMP_MODELS], &hullinfo);
3781 Mod_Q1BSP_LoadLeafs(&header->lumps[LUMP_LEAFS]);
3782 Mod_Q1BSP_LoadNodes(&header->lumps[LUMP_NODES]);
3783 Mod_Q1BSP_LoadClipnodes(&header->lumps[LUMP_CLIPNODES], &hullinfo);
3785 // check if the map supports transparent water rendering
3786 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
3788 if (mod->brushq1.data_compressedpvs)
3789 Mem_Free(mod->brushq1.data_compressedpvs);
3790 mod->brushq1.data_compressedpvs = NULL;
3791 mod->brushq1.num_compressedpvs = 0;
3793 Mod_Q1BSP_MakeHull0();
3794 if (mod_bsp_portalize.integer)
3795 Mod_Q1BSP_MakePortals();
3797 mod->numframes = 2; // regular and alternate animation
3800 // make a single combined shadow mesh to allow optimized shadow volume creation
3801 Mod_Q1BSP_CreateShadowMesh(loadmodel);
3803 if (loadmodel->brush.numsubmodels)
3804 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
3806 // LordHavoc: to clear the fog around the original quake submodel code, I
3808 // first of all, some background info on the submodels:
3809 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
3810 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
3811 // now the weird for loop itself:
3812 // the loop functions in an odd way, on each iteration it sets up the
3813 // current 'mod' model (which despite the confusing code IS the model of
3814 // the number i), at the end of the loop it duplicates the model to become
3815 // the next submodel, and loops back to set up the new submodel.
3817 // LordHavoc: now the explanation of my sane way (which works identically):
3818 // set up the world model, then on each submodel copy from the world model
3819 // and set up the submodel with the respective model info.
3820 totalstylesurfaces = 0;
3822 for (i = 0;i < mod->brush.numsubmodels;i++)
3824 memset(stylecounts, 0, sizeof(stylecounts));
3825 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
3827 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
3828 for (j = 0;j < MAXLIGHTMAPS;j++)
3829 stylecounts[surface->lightmapinfo->styles[j]]++;
3831 for (k = 0;k < 255;k++)
3835 totalstylesurfaces += stylecounts[k];
3838 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
3839 for (i = 0;i < mod->brush.numsubmodels;i++)
3841 // LordHavoc: this code was originally at the end of this loop, but
3842 // has been transformed to something more readable at the start here.
3847 // duplicate the basic information
3848 dpsnprintf(name, sizeof(name), "*%i", i);
3849 mod = Mod_FindName(name, loadmodel->name);
3850 // copy the base model to this one
3852 // rename the clone back to its proper name
3853 strlcpy(mod->name, name, sizeof(mod->name));
3854 mod->brush.parentmodel = loadmodel;
3855 // textures and memory belong to the main model
3856 mod->texturepool = NULL;
3857 mod->mempool = NULL;
3858 mod->brush.GetPVS = NULL;
3859 mod->brush.FatPVS = NULL;
3860 mod->brush.BoxTouchingPVS = NULL;
3861 mod->brush.BoxTouchingLeafPVS = NULL;
3862 mod->brush.BoxTouchingVisibleLeafs = NULL;
3863 mod->brush.FindBoxClusters = NULL;
3864 mod->brush.LightPoint = NULL;
3865 mod->brush.AmbientSoundLevelsForPoint = NULL;
3868 mod->brush.submodel = i;
3870 if (loadmodel->brush.submodels)
3871 loadmodel->brush.submodels[i] = mod;
3873 bm = &mod->brushq1.submodels[i];
3875 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
3876 for (j=1 ; j<MAX_MAP_HULLS ; j++)
3878 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
3879 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
3882 mod->firstmodelsurface = bm->firstface;
3883 mod->nummodelsurfaces = bm->numfaces;
3885 // set node/leaf parents for this submodel
3886 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
3888 // make the model surface list (used by shadowing/lighting)
3889 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
3890 Mod_MakeSortedSurfaces(mod);
3892 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
3893 // (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)
3894 VectorCopy(bm->mins, mod->normalmins);
3895 VectorCopy(bm->maxs, mod->normalmaxs);
3896 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
3897 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
3898 modelyawradius = dist*dist+modelyawradius*modelyawradius;
3899 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
3900 modelradius = modelyawradius + modelradius * modelradius;
3901 modelyawradius = sqrt(modelyawradius);
3902 modelradius = sqrt(modelradius);
3903 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
3904 mod->yawmins[2] = mod->normalmins[2];
3905 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
3906 mod->yawmaxs[2] = mod->normalmaxs[2];
3907 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
3908 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
3909 mod->radius = modelradius;
3910 mod->radius2 = modelradius * modelradius;
3912 // this gets altered below if sky or water is used
3913 mod->DrawSky = NULL;
3914 mod->DrawAddWaterPlanes = NULL;
3916 // scan surfaces for sky and water and flag the submodel as possessing these features or not
3917 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
3918 if (mod->nummodelsurfaces)
3920 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3921 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3923 if (j < mod->nummodelsurfaces)
3924 mod->DrawSky = R_Q1BSP_DrawSky;
3926 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
3927 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
3929 if (j < mod->nummodelsurfaces)
3930 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
3932 // build lightstyle update chains
3933 // (used to rapidly mark lightmapupdateflags on many surfaces
3934 // when d_lightstylevalue changes)
3935 memset(stylecounts, 0, sizeof(stylecounts));
3936 for (k = 0;k < mod->nummodelsurfaces;k++)
3938 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3939 for (j = 0;j < MAXLIGHTMAPS;j++)
3940 stylecounts[surface->lightmapinfo->styles[j]]++;
3942 mod->brushq1.num_lightstyles = 0;
3943 for (k = 0;k < 255;k++)
3947 styleinfo[mod->brushq1.num_lightstyles].style = k;
3948 styleinfo[mod->brushq1.num_lightstyles].value = 0;
3949 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
3950 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
3951 remapstyles[k] = mod->brushq1.num_lightstyles;
3952 mod->brushq1.num_lightstyles++;
3955 for (k = 0;k < mod->nummodelsurfaces;k++)
3957 surface = mod->data_surfaces + mod->firstmodelsurface + k;
3958 for (j = 0;j < MAXLIGHTMAPS;j++)
3960 if (surface->lightmapinfo->styles[j] != 255)
3962 int r = remapstyles[surface->lightmapinfo->styles[j]];
3963 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
3967 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
3968 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
3972 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
3973 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
3975 //mod->brushq1.num_visleafs = bm->visleafs;
3977 // build a Bounding Interval Hierarchy for culling triangles in light rendering
3978 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
3980 if (mod_q1bsp_polygoncollisions.integer)
3982 mod->collision_bih = mod->render_bih;
3983 // point traces and contents checks still use the bsp tree
3984 mod->TraceLine = Mod_CollisionBIH_TraceLine;
3985 mod->TraceBox = Mod_CollisionBIH_TraceBox;
3986 mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
3987 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLineAgainstSurfaces;
3990 // generate VBOs and other shared data before cloning submodels
3994 Mod_Q1BSP_LoadMapBrushes();
3995 //Mod_Q1BSP_ProcessLightList();
3999 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);
4002 static void Mod_Q2BSP_LoadEntities(lump_t *l)
4006 static void Mod_Q2BSP_LoadPlanes(lump_t *l)
4013 in = (void *)(mod_base + l->fileofs);
4014 if (l->filelen % sizeof(*in))
4015 Host_Error("Mod_Q2BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4016 count = l->filelen / sizeof(*in);
4017 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4020 loadmodel->num = count;
4022 for (i = 0;i < count;i++, in++, out++)
4028 static void Mod_Q2BSP_LoadVertices(lump_t *l)
4035 in = (void *)(mod_base + l->fileofs);
4036 if (l->filelen % sizeof(*in))
4037 Host_Error("Mod_Q2BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4038 count = l->filelen / sizeof(*in);
4039 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4042 loadmodel->num = count;
4044 for (i = 0;i < count;i++, in++, out++)
4050 static void Mod_Q2BSP_LoadVisibility(lump_t *l)
4057 in = (void *)(mod_base + l->fileofs);
4058 if (l->filelen % sizeof(*in))
4059 Host_Error("Mod_Q2BSP_LoadVisibility: funny lump size in %s",loadmodel->name);
4060 count = l->filelen / sizeof(*in);
4061 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4064 loadmodel->num = count;
4066 for (i = 0;i < count;i++, in++, out++)
4072 static void Mod_Q2BSP_LoadNodes(lump_t *l)
4079 in = (void *)(mod_base + l->fileofs);
4080 if (l->filelen % sizeof(*in))
4081 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4082 count = l->filelen / sizeof(*in);
4083 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4086 loadmodel->num = count;
4088 for (i = 0;i < count;i++, in++, out++)
4094 static void Mod_Q2BSP_LoadTexInfo(lump_t *l)
4101 in = (void *)(mod_base + l->fileofs);
4102 if (l->filelen % sizeof(*in))
4103 Host_Error("Mod_Q2BSP_LoadTexInfo: funny lump size in %s",loadmodel->name);
4104 count = l->filelen / sizeof(*in);
4105 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4108 loadmodel->num = count;
4110 for (i = 0;i < count;i++, in++, out++)
4116 static void Mod_Q2BSP_LoadFaces(lump_t *l)
4123 in = (void *)(mod_base + l->fileofs);
4124 if (l->filelen % sizeof(*in))
4125 Host_Error("Mod_Q2BSP_LoadFaces: funny lump size in %s",loadmodel->name);
4126 count = l->filelen / sizeof(*in);
4127 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4130 loadmodel->num = count;
4132 for (i = 0;i < count;i++, in++, out++)
4138 static void Mod_Q2BSP_LoadLighting(lump_t *l)
4145 in = (void *)(mod_base + l->fileofs);
4146 if (l->filelen % sizeof(*in))
4147 Host_Error("Mod_Q2BSP_LoadLighting: funny lump size in %s",loadmodel->name);
4148 count = l->filelen / sizeof(*in);
4149 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4152 loadmodel->num = count;
4154 for (i = 0;i < count;i++, in++, out++)
4160 static void Mod_Q2BSP_LoadLeafs(lump_t *l)
4167 in = (void *)(mod_base + l->fileofs);
4168 if (l->filelen % sizeof(*in))
4169 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4170 count = l->filelen / sizeof(*in);
4171 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4174 loadmodel->num = count;
4176 for (i = 0;i < count;i++, in++, out++)
4182 static void Mod_Q2BSP_LoadLeafFaces(lump_t *l)
4189 in = (void *)(mod_base + l->fileofs);
4190 if (l->filelen % sizeof(*in))
4191 Host_Error("Mod_Q2BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
4192 count = l->filelen / sizeof(*in);
4193 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4196 loadmodel->num = count;
4198 for (i = 0;i < count;i++, in++, out++)
4204 static void Mod_Q2BSP_LoadLeafBrushes(lump_t *l)
4211 in = (void *)(mod_base + l->fileofs);
4212 if (l->filelen % sizeof(*in))
4213 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4214 count = l->filelen / sizeof(*in);
4215 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4218 loadmodel->num = count;
4220 for (i = 0;i < count;i++, in++, out++)
4226 static void Mod_Q2BSP_LoadEdges(lump_t *l)
4233 in = (void *)(mod_base + l->fileofs);
4234 if (l->filelen % sizeof(*in))
4235 Host_Error("Mod_Q2BSP_LoadEdges: funny lump size in %s",loadmodel->name);
4236 count = l->filelen / sizeof(*in);
4237 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4240 loadmodel->num = count;
4242 for (i = 0;i < count;i++, in++, out++)
4248 static void Mod_Q2BSP_LoadSurfEdges(lump_t *l)
4255 in = (void *)(mod_base + l->fileofs);
4256 if (l->filelen % sizeof(*in))
4257 Host_Error("Mod_Q2BSP_LoadSurfEdges: funny lump size in %s",loadmodel->name);
4258 count = l->filelen / sizeof(*in);
4259 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4262 loadmodel->num = count;
4264 for (i = 0;i < count;i++, in++, out++)
4270 static void Mod_Q2BSP_LoadBrushes(lump_t *l)
4277 in = (void *)(mod_base + l->fileofs);
4278 if (l->filelen % sizeof(*in))
4279 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4280 count = l->filelen / sizeof(*in);
4281 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4284 loadmodel->num = count;
4286 for (i = 0;i < count;i++, in++, out++)
4292 static void Mod_Q2BSP_LoadBrushSides(lump_t *l)
4299 in = (void *)(mod_base + l->fileofs);
4300 if (l->filelen % sizeof(*in))
4301 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4302 count = l->filelen / sizeof(*in);
4303 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4306 loadmodel->num = count;
4308 for (i = 0;i < count;i++, in++, out++)
4314 static void Mod_Q2BSP_LoadAreas(lump_t *l)
4321 in = (void *)(mod_base + l->fileofs);
4322 if (l->filelen % sizeof(*in))
4323 Host_Error("Mod_Q2BSP_LoadAreas: funny lump size in %s",loadmodel->name);
4324 count = l->filelen / sizeof(*in);
4325 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4328 loadmodel->num = count;
4330 for (i = 0;i < count;i++, in++, out++)
4336 static void Mod_Q2BSP_LoadAreaPortals(lump_t *l)
4343 in = (void *)(mod_base + l->fileofs);
4344 if (l->filelen % sizeof(*in))
4345 Host_Error("Mod_Q2BSP_LoadAreaPortals: funny lump size in %s",loadmodel->name);
4346 count = l->filelen / sizeof(*in);
4347 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4350 loadmodel->num = count;
4352 for (i = 0;i < count;i++, in++, out++)
4358 static void Mod_Q2BSP_LoadModels(lump_t *l)
4365 in = (void *)(mod_base + l->fileofs);
4366 if (l->filelen % sizeof(*in))
4367 Host_Error("Mod_Q2BSP_LoadModels: funny lump size in %s",loadmodel->name);
4368 count = l->filelen / sizeof(*in);
4369 out = Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4372 loadmodel->num = count;
4374 for (i = 0;i < count;i++, in++, out++)
4380 void static Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4383 q2dheader_t *header;
4385 Host_Error("Mod_Q2BSP_Load: not yet implemented");
4387 mod->modeldatatypestring = "Q2BSP";
4389 mod->type = mod_brushq2;
4391 header = (q2dheader_t *)buffer;
4393 i = LittleLong(header->version);
4394 if (i != Q2BSPVERSION)
4395 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4397 mod_base = (unsigned char *)header;
4399 // swap all the lumps
4400 for (i = 0;i < (int) sizeof(*header) / 4;i++)
4401 ((int *)header)[i] = LittleLong(((int *)header)[i]);
4403 mod->brush.qw_md4sum = 0;
4404 mod->brush.qw_md4sum2 = 0;
4405 for (i = 0;i < Q2HEADER_LUMPS;i++)
4407 if (i == Q2LUMP_ENTITIES)
4409 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4410 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4412 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
4415 Mod_Q2BSP_LoadEntities(&header->lumps[Q2LUMP_ENTITIES]);
4416 Mod_Q2BSP_LoadPlanes(&header->lumps[Q2LUMP_PLANES]);
4417 Mod_Q2BSP_LoadVertices(&header->lumps[Q2LUMP_VERTEXES]);
4418 Mod_Q2BSP_LoadVisibility(&header->lumps[Q2LUMP_VISIBILITY]);
4419 Mod_Q2BSP_LoadNodes(&header->lumps[Q2LUMP_NODES]);
4420 Mod_Q2BSP_LoadTexInfo(&header->lumps[Q2LUMP_TEXINFO]);
4421 Mod_Q2BSP_LoadFaces(&header->lumps[Q2LUMP_FACES]);
4422 Mod_Q2BSP_LoadLighting(&header->lumps[Q2LUMP_LIGHTING]);
4423 Mod_Q2BSP_LoadLeafs(&header->lumps[Q2LUMP_LEAFS]);
4424 Mod_Q2BSP_LoadLeafFaces(&header->lumps[Q2LUMP_LEAFFACES]);
4425 Mod_Q2BSP_LoadLeafBrushes(&header->lumps[Q2LUMP_LEAFBRUSHES]);
4426 Mod_Q2BSP_LoadEdges(&header->lumps[Q2LUMP_EDGES]);
4427 Mod_Q2BSP_LoadSurfEdges(&header->lumps[Q2LUMP_SURFEDGES]);
4428 Mod_Q2BSP_LoadBrushes(&header->lumps[Q2LUMP_BRUSHES]);
4429 Mod_Q2BSP_LoadBrushSides(&header->lumps[Q2LUMP_BRUSHSIDES]);
4430 Mod_Q2BSP_LoadAreas(&header->lumps[Q2LUMP_AREAS]);
4431 Mod_Q2BSP_LoadAreaPortals(&header->lumps[Q2LUMP_AREAPORTALS]);
4432 // LordHavoc: must go last because this makes the submodels
4433 Mod_Q2BSP_LoadModels(&header->lumps[Q2LUMP_MODELS]);
4436 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents);
4437 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents);
4439 static void Mod_Q3BSP_LoadEntities(lump_t *l)
4442 char key[128], value[MAX_INPUTLINE];
4444 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
4445 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
4446 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
4449 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
4450 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
4451 loadmodel->brush.entities[l->filelen] = 0;
4452 data = loadmodel->brush.entities;
4453 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
4454 // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
4455 loadmodel->brushq3.deluxemapping = false;
4456 if (data && COM_ParseToken_Simple(&data, false, false, true) && com_token[0] == '{')
4460 if (!COM_ParseToken_Simple(&data, false, false, true))
4462 if (com_token[0] == '}')
4463 break; // end of worldspawn
4464 if (com_token[0] == '_')
4465 strlcpy(key, com_token + 1, sizeof(key));
4467 strlcpy(key, com_token, sizeof(key));
4468 while (key[strlen(key)-1] == ' ') // remove trailing spaces
4469 key[strlen(key)-1] = 0;
4470 if (!COM_ParseToken_Simple(&data, false, false, true))
4472 strlcpy(value, com_token, sizeof(value));
4473 if (!strcasecmp("gridsize", key)) // this one is case insensitive to 100% match q3map2
4475 #if _MSC_VER >= 1400
4476 #define sscanf sscanf_s
4479 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
4480 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4482 VectorSet(v, 64, 64, 128);
4483 if(sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) != 3)
4484 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]);
4485 if (v[0] != 0 && v[1] != 0 && v[2] != 0)
4486 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
4489 else if (!strcmp("deluxeMaps", key))
4491 if (!strcmp(com_token, "1"))
4493 loadmodel->brushq3.deluxemapping = true;
4494 loadmodel->brushq3.deluxemapping_modelspace = true;
4496 else if (!strcmp(com_token, "2"))
4498 loadmodel->brushq3.deluxemapping = true;
4499 loadmodel->brushq3.deluxemapping_modelspace = false;
4506 static void Mod_Q3BSP_LoadTextures(lump_t *l)
4512 in = (q3dtexture_t *)(mod_base + l->fileofs);
4513 if (l->filelen % sizeof(*in))
4514 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
4515 count = l->filelen / sizeof(*in);
4516 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4518 loadmodel->data_textures = out;
4519 loadmodel->num_textures = count;
4520 loadmodel->num_texturesperskin = loadmodel->num_textures;
4522 for (i = 0;i < count;i++)
4524 strlcpy (out[i].name, in[i].name, sizeof (out[i].name));
4525 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4526 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4527 Mod_LoadTextureFromQ3Shader(out + i, out[i].name, true, true, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS);
4528 // restore the surfaceflags and supercontents
4529 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
4530 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(loadmodel, LittleLong(in[i].contents));
4534 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
4540 in = (q3dplane_t *)(mod_base + l->fileofs);
4541 if (l->filelen % sizeof(*in))
4542 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
4543 count = l->filelen / sizeof(*in);
4544 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4546 loadmodel->brush.data_planes = out;
4547 loadmodel->brush.num_planes = count;
4549 for (i = 0;i < count;i++, in++, out++)
4551 out->normal[0] = LittleFloat(in->normal[0]);
4552 out->normal[1] = LittleFloat(in->normal[1]);
4553 out->normal[2] = LittleFloat(in->normal[2]);
4554 out->dist = LittleFloat(in->dist);
4559 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
4562 q3mbrushside_t *out;
4565 in = (q3dbrushside_t *)(mod_base + l->fileofs);
4566 if (l->filelen % sizeof(*in))
4567 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4568 count = l->filelen / sizeof(*in);
4569 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4571 loadmodel->brush.data_brushsides = out;
4572 loadmodel->brush.num_brushsides = count;
4574 for (i = 0;i < count;i++, in++, out++)
4576 n = LittleLong(in->planeindex);
4577 if (n < 0 || n >= loadmodel->brush.num_planes)
4578 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4579 out->plane = loadmodel->brush.data_planes + n;
4580 n = LittleLong(in->textureindex);
4581 if (n < 0 || n >= loadmodel->num_textures)
4582 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4583 out->texture = loadmodel->data_textures + n;
4587 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
4589 q3dbrushside_ig_t *in;
4590 q3mbrushside_t *out;
4593 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
4594 if (l->filelen % sizeof(*in))
4595 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4596 count = l->filelen / sizeof(*in);
4597 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4599 loadmodel->brush.data_brushsides = out;
4600 loadmodel->brush.num_brushsides = count;
4602 for (i = 0;i < count;i++, in++, out++)
4604 n = LittleLong(in->planeindex);
4605 if (n < 0 || n >= loadmodel->brush.num_planes)
4606 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4607 out->plane = loadmodel->brush.data_planes + n;
4608 n = LittleLong(in->textureindex);
4609 if (n < 0 || n >= loadmodel->num_textures)
4610 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4611 out->texture = loadmodel->data_textures + n;
4615 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
4619 int i, j, n, c, count, maxplanes, q3surfaceflags;
4620 colplanef_t *planes;
4622 in = (q3dbrush_t *)(mod_base + l->fileofs);
4623 if (l->filelen % sizeof(*in))
4624 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4625 count = l->filelen / sizeof(*in);
4626 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4628 loadmodel->brush.data_brushes = out;
4629 loadmodel->brush.num_brushes = count;
4634 for (i = 0;i < count;i++, in++, out++)
4636 n = LittleLong(in->firstbrushside);
4637 c = LittleLong(in->numbrushsides);
4638 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
4639 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
4640 out->firstbrushside = loadmodel->brush.data_brushsides + n;
4641 out->numbrushsides = c;
4642 n = LittleLong(in->textureindex);
4643 if (n < 0 || n >= loadmodel->num_textures)
4644 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
4645 out->texture = loadmodel->data_textures + n;
4647 // make a list of mplane_t structs to construct a colbrush from
4648 if (maxplanes < out->numbrushsides)
4650 maxplanes = out->numbrushsides;
4653 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4656 for (j = 0;j < out->numbrushsides;j++)
4658 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4659 planes[j].dist = out->firstbrushside[j].plane->dist;
4660 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4661 planes[j].texture = out->firstbrushside[j].texture;
4662 q3surfaceflags |= planes[j].q3surfaceflags;
4664 // make the colbrush from the planes
4665 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4667 // this whole loop can take a while (e.g. on redstarrepublic4)
4668 CL_KeepaliveMessage(false);
4674 static void Mod_Q3BSP_LoadEffects(lump_t *l)
4680 in = (q3deffect_t *)(mod_base + l->fileofs);
4681 if (l->filelen % sizeof(*in))
4682 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
4683 count = l->filelen / sizeof(*in);
4684 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4686 loadmodel->brushq3.data_effects = out;
4687 loadmodel->brushq3.num_effects = count;
4689 for (i = 0;i < count;i++, in++, out++)
4691 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
4692 n = LittleLong(in->brushindex);
4693 if (n >= loadmodel->brush.num_brushes)
4695 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
4698 out->brushindex = n;
4699 out->unknown = LittleLong(in->unknown);
4703 static void Mod_Q3BSP_LoadVertices(lump_t *l)
4708 in = (q3dvertex_t *)(mod_base + l->fileofs);
4709 if (l->filelen % sizeof(*in))
4710 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
4711 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
4712 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
4713 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
4714 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
4715 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
4716 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
4718 for (i = 0;i < count;i++, in++)
4720 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
4721 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
4722 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
4723 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
4724 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
4725 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
4726 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
4727 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
4728 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
4729 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
4730 // svector/tvector are calculated later in face loading
4731 if(mod_q3bsp_sRGBlightmaps.integer)
4733 // if lightmaps are sRGB, vertex colors are sRGB too, so we need to linearize them
4734 // note: when this is in use, lightmap color 128 is no longer neutral, but "sRGB half power" is
4735 // working like this may be odd, but matches q3map2 -gamma 2.2
4736 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
4738 // actually we do: Image_sRGBFloatFromLinear_Lightmap(Image_LinearFloatFromsRGBFloat(x))
4739 // neutral point is at Image_sRGBFloatFromLinearFloat(0.5)
4740 // so we need to map Image_sRGBFloatFromLinearFloat(0.5) to 0.5
4741 // factor is 0.5 / Image_sRGBFloatFromLinearFloat(0.5)
4742 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f) * 0.679942f; // fixes neutral level
4743 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f) * 0.679942f; // fixes neutral level
4744 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f) * 0.679942f; // fixes neutral level
4748 loadmodel->brushq3.data_color4f[i * 4 + 0] = Image_LinearFloatFromsRGB(in->color4ub[0]);
4749 loadmodel->brushq3.data_color4f[i * 4 + 1] = Image_LinearFloatFromsRGB(in->color4ub[1]);
4750 loadmodel->brushq3.data_color4f[i * 4 + 2] = Image_LinearFloatFromsRGB(in->color4ub[2]);
4755 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
4757 loadmodel->brushq3.data_color4f[i * 4 + 0] = Image_sRGBFloatFromLinear_Lightmap(in->color4ub[0]);
4758 loadmodel->brushq3.data_color4f[i * 4 + 1] = Image_sRGBFloatFromLinear_Lightmap(in->color4ub[1]);
4759 loadmodel->brushq3.data_color4f[i * 4 + 2] = Image_sRGBFloatFromLinear_Lightmap(in->color4ub[2]);
4763 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
4764 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
4765 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
4768 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
4769 if(in->color4ub[0] != 255 || in->color4ub[1] != 255 || in->color4ub[2] != 255)
4770 loadmodel->lit = true;
4774 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
4780 in = (int *)(mod_base + l->fileofs);
4781 if (l->filelen % sizeof(int[3]))
4782 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
4783 count = l->filelen / sizeof(*in);
4785 if(!loadmodel->brushq3.num_vertices)
4788 Con_Printf("Mod_Q3BSP_LoadTriangles: %s has triangles but no vertexes, broken compiler, ignoring problem\n", loadmodel->name);
4789 loadmodel->brushq3.num_triangles = 0;
4793 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4794 loadmodel->brushq3.num_triangles = count / 3;
4795 loadmodel->brushq3.data_element3i = out;
4797 for (i = 0;i < count;i++, in++, out++)
4799 *out = LittleLong(*in);
4800 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
4802 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
4808 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
4810 q3dlightmap_t *input_pointer;
4828 int mergedrowsxcolumns;
4833 unsigned char *mergedpixels;
4834 unsigned char *mergeddeluxepixels;
4835 unsigned char *mergebuf;
4836 char mapname[MAX_QPATH];
4838 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
4840 // defaults for q3bsp
4847 loadmodel->brushq3.lightmapsize = 128;
4849 if (cls.state == ca_dedicated)
4852 if(mod_q3bsp_nolightmaps.integer)
4858 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
4859 if (developer_loading.integer)
4860 Con_Printf("Using internal lightmaps\n");
4861 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
4862 if (l->filelen % sizeof(*input_pointer))
4863 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
4864 count = l->filelen / sizeof(*input_pointer);
4865 for(i = 0; i < count; ++i)
4866 inpixels[i] = input_pointer[i].rgb;
4870 // no internal lightmaps
4871 // try external lightmaps
4872 if (developer_loading.integer)
4873 Con_Printf("Using external lightmaps\n");
4874 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
4875 inpixels[0] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, 0), false, false, false, NULL);
4879 // using EXTERNAL lightmaps instead
4880 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
4882 Mem_Free(inpixels[0]);
4883 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
4893 for(count = 1; ; ++count)
4895 inpixels[count] = loadimagepixelsbgra(va("%s/lm_%04d", mapname, count), false, false, false, NULL);
4896 if(!inpixels[count])
4897 break; // we got all of them
4898 if(image_width != size || image_height != size)
4900 Mem_Free(inpixels[count]);
4901 inpixels[count] = NULL;
4902 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);
4908 loadmodel->brushq3.lightmapsize = size;
4909 loadmodel->brushq3.num_originallightmaps = count;
4911 // now check the surfaces to see if any of them index an odd numbered
4912 // lightmap, if so this is not a deluxemapped bsp file
4914 // also check what lightmaps are actually used, because q3map2 sometimes
4915 // (always?) makes an unused one at the end, which
4916 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4917 // reason when only one lightmap is used, which can throw off the
4918 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4919 // to see if the second lightmap is blank, if so it is not deluxemapped.
4920 // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
4921 // in Mod_Q3BSP_LoadEntities was failed
4922 if (!loadmodel->brushq3.deluxemapping)
4924 loadmodel->brushq3.deluxemapping = !(count & 1);
4925 loadmodel->brushq3.deluxemapping_modelspace = true;
4927 if (loadmodel->brushq3.deluxemapping)
4929 int facecount = faceslump->filelen / sizeof(q3dface_t);
4930 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
4931 for (i = 0;i < facecount;i++)
4933 j = LittleLong(faces[i].lightmapindex);
4936 endlightmap = max(endlightmap, j + 1);
4937 if ((j & 1) || j + 1 >= count)
4939 loadmodel->brushq3.deluxemapping = false;
4946 // q3map2 sometimes (or always?) makes a second blank lightmap for no
4947 // reason when only one lightmap is used, which can throw off the
4948 // deluxemapping detection method, so check 2-lightmap bsp's specifically
4949 // to see if the second lightmap is blank, if so it is not deluxemapped.
4951 // further research has shown q3map2 sometimes creates a deluxemap and two
4952 // blank lightmaps, which must be handled properly as well
4953 if (endlightmap == 1 && count > 1)
4956 for (i = 0;i < size*size;i++)
4958 if (c[bytesperpixel*i + rgbmap[0]])
4960 if (c[bytesperpixel*i + rgbmap[1]])
4962 if (c[bytesperpixel*i + rgbmap[2]])
4967 // all pixels in the unused lightmap were black...
4968 loadmodel->brushq3.deluxemapping = false;
4973 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
4975 // figure out what the most reasonable merge power is within limits
4977 // find the appropriate NxN dimensions to merge to, to avoid wasted space
4978 realcount = count >> (int)loadmodel->brushq3.deluxemapping;
4980 // figure out how big the merged texture has to be
4981 mergegoal = 128<<bound(0, mod_q3bsp_lightmapmergepower.integer, 6);
4982 mergegoal = bound(size, mergegoal, (int)vid.maxtexturesize_2d);
4983 while (mergegoal > size && mergegoal * mergegoal / 4 >= size * size * realcount)
4985 mergedwidth = mergegoal;
4986 mergedheight = mergegoal;
4987 // choose non-square size (2x1 aspect) if only half the space is used;
4988 // this really only happens when the entire set fits in one texture, if
4989 // there are multiple textures, we don't worry about shrinking the last
4990 // one to fit, because the driver prefers the same texture size on
4991 // consecutive draw calls...
4992 if (mergedwidth * mergedheight / 2 >= size*size*realcount)
4995 loadmodel->brushq3.num_lightmapmergedwidthpower = 0;
4996 loadmodel->brushq3.num_lightmapmergedheightpower = 0;
4997 while (mergedwidth > size<<loadmodel->brushq3.num_lightmapmergedwidthpower)
4998 loadmodel->brushq3.num_lightmapmergedwidthpower++;
4999 while (mergedheight > size<<loadmodel->brushq3.num_lightmapmergedheightpower)
5000 loadmodel->brushq3.num_lightmapmergedheightpower++;
5001 loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower = loadmodel->brushq3.num_lightmapmergedwidthpower + loadmodel->brushq3.num_lightmapmergedheightpower + (loadmodel->brushq3.deluxemapping ? 1 : 0);
5003 powerx = loadmodel->brushq3.num_lightmapmergedwidthpower;
5004 powery = loadmodel->brushq3.num_lightmapmergedheightpower;
5005 powerxy = powerx+powery;
5006 powerdxy = loadmodel->brushq3.deluxemapping + powerxy;
5008 mergedcolumns = 1 << powerx;
5009 mergedrows = 1 << powery;
5010 mergedrowsxcolumns = 1 << powerxy;
5012 loadmodel->brushq3.num_mergedlightmaps = (realcount + (1 << powerxy) - 1) >> powerxy;
5013 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
5014 if (loadmodel->brushq3.deluxemapping)
5015 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
5017 // allocate a texture pool if we need it
5018 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
5019 loadmodel->texturepool = R_AllocTexturePool();
5021 mergedpixels = (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4);
5022 mergeddeluxepixels = loadmodel->brushq3.deluxemapping ? (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4) : NULL;
5023 for (i = 0;i < count;i++)
5025 // figure out which merged lightmap texture this fits into
5026 realindex = i >> (int)loadmodel->brushq3.deluxemapping;
5027 lightmapindex = i >> powerdxy;
5029 // choose the destination address
5030 mergebuf = (loadmodel->brushq3.deluxemapping && (i & 1)) ? mergeddeluxepixels : mergedpixels;
5031 mergebuf += 4 * (realindex & (mergedcolumns-1))*size + 4 * ((realindex >> powerx) & (mergedrows-1))*mergedwidth*size;
5032 if ((i & 1) == 0 || !loadmodel->brushq3.deluxemapping)
5033 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);
5035 // convert pixels from RGB or BGRA while copying them into the destination rectangle
5036 for (j = 0;j < size;j++)
5037 for (k = 0;k < size;k++)
5039 mergebuf[(j*mergedwidth+k)*4+0] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[0]];
5040 mergebuf[(j*mergedwidth+k)*4+1] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[1]];
5041 mergebuf[(j*mergedwidth+k)*4+2] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[2]];
5042 mergebuf[(j*mergedwidth+k)*4+3] = 255;
5045 // upload texture if this was the last tile being written to the texture
5046 if (((realindex + 1) & (mergedrowsxcolumns - 1)) == 0 || (realindex + 1) == realcount)
5048 if (loadmodel->brushq3.deluxemapping && (i & 1))
5049 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("deluxemap%04i", lightmapindex), mergedwidth, mergedheight, mergeddeluxepixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
5052 if(mod_q3bsp_sRGBlightmaps.integer)
5055 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5057 // TODO (should we do this, or should we instead knowingly render brighter in sRGB fallback mode?)
5058 int n = mergedwidth * mergedheight * 4;
5060 for(i = 0; i < n; i += 4)
5062 // actually we do: Image_sRGBFloatFromLinear_Lightmap(Image_LinearFloatFromsRGBFloat(x))
5063 // neutral point is at Image_sRGBFloatFromLinearFloat(0.5)
5064 // so we need to map Image_sRGBFloatFromLinearFloat(0.5) to 0.5
5065 // factor is 0.5 / Image_sRGBFloatFromLinearFloat(0.5)
5066 mergedpixels[i+0] = (mergedpixels[i+0] * (int)173 + 128) / 255;
5067 mergedpixels[i+1] = (mergedpixels[i+1] * (int)173 + 128) / 255;
5068 mergedpixels[i+2] = (mergedpixels[i+2] * (int)173 + 128) / 255;
5070 t = TEXTYPE_BGRA; // in stupid fallback mode, we upload lightmaps in sRGB form and just fix their brightness
5073 t = TEXTYPE_SRGB_BGRA; // normally, we upload lightmaps in sRGB form (possibly downconverted to linear)
5074 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), mergedwidth, mergedheight, mergedpixels, t, TEXF_FORCELINEAR | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
5078 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5079 Image_MakesRGBColorsFromLinear_Lightmap(mergedpixels, mergedpixels, mergedwidth * mergedheight);
5080 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va("lightmap%04i", lightmapindex), mergedwidth, mergedheight, mergedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
5086 if (mergeddeluxepixels)
5087 Mem_Free(mergeddeluxepixels);
5088 Mem_Free(mergedpixels);
5091 for(i = 0; i < count; ++i)
5092 Mem_Free(inpixels[i]);
5096 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
5101 *collisionstride = stride;
5104 cnt = (num_triangles + stride - 1) / stride;
5105 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
5106 for(j = 0; j < cnt; ++j)
5108 mins = &((*collisionbbox6f)[6 * j + 0]);
5109 maxs = &((*collisionbbox6f)[6 * j + 3]);
5110 for(k = 0; k < stride; ++k)
5112 tri = j * stride + k;
5113 if(tri >= num_triangles)
5115 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
5116 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
5117 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
5118 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
5119 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
5120 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
5121 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
5122 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
5123 if(vert[0] < mins[0]) mins[0] = vert[0];
5124 if(vert[1] < mins[1]) mins[1] = vert[1];
5125 if(vert[2] < mins[2]) mins[2] = vert[2];
5126 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5127 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5128 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5129 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
5130 if(vert[0] < mins[0]) mins[0] = vert[0];
5131 if(vert[1] < mins[1]) mins[1] = vert[1];
5132 if(vert[2] < mins[2]) mins[2] = vert[2];
5133 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5134 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5135 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5140 *collisionbbox6f = NULL;
5143 typedef struct patchtess_s
5147 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
5150 float *originalvertex3f;
5153 #define PATCHTESS_SAME_LODGROUP(a,b) \
5155 (a).lodgroup[0] == (b).lodgroup[0] && \
5156 (a).lodgroup[1] == (b).lodgroup[1] && \
5157 (a).lodgroup[2] == (b).lodgroup[2] && \
5158 (a).lodgroup[3] == (b).lodgroup[3] && \
5159 (a).lodgroup[4] == (b).lodgroup[4] && \
5160 (a).lodgroup[5] == (b).lodgroup[5] \
5163 static void Mod_Q3BSP_LoadFaces(lump_t *l)
5165 q3dface_t *in, *oldin;
5166 msurface_t *out, *oldout;
5167 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;
5168 float lightmaptcbase[2], lightmaptcscale[2];
5169 //int *originalelement3i;
5170 //int *originalneighbor3i;
5171 float *originalvertex3f;
5172 //float *originalsvector3f;
5173 //float *originaltvector3f;
5174 float *originalnormal3f;
5175 float *originalcolor4f;
5176 float *originaltexcoordtexture2f;
5177 float *originaltexcoordlightmap2f;
5178 float *surfacecollisionvertex3f;
5179 int *surfacecollisionelement3i;
5181 patchtess_t *patchtess = NULL;
5182 int patchtesscount = 0;
5185 in = (q3dface_t *)(mod_base + l->fileofs);
5186 if (l->filelen % sizeof(*in))
5187 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
5188 count = l->filelen / sizeof(*in);
5189 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5191 loadmodel->data_surfaces = out;
5192 loadmodel->num_surfaces = count;
5195 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
5203 for (;i < count;i++, in++, out++)
5205 // check face type first
5206 type = LittleLong(in->type);
5207 if (type != Q3FACETYPE_FLAT
5208 && type != Q3FACETYPE_PATCH
5209 && type != Q3FACETYPE_MESH
5210 && type != Q3FACETYPE_FLARE)
5212 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
5216 n = LittleLong(in->textureindex);
5217 if (n < 0 || n >= loadmodel->num_textures)
5219 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
5222 out->texture = loadmodel->data_textures + n;
5223 n = LittleLong(in->effectindex);
5224 if (n < -1 || n >= loadmodel->brushq3.num_effects)
5226 if (developer_extra.integer)
5227 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
5233 out->effect = loadmodel->brushq3.data_effects + n;
5235 if (cls.state != ca_dedicated)
5237 out->lightmaptexture = NULL;
5238 out->deluxemaptexture = r_texture_blanknormalmap;
5239 n = LittleLong(in->lightmapindex);
5242 else if (n >= loadmodel->brushq3.num_originallightmaps)
5244 if(loadmodel->brushq3.num_originallightmaps != 0)
5245 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
5250 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5251 if (loadmodel->brushq3.deluxemapping)
5252 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5253 loadmodel->lit = true;
5257 firstvertex = LittleLong(in->firstvertex);
5258 numvertices = LittleLong(in->numvertices);
5259 firstelement = LittleLong(in->firstelement);
5260 numtriangles = LittleLong(in->numelements) / 3;
5261 if (numtriangles * 3 != LittleLong(in->numelements))
5263 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));
5266 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
5268 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);
5271 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
5273 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);
5278 case Q3FACETYPE_FLAT:
5279 case Q3FACETYPE_MESH:
5280 // no processing necessary
5282 case Q3FACETYPE_PATCH:
5283 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5284 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5285 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))
5287 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
5290 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5292 // convert patch to Q3FACETYPE_MESH
5293 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5294 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
5295 // bound to user settings
5296 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
5297 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
5298 // bound to sanity settings
5299 xtess = bound(0, xtess, 1024);
5300 ytess = bound(0, ytess, 1024);
5302 // lower quality collision patches! Same procedure as before, but different cvars
5303 // convert patch to Q3FACETYPE_MESH
5304 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5305 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
5306 // bound to user settings
5307 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
5308 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
5309 // bound to sanity settings
5310 cxtess = bound(0, cxtess, 1024);
5311 cytess = bound(0, cytess, 1024);
5313 // store it for the LOD grouping step
5314 patchtess[patchtesscount].info.xsize = patchsize[0];
5315 patchtess[patchtesscount].info.ysize = patchsize[1];
5316 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
5317 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
5318 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
5319 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
5321 patchtess[patchtesscount].surface_id = i;
5322 patchtess[patchtesscount].lodgroup[0] = LittleFloat(in->specific.patch.mins[0]);
5323 patchtess[patchtesscount].lodgroup[1] = LittleFloat(in->specific.patch.mins[1]);
5324 patchtess[patchtesscount].lodgroup[2] = LittleFloat(in->specific.patch.mins[2]);
5325 patchtess[patchtesscount].lodgroup[3] = LittleFloat(in->specific.patch.maxs[0]);
5326 patchtess[patchtesscount].lodgroup[4] = LittleFloat(in->specific.patch.maxs[1]);
5327 patchtess[patchtesscount].lodgroup[5] = LittleFloat(in->specific.patch.maxs[2]);
5328 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
5331 case Q3FACETYPE_FLARE:
5332 if (developer_extra.integer)
5333 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
5337 out->num_vertices = numvertices;
5338 out->num_triangles = numtriangles;
5339 meshvertices += out->num_vertices;
5340 meshtriangles += out->num_triangles;
5343 // Fix patches tesselations so that they make no seams
5347 for(i = 0; i < patchtesscount; ++i)
5349 for(j = i+1; j < patchtesscount; ++j)
5351 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
5354 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
5361 // Calculate resulting number of triangles
5362 collisionvertices = 0;
5363 collisiontriangles = 0;
5364 for(i = 0; i < patchtesscount; ++i)
5366 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
5367 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
5368 numvertices = finalwidth * finalheight;
5369 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5371 oldout[patchtess[i].surface_id].num_vertices = numvertices;
5372 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
5373 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
5374 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
5376 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_COLLISION].xtess);
5377 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_COLLISION].ytess);
5378 numvertices = finalwidth * finalheight;
5379 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5381 oldout[patchtess[i].surface_id].num_collisionvertices = numvertices;
5382 oldout[patchtess[i].surface_id].num_collisiontriangles = numtriangles;
5383 collisionvertices += oldout[patchtess[i].surface_id].num_collisionvertices;
5384 collisiontriangles += oldout[patchtess[i].surface_id].num_collisiontriangles;
5390 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true, false);
5391 if (collisiontriangles)
5393 loadmodel->brush.data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, collisionvertices * sizeof(float[3]));
5394 loadmodel->brush.data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, collisiontriangles * sizeof(int[3]));
5398 collisionvertices = 0;
5399 collisiontriangles = 0;
5400 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
5402 if (out->num_vertices < 3 || out->num_triangles < 1)
5405 type = LittleLong(in->type);
5406 firstvertex = LittleLong(in->firstvertex);
5407 firstelement = LittleLong(in->firstelement);
5408 out->num_firstvertex = meshvertices;
5409 out->num_firsttriangle = meshtriangles;
5410 out->num_firstcollisiontriangle = collisiontriangles;
5413 case Q3FACETYPE_FLAT:
5414 case Q3FACETYPE_MESH:
5415 // no processing necessary, except for lightmap merging
5416 for (j = 0;j < out->num_vertices;j++)
5418 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
5419 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
5420 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
5421 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
5422 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
5423 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
5424 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
5425 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
5426 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
5427 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
5428 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
5429 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
5430 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
5431 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
5433 for (j = 0;j < out->num_triangles*3;j++)
5434 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
5436 case Q3FACETYPE_PATCH:
5437 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
5438 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
5439 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
5440 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
5441 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
5442 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
5443 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
5445 xtess = ytess = cxtess = cytess = -1;
5446 for(j = 0; j < patchtesscount; ++j)
5447 if(patchtess[j].surface_id == i)
5449 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
5450 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
5451 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
5452 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
5457 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
5458 xtess = ytess = cxtess = cytess = 0;
5461 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
5462 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
5463 finalvertices = finalwidth * finalheight;
5464 oldnumtriangles = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5465 type = Q3FACETYPE_MESH;
5466 // generate geometry
5467 // (note: normals are skipped because they get recalculated)
5468 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
5469 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
5470 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
5471 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
5472 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
5473 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
5475 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);
5477 if (developer_extra.integer)
5479 if (out->num_triangles < finaltriangles)
5480 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);
5482 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);
5484 // q3map does not put in collision brushes for curves... ugh
5485 // build the lower quality collision geometry
5486 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
5487 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
5488 finalvertices = finalwidth * finalheight;
5489 oldnumtriangles2 = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
5491 // legacy collision geometry implementation
5492 out->deprecatedq3data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
5493 out->deprecatedq3data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
5494 out->num_collisionvertices = finalvertices;
5495 out->num_collisiontriangles = finaltriangles;
5496 Q3PatchTesselateFloat(3, sizeof(float[3]), out->deprecatedq3data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5497 Q3PatchTriangleElements(out->deprecatedq3data_collisionelement3i, finalwidth, finalheight, 0);
5499 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
5500 Mod_SnapVertices(3, finalvertices, out->deprecatedq3data_collisionvertex3f, 1);
5502 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionvertex3f);
5504 // now optimize the collision mesh by finding triangle bboxes...
5505 Mod_Q3BSP_BuildBBoxes(out->deprecatedq3data_collisionelement3i, out->num_collisiontriangles, out->deprecatedq3data_collisionvertex3f, &out->deprecatedq3data_collisionbbox6f, &out->deprecatedq3num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
5506 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);
5508 // store collision geometry for BIH collision tree
5509 surfacecollisionvertex3f = loadmodel->brush.data_collisionvertex3f + collisionvertices * 3;
5510 surfacecollisionelement3i = loadmodel->brush.data_collisionelement3i + collisiontriangles * 3;
5511 Q3PatchTesselateFloat(3, sizeof(float[3]), surfacecollisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
5512 Q3PatchTriangleElements(surfacecollisionelement3i, finalwidth, finalheight, collisionvertices);
5513 Mod_SnapVertices(3, finalvertices, surfacecollisionvertex3f, 1);
5515 // remove this once the legacy code is removed
5517 int nc = out->num_collisiontriangles;
5519 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, surfacecollisionelement3i, surfacecollisionelement3i, loadmodel->brush.data_collisionvertex3f);
5521 if(nc != out->num_collisiontriangles)
5523 Con_Printf("number of collision triangles differs between BIH and BSP. FAIL.\n");
5528 if (developer_extra.integer)
5529 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);
5531 collisionvertices += finalvertices;
5532 collisiontriangles += out->num_collisiontriangles;
5537 meshvertices += out->num_vertices;
5538 meshtriangles += out->num_triangles;
5539 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
5540 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)
5542 if (invalidelements)
5544 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);
5545 for (j = 0;j < out->num_triangles * 3;j++)
5547 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
5548 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)
5549 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
5553 // calculate a bounding box
5554 VectorClear(out->mins);
5555 VectorClear(out->maxs);
5556 if (out->num_vertices)
5558 if (cls.state != ca_dedicated && out->lightmaptexture)
5560 // figure out which part of the merged lightmap this fits into
5561 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
5562 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5563 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
5564 lightmapindex &= mergewidth * mergeheight - 1;
5565 lightmaptcscale[0] = 1.0f / mergewidth;
5566 lightmaptcscale[1] = 1.0f / mergeheight;
5567 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
5568 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
5569 // modify the lightmap texcoords to match this region of the merged lightmap
5570 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
5572 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
5573 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
5576 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
5577 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
5578 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
5580 out->mins[0] = min(out->mins[0], v[0]);
5581 out->maxs[0] = max(out->maxs[0], v[0]);
5582 out->mins[1] = min(out->mins[1], v[1]);
5583 out->maxs[1] = max(out->maxs[1], v[1]);
5584 out->mins[2] = min(out->mins[2], v[2]);
5585 out->maxs[2] = max(out->maxs[2], v[2]);
5587 out->mins[0] -= 1.0f;
5588 out->mins[1] -= 1.0f;
5589 out->mins[2] -= 1.0f;
5590 out->maxs[0] += 1.0f;
5591 out->maxs[1] += 1.0f;
5592 out->maxs[2] += 1.0f;
5594 // set lightmap styles for consistency with q1bsp
5595 //out->lightmapinfo->styles[0] = 0;
5596 //out->lightmapinfo->styles[1] = 255;
5597 //out->lightmapinfo->styles[2] = 255;
5598 //out->lightmapinfo->styles[3] = 255;
5603 for (;i < count;i++, out++)
5605 if(out->num_vertices && out->num_triangles)
5607 if(out->num_vertices == 0)
5609 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no vertices, ignoring\n", i, out->texture ? out->texture->name : "(none)");
5610 if(out->num_triangles == 0)
5611 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no triangles, ignoring\n", i, out->texture ? out->texture->name : "(none)");
5613 else if(out->num_triangles == 0)
5614 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)",
5615 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[0 * 3 + 0],
5616 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[1 * 3 + 0],
5617 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[2 * 3 + 0]);
5620 // for per pixel lighting
5621 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);
5623 // generate ushort elements array if possible
5624 if (loadmodel->surfmesh.data_element3s)
5625 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
5626 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
5628 // free the no longer needed vertex data
5629 loadmodel->brushq3.num_vertices = 0;
5630 if (loadmodel->brushq3.data_vertex3f)
5631 Mem_Free(loadmodel->brushq3.data_vertex3f);
5632 loadmodel->brushq3.data_vertex3f = NULL;
5633 loadmodel->brushq3.data_normal3f = NULL;
5634 loadmodel->brushq3.data_texcoordtexture2f = NULL;
5635 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
5636 loadmodel->brushq3.data_color4f = NULL;
5637 // free the no longer needed triangle data
5638 loadmodel->brushq3.num_triangles = 0;
5639 if (loadmodel->brushq3.data_element3i)
5640 Mem_Free(loadmodel->brushq3.data_element3i);
5641 loadmodel->brushq3.data_element3i = NULL;
5644 Mem_Free(patchtess);
5647 static void Mod_Q3BSP_LoadModels(lump_t *l)
5651 int i, j, n, c, count;
5653 in = (q3dmodel_t *)(mod_base + l->fileofs);
5654 if (l->filelen % sizeof(*in))
5655 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
5656 count = l->filelen / sizeof(*in);
5657 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5659 loadmodel->brushq3.data_models = out;
5660 loadmodel->brushq3.num_models = count;
5662 for (i = 0;i < count;i++, in++, out++)
5664 for (j = 0;j < 3;j++)
5666 out->mins[j] = LittleFloat(in->mins[j]);
5667 out->maxs[j] = LittleFloat(in->maxs[j]);
5669 n = LittleLong(in->firstface);
5670 c = LittleLong(in->numfaces);
5671 if (n < 0 || n + c > loadmodel->num_surfaces)
5672 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
5675 n = LittleLong(in->firstbrush);
5676 c = LittleLong(in->numbrushes);
5677 if (n < 0 || n + c > loadmodel->brush.num_brushes)
5678 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
5679 out->firstbrush = n;
5680 out->numbrushes = c;
5684 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
5690 in = (int *)(mod_base + l->fileofs);
5691 if (l->filelen % sizeof(*in))
5692 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
5693 count = l->filelen / sizeof(*in);
5694 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5696 loadmodel->brush.data_leafbrushes = out;
5697 loadmodel->brush.num_leafbrushes = count;
5699 for (i = 0;i < count;i++, in++, out++)
5701 n = LittleLong(*in);
5702 if (n < 0 || n >= loadmodel->brush.num_brushes)
5703 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
5708 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
5714 in = (int *)(mod_base + l->fileofs);
5715 if (l->filelen % sizeof(*in))
5716 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
5717 count = l->filelen / sizeof(*in);
5718 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5720 loadmodel->brush.data_leafsurfaces = out;
5721 loadmodel->brush.num_leafsurfaces = count;
5723 for (i = 0;i < count;i++, in++, out++)
5725 n = LittleLong(*in);
5726 if (n < 0 || n >= loadmodel->num_surfaces)
5727 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
5732 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
5736 int i, j, n, c, count;
5738 in = (q3dleaf_t *)(mod_base + l->fileofs);
5739 if (l->filelen % sizeof(*in))
5740 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
5741 count = l->filelen / sizeof(*in);
5742 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5744 loadmodel->brush.data_leafs = out;
5745 loadmodel->brush.num_leafs = count;
5747 for (i = 0;i < count;i++, in++, out++)
5751 out->clusterindex = LittleLong(in->clusterindex);
5752 out->areaindex = LittleLong(in->areaindex);
5753 for (j = 0;j < 3;j++)
5755 // yes the mins/maxs are ints
5756 out->mins[j] = LittleLong(in->mins[j]) - 1;
5757 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5759 n = LittleLong(in->firstleafface);
5760 c = LittleLong(in->numleaffaces);
5761 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
5762 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
5763 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
5764 out->numleafsurfaces = c;
5765 n = LittleLong(in->firstleafbrush);
5766 c = LittleLong(in->numleafbrushes);
5767 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
5768 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
5769 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
5770 out->numleafbrushes = c;
5774 static void Mod_Q3BSP_LoadNodes(lump_t *l)
5780 in = (q3dnode_t *)(mod_base + l->fileofs);
5781 if (l->filelen % sizeof(*in))
5782 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
5783 count = l->filelen / sizeof(*in);
5785 Host_Error("Mod_Q3BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
5786 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5788 loadmodel->brush.data_nodes = out;
5789 loadmodel->brush.num_nodes = count;
5791 for (i = 0;i < count;i++, in++, out++)
5794 n = LittleLong(in->planeindex);
5795 if (n < 0 || n >= loadmodel->brush.num_planes)
5796 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5797 out->plane = loadmodel->brush.data_planes + n;
5798 for (j = 0;j < 2;j++)
5800 n = LittleLong(in->childrenindex[j]);
5803 if (n >= loadmodel->brush.num_nodes)
5804 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
5805 out->children[j] = loadmodel->brush.data_nodes + n;
5810 if (n >= loadmodel->brush.num_leafs)
5811 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
5812 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
5815 for (j = 0;j < 3;j++)
5817 // yes the mins/maxs are ints
5818 out->mins[j] = LittleLong(in->mins[j]) - 1;
5819 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
5823 // set the parent pointers
5824 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
5827 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
5830 q3dlightgrid_t *out;
5834 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
5835 if (l->filelen % sizeof(*in))
5836 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
5837 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
5838 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
5839 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
5840 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5841 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5842 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5843 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
5844 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
5845 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
5846 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
5847 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
5848 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
5849 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
5850 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]);
5851 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]);
5853 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
5856 if (l->filelen < count * (int)sizeof(*in))
5858 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]);
5859 return; // ignore the grid if we cannot understand it
5861 if (l->filelen != count * (int)sizeof(*in))
5862 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
5863 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5864 loadmodel->brushq3.data_lightgrid = out;
5865 loadmodel->brushq3.num_lightgrid = count;
5866 // no swapping or validation necessary
5867 memcpy(out, in, count * (int)sizeof(*out));
5869 if(mod_q3bsp_sRGBlightmaps.integer)
5871 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5873 // TODO (should we do this, or should we instead knowingly render brighter in sRGB fallback mode?)
5874 for(i = 0; i < count; ++i)
5876 // actually we do: Image_sRGBFloatFromLinear_Lightmap(Image_LinearFloatFromsRGBFloat(x))
5877 // neutral point is at Image_sRGBFloatFromLinearFloat(0.5)
5878 // so we need to map Image_sRGBFloatFromLinearFloat(0.5) to 0.5
5879 // factor is 0.5 / Image_sRGBFloatFromLinearFloat(0.5)
5880 out[i].ambientrgb[0] = (out[i].ambientrgb[0] * (int)173 + 128) / 255; // fixes neutral level
5881 out[i].ambientrgb[1] = (out[i].ambientrgb[1] * (int)173 + 128) / 255; // fixes neutral level
5882 out[i].ambientrgb[2] = (out[i].ambientrgb[2] * (int)173 + 128) / 255; // fixes neutral level
5883 out[i].diffusergb[0] = (out[i].diffusergb[0] * (int)173 + 128) / 255; // fixes neutral level
5884 out[i].diffusergb[1] = (out[i].diffusergb[1] * (int)173 + 128) / 255; // fixes neutral level
5885 out[i].diffusergb[2] = (out[i].diffusergb[2] * (int)173 + 128) / 255; // fixes neutral level
5890 for(i = 0; i < count; ++i)
5892 out[i].ambientrgb[0] = floor(Image_LinearFloatFromsRGB(out[i].ambientrgb[0]) * 255.0f + 0.5f);
5893 out[i].ambientrgb[1] = floor(Image_LinearFloatFromsRGB(out[i].ambientrgb[1]) * 255.0f + 0.5f);
5894 out[i].ambientrgb[2] = floor(Image_LinearFloatFromsRGB(out[i].ambientrgb[2]) * 255.0f + 0.5f);
5895 out[i].diffusergb[0] = floor(Image_LinearFloatFromsRGB(out[i].diffusergb[0]) * 255.0f + 0.5f);
5896 out[i].diffusergb[1] = floor(Image_LinearFloatFromsRGB(out[i].diffusergb[1]) * 255.0f + 0.5f);
5897 out[i].diffusergb[2] = floor(Image_LinearFloatFromsRGB(out[i].diffusergb[2]) * 255.0f + 0.5f);
5903 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5905 for(i = 0; i < count; ++i)
5907 out[i].ambientrgb[0] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].ambientrgb[0]) * 255.0f + 0.5f);
5908 out[i].ambientrgb[1] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].ambientrgb[1]) * 255.0f + 0.5f);
5909 out[i].ambientrgb[2] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].ambientrgb[2]) * 255.0f + 0.5f);
5910 out[i].diffusergb[0] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].diffusergb[0]) * 255.0f + 0.5f);
5911 out[i].diffusergb[1] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].diffusergb[1]) * 255.0f + 0.5f);
5912 out[i].diffusergb[2] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].diffusergb[2]) * 255.0f + 0.5f);
5923 static void Mod_Q3BSP_LoadPVS(lump_t *l)
5928 if (l->filelen == 0)
5931 // unvised maps often have cluster indices even without pvs, so check
5932 // leafs to find real number of clusters
5933 loadmodel->brush.num_pvsclusters = 1;
5934 for (i = 0;i < loadmodel->brush.num_leafs;i++)
5935 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
5938 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
5939 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5940 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5941 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
5945 in = (q3dpvs_t *)(mod_base + l->fileofs);
5947 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
5949 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
5950 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
5951 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
5952 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
5953 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
5954 if (l->filelen < totalchains + (int)sizeof(*in))
5955 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);
5957 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
5958 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
5961 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
5963 int i, j, k, index[3];
5964 float transformed[3], blend1, blend2, blend, stylescale = 1;
5965 q3dlightgrid_t *a, *s;
5967 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
5968 switch(vid.renderpath)
5970 case RENDERPATH_GL20:
5971 case RENDERPATH_D3D9:
5972 case RENDERPATH_D3D10:
5973 case RENDERPATH_D3D11:
5974 case RENDERPATH_SOFT:
5975 case RENDERPATH_GLES2:
5976 // LordHavoc: FIXME: is this true?
5977 stylescale = 1; // added while render
5979 case RENDERPATH_GL11:
5980 case RENDERPATH_GL13:
5981 case RENDERPATH_GLES1:
5982 stylescale = r_refdef.scene.rtlightstylevalue[0];
5986 if (!model->brushq3.num_lightgrid)
5988 ambientcolor[0] = stylescale;
5989 ambientcolor[1] = stylescale;
5990 ambientcolor[2] = stylescale;
5994 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
5995 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
5996 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
5997 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
5998 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
5999 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
6000 index[0] = (int)floor(transformed[0]);
6001 index[1] = (int)floor(transformed[1]);
6002 index[2] = (int)floor(transformed[2]);
6003 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
6005 // now lerp the values
6006 VectorClear(diffusenormal);
6007 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
6008 for (k = 0;k < 2;k++)
6010 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
6011 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
6013 for (j = 0;j < 2;j++)
6015 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
6016 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
6018 for (i = 0;i < 2;i++)
6020 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
6021 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
6023 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
6024 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
6025 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
6026 // this uses the mod_md3_sin table because the values are
6027 // already in the 0-255 range, the 64+ bias fetches a cosine
6028 // instead of a sine value
6029 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
6030 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
6031 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
6032 //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)));
6037 // normalize the light direction before turning
6038 VectorNormalize(diffusenormal);
6039 //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]);
6042 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3])
6045 double midf, mid[3];
6051 // find the point distances
6052 mplane_t *plane = node->plane;
6053 if (plane->type < 3)
6055 t1 = p1[plane->type] - plane->dist;
6056 t2 = p2[plane->type] - plane->dist;
6060 t1 = DotProduct (plane->normal, p1) - plane->dist;
6061 t2 = DotProduct (plane->normal, p2) - plane->dist;
6068 node = node->children[1];
6077 node = node->children[0];
6083 midf = t1 / (t1 - t2);
6084 VectorLerp(p1, midf, p2, mid);
6086 // recurse both sides, front side first
6087 // return 2 if empty is followed by solid (hit something)
6088 // do not return 2 if both are solid or both empty,
6089 // or if start is solid and end is empty
6090 // as these degenerate cases usually indicate the eye is in solid and
6091 // should see the target point anyway
6092 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid);
6095 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2);
6100 return ((mleaf_t *)node)->clusterindex < 0;
6103 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end)
6105 if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
6108 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK);
6109 return trace.fraction == 1;
6113 double tracestart[3], traceend[3];
6114 VectorCopy(start, tracestart);
6115 VectorCopy(end, traceend);
6116 return !Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend);
6120 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)
6123 const bih_leaf_t *leaf;
6124 const bih_node_t *node;
6125 const colbrushf_t *brush;
6128 int nodestackpos = 0;
6129 int nodestack[1024];
6131 memset(trace, 0, sizeof(*trace));
6132 trace->fraction = 1;
6133 trace->realfraction = 1;
6134 trace->hitsupercontentsmask = hitsupercontentsmask;
6136 bih = &model->collision_bih;
6140 nodenum = bih->rootnode;
6141 nodestack[nodestackpos++] = nodenum;
6142 while (nodestackpos)
6144 nodenum = nodestack[--nodestackpos];
6145 node = bih->nodes + nodenum;
6147 if (!BoxesOverlap(start, start, node->mins, node->maxs))
6150 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6152 axis = node->type - BIH_SPLITX;
6153 if (start[axis] >= node->frontmin)
6154 nodestack[nodestackpos++] = node->front;
6155 if (start[axis] <= node->backmax)
6156 nodestack[nodestackpos++] = node->back;
6158 else if (node->type == BIH_UNORDERED)
6160 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6162 leaf = bih->leafs + node->children[axis];
6164 if (!BoxesOverlap(start, start, leaf->mins, leaf->maxs))
6170 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6171 Collision_TracePointBrushFloat(trace, start, brush);
6173 case BIH_COLLISIONTRIANGLE:
6174 // collision triangle - skipped because they have no volume
6176 case BIH_RENDERTRIANGLE:
6177 // render triangle - skipped because they have no volume
6185 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)
6187 const bih_leaf_t *leaf;
6188 const bih_node_t *node;
6189 const colbrushf_t *brush;
6191 const texture_t *texture;
6192 vec3_t nodebigmins, nodebigmaxs, nodestart, nodeend, sweepnodemins, sweepnodemaxs;
6193 vec_t d1, d2, d3, d4, f, nodestackline[1024][6];
6194 int axis, nodenum, nodestackpos = 0, nodestack[1024];
6199 if (VectorCompare(start, end))
6201 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6205 nodenum = bih->rootnode;
6207 memset(trace, 0, sizeof(*trace));
6208 trace->fraction = 1;
6209 trace->realfraction = 1;
6210 trace->hitsupercontentsmask = hitsupercontentsmask;
6213 nodestackline[nodestackpos][0] = start[0];
6214 nodestackline[nodestackpos][1] = start[1];
6215 nodestackline[nodestackpos][2] = start[2];
6216 nodestackline[nodestackpos][3] = end[0];
6217 nodestackline[nodestackpos][4] = end[1];
6218 nodestackline[nodestackpos][5] = end[2];
6219 nodestack[nodestackpos++] = nodenum;
6220 while (nodestackpos)
6222 nodenum = nodestack[--nodestackpos];
6223 node = bih->nodes + nodenum;
6224 VectorCopy(nodestackline[nodestackpos], nodestart);
6225 VectorCopy(nodestackline[nodestackpos] + 3, nodeend);
6226 sweepnodemins[0] = min(nodestart[0], nodeend[0]); sweepnodemins[1] = min(nodestart[1], nodeend[1]); sweepnodemins[2] = min(nodestart[2], nodeend[2]); sweepnodemaxs[0] = max(nodestart[0], nodeend[0]); sweepnodemaxs[1] = max(nodestart[1], nodeend[1]); sweepnodemaxs[2] = max(nodestart[2], nodeend[2]);
6227 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs))
6229 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6231 // recurse children of the split
6232 axis = node->type - BIH_SPLITX;
6233 d1 = node->backmax - nodestart[axis];
6234 d2 = node->backmax - nodeend[axis];
6235 d3 = nodestart[axis] - node->frontmin;
6236 d4 = nodeend[axis] - node->frontmin;
6237 switch((d1 < 0) | ((d2 < 0) << 1) | ((d3 < 0) << 2) | ((d4 < 0) << 3))
6239 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;
6240 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;
6241 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;
6242 case 3: /* <<>> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6243 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;
6244 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;
6245 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;
6246 case 7: /* <<<> */ f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6247 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;
6248 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;
6249 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;
6250 case 11: /* <<>< */ f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6251 case 12: /* >><< */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6252 case 13: /* <><< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6253 case 14: /* ><<< */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6254 case 15: /* <<<< */ break;
6257 else if (node->type == BIH_UNORDERED)
6259 // calculate sweep bounds for this node
6260 // copy node bounds into local variables
6261 VectorCopy(node->mins, nodebigmins);
6262 VectorCopy(node->maxs, nodebigmaxs);
6263 // clip line to this node bounds
6264 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); }
6265 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); }
6266 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); }
6267 // some of the line intersected the enlarged node box
6268 // calculate sweep bounds for this node
6269 sweepnodemins[0] = min(nodestart[0], nodeend[0]); sweepnodemins[1] = min(nodestart[1], nodeend[1]); sweepnodemins[2] = min(nodestart[2], nodeend[2]); sweepnodemaxs[0] = max(nodestart[0], nodeend[0]); sweepnodemaxs[1] = max(nodestart[1], nodeend[1]); sweepnodemaxs[2] = max(nodestart[2], nodeend[2]);
6270 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6272 leaf = bih->leafs + node->children[axis];
6273 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, leaf->mins, leaf->maxs))
6278 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6279 Collision_TraceLineBrushFloat(trace, start, end, brush, brush);
6281 case BIH_COLLISIONTRIANGLE:
6282 if (!mod_q3bsp_curves_collisions.integer)
6284 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6285 texture = model->data_textures + leaf->textureindex;
6286 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);
6288 case BIH_RENDERTRIANGLE:
6289 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6290 texture = model->data_textures + leaf->textureindex;
6291 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);
6299 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)
6301 if (VectorCompare(start, end))
6303 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6306 Mod_CollisionBIH_TraceLineShared(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, &model->collision_bih);
6309 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)
6312 const bih_leaf_t *leaf;
6313 const bih_node_t *node;
6314 const colbrushf_t *brush;
6316 const texture_t *texture;
6317 vec3_t start, end, startmins, startmaxs, endmins, endmaxs, mins, maxs;
6318 vec3_t nodebigmins, nodebigmaxs, nodestart, nodeend, sweepnodemins, sweepnodemaxs;
6319 vec_t d1, d2, d3, d4, f, nodestackline[1024][6];
6320 int axis, nodenum, nodestackpos = 0, nodestack[1024];
6322 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(thisbrush_start->mins, thisbrush_start->maxs) && VectorCompare(thisbrush_end->mins, thisbrush_end->maxs))
6324 if (VectorCompare(thisbrush_start->mins, thisbrush_end->mins))
6325 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, thisbrush_start->mins, hitsupercontentsmask);
6327 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, thisbrush_start->mins, thisbrush_end->mins, hitsupercontentsmask);
6331 bih = &model->collision_bih;
6334 nodenum = bih->rootnode;
6336 // box trace, performed as brush trace
6337 memset(trace, 0, sizeof(*trace));
6338 trace->fraction = 1;
6339 trace->realfraction = 1;
6340 trace->hitsupercontentsmask = hitsupercontentsmask;
6342 // calculate tracebox-like parameters for efficient culling
6343 VectorMAM(0.5f, thisbrush_start->mins, 0.5f, thisbrush_start->maxs, start);
6344 VectorMAM(0.5f, thisbrush_end->mins, 0.5f, thisbrush_end->maxs, end);
6345 VectorSubtract(thisbrush_start->mins, start, startmins);
6346 VectorSubtract(thisbrush_start->maxs, start, startmaxs);
6347 VectorSubtract(thisbrush_end->mins, end, endmins);
6348 VectorSubtract(thisbrush_end->maxs, end, endmaxs);
6349 mins[0] = min(startmins[0], endmins[0]);
6350 mins[1] = min(startmins[1], endmins[1]);
6351 mins[2] = min(startmins[2], endmins[2]);
6352 maxs[0] = max(startmaxs[0], endmaxs[0]);
6353 maxs[1] = max(startmaxs[1], endmaxs[1]);
6354 maxs[2] = max(startmaxs[2], endmaxs[2]);
6357 nodestackline[nodestackpos][0] = start[0];
6358 nodestackline[nodestackpos][1] = start[1];
6359 nodestackline[nodestackpos][2] = start[2];
6360 nodestackline[nodestackpos][3] = end[0];
6361 nodestackline[nodestackpos][4] = end[1];
6362 nodestackline[nodestackpos][5] = end[2];
6363 nodestack[nodestackpos++] = nodenum;
6364 while (nodestackpos)
6366 nodenum = nodestack[--nodestackpos];
6367 node = bih->nodes + nodenum;
6368 VectorCopy(nodestackline[nodestackpos], nodestart);
6369 VectorCopy(nodestackline[nodestackpos] + 3, nodeend);
6370 sweepnodemins[0] = min(nodestart[0], nodeend[0]) + mins[0]; sweepnodemins[1] = min(nodestart[1], nodeend[1]) + mins[1]; sweepnodemins[2] = min(nodestart[2], nodeend[2]) + mins[2]; sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + maxs[0]; sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + maxs[1]; sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + maxs[2];
6371 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs))
6373 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6375 // recurse children of the split
6376 axis = node->type - BIH_SPLITX;
6377 d1 = node->backmax - nodestart[axis] - mins[axis];
6378 d2 = node->backmax - nodeend[axis] - mins[axis];
6379 d3 = nodestart[axis] - node->frontmin + maxs[axis];
6380 d4 = nodeend[axis] - node->frontmin + maxs[axis];
6381 switch((d1 < 0) | ((d2 < 0) << 1) | ((d3 < 0) << 2) | ((d4 < 0) << 3))
6383 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;
6384 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;
6385 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;
6386 case 3: /* <<>> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6387 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;
6388 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;
6389 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;
6390 case 7: /* <<<> */ f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6391 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;
6392 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;
6393 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;
6394 case 11: /* <<>< */ f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6395 case 12: /* >><< */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6396 case 13: /* <><< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6397 case 14: /* ><<< */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6398 case 15: /* <<<< */ break;
6401 else if (node->type == BIH_UNORDERED)
6403 // calculate sweep bounds for this node
6404 // copy node bounds into local variables and expand to get Minkowski Sum of the two shapes
6405 VectorSubtract(node->mins, maxs, nodebigmins);
6406 VectorSubtract(node->maxs, mins, nodebigmaxs);
6407 // clip line to this node bounds
6408 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); }
6409 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); }
6410 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); }
6411 // some of the line intersected the enlarged node box
6412 // calculate sweep bounds for this node
6413 sweepnodemins[0] = min(nodestart[0], nodeend[0]) + mins[0]; sweepnodemins[1] = min(nodestart[1], nodeend[1]) + mins[1]; sweepnodemins[2] = min(nodestart[2], nodeend[2]) + mins[2]; sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + maxs[0]; sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + maxs[1]; sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + maxs[2];
6414 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6416 leaf = bih->leafs + node->children[axis];
6417 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, leaf->mins, leaf->maxs))
6422 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6423 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6425 case BIH_COLLISIONTRIANGLE:
6426 if (!mod_q3bsp_curves_collisions.integer)
6428 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
6429 texture = model->data_textures + leaf->textureindex;
6430 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);
6432 case BIH_RENDERTRIANGLE:
6433 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
6434 texture = model->data_textures + leaf->textureindex;
6435 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);
6443 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)
6445 colboxbrushf_t thisbrush_start, thisbrush_end;
6446 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6448 // box trace, performed as brush trace
6449 VectorAdd(start, boxmins, boxstartmins);
6450 VectorAdd(start, boxmaxs, boxstartmaxs);
6451 VectorAdd(end, boxmins, boxendmins);
6452 VectorAdd(end, boxmaxs, boxendmaxs);
6453 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6454 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6455 Mod_CollisionBIH_TraceBrush(model, frameblend, skeleton, trace, &thisbrush_start.brush, &thisbrush_end.brush, hitsupercontentsmask);
6459 int Mod_CollisionBIH_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6462 Mod_CollisionBIH_TracePoint(model, NULL, NULL, &trace, point, 0);
6463 return trace.startsupercontents;
6466 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)
6469 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6471 int hitsupercontents;
6472 VectorSet(end, start[0], start[1], model->normalmins[2]);
6474 memset(trace, 0, sizeof(*trace));
6475 trace->fraction = 1;
6476 trace->realfraction = 1;
6477 trace->hitsupercontentsmask = hitsupercontentsmask;
6479 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
6480 hitsupercontents = trace->hitsupercontents;
6481 memset(trace, 0, sizeof(*trace));
6482 trace->fraction = 1;
6483 trace->realfraction = 1;
6484 trace->hitsupercontentsmask = hitsupercontentsmask;
6485 trace->startsupercontents = hitsupercontents;
6489 int Mod_CollisionBIH_PointSuperContents_Mesh(struct model_s *model, int frame, const vec3_t start)
6492 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
6495 VectorSet(end, start[0], start[1], model->normalmins[2]);
6496 memset(&trace, 0, sizeof(trace));
6498 trace.realfraction = 1;
6499 trace.hitsupercontentsmask = 0;
6500 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
6501 return trace.hitsupercontents;
6507 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
6512 // find which leaf the point is in
6514 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
6515 // point trace the brushes
6516 leaf = (mleaf_t *)node;
6517 for (i = 0;i < leaf->numleafbrushes;i++)
6519 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6520 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
6522 brush->markframe = markframe;
6523 Collision_TracePointBrushFloat(trace, point, brush);
6526 // can't do point traces on curves (they have no thickness)
6529 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)
6531 int i, startside, endside;
6532 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
6534 msurface_t *surface;
6537 // walk the tree until we hit a leaf, recursing for any split cases
6541 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6543 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[0], start, end, startfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6544 node = node->children[1];
6546 // abort if this part of the bsp tree can not be hit by this trace
6547 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6549 plane = node->plane;
6550 // axial planes are much more common than non-axial, so an optimized
6551 // axial case pays off here
6552 if (plane->type < 3)
6554 dist1 = start[plane->type] - plane->dist;
6555 dist2 = end[plane->type] - plane->dist;
6559 dist1 = DotProduct(start, plane->normal) - plane->dist;
6560 dist2 = DotProduct(end, plane->normal) - plane->dist;
6562 startside = dist1 < 0;
6563 endside = dist2 < 0;
6564 if (startside == endside)
6566 // most of the time the line fragment is on one side of the plane
6567 node = node->children[startside];
6571 // line crosses node plane, split the line
6572 dist1 = PlaneDiff(linestart, plane);
6573 dist2 = PlaneDiff(lineend, plane);
6574 midfrac = dist1 / (dist1 - dist2);
6575 VectorLerp(linestart, midfrac, lineend, mid);
6576 // take the near side first
6577 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6578 // if we found an impact on the front side, don't waste time
6579 // exploring the far side
6580 if (midfrac <= trace->realfraction)
6581 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
6586 // abort if this part of the bsp tree can not be hit by this trace
6587 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6590 nodesegmentmins[0] = min(start[0], end[0]) - 1;
6591 nodesegmentmins[1] = min(start[1], end[1]) - 1;
6592 nodesegmentmins[2] = min(start[2], end[2]) - 1;
6593 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
6594 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
6595 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
6596 // line trace the brushes
6597 leaf = (mleaf_t *)node;
6599 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6602 for (i = 0;i < leaf->numleafbrushes;i++)
6604 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6605 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6607 brush->markframe = markframe;
6608 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
6611 // can't do point traces on curves (they have no thickness)
6612 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
6614 // line trace the curves
6615 for (i = 0;i < leaf->numleafsurfaces;i++)
6617 surface = model->data_surfaces + leaf->firstleafsurface[i];
6618 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6620 surface->deprecatedq3collisionmarkframe = markframe;
6621 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);
6627 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)
6633 msurface_t *surface;
6635 float nodesegmentmins[3], nodesegmentmaxs[3];
6636 // walk the tree until we hit a leaf, recursing for any split cases
6640 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
6642 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6643 node = node->children[1];
6645 // abort if this part of the bsp tree can not be hit by this trace
6646 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6648 plane = node->plane;
6649 // axial planes are much more common than non-axial, so an optimized
6650 // axial case pays off here
6651 if (plane->type < 3)
6653 // this is an axial plane, compare bounding box directly to it and
6654 // recurse sides accordingly
6655 // recurse down node sides
6656 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
6657 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
6658 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
6659 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
6663 // this is a non-axial plane, so check if the start and end boxes
6664 // are both on one side of the plane to handle 'diagonal' cases
6665 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
6669 // segment crosses plane
6670 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
6673 // if sides == 0 then the trace itself is bogus (Not A Number values),
6674 // in this case we simply pretend the trace hit nothing
6676 return; // ERROR: NAN bounding box!
6677 // take whichever side the segment box is on
6678 node = node->children[sides - 1];
6681 // abort if this part of the bsp tree can not be hit by this trace
6682 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
6684 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
6685 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
6686 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
6687 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
6688 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
6689 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
6691 leaf = (mleaf_t *)node;
6693 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
6696 for (i = 0;i < leaf->numleafbrushes;i++)
6698 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
6699 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
6701 brush->markframe = markframe;
6702 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
6705 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
6707 for (i = 0;i < leaf->numleafsurfaces;i++)
6709 surface = model->data_surfaces + leaf->firstleafsurface[i];
6710 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
6712 surface->deprecatedq3collisionmarkframe = markframe;
6713 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);
6720 static int markframe = 0;
6722 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)
6726 memset(trace, 0, sizeof(*trace));
6727 trace->fraction = 1;
6728 trace->realfraction = 1;
6729 trace->hitsupercontentsmask = hitsupercontentsmask;
6730 if (mod_collision_bih.integer)
6731 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6732 else if (model->brush.submodel)
6734 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6735 if (brush->colbrushf)
6736 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
6739 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
6742 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)
6745 float segmentmins[3], segmentmaxs[3];
6746 msurface_t *surface;
6749 if (VectorCompare(start, end))
6751 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask);
6755 memset(trace, 0, sizeof(*trace));
6756 trace->fraction = 1;
6757 trace->realfraction = 1;
6758 trace->hitsupercontentsmask = hitsupercontentsmask;
6759 segmentmins[0] = min(start[0], end[0]) - 1;
6760 segmentmins[1] = min(start[1], end[1]) - 1;
6761 segmentmins[2] = min(start[2], end[2]) - 1;
6762 segmentmaxs[0] = max(start[0], end[0]) + 1;
6763 segmentmaxs[1] = max(start[1], end[1]) + 1;
6764 segmentmaxs[2] = max(start[2], end[2]) + 1;
6765 if (mod_collision_bih.integer)
6766 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
6767 else if (model->brush.submodel)
6769 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6770 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6771 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6772 if (mod_q3bsp_curves_collisions.integer)
6773 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6774 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6775 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);
6778 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
6781 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)
6783 float segmentmins[3], segmentmaxs[3];
6785 msurface_t *surface;
6788 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(start->mins, start->maxs) && VectorCompare(end->mins, end->maxs))
6790 if (VectorCompare(start->mins, end->mins))
6791 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start->mins, hitsupercontentsmask);
6793 Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, start->mins, end->mins, hitsupercontentsmask);
6797 // box trace, performed as brush trace
6798 memset(trace, 0, sizeof(*trace));
6799 trace->fraction = 1;
6800 trace->realfraction = 1;
6801 trace->hitsupercontentsmask = hitsupercontentsmask;
6802 segmentmins[0] = min(start->mins[0], end->mins[0]);
6803 segmentmins[1] = min(start->mins[1], end->mins[1]);
6804 segmentmins[2] = min(start->mins[2], end->mins[2]);
6805 segmentmaxs[0] = max(start->maxs[0], end->maxs[0]);
6806 segmentmaxs[1] = max(start->maxs[1], end->maxs[1]);
6807 segmentmaxs[2] = max(start->maxs[2], end->maxs[2]);
6808 if (mod_collision_bih.integer)
6809 Mod_CollisionBIH_TraceBrush(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask);
6810 else if (model->brush.submodel)
6812 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6813 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
6814 Collision_TraceBrushBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
6815 if (mod_q3bsp_curves_collisions.integer)
6816 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
6817 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
6818 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);
6821 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, ++markframe, segmentmins, segmentmaxs);
6824 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)
6826 colboxbrushf_t thisbrush_start, thisbrush_end;
6827 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
6829 // box trace, performed as brush trace
6830 VectorAdd(start, boxmins, boxstartmins);
6831 VectorAdd(start, boxmaxs, boxstartmaxs);
6832 VectorAdd(end, boxmins, boxendmins);
6833 VectorAdd(end, boxmaxs, boxendmaxs);
6834 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
6835 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
6836 Mod_Q3BSP_TraceBrush(model, frameblend, skeleton, trace, &thisbrush_start.brush, &thisbrush_end.brush, hitsupercontentsmask);
6839 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
6842 int supercontents = 0;
6844 if (mod_collision_bih.integer)
6847 Mod_Q3BSP_TracePoint(model, NULL, NULL, &trace, point, 0);
6848 supercontents = trace.startsupercontents;
6850 // test if the point is inside each brush
6851 else if (model->brush.submodel)
6853 // submodels are effectively one leaf
6854 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
6855 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6856 supercontents |= brush->colbrushf->supercontents;
6860 mnode_t *node = model->brush.data_nodes;
6862 // find which leaf the point is in
6864 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
6865 leaf = (mleaf_t *)node;
6866 // now check the brushes in the leaf
6867 for (i = 0;i < leaf->numleafbrushes;i++)
6869 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
6870 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
6871 supercontents |= brush->colbrushf->supercontents;
6874 return supercontents;
6877 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)
6879 Mod_CollisionBIH_TraceLineShared(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, &model->render_bih);
6883 bih_t *Mod_MakeCollisionBIH(dp_model_t *model, qboolean userendersurfaces, bih_t *out)
6891 int nummodelbrushes = model->nummodelbrushes;
6892 int nummodelsurfaces = model->nummodelsurfaces;
6894 const int *collisionelement3i;
6895 const float *collisionvertex3f;
6896 const int *renderelement3i;
6897 const float *rendervertex3f;
6898 bih_leaf_t *bihleafs;
6899 bih_node_t *bihnodes;
6901 int *temp_leafsortscratch;
6902 const msurface_t *surface;
6903 const q3mbrush_t *brush;
6905 // find out how many BIH leaf nodes we need
6907 if (userendersurfaces)
6909 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6910 bihnumleafs += surface->num_triangles;
6914 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
6915 if (brush->colbrushf)
6917 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6919 if (surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS)
6920 bihnumleafs += surface->num_triangles + surface->num_collisiontriangles;
6922 bihnumleafs += surface->num_collisiontriangles;
6929 // allocate the memory for the BIH leaf nodes
6930 bihleafs = (bih_leaf_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_leaf_t) * bihnumleafs);
6932 // now populate the BIH leaf nodes
6935 // add render surfaces
6936 renderelement3i = model->surfmesh.data_element3i;
6937 rendervertex3f = model->surfmesh.data_vertex3f;
6938 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6940 for (triangleindex = 0, e = renderelement3i + 3*surface->num_firsttriangle;triangleindex < surface->num_triangles;triangleindex++, e += 3)
6942 if (!userendersurfaces && !(surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS))
6944 bihleafs[bihleafindex].type = BIH_RENDERTRIANGLE;
6945 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
6946 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
6947 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firsttriangle;
6948 bihleafs[bihleafindex].mins[0] = min(rendervertex3f[3*e[0]+0], min(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) - 1;
6949 bihleafs[bihleafindex].mins[1] = min(rendervertex3f[3*e[0]+1], min(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) - 1;
6950 bihleafs[bihleafindex].mins[2] = min(rendervertex3f[3*e[0]+2], min(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) - 1;
6951 bihleafs[bihleafindex].maxs[0] = max(rendervertex3f[3*e[0]+0], max(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) + 1;
6952 bihleafs[bihleafindex].maxs[1] = max(rendervertex3f[3*e[0]+1], max(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) + 1;
6953 bihleafs[bihleafindex].maxs[2] = max(rendervertex3f[3*e[0]+2], max(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) + 1;
6958 if (!userendersurfaces)
6960 // add collision brushes
6961 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
6963 if (!brush->colbrushf)
6965 bihleafs[bihleafindex].type = BIH_BRUSH;
6966 bihleafs[bihleafindex].textureindex = brush->texture - model->data_textures;
6967 bihleafs[bihleafindex].surfaceindex = -1;
6968 bihleafs[bihleafindex].itemindex = brushindex+model->firstmodelbrush;
6969 VectorCopy(brush->colbrushf->mins, bihleafs[bihleafindex].mins);
6970 VectorCopy(brush->colbrushf->maxs, bihleafs[bihleafindex].maxs);
6974 // add collision surfaces
6975 collisionelement3i = model->brush.data_collisionelement3i;
6976 collisionvertex3f = model->brush.data_collisionvertex3f;
6977 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
6979 for (triangleindex = 0, e = collisionelement3i + 3*surface->num_firstcollisiontriangle;triangleindex < surface->num_collisiontriangles;triangleindex++, e += 3)
6981 bihleafs[bihleafindex].type = BIH_COLLISIONTRIANGLE;
6982 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
6983 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
6984 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firstcollisiontriangle;
6985 bihleafs[bihleafindex].mins[0] = min(collisionvertex3f[3*e[0]+0], min(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) - 1;
6986 bihleafs[bihleafindex].mins[1] = min(collisionvertex3f[3*e[0]+1], min(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) - 1;
6987 bihleafs[bihleafindex].mins[2] = min(collisionvertex3f[3*e[0]+2], min(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) - 1;
6988 bihleafs[bihleafindex].maxs[0] = max(collisionvertex3f[3*e[0]+0], max(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) + 1;
6989 bihleafs[bihleafindex].maxs[1] = max(collisionvertex3f[3*e[0]+1], max(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) + 1;
6990 bihleafs[bihleafindex].maxs[2] = max(collisionvertex3f[3*e[0]+2], max(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) + 1;
6996 // allocate buffers for the produced and temporary data
6997 bihmaxnodes = bihnumleafs + 1;
6998 bihnodes = (bih_node_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_node_t) * bihmaxnodes);
6999 temp_leafsort = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * bihnumleafs * 2);
7000 temp_leafsortscratch = temp_leafsort + bihnumleafs;
7003 BIH_Build(out, bihnumleafs, bihleafs, bihmaxnodes, bihnodes, temp_leafsort, temp_leafsortscratch);
7005 // we're done with the temporary data
7006 Mem_Free(temp_leafsort);
7008 // resize the BIH nodes array if it over-allocated
7009 if (out->maxnodes > out->numnodes)
7011 out->maxnodes = out->numnodes;
7012 out->nodes = (bih_node_t *)Mem_Realloc(loadmodel->mempool, out->nodes, out->numnodes * sizeof(bih_node_t));
7018 static int Mod_Q3BSP_SuperContentsFromNativeContents(dp_model_t *model, int nativecontents)
7020 int supercontents = 0;
7021 if (nativecontents & CONTENTSQ3_SOLID)
7022 supercontents |= SUPERCONTENTS_SOLID;
7023 if (nativecontents & CONTENTSQ3_WATER)
7024 supercontents |= SUPERCONTENTS_WATER;
7025 if (nativecontents & CONTENTSQ3_SLIME)
7026 supercontents |= SUPERCONTENTS_SLIME;
7027 if (nativecontents & CONTENTSQ3_LAVA)
7028 supercontents |= SUPERCONTENTS_LAVA;
7029 if (nativecontents & CONTENTSQ3_BODY)
7030 supercontents |= SUPERCONTENTS_BODY;
7031 if (nativecontents & CONTENTSQ3_CORPSE)
7032 supercontents |= SUPERCONTENTS_CORPSE;
7033 if (nativecontents & CONTENTSQ3_NODROP)
7034 supercontents |= SUPERCONTENTS_NODROP;
7035 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
7036 supercontents |= SUPERCONTENTS_PLAYERCLIP;
7037 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
7038 supercontents |= SUPERCONTENTS_MONSTERCLIP;
7039 if (nativecontents & CONTENTSQ3_DONOTENTER)
7040 supercontents |= SUPERCONTENTS_DONOTENTER;
7041 if (nativecontents & CONTENTSQ3_BOTCLIP)
7042 supercontents |= SUPERCONTENTS_BOTCLIP;
7043 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
7044 supercontents |= SUPERCONTENTS_OPAQUE;
7045 return supercontents;
7048 static int Mod_Q3BSP_NativeContentsFromSuperContents(dp_model_t *model, int supercontents)
7050 int nativecontents = 0;
7051 if (supercontents & SUPERCONTENTS_SOLID)
7052 nativecontents |= CONTENTSQ3_SOLID;
7053 if (supercontents & SUPERCONTENTS_WATER)
7054 nativecontents |= CONTENTSQ3_WATER;
7055 if (supercontents & SUPERCONTENTS_SLIME)
7056 nativecontents |= CONTENTSQ3_SLIME;
7057 if (supercontents & SUPERCONTENTS_LAVA)
7058 nativecontents |= CONTENTSQ3_LAVA;
7059 if (supercontents & SUPERCONTENTS_BODY)
7060 nativecontents |= CONTENTSQ3_BODY;
7061 if (supercontents & SUPERCONTENTS_CORPSE)
7062 nativecontents |= CONTENTSQ3_CORPSE;
7063 if (supercontents & SUPERCONTENTS_NODROP)
7064 nativecontents |= CONTENTSQ3_NODROP;
7065 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
7066 nativecontents |= CONTENTSQ3_PLAYERCLIP;
7067 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
7068 nativecontents |= CONTENTSQ3_MONSTERCLIP;
7069 if (supercontents & SUPERCONTENTS_DONOTENTER)
7070 nativecontents |= CONTENTSQ3_DONOTENTER;
7071 if (supercontents & SUPERCONTENTS_BOTCLIP)
7072 nativecontents |= CONTENTSQ3_BOTCLIP;
7073 if (!(supercontents & SUPERCONTENTS_OPAQUE))
7074 nativecontents |= CONTENTSQ3_TRANSLUCENT;
7075 return nativecontents;
7078 void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
7083 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
7084 node = node->children[1];
7086 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
7087 if (loadmodel->brush.num_leafs < numleafs)
7088 loadmodel->brush.num_leafs = numleafs;
7091 void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7094 q3dheader_t *header;
7095 float corner[3], yawradius, modelradius;
7097 mod->modeldatatypestring = "Q3BSP";
7099 mod->type = mod_brushq3;
7100 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
7103 header = (q3dheader_t *)buffer;
7104 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
7105 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
7107 i = LittleLong(header->version);
7108 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
7109 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
7111 mod->soundfromcenter = true;
7112 mod->TraceBox = Mod_Q3BSP_TraceBox;
7113 mod->TraceBrush = Mod_Q3BSP_TraceBrush;
7114 mod->TraceLine = Mod_Q3BSP_TraceLine;
7115 mod->TracePoint = Mod_Q3BSP_TracePoint;
7116 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
7117 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7118 mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
7119 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
7120 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
7121 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
7122 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
7123 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
7124 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
7125 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
7126 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
7127 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
7128 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
7129 mod->brush.AmbientSoundLevelsForPoint = NULL;
7130 mod->brush.RoundUpToHullSize = NULL;
7131 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
7132 mod->Draw = R_Q1BSP_Draw;
7133 mod->DrawDepth = R_Q1BSP_DrawDepth;
7134 mod->DrawDebug = R_Q1BSP_DrawDebug;
7135 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
7136 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
7137 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7138 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7139 mod->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7140 mod->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7141 mod->DrawLight = R_Q1BSP_DrawLight;
7143 mod_base = (unsigned char *)header;
7145 // swap all the lumps
7146 header->ident = LittleLong(header->ident);
7147 header->version = LittleLong(header->version);
7148 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
7149 for (i = 0;i < lumps;i++)
7151 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
7152 if((char *) bufferend < (char *) buffer + j)
7153 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
7154 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
7155 if((char *) bufferend < (char *) buffer + j)
7156 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
7159 * NO, do NOT clear them!
7160 * they contain actual data referenced by other stuff.
7161 * Instead, before using the advertisements lump, check header->versio
7163 * Sorry, but otherwise it breaks memory of the first lump.
7164 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
7166 header->lumps[i].fileofs = 0;
7167 header->lumps[i].filelen = 0;
7171 mod->brush.qw_md4sum = 0;
7172 mod->brush.qw_md4sum2 = 0;
7173 for (i = 0;i < lumps;i++)
7175 if (i == Q3LUMP_ENTITIES)
7177 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7178 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
7180 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7182 // all this checksumming can take a while, so let's send keepalives here too
7183 CL_KeepaliveMessage(false);
7186 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
7187 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
7188 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
7189 if (header->version == Q3BSPVERSION_IG)
7190 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
7192 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
7193 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
7194 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
7195 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
7196 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
7197 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
7198 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
7199 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
7200 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
7201 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
7202 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
7203 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
7204 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
7205 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
7206 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
7208 // the MakePortals code works fine on the q3bsp data as well
7209 if (mod_bsp_portalize.integer)
7210 Mod_Q1BSP_MakePortals();
7212 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
7213 loadmodel->brush.supportwateralpha = true;
7215 // make a single combined shadow mesh to allow optimized shadow volume creation
7216 Mod_Q1BSP_CreateShadowMesh(loadmodel);
7218 loadmodel->brush.num_leafs = 0;
7219 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
7221 if (loadmodel->brush.numsubmodels)
7222 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7225 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7230 // duplicate the basic information
7231 dpsnprintf(name, sizeof(name), "*%i", i);
7232 mod = Mod_FindName(name, loadmodel->name);
7233 // copy the base model to this one
7235 // rename the clone back to its proper name
7236 strlcpy(mod->name, name, sizeof(mod->name));
7237 mod->brush.parentmodel = loadmodel;
7238 // textures and memory belong to the main model
7239 mod->texturepool = NULL;
7240 mod->mempool = NULL;
7241 mod->brush.GetPVS = NULL;
7242 mod->brush.FatPVS = NULL;
7243 mod->brush.BoxTouchingPVS = NULL;
7244 mod->brush.BoxTouchingLeafPVS = NULL;
7245 mod->brush.BoxTouchingVisibleLeafs = NULL;
7246 mod->brush.FindBoxClusters = NULL;
7247 mod->brush.LightPoint = NULL;
7248 mod->brush.AmbientSoundLevelsForPoint = NULL;
7250 mod->brush.submodel = i;
7251 if (loadmodel->brush.submodels)
7252 loadmodel->brush.submodels[i] = mod;
7254 // make the model surface list (used by shadowing/lighting)
7255 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
7256 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
7257 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
7258 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
7259 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
7260 Mod_MakeSortedSurfaces(mod);
7262 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
7263 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
7264 // enlarge the bounding box to enclose all geometry of this model,
7265 // because q3map2 sometimes lies (mostly to affect the lightgrid),
7266 // which can in turn mess up the farclip (as well as culling when
7267 // outside the level - an unimportant concern)
7269 //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]);
7270 for (j = 0;j < mod->nummodelsurfaces;j++)
7272 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7273 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7275 if (!surface->num_vertices)
7277 for (k = 0;k < surface->num_vertices;k++, v += 3)
7279 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7280 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7281 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7282 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7283 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7284 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7287 //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]);
7288 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7289 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7290 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7291 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7292 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7293 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7294 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7295 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7296 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7297 mod->yawmins[2] = mod->normalmins[2];
7298 mod->yawmaxs[2] = mod->normalmaxs[2];
7299 mod->radius = modelradius;
7300 mod->radius2 = modelradius * modelradius;
7302 // this gets altered below if sky or water is used
7303 mod->DrawSky = NULL;
7304 mod->DrawAddWaterPlanes = NULL;
7306 for (j = 0;j < mod->nummodelsurfaces;j++)
7307 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7309 if (j < mod->nummodelsurfaces)
7310 mod->DrawSky = R_Q1BSP_DrawSky;
7312 for (j = 0;j < mod->nummodelsurfaces;j++)
7313 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7315 if (j < mod->nummodelsurfaces)
7316 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
7318 Mod_MakeCollisionBIH(mod, false, &mod->collision_bih);
7319 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
7321 // generate VBOs and other shared data before cloning submodels
7326 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);
7329 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7331 int i = LittleLong(((int *)buffer)[1]);
7332 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
7333 Mod_Q3BSP_Load(mod,buffer, bufferend);
7334 else if (i == Q2BSPVERSION)
7335 Mod_Q2BSP_Load(mod,buffer, bufferend);
7337 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
7340 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7342 Host_Error("Mod_MAP_Load: not yet implemented");
7345 typedef struct objvertex_s
7356 static unsigned char nobsp_pvs[1] = {1};
7358 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
7360 const char *textbase = (char *)buffer, *text = textbase;
7364 char materialname[MAX_QPATH];
7365 int i, j, l, numvertices, firstvertex, firsttriangle, elementindex, vertexindex, surfacevertices, surfacetriangles, surfaceelements, submodelindex = 0;
7366 int index1, index2, index3;
7367 objvertex_t vfirst, vprev, vcurrent;
7370 int numtriangles = 0;
7371 int maxtriangles = 0;
7372 objvertex_t *vertices = NULL;
7374 int maxtextures = 0, numtextures = 0, textureindex = 0;
7375 int maxv = 0, numv = 1;
7376 int maxvt = 0, numvt = 1;
7377 int maxvn = 0, numvn = 1;
7378 char *texturenames = NULL;
7379 float dist, modelradius, modelyawradius, yawradius;
7386 objvertex_t *thisvertex = NULL;
7387 int vertexhashindex;
7388 int *vertexhashtable = NULL;
7389 objvertex_t *vertexhashdata = NULL;
7390 objvertex_t *vdata = NULL;
7391 int vertexhashsize = 0;
7392 int vertexhashcount = 0;
7393 skinfile_t *skinfiles = NULL;
7394 unsigned char *data = NULL;
7395 int *submodelfirstsurface;
7396 msurface_t *surface;
7397 msurface_t *tempsurfaces;
7399 memset(&vfirst, 0, sizeof(vfirst));
7400 memset(&vprev, 0, sizeof(vprev));
7401 memset(&vcurrent, 0, sizeof(vcurrent));
7403 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
7405 loadmodel->modeldatatypestring = "OBJ";
7407 loadmodel->type = mod_obj;
7408 loadmodel->soundfromcenter = true;
7409 loadmodel->TraceBox = Mod_CollisionBIH_TraceBox;
7410 loadmodel->TraceBrush = Mod_CollisionBIH_TraceBrush;
7411 loadmodel->TraceLine = Mod_CollisionBIH_TraceLine;
7412 loadmodel->TracePoint = Mod_CollisionBIH_TracePoint_Mesh;
7413 loadmodel->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7414 loadmodel->PointSuperContents = Mod_CollisionBIH_PointSuperContents_Mesh;
7415 loadmodel->brush.TraceLineOfSight = NULL;
7416 loadmodel->brush.SuperContentsFromNativeContents = NULL;
7417 loadmodel->brush.NativeContentsFromSuperContents = NULL;
7418 loadmodel->brush.GetPVS = NULL;
7419 loadmodel->brush.FatPVS = NULL;
7420 loadmodel->brush.BoxTouchingPVS = NULL;
7421 loadmodel->brush.BoxTouchingLeafPVS = NULL;
7422 loadmodel->brush.BoxTouchingVisibleLeafs = NULL;
7423 loadmodel->brush.FindBoxClusters = NULL;
7424 loadmodel->brush.LightPoint = NULL;
7425 loadmodel->brush.FindNonSolidLocation = NULL;
7426 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
7427 loadmodel->brush.RoundUpToHullSize = NULL;
7428 loadmodel->brush.PointInLeaf = NULL;
7429 loadmodel->Draw = R_Q1BSP_Draw;
7430 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
7431 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
7432 loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
7433 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
7434 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7435 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7436 loadmodel->CompileShadowVolume = R_Q1BSP_CompileShadowVolume;
7437 loadmodel->DrawShadowVolume = R_Q1BSP_DrawShadowVolume;
7438 loadmodel->DrawLight = R_Q1BSP_DrawLight;
7440 skinfiles = Mod_LoadSkinFiles();
7441 if (loadmodel->numskins < 1)
7442 loadmodel->numskins = 1;
7444 // make skinscenes for the skins (no groups)
7445 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
7446 for (i = 0;i < loadmodel->numskins;i++)
7448 loadmodel->skinscenes[i].firstframe = i;
7449 loadmodel->skinscenes[i].framecount = 1;
7450 loadmodel->skinscenes[i].loop = true;
7451 loadmodel->skinscenes[i].framerate = 10;
7457 // we always have model 0, i.e. the first "submodel"
7458 loadmodel->brush.numsubmodels = 1;
7460 // parse the OBJ text now
7463 static char emptyarg[1] = "";
7468 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
7469 line[linelen] = text[linelen];
7471 for (argc = 0;argc < 4;argc++)
7472 argv[argc] = emptyarg;
7475 while (*s == ' ' || *s == '\t')
7485 while (*s == ' ' || *s == '\t')
7495 if (argv[0][0] == '#')
7497 if (!strcmp(argv[0], "v"))
7501 maxv = max(maxv * 2, 1024);
7502 v = (float *)Mem_Realloc(tempmempool, v, maxv * sizeof(float[3]));
7504 v[numv*3+0] = atof(argv[1]);
7505 v[numv*3+2] = atof(argv[2]);
7506 v[numv*3+1] = atof(argv[3]);
7509 else if (!strcmp(argv[0], "vt"))
7513 maxvt = max(maxvt * 2, 1024);
7514 vt = (float *)Mem_Realloc(tempmempool, vt, maxvt * sizeof(float[2]));
7516 vt[numvt*2+0] = atof(argv[1]);
7517 vt[numvt*2+1] = 1-atof(argv[2]);
7520 else if (!strcmp(argv[0], "vn"))
7524 maxvn = max(maxvn * 2, 1024);
7525 vn = (float *)Mem_Realloc(tempmempool, vn, maxvn * sizeof(float[3]));
7527 vn[numvn*3+0] = atof(argv[1]);
7528 vn[numvn*3+2] = atof(argv[2]);
7529 vn[numvn*3+1] = atof(argv[3]);
7532 else if (!strcmp(argv[0], "f"))
7536 if (maxtextures <= numtextures)
7538 maxtextures = max(maxtextures * 2, 256);
7539 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7541 textureindex = numtextures++;
7542 strlcpy(texturenames + textureindex*MAX_QPATH, loadmodel->name, MAX_QPATH);
7544 for (j = 1;j < argc;j++)
7546 index1 = atoi(argv[j]);
7547 while(argv[j][0] && argv[j][0] != '/')
7551 index2 = atoi(argv[j]);
7552 while(argv[j][0] && argv[j][0] != '/')
7556 index3 = atoi(argv[j]);
7557 // negative refers to a recent vertex
7558 // zero means not specified
7559 // positive means an absolute vertex index
7561 index1 = numv - index1;
7563 index2 = numvt - index2;
7565 index3 = numvn - index3;
7566 vcurrent.nextindex = -1;
7567 vcurrent.textureindex = textureindex;
7568 vcurrent.submodelindex = submodelindex;
7569 if (v && index1 >= 0 && index1 < numv)
7570 VectorCopy(v + 3*index1, vcurrent.v);
7571 if (vt && index2 >= 0 && index2 < numvt)
7572 Vector2Copy(vt + 2*index2, vcurrent.vt);
7573 if (vn && index3 >= 0 && index3 < numvn)
7574 VectorCopy(vn + 3*index3, vcurrent.vn);
7575 if (numtriangles == 0)
7577 VectorCopy(vcurrent.v, mins);
7578 VectorCopy(vcurrent.v, maxs);
7582 mins[0] = min(mins[0], vcurrent.v[0]);
7583 mins[1] = min(mins[1], vcurrent.v[1]);
7584 mins[2] = min(mins[2], vcurrent.v[2]);
7585 maxs[0] = max(maxs[0], vcurrent.v[0]);
7586 maxs[1] = max(maxs[1], vcurrent.v[1]);
7587 maxs[2] = max(maxs[2], vcurrent.v[2]);
7593 if (maxtriangles <= numtriangles)
7595 maxtriangles = max(maxtriangles * 2, 32768);
7596 vertices = (objvertex_t*)Mem_Realloc(loadmodel->mempool, vertices, maxtriangles * sizeof(objvertex_t[3]));
7598 vertices[numtriangles*3+0] = vfirst;
7599 vertices[numtriangles*3+1] = vprev;
7600 vertices[numtriangles*3+2] = vcurrent;
7606 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
7608 submodelindex = atof(argv[1]);
7609 loadmodel->brush.numsubmodels = max(submodelindex + 1, loadmodel->brush.numsubmodels);
7611 else if (!strcmp(argv[0], "usemtl"))
7613 for (i = 0;i < numtextures;i++)
7614 if (!strcmp(texturenames+i*MAX_QPATH, argv[1]))
7616 if (i < numtextures)
7620 if (maxtextures <= numtextures)
7622 maxtextures = max(maxtextures * 2, 256);
7623 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
7625 textureindex = numtextures++;
7626 strlcpy(texturenames + textureindex*MAX_QPATH, argv[1], MAX_QPATH);
7631 // now that we have the OBJ data loaded as-is, we can convert it
7633 // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
7634 VectorCopy(mins, loadmodel->normalmins);
7635 VectorCopy(maxs, loadmodel->normalmaxs);
7636 dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
7637 modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
7638 modelyawradius = dist*dist+modelyawradius*modelyawradius;
7639 modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
7640 modelradius = modelyawradius + modelradius * modelradius;
7641 modelyawradius = sqrt(modelyawradius);
7642 modelradius = sqrt(modelradius);
7643 loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
7644 loadmodel->yawmins[2] = loadmodel->normalmins[2];
7645 loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] = modelyawradius;
7646 loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
7647 loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
7648 loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] = modelradius;
7649 loadmodel->radius = modelradius;
7650 loadmodel->radius2 = modelradius * modelradius;
7652 // allocate storage for triangles
7653 loadmodel->surfmesh.data_element3i = (int *)Mem_Alloc(loadmodel->mempool, numtriangles * sizeof(int[3]));
7654 // allocate vertex hash structures to build an optimal vertex subset
7655 vertexhashsize = numtriangles*2;
7656 vertexhashtable = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * vertexhashsize);
7657 memset(vertexhashtable, 0xFF, sizeof(int) * vertexhashsize);
7658 vertexhashdata = (objvertex_t *)Mem_Alloc(loadmodel->mempool, sizeof(*vertexhashdata) * numtriangles*3);
7659 vertexhashcount = 0;
7661 // gather surface stats for assigning vertex/triangle ranges
7665 loadmodel->num_surfaces = 0;
7666 // allocate storage for the worst case number of surfaces, later we resize
7667 tempsurfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, numtextures * loadmodel->brush.numsubmodels * sizeof(msurface_t));
7668 submodelfirstsurface = (int *)Mem_Alloc(loadmodel->mempool, (loadmodel->brush.numsubmodels+1) * sizeof(int));
7669 surface = tempsurfaces;
7670 for (submodelindex = 0;submodelindex < loadmodel->brush.numsubmodels;submodelindex++)
7672 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7673 for (textureindex = 0;textureindex < numtextures;textureindex++)
7675 for (vertexindex = 0;vertexindex < numtriangles*3;vertexindex++)
7677 thisvertex = vertices + vertexindex;
7678 if (thisvertex->submodelindex == submodelindex && thisvertex->textureindex == textureindex)
7681 // skip the surface creation if there are no triangles for it
7682 if (vertexindex == numtriangles*3)
7684 // create a surface for these vertices
7685 surfacevertices = 0;
7686 surfaceelements = 0;
7687 // we hack in a texture index in the surface to be fixed up later...
7688 surface->texture = (texture_t *)((size_t)textureindex);
7689 // calculate bounds as we go
7690 VectorCopy(thisvertex->v, surface->mins);
7691 VectorCopy(thisvertex->v, surface->maxs);
7692 for (;vertexindex < numtriangles*3;vertexindex++)
7694 thisvertex = vertices + vertexindex;
7695 if (thisvertex->submodelindex != submodelindex)
7697 if (thisvertex->textureindex != textureindex)
7699 // add vertex to surface bounds
7700 surface->mins[0] = min(surface->mins[0], thisvertex->v[0]);
7701 surface->mins[1] = min(surface->mins[1], thisvertex->v[1]);
7702 surface->mins[2] = min(surface->mins[2], thisvertex->v[2]);
7703 surface->maxs[0] = max(surface->maxs[0], thisvertex->v[0]);
7704 surface->maxs[1] = max(surface->maxs[1], thisvertex->v[1]);
7705 surface->maxs[2] = max(surface->maxs[2], thisvertex->v[2]);
7706 // add the vertex if it is not found in the merged set, and
7707 // get its index (triangle element) for the surface
7708 vertexhashindex = (unsigned int)(thisvertex->v[0] * 3571 + thisvertex->v[0] * 1777 + thisvertex->v[0] * 457) % (unsigned int)vertexhashsize;
7709 for (i = vertexhashtable[vertexhashindex];i >= 0;i = vertexhashdata[i].nextindex)
7711 vdata = vertexhashdata + i;
7712 if (vdata->submodelindex == thisvertex->submodelindex && vdata->textureindex == thisvertex->textureindex && VectorCompare(thisvertex->v, vdata->v) && VectorCompare(thisvertex->vn, vdata->vn) && Vector2Compare(thisvertex->vt, vdata->vt))
7717 i = vertexhashcount++;
7718 vdata = vertexhashdata + i;
7719 *vdata = *thisvertex;
7720 vdata->nextindex = vertexhashtable[vertexhashindex];
7721 vertexhashtable[vertexhashindex] = i;
7724 loadmodel->surfmesh.data_element3i[elementindex++] = i;
7727 surfacetriangles = surfaceelements / 3;
7728 surface->num_vertices = surfacevertices;
7729 surface->num_triangles = surfacetriangles;
7730 surface->num_firstvertex = firstvertex;
7731 surface->num_firsttriangle = firsttriangle;
7732 firstvertex += surface->num_vertices;
7733 firsttriangle += surface->num_triangles;
7735 loadmodel->num_surfaces++;
7738 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
7739 numvertices = firstvertex;
7740 loadmodel->data_surfaces = (msurface_t *)Mem_Realloc(loadmodel->mempool, tempsurfaces, loadmodel->num_surfaces * sizeof(msurface_t));
7741 tempsurfaces = NULL;
7743 // allocate storage for final mesh data
7744 loadmodel->num_textures = numtextures * loadmodel->numskins;
7745 loadmodel->num_texturesperskin = numtextures;
7746 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 *));
7747 loadmodel->brush.submodels = (dp_model_t **)data;data += loadmodel->brush.numsubmodels * sizeof(dp_model_t *);
7748 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
7749 loadmodel->data_textures = (texture_t *)data;data += loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t);
7750 loadmodel->surfmesh.num_vertices = numvertices;
7751 loadmodel->surfmesh.num_triangles = numtriangles;
7752 if (r_enableshadowvolumes.integer)
7753 loadmodel->surfmesh.data_neighbor3i = (int *)data;data += numtriangles * sizeof(int[3]);
7754 loadmodel->surfmesh.data_vertex3f = (float *)data;data += numvertices * sizeof(float[3]);
7755 loadmodel->surfmesh.data_svector3f = (float *)data;data += numvertices * sizeof(float[3]);
7756 loadmodel->surfmesh.data_tvector3f = (float *)data;data += numvertices * sizeof(float[3]);
7757 loadmodel->surfmesh.data_normal3f = (float *)data;data += numvertices * sizeof(float[3]);
7758 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += numvertices * sizeof(float[2]);
7759 if (loadmodel->surfmesh.num_vertices <= 65536)
7760 loadmodel->surfmesh.data_element3s = (unsigned short *)data;data += loadmodel->surfmesh.num_triangles * sizeof(unsigned short[3]);
7762 for (j = 0;j < loadmodel->surfmesh.num_vertices;j++)
7764 VectorCopy(vertexhashdata[j].v, loadmodel->surfmesh.data_vertex3f + 3*j);
7765 VectorCopy(vertexhashdata[j].vn, loadmodel->surfmesh.data_normal3f + 3*j);
7766 Vector2Copy(vertexhashdata[j].vt, loadmodel->surfmesh.data_texcoordtexture2f + 2*j);
7769 // load the textures
7770 for (textureindex = 0;textureindex < numtextures;textureindex++)
7771 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures + textureindex, skinfiles, texturenames + textureindex*MAX_QPATH, texturenames + textureindex*MAX_QPATH);
7772 Mod_FreeSkinFiles(skinfiles);
7774 // set the surface textures to their real values now that we loaded them...
7775 for (i = 0;i < loadmodel->num_surfaces;i++)
7776 loadmodel->data_surfaces[i].texture = loadmodel->data_textures + (size_t)loadmodel->data_surfaces[i].texture;
7780 Mem_Free(texturenames);
7784 Mem_Free(vertexhashtable);
7785 Mem_Free(vertexhashdata);
7787 // make a single combined shadow mesh to allow optimized shadow volume creation
7788 Mod_Q1BSP_CreateShadowMesh(loadmodel);
7790 // compute all the mesh information that was not loaded from the file
7791 if (loadmodel->surfmesh.data_element3s)
7792 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
7793 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
7794 Mod_ValidateElements(loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles, 0, loadmodel->surfmesh.num_vertices, __FILE__, __LINE__);
7795 // generate normals if the file did not have them
7796 if (!VectorLength2(loadmodel->surfmesh.data_normal3f))
7797 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);
7798 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);
7799 if (loadmodel->surfmesh.data_neighbor3i)
7800 Mod_BuildTriangleNeighbors(loadmodel->surfmesh.data_neighbor3i, loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.num_triangles);
7802 // if this is a worldmodel and has no BSP tree, create a fake one for the purpose
7803 loadmodel->brush.num_visleafs = 1;
7804 loadmodel->brush.num_leafs = 1;
7805 loadmodel->brush.num_nodes = 0;
7806 loadmodel->brush.num_leafsurfaces = loadmodel->num_surfaces;
7807 loadmodel->brush.data_leafs = (mleaf_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
7808 loadmodel->brush.data_nodes = (mnode_t *)loadmodel->brush.data_leafs;
7809 loadmodel->brush.num_pvsclusters = 1;
7810 loadmodel->brush.num_pvsclusterbytes = 1;
7811 loadmodel->brush.data_pvsclusters = nobsp_pvs;
7812 //if (loadmodel->num_nodes) loadmodel->data_nodes = (mnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_nodes * sizeof(mnode_t));
7813 //loadmodel->data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->num_leafsurfaces * sizeof(int));
7814 loadmodel->brush.data_leafsurfaces = loadmodel->sortedmodelsurfaces;
7815 VectorCopy(loadmodel->normalmins, loadmodel->brush.data_leafs->mins);
7816 VectorCopy(loadmodel->normalmaxs, loadmodel->brush.data_leafs->maxs);
7817 loadmodel->brush.data_leafs->combinedsupercontents = 0; // FIXME?
7818 loadmodel->brush.data_leafs->clusterindex = 0;
7819 loadmodel->brush.data_leafs->areaindex = 0;
7820 loadmodel->brush.data_leafs->numleafsurfaces = loadmodel->brush.num_leafsurfaces;
7821 loadmodel->brush.data_leafs->firstleafsurface = loadmodel->brush.data_leafsurfaces;
7822 loadmodel->brush.data_leafs->numleafbrushes = 0;
7823 loadmodel->brush.data_leafs->firstleafbrush = NULL;
7824 loadmodel->brush.supportwateralpha = true;
7826 if (loadmodel->brush.numsubmodels)
7827 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7830 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7835 // duplicate the basic information
7836 dpsnprintf(name, sizeof(name), "*%i", i);
7837 mod = Mod_FindName(name, loadmodel->name);
7838 // copy the base model to this one
7840 // rename the clone back to its proper name
7841 strlcpy(mod->name, name, sizeof(mod->name));
7842 mod->brush.parentmodel = loadmodel;
7843 // textures and memory belong to the main model
7844 mod->texturepool = NULL;
7845 mod->mempool = NULL;
7846 mod->brush.GetPVS = NULL;
7847 mod->brush.FatPVS = NULL;
7848 mod->brush.BoxTouchingPVS = NULL;
7849 mod->brush.BoxTouchingLeafPVS = NULL;
7850 mod->brush.BoxTouchingVisibleLeafs = NULL;
7851 mod->brush.FindBoxClusters = NULL;
7852 mod->brush.LightPoint = NULL;
7853 mod->brush.AmbientSoundLevelsForPoint = NULL;
7855 mod->brush.submodel = i;
7856 if (loadmodel->brush.submodels)
7857 loadmodel->brush.submodels[i] = mod;
7859 // make the model surface list (used by shadowing/lighting)
7860 mod->firstmodelsurface = submodelfirstsurface[i];
7861 mod->nummodelsurfaces = submodelfirstsurface[i+1] - submodelfirstsurface[i];
7862 mod->firstmodelbrush = 0;
7863 mod->nummodelbrushes = 0;
7864 mod->sortedmodelsurfaces = loadmodel->sortedmodelsurfaces + mod->firstmodelsurface;
7865 Mod_MakeSortedSurfaces(mod);
7867 VectorClear(mod->normalmins);
7868 VectorClear(mod->normalmaxs);
7870 for (j = 0;j < mod->nummodelsurfaces;j++)
7872 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
7873 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
7875 if (!surface->num_vertices)
7880 VectorCopy(v, mod->normalmins);
7881 VectorCopy(v, mod->normalmaxs);
7883 for (k = 0;k < surface->num_vertices;k++, v += 3)
7885 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
7886 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
7887 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
7888 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
7889 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
7890 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
7893 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
7894 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
7895 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
7896 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
7897 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
7898 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
7899 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
7900 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
7901 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
7902 mod->yawmins[2] = mod->normalmins[2];
7903 mod->yawmaxs[2] = mod->normalmaxs[2];
7904 mod->radius = modelradius;
7905 mod->radius2 = modelradius * modelradius;
7907 // this gets altered below if sky or water is used
7908 mod->DrawSky = NULL;
7909 mod->DrawAddWaterPlanes = NULL;
7911 for (j = 0;j < mod->nummodelsurfaces;j++)
7912 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
7914 if (j < mod->nummodelsurfaces)
7915 mod->DrawSky = R_Q1BSP_DrawSky;
7917 for (j = 0;j < mod->nummodelsurfaces;j++)
7918 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
7920 if (j < mod->nummodelsurfaces)
7921 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
7923 Mod_MakeCollisionBIH(mod, true, &mod->collision_bih);
7924 mod->render_bih = mod->collision_bih;
7926 // generate VBOs and other shared data before cloning submodels
7931 Mem_Free(submodelfirstsurface);
7933 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);
7936 qboolean Mod_CanSeeBox_Trace(int numsamples, float t, dp_model_t *model, vec3_t eye, vec3_t minsX, vec3_t maxsX)
7938 // we already have done PVS culling at this point...
7939 // so we don't need to do it again.
7942 vec3_t testorigin, mins, maxs;
7944 testorigin[0] = (minsX[0] + maxsX[0]) * 0.5;
7945 testorigin[1] = (minsX[1] + maxsX[1]) * 0.5;
7946 testorigin[2] = (minsX[2] + maxsX[2]) * 0.5;
7948 if(model->brush.TraceLineOfSight(model, eye, testorigin))
7951 // expand the box a little
7952 mins[0] = (t+1) * minsX[0] - t * maxsX[0];
7953 maxs[0] = (t+1) * maxsX[0] - t * minsX[0];
7954 mins[1] = (t+1) * minsX[1] - t * maxsX[1];
7955 maxs[1] = (t+1) * maxsX[1] - t * minsX[1];
7956 mins[2] = (t+1) * minsX[2] - t * maxsX[2];
7957 maxs[2] = (t+1) * maxsX[2] - t * minsX[2];
7959 for(i = 0; i != numsamples; ++i)
7961 testorigin[0] = lhrandom(mins[0], maxs[0]);
7962 testorigin[1] = lhrandom(mins[1], maxs[1]);
7963 testorigin[2] = lhrandom(mins[2], maxs[2]);
7965 if(model->brush.TraceLineOfSight(model, eye, testorigin))