2 Copyright (C) 1996-1997 Id Software, Inc.
4 This program is free software; you can redistribute it and/or
5 modify it under the terms of the GNU General Public License
6 as published by the Free Software Foundation; either version 2
7 of the License, or (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
13 See the GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 //cvar_t r_subdivide_size = {CVAR_SAVE, "r_subdivide_size", "128", "how large water polygons should be (smaller values produce more polygons which give better warping effects)"};
30 cvar_t mod_bsp_portalize = {0, "mod_bsp_portalize", "1", "enables portal generation from BSP tree (may take several seconds per map), used by r_drawportals, r_useportalculling, r_shadow_realtime_world_compileportalculling, sv_cullentities_portal"};
31 cvar_t r_novis = {0, "r_novis", "0", "draws whole level, see also sv_cullentities_pvs 0"};
32 cvar_t r_nosurftextures = {0, "r_nosurftextures", "0", "pretends there was no texture lump found in the q1bsp/hlbsp loading (useful for debugging this rare case)"};
33 cvar_t r_subdivisions_tolerance = {0, "r_subdivisions_tolerance", "4", "maximum error tolerance on curve subdivision for rendering purposes (in other words, the curves will be given as many polygons as necessary to represent curves at this quality)"};
34 cvar_t r_subdivisions_mintess = {0, "r_subdivisions_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
35 cvar_t r_subdivisions_maxtess = {0, "r_subdivisions_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
36 cvar_t r_subdivisions_maxvertices = {0, "r_subdivisions_maxvertices", "65536", "maximum vertices allowed per subdivided curve"};
37 cvar_t r_subdivisions_collision_tolerance = {0, "r_subdivisions_collision_tolerance", "15", "maximum error tolerance on curve subdivision for collision purposes (usually a larger error tolerance than for rendering)"};
38 cvar_t r_subdivisions_collision_mintess = {0, "r_subdivisions_collision_mintess", "0", "minimum number of subdivisions (values above 0 will smooth curves that don't need it)"};
39 cvar_t r_subdivisions_collision_maxtess = {0, "r_subdivisions_collision_maxtess", "1024", "maximum number of subdivisions (prevents curves beyond a certain detail level, limits smoothing)"};
40 cvar_t r_subdivisions_collision_maxvertices = {0, "r_subdivisions_collision_maxvertices", "4225", "maximum vertices allowed per subdivided curve"};
41 cvar_t r_trippy = {0, "r_trippy", "0", "easter egg"};
42 cvar_t r_fxaa = {CVAR_SAVE, "r_fxaa", "0", "fast approximate anti aliasing"};
43 cvar_t mod_noshader_default_offsetmapping = {CVAR_SAVE, "mod_noshader_default_offsetmapping", "1", "use offsetmapping by default on all surfaces that are not using q3 shader files"};
44 cvar_t mod_obj_orientation = {0, "mod_obj_orientation", "1", "fix orientation of OBJ models to the usual conventions (if zero, use coordinates as is)"};
45 cvar_t mod_q2bsp_littransparentsurfaces = {0, "mod_q2bsp_littransparentsurfaces", "0", "allows lighting on rain in 3v3gloom3 and other cases of transparent surfaces that have lightmaps that were ignored by quake2"};
46 cvar_t mod_q3bsp_curves_collisions = {0, "mod_q3bsp_curves_collisions", "1", "enables collisions with curves (SLOW)"};
47 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)"};
48 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)"};
49 cvar_t mod_q3bsp_optimizedtraceline = {0, "mod_q3bsp_optimizedtraceline", "1", "whether to use optimized traceline code for line traces (as opposed to tracebox code)"};
50 cvar_t mod_q3bsp_debugtracebrush = {0, "mod_q3bsp_debugtracebrush", "0", "selects different tracebrush bsp recursion algorithms (for debugging purposes only)"};
51 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, ..."};
52 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)"};
53 cvar_t mod_q3bsp_tracelineofsight_brushes = {0, "mod_q3bsp_tracelineofsight_brushes", "0", "enables culling of entities behind detail brushes, curves, etc"};
54 cvar_t mod_q3bsp_sRGBlightmaps = {0, "mod_q3bsp_sRGBlightmaps", "0", "treat lightmaps from Q3 maps as sRGB when vid_sRGB is active"};
55 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"};
56 cvar_t mod_q3shader_default_offsetmapping_scale = {CVAR_SAVE, "mod_q3shader_default_offsetmapping_scale", "1", "default scale used for offsetmapping"};
57 cvar_t mod_q3shader_default_offsetmapping_bias = {CVAR_SAVE, "mod_q3shader_default_offsetmapping_bias", "0", "default bias used for offsetmapping"};
58 cvar_t mod_q3shader_default_polygonfactor = {0, "mod_q3shader_default_polygonfactor", "0", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
59 cvar_t mod_q3shader_default_polygonoffset = {0, "mod_q3shader_default_polygonoffset", "-2", "biases depth values of 'polygonoffset' shaders to prevent z-fighting artifacts"};
60 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"};
61 cvar_t mod_q3shader_force_terrain_alphaflag = {0, "mod_q3shader_force_terrain_alphaflag", "0", "for multilayered terrain shaders force TEXF_ALPHA flag on both layers"};
63 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)"};
64 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"};
65 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"};
67 static texture_t mod_q1bsp_texture_solid;
68 static texture_t mod_q1bsp_texture_sky;
69 static texture_t mod_q1bsp_texture_lava;
70 static texture_t mod_q1bsp_texture_slime;
71 static texture_t mod_q1bsp_texture_water;
73 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end, const vec3_t acceptmins, const vec3_t acceptmaxs);
75 void Mod_BrushInit(void)
77 // Cvar_RegisterVariable(&r_subdivide_size);
78 Cvar_RegisterVariable(&mod_bsp_portalize);
79 Cvar_RegisterVariable(&r_novis);
80 Cvar_RegisterVariable(&r_nosurftextures);
81 Cvar_RegisterVariable(&r_subdivisions_tolerance);
82 Cvar_RegisterVariable(&r_subdivisions_mintess);
83 Cvar_RegisterVariable(&r_subdivisions_maxtess);
84 Cvar_RegisterVariable(&r_subdivisions_maxvertices);
85 Cvar_RegisterVariable(&r_subdivisions_collision_tolerance);
86 Cvar_RegisterVariable(&r_subdivisions_collision_mintess);
87 Cvar_RegisterVariable(&r_subdivisions_collision_maxtess);
88 Cvar_RegisterVariable(&r_subdivisions_collision_maxvertices);
89 Cvar_RegisterVariable(&r_trippy);
90 Cvar_RegisterVariable(&r_fxaa);
91 Cvar_RegisterVariable(&mod_noshader_default_offsetmapping);
92 Cvar_RegisterVariable(&mod_obj_orientation);
93 Cvar_RegisterVariable(&mod_q2bsp_littransparentsurfaces);
94 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions);
95 Cvar_RegisterVariable(&mod_q3bsp_curves_collisions_stride);
96 Cvar_RegisterVariable(&mod_q3bsp_curves_stride);
97 Cvar_RegisterVariable(&mod_q3bsp_optimizedtraceline);
98 Cvar_RegisterVariable(&mod_q3bsp_debugtracebrush);
99 Cvar_RegisterVariable(&mod_q3bsp_lightmapmergepower);
100 Cvar_RegisterVariable(&mod_q3bsp_nolightmaps);
101 Cvar_RegisterVariable(&mod_q3bsp_sRGBlightmaps);
102 Cvar_RegisterVariable(&mod_q3bsp_tracelineofsight_brushes);
103 Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping);
104 Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping_scale);
105 Cvar_RegisterVariable(&mod_q3shader_default_offsetmapping_bias);
106 Cvar_RegisterVariable(&mod_q3shader_default_polygonfactor);
107 Cvar_RegisterVariable(&mod_q3shader_default_polygonoffset);
108 Cvar_RegisterVariable(&mod_q3shader_force_addalpha);
109 Cvar_RegisterVariable(&mod_q3shader_force_terrain_alphaflag);
110 Cvar_RegisterVariable(&mod_q1bsp_polygoncollisions);
111 Cvar_RegisterVariable(&mod_collision_bih);
112 Cvar_RegisterVariable(&mod_recalculatenodeboxes);
114 // these games were made for older DP engines and are no longer
115 // maintained; use this hack to show their textures properly
116 if(gamemode == GAME_NEXUIZ)
117 Cvar_SetQuick(&mod_q3shader_force_addalpha, "1");
119 memset(&mod_q1bsp_texture_solid, 0, sizeof(mod_q1bsp_texture_solid));
120 strlcpy(mod_q1bsp_texture_solid.name, "solid" , sizeof(mod_q1bsp_texture_solid.name));
121 mod_q1bsp_texture_solid.surfaceflags = 0;
122 mod_q1bsp_texture_solid.supercontents = SUPERCONTENTS_SOLID;
124 mod_q1bsp_texture_sky = mod_q1bsp_texture_solid;
125 strlcpy(mod_q1bsp_texture_sky.name, "sky", sizeof(mod_q1bsp_texture_sky.name));
126 mod_q1bsp_texture_sky.surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
127 mod_q1bsp_texture_sky.supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP;
129 mod_q1bsp_texture_lava = mod_q1bsp_texture_solid;
130 strlcpy(mod_q1bsp_texture_lava.name, "*lava", sizeof(mod_q1bsp_texture_lava.name));
131 mod_q1bsp_texture_lava.surfaceflags = Q3SURFACEFLAG_NOMARKS;
132 mod_q1bsp_texture_lava.supercontents = SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
134 mod_q1bsp_texture_slime = mod_q1bsp_texture_solid;
135 strlcpy(mod_q1bsp_texture_slime.name, "*slime", sizeof(mod_q1bsp_texture_slime.name));
136 mod_q1bsp_texture_slime.surfaceflags = Q3SURFACEFLAG_NOMARKS;
137 mod_q1bsp_texture_slime.supercontents = SUPERCONTENTS_SLIME;
139 mod_q1bsp_texture_water = mod_q1bsp_texture_solid;
140 strlcpy(mod_q1bsp_texture_water.name, "*water", sizeof(mod_q1bsp_texture_water.name));
141 mod_q1bsp_texture_water.surfaceflags = Q3SURFACEFLAG_NOMARKS;
142 mod_q1bsp_texture_water.supercontents = SUPERCONTENTS_WATER;
145 static mleaf_t *Mod_Q1BSP_PointInLeaf(dp_model_t *model, const vec3_t p)
152 // LordHavoc: modified to start at first clip node,
153 // in other words: first node of the (sub)model
154 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
156 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
158 return (mleaf_t *)node;
161 static void Mod_Q1BSP_AmbientSoundLevelsForPoint(dp_model_t *model, const vec3_t p, unsigned char *out, int outsize)
165 leaf = Mod_Q1BSP_PointInLeaf(model, p);
168 i = min(outsize, (int)sizeof(leaf->ambient_sound_level));
171 memcpy(out, leaf->ambient_sound_level, i);
177 memset(out, 0, outsize);
180 static int Mod_Q1BSP_FindBoxClusters(dp_model_t *model, const vec3_t mins, const vec3_t maxs, int maxclusters, int *clusterlist)
183 int nodestackindex = 0;
184 mnode_t *node, *nodestack[1024];
185 if (!model->brush.num_pvsclusters)
187 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
193 // node - recurse down the BSP tree
194 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
198 return -1; // ERROR: NAN bounding box!
199 // box is on one side of plane, take that path
200 node = node->children[sides-1];
204 // box crosses plane, take one path and remember the other
205 if (nodestackindex < 1024)
206 nodestack[nodestackindex++] = node->children[0];
207 node = node->children[1];
213 // leaf - add clusterindex to list
214 if (numclusters < maxclusters)
215 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
219 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
223 if (nodestackindex < 1024)
224 nodestack[nodestackindex++] = node->children[0];
225 node = node->children[1];
230 // leaf - add clusterindex to list
231 if (numclusters < maxclusters)
232 clusterlist[numclusters] = ((mleaf_t *)node)->clusterindex;
237 // try another path we didn't take earlier
238 if (nodestackindex == 0)
240 node = nodestack[--nodestackindex];
242 // return number of clusters found (even if more than the maxclusters)
246 static int Mod_Q1BSP_BoxTouchingPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
248 int nodestackindex = 0;
249 mnode_t *node, *nodestack[1024];
250 if (!model->brush.num_pvsclusters)
252 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
258 // node - recurse down the BSP tree
259 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
263 return -1; // ERROR: NAN bounding box!
264 // box is on one side of plane, take that path
265 node = node->children[sides-1];
269 // box crosses plane, take one path and remember the other
270 if (nodestackindex < 1024)
271 nodestack[nodestackindex++] = node->children[0];
272 node = node->children[1];
278 // leaf - check cluster bit
279 int clusterindex = ((mleaf_t *)node)->clusterindex;
280 if (CHECKPVSBIT(pvs, clusterindex))
282 // it is visible, return immediately with the news
287 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
291 if (nodestackindex < 1024)
292 nodestack[nodestackindex++] = node->children[0];
293 node = node->children[1];
298 // leaf - check cluster bit
299 int clusterindex = ((mleaf_t *)node)->clusterindex;
300 if (CHECKPVSBIT(pvs, clusterindex))
302 // it is visible, return immediately with the news
308 // nothing to see here, try another path we didn't take earlier
309 if (nodestackindex == 0)
311 node = nodestack[--nodestackindex];
317 static int Mod_Q1BSP_BoxTouchingLeafPVS(dp_model_t *model, const unsigned char *pvs, const vec3_t mins, const vec3_t maxs)
319 int nodestackindex = 0;
320 mnode_t *node, *nodestack[1024];
321 if (!model->brush.num_leafs)
323 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
329 // node - recurse down the BSP tree
330 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
334 return -1; // ERROR: NAN bounding box!
335 // box is on one side of plane, take that path
336 node = node->children[sides-1];
340 // box crosses plane, take one path and remember the other
341 if (nodestackindex < 1024)
342 nodestack[nodestackindex++] = node->children[0];
343 node = node->children[1];
349 // leaf - check cluster bit
350 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
351 if (CHECKPVSBIT(pvs, clusterindex))
353 // it is visible, return immediately with the news
358 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
362 if (nodestackindex < 1024)
363 nodestack[nodestackindex++] = node->children[0];
364 node = node->children[1];
369 // leaf - check cluster bit
370 int clusterindex = ((mleaf_t *)node) - model->brush.data_leafs;
371 if (CHECKPVSBIT(pvs, clusterindex))
373 // it is visible, return immediately with the news
379 // nothing to see here, try another path we didn't take earlier
380 if (nodestackindex == 0)
382 node = nodestack[--nodestackindex];
388 static int Mod_Q1BSP_BoxTouchingVisibleLeafs(dp_model_t *model, const unsigned char *visibleleafs, const vec3_t mins, const vec3_t maxs)
390 int nodestackindex = 0;
391 mnode_t *node, *nodestack[1024];
392 if (!model->brush.num_leafs)
394 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
400 // node - recurse down the BSP tree
401 int sides = BoxOnPlaneSide(mins, maxs, node->plane);
405 return -1; // ERROR: NAN bounding box!
406 // box is on one side of plane, take that path
407 node = node->children[sides-1];
411 // box crosses plane, take one path and remember the other
412 if (nodestackindex < 1024)
413 nodestack[nodestackindex++] = node->children[0];
414 node = node->children[1];
420 // leaf - check if it is visible
421 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
423 // it is visible, return immediately with the news
428 if (BoxesOverlap(mins, maxs, node->mins, node->maxs))
432 if (nodestackindex < 1024)
433 nodestack[nodestackindex++] = node->children[0];
434 node = node->children[1];
439 // leaf - check if it is visible
440 if (visibleleafs[(mleaf_t *)node - model->brush.data_leafs])
442 // it is visible, return immediately with the news
448 // nothing to see here, try another path we didn't take earlier
449 if (nodestackindex == 0)
451 node = nodestack[--nodestackindex];
457 typedef struct findnonsolidlocationinfo_s
460 vec3_t absmin, absmax;
466 findnonsolidlocationinfo_t;
468 static void Mod_Q1BSP_FindNonSolidLocation_r_Triangle(findnonsolidlocationinfo_t *info, msurface_t *surface, int k)
471 float dist, f, vert[3][3], edge[3][3], facenormal[3], edgenormal[3][3], point[3];
473 tri = (info->model->surfmesh.data_element3i + 3 * surface->num_firsttriangle) + k * 3;
474 VectorCopy((info->model->surfmesh.data_vertex3f + tri[0] * 3), vert[0]);
475 VectorCopy((info->model->surfmesh.data_vertex3f + tri[1] * 3), vert[1]);
476 VectorCopy((info->model->surfmesh.data_vertex3f + tri[2] * 3), vert[2]);
477 VectorSubtract(vert[1], vert[0], edge[0]);
478 VectorSubtract(vert[2], vert[1], edge[1]);
479 CrossProduct(edge[1], edge[0], facenormal);
480 if (facenormal[0] || facenormal[1] || facenormal[2])
482 VectorNormalize(facenormal);
483 f = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
484 if (f <= info->bestdist && f >= -info->bestdist)
486 VectorSubtract(vert[0], vert[2], edge[2]);
487 VectorNormalize(edge[0]);
488 VectorNormalize(edge[1]);
489 VectorNormalize(edge[2]);
490 CrossProduct(facenormal, edge[0], edgenormal[0]);
491 CrossProduct(facenormal, edge[1], edgenormal[1]);
492 CrossProduct(facenormal, edge[2], edgenormal[2]);
494 if (DotProduct(info->center, edgenormal[0]) < DotProduct(vert[0], edgenormal[0])
495 && DotProduct(info->center, edgenormal[1]) < DotProduct(vert[1], edgenormal[1])
496 && DotProduct(info->center, edgenormal[2]) < DotProduct(vert[2], edgenormal[2]))
498 // we got lucky, the center is within the face
499 dist = DotProduct(info->center, facenormal) - DotProduct(vert[0], facenormal);
503 if (info->bestdist > dist)
505 info->bestdist = dist;
506 VectorScale(facenormal, (info->radius - -dist), info->nudge);
511 if (info->bestdist > dist)
513 info->bestdist = dist;
514 VectorScale(facenormal, (info->radius - dist), info->nudge);
520 // check which edge or vertex the center is nearest
521 for (i = 0;i < 3;i++)
523 f = DotProduct(info->center, edge[i]);
524 if (f >= DotProduct(vert[0], edge[i])
525 && f <= DotProduct(vert[1], edge[i]))
528 VectorMA(info->center, -f, edge[i], point);
529 dist = sqrt(DotProduct(point, point));
530 if (info->bestdist > dist)
532 info->bestdist = dist;
533 VectorScale(point, (info->radius / dist), info->nudge);
535 // skip both vertex checks
536 // (both are further away than this edge)
541 // not on edge, check first vertex of edge
542 VectorSubtract(info->center, vert[i], point);
543 dist = sqrt(DotProduct(point, point));
544 if (info->bestdist > dist)
546 info->bestdist = dist;
547 VectorScale(point, (info->radius / dist), info->nudge);
556 static void Mod_Q1BSP_FindNonSolidLocation_r_Leaf(findnonsolidlocationinfo_t *info, mleaf_t *leaf)
558 int surfacenum, k, *mark;
560 for (surfacenum = 0, mark = leaf->firstleafsurface;surfacenum < leaf->numleafsurfaces;surfacenum++, mark++)
562 surface = info->model->data_surfaces + *mark;
563 if (surface->texture->supercontents & SUPERCONTENTS_SOLID)
565 if(surface->deprecatedq3num_bboxstride > 0)
568 cnt = (surface->num_triangles + surface->deprecatedq3num_bboxstride - 1) / surface->deprecatedq3num_bboxstride;
569 for(i = 0; i < cnt; ++i)
571 if(BoxesOverlap(surface->deprecatedq3data_bbox6f + i * 6, surface->deprecatedq3data_bbox6f + i * 6 + 3, info->absmin, info->absmax))
573 for(k = 0; k < surface->deprecatedq3num_bboxstride; ++k)
575 tri = i * surface->deprecatedq3num_bboxstride + k;
576 if(tri >= surface->num_triangles)
578 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, tri);
585 for (k = 0;k < surface->num_triangles;k++)
587 Mod_Q1BSP_FindNonSolidLocation_r_Triangle(info, surface, k);
594 static void Mod_Q1BSP_FindNonSolidLocation_r(findnonsolidlocationinfo_t *info, mnode_t *node)
598 float f = PlaneDiff(info->center, node->plane);
599 if (f >= -info->bestdist)
600 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[0]);
601 if (f <= info->bestdist)
602 Mod_Q1BSP_FindNonSolidLocation_r(info, node->children[1]);
606 if (((mleaf_t *)node)->numleafsurfaces)
607 Mod_Q1BSP_FindNonSolidLocation_r_Leaf(info, (mleaf_t *)node);
611 static void Mod_Q1BSP_FindNonSolidLocation(dp_model_t *model, const vec3_t in, vec3_t out, float radius)
614 findnonsolidlocationinfo_t info;
620 VectorCopy(in, info.center);
621 info.radius = radius;
626 VectorClear(info.nudge);
627 info.bestdist = radius;
628 VectorCopy(info.center, info.absmin);
629 VectorCopy(info.center, info.absmax);
630 info.absmin[0] -= info.radius + 1;
631 info.absmin[1] -= info.radius + 1;
632 info.absmin[2] -= info.radius + 1;
633 info.absmax[0] += info.radius + 1;
634 info.absmax[1] += info.radius + 1;
635 info.absmax[2] += info.radius + 1;
636 Mod_Q1BSP_FindNonSolidLocation_r(&info, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
637 VectorAdd(info.center, info.nudge, info.center);
639 while (info.bestdist < radius && ++i < 10);
640 VectorCopy(info.center, out);
643 int Mod_Q1BSP_SuperContentsFromNativeContents(int nativecontents)
645 switch(nativecontents)
650 return SUPERCONTENTS_SOLID | SUPERCONTENTS_OPAQUE;
652 return SUPERCONTENTS_WATER;
654 return SUPERCONTENTS_SLIME;
656 return SUPERCONTENTS_LAVA | SUPERCONTENTS_NODROP;
658 return SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE; // to match behaviour of Q3 maps, let sky count as opaque
663 int Mod_Q1BSP_NativeContentsFromSuperContents(int supercontents)
665 if (supercontents & (SUPERCONTENTS_SOLID | SUPERCONTENTS_BODY))
666 return CONTENTS_SOLID;
667 if (supercontents & SUPERCONTENTS_SKY)
669 if (supercontents & SUPERCONTENTS_LAVA)
670 return CONTENTS_LAVA;
671 if (supercontents & SUPERCONTENTS_SLIME)
672 return CONTENTS_SLIME;
673 if (supercontents & SUPERCONTENTS_WATER)
674 return CONTENTS_WATER;
675 return CONTENTS_EMPTY;
678 typedef struct RecursiveHullCheckTraceInfo_s
680 // the hull we're tracing through
683 // the trace structure to fill in
686 // start, end, and end - start (in model space)
691 RecursiveHullCheckTraceInfo_t;
693 // 1/32 epsilon to keep floating point happy
694 #define DIST_EPSILON (0.03125)
696 #define HULLCHECKSTATE_EMPTY 0
697 #define HULLCHECKSTATE_SOLID 1
698 #define HULLCHECKSTATE_DONE 2
700 static int Mod_Q1BSP_RecursiveHullCheck(RecursiveHullCheckTraceInfo_t *t, int num, double p1f, double p2f, double p1[3], double p2[3])
702 // status variables, these don't need to be saved on the stack when
703 // recursing... but are because this should be thread-safe
704 // (note: tracing against a bbox is not thread-safe, yet)
709 // variables that need to be stored on the stack when recursing
714 // keep looping until we hit a leaf
717 // find the point distances
718 node = t->hull->clipnodes + num;
719 plane = t->hull->planes + node->planenum;
721 // axial planes can be calculated more quickly without the DotProduct
724 t1 = p1[plane->type] - plane->dist;
725 t2 = p2[plane->type] - plane->dist;
729 t1 = DotProduct (plane->normal, p1) - plane->dist;
730 t2 = DotProduct (plane->normal, p2) - plane->dist;
733 // negative plane distances indicate children[1] (behind plane)
737 // if the line starts and ends on the same side of the plane, recurse
738 // into that child instantly
739 if (p1side == p2side)
741 #if COLLISIONPARANOID >= 3
747 // loop back and process the start child
748 num = node->children[p1side];
752 // find the midpoint where the line crosses the plane, use the
753 // original line for best accuracy
754 #if COLLISIONPARANOID >= 3
759 t1 = t->start[plane->type] - plane->dist;
760 t2 = t->end[plane->type] - plane->dist;
764 t1 = DotProduct (plane->normal, t->start) - plane->dist;
765 t2 = DotProduct (plane->normal, t->end) - plane->dist;
767 midf = t1 / (t1 - t2);
768 midf = bound(p1f, midf, p2f);
769 VectorMA(t->start, midf, t->dist, mid);
771 // we now have a mid point, essentially splitting the line into
772 // the segments in the near child and the far child, we can now
773 // recurse those in order and get their results
775 // recurse both sides, front side first
776 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[p1side], p1f, midf, p1, mid);
777 // if this side is not empty, return what it is (solid or done)
778 if (ret != HULLCHECKSTATE_EMPTY)
781 ret = Mod_Q1BSP_RecursiveHullCheck(t, node->children[p2side], midf, p2f, mid, p2);
782 // if other side is not solid, return what it is (empty or done)
783 if (ret != HULLCHECKSTATE_SOLID)
786 // front is air and back is solid, this is the impact point...
788 // copy the plane information, flipping it if needed
791 t->trace->plane.dist = -plane->dist;
792 VectorNegate (plane->normal, t->trace->plane.normal);
796 t->trace->plane.dist = plane->dist;
797 VectorCopy (plane->normal, t->trace->plane.normal);
800 // calculate the return fraction which is nudged off the surface a bit
801 t1 = DotProduct(t->trace->plane.normal, t->start) - t->trace->plane.dist;
802 t2 = DotProduct(t->trace->plane.normal, t->end) - t->trace->plane.dist;
803 midf = (t1 - collision_impactnudge.value) / (t1 - t2);
804 t->trace->fraction = bound(0, midf, 1);
806 #if COLLISIONPARANOID >= 3
809 return HULLCHECKSTATE_DONE;
813 // we reached a leaf contents
816 num = Mod_Q1BSP_SuperContentsFromNativeContents(num);
817 if (!t->trace->startfound)
819 t->trace->startfound = true;
820 t->trace->startsupercontents |= num;
822 if (num & SUPERCONTENTS_LIQUIDSMASK)
823 t->trace->inwater = true;
825 t->trace->inopen = true;
826 if (num & SUPERCONTENTS_SOLID)
827 t->trace->hittexture = &mod_q1bsp_texture_solid;
828 else if (num & SUPERCONTENTS_SKY)
829 t->trace->hittexture = &mod_q1bsp_texture_sky;
830 else if (num & SUPERCONTENTS_LAVA)
831 t->trace->hittexture = &mod_q1bsp_texture_lava;
832 else if (num & SUPERCONTENTS_SLIME)
833 t->trace->hittexture = &mod_q1bsp_texture_slime;
835 t->trace->hittexture = &mod_q1bsp_texture_water;
836 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
837 t->trace->hitsupercontents = num;
838 if (num & t->trace->hitsupercontentsmask)
840 // if the first leaf is solid, set startsolid
841 if (t->trace->allsolid)
842 t->trace->startsolid = true;
843 #if COLLISIONPARANOID >= 3
846 return HULLCHECKSTATE_SOLID;
850 t->trace->allsolid = false;
851 #if COLLISIONPARANOID >= 3
854 return HULLCHECKSTATE_EMPTY;
858 //#if COLLISIONPARANOID < 2
859 static int Mod_Q1BSP_RecursiveHullCheckPoint(RecursiveHullCheckTraceInfo_t *t, int num)
862 mclipnode_t *nodes = t->hull->clipnodes;
863 mplane_t *planes = t->hull->planes;
865 VectorCopy(t->start, point);
868 plane = planes + nodes[num].planenum;
869 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
871 num = Mod_Q1BSP_SuperContentsFromNativeContents(num);
872 t->trace->startsupercontents |= num;
873 if (num & SUPERCONTENTS_LIQUIDSMASK)
874 t->trace->inwater = true;
876 t->trace->inopen = true;
877 if (num & t->trace->hitsupercontentsmask)
879 t->trace->allsolid = t->trace->startsolid = true;
880 return HULLCHECKSTATE_SOLID;
884 t->trace->allsolid = t->trace->startsolid = false;
885 return HULLCHECKSTATE_EMPTY;
890 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, int skipsupercontentsmask, int skipmaterialflagsmask)
892 RecursiveHullCheckTraceInfo_t rhc;
894 memset(&rhc, 0, sizeof(rhc));
895 memset(trace, 0, sizeof(trace_t));
897 rhc.trace->fraction = 1;
898 rhc.trace->allsolid = true;
899 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
900 VectorCopy(start, rhc.start);
901 VectorCopy(start, rhc.end);
902 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
905 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, int skipsupercontentsmask, int skipmaterialflagsmask);
907 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, int skipsupercontentsmask, int skipmaterialflagsmask)
909 RecursiveHullCheckTraceInfo_t rhc;
911 if (VectorCompare(start, end))
913 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
917 // sometimes we want to traceline against polygons so we can report the texture that was hit rather than merely a contents, but using this method breaks one of negke's maps so it must be a cvar check...
918 if (sv_gameplayfix_q1bsptracelinereportstexture.integer)
920 Mod_Q1BSP_TraceLineAgainstSurfaces(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
924 memset(&rhc, 0, sizeof(rhc));
925 memset(trace, 0, sizeof(trace_t));
927 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
928 rhc.trace->skipsupercontentsmask = skipsupercontentsmask;
929 rhc.trace->skipmaterialflagsmask = skipmaterialflagsmask;
930 rhc.trace->fraction = 1;
931 rhc.trace->allsolid = true;
932 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
933 VectorCopy(start, rhc.start);
934 VectorCopy(end, rhc.end);
935 VectorSubtract(rhc.end, rhc.start, rhc.dist);
936 #if COLLISIONPARANOID >= 2
937 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]);
938 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
943 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
944 memset(&testtrace, 0, sizeof(trace_t));
945 rhc.trace = &testtrace;
946 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
947 rhc.trace->skipsupercontentsmask = skipsupercontentsmask;
948 rhc.trace->skipmaterialflagsmask = skipmaterialflagsmask;
949 rhc.trace->fraction = 1;
950 rhc.trace->allsolid = true;
951 VectorCopy(test, rhc.start);
952 VectorCopy(test, rhc.end);
953 VectorClear(rhc.dist);
954 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
955 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
956 if (!trace->startsolid && testtrace.startsolid)
957 Con_Printf(" - ended in solid!\n");
961 if (VectorLength2(rhc.dist))
962 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
964 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
968 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, int skipsupercontentsmask, int skipmaterialflagsmask)
970 // this function currently only supports same size start and end
972 RecursiveHullCheckTraceInfo_t rhc;
974 if (VectorCompare(boxmins, boxmaxs))
976 if (VectorCompare(start, end))
977 Mod_Q1BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
979 Mod_Q1BSP_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
983 memset(&rhc, 0, sizeof(rhc));
984 memset(trace, 0, sizeof(trace_t));
986 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
987 rhc.trace->skipsupercontentsmask = skipsupercontentsmask;
988 rhc.trace->skipmaterialflagsmask = skipmaterialflagsmask;
989 rhc.trace->fraction = 1;
990 rhc.trace->allsolid = true;
991 VectorSubtract(boxmaxs, boxmins, boxsize);
993 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
994 else if (model->brush.ishlbsp)
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)
1000 if (boxsize[2] < 54) // pick the nearest of 36 or 72
1001 rhc.hull = &model->brushq1.hulls[3]; // 32x32x36
1003 rhc.hull = &model->brushq1.hulls[1]; // 32x32x72
1006 rhc.hull = &model->brushq1.hulls[2]; // 64x64x64
1010 // LordHavoc: this has to have a minor tolerance (the .1) because of
1011 // minor float precision errors from the box being transformed around
1012 if (boxsize[0] < 32.1)
1013 rhc.hull = &model->brushq1.hulls[1]; // 32x32x56
1015 rhc.hull = &model->brushq1.hulls[2]; // 64x64x88
1017 VectorMAMAM(1, start, 1, boxmins, -1, rhc.hull->clip_mins, rhc.start);
1018 VectorMAMAM(1, end, 1, boxmins, -1, rhc.hull->clip_mins, rhc.end);
1019 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1020 #if COLLISIONPARANOID >= 2
1021 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]);
1022 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1027 VectorLerp(rhc.start, rhc.trace->fraction, rhc.end, test);
1028 memset(&testtrace, 0, sizeof(trace_t));
1029 rhc.trace = &testtrace;
1030 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1031 rhc.trace->skipsupercontentsmask = skipsupercontentsmask;
1032 rhc.trace->skipmaterialflagsmask = skipmaterialflagsmask;
1033 rhc.trace->fraction = 1;
1034 rhc.trace->allsolid = true;
1035 VectorCopy(test, rhc.start);
1036 VectorCopy(test, rhc.end);
1037 VectorClear(rhc.dist);
1038 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1039 //Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, test, test);
1040 if (!trace->startsolid && testtrace.startsolid)
1041 Con_Printf(" - ended in solid!\n");
1045 if (VectorLength2(rhc.dist))
1046 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1048 Mod_Q1BSP_RecursiveHullCheckPoint(&rhc, rhc.hull->firstclipnode);
1052 static int Mod_Q1BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
1054 int num = model->brushq1.hulls[0].firstclipnode;
1056 mclipnode_t *nodes = model->brushq1.hulls[0].clipnodes;
1057 mplane_t *planes = model->brushq1.hulls[0].planes;
1060 plane = planes + nodes[num].planenum;
1061 num = nodes[num].children[(plane->type < 3 ? point[plane->type] : DotProduct(plane->normal, point)) < plane->dist];
1063 return Mod_Q1BSP_SuperContentsFromNativeContents(num);
1066 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 skipsupercontentsmask, int skipmaterialflagsmask, int boxsupercontents, int boxq3surfaceflags, const texture_t *boxtexture)
1070 colplanef_t cbox_planes[6];
1072 cbox.hasaabbplanes = true;
1073 cbox.supercontents = boxsupercontents;
1076 cbox.numtriangles = 0;
1077 cbox.planes = cbox_planes;
1079 cbox.elements = NULL;
1087 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];
1088 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];
1089 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];
1090 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];
1091 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];
1092 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];
1093 cbox_planes[0].q3surfaceflags = boxq3surfaceflags;cbox_planes[0].texture = boxtexture;
1094 cbox_planes[1].q3surfaceflags = boxq3surfaceflags;cbox_planes[1].texture = boxtexture;
1095 cbox_planes[2].q3surfaceflags = boxq3surfaceflags;cbox_planes[2].texture = boxtexture;
1096 cbox_planes[3].q3surfaceflags = boxq3surfaceflags;cbox_planes[3].texture = boxtexture;
1097 cbox_planes[4].q3surfaceflags = boxq3surfaceflags;cbox_planes[4].texture = boxtexture;
1098 cbox_planes[5].q3surfaceflags = boxq3surfaceflags;cbox_planes[5].texture = boxtexture;
1099 memset(trace, 0, sizeof(trace_t));
1100 trace->hitsupercontentsmask = hitsupercontentsmask;
1101 trace->skipsupercontentsmask = skipsupercontentsmask;
1102 trace->skipmaterialflagsmask = skipmaterialflagsmask;
1103 trace->fraction = 1;
1104 Collision_TraceLineBrushFloat(trace, start, end, &cbox, &cbox);
1106 RecursiveHullCheckTraceInfo_t rhc;
1107 static hull_t box_hull;
1108 static mclipnode_t box_clipnodes[6];
1109 static mplane_t box_planes[6];
1110 // fill in a default trace
1111 memset(&rhc, 0, sizeof(rhc));
1112 memset(trace, 0, sizeof(trace_t));
1113 //To keep everything totally uniform, bounding boxes are turned into small
1114 //BSP trees instead of being compared directly.
1115 // create a temp hull from bounding box sizes
1116 box_planes[0].dist = cmaxs[0] - mins[0];
1117 box_planes[1].dist = cmins[0] - maxs[0];
1118 box_planes[2].dist = cmaxs[1] - mins[1];
1119 box_planes[3].dist = cmins[1] - maxs[1];
1120 box_planes[4].dist = cmaxs[2] - mins[2];
1121 box_planes[5].dist = cmins[2] - maxs[2];
1122 #if COLLISIONPARANOID >= 3
1123 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]);
1126 if (box_hull.clipnodes == NULL)
1130 //Set up the planes and clipnodes so that the six floats of a bounding box
1131 //can just be stored out and get a proper hull_t structure.
1133 box_hull.clipnodes = box_clipnodes;
1134 box_hull.planes = box_planes;
1135 box_hull.firstclipnode = 0;
1136 box_hull.lastclipnode = 5;
1138 for (i = 0;i < 6;i++)
1140 box_clipnodes[i].planenum = i;
1144 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
1146 box_clipnodes[i].children[side^1] = i + 1;
1148 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
1150 box_planes[i].type = i>>1;
1151 box_planes[i].normal[i>>1] = 1;
1155 // trace a line through the generated clipping hull
1156 //rhc.boxsupercontents = boxsupercontents;
1157 rhc.hull = &box_hull;
1159 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1160 rhc.trace->skipsupercontentsmask = skipsupercontentsmask;
1161 rhc.trace->skipmaterialflagsmask = skipmaterialflagsmask;
1162 rhc.trace->fraction = 1;
1163 rhc.trace->allsolid = true;
1164 VectorCopy(start, rhc.start);
1165 VectorCopy(end, rhc.end);
1166 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1167 Mod_Q1BSP_RecursiveHullCheck(&rhc, rhc.hull->firstclipnode, 0, 1, rhc.start, rhc.end);
1168 //VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1169 if (rhc.trace->startsupercontents)
1170 rhc.trace->startsupercontents = boxsupercontents;
1174 void Collision_ClipTrace_Point(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, int hitsupercontentsmask, int skipsupercontentsmask, int skipmaterialflagsmask, int boxsupercontents, int boxq3surfaceflags, const texture_t *boxtexture)
1176 memset(trace, 0, sizeof(trace_t));
1177 trace->fraction = 1;
1178 trace->hitsupercontentsmask = hitsupercontentsmask;
1179 trace->skipsupercontentsmask = skipsupercontentsmask;
1180 trace->skipmaterialflagsmask = skipmaterialflagsmask;
1181 if (BoxesOverlap(start, start, cmins, cmaxs))
1183 trace->startsupercontents |= boxsupercontents;
1184 if ((hitsupercontentsmask & boxsupercontents) && !(skipsupercontentsmask & boxsupercontents))
1186 trace->startsolid = true;
1187 trace->allsolid = true;
1192 static qboolean Mod_Q1BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end, const vec3_t acceptmins, const vec3_t acceptmaxs)
1195 Mod_Q1BSP_TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK, 0, MATERIALFLAGMASK_TRANSLUCENT);
1196 return trace.fraction == 1 || BoxesOverlap(trace.endpos, trace.endpos, acceptmins, acceptmaxs);
1199 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)
1203 float mid, distz = endz - startz;
1207 switch (node->plane->type)
1210 node = node->children[x < node->plane->dist];
1211 continue; // loop back and process the new node
1213 node = node->children[y < node->plane->dist];
1214 continue; // loop back and process the new node
1216 side = startz < node->plane->dist;
1217 if ((endz < node->plane->dist) == side)
1219 node = node->children[side];
1220 continue; // loop back and process the new node
1222 // found an intersection
1223 mid = node->plane->dist;
1226 back = front = x * node->plane->normal[0] + y * node->plane->normal[1];
1227 front += startz * node->plane->normal[2];
1228 back += endz * node->plane->normal[2];
1229 side = front < node->plane->dist;
1230 if ((back < node->plane->dist) == side)
1232 node = node->children[side];
1233 continue; // loop back and process the new node
1235 // found an intersection
1236 mid = startz + distz * (front - node->plane->dist) / (front - back);
1240 // go down front side
1241 if (node->children[side]->plane && Mod_Q1BSP_LightPoint_RecursiveBSPNode(model, ambientcolor, diffusecolor, diffusenormal, node->children[side], x, y, startz, mid))
1242 return true; // hit something
1244 // check for impact on this node
1245 if (node->numsurfaces)
1248 int dsi, dti, lmwidth, lmheight;
1250 msurface_t *surface;
1251 unsigned char *lightmap;
1252 int maps, line3, size3;
1255 float scale, w, w00, w01, w10, w11;
1257 surface = model->data_surfaces + node->firstsurface;
1258 for (i = 0;i < node->numsurfaces;i++, surface++)
1260 if (!(surface->texture->basematerialflags & MATERIALFLAG_WALL) || !surface->lightmapinfo || !surface->lightmapinfo->samples)
1261 continue; // no lightmaps
1263 // location we want to sample in the lightmap
1264 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;
1265 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;
1268 // thanks to jitspoe for pointing out that this int cast was
1269 // rounding toward zero, so we floor it
1270 dsi = (int)floor(ds);
1271 dti = (int)floor(dt);
1272 lmwidth = ((surface->lightmapinfo->extents[0]>>4)+1);
1273 lmheight = ((surface->lightmapinfo->extents[1]>>4)+1);
1276 // we have to tolerate a position of lmwidth-1 for some rare
1277 // cases - in which case the sampling position still gets
1278 // clamped but the color gets interpolated to that edge.
1279 if (dsi >= 0 && dsi < lmwidth && dti >= 0 && dti < lmheight)
1281 // in the rare cases where we're sampling slightly off
1282 // the polygon, clamp the sampling position (we can still
1283 // interpolate outside it, where it becomes extrapolation)
1288 if (dsi > lmwidth-2)
1290 if (dti > lmheight-2)
1293 // calculate bilinear interpolation factors
1294 // and also multiply by fixedpoint conversion factors to
1295 // compensate for lightmaps being 0-255 (as 0-2), we use
1296 // r_refdef.scene.rtlightstylevalue here which is already
1297 // 0.000-2.148 range
1298 // (if we used r_refdef.scene.lightstylevalue this
1299 // divisor would be 32768 rather than 128)
1302 w00 = (1 - dsfrac) * (1 - dtfrac) * (1.0f / 128.0f);
1303 w01 = ( dsfrac) * (1 - dtfrac) * (1.0f / 128.0f);
1304 w10 = (1 - dsfrac) * ( dtfrac) * (1.0f / 128.0f);
1305 w11 = ( dsfrac) * ( dtfrac) * (1.0f / 128.0f);
1307 // values for pointer math
1308 line3 = lmwidth * 3; // LordHavoc: *3 for colored lighting
1309 size3 = lmwidth * lmheight * 3; // LordHavoc: *3 for colored lighting
1311 // look up the pixel
1312 lightmap = surface->lightmapinfo->samples + dti * line3 + dsi*3; // LordHavoc: *3 for colored lighting
1314 // bilinear filter each lightmap style, and sum them
1315 for (maps = 0;maps < MAXLIGHTMAPS && surface->lightmapinfo->styles[maps] != 255;maps++)
1317 scale = r_refdef.scene.rtlightstylevalue[surface->lightmapinfo->styles[maps]];
1318 w = w00 * scale;VectorMA(ambientcolor, w, lightmap , ambientcolor);
1319 w = w01 * scale;VectorMA(ambientcolor, w, lightmap + 3 , ambientcolor);
1320 w = w10 * scale;VectorMA(ambientcolor, w, lightmap + line3 , ambientcolor);
1321 w = w11 * scale;VectorMA(ambientcolor, w, lightmap + line3 + 3, ambientcolor);
1325 return true; // success
1330 // go down back side
1331 node = node->children[side ^ 1];
1333 distz = endz - startz;
1334 // loop back and process the new node
1337 // did not hit anything
1341 static void Mod_Q1BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
1343 // pretend lighting is coming down from above (due to lack of a lightgrid to know primary lighting direction)
1344 VectorSet(diffusenormal, 0, 0, 1);
1346 if (!model->brushq1.lightdata)
1348 VectorSet(ambientcolor, 1, 1, 1);
1349 VectorSet(diffusecolor, 0, 0, 0);
1353 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);
1356 static const texture_t *Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(RecursiveHullCheckTraceInfo_t *t, const dp_model_t *model, const mnode_t *node, double mid[3])
1361 const msurface_t *surface;
1366 float edgenormal[3];
1373 surface = model->data_surfaces + node->firstsurface;
1374 for (i = 0;i < node->numsurfaces;i++, surface++)
1376 // skip surfaces whose bounding box does not include the point
1377 // if (!BoxesOverlap(mid, mid, surface->mins, surface->maxs))
1379 // skip faces with contents we don't care about
1380 if (!(t->trace->hitsupercontentsmask & surface->texture->supercontents))
1382 // ignore surfaces matching the skipsupercontentsmask (this is rare)
1383 if (t->trace->skipsupercontentsmask & surface->texture->supercontents)
1385 // skip surfaces matching the skipmaterialflagsmask (e.g. MATERIALFLAG_NOSHADOW)
1386 if (t->trace->skipmaterialflagsmask & surface->texture->currentmaterialflags)
1388 // get the surface normal - since it is flat we know any vertex normal will suffice
1389 VectorCopy(model->surfmesh.data_normal3f + 3 * surface->num_firstvertex, normal);
1391 if (DotProduct(t->dist, normal) > 0)
1393 // iterate edges and see if the point is outside one of them
1394 for (j = 0, k = surface->num_vertices - 1;j < surface->num_vertices;k = j, j++)
1396 VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + k), v0);
1397 VectorCopy(model->surfmesh.data_vertex3f + 3 * (surface->num_firstvertex + j), v1);
1398 VectorSubtract(v0, v1, edgedir);
1399 CrossProduct(edgedir, normal, edgenormal);
1400 if (DotProduct(edgenormal, p) > DotProduct(edgenormal, v0))
1403 // if the point is outside one of the edges, it is not within the surface
1404 if (j < surface->num_vertices)
1407 // we hit a surface, this is the impact point...
1408 VectorCopy(normal, t->trace->plane.normal);
1409 t->trace->plane.dist = DotProduct(normal, p);
1411 // calculate the return fraction which is nudged off the surface a bit
1412 t1 = DotProduct(t->start, t->trace->plane.normal) - t->trace->plane.dist;
1413 t2 = DotProduct(t->end, t->trace->plane.normal) - t->trace->plane.dist;
1414 midf = (t1 - collision_impactnudge.value) / (t1 - t2);
1415 t->trace->fraction = bound(0, midf, 1);
1417 t->trace->hittexture = surface->texture->currentframe;
1418 t->trace->hitq3surfaceflags = t->trace->hittexture->surfaceflags;
1419 t->trace->hitsupercontents = t->trace->hittexture->supercontents;
1420 return surface->texture->currentframe;
1425 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])
1427 const mplane_t *plane;
1430 double midf, mid[3];
1431 const mleaf_t *leaf;
1435 plane = node->plane;
1436 if (plane->type < 3)
1438 t1 = p1[plane->type] - plane->dist;
1439 t2 = p2[plane->type] - plane->dist;
1443 t1 = DotProduct (plane->normal, p1) - plane->dist;
1444 t2 = DotProduct (plane->normal, p2) - plane->dist;
1450 node = node->children[1];
1459 node = node->children[0];
1465 // the line intersects, find intersection point
1466 // LordHavoc: this uses the original trace for maximum accuracy
1467 if (plane->type < 3)
1469 t1 = t->start[plane->type] - plane->dist;
1470 t2 = t->end[plane->type] - plane->dist;
1474 t1 = DotProduct (plane->normal, t->start) - plane->dist;
1475 t2 = DotProduct (plane->normal, t->end) - plane->dist;
1478 midf = t1 / (t1 - t2);
1479 VectorMA(t->start, midf, t->dist, mid);
1481 // recurse both sides, front side first, return if we hit a surface
1482 if (Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side], p1, mid) == HULLCHECKSTATE_DONE)
1483 return HULLCHECKSTATE_DONE;
1485 // test each surface on the node
1486 Mod_Q1BSP_TraceLineAgainstSurfacesFindTextureOnNode(t, model, node, mid);
1487 if (t->trace->hittexture)
1488 return HULLCHECKSTATE_DONE;
1490 // recurse back side
1491 return Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(t, model, node->children[side ^ 1], mid, p2);
1493 leaf = (const mleaf_t *)node;
1494 side = Mod_Q1BSP_SuperContentsFromNativeContents(leaf->contents);
1495 if (!t->trace->startfound)
1497 t->trace->startfound = true;
1498 t->trace->startsupercontents |= side;
1500 if (side & SUPERCONTENTS_LIQUIDSMASK)
1501 t->trace->inwater = true;
1503 t->trace->inopen = true;
1504 if (side & t->trace->hitsupercontentsmask)
1506 // if the first leaf is solid, set startsolid
1507 if (t->trace->allsolid)
1508 t->trace->startsolid = true;
1509 return HULLCHECKSTATE_SOLID;
1513 t->trace->allsolid = false;
1514 return HULLCHECKSTATE_EMPTY;
1518 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, int skipsupercontentsmask, int skipmaterialflagsmask)
1520 RecursiveHullCheckTraceInfo_t rhc;
1522 memset(&rhc, 0, sizeof(rhc));
1523 memset(trace, 0, sizeof(trace_t));
1525 rhc.trace->hitsupercontentsmask = hitsupercontentsmask;
1526 rhc.trace->skipsupercontentsmask = skipsupercontentsmask;
1527 rhc.trace->skipmaterialflagsmask = skipmaterialflagsmask;
1528 rhc.trace->fraction = 1;
1529 rhc.trace->allsolid = true;
1530 rhc.hull = &model->brushq1.hulls[0]; // 0x0x0
1531 VectorCopy(start, rhc.start);
1532 VectorCopy(end, rhc.end);
1533 VectorSubtract(rhc.end, rhc.start, rhc.dist);
1534 Mod_Q1BSP_TraceLineAgainstSurfacesRecursiveBSPNode(&rhc, model, model->brush.data_nodes + rhc.hull->firstclipnode, rhc.start, rhc.end);
1535 VectorMA(rhc.start, rhc.trace->fraction, rhc.dist, rhc.trace->endpos);
1538 static void Mod_Q1BSP_DecompressVis(const unsigned char *in, const unsigned char *inend, unsigned char *out, unsigned char *outend)
1541 unsigned char *outstart = out;
1542 while (out < outend)
1546 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));
1556 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));
1559 for (c = *in++;c > 0;c--)
1563 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));
1574 R_Q1BSP_LoadSplitSky
1576 A sky texture is 256*128, with the right side being a masked overlay
1579 static void R_Q1BSP_LoadSplitSky (unsigned char *src, int width, int height, int bytesperpixel)
1584 unsigned int *solidpixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1585 unsigned int *alphapixels = (unsigned int *)Mem_Alloc(tempmempool, w*h*sizeof(unsigned char[4]));
1587 // allocate a texture pool if we need it
1588 if (loadmodel->texturepool == NULL && cls.state != ca_dedicated)
1589 loadmodel->texturepool = R_AllocTexturePool();
1591 if (bytesperpixel == 4)
1593 for (y = 0;y < h;y++)
1595 for (x = 0;x < w;x++)
1597 solidpixels[y*w+x] = ((unsigned *)src)[y*width+x+w];
1598 alphapixels[y*w+x] = ((unsigned *)src)[y*width+x];
1604 // make an average value for the back to avoid
1605 // a fringe on the top level
1614 for (y = 0;y < h;y++)
1616 for (x = 0;x < w;x++)
1618 p = src[x*width+y+w];
1619 r += palette_rgb[p][0];
1620 g += palette_rgb[p][1];
1621 b += palette_rgb[p][2];
1624 bgra.b[2] = r/(w*h);
1625 bgra.b[1] = g/(w*h);
1626 bgra.b[0] = b/(w*h);
1628 for (y = 0;y < h;y++)
1630 for (x = 0;x < w;x++)
1632 solidpixels[y*w+x] = palette_bgra_complete[src[y*width+x+w]];
1634 alphapixels[y*w+x] = p ? palette_bgra_complete[p] : bgra.i;
1639 loadmodel->brush.solidskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_solidtexture", 0 , (unsigned char *) solidpixels, w, h, 0, 0, 0, vid.sRGB3D);
1640 loadmodel->brush.alphaskyskinframe = R_SkinFrame_LoadInternalBGRA("sky_alphatexture", TEXF_ALPHA, (unsigned char *) alphapixels, w, h, 0, 0, 0, vid.sRGB3D);
1641 Mem_Free(solidpixels);
1642 Mem_Free(alphapixels);
1645 static void Mod_Q1BSP_LoadTextures(sizebuf_t *sb)
1647 int i, j, k, num, max, altmax, mtwidth, mtheight, doffset, incomplete, nummiptex = 0, firstskynoshadowtexture = 0;
1648 skinframe_t *skinframemissing;
1649 texture_t *tx, *tx2, *anims[10], *altanims[10], *currentskynoshadowtexture;
1650 texture_t backuptex;
1651 unsigned char *data, *mtdata;
1653 char mapname[MAX_QPATH], name[MAX_QPATH];
1654 unsigned char zeroopaque[4], zerotrans[4];
1657 Vector4Set(zeroopaque, 0, 0, 0, 255);
1658 Vector4Set(zerotrans, 0, 0, 0, 128);
1660 loadmodel->data_textures = NULL;
1662 // add two slots for notexture walls and notexture liquids, and duplicate
1663 // all sky textures; sky surfaces can be shadow-casting or not, the surface
1664 // loading will choose according to the contents behind the surface
1665 // (necessary to support e1m5 logo shadow which has a SKY contents brush,
1666 // while correctly treating sky textures as occluders in other situations).
1671 nummiptex = MSG_ReadLittleLong(sb);
1672 loadmodel->num_textures = nummiptex + 2;
1673 // save the position so we can go back to it
1674 watermark = sb->readcount;
1675 for (i = 0; i < nummiptex; i++)
1677 doffset = MSG_ReadLittleLong(sb);
1678 if (r_nosurftextures.integer)
1682 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1686 MSG_InitReadBuffer(&miptexsb, sb->data + doffset, sb->cursize - doffset);
1688 // copy name, but only up to 16 characters
1689 // (the output buffer can hold more than this, but the input buffer is
1691 for (j = 0; j < 16; j++)
1692 name[j] = MSG_ReadByte(&miptexsb);
1694 // pretty up the buffer (replacing any trailing garbage with 0)
1695 for (j = (int)strlen(name); j < 16; j++)
1698 if (!strncmp(name, "sky", 3))
1702 // bump it back to where we started parsing
1703 sb->readcount = watermark;
1705 firstskynoshadowtexture = loadmodel->num_textures;
1706 loadmodel->num_textures += numsky;
1710 loadmodel->num_textures = 2;
1711 firstskynoshadowtexture = loadmodel->num_textures;
1713 loadmodel->num_texturesperskin = loadmodel->num_textures;
1715 loadmodel->data_textures = (texture_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_textures * sizeof(texture_t));
1717 // we'll be writing to these in parallel for sky textures
1718 currentskynoshadowtexture = loadmodel->data_textures + firstskynoshadowtexture;
1720 // fill out all slots with notexture
1721 skinframemissing = R_SkinFrame_LoadMissing();
1722 for (i = 0, tx = loadmodel->data_textures;i < loadmodel->num_textures;i++, tx++)
1724 strlcpy(tx->name, "NO TEXTURE FOUND", sizeof(tx->name));
1727 tx->basealpha = 1.0f;
1728 tx->materialshaderpass = tx->shaderpasses[0] = Mod_CreateShaderPass(loadmodel->mempool, skinframemissing);
1729 tx->materialshaderpass->skinframes[0] = skinframemissing;
1730 tx->currentskinframe = skinframemissing;
1731 tx->basematerialflags = MATERIALFLAG_WALL;
1732 if (i == loadmodel->num_textures - 1)
1734 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1735 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1736 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1740 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1741 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1743 tx->currentframe = tx;
1745 // clear water settings
1748 tx->refractfactor = 1;
1749 Vector4Set(tx->refractcolor4f, 1, 1, 1, 1);
1750 tx->reflectfactor = 1;
1751 Vector4Set(tx->reflectcolor4f, 1, 1, 1, 1);
1752 tx->r_water_wateralpha = 1;
1753 tx->offsetmapping = OFFSETMAPPING_DEFAULT;
1754 tx->offsetscale = 1;
1756 tx->specularscalemod = 1;
1757 tx->specularpowermod = 1;
1758 tx->transparentsort = TRANSPARENTSORT_DISTANCE;
1759 // WHEN ADDING DEFAULTS HERE, REMEMBER TO PUT DEFAULTS IN ALL LOADERS
1760 // JUST GREP FOR "specularscalemod = 1".
1765 Con_Printf("%s: no miptex lump to load textures from\n", loadmodel->name);
1769 s = loadmodel->name;
1770 if (!strncasecmp(s, "maps/", 5))
1772 FS_StripExtension(s, mapname, sizeof(mapname));
1774 // LordHavoc: mostly rewritten map texture loader
1775 for (i = 0;i < nummiptex;i++)
1777 doffset = MSG_ReadLittleLong(sb);
1778 if (r_nosurftextures.integer)
1782 Con_DPrintf("%s: miptex #%i missing\n", loadmodel->name, i);
1786 MSG_InitReadBuffer(&miptexsb, sb->data + doffset, sb->cursize - doffset);
1788 // copy name, but only up to 16 characters
1789 // (the output buffer can hold more than this, but the input buffer is
1791 for (j = 0;j < 16;j++)
1792 name[j] = MSG_ReadByte(&miptexsb);
1794 // pretty up the buffer (replacing any trailing garbage with 0)
1795 for (j = (int)strlen(name);j < 16;j++)
1800 dpsnprintf(name, sizeof(name), "unnamed%i", i);
1801 Con_DPrintf("%s: warning: renaming unnamed texture to %s\n", loadmodel->name, name);
1804 mtwidth = MSG_ReadLittleLong(&miptexsb);
1805 mtheight = MSG_ReadLittleLong(&miptexsb);
1807 j = MSG_ReadLittleLong(&miptexsb);
1811 if (j < 40 || j + mtwidth * mtheight > miptexsb.cursize)
1813 Con_Printf("%s: Texture \"%s\" is corrupt or incomplete\n", loadmodel->name, name);
1816 mtdata = miptexsb.data + j;
1819 if ((mtwidth & 15) || (mtheight & 15))
1820 Con_DPrintf("%s: warning: texture \"%s\" is not 16 aligned\n", loadmodel->name, name);
1822 // LordHavoc: force all names to lowercase
1823 for (j = 0;name[j];j++)
1824 if (name[j] >= 'A' && name[j] <= 'Z')
1825 name[j] += 'a' - 'A';
1827 // LordHavoc: backup the texture_t because q3 shader loading overwrites it
1828 backuptex = loadmodel->data_textures[i];
1829 if (name[0] && Mod_LoadTextureFromQ3Shader(loadmodel->mempool, loadmodel->name, loadmodel->data_textures + i, name, false, false, 0, MATERIALFLAG_WALL))
1831 loadmodel->data_textures[i] = backuptex;
1833 tx = loadmodel->data_textures + i;
1834 strlcpy(tx->name, name, sizeof(tx->name));
1835 tx->width = mtwidth;
1836 tx->height = mtheight;
1837 tx->basealpha = 1.0f;
1839 // start out with no animation
1840 tx->currentframe = tx;
1841 tx->currentskinframe = tx->materialshaderpass != NULL ? tx->materialshaderpass->skinframes[0] : NULL;
1843 if (tx->name[0] == '*')
1845 if (!strncmp(tx->name, "*lava", 5))
1847 tx->supercontents = mod_q1bsp_texture_lava.supercontents;
1848 tx->surfaceflags = mod_q1bsp_texture_lava.surfaceflags;
1850 else if (!strncmp(tx->name, "*slime", 6))
1852 tx->supercontents = mod_q1bsp_texture_slime.supercontents;
1853 tx->surfaceflags = mod_q1bsp_texture_slime.surfaceflags;
1857 tx->supercontents = mod_q1bsp_texture_water.supercontents;
1858 tx->surfaceflags = mod_q1bsp_texture_water.surfaceflags;
1861 else if (!strncmp(tx->name, "sky", 3))
1863 tx->supercontents = mod_q1bsp_texture_sky.supercontents;
1864 tx->surfaceflags = mod_q1bsp_texture_sky.surfaceflags;
1865 // for the surface traceline we need to hit this surface as a solid...
1866 tx->supercontents |= SUPERCONTENTS_SOLID;
1870 tx->supercontents = mod_q1bsp_texture_solid.supercontents;
1871 tx->surfaceflags = mod_q1bsp_texture_solid.surfaceflags;
1874 if (cls.state != ca_dedicated)
1876 // LordHavoc: HL sky textures are entirely different than quake
1877 if (!loadmodel->brush.ishlbsp && !strncmp(tx->name, "sky", 3) && mtwidth == mtheight * 2)
1879 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va(vabuf, sizeof(vabuf), "textures/%s/%s", mapname, tx->name), false, false, false, NULL);
1881 data = loadimagepixelsbgra(gamemode == GAME_TENEBRAE ? tx->name : va(vabuf, sizeof(vabuf), "textures/%s", tx->name), false, false, false, NULL);
1882 if (data && image_width == image_height * 2)
1884 R_Q1BSP_LoadSplitSky(data, image_width, image_height, 4);
1887 else if (mtdata != NULL)
1888 R_Q1BSP_LoadSplitSky(mtdata, mtwidth, mtheight, 1);
1892 skinframe_t *skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va(vabuf, sizeof(vabuf), "textures/%s/%s", mapname, tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, false, false);
1894 skinframe = R_SkinFrame_LoadExternal(gamemode == GAME_TENEBRAE ? tx->name : va(vabuf, sizeof(vabuf), "textures/%s", tx->name), TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, false, false);
1896 tx->offsetmapping = OFFSETMAPPING_DEFAULT; // allow offsetmapping on external textures without a q3 shader
1899 // did not find external texture, load it from the bsp or wad3
1900 if (loadmodel->brush.ishlbsp)
1902 // internal texture overrides wad
1903 unsigned char *pixels, *freepixels;
1904 pixels = freepixels = NULL;
1906 pixels = W_ConvertWAD3TextureBGRA(&miptexsb);
1908 pixels = freepixels = W_GetTextureBGRA(tx->name);
1911 tx->width = image_width;
1912 tx->height = image_height;
1913 skinframe = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, pixels, image_width, image_height, image_width, image_height, CRC_Block(pixels, image_width * image_height * 4), true);
1916 Mem_Free(freepixels);
1918 else if (mtdata) // texture included
1919 skinframe = R_SkinFrame_LoadInternalQuake(tx->name, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP, false, r_fullbrights.integer, mtdata, tx->width, tx->height);
1921 // if skinframe is still NULL the "missing" texture has already been assigned to this
1923 tx->materialshaderpass->skinframes[0] = skinframe;
1925 // LordHavoc: some Tenebrae textures get replaced by black
1926 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1927 tx->materialshaderpass->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, TEXF_MIPMAP | TEXF_ALPHA, zerotrans, 1, 1, 0, 0, 0, false);
1928 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1929 tx->materialshaderpass->skinframes[0] = R_SkinFrame_LoadInternalBGRA(tx->name, 0, zeroopaque, 1, 1, 0, 0, 0, false);
1930 tx->currentskinframe = tx->materialshaderpass->skinframes[0];
1933 tx->basematerialflags = MATERIALFLAG_WALL;
1934 if (tx->name[0] == '*')
1936 // LordHavoc: some turbulent textures should not be affected by wateralpha
1937 if (!strncmp(tx->name, "*glassmirror", 12)) // Tenebrae
1938 tx->basematerialflags |= MATERIALFLAG_NOSHADOW | MATERIALFLAG_ADD | MATERIALFLAG_BLENDED | MATERIALFLAG_REFLECTION;
1939 else if (!strncmp(tx->name,"*lava",5)
1940 || !strncmp(tx->name,"*teleport",9)
1941 || !strncmp(tx->name,"*rift",5)) // Scourge of Armagon texture
1942 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW;
1944 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_LIGHTBOTHSIDES | MATERIALFLAG_NOSHADOW | MATERIALFLAG_WATERALPHA | MATERIALFLAG_WATERSHADER;
1945 if (tx->currentskinframe != NULL && tx->currentskinframe->hasalpha)
1946 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1948 else if (tx->name[0] == '{') // fence textures
1950 tx->basematerialflags |= MATERIALFLAG_ALPHATEST | MATERIALFLAG_NOSHADOW;
1952 else if (!strncmp(tx->name, "mirror", 6)) // Tenebrae
1954 // replace the texture with black
1955 tx->basematerialflags |= MATERIALFLAG_REFLECTION;
1957 else if (!strncmp(tx->name, "sky", 3))
1958 tx->basematerialflags = MATERIALFLAG_SKY;
1959 else if (!strcmp(tx->name, "caulk"))
1960 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
1961 else if (tx->currentskinframe != NULL && tx->currentskinframe->hasalpha)
1962 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED | MATERIALFLAG_NOSHADOW;
1963 tx->currentmaterialflags = tx->basematerialflags;
1965 // duplicate of sky with NOSHADOW
1966 if (tx->basematerialflags & MATERIALFLAG_SKY)
1968 *currentskynoshadowtexture = *tx;
1969 currentskynoshadowtexture->basematerialflags |= MATERIALFLAG_NOSHADOW;
1970 tx->skynoshadowtexture = currentskynoshadowtexture;
1971 currentskynoshadowtexture++;
1975 // sequence the animations
1976 for (i = 0;i < nummiptex;i++)
1978 tx = loadmodel->data_textures + i;
1979 if (!tx || tx->name[0] != '+' || tx->name[1] == 0 || tx->name[2] == 0)
1982 if ((num < '0' || num > '9') && (num < 'a' || num > 'j'))
1984 Con_Printf("Bad animating texture %s\n", tx->name);
1987 if (tx->anim_total[0] || tx->anim_total[1])
1988 continue; // already sequenced
1990 // find the number of frames in the animation
1991 memset(anims, 0, sizeof(anims));
1992 memset(altanims, 0, sizeof(altanims));
1994 for (j = i;j < nummiptex;j++)
1996 tx2 = loadmodel->data_textures + j;
1997 if (!tx2 || tx2->name[0] != '+' || strcmp(tx2->name+2, tx->name+2))
2001 if (num >= '0' && num <= '9')
2002 anims[num - '0'] = tx2;
2003 else if (num >= 'a' && num <= 'j')
2004 altanims[num - 'a'] = tx2;
2005 // No need to warn otherwise - we already did above.
2009 for (j = 0;j < 10;j++)
2016 //Con_Printf("linking animation %s (%i:%i frames)\n\n", tx->name, max, altmax);
2019 for (j = 0;j < max;j++)
2023 Con_Printf("Missing frame %i of %s\n", j, tx->name);
2027 for (j = 0;j < altmax;j++)
2031 Con_Printf("Missing altframe %i of %s\n", j, tx->name);
2038 // If we have exactly one frame, something's wrong.
2039 if (max + altmax <= 1)
2041 Con_Printf("Texture %s is animated (leading +) but has only one frame\n", tx->name);
2046 // if there is no alternate animation, duplicate the primary
2047 // animation into the alternate
2049 for (k = 0;k < 10;k++)
2050 altanims[k] = anims[k];
2056 Con_Printf("Missing frame 0 of %s\n", tx->name);
2058 // however, we can handle this by duplicating the alternate animation into the primary
2060 for (k = 0;k < 10;k++)
2061 anims[k] = altanims[k];
2065 // link together the primary animation
2066 for (j = 0;j < max;j++)
2069 tx2->animated = 1; // q1bsp
2070 tx2->anim_total[0] = max;
2071 tx2->anim_total[1] = altmax;
2072 for (k = 0;k < 10;k++)
2074 tx2->anim_frames[0][k] = anims[k];
2075 tx2->anim_frames[1][k] = altanims[k];
2079 // if there really is an alternate anim...
2080 if (anims[0] != altanims[0])
2082 // link together the alternate animation
2083 for (j = 0;j < altmax;j++)
2086 tx2->animated = 1; // q1bsp
2087 // the primary/alternate are reversed here
2088 tx2->anim_total[0] = altmax;
2089 tx2->anim_total[1] = max;
2090 for (k = 0;k < 10;k++)
2092 tx2->anim_frames[0][k] = altanims[k];
2093 tx2->anim_frames[1][k] = anims[k];
2100 static void Mod_Q1BSP_LoadLighting(sizebuf_t *sb)
2103 unsigned char *in, *out, *data, d;
2104 char litfilename[MAX_QPATH];
2105 char dlitfilename[MAX_QPATH];
2106 fs_offset_t filesize;
2107 if (loadmodel->brush.ishlbsp) // LordHavoc: load the colored lighting data straight
2109 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, sb->cursize);
2110 for (i = 0;i < sb->cursize;i++)
2111 loadmodel->brushq1.lightdata[i] = sb->data[i] >>= 1;
2113 else // LordHavoc: bsp version 29 (normal white lighting)
2115 // LordHavoc: hope is not lost yet, check for a .lit file to load
2116 strlcpy (litfilename, loadmodel->name, sizeof (litfilename));
2117 FS_StripExtension (litfilename, litfilename, sizeof (litfilename));
2118 strlcpy (dlitfilename, litfilename, sizeof (dlitfilename));
2119 strlcat (litfilename, ".lit", sizeof (litfilename));
2120 strlcat (dlitfilename, ".dlit", sizeof (dlitfilename));
2121 data = (unsigned char*) FS_LoadFile(litfilename, tempmempool, false, &filesize);
2124 if (filesize == (fs_offset_t)(8 + sb->cursize * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
2126 i = LittleLong(((int *)data)[1]);
2129 if (developer_loading.integer)
2130 Con_Printf("loaded %s\n", litfilename);
2131 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
2132 memcpy(loadmodel->brushq1.lightdata, data + 8, filesize - 8);
2134 data = (unsigned char*) FS_LoadFile(dlitfilename, tempmempool, false, &filesize);
2137 if (filesize == (fs_offset_t)(8 + sb->cursize * 3) && data[0] == 'Q' && data[1] == 'L' && data[2] == 'I' && data[3] == 'T')
2139 i = LittleLong(((int *)data)[1]);
2142 if (developer_loading.integer)
2143 Con_Printf("loaded %s\n", dlitfilename);
2144 loadmodel->brushq1.nmaplightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, filesize - 8);
2145 memcpy(loadmodel->brushq1.nmaplightdata, data + 8, filesize - 8);
2146 loadmodel->brushq3.deluxemapping_modelspace = false;
2147 loadmodel->brushq3.deluxemapping = true;
2156 Con_Printf("Unknown .lit file version (%d)\n", i);
2158 else if (filesize == 8)
2159 Con_Print("Empty .lit file, ignoring\n");
2161 Con_Printf("Corrupt .lit file (file size %i bytes, should be %i bytes), ignoring\n", (int) filesize, (int) (8 + sb->cursize * 3));
2168 // LordHavoc: oh well, expand the white lighting data
2171 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, sb->cursize*3);
2173 out = loadmodel->brushq1.lightdata;
2174 for (i = 0;i < sb->cursize;i++)
2184 static void Mod_Q1BSP_LoadVisibility(sizebuf_t *sb)
2186 loadmodel->brushq1.num_compressedpvs = 0;
2187 loadmodel->brushq1.data_compressedpvs = NULL;
2190 loadmodel->brushq1.num_compressedpvs = sb->cursize;
2191 loadmodel->brushq1.data_compressedpvs = (unsigned char *)Mem_Alloc(loadmodel->mempool, sb->cursize);
2192 MSG_ReadBytes(sb, sb->cursize, loadmodel->brushq1.data_compressedpvs);
2195 // used only for HalfLife maps
2196 static void Mod_Q1BSP_ParseWadsFromEntityLump(const char *data)
2198 char key[128], value[4096];
2202 if (!COM_ParseToken_Simple(&data, false, false, true))
2204 if (com_token[0] != '{')
2208 if (!COM_ParseToken_Simple(&data, false, false, true))
2210 if (com_token[0] == '}')
2211 break; // end of worldspawn
2212 if (com_token[0] == '_')
2213 strlcpy(key, com_token + 1, sizeof(key));
2215 strlcpy(key, com_token, sizeof(key));
2216 while (key[strlen(key)-1] == ' ') // remove trailing spaces
2217 key[strlen(key)-1] = 0;
2218 if (!COM_ParseToken_Simple(&data, false, false, true))
2220 dpsnprintf(value, sizeof(value), "%s", com_token);
2221 if (!strcmp("wad", key)) // for HalfLife maps
2223 if (loadmodel->brush.ishlbsp)
2226 for (i = 0;i < (int)sizeof(value);i++)
2227 if (value[i] != ';' && value[i] != '\\' && value[i] != '/' && value[i] != ':')
2229 if (i < (int)sizeof(value) && value[i])
2231 for (;i < (int)sizeof(value);i++)
2233 // ignore path - the \\ check is for HalfLife... stupid windoze 'programmers'...
2234 if (value[i] == '\\' || value[i] == '/' || value[i] == ':')
2236 else if (value[i] == ';' || value[i] == 0)
2240 W_LoadTextureWadFile(&value[j], false);
2252 static void Mod_Q1BSP_LoadEntities(sizebuf_t *sb)
2254 loadmodel->brush.entities = NULL;
2257 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, sb->cursize + 1);
2258 MSG_ReadBytes(sb, sb->cursize, (unsigned char *)loadmodel->brush.entities);
2259 loadmodel->brush.entities[sb->cursize] = 0;
2260 if (loadmodel->brush.ishlbsp)
2261 Mod_Q1BSP_ParseWadsFromEntityLump(loadmodel->brush.entities);
2265 static void Mod_Q1BSP_LoadVertexes(sizebuf_t *sb)
2269 int structsize = 12;
2271 if (sb->cursize % structsize)
2272 Host_Error("Mod_Q1BSP_LoadVertexes: funny lump size in %s",loadmodel->name);
2273 count = sb->cursize / structsize;
2274 out = (mvertex_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2276 loadmodel->brushq1.vertexes = out;
2277 loadmodel->brushq1.numvertexes = count;
2279 for ( i=0 ; i<count ; i++, out++)
2281 out->position[0] = MSG_ReadLittleFloat(sb);
2282 out->position[1] = MSG_ReadLittleFloat(sb);
2283 out->position[2] = MSG_ReadLittleFloat(sb);
2287 static void Mod_Q1BSP_LoadSubmodels(sizebuf_t *sb, hullinfo_t *hullinfo)
2291 int structsize = (48+4*hullinfo->filehulls);
2293 if (sb->cursize % structsize)
2294 Host_Error ("Mod_Q1BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
2296 count = sb->cursize / structsize;
2297 out = (mmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
2299 loadmodel->brushq1.submodels = out;
2300 loadmodel->brush.numsubmodels = count;
2302 for (i = 0; i < count; i++, out++)
2304 // spread out the mins / maxs by a pixel
2305 out->mins[0] = MSG_ReadLittleFloat(sb) - 1;
2306 out->mins[1] = MSG_ReadLittleFloat(sb) - 1;
2307 out->mins[2] = MSG_ReadLittleFloat(sb) - 1;
2308 out->maxs[0] = MSG_ReadLittleFloat(sb) + 1;
2309 out->maxs[1] = MSG_ReadLittleFloat(sb) + 1;
2310 out->maxs[2] = MSG_ReadLittleFloat(sb) + 1;
2311 out->origin[0] = MSG_ReadLittleFloat(sb);
2312 out->origin[1] = MSG_ReadLittleFloat(sb);
2313 out->origin[2] = MSG_ReadLittleFloat(sb);
2314 for (j = 0; j < hullinfo->filehulls; j++)
2315 out->headnode[j] = MSG_ReadLittleLong(sb);
2316 out->visleafs = MSG_ReadLittleLong(sb);
2317 out->firstface = MSG_ReadLittleLong(sb);
2318 out->numfaces = MSG_ReadLittleLong(sb);
2322 static void Mod_Q1BSP_LoadEdges(sizebuf_t *sb)
2326 int structsize = loadmodel->brush.isbsp2 ? 8 : 4;
2328 if (sb->cursize % structsize)
2329 Host_Error("Mod_Q1BSP_LoadEdges: funny lump size in %s",loadmodel->name);
2330 count = sb->cursize / structsize;
2331 out = (medge_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2333 loadmodel->brushq1.edges = out;
2334 loadmodel->brushq1.numedges = count;
2336 for ( i=0 ; i<count ; i++, out++)
2338 if (loadmodel->brush.isbsp2)
2340 out->v[0] = (unsigned int)MSG_ReadLittleLong(sb);
2341 out->v[1] = (unsigned int)MSG_ReadLittleLong(sb);
2345 out->v[0] = (unsigned short)MSG_ReadLittleShort(sb);
2346 out->v[1] = (unsigned short)MSG_ReadLittleShort(sb);
2348 if ((int)out->v[0] >= loadmodel->brushq1.numvertexes || (int)out->v[1] >= loadmodel->brushq1.numvertexes)
2350 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);
2351 if(!loadmodel->brushq1.numvertexes)
2352 Host_Error("Mod_Q1BSP_LoadEdges: %s has edges but no vertexes, cannot fix\n", loadmodel->name);
2360 static void Mod_Q1BSP_LoadTexinfo(sizebuf_t *sb)
2363 int i, j, k, count, miptex;
2364 int structsize = 40;
2366 if (sb->cursize % structsize)
2367 Host_Error("Mod_Q1BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
2368 count = sb->cursize / structsize;
2369 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
2371 loadmodel->brushq1.texinfo = out;
2372 loadmodel->brushq1.numtexinfo = count;
2374 for (i = 0;i < count;i++, out++)
2376 for (k = 0;k < 2;k++)
2377 for (j = 0;j < 4;j++)
2378 out->vecs[k][j] = MSG_ReadLittleFloat(sb);
2380 miptex = MSG_ReadLittleLong(sb);
2381 out->q1flags = MSG_ReadLittleLong(sb);
2383 if (out->q1flags & TEX_SPECIAL)
2385 // if texture chosen is NULL or the shader needs a lightmap,
2386 // force to notexture water shader
2387 out->textureindex = loadmodel->num_textures - 1;
2391 // if texture chosen is NULL, force to notexture
2392 out->textureindex = loadmodel->num_textures - 2;
2394 // see if the specified miptex is valid and try to use it instead
2395 if (loadmodel->data_textures)
2397 if ((unsigned int) miptex >= (unsigned int) loadmodel->num_textures)
2398 Con_Printf("error in model \"%s\": invalid miptex index %i(of %i)\n", loadmodel->name, miptex, loadmodel->num_textures);
2400 out->textureindex = miptex;
2406 void BoundPoly(int numverts, float *verts, vec3_t mins, vec3_t maxs)
2411 mins[0] = mins[1] = mins[2] = 9999;
2412 maxs[0] = maxs[1] = maxs[2] = -9999;
2414 for (i = 0;i < numverts;i++)
2416 for (j = 0;j < 3;j++, v++)
2426 #define MAX_SUBDIVPOLYTRIANGLES 4096
2427 #define MAX_SUBDIVPOLYVERTS(MAX_SUBDIVPOLYTRIANGLES * 3)
2429 static int subdivpolyverts, subdivpolytriangles;
2430 static int subdivpolyindex[MAX_SUBDIVPOLYTRIANGLES][3];
2431 static float subdivpolyvert[MAX_SUBDIVPOLYVERTS][3];
2433 static int subdivpolylookupvert(vec3_t v)
2436 for (i = 0;i < subdivpolyverts;i++)
2437 if (subdivpolyvert[i][0] == v[0]
2438 && subdivpolyvert[i][1] == v[1]
2439 && subdivpolyvert[i][2] == v[2])
2441 if (subdivpolyverts >= MAX_SUBDIVPOLYVERTS)
2442 Host_Error("SubDividePolygon: ran out of vertices in buffer, please increase your r_subdivide_size");
2443 VectorCopy(v, subdivpolyvert[subdivpolyverts]);
2444 return subdivpolyverts++;
2447 static void SubdividePolygon(int numverts, float *verts)
2449 int i, i1, i2, i3, f, b, c, p;
2450 vec3_t mins, maxs, front[256], back[256];
2451 float m, *pv, *cv, dist[256], frac;
2454 Host_Error("SubdividePolygon: ran out of verts in buffer");
2456 BoundPoly(numverts, verts, mins, maxs);
2458 for (i = 0;i < 3;i++)
2460 m = (mins[i] + maxs[i]) * 0.5;
2461 m = r_subdivide_size.value * floor(m/r_subdivide_size.value + 0.5);
2462 if (maxs[i] - m < 8)
2464 if (m - mins[i] < 8)
2468 for (cv = verts, c = 0;c < numverts;c++, cv += 3)
2469 dist[c] = cv[i] - m;
2472 for (p = numverts - 1, c = 0, pv = verts + p * 3, cv = verts;c < numverts;p = c, c++, pv = cv, cv += 3)
2476 VectorCopy(pv, front[f]);
2481 VectorCopy(pv, back[b]);
2484 if (dist[p] == 0 || dist[c] == 0)
2486 if ((dist[p] > 0) != (dist[c] > 0) )
2489 frac = dist[p] / (dist[p] - dist[c]);
2490 front[f][0] = back[b][0] = pv[0] + frac * (cv[0] - pv[0]);
2491 front[f][1] = back[b][1] = pv[1] + frac * (cv[1] - pv[1]);
2492 front[f][2] = back[b][2] = pv[2] + frac * (cv[2] - pv[2]);
2498 SubdividePolygon(f, front[0]);
2499 SubdividePolygon(b, back[0]);
2503 i1 = subdivpolylookupvert(verts);
2504 i2 = subdivpolylookupvert(verts + 3);
2505 for (i = 2;i < numverts;i++)
2507 if (subdivpolytriangles >= MAX_SUBDIVPOLYTRIANGLES)
2509 Con_Print("SubdividePolygon: ran out of triangles in buffer, please increase your r_subdivide_size\n");
2513 i3 = subdivpolylookupvert(verts + i * 3);
2514 subdivpolyindex[subdivpolytriangles][0] = i1;
2515 subdivpolyindex[subdivpolytriangles][1] = i2;
2516 subdivpolyindex[subdivpolytriangles][2] = i3;
2518 subdivpolytriangles++;
2522 //Breaks a polygon up along axial 64 unit
2523 //boundaries so that turbulent and sky warps
2524 //can be done reasonably.
2525 static void Mod_Q1BSP_GenerateWarpMesh(msurface_t *surface)
2531 subdivpolytriangles = 0;
2532 subdivpolyverts = 0;
2533 SubdividePolygon(surface->num_vertices, (surface->mesh->data_vertex3f + 3 * surface->num_firstvertex));
2534 if (subdivpolytriangles < 1)
2535 Host_Error("Mod_Q1BSP_GenerateWarpMesh: no triangles?");
2537 surface->mesh = mesh = Mem_Alloc(loadmodel->mempool, sizeof(surfmesh_t) + subdivpolytriangles * sizeof(int[3]) + subdivpolyverts * sizeof(surfvertex_t));
2538 mesh->num_vertices = subdivpolyverts;
2539 mesh->num_triangles = subdivpolytriangles;
2540 mesh->vertex = (surfvertex_t *)(mesh + 1);
2541 mesh->index = (int *)(mesh->vertex + mesh->num_vertices);
2542 memset(mesh->vertex, 0, mesh->num_vertices * sizeof(surfvertex_t));
2544 for (i = 0;i < mesh->num_triangles;i++)
2545 for (j = 0;j < 3;j++)
2546 mesh->index[i*3+j] = subdivpolyindex[i][j];
2548 for (i = 0, v = mesh->vertex;i < subdivpolyverts;i++, v++)
2550 VectorCopy(subdivpolyvert[i], v->v);
2551 v->st[0] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[0]);
2552 v->st[1] = DotProduct(v->v, surface->lightmapinfo->texinfo->vecs[1]);
2557 extern cvar_t gl_max_lightmapsize;
2558 static void Mod_Q1BSP_LoadFaces(sizebuf_t *sb)
2560 msurface_t *surface;
2561 int i, j, count, surfacenum, planenum, smax, tmax, ssize, tsize, firstedge, numedges, totalverts, totaltris, lightmapnumber, lightmapsize, totallightmapsamples, lightmapoffset, texinfoindex;
2562 float texmins[2], texmaxs[2], val;
2563 rtexture_t *lightmaptexture, *deluxemaptexture;
2565 int structsize = loadmodel->brush.isbsp2 ? 28 : 20;
2567 if (sb->cursize % structsize)
2568 Host_Error("Mod_Q1BSP_LoadFaces: funny lump size in %s",loadmodel->name);
2569 count = sb->cursize / structsize;
2570 loadmodel->data_surfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_t));
2571 loadmodel->data_surfaces_lightmapinfo = (msurface_lightmapinfo_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(msurface_lightmapinfo_t));
2573 loadmodel->num_surfaces = count;
2575 loadmodel->brushq1.firstrender = true;
2576 loadmodel->brushq1.lightmapupdateflags = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*sizeof(unsigned char));
2580 for (surfacenum = 0;surfacenum < count;surfacenum++)
2582 if (loadmodel->brush.isbsp2)
2583 numedges = BuffLittleLong(sb->data + structsize * surfacenum + 12);
2585 numedges = BuffLittleShort(sb->data + structsize * surfacenum + 8);
2586 totalverts += numedges;
2587 totaltris += numedges - 2;
2590 Mod_AllocSurfMesh(loadmodel->mempool, totalverts, totaltris, true, false);
2592 lightmaptexture = NULL;
2593 deluxemaptexture = r_texture_blanknormalmap;
2595 lightmapsize = bound(256, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d);
2596 totallightmapsamples = 0;
2600 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2602 surface->lightmapinfo = loadmodel->data_surfaces_lightmapinfo + surfacenum;
2603 // the struct on disk is the same in BSP29 (Q1), BSP30 (HL1), and IBSP38 (Q2)
2604 planenum = loadmodel->brush.isbsp2 ? MSG_ReadLittleLong(sb) : (unsigned short)MSG_ReadLittleShort(sb);
2605 /*side = */loadmodel->brush.isbsp2 ? MSG_ReadLittleLong(sb) : (unsigned short)MSG_ReadLittleShort(sb);
2606 firstedge = MSG_ReadLittleLong(sb);
2607 numedges = loadmodel->brush.isbsp2 ? MSG_ReadLittleLong(sb) : (unsigned short)MSG_ReadLittleShort(sb);
2608 texinfoindex = loadmodel->brush.isbsp2 ? MSG_ReadLittleLong(sb) : (unsigned short)MSG_ReadLittleShort(sb);
2609 for (i = 0;i < MAXLIGHTMAPS;i++)
2610 surface->lightmapinfo->styles[i] = MSG_ReadByte(sb);
2611 lightmapoffset = MSG_ReadLittleLong(sb);
2613 // FIXME: validate edges, texinfo, etc?
2614 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)
2615 Host_Error("Mod_Q1BSP_LoadFaces: invalid edge range (firstedge %i, numedges %i, model edges %i)", firstedge, numedges, loadmodel->brushq1.numsurfedges);
2616 if ((unsigned int) texinfoindex >= (unsigned int) loadmodel->brushq1.numtexinfo)
2617 Host_Error("Mod_Q1BSP_LoadFaces: invalid texinfo index %i(model has %i texinfos)", texinfoindex, loadmodel->brushq1.numtexinfo);
2618 if ((unsigned int) planenum >= (unsigned int) loadmodel->brush.num_planes)
2619 Host_Error("Mod_Q1BSP_LoadFaces: invalid plane index %i (model has %i planes)", planenum, loadmodel->brush.num_planes);
2621 surface->lightmapinfo->texinfo = loadmodel->brushq1.texinfo + texinfoindex;
2622 surface->texture = loadmodel->data_textures + surface->lightmapinfo->texinfo->textureindex;
2624 // Q2BSP doesn't use lightmaps on sky or warped surfaces (water), but still has a lightofs of 0
2625 if (lightmapoffset == 0 && (surface->texture->q2flags & (Q2SURF_SKY | Q2SURF_WARP)))
2626 lightmapoffset = -1;
2628 //surface->flags = surface->texture->flags;
2629 //if (LittleShort(in->side))
2630 // surface->flags |= SURF_PLANEBACK;
2631 //surface->plane = loadmodel->brush.data_planes + planenum;
2633 surface->num_firstvertex = totalverts;
2634 surface->num_vertices = numedges;
2635 surface->num_firsttriangle = totaltris;
2636 surface->num_triangles = numedges - 2;
2637 totalverts += numedges;
2638 totaltris += numedges - 2;
2640 // convert edges back to a normal polygon
2641 for (i = 0;i < surface->num_vertices;i++)
2643 int lindex = loadmodel->brushq1.surfedges[firstedge + i];
2645 // note: the q1bsp format does not allow a 0 surfedge (it would have no negative counterpart)
2647 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[lindex].v[0]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2649 VectorCopy(loadmodel->brushq1.vertexes[loadmodel->brushq1.edges[-lindex].v[1]].position, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3);
2650 s = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2651 t = DotProduct(((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2652 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 0] = s / surface->texture->width;
2653 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * surface->num_firstvertex)[i * 2 + 1] = t / surface->texture->height;
2654 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = 0;
2655 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = 0;
2656 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = 0;
2659 for (i = 0;i < surface->num_triangles;i++)
2661 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 0] = 0 + surface->num_firstvertex;
2662 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 1] = i + 1 + surface->num_firstvertex;
2663 (loadmodel->surfmesh.data_element3i + 3 * surface->num_firsttriangle)[i * 3 + 2] = i + 2 + surface->num_firstvertex;
2666 // compile additional data about the surface geometry
2667 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);
2668 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);
2669 BoxFromPoints(surface->mins, surface->maxs, surface->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex));
2671 // generate surface extents information
2672 texmins[0] = texmaxs[0] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[0]) + surface->lightmapinfo->texinfo->vecs[0][3];
2673 texmins[1] = texmaxs[1] = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex), surface->lightmapinfo->texinfo->vecs[1]) + surface->lightmapinfo->texinfo->vecs[1][3];
2674 for (i = 1;i < surface->num_vertices;i++)
2676 for (j = 0;j < 2;j++)
2678 val = DotProduct((loadmodel->surfmesh.data_vertex3f + 3 * surface->num_firstvertex) + i * 3, surface->lightmapinfo->texinfo->vecs[j]) + surface->lightmapinfo->texinfo->vecs[j][3];
2679 texmins[j] = min(texmins[j], val);
2680 texmaxs[j] = max(texmaxs[j], val);
2683 for (i = 0;i < 2;i++)
2685 surface->lightmapinfo->texturemins[i] = (int) floor(texmins[i] / 16.0) * 16;
2686 surface->lightmapinfo->extents[i] = (int) ceil(texmaxs[i] / 16.0) * 16 - surface->lightmapinfo->texturemins[i];
2689 smax = surface->lightmapinfo->extents[0] >> 4;
2690 tmax = surface->lightmapinfo->extents[1] >> 4;
2691 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2692 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2695 surface->lightmaptexture = NULL;
2696 surface->deluxemaptexture = r_texture_blanknormalmap;
2697 if (lightmapoffset == -1)
2699 surface->lightmapinfo->samples = NULL;
2701 // give non-lightmapped water a 1x white lightmap
2702 if (!loadmodel->brush.isq2bsp && surface->texture->name[0] == '*' && (surface->lightmapinfo->texinfo->q1flags & TEX_SPECIAL) && ssize <= 256 && tsize <= 256)
2704 surface->lightmapinfo->samples = (unsigned char *)Mem_Alloc(loadmodel->mempool, ssize * tsize * 3);
2705 surface->lightmapinfo->styles[0] = 0;
2706 memset(surface->lightmapinfo->samples, 128, ssize * tsize * 3);
2710 else if (loadmodel->brush.ishlbsp || loadmodel->brush.isq2bsp) // LordHavoc: HalfLife map (bsp version 30)
2711 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + lightmapoffset;
2712 else // LordHavoc: white lighting (bsp version 29)
2714 surface->lightmapinfo->samples = loadmodel->brushq1.lightdata + (lightmapoffset * 3);
2715 if (loadmodel->brushq1.nmaplightdata)
2716 surface->lightmapinfo->nmapsamples = loadmodel->brushq1.nmaplightdata + (lightmapoffset * 3);
2719 // check if we should apply a lightmap to this
2720 if (!(surface->lightmapinfo->texinfo->q1flags & TEX_SPECIAL) || surface->lightmapinfo->samples)
2722 if (ssize > 256 || tsize > 256)
2723 Host_Error("Bad surface extents");
2725 if (lightmapsize < ssize)
2726 lightmapsize = ssize;
2727 if (lightmapsize < tsize)
2728 lightmapsize = tsize;
2730 totallightmapsamples += ssize*tsize;
2732 // force lightmap upload on first time seeing the surface
2734 // additionally this is used by the later code to see if a
2735 // lightmap is needed on this surface (rather than duplicating the
2737 loadmodel->brushq1.lightmapupdateflags[surfacenum] = true;
2738 loadmodel->lit = true;
2742 // small maps (such as ammo boxes especially) don't need big lightmap
2743 // textures, so this code tries to guess a good size based on
2744 // totallightmapsamples (size of the lightmaps lump basically), as well as
2745 // trying to max out the size if there is a lot of lightmap data to store
2746 // additionally, never choose a lightmapsize that is smaller than the
2747 // largest surface encountered (as it would fail)
2749 for (lightmapsize = 64; (lightmapsize < i) && (lightmapsize < bound(128, gl_max_lightmapsize.integer, (int)vid.maxtexturesize_2d)) && (totallightmapsamples > lightmapsize*lightmapsize); lightmapsize*=2)
2752 // now that we've decided the lightmap texture size, we can do the rest
2753 if (cls.state != ca_dedicated)
2755 int stainmapsize = 0;
2756 mod_alloclightmap_state_t allocState;
2758 Mod_AllocLightmap_Init(&allocState, loadmodel->mempool, lightmapsize, lightmapsize);
2759 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2761 int iu, iv, lightmapx = 0, lightmapy = 0;
2762 float u, v, ubase, vbase, uscale, vscale;
2764 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2767 smax = surface->lightmapinfo->extents[0] >> 4;
2768 tmax = surface->lightmapinfo->extents[1] >> 4;
2769 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2770 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2771 stainmapsize += ssize * tsize * 3;
2773 if (!lightmaptexture || !Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy))
2775 // allocate a texture pool if we need it
2776 if (loadmodel->texturepool == NULL)
2777 loadmodel->texturepool = R_AllocTexturePool();
2778 // could not find room, make a new lightmap
2779 loadmodel->brushq3.num_mergedlightmaps = lightmapnumber + 1;
2780 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_lightmaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_lightmaps[0]));
2781 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Realloc(loadmodel->mempool, loadmodel->brushq3.data_deluxemaps, loadmodel->brushq3.num_mergedlightmaps * sizeof(loadmodel->brushq3.data_deluxemaps[0]));
2782 loadmodel->brushq3.data_lightmaps[lightmapnumber] = lightmaptexture = R_LoadTexture2D(loadmodel->texturepool, va(vabuf, sizeof(vabuf), "lightmap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_ALLOWUPDATES, -1, NULL);
2783 if (loadmodel->brushq1.nmaplightdata)
2784 loadmodel->brushq3.data_deluxemaps[lightmapnumber] = deluxemaptexture = R_LoadTexture2D(loadmodel->texturepool, va(vabuf, sizeof(vabuf), "deluxemap%i", lightmapnumber), lightmapsize, lightmapsize, NULL, TEXTYPE_BGRA, TEXF_FORCELINEAR | TEXF_ALLOWUPDATES, -1, NULL);
2786 Mod_AllocLightmap_Reset(&allocState);
2787 Mod_AllocLightmap_Block(&allocState, ssize, tsize, &lightmapx, &lightmapy);
2789 surface->lightmaptexture = lightmaptexture;
2790 surface->deluxemaptexture = deluxemaptexture;
2791 surface->lightmapinfo->lightmaporigin[0] = lightmapx;
2792 surface->lightmapinfo->lightmaporigin[1] = lightmapy;
2794 uscale = 1.0f / (float)lightmapsize;
2795 vscale = 1.0f / (float)lightmapsize;
2796 ubase = lightmapx * uscale;
2797 vbase = lightmapy * vscale;
2799 for (i = 0;i < surface->num_vertices;i++)
2801 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);
2802 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);
2803 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 0] = u * uscale + ubase;
2804 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * surface->num_firstvertex)[i * 2 + 1] = v * vscale + vbase;
2805 // LordHavoc: calc lightmap data offset for vertex lighting to use
2808 (loadmodel->surfmesh.data_lightmapoffsets + surface->num_firstvertex)[i] = (bound(0, iv, tmax) * ssize + bound(0, iu, smax)) * 3;
2812 if (cl_stainmaps.integer)
2814 // allocate stainmaps for permanent marks on walls and clear white
2815 unsigned char *stainsamples = NULL;
2816 stainsamples = (unsigned char *)Mem_Alloc(loadmodel->mempool, stainmapsize);
2817 memset(stainsamples, 255, stainmapsize);
2819 for (surfacenum = 0, surface = loadmodel->data_surfaces;surfacenum < count;surfacenum++, surface++)
2821 if (!loadmodel->brushq1.lightmapupdateflags[surfacenum])
2823 ssize = (surface->lightmapinfo->extents[0] >> 4) + 1;
2824 tsize = (surface->lightmapinfo->extents[1] >> 4) + 1;
2825 surface->lightmapinfo->stainsamples = stainsamples;
2826 stainsamples += ssize * tsize * 3;
2831 // generate ushort elements array if possible
2832 if (loadmodel->surfmesh.data_element3s)
2833 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
2834 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
2837 static void Mod_Q1BSP_LoadNodes_RecursiveSetParent(mnode_t *node, mnode_t *parent)
2840 // Host_Error("Mod_Q1BSP_LoadNodes_RecursiveSetParent: runaway recursion");
2841 node->parent = parent;
2844 // this is a node, recurse to children
2845 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[0], node);
2846 Mod_Q1BSP_LoadNodes_RecursiveSetParent(node->children[1], node);
2847 // combine supercontents of children
2848 node->combinedsupercontents = node->children[0]->combinedsupercontents | node->children[1]->combinedsupercontents;
2853 mleaf_t *leaf = (mleaf_t *)node;
2854 // if this is a leaf, calculate supercontents mask from all collidable
2855 // primitives in the leaf (brushes and collision surfaces)
2856 // also flag if the leaf contains any collision surfaces
2857 leaf->combinedsupercontents = 0;
2858 // combine the supercontents values of all brushes in this leaf
2859 for (j = 0;j < leaf->numleafbrushes;j++)
2860 leaf->combinedsupercontents |= loadmodel->brush.data_brushes[leaf->firstleafbrush[j]].texture->supercontents;
2861 // check if this leaf contains any collision surfaces (q3 patches)
2862 for (j = 0;j < leaf->numleafsurfaces;j++)
2864 msurface_t *surface = loadmodel->data_surfaces + leaf->firstleafsurface[j];
2865 if (surface->num_collisiontriangles)
2867 leaf->containscollisionsurfaces = true;
2868 leaf->combinedsupercontents |= surface->texture->supercontents;
2874 static void Mod_Q1BSP_LoadNodes(sizebuf_t *sb)
2876 int i, j, count, p, child[2];
2878 int structsize = loadmodel->brush.isbsp2rmqe ? 32 : (loadmodel->brush.isbsp2 ? 44 : 24);
2880 if (sb->cursize % structsize)
2881 Host_Error("Mod_Q1BSP_LoadNodes: funny lump size in %s",loadmodel->name);
2882 count = sb->cursize / structsize;
2884 Host_Error("Mod_Q1BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
2885 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2887 loadmodel->brush.data_nodes = out;
2888 loadmodel->brush.num_nodes = count;
2890 for ( i=0 ; i<count ; i++, out++)
2892 p = MSG_ReadLittleLong(sb);
2893 out->plane = loadmodel->brush.data_planes + p;
2895 if (loadmodel->brush.isbsp2rmqe)
2897 child[0] = MSG_ReadLittleLong(sb);
2898 child[1] = MSG_ReadLittleLong(sb);
2899 out->mins[0] = MSG_ReadLittleShort(sb);
2900 out->mins[1] = MSG_ReadLittleShort(sb);
2901 out->mins[2] = MSG_ReadLittleShort(sb);
2902 out->maxs[0] = MSG_ReadLittleShort(sb);
2903 out->maxs[1] = MSG_ReadLittleShort(sb);
2904 out->maxs[2] = MSG_ReadLittleShort(sb);
2905 out->firstsurface = MSG_ReadLittleLong(sb);
2906 out->numsurfaces = MSG_ReadLittleLong(sb);
2908 else if (loadmodel->brush.isbsp2)
2910 child[0] = MSG_ReadLittleLong(sb);
2911 child[1] = MSG_ReadLittleLong(sb);
2912 out->mins[0] = MSG_ReadLittleFloat(sb);
2913 out->mins[1] = MSG_ReadLittleFloat(sb);
2914 out->mins[2] = MSG_ReadLittleFloat(sb);
2915 out->maxs[0] = MSG_ReadLittleFloat(sb);
2916 out->maxs[1] = MSG_ReadLittleFloat(sb);
2917 out->maxs[2] = MSG_ReadLittleFloat(sb);
2918 out->firstsurface = MSG_ReadLittleLong(sb);
2919 out->numsurfaces = MSG_ReadLittleLong(sb);
2923 child[0] = (unsigned short)MSG_ReadLittleShort(sb);
2924 child[1] = (unsigned short)MSG_ReadLittleShort(sb);
2925 if (child[0] >= count)
2927 if (child[1] >= count)
2930 out->mins[0] = MSG_ReadLittleShort(sb);
2931 out->mins[1] = MSG_ReadLittleShort(sb);
2932 out->mins[2] = MSG_ReadLittleShort(sb);
2933 out->maxs[0] = MSG_ReadLittleShort(sb);
2934 out->maxs[1] = MSG_ReadLittleShort(sb);
2935 out->maxs[2] = MSG_ReadLittleShort(sb);
2937 out->firstsurface = (unsigned short)MSG_ReadLittleShort(sb);
2938 out->numsurfaces = (unsigned short)MSG_ReadLittleShort(sb);
2941 for (j=0 ; j<2 ; j++)
2943 // LordHavoc: this code supports broken bsp files produced by
2944 // arguire qbsp which can produce more than 32768 nodes, any value
2945 // below count is assumed to be a node number, any other value is
2946 // assumed to be a leaf number
2950 if (p < loadmodel->brush.num_nodes)
2951 out->children[j] = loadmodel->brush.data_nodes + p;
2954 Con_Printf("Mod_Q1BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
2955 // map it to the solid leaf
2956 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2961 // get leaf index as a positive value starting at 0 (-1 becomes 0, -2 becomes 1, etc)
2963 if (p < loadmodel->brush.num_leafs)
2964 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
2967 Con_Printf("Mod_Q1BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
2968 // map it to the solid leaf
2969 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
2975 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
2978 static void Mod_Q1BSP_LoadLeafs(sizebuf_t *sb)
2981 int i, j, count, p, firstmarksurface, nummarksurfaces;
2982 int structsize = loadmodel->brush.isbsp2rmqe ? 32 : (loadmodel->brush.isbsp2 ? 44 : 28);
2984 if (sb->cursize % structsize)
2985 Host_Error("Mod_Q1BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
2986 count = sb->cursize / structsize;
2987 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
2989 loadmodel->brush.data_leafs = out;
2990 loadmodel->brush.num_leafs = count;
2991 // get visleafs from the submodel data
2992 loadmodel->brush.num_pvsclusters = loadmodel->brushq1.submodels[0].visleafs;
2993 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters+7)>>3;
2994 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2995 memset(loadmodel->brush.data_pvsclusters, 0xFF, loadmodel->brush.num_pvsclusters * loadmodel->brush.num_pvsclusterbytes);
2997 // FIXME: this function could really benefit from some error checking
2998 for ( i=0 ; i<count ; i++, out++)
3000 out->contents = MSG_ReadLittleLong(sb);
3002 out->clusterindex = i - 1;
3003 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
3004 out->clusterindex = -1;
3006 p = MSG_ReadLittleLong(sb);
3007 // ignore visofs errors on leaf 0 (solid)
3008 if (p >= 0 && out->clusterindex >= 0)
3010 if (p >= loadmodel->brushq1.num_compressedpvs)
3011 Con_Print("Mod_Q1BSP_LoadLeafs: invalid visofs\n");
3013 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);
3016 if (loadmodel->brush.isbsp2rmqe)
3018 out->mins[0] = MSG_ReadLittleShort(sb);
3019 out->mins[1] = MSG_ReadLittleShort(sb);
3020 out->mins[2] = MSG_ReadLittleShort(sb);
3021 out->maxs[0] = MSG_ReadLittleShort(sb);
3022 out->maxs[1] = MSG_ReadLittleShort(sb);
3023 out->maxs[2] = MSG_ReadLittleShort(sb);
3025 firstmarksurface = MSG_ReadLittleLong(sb);
3026 nummarksurfaces = MSG_ReadLittleLong(sb);
3028 else if (loadmodel->brush.isbsp2)
3030 out->mins[0] = MSG_ReadLittleFloat(sb);
3031 out->mins[1] = MSG_ReadLittleFloat(sb);
3032 out->mins[2] = MSG_ReadLittleFloat(sb);
3033 out->maxs[0] = MSG_ReadLittleFloat(sb);
3034 out->maxs[1] = MSG_ReadLittleFloat(sb);
3035 out->maxs[2] = MSG_ReadLittleFloat(sb);
3037 firstmarksurface = MSG_ReadLittleLong(sb);
3038 nummarksurfaces = MSG_ReadLittleLong(sb);
3042 out->mins[0] = MSG_ReadLittleShort(sb);
3043 out->mins[1] = MSG_ReadLittleShort(sb);
3044 out->mins[2] = MSG_ReadLittleShort(sb);
3045 out->maxs[0] = MSG_ReadLittleShort(sb);
3046 out->maxs[1] = MSG_ReadLittleShort(sb);
3047 out->maxs[2] = MSG_ReadLittleShort(sb);
3049 firstmarksurface = (unsigned short)MSG_ReadLittleShort(sb);
3050 nummarksurfaces = (unsigned short)MSG_ReadLittleShort(sb);
3053 if (firstmarksurface >= 0 && firstmarksurface + nummarksurfaces <= loadmodel->brush.num_leafsurfaces)
3055 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + firstmarksurface;
3056 out->numleafsurfaces = nummarksurfaces;
3060 Con_Printf("Mod_Q1BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", firstmarksurface, firstmarksurface+nummarksurfaces, 0, loadmodel->brush.num_leafsurfaces);
3061 out->firstleafsurface = NULL;
3062 out->numleafsurfaces = 0;
3065 for (j = 0;j < 4;j++)
3066 out->ambient_sound_level[j] = MSG_ReadByte(sb);
3070 static qboolean Mod_Q1BSP_CheckWaterAlphaSupport(void)
3074 const unsigned char *pvs;
3075 // if there's no vis data, assume supported (because everything is visible all the time)
3076 if (!loadmodel->brush.data_pvsclusters)
3078 // check all liquid leafs to see if they can see into empty leafs, if any
3079 // can we can assume this map supports r_wateralpha
3080 for (i = 0, leaf = loadmodel->brush.data_leafs;i < loadmodel->brush.num_leafs;i++, leaf++)
3082 if ((leaf->contents == CONTENTS_WATER || leaf->contents == CONTENTS_SLIME) && leaf->clusterindex >= 0)
3084 pvs = loadmodel->brush.data_pvsclusters + leaf->clusterindex * loadmodel->brush.num_pvsclusterbytes;
3085 for (j = 0;j < loadmodel->brush.num_leafs;j++)
3086 if (CHECKPVSBIT(pvs, loadmodel->brush.data_leafs[j].clusterindex) && loadmodel->brush.data_leafs[j].contents == CONTENTS_EMPTY)
3093 static void Mod_Q1BSP_LoadClipnodes(sizebuf_t *sb, hullinfo_t *hullinfo)
3098 int structsize = loadmodel->brush.isbsp2 ? 12 : 8;
3100 if (sb->cursize % structsize)
3101 Host_Error("Mod_Q1BSP_LoadClipnodes: funny lump size in %s",loadmodel->name);
3102 count = sb->cursize / structsize;
3103 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
3105 loadmodel->brushq1.clipnodes = out;
3106 loadmodel->brushq1.numclipnodes = count;
3108 for (i = 1; i < MAX_MAP_HULLS; i++)
3110 hull = &loadmodel->brushq1.hulls[i];
3111 hull->clipnodes = out;
3112 hull->firstclipnode = 0;
3113 hull->lastclipnode = count-1;
3114 hull->planes = loadmodel->brush.data_planes;
3115 hull->clip_mins[0] = hullinfo->hullsizes[i][0][0];
3116 hull->clip_mins[1] = hullinfo->hullsizes[i][0][1];
3117 hull->clip_mins[2] = hullinfo->hullsizes[i][0][2];
3118 hull->clip_maxs[0] = hullinfo->hullsizes[i][1][0];
3119 hull->clip_maxs[1] = hullinfo->hullsizes[i][1][1];
3120 hull->clip_maxs[2] = hullinfo->hullsizes[i][1][2];
3121 VectorSubtract(hull->clip_maxs, hull->clip_mins, hull->clip_size);
3124 for (i=0 ; i<count ; i++, out++)
3126 out->planenum = MSG_ReadLittleLong(sb);
3127 if (out->planenum < 0 || out->planenum >= loadmodel->brush.num_planes)
3128 Host_Error("%s: Corrupt clipping hull(out of range planenum)", loadmodel->name);
3129 if (loadmodel->brush.isbsp2)
3131 out->children[0] = MSG_ReadLittleLong(sb);
3132 out->children[1] = MSG_ReadLittleLong(sb);
3133 if (out->children[0] >= count)
3134 Host_Error("%s: Corrupt clipping hull (invalid child index)", loadmodel->name);
3135 if (out->children[1] >= count)
3136 Host_Error("%s: Corrupt clipping hull (invalid child index)", loadmodel->name);
3140 // LordHavoc: this code supports arguire qbsp's broken clipnodes indices (more than 32768 clipnodes), values above count are assumed to be contents values
3141 out->children[0] = (unsigned short)MSG_ReadLittleShort(sb);
3142 out->children[1] = (unsigned short)MSG_ReadLittleShort(sb);
3143 if (out->children[0] >= count)
3144 out->children[0] -= 65536;
3145 if (out->children[1] >= count)
3146 out->children[1] -= 65536;
3151 //Duplicate the drawing hull structure as a clipping hull
3152 static void Mod_Q1BSP_MakeHull0(void)
3159 hull = &loadmodel->brushq1.hulls[0];
3161 in = loadmodel->brush.data_nodes;
3162 out = (mclipnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_nodes * sizeof(*out));
3164 hull->clipnodes = out;
3165 hull->firstclipnode = 0;
3166 hull->lastclipnode = loadmodel->brush.num_nodes - 1;
3167 hull->planes = loadmodel->brush.data_planes;
3169 for (i = 0;i < loadmodel->brush.num_nodes;i++, out++, in++)
3171 out->planenum = in->plane - loadmodel->brush.data_planes;
3172 out->children[0] = in->children[0]->plane ? in->children[0] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[0])->contents;
3173 out->children[1] = in->children[1]->plane ? in->children[1] - loadmodel->brush.data_nodes : ((mleaf_t *)in->children[1])->contents;
3177 static void Mod_Q1BSP_LoadLeaffaces(sizebuf_t *sb)
3180 int structsize = loadmodel->brush.isbsp2 ? 4 : 2;
3182 if (sb->cursize % structsize)
3183 Host_Error("Mod_Q1BSP_LoadLeaffaces: funny lump size in %s",loadmodel->name);
3184 loadmodel->brush.num_leafsurfaces = sb->cursize / structsize;
3185 loadmodel->brush.data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafsurfaces * sizeof(int));
3187 if (loadmodel->brush.isbsp2)
3189 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
3191 j = MSG_ReadLittleLong(sb);
3192 if (j < 0 || j >= loadmodel->num_surfaces)
3193 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
3194 loadmodel->brush.data_leafsurfaces[i] = j;
3199 for (i = 0;i < loadmodel->brush.num_leafsurfaces;i++)
3201 j = (unsigned short) MSG_ReadLittleShort(sb);
3202 if (j >= loadmodel->num_surfaces)
3203 Host_Error("Mod_Q1BSP_LoadLeaffaces: bad surface number");
3204 loadmodel->brush.data_leafsurfaces[i] = j;
3209 static void Mod_Q1BSP_LoadSurfedges(sizebuf_t *sb)
3214 if (sb->cursize % structsize)
3215 Host_Error("Mod_Q1BSP_LoadSurfedges: funny lump size in %s",loadmodel->name);
3216 loadmodel->brushq1.numsurfedges = sb->cursize / structsize;
3217 loadmodel->brushq1.surfedges = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brushq1.numsurfedges * sizeof(int));
3219 for (i = 0;i < loadmodel->brushq1.numsurfedges;i++)
3220 loadmodel->brushq1.surfedges[i] = MSG_ReadLittleLong(sb);
3224 static void Mod_Q1BSP_LoadPlanes(sizebuf_t *sb)
3228 int structsize = 20;
3230 if (sb->cursize % structsize)
3231 Host_Error("Mod_Q1BSP_LoadPlanes: funny lump size in %s", loadmodel->name);
3232 loadmodel->brush.num_planes = sb->cursize / structsize;
3233 loadmodel->brush.data_planes = out = (mplane_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_planes * sizeof(*out));
3235 for (i = 0;i < loadmodel->brush.num_planes;i++, out++)
3237 out->normal[0] = MSG_ReadLittleFloat(sb);
3238 out->normal[1] = MSG_ReadLittleFloat(sb);
3239 out->normal[2] = MSG_ReadLittleFloat(sb);
3240 out->dist = MSG_ReadLittleFloat(sb);
3241 MSG_ReadLittleLong(sb); // type is not used, we use PlaneClassify
3246 // fixes up sky surfaces that have SKY contents behind them, so that they do not cast shadows (e1m5 logo shadow trick).
3247 static void Mod_Q1BSP_AssignNoShadowSkySurfaces(dp_model_t *mod)
3250 msurface_t *surface;
3253 for (i = 0, surface = mod->data_surfaces + mod->firstmodelsurface; i < mod->nummodelsurfaces; i++, surface++)
3255 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
3257 // check if the point behind the surface polygon is SOLID or SKY contents
3258 VectorMAMAM(0.5f, surface->mins, 0.5f, surface->maxs, -0.25f, mod->surfmesh.data_normal3f + 3*surface->num_firstvertex, center);
3259 contents = Mod_Q1BSP_PointSuperContents(mod, 0, center);
3260 if (!(contents & SUPERCONTENTS_SOLID))
3261 surface->texture = surface->texture->skynoshadowtexture;
3266 static void Mod_Q1BSP_LoadMapBrushes(void)
3270 int submodel, numbrushes;
3271 qboolean firstbrush;
3272 char *text, *maptext;
3273 char mapfilename[MAX_QPATH];
3274 FS_StripExtension (loadmodel->name, mapfilename, sizeof (mapfilename));
3275 strlcat (mapfilename, ".map", sizeof (mapfilename));
3276 maptext = (unsigned char*) FS_LoadFile(mapfilename, tempmempool, false, NULL);
3280 if (!COM_ParseToken_Simple(&data, false, false, true))
3285 if (!COM_ParseToken_Simple(&data, false, false, true))
3287 if (com_token[0] != '{')
3293 brushes = Mem_Alloc(loadmodel->mempool, maxbrushes * sizeof(mbrush_t));
3296 if (!COM_ParseToken_Simple(&data, false, false, true))
3298 if (com_token[0] == '}')
3299 break; // end of entity
3300 if (com_token[0] == '{')
3307 if (submodel > loadmodel->brush.numsubmodels)
3309 Con_Printf("Mod_Q1BSP_LoadMapBrushes: .map has more submodels than .bsp!\n");
3313 model = loadmodel->brush.submodels[submodel];
3320 if (!COM_ParseToken_Simple(&data, false, false, true))
3322 if (com_token[0] == '}')
3323 break; // end of brush
3324 // each brush face should be this format:
3325 // ( x y z ) ( x y z ) ( x y z ) texture scroll_s scroll_t rotateangle scale_s scale_t
3326 // FIXME: support hl .map format
3327 for (pointnum = 0;pointnum < 3;pointnum++)
3329 COM_ParseToken_Simple(&data, false, false, true);
3330 for (componentnum = 0;componentnum < 3;componentnum++)
3332 COM_ParseToken_Simple(&data, false, false, true);
3333 point[pointnum][componentnum] = atof(com_token);
3335 COM_ParseToken_Simple(&data, false, false, true);
3337 COM_ParseToken_Simple(&data, false, false, true);
3338 strlcpy(facetexture, com_token, sizeof(facetexture));
3339 COM_ParseToken_Simple(&data, false, false, true);
3340 //scroll_s = atof(com_token);
3341 COM_ParseToken_Simple(&data, false, false, true);
3342 //scroll_t = atof(com_token);
3343 COM_ParseToken_Simple(&data, false, false, true);
3344 //rotate = atof(com_token);
3345 COM_ParseToken_Simple(&data, false, false, true);
3346 //scale_s = atof(com_token);
3347 COM_ParseToken_Simple(&data, false, false, true);
3348 //scale_t = atof(com_token);
3349 TriangleNormal(point[0], point[1], point[2], planenormal);
3350 VectorNormalizeDouble(planenormal);
3351 planedist = DotProduct(point[0], planenormal);
3352 //ChooseTexturePlane(planenormal, texturevector[0], texturevector[1]);
3362 #define MAX_PORTALPOINTS 64
3364 typedef struct portal_s
3367 mnode_t *nodes[2]; // [0] = front side of plane
3368 struct portal_s *next[2];
3370 double points[3*MAX_PORTALPOINTS];
3371 struct portal_s *chain; // all portals are linked into a list
3375 static memexpandablearray_t portalarray;
3377 static void Mod_Q1BSP_RecursiveRecalcNodeBBox(mnode_t *node)
3379 // process only nodes (leafs already had their box calculated)
3383 // calculate children first
3384 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[0]);
3385 Mod_Q1BSP_RecursiveRecalcNodeBBox(node->children[1]);
3387 // make combined bounding box from children
3388 node->mins[0] = min(node->children[0]->mins[0], node->children[1]->mins[0]);
3389 node->mins[1] = min(node->children[0]->mins[1], node->children[1]->mins[1]);
3390 node->mins[2] = min(node->children[0]->mins[2], node->children[1]->mins[2]);
3391 node->maxs[0] = max(node->children[0]->maxs[0], node->children[1]->maxs[0]);
3392 node->maxs[1] = max(node->children[0]->maxs[1], node->children[1]->maxs[1]);
3393 node->maxs[2] = max(node->children[0]->maxs[2], node->children[1]->maxs[2]);
3396 static void Mod_Q1BSP_FinalizePortals(void)
3398 int i, j, numportals, numpoints, portalindex, portalrange = (int)Mem_ExpandableArray_IndexRange(&portalarray);
3402 mleaf_t *leaf, *endleaf;
3404 // tally up portal and point counts and recalculate bounding boxes for all
3405 // leafs (because qbsp is very sloppy)
3406 leaf = loadmodel->brush.data_leafs;
3407 endleaf = leaf + loadmodel->brush.num_leafs;
3408 if (mod_recalculatenodeboxes.integer)
3410 for (;leaf < endleaf;leaf++)
3412 VectorSet(leaf->mins, 2000000000, 2000000000, 2000000000);
3413 VectorSet(leaf->maxs, -2000000000, -2000000000, -2000000000);
3418 for (portalindex = 0;portalindex < portalrange;portalindex++)
3420 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3423 // note: this check must match the one below or it will usually corrupt memory
3424 // 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
3425 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1] && ((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3428 numpoints += p->numpoints * 2;
3431 loadmodel->brush.data_portals = (mportal_t *)Mem_Alloc(loadmodel->mempool, numportals * sizeof(mportal_t) + numpoints * sizeof(mvertex_t));
3432 loadmodel->brush.num_portals = numportals;
3433 loadmodel->brush.data_portalpoints = (mvertex_t *)((unsigned char *) loadmodel->brush.data_portals + numportals * sizeof(mportal_t));
3434 loadmodel->brush.num_portalpoints = numpoints;
3435 // clear all leaf portal chains
3436 for (i = 0;i < loadmodel->brush.num_leafs;i++)
3437 loadmodel->brush.data_leafs[i].portals = NULL;
3438 // process all portals in the global portal chain, while freeing them
3439 portal = loadmodel->brush.data_portals;
3440 point = loadmodel->brush.data_portalpoints;
3441 for (portalindex = 0;portalindex < portalrange;portalindex++)
3443 p = (portal_t*)Mem_ExpandableArray_RecordAtIndex(&portalarray, portalindex);
3446 if (p->numpoints >= 3 && p->nodes[0] != p->nodes[1])
3448 // note: this check must match the one above or it will usually corrupt memory
3449 // 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
3450 if (((mleaf_t *)p->nodes[0])->clusterindex >= 0 && ((mleaf_t *)p->nodes[1])->clusterindex >= 0)
3452 // first make the back to front portal(forward portal)
3453 portal->points = point;
3454 portal->numpoints = p->numpoints;
3455 portal->plane.dist = p->plane.dist;
3456 VectorCopy(p->plane.normal, portal->plane.normal);
3457 portal->here = (mleaf_t *)p->nodes[1];
3458 portal->past = (mleaf_t *)p->nodes[0];
3460 for (j = 0;j < portal->numpoints;j++)
3462 VectorCopy(p->points + j*3, point->position);
3465 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3466 PlaneClassify(&portal->plane);
3468 // link into leaf's portal chain
3469 portal->next = portal->here->portals;
3470 portal->here->portals = portal;
3472 // advance to next portal
3475 // then make the front to back portal(backward portal)
3476 portal->points = point;
3477 portal->numpoints = p->numpoints;
3478 portal->plane.dist = -p->plane.dist;
3479 VectorNegate(p->plane.normal, portal->plane.normal);
3480 portal->here = (mleaf_t *)p->nodes[0];
3481 portal->past = (mleaf_t *)p->nodes[1];
3483 for (j = portal->numpoints - 1;j >= 0;j--)
3485 VectorCopy(p->points + j*3, point->position);
3488 BoxFromPoints(portal->mins, portal->maxs, portal->numpoints, portal->points->position);
3489 PlaneClassify(&portal->plane);
3491 // link into leaf's portal chain
3492 portal->next = portal->here->portals;
3493 portal->here->portals = portal;
3495 // advance to next portal
3498 // add the portal's polygon points to the leaf bounding boxes
3499 if (mod_recalculatenodeboxes.integer)
3501 for (i = 0;i < 2;i++)
3503 leaf = (mleaf_t *)p->nodes[i];
3504 for (j = 0;j < p->numpoints;j++)
3506 if (leaf->mins[0] > p->points[j*3+0]) leaf->mins[0] = p->points[j*3+0];
3507 if (leaf->mins[1] > p->points[j*3+1]) leaf->mins[1] = p->points[j*3+1];
3508 if (leaf->mins[2] > p->points[j*3+2]) leaf->mins[2] = p->points[j*3+2];
3509 if (leaf->maxs[0] < p->points[j*3+0]) leaf->maxs[0] = p->points[j*3+0];
3510 if (leaf->maxs[1] < p->points[j*3+1]) leaf->maxs[1] = p->points[j*3+1];
3511 if (leaf->maxs[2] < p->points[j*3+2]) leaf->maxs[2] = p->points[j*3+2];
3517 // now recalculate the node bounding boxes from the leafs
3518 if (mod_recalculatenodeboxes.integer)
3519 Mod_Q1BSP_RecursiveRecalcNodeBBox(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3527 static void AddPortalToNodes(portal_t *p, mnode_t *front, mnode_t *back)
3530 Host_Error("AddPortalToNodes: NULL front node");
3532 Host_Error("AddPortalToNodes: NULL back node");
3533 if (p->nodes[0] || p->nodes[1])
3534 Host_Error("AddPortalToNodes: already included");
3535 // 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
3537 p->nodes[0] = front;
3538 p->next[0] = (portal_t *)front->portals;
3539 front->portals = (mportal_t *)p;
3542 p->next[1] = (portal_t *)back->portals;
3543 back->portals = (mportal_t *)p;
3548 RemovePortalFromNode
3551 static void RemovePortalFromNodes(portal_t *portal)
3555 void **portalpointer;
3557 for (i = 0;i < 2;i++)
3559 node = portal->nodes[i];
3561 portalpointer = (void **) &node->portals;
3564 t = (portal_t *)*portalpointer;
3566 Host_Error("RemovePortalFromNodes: portal not in leaf");
3570 if (portal->nodes[0] == node)
3572 *portalpointer = portal->next[0];
3573 portal->nodes[0] = NULL;
3575 else if (portal->nodes[1] == node)
3577 *portalpointer = portal->next[1];
3578 portal->nodes[1] = NULL;
3581 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3585 if (t->nodes[0] == node)
3586 portalpointer = (void **) &t->next[0];
3587 else if (t->nodes[1] == node)
3588 portalpointer = (void **) &t->next[1];
3590 Host_Error("RemovePortalFromNodes: portal not bounding leaf");
3595 #define PORTAL_DIST_EPSILON (1.0 / 32.0)
3596 static double *portalpointsbuffer;
3597 static int portalpointsbufferoffset;
3598 static int portalpointsbuffersize;
3599 static void Mod_Q1BSP_RecursiveNodePortals(mnode_t *node)
3602 mnode_t *front, *back, *other_node;
3603 mplane_t clipplane, *plane;
3604 portal_t *portal, *nextportal, *nodeportal, *splitportal, *temp;
3605 int numfrontpoints, numbackpoints;
3606 double *frontpoints, *backpoints;
3608 // if a leaf, we're done
3612 // get some space for our clipping operations to use
3613 if (portalpointsbuffersize < portalpointsbufferoffset + 6*MAX_PORTALPOINTS)
3615 portalpointsbuffersize = portalpointsbufferoffset * 2;
3616 portalpointsbuffer = (double *)Mem_Realloc(loadmodel->mempool, portalpointsbuffer, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3618 frontpoints = portalpointsbuffer + portalpointsbufferoffset;
3619 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3620 backpoints = portalpointsbuffer + portalpointsbufferoffset;
3621 portalpointsbufferoffset += 3*MAX_PORTALPOINTS;
3623 plane = node->plane;
3625 front = node->children[0];
3626 back = node->children[1];
3628 Host_Error("Mod_Q1BSP_RecursiveNodePortals: corrupt node hierarchy");
3630 // create the new portal by generating a polygon for the node plane,
3631 // and clipping it by all of the other portals(which came from nodes above this one)
3632 nodeportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3633 nodeportal->plane = *plane;
3635 // 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)
3636 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);
3637 nodeportal->numpoints = 4;
3638 // side = 0; // shut up compiler warning -> should be no longer needed, Host_Error is declared noreturn now
3639 for (portal = (portal_t *)node->portals;portal;portal = portal->next[side])
3641 clipplane = portal->plane;
3642 if (portal->nodes[0] == portal->nodes[1])
3643 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(1)");
3644 if (portal->nodes[0] == node)
3646 else if (portal->nodes[1] == node)
3648 clipplane.dist = -clipplane.dist;
3649 VectorNegate(clipplane.normal, clipplane.normal);
3654 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3655 side = 0; // hush warning
3658 for (i = 0;i < nodeportal->numpoints*3;i++)
3659 frontpoints[i] = nodeportal->points[i];
3660 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);
3661 if (nodeportal->numpoints <= 0 || nodeportal->numpoints >= MAX_PORTALPOINTS)
3665 if (nodeportal->numpoints < 3)
3667 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal was clipped away\n");
3668 nodeportal->numpoints = 0;
3670 else if (nodeportal->numpoints >= MAX_PORTALPOINTS)
3672 Con_Print("Mod_Q1BSP_RecursiveNodePortals: WARNING: new portal has too many points\n");
3673 nodeportal->numpoints = 0;
3676 AddPortalToNodes(nodeportal, front, back);
3678 // split the portals of this node along this node's plane and assign them to the children of this node
3679 // (migrating the portals downward through the tree)
3680 for (portal = (portal_t *)node->portals;portal;portal = nextportal)
3682 if (portal->nodes[0] == portal->nodes[1])
3683 Host_Error("Mod_Q1BSP_RecursiveNodePortals: portal has same node on both sides(2)");
3684 if (portal->nodes[0] == node)
3686 else if (portal->nodes[1] == node)
3690 Host_Error("Mod_Q1BSP_RecursiveNodePortals: mislinked portal");
3691 side = 0; // hush warning
3693 nextportal = portal->next[side];
3694 if (!portal->numpoints)
3697 other_node = portal->nodes[!side];
3698 RemovePortalFromNodes(portal);
3700 // cut the portal into two portals, one on each side of the node plane
3701 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);
3703 if (!numfrontpoints)
3706 AddPortalToNodes(portal, back, other_node);
3708 AddPortalToNodes(portal, other_node, back);
3714 AddPortalToNodes(portal, front, other_node);
3716 AddPortalToNodes(portal, other_node, front);
3720 // the portal is split
3721 splitportal = (portal_t *)Mem_ExpandableArray_AllocRecord(&portalarray);
3722 temp = splitportal->chain;
3723 *splitportal = *portal;
3724 splitportal->chain = temp;
3725 for (i = 0;i < numbackpoints*3;i++)
3726 splitportal->points[i] = backpoints[i];
3727 splitportal->numpoints = numbackpoints;
3728 for (i = 0;i < numfrontpoints*3;i++)
3729 portal->points[i] = frontpoints[i];
3730 portal->numpoints = numfrontpoints;
3734 AddPortalToNodes(portal, front, other_node);
3735 AddPortalToNodes(splitportal, back, other_node);
3739 AddPortalToNodes(portal, other_node, front);
3740 AddPortalToNodes(splitportal, other_node, back);
3744 Mod_Q1BSP_RecursiveNodePortals(front);
3745 Mod_Q1BSP_RecursiveNodePortals(back);
3747 portalpointsbufferoffset -= 6*MAX_PORTALPOINTS;
3750 static void Mod_Q1BSP_MakePortals(void)
3752 Mem_ExpandableArray_NewArray(&portalarray, loadmodel->mempool, sizeof(portal_t), 1020*1024/sizeof(portal_t));
3753 portalpointsbufferoffset = 0;
3754 portalpointsbuffersize = 6*MAX_PORTALPOINTS*128;
3755 portalpointsbuffer = (double *)Mem_Alloc(loadmodel->mempool, portalpointsbuffersize * sizeof(*portalpointsbuffer));
3756 Mod_Q1BSP_RecursiveNodePortals(loadmodel->brush.data_nodes + loadmodel->brushq1.hulls[0].firstclipnode);
3757 Mem_Free(portalpointsbuffer);
3758 portalpointsbuffer = NULL;
3759 portalpointsbufferoffset = 0;
3760 portalpointsbuffersize = 0;
3761 Mod_Q1BSP_FinalizePortals();
3762 Mem_ExpandableArray_FreeArray(&portalarray);
3765 //Returns PVS data for a given point
3766 //(note: can return NULL)
3767 static unsigned char *Mod_Q1BSP_GetPVS(dp_model_t *model, const vec3_t p)
3770 node = model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode;
3772 node = node->children[(node->plane->type < 3 ? p[node->plane->type] : DotProduct(p,node->plane->normal)) < node->plane->dist];
3773 if (((mleaf_t *)node)->clusterindex >= 0)
3774 return model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3779 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)
3783 float d = PlaneDiff(org, node->plane);
3785 node = node->children[0];
3786 else if (d < -radius)
3787 node = node->children[1];
3790 // go down both sides
3791 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, pvsbytes, node->children[0]);
3792 node = node->children[1];
3795 // if this leaf is in a cluster, accumulate the pvs bits
3796 if (((mleaf_t *)node)->clusterindex >= 0)
3799 unsigned char *pvs = model->brush.data_pvsclusters + ((mleaf_t *)node)->clusterindex * model->brush.num_pvsclusterbytes;
3800 for (i = 0;i < pvsbytes;i++)
3801 pvsbuffer[i] |= pvs[i];
3805 //Calculates a PVS that is the inclusive or of all leafs within radius pixels
3806 //of the given point.
3807 static int Mod_Q1BSP_FatPVS(dp_model_t *model, const vec3_t org, vec_t radius, unsigned char *pvsbuffer, int pvsbufferlength, qboolean merge)
3809 int bytes = model->brush.num_pvsclusterbytes;
3810 bytes = min(bytes, pvsbufferlength);
3811 if (r_novis.integer || r_trippy.integer || !model->brush.num_pvsclusters || !Mod_Q1BSP_GetPVS(model, org))
3813 memset(pvsbuffer, 0xFF, bytes);
3817 memset(pvsbuffer, 0, bytes);
3818 Mod_Q1BSP_FatPVS_RecursiveBSPNode(model, org, radius, pvsbuffer, bytes, model->brush.data_nodes + model->brushq1.hulls[0].firstclipnode);
3822 static void Mod_Q1BSP_RoundUpToHullSize(dp_model_t *cmodel, const vec3_t inmins, const vec3_t inmaxs, vec3_t outmins, vec3_t outmaxs)
3827 VectorSubtract(inmaxs, inmins, size);
3828 if (cmodel->brush.ishlbsp)
3831 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3832 else if (size[0] <= 32)
3834 if (size[2] < 54) // pick the nearest of 36 or 72
3835 hull = &cmodel->brushq1.hulls[3]; // 32x32x36
3837 hull = &cmodel->brushq1.hulls[1]; // 32x32x72
3840 hull = &cmodel->brushq1.hulls[2]; // 64x64x64
3845 hull = &cmodel->brushq1.hulls[0]; // 0x0x0
3846 else if (size[0] <= 32)
3847 hull = &cmodel->brushq1.hulls[1]; // 32x32x56
3849 hull = &cmodel->brushq1.hulls[2]; // 64x64x88
3851 VectorCopy(inmins, outmins);
3852 VectorAdd(inmins, hull->clip_size, outmaxs);
3855 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, int skipsupercontentsmask, int skipmaterialflagsmask);
3857 void Mod_Q1BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
3860 sizebuf_t lumpsb[HEADER_LUMPS];
3862 float dist, modelyawradius, modelradius;
3863 msurface_t *surface;
3864 hullinfo_t hullinfo;
3865 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
3866 model_brush_lightstyleinfo_t styleinfo[256];
3867 unsigned char *datapointer;
3870 MSG_InitReadBuffer(&sb, (unsigned char *)buffer, (unsigned char *)bufferend - (unsigned char *)buffer);
3872 mod->type = mod_brushq1;
3874 mod->brush.ishlbsp = false;
3875 mod->brush.isbsp2rmqe = false;
3876 mod->brush.isbsp2 = false;
3877 mod->brush.isq2bsp = false;
3878 mod->brush.isq3bsp = false;
3879 mod->brush.skymasking = true;
3880 i = MSG_ReadLittleLong(&sb);
3884 mod->modeldatatypestring = "Q1BSP";
3887 mod->brush.ishlbsp = true;
3888 mod->modeldatatypestring = "HLBSP";
3890 case ('2' + 'P' * 256 + 'S' * 65536 + 'B' * 16777216):
3891 mod->brush.isbsp2 = true;
3892 mod->brush.isbsp2rmqe = true; // like bsp2 except leaf/node bounds are 16bit (unexpanded)
3893 mod->modeldatatypestring = "Q1BSP2rmqe";
3895 case ('B' + 'S' * 256 + 'P' * 65536 + '2' * 16777216):
3896 mod->brush.isbsp2 = true;
3897 mod->modeldatatypestring = "Q1BSP2";
3900 mod->modeldatatypestring = "Unknown BSP";
3901 Host_Error("Mod_Q1BSP_Load: %s has wrong version number %i: supported versions are 29 (Quake), 30 (Half-Life), \"BSP2\" or \"2PSB\" (rmqe)", mod->name, i);
3905 // fill in hull info
3906 VectorClear (hullinfo.hullsizes[0][0]);
3907 VectorClear (hullinfo.hullsizes[0][1]);
3908 if (mod->brush.ishlbsp)
3910 hullinfo.filehulls = 4;
3911 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -36);
3912 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 36);
3913 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -32);
3914 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 32);
3915 VectorSet (hullinfo.hullsizes[3][0], -16, -16, -18);
3916 VectorSet (hullinfo.hullsizes[3][1], 16, 16, 18);
3920 hullinfo.filehulls = 4;
3921 VectorSet (hullinfo.hullsizes[1][0], -16, -16, -24);
3922 VectorSet (hullinfo.hullsizes[1][1], 16, 16, 32);
3923 VectorSet (hullinfo.hullsizes[2][0], -32, -32, -24);
3924 VectorSet (hullinfo.hullsizes[2][1], 32, 32, 64);
3928 for (i = 0; i < HEADER_LUMPS; i++)
3930 int offset = MSG_ReadLittleLong(&sb);
3931 int size = MSG_ReadLittleLong(&sb);
3932 if (offset < 0 || offset + size > sb.cursize)
3933 Host_Error("Mod_Q1BSP_Load: %s has invalid lump %i (offset %i, size %i, file size %i)\n", mod->name, i, offset, size, (int)sb.cursize);
3934 MSG_InitReadBuffer(&lumpsb[i], sb.data + offset, size);
3937 mod->soundfromcenter = true;
3938 mod->TraceBox = Mod_Q1BSP_TraceBox;
3939 mod->TraceLine = Mod_Q1BSP_TraceLine;
3940 mod->TracePoint = Mod_Q1BSP_TracePoint;
3941 mod->PointSuperContents = Mod_Q1BSP_PointSuperContents;
3942 mod->TraceLineAgainstSurfaces = Mod_Q1BSP_TraceLineAgainstSurfaces;
3943 mod->brush.TraceLineOfSight = Mod_Q1BSP_TraceLineOfSight;
3944 mod->brush.SuperContentsFromNativeContents = Mod_Q1BSP_SuperContentsFromNativeContents;
3945 mod->brush.NativeContentsFromSuperContents = Mod_Q1BSP_NativeContentsFromSuperContents;
3946 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
3947 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
3948 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
3949 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
3950 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
3951 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
3952 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
3953 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
3954 mod->brush.AmbientSoundLevelsForPoint = Mod_Q1BSP_AmbientSoundLevelsForPoint;
3955 mod->brush.RoundUpToHullSize = Mod_Q1BSP_RoundUpToHullSize;
3956 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
3957 mod->Draw = R_Q1BSP_Draw;
3958 mod->DrawDepth = R_Q1BSP_DrawDepth;
3959 mod->DrawDebug = R_Q1BSP_DrawDebug;
3960 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
3961 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
3962 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
3963 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
3964 mod->DrawLight = R_Q1BSP_DrawLight;
3968 mod->brush.qw_md4sum = 0;
3969 mod->brush.qw_md4sum2 = 0;
3970 for (i = 0;i < HEADER_LUMPS;i++)
3973 if (i == LUMP_ENTITIES)
3975 temp = Com_BlockChecksum(lumpsb[i].data, lumpsb[i].cursize);
3976 mod->brush.qw_md4sum ^= LittleLong(temp);
3977 if (i == LUMP_VISIBILITY || i == LUMP_LEAFS || i == LUMP_NODES)
3979 mod->brush.qw_md4sum2 ^= LittleLong(temp);
3982 Mod_Q1BSP_LoadEntities(&lumpsb[LUMP_ENTITIES]);
3983 Mod_Q1BSP_LoadVertexes(&lumpsb[LUMP_VERTEXES]);
3984 Mod_Q1BSP_LoadEdges(&lumpsb[LUMP_EDGES]);
3985 Mod_Q1BSP_LoadSurfedges(&lumpsb[LUMP_SURFEDGES]);
3986 Mod_Q1BSP_LoadTextures(&lumpsb[LUMP_TEXTURES]);
3987 Mod_Q1BSP_LoadLighting(&lumpsb[LUMP_LIGHTING]);
3988 Mod_Q1BSP_LoadPlanes(&lumpsb[LUMP_PLANES]);
3989 Mod_Q1BSP_LoadTexinfo(&lumpsb[LUMP_TEXINFO]);
3990 Mod_Q1BSP_LoadFaces(&lumpsb[LUMP_FACES]);
3991 Mod_Q1BSP_LoadLeaffaces(&lumpsb[LUMP_MARKSURFACES]);
3992 Mod_Q1BSP_LoadVisibility(&lumpsb[LUMP_VISIBILITY]);
3993 // load submodels before leafs because they contain the number of vis leafs
3994 Mod_Q1BSP_LoadSubmodels(&lumpsb[LUMP_MODELS], &hullinfo);
3995 Mod_Q1BSP_LoadLeafs(&lumpsb[LUMP_LEAFS]);
3996 Mod_Q1BSP_LoadNodes(&lumpsb[LUMP_NODES]);
3997 Mod_Q1BSP_LoadClipnodes(&lumpsb[LUMP_CLIPNODES], &hullinfo);
3999 for (i = 0; i < HEADER_LUMPS; i++)
4000 if (lumpsb[i].readcount != lumpsb[i].cursize && i != LUMP_TEXTURES && i != LUMP_LIGHTING)
4001 Host_Error("Lump %i incorrectly loaded (readcount %i, size %i)\n", i, lumpsb[i].readcount, lumpsb[i].cursize);
4003 // check if the map supports transparent water rendering
4004 loadmodel->brush.supportwateralpha = Mod_Q1BSP_CheckWaterAlphaSupport();
4006 // we don't need the compressed pvs data anymore
4007 if (mod->brushq1.data_compressedpvs)
4008 Mem_Free(mod->brushq1.data_compressedpvs);
4009 mod->brushq1.data_compressedpvs = NULL;
4010 mod->brushq1.num_compressedpvs = 0;
4012 Mod_Q1BSP_MakeHull0();
4013 if (mod_bsp_portalize.integer)
4014 Mod_Q1BSP_MakePortals();
4016 mod->numframes = 2; // regular and alternate animation
4019 if (loadmodel->brush.numsubmodels)
4020 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
4022 // LordHavoc: to clear the fog around the original quake submodel code, I
4024 // first of all, some background info on the submodels:
4025 // model 0 is the map model (the world, named maps/e1m1.bsp for example)
4026 // model 1 and higher are submodels (doors and the like, named *1, *2, etc)
4027 // now the weird for loop itself:
4028 // the loop functions in an odd way, on each iteration it sets up the
4029 // current 'mod' model (which despite the confusing code IS the model of
4030 // the number i), at the end of the loop it duplicates the model to become
4031 // the next submodel, and loops back to set up the new submodel.
4033 // LordHavoc: now the explanation of my sane way (which works identically):
4034 // set up the world model, then on each submodel copy from the world model
4035 // and set up the submodel with the respective model info.
4036 totalstylesurfaces = 0;
4038 for (i = 0;i < mod->brush.numsubmodels;i++)
4040 memset(stylecounts, 0, sizeof(stylecounts));
4041 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
4043 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
4044 for (j = 0;j < MAXLIGHTMAPS;j++)
4045 stylecounts[surface->lightmapinfo->styles[j]]++;
4047 for (k = 0;k < 255;k++)
4051 totalstylesurfaces += stylecounts[k];
4054 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
4055 for (i = 0;i < mod->brush.numsubmodels;i++)
4057 // LordHavoc: this code was originally at the end of this loop, but
4058 // has been transformed to something more readable at the start here.
4063 // duplicate the basic information
4064 dpsnprintf(name, sizeof(name), "*%i", i);
4065 mod = Mod_FindName(name, loadmodel->name);
4066 // copy the base model to this one
4068 // rename the clone back to its proper name
4069 strlcpy(mod->name, name, sizeof(mod->name));
4070 mod->brush.parentmodel = loadmodel;
4071 // textures and memory belong to the main model
4072 mod->texturepool = NULL;
4073 mod->mempool = NULL;
4074 mod->brush.GetPVS = NULL;
4075 mod->brush.FatPVS = NULL;
4076 mod->brush.BoxTouchingPVS = NULL;
4077 mod->brush.BoxTouchingLeafPVS = NULL;
4078 mod->brush.BoxTouchingVisibleLeafs = NULL;
4079 mod->brush.FindBoxClusters = NULL;
4080 mod->brush.LightPoint = NULL;
4081 mod->brush.AmbientSoundLevelsForPoint = NULL;
4084 mod->brush.submodel = i;
4086 if (loadmodel->brush.submodels)
4087 loadmodel->brush.submodels[i] = mod;
4089 bm = &mod->brushq1.submodels[i];
4091 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
4092 for (j=1 ; j<MAX_MAP_HULLS ; j++)
4094 mod->brushq1.hulls[j].firstclipnode = bm->headnode[j];
4095 mod->brushq1.hulls[j].lastclipnode = mod->brushq1.numclipnodes - 1;
4098 mod->firstmodelsurface = bm->firstface;
4099 mod->nummodelsurfaces = bm->numfaces;
4101 // set node/leaf parents for this submodel
4102 Mod_Q1BSP_LoadNodes_RecursiveSetParent(mod->brush.data_nodes + mod->brushq1.hulls[0].firstclipnode, NULL);
4104 // this has to occur after hull info has been set, as it uses Mod_Q1BSP_PointSuperContents
4105 Mod_Q1BSP_AssignNoShadowSkySurfaces(mod);
4107 // make the model surface list (used by shadowing/lighting)
4108 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
4109 Mod_MakeSortedSurfaces(mod);
4111 // copy the submodel bounds, then enlarge the yaw and rotated bounds according to radius
4112 // (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)
4113 VectorCopy(bm->mins, mod->normalmins);
4114 VectorCopy(bm->maxs, mod->normalmaxs);
4115 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
4116 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
4117 modelyawradius = dist*dist+modelyawradius*modelyawradius;
4118 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
4119 modelradius = modelyawradius + modelradius * modelradius;
4120 modelyawradius = sqrt(modelyawradius);
4121 modelradius = sqrt(modelradius);
4122 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
4123 mod->yawmins[2] = mod->normalmins[2];
4124 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
4125 mod->yawmaxs[2] = mod->normalmaxs[2];
4126 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
4127 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
4128 mod->radius = modelradius;
4129 mod->radius2 = modelradius * modelradius;
4131 // this gets altered below if sky or water is used
4132 mod->DrawSky = NULL;
4133 mod->DrawAddWaterPlanes = NULL;
4135 // scan surfaces for sky and water and flag the submodel as possessing these features or not
4136 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
4137 if (mod->nummodelsurfaces)
4139 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
4140 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
4142 if (j < mod->nummodelsurfaces)
4143 mod->DrawSky = R_Q1BSP_DrawSky;
4145 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
4146 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
4148 if (j < mod->nummodelsurfaces)
4149 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
4151 // build lightstyle update chains
4152 // (used to rapidly mark lightmapupdateflags on many surfaces
4153 // when d_lightstylevalue changes)
4154 memset(stylecounts, 0, sizeof(stylecounts));
4155 for (k = 0;k < mod->nummodelsurfaces;k++)
4157 surface = mod->data_surfaces + mod->firstmodelsurface + k;
4158 for (j = 0;j < MAXLIGHTMAPS;j++)
4159 stylecounts[surface->lightmapinfo->styles[j]]++;
4161 mod->brushq1.num_lightstyles = 0;
4162 for (k = 0;k < 255;k++)
4166 styleinfo[mod->brushq1.num_lightstyles].style = k;
4167 styleinfo[mod->brushq1.num_lightstyles].value = 0;
4168 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
4169 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
4170 remapstyles[k] = mod->brushq1.num_lightstyles;
4171 mod->brushq1.num_lightstyles++;
4174 for (k = 0;k < mod->nummodelsurfaces;k++)
4176 surface = mod->data_surfaces + mod->firstmodelsurface + k;
4177 for (j = 0;j < MAXLIGHTMAPS;j++)
4179 if (surface->lightmapinfo->styles[j] != 255)
4181 int r = remapstyles[surface->lightmapinfo->styles[j]];
4182 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
4186 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
4187 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
4191 // LordHavoc: empty submodel(lacrima.bsp has such a glitch)
4192 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
4194 //mod->brushq1.num_visleafs = bm->visleafs;
4196 // build a Bounding Interval Hierarchy for culling triangles in light rendering
4197 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
4199 if (mod_q1bsp_polygoncollisions.integer)
4201 mod->collision_bih = mod->render_bih;
4202 // point traces and contents checks still use the bsp tree
4203 mod->TraceLine = Mod_CollisionBIH_TraceLine;
4204 mod->TraceBox = Mod_CollisionBIH_TraceBox;
4205 mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
4206 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLineAgainstSurfaces;
4209 // generate VBOs and other shared data before cloning submodels
4213 Mod_Q1BSP_LoadMapBrushes();
4214 //Mod_Q1BSP_ProcessLightList();
4218 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);
4221 int Mod_Q2BSP_SuperContentsFromNativeContents(int nativecontents)
4223 int supercontents = 0;
4224 if (nativecontents & CONTENTSQ2_SOLID)
4225 supercontents |= SUPERCONTENTS_SOLID;
4226 if (nativecontents & CONTENTSQ2_WATER)
4227 supercontents |= SUPERCONTENTS_WATER;
4228 if (nativecontents & CONTENTSQ2_SLIME)
4229 supercontents |= SUPERCONTENTS_SLIME;
4230 if (nativecontents & CONTENTSQ2_LAVA)
4231 supercontents |= SUPERCONTENTS_LAVA;
4232 if (nativecontents & CONTENTSQ2_MONSTER)
4233 supercontents |= SUPERCONTENTS_BODY;
4234 if (nativecontents & CONTENTSQ2_DEADMONSTER)
4235 supercontents |= SUPERCONTENTS_CORPSE;
4236 if (nativecontents & CONTENTSQ2_PLAYERCLIP)
4237 supercontents |= SUPERCONTENTS_PLAYERCLIP;
4238 if (nativecontents & CONTENTSQ2_MONSTERCLIP)
4239 supercontents |= SUPERCONTENTS_MONSTERCLIP;
4240 if (!(nativecontents & CONTENTSQ2_TRANSLUCENT))
4241 supercontents |= SUPERCONTENTS_OPAQUE;
4242 return supercontents;
4245 int Mod_Q2BSP_NativeContentsFromSuperContents(int supercontents)
4247 int nativecontents = 0;
4248 if (supercontents & SUPERCONTENTS_SOLID)
4249 nativecontents |= CONTENTSQ2_SOLID;
4250 if (supercontents & SUPERCONTENTS_WATER)
4251 nativecontents |= CONTENTSQ2_WATER;
4252 if (supercontents & SUPERCONTENTS_SLIME)
4253 nativecontents |= CONTENTSQ2_SLIME;
4254 if (supercontents & SUPERCONTENTS_LAVA)
4255 nativecontents |= CONTENTSQ2_LAVA;
4256 if (supercontents & SUPERCONTENTS_BODY)
4257 nativecontents |= CONTENTSQ2_MONSTER;
4258 if (supercontents & SUPERCONTENTS_CORPSE)
4259 nativecontents |= CONTENTSQ2_DEADMONSTER;
4260 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
4261 nativecontents |= CONTENTSQ2_PLAYERCLIP;
4262 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
4263 nativecontents |= CONTENTSQ2_MONSTERCLIP;
4264 if (!(supercontents & SUPERCONTENTS_OPAQUE))
4265 nativecontents |= CONTENTSQ2_TRANSLUCENT;
4266 return nativecontents;
4269 static void Mod_Q2BSP_LoadVisibility(sizebuf_t *sb)
4272 loadmodel->brushq1.num_compressedpvs = 0;
4273 loadmodel->brushq1.data_compressedpvs = NULL;
4274 loadmodel->brush.num_pvsclusters = 0;
4275 loadmodel->brush.num_pvsclusterbytes = 0;
4276 loadmodel->brush.data_pvsclusters = NULL;
4281 count = MSG_ReadLittleLong(sb);
4282 loadmodel->brush.num_pvsclusters = count;
4283 loadmodel->brush.num_pvsclusterbytes = (count+7)>>3;
4284 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, count*loadmodel->brush.num_pvsclusterbytes);
4285 for (i = 0;i < count;i++)
4287 int pvsofs = MSG_ReadLittleLong(sb);
4288 /*int phsofs = */MSG_ReadLittleLong(sb);
4289 // decompress the vis data for this cluster
4290 // (note this accesses the underlying data store of sb, which is kind of evil)
4291 Mod_Q1BSP_DecompressVis(sb->data + pvsofs, sb->data + sb->cursize, loadmodel->brush.data_pvsclusters + i * loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.data_pvsclusters + (i+1) * loadmodel->brush.num_pvsclusterbytes);
4293 // hush the loading error check later - we had to do random access on this lump, so we didn't read to the end
4294 sb->readcount = sb->cursize;
4297 static void Mod_Q2BSP_LoadNodes(sizebuf_t *sb)
4299 int i, j, count, p, child[2];
4301 int structsize = 28;
4303 if (sb->cursize % structsize)
4304 Host_Error("Mod_Q2BSP_LoadNodes: funny lump size in %s",loadmodel->name);
4305 count = sb->cursize / structsize;
4307 Host_Error("Mod_Q2BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
4308 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
4310 loadmodel->brush.data_nodes = out;
4311 loadmodel->brush.num_nodes = count;
4313 for ( i=0 ; i<count ; i++, out++)
4315 p = MSG_ReadLittleLong(sb);
4316 out->plane = loadmodel->brush.data_planes + p;
4317 child[0] = MSG_ReadLittleLong(sb);
4318 child[1] = MSG_ReadLittleLong(sb);
4319 out->mins[0] = MSG_ReadLittleShort(sb);
4320 out->mins[1] = MSG_ReadLittleShort(sb);
4321 out->mins[2] = MSG_ReadLittleShort(sb);
4322 out->maxs[0] = MSG_ReadLittleShort(sb);
4323 out->maxs[1] = MSG_ReadLittleShort(sb);
4324 out->maxs[2] = MSG_ReadLittleShort(sb);
4325 out->firstsurface = (unsigned short)MSG_ReadLittleShort(sb);
4326 out->numsurfaces = (unsigned short)MSG_ReadLittleShort(sb);
4327 if (out->firstsurface + out->numsurfaces > (unsigned int)loadmodel->num_surfaces)
4329 Con_Printf("Mod_Q2BSP_LoadNodes: invalid surface index range %i+%i (file has only %i surfaces)\n", out->firstsurface, out->numsurfaces, loadmodel->num_surfaces);
4330 out->firstsurface = 0;
4331 out->numsurfaces = 0;
4333 for (j=0 ; j<2 ; j++)
4338 if (p < loadmodel->brush.num_nodes)
4339 out->children[j] = loadmodel->brush.data_nodes + p;
4342 Con_Printf("Mod_Q2BSP_LoadNodes: invalid node index %i (file has only %i nodes)\n", p, loadmodel->brush.num_nodes);
4343 // map it to the solid leaf
4344 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
4349 // get leaf index as a positive value starting at 0 (-1 becomes 0, -2 becomes 1, etc)
4351 if (p < loadmodel->brush.num_leafs)
4352 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + p);
4355 Con_Printf("Mod_Q2BSP_LoadNodes: invalid leaf index %i (file has only %i leafs)\n", p, loadmodel->brush.num_leafs);
4356 // map it to the solid leaf
4357 out->children[j] = (mnode_t *)loadmodel->brush.data_leafs;
4363 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL); // sets nodes and leafs
4366 static void Mod_Q2BSP_LoadTexinfo(sizebuf_t *sb)
4370 int structsize = 76;
4371 int maxtextures = 1024; // hardcoded limit of quake2 engine, so we may as well use it as an upper bound
4372 char filename[MAX_QPATH];
4374 if (sb->cursize % structsize)
4375 Host_Error("Mod_Q2BSP_LoadTexinfo: funny lump size in %s",loadmodel->name);
4376 count = sb->cursize / structsize;
4377 out = (mtexinfo_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4378 loadmodel->brushq1.texinfo = out;
4379 loadmodel->brushq1.numtexinfo = count;
4380 loadmodel->num_texturesperskin = 0;
4381 loadmodel->data_textures = (texture_t*)Mem_Alloc(loadmodel->mempool, maxtextures * sizeof(texture_t));
4383 for (i = 0;i < count;i++, out++)
4386 for (k = 0;k < 2;k++)
4387 for (j = 0;j < 4;j++)
4388 out->vecs[k][j] = MSG_ReadLittleFloat(sb);
4390 out->q2flags = MSG_ReadLittleLong(sb);
4391 out->q2value = MSG_ReadLittleLong(sb);
4392 MSG_ReadBytes(sb, 32, (unsigned char*)out->q2texture);
4393 out->q2texture[31] = 0; // make absolutely sure it is terminated
4394 out->q2nexttexinfo = MSG_ReadLittleLong(sb);
4396 // find an existing match for the texture if possible
4397 dpsnprintf(filename, sizeof(filename), "textures/%s.wal", out->q2texture);
4398 for (j = 0;j < loadmodel->num_texturesperskin;j++)
4399 if (!strcmp(filename, loadmodel->data_textures[j].name)
4400 && out->q2flags == loadmodel->data_textures[j].q2flags
4401 && out->q2value == loadmodel->data_textures[j].q2value)
4403 // if we don't find the texture, store the new texture
4404 if (j == loadmodel->num_texturesperskin)
4406 if (loadmodel->num_texturesperskin < maxtextures)
4408 texture_t *tx = loadmodel->data_textures + j;
4409 int q2flags = out->q2flags;
4410 unsigned char *walfile = NULL;
4411 fs_offset_t walfilesize = 0;
4412 Mod_LoadTextureFromQ3Shader(loadmodel->mempool, loadmodel->name, tx, filename, true, true, TEXF_ALPHA | TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, MATERIALFLAG_WALL);
4413 // now read the .wal file to get metadata (even if a .tga was overriding it, we still need the wal data)
4414 walfile = FS_LoadFile(filename, tempmempool, true, &walfilesize);
4418 LoadWAL_GetMetadata(walfile, (int)walfilesize, &w, &h, NULL, NULL, &tx->q2contents, NULL);
4428 tx->q2flags = out->q2flags;
4429 tx->q2value = out->q2value;
4430 // also modify the texture to have the correct contents and such based on flags
4431 // note that we create multiple texture_t structures if q2flags differs
4432 if (q2flags & Q2SURF_LIGHT)
4434 // doesn't mean anything to us
4436 if (q2flags & Q2SURF_SLICK)
4438 // would be nice to support...
4440 if (q2flags & Q2SURF_SKY)
4442 // sky is a rather specific thing
4443 q2flags &= ~Q2SURF_NODRAW; // quake2 had a slightly different meaning than we have in mind here...
4444 tx->basematerialflags = MATERIALFLAG_SKY;
4445 tx->supercontents = SUPERCONTENTS_SKY | SUPERCONTENTS_NODROP | SUPERCONTENTS_OPAQUE;
4446 tx->surfaceflags = Q3SURFACEFLAG_SKY | Q3SURFACEFLAG_NOIMPACT | Q3SURFACEFLAG_NOMARKS | Q3SURFACEFLAG_NODLIGHT | Q3SURFACEFLAG_NOLIGHTMAP;
4448 if (q2flags & Q2SURF_WARP)
4450 // we use a scroll instead of a warp
4451 tx->basematerialflags |= MATERIALFLAG_WATERSCROLL | MATERIALFLAG_FULLBRIGHT;
4452 // if it's also transparent, we can enable the WATERSHADER
4453 // but we do not set the WATERALPHA flag because we don't
4454 // want to honor r_wateralpha in q2bsp
4455 // (it would go against the artistic intent)
4456 if (q2flags & (Q2SURF_TRANS33 | Q2SURF_TRANS66))
4457 tx->basematerialflags |= MATERIALFLAG_WATERSHADER;
4459 if (q2flags & Q2SURF_TRANS33)
4461 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED;
4462 tx->basealpha = 1.0f / 3.0f;
4463 tx->supercontents &= ~SUPERCONTENTS_OPAQUE;
4464 if (tx->q2contents & Q2CONTENTS_SOLID)
4465 tx->q2contents = (tx->q2contents & ~Q2CONTENTS_SOLID) | Q2CONTENTS_WINDOW;
4467 if (q2flags & Q2SURF_TRANS66)
4469 tx->basematerialflags |= MATERIALFLAG_ALPHA | MATERIALFLAG_BLENDED;
4470 tx->basealpha = 2.0f / 3.0f;
4471 tx->supercontents &= ~SUPERCONTENTS_OPAQUE;
4472 if (tx->q2contents & Q2CONTENTS_SOLID)
4473 tx->q2contents = (tx->q2contents & ~Q2CONTENTS_SOLID) | Q2CONTENTS_WINDOW;
4475 if ((q2flags & Q2SURF_FLOWING) && tx->materialshaderpass != NULL)
4477 tx->materialshaderpass->tcmods[0].tcmod = Q3TCMOD_SCROLL;
4478 if (q2flags & Q2SURF_WARP)
4479 tx->materialshaderpass->tcmods[0].parms[0] = -0.5f;
4481 tx->materialshaderpass->tcmods[0].parms[0] = -1.6f;
4482 tx->materialshaderpass->tcmods[0].parms[1] = 0.0f;
4484 if (q2flags & Q2SURF_ALPHATEST)
4486 // KMQUAKE2 and other modded engines added this flag for lit alpha tested surfaces
4487 tx->basematerialflags |= MATERIALFLAG_ALPHATEST | MATERIALFLAG_NOSHADOW;
4489 else if (q2flags & (Q2SURF_TRANS33 | Q2SURF_TRANS66 | Q2SURF_WARP))
4491 if (!mod_q2bsp_littransparentsurfaces.integer)
4492 tx->basematerialflags |= MATERIALFLAG_FULLBRIGHT;
4494 if (q2flags & Q2SURF_NODRAW)
4496 tx->basematerialflags = MATERIALFLAG_NODRAW | MATERIALFLAG_NOSHADOW;
4498 if (tx->q2contents & (Q2CONTENTS_TRANSLUCENT | Q2CONTENTS_MONSTERCLIP | Q2CONTENTS_PLAYERCLIP))
4499 tx->q2contents |= Q2CONTENTS_DETAIL;
4500 if (!(tx->q2contents & (Q2CONTENTS_SOLID | Q2CONTENTS_WINDOW | Q2CONTENTS_AUX | Q2CONTENTS_LAVA | Q2CONTENTS_SLIME | Q2CONTENTS_WATER | Q2CONTENTS_MIST | Q2CONTENTS_PLAYERCLIP | Q2CONTENTS_MONSTERCLIP | Q2CONTENTS_MIST)))
4501 tx->q2contents |= Q2CONTENTS_SOLID;
4502 if (tx->q2flags & (Q2SURF_HINT | Q2SURF_SKIP))
4504 tx->supercontents = Mod_Q2BSP_SuperContentsFromNativeContents(tx->q2contents);
4505 // set the current values to the base values
4506 tx->currentframe = tx;
4507 tx->currentskinframe = tx->materialshaderpass != NULL ? tx->materialshaderpass->skinframes[0] : NULL;
4508 tx->currentmaterialflags = tx->basematerialflags;
4509 loadmodel->num_texturesperskin++;
4510 loadmodel->num_textures = loadmodel->num_texturesperskin;
4514 Con_Printf("Mod_Q2BSP_LoadTexinfo: max textures reached (%i)\n", maxtextures);
4515 j = 0; // use first texture and give up
4518 // store the index we found for this texture
4519 out->textureindex = j;
4522 // realloc the textures array now that we know how many we actually need
4523 loadmodel->data_textures = (texture_t*)Mem_Realloc(loadmodel->mempool, loadmodel->data_textures, loadmodel->num_texturesperskin * sizeof(texture_t));
4525 // now assemble the texture chains
4526 // if we encounter the textures out of order, the later ones won't mark the earlier ones in a sequence, so the earlier
4527 for (i = 0, out = loadmodel->brushq1.texinfo;i < count;i++, out++)
4530 texture_t *t = loadmodel->data_textures + out->textureindex;
4531 t->currentframe = t; // fix the reallocated pointer
4533 // if this is not animated, skip it
4534 // if this is already processed, skip it (part of an existing sequence)
4535 if (out->q2nexttexinfo == 0 || t->animated)
4538 // store the array of frames to use
4539 t->animated = 2; // q2bsp animation
4540 t->anim_total[0] = 0;
4541 t->anim_total[1] = 0;
4542 // gather up to 10 frames (we don't support more)
4543 for (j = i;j >= 0 && t->anim_total[0] < (int)(sizeof(t->anim_frames[0])/sizeof(t->anim_frames[0][0]));j = loadmodel->brushq1.texinfo[j].q2nexttexinfo)
4545 // detect looping and stop there
4546 if (t->anim_total[0] && loadmodel->brushq1.texinfo[j].textureindex == out->textureindex)
4548 t->anim_frames[0][t->anim_total[0]++] = &loadmodel->data_textures[loadmodel->brushq1.texinfo[j].textureindex];
4550 // we could look for the +a sequence here if this is the +0 sequence,
4551 // but it seems that quake2 did not implement that (even though the
4552 // files exist in the baseq2 content)
4554 // write the frame sequence to all the textures involved (just like
4555 // in the q1bsp loader)
4557 // note that this can overwrite the rest of the sequence - so if the
4558 // start of a sequence is found later than the other parts of the
4559 // sequence, it will go back and rewrite them correctly.
4560 for (k = 0;k < t->anim_total[0];k++)
4562 texture_t *txk = t->anim_frames[0][k];
4563 txk->animated = t->animated;
4564 txk->anim_total[0] = t->anim_total[0];
4565 for (l = 0;l < t->anim_total[0];l++)
4566 txk->anim_frames[0][l] = t->anim_frames[0][l];
4571 static void Mod_Q2BSP_LoadLighting(sizebuf_t *sb)
4573 // LordHavoc: this fits exactly the same format that we use in .lit files
4574 loadmodel->brushq1.lightdata = (unsigned char *)Mem_Alloc(loadmodel->mempool, sb->cursize);
4575 MSG_ReadBytes(sb, sb->cursize, loadmodel->brushq1.lightdata);
4578 static void Mod_Q2BSP_LoadLeafs(sizebuf_t *sb)
4581 int i, j, count, firstmarksurface, nummarksurfaces, firstmarkbrush, nummarkbrushes;
4582 int structsize = 28;
4584 if (sb->cursize % structsize)
4585 Host_Error("Mod_Q2BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
4586 count = sb->cursize / structsize;
4587 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count*sizeof(*out));
4589 loadmodel->brush.data_leafs = out;
4590 loadmodel->brush.num_leafs = count;
4592 // FIXME: this function could really benefit from some error checking
4593 for ( i=0 ; i<count ; i++, out++)
4595 out->contents = MSG_ReadLittleLong(sb);
4596 out->clusterindex = MSG_ReadLittleShort(sb);
4597 out->areaindex = MSG_ReadLittleShort(sb);
4598 out->mins[0] = MSG_ReadLittleShort(sb);
4599 out->mins[1] = MSG_ReadLittleShort(sb);
4600 out->mins[2] = MSG_ReadLittleShort(sb);
4601 out->maxs[0] = MSG_ReadLittleShort(sb);
4602 out->maxs[1] = MSG_ReadLittleShort(sb);
4603 out->maxs[2] = MSG_ReadLittleShort(sb);
4605 firstmarksurface = (unsigned short)MSG_ReadLittleShort(sb);
4606 nummarksurfaces = (unsigned short)MSG_ReadLittleShort(sb);
4607 firstmarkbrush = (unsigned short)MSG_ReadLittleShort(sb);
4608 nummarkbrushes = (unsigned short)MSG_ReadLittleShort(sb);
4610 for (j = 0;j < 4;j++)
4611 out->ambient_sound_level[j] = 0;
4613 if (out->clusterindex >= loadmodel->brush.num_pvsclusters)
4615 Con_Print("Mod_Q2BSP_LoadLeafs: invalid clusterindex\n");
4616 out->clusterindex = -1;
4619 if (firstmarksurface >= 0 && firstmarksurface + nummarksurfaces <= loadmodel->brush.num_leafsurfaces)
4621 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + firstmarksurface;
4622 out->numleafsurfaces = nummarksurfaces;
4626 Con_Printf("Mod_Q2BSP_LoadLeafs: invalid leafsurface range %i:%i outside range %i:%i\n", firstmarksurface, firstmarksurface+nummarksurfaces, 0, loadmodel->brush.num_leafsurfaces);
4627 out->firstleafsurface = NULL;
4628 out->numleafsurfaces = 0;
4631 if (firstmarkbrush >= 0 && firstmarkbrush + nummarkbrushes <= loadmodel->brush.num_leafbrushes)
4633 out->firstleafbrush = loadmodel->brush.data_leafbrushes + firstmarkbrush;
4634 out->numleafbrushes = nummarkbrushes;
4638 Con_Printf("Mod_Q2BSP_LoadLeafs: invalid leafbrush range %i:%i outside range %i:%i\n", firstmarkbrush, firstmarkbrush+nummarkbrushes, 0, loadmodel->brush.num_leafbrushes);
4639 out->firstleafbrush = NULL;
4640 out->numleafbrushes = 0;
4645 static void Mod_Q2BSP_LoadLeafBrushes(sizebuf_t *sb)
4650 if (sb->cursize % structsize)
4651 Host_Error("Mod_Q2BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
4652 loadmodel->brush.num_leafbrushes = sb->cursize / structsize;
4653 loadmodel->brush.data_leafbrushes = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafbrushes * sizeof(int));
4655 for (i = 0;i < loadmodel->brush.num_leafbrushes;i++)
4657 j = (unsigned short) MSG_ReadLittleShort(sb);
4658 if (j >= loadmodel->brush.num_brushes)
4659 Host_Error("Mod_Q1BSP_LoadLeafBrushes: bad brush number");
4660 loadmodel->brush.data_leafbrushes[i] = j;
4664 static void Mod_Q2BSP_LoadBrushSides(sizebuf_t *sb)
4666 q3mbrushside_t *out;
4670 if (sb->cursize % structsize)
4671 Host_Error("Mod_Q2BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
4672 count = sb->cursize / structsize;
4673 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4675 loadmodel->brush.data_brushsides = out;
4676 loadmodel->brush.num_brushsides = count;
4678 for (i = 0;i < count;i++, out++)
4680 n = (unsigned short)MSG_ReadLittleShort(sb);
4681 if (n < 0 || n >= loadmodel->brush.num_planes)
4682 Host_Error("Mod_Q2BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
4683 out->plane = loadmodel->brush.data_planes + n;
4684 n = MSG_ReadLittleShort(sb);
4687 if (n >= loadmodel->brushq1.numtexinfo)
4688 Host_Error("Mod_Q2BSP_LoadBrushSides: invalid texinfo index %i (%i texinfos)", n, loadmodel->brushq1.numtexinfo);
4689 out->texture = loadmodel->data_textures + loadmodel->brushq1.texinfo[n].textureindex;
4693 //Con_Printf("Mod_Q2BSP_LoadBrushSides: brushside %i has texinfo index %i < 0, changing to generic texture!\n", i, n);
4694 out->texture = &mod_q1bsp_texture_solid;
4699 static void Mod_Q2BSP_LoadBrushes(sizebuf_t *sb)
4702 int i, j, firstside, numsides, contents, count, maxplanes, q3surfaceflags, supercontents;
4703 colplanef_t *planes;
4704 int structsize = 12;
4705 qboolean brushmissingtextures;
4706 int numbrushesmissingtextures = 0;
4707 int numcreatedtextures = 0;
4709 if (sb->cursize % structsize)
4710 Host_Error("Mod_Q2BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
4711 count = sb->cursize / structsize;
4712 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
4714 loadmodel->brush.data_brushes = out;
4715 loadmodel->brush.num_brushes = count;
4720 for (i = 0; i < count; i++, out++)
4722 firstside = MSG_ReadLittleLong(sb);
4723 numsides = MSG_ReadLittleLong(sb);
4724 contents = MSG_ReadLittleLong(sb);
4725 if (firstside < 0 || firstside + numsides > loadmodel->brush.num_brushsides)
4726 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", firstside, firstside + numsides, loadmodel->brush.num_brushsides);
4728 out->firstbrushside = loadmodel->brush.data_brushsides + firstside;
4729 out->numbrushsides = numsides;
4730 // convert the contents to our values
4731 supercontents = Mod_Q2BSP_SuperContentsFromNativeContents(contents);
4733 // problem: q2bsp brushes have contents but not a texture
4734 // problem: q2bsp brushsides *may* have a texture or may not
4735 // problem: all brushsides and brushes must have a texture for trace_hittexture functionality to work, and the collision code is engineered around this assumption
4736 // solution: nasty hacks
4737 brushmissingtextures = false;
4738 out->texture = NULL;
4739 for (j = 0; j < out->numbrushsides; j++)
4741 if (out->firstbrushside[j].texture == &mod_q1bsp_texture_solid)
4742 brushmissingtextures = true;
4745 // if we can find a matching texture on a brush side we can use it instead of creating one
4746 if (out->firstbrushside[j].texture->supercontents == supercontents)
4747 out->texture = out->firstbrushside[j].texture;
4750 if (brushmissingtextures || out->texture == NULL)
4752 numbrushesmissingtextures++;
4753 // if we didn't find any appropriate texture (matching contents), we'll have to create one
4754 // we could search earlier ones for a matching one but that can be slow
4755 if (out->texture == NULL)
4757 texture_t *validtexture;
4758 validtexture = (texture_t *)Mem_Alloc(loadmodel->mempool, sizeof(texture_t));
4759 dpsnprintf(validtexture->name, sizeof(validtexture->name), "brushcollision%i", numcreatedtextures);
4760 validtexture->surfaceflags = 0;
4761 validtexture->supercontents = supercontents;
4762 numcreatedtextures++;
4763 out->texture = validtexture;
4765 // out->texture now contains a texture with appropriate contents, copy onto any missing sides
4766 for (j = 0; j < out->numbrushsides; j++)
4767 if (out->firstbrushside[j].texture == &mod_q1bsp_texture_solid)
4768 out->firstbrushside[j].texture = out->texture;
4771 // make a colbrush from the brush
4773 // make a list of mplane_t structs to construct a colbrush from
4774 if (maxplanes < out->numbrushsides)
4776 maxplanes = out->numbrushsides;
4779 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
4781 for (j = 0;j < out->numbrushsides;j++)
4783 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
4784 planes[j].dist = out->firstbrushside[j].plane->dist;
4785 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
4786 planes[j].texture = out->firstbrushside[j].texture;
4787 q3surfaceflags |= planes[j].q3surfaceflags;
4789 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
4791 // this whole loop can take a while (e.g. on redstarrepublic4)
4792 CL_KeepaliveMessage(false);
4796 if (numcreatedtextures)
4797 Con_DPrintf("Mod_Q2BSP_LoadBrushes: %i brushes own sides that lack textures or have differing contents from the brush, %i textures have been created to describe these contents.\n", numbrushesmissingtextures, numcreatedtextures);
4800 static void Mod_Q2BSP_LoadPOP(sizebuf_t *sb)
4802 // this is probably a "proof of purchase" lump of some sort, it seems to be 0 size in most bsp files (but not q2dm1.bsp for instance)
4803 sb->readcount = sb->cursize;
4806 static void Mod_Q2BSP_LoadAreas(sizebuf_t *sb)
4808 // we currently don't use areas, they represent closable doors as vis blockers
4809 sb->readcount = sb->cursize;
4812 static void Mod_Q2BSP_LoadAreaPortals(sizebuf_t *sb)
4814 // we currently don't use areas, they represent closable doors as vis blockers
4815 sb->readcount = sb->cursize;
4818 static void Mod_Q2BSP_LoadSubmodels(sizebuf_t *sb)
4822 int structsize = 48;
4824 if (sb->cursize % structsize)
4825 Host_Error ("Mod_Q2BSP_LoadSubmodels: funny lump size in %s", loadmodel->name);
4827 count = sb->cursize / structsize;
4828 out = (mmodel_t *)Mem_Alloc (loadmodel->mempool, count*sizeof(*out));
4830 loadmodel->brushq1.submodels = out;
4831 loadmodel->brush.numsubmodels = count;
4833 // this is identical to the q1 submodel structure except for having 1 hull
4834 for (i = 0; i < count; i++, out++)
4836 // spread out the mins / maxs by a pixel
4837 out->mins[0] = MSG_ReadLittleFloat(sb) - 1;
4838 out->mins[1] = MSG_ReadLittleFloat(sb) - 1;
4839 out->mins[2] = MSG_ReadLittleFloat(sb) - 1;
4840 out->maxs[0] = MSG_ReadLittleFloat(sb) + 1;
4841 out->maxs[1] = MSG_ReadLittleFloat(sb) + 1;
4842 out->maxs[2] = MSG_ReadLittleFloat(sb) + 1;
4843 out->origin[0] = MSG_ReadLittleFloat(sb);
4844 out->origin[1] = MSG_ReadLittleFloat(sb);
4845 out->origin[2] = MSG_ReadLittleFloat(sb);
4846 out->headnode[0] = MSG_ReadLittleLong(sb);
4847 out->firstface = MSG_ReadLittleLong(sb);
4848 out->numfaces = MSG_ReadLittleLong(sb);
4852 static void Mod_Q2BSP_FindSubmodelBrushRange_r(dp_model_t *mod, mnode_t *node, int *first, int *last)
4858 Mod_Q2BSP_FindSubmodelBrushRange_r(mod, node->children[0], first, last);
4859 node = node->children[1];
4861 leaf = (mleaf_t*)node;
4862 for (i = 0;i < leaf->numleafbrushes;i++)
4864 int brushnum = leaf->firstleafbrush[i];
4865 if (*first > brushnum)
4867 if (*last < brushnum)
4872 static void Mod_Q2BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
4875 sizebuf_t lumpsb[Q2HEADER_LUMPS];
4877 float dist, modelyawradius, modelradius;
4878 msurface_t *surface;
4879 int totalstylesurfaces, totalstyles, stylecounts[256], remapstyles[256];
4880 model_brush_lightstyleinfo_t styleinfo[256];
4881 unsigned char *datapointer;
4884 MSG_InitReadBuffer(&sb, (unsigned char *)buffer, (unsigned char *)bufferend - (unsigned char *)buffer);
4886 mod->type = mod_brushq2;
4888 mod->brush.ishlbsp = false;
4889 mod->brush.isbsp2rmqe = false;
4890 mod->brush.isbsp2 = false;
4891 mod->brush.isq2bsp = true; // q1bsp loaders mostly work but we need a few tweaks
4892 mod->brush.isq3bsp = false;
4893 mod->brush.skymasking = true;
4894 mod->modeldatatypestring = "Q2BSP";
4896 i = MSG_ReadLittleLong(&sb);
4897 if (i != Q2BSPMAGIC)
4898 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4900 i = MSG_ReadLittleLong(&sb);
4901 if (i != Q2BSPVERSION)
4902 Host_Error("Mod_Q2BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q2BSPVERSION);
4905 for (i = 0; i < Q2HEADER_LUMPS; i++)
4907 int offset = MSG_ReadLittleLong(&sb);
4908 int size = MSG_ReadLittleLong(&sb);
4909 if (offset < 0 || offset + size > sb.cursize)
4910 Host_Error("Mod_Q2BSP_Load: %s has invalid lump %i (offset %i, size %i, file size %i)\n", mod->name, i, offset, size, (int)sb.cursize);
4911 MSG_InitReadBuffer(&lumpsb[i], sb.data + offset, size);
4914 mod->soundfromcenter = true;
4915 mod->TracePoint = Mod_CollisionBIH_TracePoint;
4916 mod->TraceLine = Mod_CollisionBIH_TraceLine;
4917 mod->TraceBox = Mod_CollisionBIH_TraceBox;
4918 mod->TraceBrush = Mod_CollisionBIH_TraceBrush;
4919 mod->PointSuperContents = Mod_CollisionBIH_PointSuperContents;
4920 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
4921 mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
4922 mod->brush.SuperContentsFromNativeContents = Mod_Q2BSP_SuperContentsFromNativeContents;
4923 mod->brush.NativeContentsFromSuperContents = Mod_Q2BSP_NativeContentsFromSuperContents;
4924 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
4925 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
4926 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
4927 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
4928 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
4929 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
4930 mod->brush.LightPoint = Mod_Q1BSP_LightPoint;
4931 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
4932 mod->brush.AmbientSoundLevelsForPoint = NULL;
4933 mod->brush.RoundUpToHullSize = NULL;
4934 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
4935 mod->Draw = R_Q1BSP_Draw;
4936 mod->DrawDepth = R_Q1BSP_DrawDepth;
4937 mod->DrawDebug = R_Q1BSP_DrawDebug;
4938 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
4939 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
4940 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
4941 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
4942 mod->DrawLight = R_Q1BSP_DrawLight;
4946 mod->brush.qw_md4sum = 0;
4947 mod->brush.qw_md4sum2 = 0;
4948 for (i = 0;i < Q2HEADER_LUMPS;i++)
4951 if (i == Q2LUMP_ENTITIES)
4953 temp = Com_BlockChecksum(lumpsb[i].data, lumpsb[i].cursize);
4954 mod->brush.qw_md4sum ^= LittleLong(temp);
4955 if (i == Q2LUMP_VISIBILITY || i == Q2LUMP_LEAFS || i == Q2LUMP_NODES)
4957 mod->brush.qw_md4sum2 ^= LittleLong(temp);
4960 // many of these functions are identical to Q1 loaders, so we use those where possible
4961 Mod_Q1BSP_LoadEntities(&lumpsb[Q2LUMP_ENTITIES]);
4962 Mod_Q1BSP_LoadVertexes(&lumpsb[Q2LUMP_VERTEXES]);
4963 Mod_Q1BSP_LoadEdges(&lumpsb[Q2LUMP_EDGES]);
4964 Mod_Q1BSP_LoadSurfedges(&lumpsb[Q2LUMP_SURFEDGES]);
4965 Mod_Q2BSP_LoadLighting(&lumpsb[Q2LUMP_LIGHTING]);
4966 Mod_Q1BSP_LoadPlanes(&lumpsb[Q2LUMP_PLANES]);
4967 Mod_Q2BSP_LoadTexinfo(&lumpsb[Q2LUMP_TEXINFO]);
4968 Mod_Q2BSP_LoadBrushSides(&lumpsb[Q2LUMP_BRUSHSIDES]);
4969 Mod_Q2BSP_LoadBrushes(&lumpsb[Q2LUMP_BRUSHES]);
4970 Mod_Q1BSP_LoadFaces(&lumpsb[Q2LUMP_FACES]);
4971 Mod_Q1BSP_LoadLeaffaces(&lumpsb[Q2LUMP_LEAFFACES]);
4972 Mod_Q2BSP_LoadLeafBrushes(&lumpsb[Q2LUMP_LEAFBRUSHES]);
4973 Mod_Q2BSP_LoadVisibility(&lumpsb[Q2LUMP_VISIBILITY]);
4974 Mod_Q2BSP_LoadPOP(&lumpsb[Q2LUMP_POP]);
4975 Mod_Q2BSP_LoadAreas(&lumpsb[Q2LUMP_AREAS]);
4976 Mod_Q2BSP_LoadAreaPortals(&lumpsb[Q2LUMP_AREAPORTALS]);
4977 Mod_Q2BSP_LoadLeafs(&lumpsb[Q2LUMP_LEAFS]);
4978 Mod_Q2BSP_LoadNodes(&lumpsb[Q2LUMP_NODES]);
4979 Mod_Q2BSP_LoadSubmodels(&lumpsb[Q2LUMP_MODELS]);
4981 for (i = 0; i < Q2HEADER_LUMPS; i++)
4982 if (lumpsb[i].readcount != lumpsb[i].cursize)
4983 Host_Error("Lump %i incorrectly loaded (readcount %i, size %i)\n", i, lumpsb[i].readcount, lumpsb[i].cursize);
4985 // we don't actually set MATERIALFLAG_WATERALPHA on anything, so this
4986 // doesn't enable the cvar, just indicates that transparent water is OK
4987 loadmodel->brush.supportwateralpha = true;
4989 // we don't need the compressed pvs data anymore
4990 if (mod->brushq1.data_compressedpvs)
4991 Mem_Free(mod->brushq1.data_compressedpvs);
4992 mod->brushq1.data_compressedpvs = NULL;
4993 mod->brushq1.num_compressedpvs = 0;
4995 // the MakePortals code works fine on the q2bsp data as well
4996 if (mod_bsp_portalize.integer)
4997 Mod_Q1BSP_MakePortals();
4999 mod->numframes = 0; // q2bsp animations are kind of special, frame is unbounded...
5002 if (loadmodel->brush.numsubmodels)
5003 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
5005 totalstylesurfaces = 0;
5007 for (i = 0;i < mod->brush.numsubmodels;i++)
5009 memset(stylecounts, 0, sizeof(stylecounts));
5010 for (k = 0;k < mod->brushq1.submodels[i].numfaces;k++)
5012 surface = mod->data_surfaces + mod->brushq1.submodels[i].firstface + k;
5013 for (j = 0;j < MAXLIGHTMAPS;j++)
5014 stylecounts[surface->lightmapinfo->styles[j]]++;
5016 for (k = 0;k < 255;k++)
5020 totalstylesurfaces += stylecounts[k];
5023 datapointer = (unsigned char *)Mem_Alloc(mod->mempool, mod->num_surfaces * sizeof(int) + totalstyles * sizeof(model_brush_lightstyleinfo_t) + totalstylesurfaces * sizeof(int *));
5024 // set up the world model, then on each submodel copy from the world model
5025 // and set up the submodel with the respective model info.
5027 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
5029 mnode_t *rootnode = NULL;
5030 int firstbrush = loadmodel->brush.num_brushes, lastbrush = 0;
5034 // duplicate the basic information
5035 dpsnprintf(name, sizeof(name), "*%i", i);
5036 mod = Mod_FindName(name, loadmodel->name);
5037 // copy the base model to this one
5039 // rename the clone back to its proper name
5040 strlcpy(mod->name, name, sizeof(mod->name));
5041 mod->brush.parentmodel = loadmodel;
5042 // textures and memory belong to the main model
5043 mod->texturepool = NULL;
5044 mod->mempool = NULL;
5045 mod->brush.GetPVS = NULL;
5046 mod->brush.FatPVS = NULL;
5047 mod->brush.BoxTouchingPVS = NULL;
5048 mod->brush.BoxTouchingLeafPVS = NULL;
5049 mod->brush.BoxTouchingVisibleLeafs = NULL;
5050 mod->brush.FindBoxClusters = NULL;
5051 mod->brush.LightPoint = NULL;
5052 mod->brush.AmbientSoundLevelsForPoint = NULL;
5054 mod->brush.submodel = i;
5055 if (loadmodel->brush.submodels)
5056 loadmodel->brush.submodels[i] = mod;
5058 bm = &mod->brushq1.submodels[i];
5060 // we store the headnode (there's only one in Q2BSP) as if it were the first hull
5061 mod->brushq1.hulls[0].firstclipnode = bm->headnode[0];
5063 mod->firstmodelsurface = bm->firstface;
5064 mod->nummodelsurfaces = bm->numfaces;
5066 // set node/leaf parents for this submodel
5067 // note: if the root of this submodel is a leaf (headnode[0] < 0) then there is nothing to do...
5068 // (this happens in base3.bsp)
5069 if (bm->headnode[0] >= 0)
5070 rootnode = mod->brush.data_nodes + bm->headnode[0];
5072 rootnode = (mnode_t*)(mod->brush.data_leafs + -1 - bm->headnode[0]);
5073 Mod_Q1BSP_LoadNodes_RecursiveSetParent(rootnode, NULL);
5075 // make the model surface list (used by shadowing/lighting)
5076 mod->sortedmodelsurfaces = (int *)datapointer;datapointer += mod->nummodelsurfaces * sizeof(int);
5077 Mod_Q2BSP_FindSubmodelBrushRange_r(mod, rootnode, &firstbrush, &lastbrush);
5078 if (firstbrush <= lastbrush)
5080 mod->firstmodelbrush = firstbrush;
5081 mod->nummodelbrushes = lastbrush + 1 - firstbrush;
5085 mod->firstmodelbrush = 0;
5086 mod->nummodelbrushes = 0;
5088 Mod_MakeSortedSurfaces(mod);
5090 VectorCopy(bm->mins, mod->normalmins);
5091 VectorCopy(bm->maxs, mod->normalmaxs);
5092 dist = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
5093 modelyawradius = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
5094 modelyawradius = dist*dist+modelyawradius*modelyawradius;
5095 modelradius = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
5096 modelradius = modelyawradius + modelradius * modelradius;
5097 modelyawradius = sqrt(modelyawradius);
5098 modelradius = sqrt(modelradius);
5099 mod->yawmins[0] = mod->yawmins[1] = -modelyawradius;
5100 mod->yawmins[2] = mod->normalmins[2];
5101 mod->yawmaxs[0] = mod->yawmaxs[1] = modelyawradius;
5102 mod->yawmaxs[2] = mod->normalmaxs[2];
5103 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
5104 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
5105 mod->radius = modelradius;
5106 mod->radius2 = modelradius * modelradius;
5108 // this gets altered below if sky or water is used
5109 mod->DrawSky = NULL;
5110 mod->DrawAddWaterPlanes = NULL;
5112 // scan surfaces for sky and water and flag the submodel as possessing these features or not
5113 // build lightstyle lists for quick marking of dirty lightmaps when lightstyles flicker
5114 if (mod->nummodelsurfaces)
5116 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
5117 if (surface->texture->basematerialflags & MATERIALFLAG_SKY)
5119 if (j < mod->nummodelsurfaces)
5120 mod->DrawSky = R_Q1BSP_DrawSky;
5122 for (j = 0, surface = &mod->data_surfaces[mod->firstmodelsurface];j < mod->nummodelsurfaces;j++, surface++)
5123 if (surface->texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
5125 if (j < mod->nummodelsurfaces)
5126 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
5128 // build lightstyle update chains
5129 // (used to rapidly mark lightmapupdateflags on many surfaces
5130 // when d_lightstylevalue changes)
5131 memset(stylecounts, 0, sizeof(stylecounts));
5132 for (k = 0;k < mod->nummodelsurfaces;k++)
5134 surface = mod->data_surfaces + mod->firstmodelsurface + k;
5135 for (j = 0;j < MAXLIGHTMAPS;j++)
5136 stylecounts[surface->lightmapinfo->styles[j]]++;
5138 mod->brushq1.num_lightstyles = 0;
5139 for (k = 0;k < 255;k++)
5143 styleinfo[mod->brushq1.num_lightstyles].style = k;
5144 styleinfo[mod->brushq1.num_lightstyles].value = 0;
5145 styleinfo[mod->brushq1.num_lightstyles].numsurfaces = 0;
5146 styleinfo[mod->brushq1.num_lightstyles].surfacelist = (int *)datapointer;datapointer += stylecounts[k] * sizeof(int);
5147 remapstyles[k] = mod->brushq1.num_lightstyles;
5148 mod->brushq1.num_lightstyles++;
5151 for (k = 0;k < mod->nummodelsurfaces;k++)
5153 surface = mod->data_surfaces + mod->firstmodelsurface + k;
5154 for (j = 0;j < MAXLIGHTMAPS;j++)
5156 if (surface->lightmapinfo->styles[j] != 255)
5158 int r = remapstyles[surface->lightmapinfo->styles[j]];
5159 styleinfo[r].surfacelist[styleinfo[r].numsurfaces++] = mod->firstmodelsurface + k;
5163 mod->brushq1.data_lightstyleinfo = (model_brush_lightstyleinfo_t *)datapointer;datapointer += mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t);
5164 memcpy(mod->brushq1.data_lightstyleinfo, styleinfo, mod->brushq1.num_lightstyles * sizeof(model_brush_lightstyleinfo_t));
5168 Con_Printf("warning: empty submodel *%i in %s\n", i+1, loadmodel->name);
5170 //mod->brushq1.num_visleafs = bm->visleafs;
5172 // build a Bounding Interval Hierarchy for culling triangles in light rendering
5173 Mod_MakeCollisionBIH(mod, false, &mod->collision_bih);
5175 // build a Bounding Interval Hierarchy for culling brushes in collision detection
5176 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
5178 // generate VBOs and other shared data before cloning submodels
5184 Con_DPrintf("Stats for q2bsp model \"%s\": %i faces, %i nodes, %i leafs, %i clusters, %i clusterportals, mesh: %i vertices, %i triangles, %i surfaces\n", loadmodel->name, loadmodel->num_surfaces, loadmodel->brush.num_nodes, loadmodel->brush.num_leafs, mod->brush.num_pvsclusters, loadmodel->brush.num_portals, loadmodel->surfmesh.num_vertices, loadmodel->surfmesh.num_triangles, loadmodel->num_surfaces);
5187 static int Mod_Q3BSP_SuperContentsFromNativeContents(int nativecontents);
5188 static int Mod_Q3BSP_NativeContentsFromSuperContents(int supercontents);
5190 static void Mod_Q3BSP_LoadEntities(lump_t *l)
5193 char key[128], value[MAX_INPUTLINE];
5195 loadmodel->brushq3.num_lightgrid_cellsize[0] = 64;
5196 loadmodel->brushq3.num_lightgrid_cellsize[1] = 64;
5197 loadmodel->brushq3.num_lightgrid_cellsize[2] = 128;
5200 loadmodel->brush.entities = (char *)Mem_Alloc(loadmodel->mempool, l->filelen + 1);
5201 memcpy(loadmodel->brush.entities, mod_base + l->fileofs, l->filelen);
5202 loadmodel->brush.entities[l->filelen] = 0;
5203 data = loadmodel->brush.entities;
5204 // some Q3 maps override the lightgrid_cellsize with a worldspawn key
5205 // VorteX: q3map2 FS-R generates tangentspace deluxemaps for q3bsp and sets 'deluxeMaps' key
5206 loadmodel->brushq3.deluxemapping = false;
5207 if (data && COM_ParseToken_Simple(&data, false, false, true) && com_token[0] == '{')
5211 if (!COM_ParseToken_Simple(&data, false, false, true))
5213 if (com_token[0] == '}')
5214 break; // end of worldspawn
5215 if (com_token[0] == '_')
5216 strlcpy(key, com_token + 1, sizeof(key));
5218 strlcpy(key, com_token, sizeof(key));
5219 while (key[strlen(key)-1] == ' ') // remove trailing spaces
5220 key[strlen(key)-1] = 0;
5221 if (!COM_ParseToken_Simple(&data, false, false, true))
5223 strlcpy(value, com_token, sizeof(value));
5224 if (!strcasecmp("gridsize", key)) // this one is case insensitive to 100% match q3map2
5226 #if _MSC_VER >= 1400
5227 #define sscanf sscanf_s
5230 if (sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) == 3 && v[0] != 0 && v[1] != 0 && v[2] != 0)
5231 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
5233 VectorSet(v, 64, 64, 128);
5234 if(sscanf(value, "%f %f %f", &v[0], &v[1], &v[2]) != 3)
5235 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]);
5236 if (v[0] != 0 && v[1] != 0 && v[2] != 0)
5237 VectorCopy(v, loadmodel->brushq3.num_lightgrid_cellsize);
5240 else if (!strcmp("deluxeMaps", key))
5242 if (!strcmp(com_token, "1"))
5244 loadmodel->brushq3.deluxemapping = true;
5245 loadmodel->brushq3.deluxemapping_modelspace = true;
5247 else if (!strcmp(com_token, "2"))
5249 loadmodel->brushq3.deluxemapping = true;
5250 loadmodel->brushq3.deluxemapping_modelspace = false;
5257 static void Mod_Q3BSP_LoadTextures(lump_t *l)
5263 in = (q3dtexture_t *)(mod_base + l->fileofs);
5264 if (l->filelen % sizeof(*in))
5265 Host_Error("Mod_Q3BSP_LoadTextures: funny lump size in %s",loadmodel->name);
5266 count = l->filelen / sizeof(*in);
5267 out = (texture_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5269 loadmodel->data_textures = out;
5270 loadmodel->num_textures = count;
5271 loadmodel->num_texturesperskin = loadmodel->num_textures;
5273 for (i = 0;i < count;i++)
5275 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
5276 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(LittleLong(in[i].contents));
5277 Mod_LoadTextureFromQ3Shader(loadmodel->mempool, loadmodel->name, out + i, in[i].name, true, true, TEXF_MIPMAP | TEXF_ISWORLD | TEXF_PICMIP | TEXF_COMPRESS, MATERIALFLAG_WALL);
5278 // restore the surfaceflags and supercontents
5279 out[i].surfaceflags = LittleLong(in[i].surfaceflags);
5280 out[i].supercontents = Mod_Q3BSP_SuperContentsFromNativeContents(LittleLong(in[i].contents));
5284 static void Mod_Q3BSP_LoadPlanes(lump_t *l)
5290 in = (q3dplane_t *)(mod_base + l->fileofs);
5291 if (l->filelen % sizeof(*in))
5292 Host_Error("Mod_Q3BSP_LoadPlanes: funny lump size in %s",loadmodel->name);
5293 count = l->filelen / sizeof(*in);
5294 out = (mplane_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5296 loadmodel->brush.data_planes = out;
5297 loadmodel->brush.num_planes = count;
5299 for (i = 0;i < count;i++, in++, out++)
5301 out->normal[0] = LittleFloat(in->normal[0]);
5302 out->normal[1] = LittleFloat(in->normal[1]);
5303 out->normal[2] = LittleFloat(in->normal[2]);
5304 out->dist = LittleFloat(in->dist);
5309 static void Mod_Q3BSP_LoadBrushSides(lump_t *l)
5312 q3mbrushside_t *out;
5315 in = (q3dbrushside_t *)(mod_base + l->fileofs);
5316 if (l->filelen % sizeof(*in))
5317 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
5318 count = l->filelen / sizeof(*in);
5319 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5321 loadmodel->brush.data_brushsides = out;
5322 loadmodel->brush.num_brushsides = count;
5324 for (i = 0;i < count;i++, in++, out++)
5326 n = LittleLong(in->planeindex);
5327 if (n < 0 || n >= loadmodel->brush.num_planes)
5328 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5329 out->plane = loadmodel->brush.data_planes + n;
5330 n = LittleLong(in->textureindex);
5331 if (n < 0 || n >= loadmodel->num_textures)
5332 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
5333 out->texture = loadmodel->data_textures + n;
5337 static void Mod_Q3BSP_LoadBrushSides_IG(lump_t *l)
5339 q3dbrushside_ig_t *in;
5340 q3mbrushside_t *out;
5343 in = (q3dbrushside_ig_t *)(mod_base + l->fileofs);
5344 if (l->filelen % sizeof(*in))
5345 Host_Error("Mod_Q3BSP_LoadBrushSides: funny lump size in %s",loadmodel->name);
5346 count = l->filelen / sizeof(*in);
5347 out = (q3mbrushside_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5349 loadmodel->brush.data_brushsides = out;
5350 loadmodel->brush.num_brushsides = count;
5352 for (i = 0;i < count;i++, in++, out++)
5354 n = LittleLong(in->planeindex);
5355 if (n < 0 || n >= loadmodel->brush.num_planes)
5356 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
5357 out->plane = loadmodel->brush.data_planes + n;
5358 n = LittleLong(in->textureindex);
5359 if (n < 0 || n >= loadmodel->num_textures)
5360 Host_Error("Mod_Q3BSP_LoadBrushSides: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
5361 out->texture = loadmodel->data_textures + n;
5365 static void Mod_Q3BSP_LoadBrushes(lump_t *l)
5369 int i, j, n, c, count, maxplanes, q3surfaceflags;
5370 colplanef_t *planes;
5372 in = (q3dbrush_t *)(mod_base + l->fileofs);
5373 if (l->filelen % sizeof(*in))
5374 Host_Error("Mod_Q3BSP_LoadBrushes: funny lump size in %s",loadmodel->name);
5375 count = l->filelen / sizeof(*in);
5376 out = (q3mbrush_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5378 loadmodel->brush.data_brushes = out;
5379 loadmodel->brush.num_brushes = count;
5384 for (i = 0;i < count;i++, in++, out++)
5386 n = LittleLong(in->firstbrushside);
5387 c = LittleLong(in->numbrushsides);
5388 if (n < 0 || n + c > loadmodel->brush.num_brushsides)
5389 Host_Error("Mod_Q3BSP_LoadBrushes: invalid brushside range %i : %i (%i brushsides)", n, n + c, loadmodel->brush.num_brushsides);
5390 out->firstbrushside = loadmodel->brush.data_brushsides + n;
5391 out->numbrushsides = c;
5392 n = LittleLong(in->textureindex);
5393 if (n < 0 || n >= loadmodel->num_textures)
5394 Host_Error("Mod_Q3BSP_LoadBrushes: invalid textureindex %i (%i textures)", n, loadmodel->num_textures);
5395 out->texture = loadmodel->data_textures + n;
5397 // make a list of mplane_t structs to construct a colbrush from
5398 if (maxplanes < out->numbrushsides)
5400 maxplanes = out->numbrushsides;
5403 planes = (colplanef_t *)Mem_Alloc(tempmempool, sizeof(colplanef_t) * maxplanes);
5406 for (j = 0;j < out->numbrushsides;j++)
5408 VectorCopy(out->firstbrushside[j].plane->normal, planes[j].normal);
5409 planes[j].dist = out->firstbrushside[j].plane->dist;
5410 planes[j].q3surfaceflags = out->firstbrushside[j].texture->surfaceflags;
5411 planes[j].texture = out->firstbrushside[j].texture;
5412 q3surfaceflags |= planes[j].q3surfaceflags;
5414 // make the colbrush from the planes
5415 out->colbrushf = Collision_NewBrushFromPlanes(loadmodel->mempool, out->numbrushsides, planes, out->texture->supercontents, q3surfaceflags, out->texture, true);
5417 // this whole loop can take a while (e.g. on redstarrepublic4)
5418 CL_KeepaliveMessage(false);
5424 static void Mod_Q3BSP_LoadEffects(lump_t *l)
5430 in = (q3deffect_t *)(mod_base + l->fileofs);
5431 if (l->filelen % sizeof(*in))
5432 Host_Error("Mod_Q3BSP_LoadEffects: funny lump size in %s",loadmodel->name);
5433 count = l->filelen / sizeof(*in);
5434 out = (q3deffect_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5436 loadmodel->brushq3.data_effects = out;
5437 loadmodel->brushq3.num_effects = count;
5439 for (i = 0;i < count;i++, in++, out++)
5441 strlcpy (out->shadername, in->shadername, sizeof (out->shadername));
5442 n = LittleLong(in->brushindex);
5443 if (n >= loadmodel->brush.num_brushes)
5445 Con_Printf("Mod_Q3BSP_LoadEffects: invalid brushindex %i (%i brushes), setting to -1\n", n, loadmodel->brush.num_brushes);
5448 out->brushindex = n;
5449 out->unknown = LittleLong(in->unknown);
5453 static void Mod_Q3BSP_LoadVertices(lump_t *l)
5458 in = (q3dvertex_t *)(mod_base + l->fileofs);
5459 if (l->filelen % sizeof(*in))
5460 Host_Error("Mod_Q3BSP_LoadVertices: funny lump size in %s",loadmodel->name);
5461 loadmodel->brushq3.num_vertices = count = l->filelen / sizeof(*in);
5462 loadmodel->brushq3.data_vertex3f = (float *)Mem_Alloc(loadmodel->mempool, count * (sizeof(float) * (3 + 3 + 2 + 2 + 4)));
5463 loadmodel->brushq3.data_normal3f = loadmodel->brushq3.data_vertex3f + count * 3;
5464 loadmodel->brushq3.data_texcoordtexture2f = loadmodel->brushq3.data_normal3f + count * 3;
5465 loadmodel->brushq3.data_texcoordlightmap2f = loadmodel->brushq3.data_texcoordtexture2f + count * 2;
5466 loadmodel->brushq3.data_color4f = loadmodel->brushq3.data_texcoordlightmap2f + count * 2;
5468 for (i = 0;i < count;i++, in++)
5470 loadmodel->brushq3.data_vertex3f[i * 3 + 0] = LittleFloat(in->origin3f[0]);
5471 loadmodel->brushq3.data_vertex3f[i * 3 + 1] = LittleFloat(in->origin3f[1]);
5472 loadmodel->brushq3.data_vertex3f[i * 3 + 2] = LittleFloat(in->origin3f[2]);
5473 loadmodel->brushq3.data_normal3f[i * 3 + 0] = LittleFloat(in->normal3f[0]);
5474 loadmodel->brushq3.data_normal3f[i * 3 + 1] = LittleFloat(in->normal3f[1]);
5475 loadmodel->brushq3.data_normal3f[i * 3 + 2] = LittleFloat(in->normal3f[2]);
5476 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 0] = LittleFloat(in->texcoord2f[0]);
5477 loadmodel->brushq3.data_texcoordtexture2f[i * 2 + 1] = LittleFloat(in->texcoord2f[1]);
5478 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 0] = LittleFloat(in->lightmap2f[0]);
5479 loadmodel->brushq3.data_texcoordlightmap2f[i * 2 + 1] = LittleFloat(in->lightmap2f[1]);
5480 // svector/tvector are calculated later in face loading
5481 if(mod_q3bsp_sRGBlightmaps.integer)
5483 // if lightmaps are sRGB, vertex colors are sRGB too, so we need to linearize them
5484 // note: when this is in use, lightmap color 128 is no longer neutral, but "sRGB half power" is
5485 // working like this may be odd, but matches q3map2 -gamma 2.2
5486 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5488 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
5489 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
5490 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
5491 // we fix the brightness consistently via lightmapscale
5495 loadmodel->brushq3.data_color4f[i * 4 + 0] = Image_LinearFloatFromsRGB(in->color4ub[0]);
5496 loadmodel->brushq3.data_color4f[i * 4 + 1] = Image_LinearFloatFromsRGB(in->color4ub[1]);
5497 loadmodel->brushq3.data_color4f[i * 4 + 2] = Image_LinearFloatFromsRGB(in->color4ub[2]);
5502 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5504 loadmodel->brushq3.data_color4f[i * 4 + 0] = Image_sRGBFloatFromLinear_Lightmap(in->color4ub[0]);
5505 loadmodel->brushq3.data_color4f[i * 4 + 1] = Image_sRGBFloatFromLinear_Lightmap(in->color4ub[1]);
5506 loadmodel->brushq3.data_color4f[i * 4 + 2] = Image_sRGBFloatFromLinear_Lightmap(in->color4ub[2]);
5510 loadmodel->brushq3.data_color4f[i * 4 + 0] = in->color4ub[0] * (1.0f / 255.0f);
5511 loadmodel->brushq3.data_color4f[i * 4 + 1] = in->color4ub[1] * (1.0f / 255.0f);
5512 loadmodel->brushq3.data_color4f[i * 4 + 2] = in->color4ub[2] * (1.0f / 255.0f);
5515 loadmodel->brushq3.data_color4f[i * 4 + 3] = in->color4ub[3] * (1.0f / 255.0f);
5516 if(in->color4ub[0] != 255 || in->color4ub[1] != 255 || in->color4ub[2] != 255)
5517 loadmodel->lit = true;
5521 static void Mod_Q3BSP_LoadTriangles(lump_t *l)
5527 in = (int *)(mod_base + l->fileofs);
5528 if (l->filelen % sizeof(int[3]))
5529 Host_Error("Mod_Q3BSP_LoadTriangles: funny lump size in %s",loadmodel->name);
5530 count = l->filelen / sizeof(*in);
5532 if(!loadmodel->brushq3.num_vertices)
5535 Con_Printf("Mod_Q3BSP_LoadTriangles: %s has triangles but no vertexes, broken compiler, ignoring problem\n", loadmodel->name);
5536 loadmodel->brushq3.num_triangles = 0;
5540 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5541 loadmodel->brushq3.num_triangles = count / 3;
5542 loadmodel->brushq3.data_element3i = out;
5544 for (i = 0;i < count;i++, in++, out++)
5546 *out = LittleLong(*in);
5547 if (*out < 0 || *out >= loadmodel->brushq3.num_vertices)
5549 Con_Printf("Mod_Q3BSP_LoadTriangles: invalid vertexindex %i (%i vertices), setting to 0\n", *out, loadmodel->brushq3.num_vertices);
5555 static void Mod_Q3BSP_LoadLightmaps(lump_t *l, lump_t *faceslump)
5557 q3dlightmap_t *input_pointer;
5575 int mergedrowsxcolumns;
5580 unsigned char *mergedpixels;
5581 unsigned char *mergeddeluxepixels;
5582 unsigned char *mergebuf;
5583 char mapname[MAX_QPATH];
5585 unsigned char *inpixels[10000]; // max count q3map2 can output (it uses 4 digits)
5588 // defaults for q3bsp
5595 loadmodel->brushq3.lightmapsize = 128;
5597 if (cls.state == ca_dedicated)
5600 if(mod_q3bsp_nolightmaps.integer)
5606 // prefer internal LMs for compatibility (a BSP contains no info on whether external LMs exist)
5607 if (developer_loading.integer)
5608 Con_Printf("Using internal lightmaps\n");
5609 input_pointer = (q3dlightmap_t *)(mod_base + l->fileofs);
5610 if (l->filelen % sizeof(*input_pointer))
5611 Host_Error("Mod_Q3BSP_LoadLightmaps: funny lump size in %s",loadmodel->name);
5612 count = l->filelen / sizeof(*input_pointer);
5613 for(i = 0; i < count; ++i)
5614 inpixels[i] = input_pointer[i].rgb;
5618 // no internal lightmaps
5619 // try external lightmaps
5620 if (developer_loading.integer)
5621 Con_Printf("Using external lightmaps\n");
5622 FS_StripExtension(loadmodel->name, mapname, sizeof(mapname));
5623 inpixels[0] = loadimagepixelsbgra(va(vabuf, sizeof(vabuf), "%s/lm_%04d", mapname, 0), false, false, false, NULL);
5627 // using EXTERNAL lightmaps instead
5628 if(image_width != (int) CeilPowerOf2(image_width) || image_width != image_height)
5630 Mem_Free(inpixels[0]);
5631 Host_Error("Mod_Q3BSP_LoadLightmaps: invalid external lightmap size in %s",loadmodel->name);
5641 for(count = 1; ; ++count)
5643 inpixels[count] = loadimagepixelsbgra(va(vabuf, sizeof(vabuf), "%s/lm_%04d", mapname, count), false, false, false, NULL);
5644 if(!inpixels[count])
5645 break; // we got all of them
5646 if(image_width != size || image_height != size)
5648 Mem_Free(inpixels[count]);
5649 inpixels[count] = NULL;
5650 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);
5656 loadmodel->brushq3.lightmapsize = size;
5657 loadmodel->brushq3.num_originallightmaps = count;
5659 // now check the surfaces to see if any of them index an odd numbered
5660 // lightmap, if so this is not a deluxemapped bsp file
5662 // also check what lightmaps are actually used, because q3map2 sometimes
5663 // (always?) makes an unused one at the end, which
5664 // q3map2 sometimes (or always?) makes a second blank lightmap for no
5665 // reason when only one lightmap is used, which can throw off the
5666 // deluxemapping detection method, so check 2-lightmap bsp's specifically
5667 // to see if the second lightmap is blank, if so it is not deluxemapped.
5668 // VorteX: autodetect only if previous attempt to find "deluxeMaps" key
5669 // in Mod_Q3BSP_LoadEntities was failed
5670 if (!loadmodel->brushq3.deluxemapping)
5672 loadmodel->brushq3.deluxemapping = !(count & 1);
5673 loadmodel->brushq3.deluxemapping_modelspace = true;
5675 if (loadmodel->brushq3.deluxemapping)
5677 int facecount = faceslump->filelen / sizeof(q3dface_t);
5678 q3dface_t *faces = (q3dface_t *)(mod_base + faceslump->fileofs);
5679 for (i = 0;i < facecount;i++)
5681 j = LittleLong(faces[i].lightmapindex);
5684 endlightmap = max(endlightmap, j + 1);
5685 if ((j & 1) || j + 1 >= count)
5687 loadmodel->brushq3.deluxemapping = false;
5694 // q3map2 sometimes (or always?) makes a second blank lightmap for no
5695 // reason when only one lightmap is used, which can throw off the
5696 // deluxemapping detection method, so check 2-lightmap bsp's specifically
5697 // to see if the second lightmap is blank, if so it is not deluxemapped.
5699 // further research has shown q3map2 sometimes creates a deluxemap and two
5700 // blank lightmaps, which must be handled properly as well
5701 if (endlightmap == 1 && count > 1)
5704 for (i = 0;i < size*size;i++)
5706 if (c[bytesperpixel*i + rgbmap[0]])
5708 if (c[bytesperpixel*i + rgbmap[1]])
5710 if (c[bytesperpixel*i + rgbmap[2]])
5715 // all pixels in the unused lightmap were black...
5716 loadmodel->brushq3.deluxemapping = false;
5721 Con_DPrintf("%s is %sdeluxemapped\n", loadmodel->name, loadmodel->brushq3.deluxemapping ? "" : "not ");
5723 // figure out what the most reasonable merge power is within limits
5725 // find the appropriate NxN dimensions to merge to, to avoid wasted space
5726 realcount = count >> (int)loadmodel->brushq3.deluxemapping;
5728 // figure out how big the merged texture has to be
5729 mergegoal = 128<<bound(0, mod_q3bsp_lightmapmergepower.integer, 6);
5730 mergegoal = bound(size, mergegoal, (int)vid.maxtexturesize_2d);
5731 while (mergegoal > size && mergegoal * mergegoal / 4 >= size * size * realcount)
5733 mergedwidth = mergegoal;
5734 mergedheight = mergegoal;
5735 // choose non-square size (2x1 aspect) if only half the space is used;
5736 // this really only happens when the entire set fits in one texture, if
5737 // there are multiple textures, we don't worry about shrinking the last
5738 // one to fit, because the driver prefers the same texture size on
5739 // consecutive draw calls...
5740 if (mergedwidth * mergedheight / 2 >= size*size*realcount)
5743 loadmodel->brushq3.num_lightmapmergedwidthpower = 0;
5744 loadmodel->brushq3.num_lightmapmergedheightpower = 0;
5745 while (mergedwidth > size<<loadmodel->brushq3.num_lightmapmergedwidthpower)
5746 loadmodel->brushq3.num_lightmapmergedwidthpower++;
5747 while (mergedheight > size<<loadmodel->brushq3.num_lightmapmergedheightpower)
5748 loadmodel->brushq3.num_lightmapmergedheightpower++;
5749 loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower = loadmodel->brushq3.num_lightmapmergedwidthpower + loadmodel->brushq3.num_lightmapmergedheightpower + (loadmodel->brushq3.deluxemapping ? 1 : 0);
5751 powerx = loadmodel->brushq3.num_lightmapmergedwidthpower;
5752 powery = loadmodel->brushq3.num_lightmapmergedheightpower;
5753 powerxy = powerx+powery;
5754 powerdxy = loadmodel->brushq3.deluxemapping + powerxy;
5756 mergedcolumns = 1 << powerx;
5757 mergedrows = 1 << powery;
5758 mergedrowsxcolumns = 1 << powerxy;
5760 loadmodel->brushq3.num_mergedlightmaps = (realcount + (1 << powerxy) - 1) >> powerxy;
5761 loadmodel->brushq3.data_lightmaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
5762 if (loadmodel->brushq3.deluxemapping)
5763 loadmodel->brushq3.data_deluxemaps = (rtexture_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brushq3.num_mergedlightmaps * sizeof(rtexture_t *));
5765 // allocate a texture pool if we need it
5766 if (loadmodel->texturepool == NULL)
5767 loadmodel->texturepool = R_AllocTexturePool();
5769 mergedpixels = (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4);
5770 mergeddeluxepixels = loadmodel->brushq3.deluxemapping ? (unsigned char *) Mem_Alloc(tempmempool, mergedwidth * mergedheight * 4) : NULL;
5771 for (i = 0;i < count;i++)
5773 // figure out which merged lightmap texture this fits into
5774 realindex = i >> (int)loadmodel->brushq3.deluxemapping;
5775 lightmapindex = i >> powerdxy;
5777 // choose the destination address
5778 mergebuf = (loadmodel->brushq3.deluxemapping && (i & 1)) ? mergeddeluxepixels : mergedpixels;
5779 mergebuf += 4 * (realindex & (mergedcolumns-1))*size + 4 * ((realindex >> powerx) & (mergedrows-1))*mergedwidth*size;
5780 if ((i & 1) == 0 || !loadmodel->brushq3.deluxemapping)
5781 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);
5783 // convert pixels from RGB or BGRA while copying them into the destination rectangle
5784 for (j = 0;j < size;j++)
5785 for (k = 0;k < size;k++)
5787 mergebuf[(j*mergedwidth+k)*4+0] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[0]];
5788 mergebuf[(j*mergedwidth+k)*4+1] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[1]];
5789 mergebuf[(j*mergedwidth+k)*4+2] = inpixels[i][(j*size+k)*bytesperpixel+rgbmap[2]];
5790 mergebuf[(j*mergedwidth+k)*4+3] = 255;
5793 // upload texture if this was the last tile being written to the texture
5794 if (((realindex + 1) & (mergedrowsxcolumns - 1)) == 0 || (realindex + 1) == realcount)
5796 if (loadmodel->brushq3.deluxemapping && (i & 1))
5797 loadmodel->brushq3.data_deluxemaps[lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va(vabuf, sizeof(vabuf), "deluxemap%04i", lightmapindex), mergedwidth, mergedheight, mergeddeluxepixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | (gl_texturecompression_q3bspdeluxemaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
5800 if(mod_q3bsp_sRGBlightmaps.integer)
5803 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5805 t = TEXTYPE_BGRA; // in stupid fallback mode, we upload lightmaps in sRGB form and just fix their brightness
5806 // we fix the brightness consistently via lightmapscale
5809 t = TEXTYPE_SRGB_BGRA; // normally, we upload lightmaps in sRGB form (possibly downconverted to linear)
5810 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va(vabuf, sizeof(vabuf), "lightmap%04i", lightmapindex), mergedwidth, mergedheight, mergedpixels, t, TEXF_FORCELINEAR | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
5814 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
5815 Image_MakesRGBColorsFromLinear_Lightmap(mergedpixels, mergedpixels, mergedwidth * mergedheight);
5816 loadmodel->brushq3.data_lightmaps [lightmapindex] = R_LoadTexture2D(loadmodel->texturepool, va(vabuf, sizeof(vabuf), "lightmap%04i", lightmapindex), mergedwidth, mergedheight, mergedpixels, TEXTYPE_BGRA, TEXF_FORCELINEAR | (gl_texturecompression_q3bsplightmaps.integer ? TEXF_COMPRESS : 0), -1, NULL);
5822 if (mergeddeluxepixels)
5823 Mem_Free(mergeddeluxepixels);
5824 Mem_Free(mergedpixels);
5827 for(i = 0; i < count; ++i)
5828 Mem_Free(inpixels[i]);
5832 static void Mod_Q3BSP_BuildBBoxes(const int *element3i, int num_triangles, const float *vertex3f, float **collisionbbox6f, int *collisionstride, int stride)
5837 *collisionstride = stride;
5840 cnt = (num_triangles + stride - 1) / stride;
5841 *collisionbbox6f = (float *) Mem_Alloc(loadmodel->mempool, sizeof(float[6]) * cnt);
5842 for(j = 0; j < cnt; ++j)
5844 mins = &((*collisionbbox6f)[6 * j + 0]);
5845 maxs = &((*collisionbbox6f)[6 * j + 3]);
5846 for(k = 0; k < stride; ++k)
5848 tri = j * stride + k;
5849 if(tri >= num_triangles)
5851 vert = &(vertex3f[element3i[3 * tri + 0] * 3]);
5852 if(!k || vert[0] < mins[0]) mins[0] = vert[0];
5853 if(!k || vert[1] < mins[1]) mins[1] = vert[1];
5854 if(!k || vert[2] < mins[2]) mins[2] = vert[2];
5855 if(!k || vert[0] > maxs[0]) maxs[0] = vert[0];
5856 if(!k || vert[1] > maxs[1]) maxs[1] = vert[1];
5857 if(!k || vert[2] > maxs[2]) maxs[2] = vert[2];
5858 vert = &(vertex3f[element3i[3 * tri + 1] * 3]);
5859 if(vert[0] < mins[0]) mins[0] = vert[0];
5860 if(vert[1] < mins[1]) mins[1] = vert[1];
5861 if(vert[2] < mins[2]) mins[2] = vert[2];
5862 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5863 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5864 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5865 vert = &(vertex3f[element3i[3 * tri + 2] * 3]);
5866 if(vert[0] < mins[0]) mins[0] = vert[0];
5867 if(vert[1] < mins[1]) mins[1] = vert[1];
5868 if(vert[2] < mins[2]) mins[2] = vert[2];
5869 if(vert[0] > maxs[0]) maxs[0] = vert[0];
5870 if(vert[1] > maxs[1]) maxs[1] = vert[1];
5871 if(vert[2] > maxs[2]) maxs[2] = vert[2];
5876 *collisionbbox6f = NULL;
5879 typedef struct patchtess_s
5883 // Auxiliary data used only by patch loading code in Mod_Q3BSP_LoadFaces
5886 float *originalvertex3f;
5889 #define PATCHTESS_SAME_LODGROUP(a,b) \
5891 (a).lodgroup[0] == (b).lodgroup[0] && \
5892 (a).lodgroup[1] == (b).lodgroup[1] && \
5893 (a).lodgroup[2] == (b).lodgroup[2] && \
5894 (a).lodgroup[3] == (b).lodgroup[3] && \
5895 (a).lodgroup[4] == (b).lodgroup[4] && \
5896 (a).lodgroup[5] == (b).lodgroup[5] \
5899 static void Mod_Q3BSP_LoadFaces(lump_t *l)
5901 q3dface_t *in, *oldin;
5902 msurface_t *out, *oldout;
5903 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;
5904 float lightmaptcbase[2], lightmaptcscale[2];
5905 //int *originalelement3i;
5906 float *originalvertex3f;
5907 //float *originalsvector3f;
5908 //float *originaltvector3f;
5909 float *originalnormal3f;
5910 float *originalcolor4f;
5911 float *originaltexcoordtexture2f;
5912 float *originaltexcoordlightmap2f;
5913 float *surfacecollisionvertex3f;
5914 int *surfacecollisionelement3i;
5916 patchtess_t *patchtess = NULL;
5917 int patchtesscount = 0;
5920 in = (q3dface_t *)(mod_base + l->fileofs);
5921 if (l->filelen % sizeof(*in))
5922 Host_Error("Mod_Q3BSP_LoadFaces: funny lump size in %s",loadmodel->name);
5923 count = l->filelen / sizeof(*in);
5924 out = (msurface_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
5926 loadmodel->data_surfaces = out;
5927 loadmodel->num_surfaces = count;
5930 patchtess = (patchtess_t*) Mem_Alloc(tempmempool, count * sizeof(*patchtess));
5938 for (;i < count;i++, in++, out++)
5940 // check face type first
5941 type = LittleLong(in->type);
5942 if (type != Q3FACETYPE_FLAT
5943 && type != Q3FACETYPE_PATCH
5944 && type != Q3FACETYPE_MESH
5945 && type != Q3FACETYPE_FLARE)
5947 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: unknown face type %i\n", i, type);
5951 n = LittleLong(in->textureindex);
5952 if (n < 0 || n >= loadmodel->num_textures)
5954 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i: invalid textureindex %i (%i textures)\n", i, n, loadmodel->num_textures);
5957 out->texture = loadmodel->data_textures + n;
5958 n = LittleLong(in->effectindex);
5959 if (n < -1 || n >= loadmodel->brushq3.num_effects)
5961 if (developer_extra.integer)
5962 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid effectindex %i (%i effects)\n", i, out->texture->name, n, loadmodel->brushq3.num_effects);
5968 out->effect = loadmodel->brushq3.data_effects + n;
5970 if (cls.state != ca_dedicated)
5972 out->lightmaptexture = NULL;
5973 out->deluxemaptexture = r_texture_blanknormalmap;
5974 n = LittleLong(in->lightmapindex);
5977 else if (n >= loadmodel->brushq3.num_originallightmaps)
5979 if(loadmodel->brushq3.num_originallightmaps != 0)
5980 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid lightmapindex %i (%i lightmaps)\n", i, out->texture->name, n, loadmodel->brushq3.num_originallightmaps);
5985 out->lightmaptexture = loadmodel->brushq3.data_lightmaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5986 if (loadmodel->brushq3.deluxemapping)
5987 out->deluxemaptexture = loadmodel->brushq3.data_deluxemaps[n >> loadmodel->brushq3.num_lightmapmergedwidthheightdeluxepower];
5988 loadmodel->lit = true;
5992 firstvertex = LittleLong(in->firstvertex);
5993 numvertices = LittleLong(in->numvertices);
5994 firstelement = LittleLong(in->firstelement);
5995 numtriangles = LittleLong(in->numelements) / 3;
5996 if (numtriangles * 3 != LittleLong(in->numelements))
5998 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));
6001 if (firstvertex < 0 || firstvertex + numvertices > loadmodel->brushq3.num_vertices)
6003 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);
6006 if (firstelement < 0 || firstelement + numtriangles * 3 > loadmodel->brushq3.num_triangles * 3)
6008 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);
6013 case Q3FACETYPE_FLAT:
6014 case Q3FACETYPE_MESH:
6015 // no processing necessary
6017 case Q3FACETYPE_PATCH:
6018 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
6019 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
6020 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))
6022 Con_Printf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): invalid patchsize %ix%i\n", i, out->texture->name, patchsize[0], patchsize[1]);
6025 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
6027 // convert patch to Q3FACETYPE_MESH
6028 xtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
6029 ytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_tolerance.value);
6030 // bound to user settings
6031 xtess = bound(r_subdivisions_mintess.integer, xtess, r_subdivisions_maxtess.integer);
6032 ytess = bound(r_subdivisions_mintess.integer, ytess, r_subdivisions_maxtess.integer);
6033 // bound to sanity settings
6034 xtess = bound(0, xtess, 1024);
6035 ytess = bound(0, ytess, 1024);
6037 // lower quality collision patches! Same procedure as before, but different cvars
6038 // convert patch to Q3FACETYPE_MESH
6039 cxtess = Q3PatchTesselationOnX(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
6040 cytess = Q3PatchTesselationOnY(patchsize[0], patchsize[1], 3, originalvertex3f, r_subdivisions_collision_tolerance.value);
6041 // bound to user settings
6042 cxtess = bound(r_subdivisions_collision_mintess.integer, cxtess, r_subdivisions_collision_maxtess.integer);
6043 cytess = bound(r_subdivisions_collision_mintess.integer, cytess, r_subdivisions_collision_maxtess.integer);
6044 // bound to sanity settings
6045 cxtess = bound(0, cxtess, 1024);
6046 cytess = bound(0, cytess, 1024);
6048 // store it for the LOD grouping step
6049 patchtess[patchtesscount].info.xsize = patchsize[0];
6050 patchtess[patchtesscount].info.ysize = patchsize[1];
6051 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].xtess = xtess;
6052 patchtess[patchtesscount].info.lods[PATCH_LOD_VISUAL].ytess = ytess;
6053 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].xtess = cxtess;
6054 patchtess[patchtesscount].info.lods[PATCH_LOD_COLLISION].ytess = cytess;
6056 patchtess[patchtesscount].surface_id = i;
6057 patchtess[patchtesscount].lodgroup[0] = LittleFloat(in->specific.patch.mins[0]);
6058 patchtess[patchtesscount].lodgroup[1] = LittleFloat(in->specific.patch.mins[1]);
6059 patchtess[patchtesscount].lodgroup[2] = LittleFloat(in->specific.patch.mins[2]);
6060 patchtess[patchtesscount].lodgroup[3] = LittleFloat(in->specific.patch.maxs[0]);
6061 patchtess[patchtesscount].lodgroup[4] = LittleFloat(in->specific.patch.maxs[1]);
6062 patchtess[patchtesscount].lodgroup[5] = LittleFloat(in->specific.patch.maxs[2]);
6063 patchtess[patchtesscount].originalvertex3f = originalvertex3f;
6066 case Q3FACETYPE_FLARE:
6067 if (developer_extra.integer)
6068 Con_DPrintf("Mod_Q3BSP_LoadFaces: face #%i (texture \"%s\"): Q3FACETYPE_FLARE not supported (yet)\n", i, out->texture->name);
6072 out->num_vertices = numvertices;
6073 out->num_triangles = numtriangles;
6074 meshvertices += out->num_vertices;
6075 meshtriangles += out->num_triangles;
6078 // Fix patches tesselations so that they make no seams
6082 for(i = 0; i < patchtesscount; ++i)
6084 for(j = i+1; j < patchtesscount; ++j)
6086 if (!PATCHTESS_SAME_LODGROUP(patchtess[i], patchtess[j]))
6089 if (Q3PatchAdjustTesselation(3, &patchtess[i].info, patchtess[i].originalvertex3f, &patchtess[j].info, patchtess[j].originalvertex3f) )
6096 // Calculate resulting number of triangles
6097 collisionvertices = 0;
6098 collisiontriangles = 0;
6099 for(i = 0; i < patchtesscount; ++i)
6101 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_VISUAL].xtess);
6102 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_VISUAL].ytess);
6103 numvertices = finalwidth * finalheight;
6104 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
6106 oldout[patchtess[i].surface_id].num_vertices = numvertices;
6107 oldout[patchtess[i].surface_id].num_triangles = numtriangles;
6108 meshvertices += oldout[patchtess[i].surface_id].num_vertices;
6109 meshtriangles += oldout[patchtess[i].surface_id].num_triangles;
6111 finalwidth = Q3PatchDimForTess(patchtess[i].info.xsize, patchtess[i].info.lods[PATCH_LOD_COLLISION].xtess);
6112 finalheight = Q3PatchDimForTess(patchtess[i].info.ysize,patchtess[i].info.lods[PATCH_LOD_COLLISION].ytess);
6113 numvertices = finalwidth * finalheight;
6114 numtriangles = (finalwidth - 1) * (finalheight - 1) * 2;
6116 oldout[patchtess[i].surface_id].num_collisionvertices = numvertices;
6117 oldout[patchtess[i].surface_id].num_collisiontriangles = numtriangles;
6118 collisionvertices += oldout[patchtess[i].surface_id].num_collisionvertices;
6119 collisiontriangles += oldout[patchtess[i].surface_id].num_collisiontriangles;
6125 Mod_AllocSurfMesh(loadmodel->mempool, meshvertices, meshtriangles, false, true);
6126 if (collisiontriangles)
6128 loadmodel->brush.data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, collisionvertices * sizeof(float[3]));
6129 loadmodel->brush.data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, collisiontriangles * sizeof(int[3]));
6133 collisionvertices = 0;
6134 collisiontriangles = 0;
6135 for (;i < count && meshvertices + out->num_vertices <= loadmodel->surfmesh.num_vertices;i++, in++, out++)
6137 if (out->num_vertices < 3 || out->num_triangles < 1)
6140 type = LittleLong(in->type);
6141 firstvertex = LittleLong(in->firstvertex);
6142 firstelement = LittleLong(in->firstelement);
6143 out->num_firstvertex = meshvertices;
6144 out->num_firsttriangle = meshtriangles;
6145 out->num_firstcollisiontriangle = collisiontriangles;
6148 case Q3FACETYPE_FLAT:
6149 case Q3FACETYPE_MESH:
6150 // no processing necessary, except for lightmap merging
6151 for (j = 0;j < out->num_vertices;j++)
6153 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 0];
6154 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 1];
6155 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_vertex3f[(firstvertex + j) * 3 + 2];
6156 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 0] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 0];
6157 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 1] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 1];
6158 (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex)[j * 3 + 2] = loadmodel->brushq3.data_normal3f[(firstvertex + j) * 3 + 2];
6159 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 0];
6160 (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordtexture2f[(firstvertex + j) * 2 + 1];
6161 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 0] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 0];
6162 (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex)[j * 2 + 1] = loadmodel->brushq3.data_texcoordlightmap2f[(firstvertex + j) * 2 + 1];
6163 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 0] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 0];
6164 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 1] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 1];
6165 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 2] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 2];
6166 (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex)[j * 4 + 3] = loadmodel->brushq3.data_color4f[(firstvertex + j) * 4 + 3];
6168 for (j = 0;j < out->num_triangles*3;j++)
6169 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = loadmodel->brushq3.data_element3i[firstelement + j] + out->num_firstvertex;
6171 case Q3FACETYPE_PATCH:
6172 patchsize[0] = LittleLong(in->specific.patch.patchsize[0]);
6173 patchsize[1] = LittleLong(in->specific.patch.patchsize[1]);
6174 originalvertex3f = loadmodel->brushq3.data_vertex3f + firstvertex * 3;
6175 originalnormal3f = loadmodel->brushq3.data_normal3f + firstvertex * 3;
6176 originaltexcoordtexture2f = loadmodel->brushq3.data_texcoordtexture2f + firstvertex * 2;
6177 originaltexcoordlightmap2f = loadmodel->brushq3.data_texcoordlightmap2f + firstvertex * 2;
6178 originalcolor4f = loadmodel->brushq3.data_color4f + firstvertex * 4;
6180 xtess = ytess = cxtess = cytess = -1;
6181 for(j = 0; j < patchtesscount; ++j)
6182 if(patchtess[j].surface_id == i)
6184 xtess = patchtess[j].info.lods[PATCH_LOD_VISUAL].xtess;
6185 ytess = patchtess[j].info.lods[PATCH_LOD_VISUAL].ytess;
6186 cxtess = patchtess[j].info.lods[PATCH_LOD_COLLISION].xtess;
6187 cytess = patchtess[j].info.lods[PATCH_LOD_COLLISION].ytess;
6192 Con_Printf("ERROR: patch %d isn't preprocessed?!?\n", i);
6193 xtess = ytess = cxtess = cytess = 0;
6196 finalwidth = Q3PatchDimForTess(patchsize[0],xtess); //((patchsize[0] - 1) * xtess) + 1;
6197 finalheight = Q3PatchDimForTess(patchsize[1],ytess); //((patchsize[1] - 1) * ytess) + 1;
6198 finalvertices = finalwidth * finalheight;
6199 oldnumtriangles = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
6200 type = Q3FACETYPE_MESH;
6201 // generate geometry
6202 // (note: normals are skipped because they get recalculated)
6203 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, xtess, ytess);
6204 Q3PatchTesselateFloat(3, sizeof(float[3]), (loadmodel->surfmesh.data_normal3f + 3 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[3]), originalnormal3f, xtess, ytess);
6205 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordtexture2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordtexture2f, xtess, ytess);
6206 Q3PatchTesselateFloat(2, sizeof(float[2]), (loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[2]), originaltexcoordlightmap2f, xtess, ytess);
6207 Q3PatchTesselateFloat(4, sizeof(float[4]), (loadmodel->surfmesh.data_lightmapcolor4f + 4 * out->num_firstvertex), patchsize[0], patchsize[1], sizeof(float[4]), originalcolor4f, xtess, ytess);
6208 Q3PatchTriangleElements((loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle), finalwidth, finalheight, out->num_firstvertex);
6210 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);
6212 if (developer_extra.integer)
6214 if (out->num_triangles < finaltriangles)
6215 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);
6217 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);
6219 // q3map does not put in collision brushes for curves... ugh
6220 // build the lower quality collision geometry
6221 finalwidth = Q3PatchDimForTess(patchsize[0],cxtess); //((patchsize[0] - 1) * cxtess) + 1;
6222 finalheight = Q3PatchDimForTess(patchsize[1],cytess); //((patchsize[1] - 1) * cytess) + 1;
6223 finalvertices = finalwidth * finalheight;
6224 oldnumtriangles2 = finaltriangles = (finalwidth - 1) * (finalheight - 1) * 2;
6226 // legacy collision geometry implementation
6227 out->deprecatedq3data_collisionvertex3f = (float *)Mem_Alloc(loadmodel->mempool, sizeof(float[3]) * finalvertices);
6228 out->deprecatedq3data_collisionelement3i = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int[3]) * finaltriangles);
6229 out->num_collisionvertices = finalvertices;
6230 out->num_collisiontriangles = finaltriangles;
6231 Q3PatchTesselateFloat(3, sizeof(float[3]), out->deprecatedq3data_collisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
6232 Q3PatchTriangleElements(out->deprecatedq3data_collisionelement3i, finalwidth, finalheight, 0);
6234 //Mod_SnapVertices(3, out->num_vertices, (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), 0.25);
6235 Mod_SnapVertices(3, finalvertices, out->deprecatedq3data_collisionvertex3f, 1);
6237 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionelement3i, out->deprecatedq3data_collisionvertex3f);
6239 // now optimize the collision mesh by finding triangle bboxes...
6240 Mod_Q3BSP_BuildBBoxes(out->deprecatedq3data_collisionelement3i, out->num_collisiontriangles, out->deprecatedq3data_collisionvertex3f, &out->deprecatedq3data_collisionbbox6f, &out->deprecatedq3num_collisionbboxstride, mod_q3bsp_curves_collisions_stride.integer);
6241 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);
6243 // store collision geometry for BIH collision tree
6244 surfacecollisionvertex3f = loadmodel->brush.data_collisionvertex3f + collisionvertices * 3;
6245 surfacecollisionelement3i = loadmodel->brush.data_collisionelement3i + collisiontriangles * 3;
6246 Q3PatchTesselateFloat(3, sizeof(float[3]), surfacecollisionvertex3f, patchsize[0], patchsize[1], sizeof(float[3]), originalvertex3f, cxtess, cytess);
6247 Q3PatchTriangleElements(surfacecollisionelement3i, finalwidth, finalheight, collisionvertices);
6248 Mod_SnapVertices(3, finalvertices, surfacecollisionvertex3f, 1);
6250 // remove this once the legacy code is removed
6252 int nc = out->num_collisiontriangles;
6254 out->num_collisiontriangles = Mod_RemoveDegenerateTriangles(finaltriangles, surfacecollisionelement3i, surfacecollisionelement3i, loadmodel->brush.data_collisionvertex3f);
6256 if(nc != out->num_collisiontriangles)
6258 Con_Printf("number of collision triangles differs between BIH and BSP. FAIL.\n");
6263 if (developer_extra.integer)
6264 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);
6266 collisionvertices += finalvertices;
6267 collisiontriangles += out->num_collisiontriangles;
6272 meshvertices += out->num_vertices;
6273 meshtriangles += out->num_triangles;
6274 for (j = 0, invalidelements = 0;j < out->num_triangles * 3;j++)
6275 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)
6277 if (invalidelements)
6279 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);
6280 for (j = 0;j < out->num_triangles * 3;j++)
6282 Con_Printf(" %i", (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] - out->num_firstvertex);
6283 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)
6284 (loadmodel->surfmesh.data_element3i + 3 * out->num_firsttriangle)[j] = out->num_firstvertex;
6288 // calculate a bounding box
6289 VectorClear(out->mins);
6290 VectorClear(out->maxs);
6291 if (out->num_vertices)
6293 if (cls.state != ca_dedicated && out->lightmaptexture)
6295 // figure out which part of the merged lightmap this fits into
6296 int lightmapindex = LittleLong(in->lightmapindex) >> (loadmodel->brushq3.deluxemapping ? 1 : 0);
6297 int mergewidth = R_TextureWidth(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
6298 int mergeheight = R_TextureHeight(out->lightmaptexture) / loadmodel->brushq3.lightmapsize;
6299 lightmapindex &= mergewidth * mergeheight - 1;
6300 lightmaptcscale[0] = 1.0f / mergewidth;
6301 lightmaptcscale[1] = 1.0f / mergeheight;
6302 lightmaptcbase[0] = (lightmapindex % mergewidth) * lightmaptcscale[0];
6303 lightmaptcbase[1] = (lightmapindex / mergewidth) * lightmaptcscale[1];
6304 // modify the lightmap texcoords to match this region of the merged lightmap
6305 for (j = 0, v = loadmodel->surfmesh.data_texcoordlightmap2f + 2 * out->num_firstvertex;j < out->num_vertices;j++, v += 2)
6307 v[0] = v[0] * lightmaptcscale[0] + lightmaptcbase[0];
6308 v[1] = v[1] * lightmaptcscale[1] + lightmaptcbase[1];
6311 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->mins);
6312 VectorCopy((loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex), out->maxs);
6313 for (j = 1, v = (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex) + 3;j < out->num_vertices;j++, v += 3)
6315 out->mins[0] = min(out->mins[0], v[0]);
6316 out->maxs[0] = max(out->maxs[0], v[0]);
6317 out->mins[1] = min(out->mins[1], v[1]);
6318 out->maxs[1] = max(out->maxs[1], v[1]);
6319 out->mins[2] = min(out->mins[2], v[2]);
6320 out->maxs[2] = max(out->maxs[2], v[2]);
6322 out->mins[0] -= 1.0f;
6323 out->mins[1] -= 1.0f;
6324 out->mins[2] -= 1.0f;
6325 out->maxs[0] += 1.0f;
6326 out->maxs[1] += 1.0f;
6327 out->maxs[2] += 1.0f;
6329 // set lightmap styles for consistency with q1bsp
6330 //out->lightmapinfo->styles[0] = 0;
6331 //out->lightmapinfo->styles[1] = 255;
6332 //out->lightmapinfo->styles[2] = 255;
6333 //out->lightmapinfo->styles[3] = 255;
6338 for (;i < count;i++, out++)
6340 if(out->num_vertices && out->num_triangles)
6342 if(out->num_vertices == 0)
6344 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no vertices, ignoring\n", i, out->texture ? out->texture->name : "(none)");
6345 if(out->num_triangles == 0)
6346 Con_Printf("Mod_Q3BSP_LoadFaces: surface %d (texture %s) has no triangles, ignoring\n", i, out->texture ? out->texture->name : "(none)");
6348 else if(out->num_triangles == 0)
6349 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)",
6350 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[0 * 3 + 0],
6351 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[1 * 3 + 0],
6352 (loadmodel->surfmesh.data_vertex3f + 3 * out->num_firstvertex)[2 * 3 + 0]);
6355 // for per pixel lighting
6356 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);
6358 // generate ushort elements array if possible
6359 if (loadmodel->surfmesh.data_element3s)
6360 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
6361 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
6363 // free the no longer needed vertex data
6364 loadmodel->brushq3.num_vertices = 0;
6365 if (loadmodel->brushq3.data_vertex3f)
6366 Mem_Free(loadmodel->brushq3.data_vertex3f);
6367 loadmodel->brushq3.data_vertex3f = NULL;
6368 loadmodel->brushq3.data_normal3f = NULL;
6369 loadmodel->brushq3.data_texcoordtexture2f = NULL;
6370 loadmodel->brushq3.data_texcoordlightmap2f = NULL;
6371 loadmodel->brushq3.data_color4f = NULL;
6372 // free the no longer needed triangle data
6373 loadmodel->brushq3.num_triangles = 0;
6374 if (loadmodel->brushq3.data_element3i)
6375 Mem_Free(loadmodel->brushq3.data_element3i);
6376 loadmodel->brushq3.data_element3i = NULL;
6379 Mem_Free(patchtess);
6382 static void Mod_Q3BSP_LoadModels(lump_t *l)
6386 int i, j, n, c, count;
6388 in = (q3dmodel_t *)(mod_base + l->fileofs);
6389 if (l->filelen % sizeof(*in))
6390 Host_Error("Mod_Q3BSP_LoadModels: funny lump size in %s",loadmodel->name);
6391 count = l->filelen / sizeof(*in);
6392 out = (q3dmodel_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6394 loadmodel->brushq3.data_models = out;
6395 loadmodel->brushq3.num_models = count;
6397 for (i = 0;i < count;i++, in++, out++)
6399 for (j = 0;j < 3;j++)
6401 out->mins[j] = LittleFloat(in->mins[j]);
6402 out->maxs[j] = LittleFloat(in->maxs[j]);
6404 n = LittleLong(in->firstface);
6405 c = LittleLong(in->numfaces);
6406 if (n < 0 || n + c > loadmodel->num_surfaces)
6407 Host_Error("Mod_Q3BSP_LoadModels: invalid face range %i : %i (%i faces)", n, n + c, loadmodel->num_surfaces);
6410 n = LittleLong(in->firstbrush);
6411 c = LittleLong(in->numbrushes);
6412 if (n < 0 || n + c > loadmodel->brush.num_brushes)
6413 Host_Error("Mod_Q3BSP_LoadModels: invalid brush range %i : %i (%i brushes)", n, n + c, loadmodel->brush.num_brushes);
6414 out->firstbrush = n;
6415 out->numbrushes = c;
6419 static void Mod_Q3BSP_LoadLeafBrushes(lump_t *l)
6425 in = (int *)(mod_base + l->fileofs);
6426 if (l->filelen % sizeof(*in))
6427 Host_Error("Mod_Q3BSP_LoadLeafBrushes: funny lump size in %s",loadmodel->name);
6428 count = l->filelen / sizeof(*in);
6429 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6431 loadmodel->brush.data_leafbrushes = out;
6432 loadmodel->brush.num_leafbrushes = count;
6434 for (i = 0;i < count;i++, in++, out++)
6436 n = LittleLong(*in);
6437 if (n < 0 || n >= loadmodel->brush.num_brushes)
6438 Host_Error("Mod_Q3BSP_LoadLeafBrushes: invalid brush index %i (%i brushes)", n, loadmodel->brush.num_brushes);
6443 static void Mod_Q3BSP_LoadLeafFaces(lump_t *l)
6449 in = (int *)(mod_base + l->fileofs);
6450 if (l->filelen % sizeof(*in))
6451 Host_Error("Mod_Q3BSP_LoadLeafFaces: funny lump size in %s",loadmodel->name);
6452 count = l->filelen / sizeof(*in);
6453 out = (int *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6455 loadmodel->brush.data_leafsurfaces = out;
6456 loadmodel->brush.num_leafsurfaces = count;
6458 for (i = 0;i < count;i++, in++, out++)
6460 n = LittleLong(*in);
6461 if (n < 0 || n >= loadmodel->num_surfaces)
6462 Host_Error("Mod_Q3BSP_LoadLeafFaces: invalid face index %i (%i faces)", n, loadmodel->num_surfaces);
6467 static void Mod_Q3BSP_LoadLeafs(lump_t *l)
6471 int i, j, n, c, count;
6473 in = (q3dleaf_t *)(mod_base + l->fileofs);
6474 if (l->filelen % sizeof(*in))
6475 Host_Error("Mod_Q3BSP_LoadLeafs: funny lump size in %s",loadmodel->name);
6476 count = l->filelen / sizeof(*in);
6477 out = (mleaf_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6479 loadmodel->brush.data_leafs = out;
6480 loadmodel->brush.num_leafs = count;
6482 for (i = 0;i < count;i++, in++, out++)
6486 out->clusterindex = LittleLong(in->clusterindex);
6487 out->areaindex = LittleLong(in->areaindex);
6488 for (j = 0;j < 3;j++)
6490 // yes the mins/maxs are ints
6491 out->mins[j] = LittleLong(in->mins[j]) - 1;
6492 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
6494 n = LittleLong(in->firstleafface);
6495 c = LittleLong(in->numleaffaces);
6496 if (n < 0 || n + c > loadmodel->brush.num_leafsurfaces)
6497 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafsurface range %i : %i (%i leafsurfaces)", n, n + c, loadmodel->brush.num_leafsurfaces);
6498 out->firstleafsurface = loadmodel->brush.data_leafsurfaces + n;
6499 out->numleafsurfaces = c;
6500 n = LittleLong(in->firstleafbrush);
6501 c = LittleLong(in->numleafbrushes);
6502 if (n < 0 || n + c > loadmodel->brush.num_leafbrushes)
6503 Host_Error("Mod_Q3BSP_LoadLeafs: invalid leafbrush range %i : %i (%i leafbrushes)", n, n + c, loadmodel->brush.num_leafbrushes);
6504 out->firstleafbrush = loadmodel->brush.data_leafbrushes + n;
6505 out->numleafbrushes = c;
6509 static void Mod_Q3BSP_LoadNodes(lump_t *l)
6515 in = (q3dnode_t *)(mod_base + l->fileofs);
6516 if (l->filelen % sizeof(*in))
6517 Host_Error("Mod_Q3BSP_LoadNodes: funny lump size in %s",loadmodel->name);
6518 count = l->filelen / sizeof(*in);
6520 Host_Error("Mod_Q3BSP_LoadNodes: missing BSP tree in %s",loadmodel->name);
6521 out = (mnode_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6523 loadmodel->brush.data_nodes = out;
6524 loadmodel->brush.num_nodes = count;
6526 for (i = 0;i < count;i++, in++, out++)
6529 n = LittleLong(in->planeindex);
6530 if (n < 0 || n >= loadmodel->brush.num_planes)
6531 Host_Error("Mod_Q3BSP_LoadNodes: invalid planeindex %i (%i planes)", n, loadmodel->brush.num_planes);
6532 out->plane = loadmodel->brush.data_planes + n;
6533 for (j = 0;j < 2;j++)
6535 n = LittleLong(in->childrenindex[j]);
6538 if (n >= loadmodel->brush.num_nodes)
6539 Host_Error("Mod_Q3BSP_LoadNodes: invalid child node index %i (%i nodes)", n, loadmodel->brush.num_nodes);
6540 out->children[j] = loadmodel->brush.data_nodes + n;
6545 if (n >= loadmodel->brush.num_leafs)
6546 Host_Error("Mod_Q3BSP_LoadNodes: invalid child leaf index %i (%i leafs)", n, loadmodel->brush.num_leafs);
6547 out->children[j] = (mnode_t *)(loadmodel->brush.data_leafs + n);
6550 for (j = 0;j < 3;j++)
6552 // yes the mins/maxs are ints
6553 out->mins[j] = LittleLong(in->mins[j]) - 1;
6554 out->maxs[j] = LittleLong(in->maxs[j]) + 1;
6558 // set the parent pointers
6559 Mod_Q1BSP_LoadNodes_RecursiveSetParent(loadmodel->brush.data_nodes, NULL);
6562 static void Mod_Q3BSP_LoadLightGrid(lump_t *l)
6565 q3dlightgrid_t *out;
6569 in = (q3dlightgrid_t *)(mod_base + l->fileofs);
6570 if (l->filelen % sizeof(*in))
6571 Host_Error("Mod_Q3BSP_LoadLightGrid: funny lump size in %s",loadmodel->name);
6572 loadmodel->brushq3.num_lightgrid_scale[0] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[0];
6573 loadmodel->brushq3.num_lightgrid_scale[1] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[1];
6574 loadmodel->brushq3.num_lightgrid_scale[2] = 1.0f / loadmodel->brushq3.num_lightgrid_cellsize[2];
6575 loadmodel->brushq3.num_lightgrid_imins[0] = (int)ceil(loadmodel->brushq3.data_models->mins[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
6576 loadmodel->brushq3.num_lightgrid_imins[1] = (int)ceil(loadmodel->brushq3.data_models->mins[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
6577 loadmodel->brushq3.num_lightgrid_imins[2] = (int)ceil(loadmodel->brushq3.data_models->mins[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
6578 loadmodel->brushq3.num_lightgrid_imaxs[0] = (int)floor(loadmodel->brushq3.data_models->maxs[0] * loadmodel->brushq3.num_lightgrid_scale[0]);
6579 loadmodel->brushq3.num_lightgrid_imaxs[1] = (int)floor(loadmodel->brushq3.data_models->maxs[1] * loadmodel->brushq3.num_lightgrid_scale[1]);
6580 loadmodel->brushq3.num_lightgrid_imaxs[2] = (int)floor(loadmodel->brushq3.data_models->maxs[2] * loadmodel->brushq3.num_lightgrid_scale[2]);
6581 loadmodel->brushq3.num_lightgrid_isize[0] = loadmodel->brushq3.num_lightgrid_imaxs[0] - loadmodel->brushq3.num_lightgrid_imins[0] + 1;
6582 loadmodel->brushq3.num_lightgrid_isize[1] = loadmodel->brushq3.num_lightgrid_imaxs[1] - loadmodel->brushq3.num_lightgrid_imins[1] + 1;
6583 loadmodel->brushq3.num_lightgrid_isize[2] = loadmodel->brushq3.num_lightgrid_imaxs[2] - loadmodel->brushq3.num_lightgrid_imins[2] + 1;
6584 count = loadmodel->brushq3.num_lightgrid_isize[0] * loadmodel->brushq3.num_lightgrid_isize[1] * loadmodel->brushq3.num_lightgrid_isize[2];
6585 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]);
6586 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]);
6588 // if lump is empty there is nothing to load, we can deal with that in the LightPoint code
6591 if (l->filelen < count * (int)sizeof(*in))
6593 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]);
6594 return; // ignore the grid if we cannot understand it
6596 if (l->filelen != count * (int)sizeof(*in))
6597 Con_Printf("Mod_Q3BSP_LoadLightGrid: Warning: calculated lightgrid size %i bytes does not match lump size %i\n", (int)(count * sizeof(*in)), l->filelen);
6598 out = (q3dlightgrid_t *)Mem_Alloc(loadmodel->mempool, count * sizeof(*out));
6599 loadmodel->brushq3.data_lightgrid = out;
6600 loadmodel->brushq3.num_lightgrid = count;
6601 // no swapping or validation necessary
6602 memcpy(out, in, count * (int)sizeof(*out));
6604 if(mod_q3bsp_sRGBlightmaps.integer)
6606 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
6608 // we fix the brightness consistently via lightmapscale
6612 for(i = 0; i < count; ++i)
6614 out[i].ambientrgb[0] = floor(Image_LinearFloatFromsRGB(out[i].ambientrgb[0]) * 255.0f + 0.5f);
6615 out[i].ambientrgb[1] = floor(Image_LinearFloatFromsRGB(out[i].ambientrgb[1]) * 255.0f + 0.5f);
6616 out[i].ambientrgb[2] = floor(Image_LinearFloatFromsRGB(out[i].ambientrgb[2]) * 255.0f + 0.5f);
6617 out[i].diffusergb[0] = floor(Image_LinearFloatFromsRGB(out[i].diffusergb[0]) * 255.0f + 0.5f);
6618 out[i].diffusergb[1] = floor(Image_LinearFloatFromsRGB(out[i].diffusergb[1]) * 255.0f + 0.5f);
6619 out[i].diffusergb[2] = floor(Image_LinearFloatFromsRGB(out[i].diffusergb[2]) * 255.0f + 0.5f);
6625 if(vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
6627 for(i = 0; i < count; ++i)
6629 out[i].ambientrgb[0] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].ambientrgb[0]) * 255.0f + 0.5f);
6630 out[i].ambientrgb[1] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].ambientrgb[1]) * 255.0f + 0.5f);
6631 out[i].ambientrgb[2] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].ambientrgb[2]) * 255.0f + 0.5f);
6632 out[i].diffusergb[0] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].diffusergb[0]) * 255.0f + 0.5f);
6633 out[i].diffusergb[1] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].diffusergb[1]) * 255.0f + 0.5f);
6634 out[i].diffusergb[2] = floor(Image_sRGBFloatFromLinear_Lightmap(out[i].diffusergb[2]) * 255.0f + 0.5f);
6645 static void Mod_Q3BSP_LoadPVS(lump_t *l)
6650 if (l->filelen == 0)
6653 // unvised maps often have cluster indices even without pvs, so check
6654 // leafs to find real number of clusters
6655 loadmodel->brush.num_pvsclusters = 1;
6656 for (i = 0;i < loadmodel->brush.num_leafs;i++)
6657 loadmodel->brush.num_pvsclusters = max(loadmodel->brush.num_pvsclusters, loadmodel->brush.data_leafs[i].clusterindex + 1);
6660 loadmodel->brush.num_pvsclusterbytes = (loadmodel->brush.num_pvsclusters + 7) / 8;
6661 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
6662 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
6663 memset(loadmodel->brush.data_pvsclusters, 0xFF, totalchains);
6667 in = (q3dpvs_t *)(mod_base + l->fileofs);
6669 Host_Error("Mod_Q3BSP_LoadPVS: funny lump size in %s",loadmodel->name);
6671 loadmodel->brush.num_pvsclusters = LittleLong(in->numclusters);
6672 loadmodel->brush.num_pvsclusterbytes = LittleLong(in->chainlength);
6673 if (loadmodel->brush.num_pvsclusterbytes < ((loadmodel->brush.num_pvsclusters + 7) / 8))
6674 Host_Error("Mod_Q3BSP_LoadPVS: (chainlength = %i) < ((numclusters = %i) + 7) / 8", loadmodel->brush.num_pvsclusterbytes, loadmodel->brush.num_pvsclusters);
6675 totalchains = loadmodel->brush.num_pvsclusterbytes * loadmodel->brush.num_pvsclusters;
6676 if (l->filelen < totalchains + (int)sizeof(*in))
6677 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);
6679 loadmodel->brush.data_pvsclusters = (unsigned char *)Mem_Alloc(loadmodel->mempool, totalchains);
6680 memcpy(loadmodel->brush.data_pvsclusters, (unsigned char *)(in + 1), totalchains);
6683 static void Mod_Q3BSP_LightPoint(dp_model_t *model, const vec3_t p, vec3_t ambientcolor, vec3_t diffusecolor, vec3_t diffusenormal)
6685 int i, j, k, index[3];
6686 float transformed[3], blend1, blend2, blend, stylescale = 1;
6687 q3dlightgrid_t *a, *s;
6689 // scale lighting by lightstyle[0] so that darkmode in dpmod works properly
6690 // LadyHavoc: FIXME: is this true?
6691 stylescale = 1; // added while render
6692 //stylescale = r_refdef.scene.rtlightstylevalue[0];
6694 if (!model->brushq3.num_lightgrid)
6696 ambientcolor[0] = stylescale;
6697 ambientcolor[1] = stylescale;
6698 ambientcolor[2] = stylescale;
6702 Matrix4x4_Transform(&model->brushq3.num_lightgrid_indexfromworld, p, transformed);
6703 //Matrix4x4_Print(&model->brushq3.num_lightgrid_indexfromworld);
6704 //Con_Printf("%f %f %f transformed %f %f %f clamped ", p[0], p[1], p[2], transformed[0], transformed[1], transformed[2]);
6705 transformed[0] = bound(0, transformed[0], model->brushq3.num_lightgrid_isize[0] - 1);
6706 transformed[1] = bound(0, transformed[1], model->brushq3.num_lightgrid_isize[1] - 1);
6707 transformed[2] = bound(0, transformed[2], model->brushq3.num_lightgrid_isize[2] - 1);
6708 index[0] = (int)floor(transformed[0]);
6709 index[1] = (int)floor(transformed[1]);
6710 index[2] = (int)floor(transformed[2]);
6711 //Con_Printf("%f %f %f index %i %i %i:\n", transformed[0], transformed[1], transformed[2], index[0], index[1], index[2]);
6713 // now lerp the values
6714 VectorClear(diffusenormal);
6715 a = &model->brushq3.data_lightgrid[(index[2] * model->brushq3.num_lightgrid_isize[1] + index[1]) * model->brushq3.num_lightgrid_isize[0] + index[0]];
6716 for (k = 0;k < 2;k++)
6718 blend1 = (k ? (transformed[2] - index[2]) : (1 - (transformed[2] - index[2])));
6719 if (blend1 < 0.001f || index[2] + k >= model->brushq3.num_lightgrid_isize[2])
6721 for (j = 0;j < 2;j++)
6723 blend2 = blend1 * (j ? (transformed[1] - index[1]) : (1 - (transformed[1] - index[1])));
6724 if (blend2 < 0.001f || index[1] + j >= model->brushq3.num_lightgrid_isize[1])
6726 for (i = 0;i < 2;i++)
6728 blend = blend2 * (i ? (transformed[0] - index[0]) : (1 - (transformed[0] - index[0]))) * stylescale;
6729 if (blend < 0.001f || index[0] + i >= model->brushq3.num_lightgrid_isize[0])
6731 s = a + (k * model->brushq3.num_lightgrid_isize[1] + j) * model->brushq3.num_lightgrid_isize[0] + i;
6732 VectorMA(ambientcolor, blend * (1.0f / 128.0f), s->ambientrgb, ambientcolor);
6733 VectorMA(diffusecolor, blend * (1.0f / 128.0f), s->diffusergb, diffusecolor);
6734 // this uses the mod_md3_sin table because the values are
6735 // already in the 0-255 range, the 64+ bias fetches a cosine
6736 // instead of a sine value
6737 diffusenormal[0] += blend * (mod_md3_sin[64 + s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
6738 diffusenormal[1] += blend * (mod_md3_sin[ s->diffuseyaw] * mod_md3_sin[s->diffusepitch]);
6739 diffusenormal[2] += blend * (mod_md3_sin[64 + s->diffusepitch]);
6740 //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)));
6745 // normalize the light direction before turning
6746 VectorNormalize(diffusenormal);
6747 //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]);
6750 static int Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(mnode_t *node, double p1[3], double p2[3], double endpos[3])
6753 double midf, mid[3];
6759 // find the point distances
6760 mplane_t *plane = node->plane;
6761 if (plane->type < 3)
6763 t1 = p1[plane->type] - plane->dist;
6764 t2 = p2[plane->type] - plane->dist;
6768 t1 = DotProduct (plane->normal, p1) - plane->dist;
6769 t2 = DotProduct (plane->normal, p2) - plane->dist;
6776 node = node->children[1];
6785 node = node->children[0];
6791 midf = t1 / (t1 - t2);
6792 VectorLerp(p1, midf, p2, mid);
6794 // recurse both sides, front side first
6795 // return 2 if empty is followed by solid (hit something)
6796 // do not return 2 if both are solid or both empty,
6797 // or if start is solid and end is empty
6798 // as these degenerate cases usually indicate the eye is in solid and
6799 // should see the target point anyway
6800 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ], p1, mid, endpos);
6803 ret = Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(node->children[side ^ 1], mid, p2, endpos);
6806 VectorCopy(mid, endpos);
6809 return ((mleaf_t *)node)->clusterindex < 0;
6812 static qboolean Mod_Q3BSP_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end, const vec3_t acceptmins, const vec3_t acceptmaxs)
6814 if (model->brush.submodel || mod_q3bsp_tracelineofsight_brushes.integer)
6817 model->TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK, 0, MATERIALFLAGMASK_TRANSLUCENT);
6818 return trace.fraction == 1 || BoxesOverlap(trace.endpos, trace.endpos, acceptmins, acceptmaxs);
6822 double tracestart[3], traceend[3], traceendpos[3];
6823 VectorCopy(start, tracestart);
6824 VectorCopy(end, traceend);
6825 VectorCopy(end, traceendpos);
6826 Mod_Q3BSP_TraceLineOfSight_RecursiveNodeCheck(model->brush.data_nodes, tracestart, traceend, traceendpos);
6827 return BoxesOverlap(traceendpos, traceendpos, acceptmins, acceptmaxs);
6831 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, int skipsupercontentsmask, int skipmaterialflagsmask)
6834 const bih_leaf_t *leaf;
6835 const bih_node_t *node;
6836 const colbrushf_t *brush;
6839 int nodestackpos = 0;
6840 int nodestack[1024];
6842 memset(trace, 0, sizeof(*trace));
6843 trace->fraction = 1;
6844 trace->hitsupercontentsmask = hitsupercontentsmask;
6845 trace->skipsupercontentsmask = skipsupercontentsmask;
6846 trace->skipmaterialflagsmask = skipmaterialflagsmask;
6848 bih = &model->collision_bih;
6852 nodenum = bih->rootnode;
6853 nodestack[nodestackpos++] = nodenum;
6854 while (nodestackpos)
6856 nodenum = nodestack[--nodestackpos];
6857 node = bih->nodes + nodenum;
6859 if (!BoxesOverlap(start, start, node->mins, node->maxs))
6862 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6864 axis = node->type - BIH_SPLITX;
6865 if (start[axis] >= node->frontmin)
6866 nodestack[nodestackpos++] = node->front;
6867 if (start[axis] <= node->backmax)
6868 nodestack[nodestackpos++] = node->back;
6870 else if (node->type == BIH_UNORDERED)
6872 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6874 leaf = bih->leafs + node->children[axis];
6876 if (!BoxesOverlap(start, start, leaf->mins, leaf->maxs))
6882 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
6883 Collision_TracePointBrushFloat(trace, start, brush);
6885 case BIH_COLLISIONTRIANGLE:
6886 // collision triangle - skipped because they have no volume
6888 case BIH_RENDERTRIANGLE:
6889 // render triangle - skipped because they have no volume
6897 static void Mod_CollisionBIH_TraceLineShared(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, const vec3_t start, const vec3_t end, int hitsupercontentsmask, int skipsupercontentsmask, int skipmaterialflagsmask, const bih_t *bih)
6899 const bih_leaf_t *leaf;
6900 const bih_node_t *node;
6901 const colbrushf_t *brush;
6903 const texture_t *texture;
6904 vec3_t nodebigmins, nodebigmaxs, nodestart, nodeend, sweepnodemins, sweepnodemaxs;
6905 vec_t d1, d2, d3, d4, f, nodestackline[1024][6];
6906 int axis, nodenum, nodestackpos = 0, nodestack[1024];
6911 if (VectorCompare(start, end))
6913 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
6917 nodenum = bih->rootnode;
6919 memset(trace, 0, sizeof(*trace));
6920 trace->fraction = 1;
6921 trace->hitsupercontentsmask = hitsupercontentsmask;
6922 trace->skipsupercontentsmask = skipsupercontentsmask;
6923 trace->skipmaterialflagsmask = skipmaterialflagsmask;
6926 nodestackline[nodestackpos][0] = start[0];
6927 nodestackline[nodestackpos][1] = start[1];
6928 nodestackline[nodestackpos][2] = start[2];
6929 nodestackline[nodestackpos][3] = end[0];
6930 nodestackline[nodestackpos][4] = end[1];
6931 nodestackline[nodestackpos][5] = end[2];
6932 nodestack[nodestackpos++] = nodenum;
6933 while (nodestackpos)
6935 nodenum = nodestack[--nodestackpos];
6936 node = bih->nodes + nodenum;
6937 VectorCopy(nodestackline[nodestackpos], nodestart);
6938 VectorCopy(nodestackline[nodestackpos] + 3, nodeend);
6939 sweepnodemins[0] = min(nodestart[0], nodeend[0]) - 1;
6940 sweepnodemins[1] = min(nodestart[1], nodeend[1]) - 1;
6941 sweepnodemins[2] = min(nodestart[2], nodeend[2]) - 1;
6942 sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + 1;
6943 sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + 1;
6944 sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + 1;
6945 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs) && !collision_bih_fullrecursion.integer)
6947 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
6949 // recurse children of the split
6950 axis = node->type - BIH_SPLITX;
6951 d1 = node->backmax - nodestart[axis];
6952 d2 = node->backmax - nodeend[axis];
6953 d3 = nodestart[axis] - node->frontmin;
6954 d4 = nodeend[axis] - node->frontmin;
6955 if (collision_bih_fullrecursion.integer)
6956 d1 = d2 = d3 = d4 = 1; // force full recursion
6957 switch((d1 < 0) | ((d2 < 0) << 1) | ((d3 < 0) << 2) | ((d4 < 0) << 3))
6959 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;
6960 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;
6961 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;
6962 case 3: /* <<>> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6963 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;
6964 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;
6965 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;
6966 case 7: /* <<<> */ f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6967 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;
6968 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;
6969 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;
6970 case 11: /* <<>< */ f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
6971 case 12: /* >><< */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6972 case 13: /* <><< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6973 case 14: /* ><<< */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
6974 case 15: /* <<<< */ break;
6977 else if (node->type == BIH_UNORDERED)
6979 // calculate sweep bounds for this node
6980 // copy node bounds into local variables
6981 VectorCopy(node->mins, nodebigmins);
6982 VectorCopy(node->maxs, nodebigmaxs);
6983 // clip line to this node bounds
6984 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); }
6985 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); }
6986 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); }
6987 // some of the line intersected the enlarged node box
6988 // calculate sweep bounds for this node
6989 sweepnodemins[0] = min(nodestart[0], nodeend[0]) - 1;
6990 sweepnodemins[1] = min(nodestart[1], nodeend[1]) - 1;
6991 sweepnodemins[2] = min(nodestart[2], nodeend[2]) - 1;
6992 sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + 1;
6993 sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + 1;
6994 sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + 1;
6995 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
6997 leaf = bih->leafs + node->children[axis];
6998 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, leaf->mins, leaf->maxs))
7003 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
7004 Collision_TraceLineBrushFloat(trace, start, end, brush, brush);
7006 case BIH_COLLISIONTRIANGLE:
7007 if (!mod_q3bsp_curves_collisions.integer)
7009 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
7010 texture = model->data_textures + leaf->textureindex;
7011 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);
7013 case BIH_RENDERTRIANGLE:
7014 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
7015 texture = model->data_textures + leaf->textureindex;
7016 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);
7024 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, int skipsupercontentsmask, int skipmaterialflagsmask)
7026 if (VectorCompare(start, end))
7028 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7031 Mod_CollisionBIH_TraceLineShared(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask, &model->collision_bih);
7034 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, int skipsupercontentsmask, int skipmaterialflagsmask)
7037 const bih_leaf_t *leaf;
7038 const bih_node_t *node;
7039 const colbrushf_t *brush;
7041 const texture_t *texture;
7042 vec3_t start, end, startmins, startmaxs, endmins, endmaxs, mins, maxs;
7043 vec3_t nodebigmins, nodebigmaxs, nodestart, nodeend, sweepnodemins, sweepnodemaxs;
7044 vec_t d1, d2, d3, d4, f, nodestackline[1024][6];
7045 int axis, nodenum, nodestackpos = 0, nodestack[1024];
7047 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(thisbrush_start->mins, thisbrush_start->maxs) && VectorCompare(thisbrush_end->mins, thisbrush_end->maxs))
7049 if (VectorCompare(thisbrush_start->mins, thisbrush_end->mins))
7050 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, thisbrush_start->mins, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7052 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, thisbrush_start->mins, thisbrush_end->mins, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7056 bih = &model->collision_bih;
7059 nodenum = bih->rootnode;
7061 // box trace, performed as brush trace
7062 memset(trace, 0, sizeof(*trace));
7063 trace->fraction = 1;
7064 trace->hitsupercontentsmask = hitsupercontentsmask;
7065 trace->skipsupercontentsmask = skipsupercontentsmask;
7066 trace->skipmaterialflagsmask = skipmaterialflagsmask;
7068 // calculate tracebox-like parameters for efficient culling
7069 VectorMAM(0.5f, thisbrush_start->mins, 0.5f, thisbrush_start->maxs, start);
7070 VectorMAM(0.5f, thisbrush_end->mins, 0.5f, thisbrush_end->maxs, end);
7071 VectorSubtract(thisbrush_start->mins, start, startmins);
7072 VectorSubtract(thisbrush_start->maxs, start, startmaxs);
7073 VectorSubtract(thisbrush_end->mins, end, endmins);
7074 VectorSubtract(thisbrush_end->maxs, end, endmaxs);
7075 mins[0] = min(startmins[0], endmins[0]);
7076 mins[1] = min(startmins[1], endmins[1]);
7077 mins[2] = min(startmins[2], endmins[2]);
7078 maxs[0] = max(startmaxs[0], endmaxs[0]);
7079 maxs[1] = max(startmaxs[1], endmaxs[1]);
7080 maxs[2] = max(startmaxs[2], endmaxs[2]);
7083 nodestackline[nodestackpos][0] = start[0];
7084 nodestackline[nodestackpos][1] = start[1];
7085 nodestackline[nodestackpos][2] = start[2];
7086 nodestackline[nodestackpos][3] = end[0];
7087 nodestackline[nodestackpos][4] = end[1];
7088 nodestackline[nodestackpos][5] = end[2];
7089 nodestack[nodestackpos++] = nodenum;
7090 while (nodestackpos)
7092 nodenum = nodestack[--nodestackpos];
7093 node = bih->nodes + nodenum;
7094 VectorCopy(nodestackline[nodestackpos], nodestart);
7095 VectorCopy(nodestackline[nodestackpos] + 3, nodeend);
7096 sweepnodemins[0] = min(nodestart[0], nodeend[0]) + mins[0] - 1;
7097 sweepnodemins[1] = min(nodestart[1], nodeend[1]) + mins[1] - 1;
7098 sweepnodemins[2] = min(nodestart[2], nodeend[2]) + mins[2] - 1;
7099 sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + maxs[0] + 1;
7100 sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + maxs[1] + 1;
7101 sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + maxs[2] + 1;
7102 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, node->mins, node->maxs))
7104 if (node->type <= BIH_SPLITZ && nodestackpos+2 <= 1024)
7106 // recurse children of the split
7107 axis = node->type - BIH_SPLITX;
7108 d1 = node->backmax - nodestart[axis] - mins[axis];
7109 d2 = node->backmax - nodeend[axis] - mins[axis];
7110 d3 = nodestart[axis] - node->frontmin + maxs[axis];
7111 d4 = nodeend[axis] - node->frontmin + maxs[axis];
7112 switch((d1 < 0) | ((d2 < 0) << 1) | ((d3 < 0) << 2) | ((d4 < 0) << 3))
7114 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;
7115 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;
7116 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;
7117 case 3: /* <<>> */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7118 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;
7119 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;
7120 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;
7121 case 7: /* <<<> */ f = d3 / (d3 - d4); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7122 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;
7123 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;
7124 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;
7125 case 11: /* <<>< */ f = d3 / (d3 - d4); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->front; break;
7126 case 12: /* >><< */ VectorCopy(nodestart, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
7127 case 13: /* <><< */ f = d1 / (d1 - d2); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos]); VectorCopy( nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
7128 case 14: /* ><<< */ f = d1 / (d1 - d2); VectorCopy(nodestart, nodestackline[nodestackpos]); VectorLerp(nodestart, f, nodeend, nodestackline[nodestackpos] + 3); nodestack[nodestackpos++] = node->back; break;
7129 case 15: /* <<<< */ break;
7132 else if (node->type == BIH_UNORDERED)
7134 // calculate sweep bounds for this node
7135 // copy node bounds into local variables and expand to get Minkowski Sum of the two shapes
7136 VectorSubtract(node->mins, maxs, nodebigmins);
7137 VectorSubtract(node->maxs, mins, nodebigmaxs);
7138 // clip line to this node bounds
7139 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); }
7140 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); }
7141 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); }
7142 // some of the line intersected the enlarged node box
7143 // calculate sweep bounds for this node
7144 sweepnodemins[0] = min(nodestart[0], nodeend[0]) + mins[0] - 1;
7145 sweepnodemins[1] = min(nodestart[1], nodeend[1]) + mins[1] - 1;
7146 sweepnodemins[2] = min(nodestart[2], nodeend[2]) + mins[2] - 1;
7147 sweepnodemaxs[0] = max(nodestart[0], nodeend[0]) + maxs[0] + 1;
7148 sweepnodemaxs[1] = max(nodestart[1], nodeend[1]) + maxs[1] + 1;
7149 sweepnodemaxs[2] = max(nodestart[2], nodeend[2]) + maxs[2] + 1;
7150 for (axis = 0;axis < BIH_MAXUNORDEREDCHILDREN && node->children[axis] >= 0;axis++)
7152 leaf = bih->leafs + node->children[axis];
7153 if (!BoxesOverlap(sweepnodemins, sweepnodemaxs, leaf->mins, leaf->maxs))
7158 brush = model->brush.data_brushes[leaf->itemindex].colbrushf;
7159 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
7161 case BIH_COLLISIONTRIANGLE:
7162 if (!mod_q3bsp_curves_collisions.integer)
7164 e = model->brush.data_collisionelement3i + 3*leaf->itemindex;
7165 texture = model->data_textures + leaf->textureindex;
7166 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);
7168 case BIH_RENDERTRIANGLE:
7169 e = model->surfmesh.data_element3i + 3*leaf->itemindex;
7170 texture = model->data_textures + leaf->textureindex;
7171 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);
7179 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, int skipsupercontentsmask, int skipmaterialflagsmask)
7181 colboxbrushf_t thisbrush_start, thisbrush_end;
7182 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
7184 // box trace, performed as brush trace
7185 VectorAdd(start, boxmins, boxstartmins);
7186 VectorAdd(start, boxmaxs, boxstartmaxs);
7187 VectorAdd(end, boxmins, boxendmins);
7188 VectorAdd(end, boxmaxs, boxendmaxs);
7189 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
7190 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
7191 Mod_CollisionBIH_TraceBrush(model, frameblend, skeleton, trace, &thisbrush_start.brush, &thisbrush_end.brush, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7195 int Mod_CollisionBIH_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
7198 Mod_CollisionBIH_TracePoint(model, NULL, NULL, &trace, point, 0, 0, 0);
7199 return trace.startsupercontents;
7202 qboolean Mod_CollisionBIH_TraceLineOfSight(struct model_s *model, const vec3_t start, const vec3_t end, const vec3_t acceptmins, const vec3_t acceptmaxs)
7205 Mod_CollisionBIH_TraceLine(model, NULL, NULL, &trace, start, end, SUPERCONTENTS_VISBLOCKERMASK, 0, MATERIALFLAGMASK_TRANSLUCENT);
7206 return trace.fraction == 1 || BoxesOverlap(trace.endpos, trace.endpos, acceptmins, acceptmaxs);
7209 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, int skipsupercontentsmask, int skipmaterialflagsmask)
7212 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
7214 int hitsupercontents;
7215 VectorSet(end, start[0], start[1], model->normalmins[2]);
7217 memset(trace, 0, sizeof(*trace));
7218 trace->fraction = 1;
7219 trace->hitsupercontentsmask = hitsupercontentsmask;
7220 trace->skipsupercontentsmask = skipsupercontentsmask;
7221 trace->skipmaterialflagsmask = skipmaterialflagsmask;
7223 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7224 hitsupercontents = trace->hitsupercontents;
7225 memset(trace, 0, sizeof(*trace));
7226 trace->fraction = 1;
7227 trace->hitsupercontentsmask = hitsupercontentsmask;
7228 trace->skipsupercontentsmask = skipsupercontentsmask;
7229 trace->skipmaterialflagsmask = skipmaterialflagsmask;
7230 trace->startsupercontents = hitsupercontents;
7234 int Mod_CollisionBIH_PointSuperContents_Mesh(struct model_s *model, int frame, const vec3_t start)
7237 // broken - needs to be modified to count front faces and backfaces to figure out if it is in solid
7240 VectorSet(end, start[0], start[1], model->normalmins[2]);
7241 memset(&trace, 0, sizeof(trace));
7243 trace.hitsupercontentsmask = hitsupercontentsmask;
7244 trace.skipsupercontentsmask = skipsupercontentsmask;
7245 trace.skipmaterialflagsmask = skipmaterialflagsmask;
7246 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7247 return trace.hitsupercontents;
7253 static void Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace_t *trace, dp_model_t *model, mnode_t *node, const vec3_t point, int markframe)
7258 // find which leaf the point is in
7260 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
7261 // point trace the brushes
7262 leaf = (mleaf_t *)node;
7263 for (i = 0;i < leaf->numleafbrushes;i++)
7265 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
7266 if (brush && brush->markframe != markframe && BoxesOverlap(point, point, brush->mins, brush->maxs))
7268 brush->markframe = markframe;
7269 Collision_TracePointBrushFloat(trace, point, brush);
7272 // can't do point traces on curves (they have no thickness)
7275 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)
7277 int i, startside, endside;
7278 float dist1, dist2, midfrac, mid[3], nodesegmentmins[3], nodesegmentmaxs[3];
7280 msurface_t *surface;
7283 // walk the tree until we hit a leaf, recursing for any split cases
7287 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
7289 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[0], start, end, startfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
7290 node = node->children[1];
7292 // abort if this part of the bsp tree can not be hit by this trace
7293 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
7295 plane = node->plane;
7296 // axial planes are much more common than non-axial, so an optimized
7297 // axial case pays off here
7298 if (plane->type < 3)
7300 dist1 = start[plane->type] - plane->dist;
7301 dist2 = end[plane->type] - plane->dist;
7305 dist1 = DotProduct(start, plane->normal) - plane->dist;
7306 dist2 = DotProduct(end, plane->normal) - plane->dist;
7308 startside = dist1 < 0;
7309 endside = dist2 < 0;
7310 if (startside == endside)
7312 // most of the time the line fragment is on one side of the plane
7313 node = node->children[startside];
7317 // line crosses node plane, split the line
7318 dist1 = PlaneDiff(linestart, plane);
7319 dist2 = PlaneDiff(lineend, plane);
7320 midfrac = dist1 / (dist1 - dist2);
7321 VectorLerp(linestart, midfrac, lineend, mid);
7322 // take the near side first
7323 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[startside], start, mid, startfrac, midfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
7324 // if we found an impact on the front side, don't waste time
7325 // exploring the far side
7326 if (midfrac <= trace->fraction)
7327 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, node->children[endside], mid, end, midfrac, endfrac, linestart, lineend, markframe, segmentmins, segmentmaxs);
7332 // abort if this part of the bsp tree can not be hit by this trace
7333 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
7336 nodesegmentmins[0] = min(start[0], end[0]) - 1;
7337 nodesegmentmins[1] = min(start[1], end[1]) - 1;
7338 nodesegmentmins[2] = min(start[2], end[2]) - 1;
7339 nodesegmentmaxs[0] = max(start[0], end[0]) + 1;
7340 nodesegmentmaxs[1] = max(start[1], end[1]) + 1;
7341 nodesegmentmaxs[2] = max(start[2], end[2]) + 1;
7342 // line trace the brushes
7343 leaf = (mleaf_t *)node;
7345 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
7348 for (i = 0;i < leaf->numleafbrushes;i++)
7350 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
7351 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
7353 brush->markframe = markframe;
7354 Collision_TraceLineBrushFloat(trace, linestart, lineend, brush, brush);
7357 // can't do point traces on curves (they have no thickness)
7358 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer && !VectorCompare(start, end))
7360 // line trace the curves
7361 for (i = 0;i < leaf->numleafsurfaces;i++)
7363 surface = model->data_surfaces + leaf->firstleafsurface[i];
7364 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
7366 surface->deprecatedq3collisionmarkframe = markframe;
7367 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);
7373 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)
7379 msurface_t *surface;
7381 float nodesegmentmins[3], nodesegmentmaxs[3];
7382 // walk the tree until we hit a leaf, recursing for any split cases
7386 if (!BoxesOverlap(segmentmins, segmentmaxs, node->mins, node->maxs))
7388 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
7389 node = node->children[1];
7391 // abort if this part of the bsp tree can not be hit by this trace
7392 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
7394 plane = node->plane;
7395 // axial planes are much more common than non-axial, so an optimized
7396 // axial case pays off here
7397 if (plane->type < 3)
7399 // this is an axial plane, compare bounding box directly to it and
7400 // recurse sides accordingly
7401 // recurse down node sides
7402 // use an inlined axial BoxOnPlaneSide to slightly reduce overhead
7403 //sides = BoxOnPlaneSide(nodesegmentmins, nodesegmentmaxs, plane);
7404 //sides = ((segmentmaxs[plane->type] >= plane->dist) | ((segmentmins[plane->type] < plane->dist) << 1));
7405 sides = ((segmentmaxs[plane->type] >= plane->dist) + ((segmentmins[plane->type] < plane->dist) * 2));
7409 // this is a non-axial plane, so check if the start and end boxes
7410 // are both on one side of the plane to handle 'diagonal' cases
7411 sides = BoxOnPlaneSide(thisbrush_start->mins, thisbrush_start->maxs, plane) | BoxOnPlaneSide(thisbrush_end->mins, thisbrush_end->maxs, plane);
7415 // segment crosses plane
7416 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, node->children[0], thisbrush_start, thisbrush_end, markframe, segmentmins, segmentmaxs);
7419 // if sides == 0 then the trace itself is bogus (Not A Number values),
7420 // in this case we simply pretend the trace hit nothing
7422 return; // ERROR: NAN bounding box!
7423 // take whichever side the segment box is on
7424 node = node->children[sides - 1];
7427 // abort if this part of the bsp tree can not be hit by this trace
7428 // if (!(node->combinedsupercontents & trace->hitsupercontentsmask))
7430 nodesegmentmins[0] = max(segmentmins[0], node->mins[0] - 1);
7431 nodesegmentmins[1] = max(segmentmins[1], node->mins[1] - 1);
7432 nodesegmentmins[2] = max(segmentmins[2], node->mins[2] - 1);
7433 nodesegmentmaxs[0] = min(segmentmaxs[0], node->maxs[0] + 1);
7434 nodesegmentmaxs[1] = min(segmentmaxs[1], node->maxs[1] + 1);
7435 nodesegmentmaxs[2] = min(segmentmaxs[2], node->maxs[2] + 1);
7437 leaf = (mleaf_t *)node;
7439 if (!BoxesOverlap(segmentmins, segmentmaxs, leaf->mins, leaf->maxs))
7442 for (i = 0;i < leaf->numleafbrushes;i++)
7444 brush = model->brush.data_brushes[leaf->firstleafbrush[i]].colbrushf;
7445 if (brush && brush->markframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, brush->mins, brush->maxs))
7447 brush->markframe = markframe;
7448 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, brush, brush);
7451 if (leaf->containscollisionsurfaces && mod_q3bsp_curves_collisions.integer)
7453 for (i = 0;i < leaf->numleafsurfaces;i++)
7455 surface = model->data_surfaces + leaf->firstleafsurface[i];
7456 if (surface->num_collisiontriangles && surface->deprecatedq3collisionmarkframe != markframe && BoxesOverlap(nodesegmentmins, nodesegmentmaxs, surface->mins, surface->maxs))
7458 surface->deprecatedq3collisionmarkframe = markframe;
7459 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);
7466 static int markframe = 0;
7468 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, int skipsupercontentsmask, int skipmaterialflagsmask)
7472 memset(trace, 0, sizeof(*trace));
7473 trace->fraction = 1;
7474 trace->hitsupercontentsmask = hitsupercontentsmask;
7475 trace->skipsupercontentsmask = skipsupercontentsmask;
7476 trace->skipmaterialflagsmask = skipmaterialflagsmask;
7477 if (mod_collision_bih.integer)
7478 Mod_CollisionBIH_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7479 else if (model->brush.submodel)
7481 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
7482 if (brush->colbrushf)
7483 Collision_TracePointBrushFloat(trace, start, brush->colbrushf);
7486 Mod_Q3BSP_TracePoint_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, ++markframe);
7489 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, int skipsupercontentsmask, int skipmaterialflagsmask)
7492 float segmentmins[3], segmentmaxs[3];
7493 msurface_t *surface;
7496 if (VectorCompare(start, end))
7498 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7502 memset(trace, 0, sizeof(*trace));
7503 trace->fraction = 1;
7504 trace->hitsupercontentsmask = hitsupercontentsmask;
7505 trace->skipsupercontentsmask = skipsupercontentsmask;
7506 trace->skipmaterialflagsmask = skipmaterialflagsmask;
7507 segmentmins[0] = min(start[0], end[0]) - 1;
7508 segmentmins[1] = min(start[1], end[1]) - 1;
7509 segmentmins[2] = min(start[2], end[2]) - 1;
7510 segmentmaxs[0] = max(start[0], end[0]) + 1;
7511 segmentmaxs[1] = max(start[1], end[1]) + 1;
7512 segmentmaxs[2] = max(start[2], end[2]) + 1;
7513 if (mod_collision_bih.integer)
7514 Mod_CollisionBIH_TraceLine(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7515 else if (model->brush.submodel)
7517 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
7518 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
7519 Collision_TraceLineBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
7520 if (mod_q3bsp_curves_collisions.integer)
7521 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
7522 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
7523 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);
7526 Mod_Q3BSP_TraceLine_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, 0, 1, start, end, ++markframe, segmentmins, segmentmaxs);
7529 static void Mod_Q3BSP_TraceBrush(dp_model_t *model, const frameblend_t *frameblend, const skeleton_t *skeleton, trace_t *trace, colbrushf_t *start, colbrushf_t *end, int hitsupercontentsmask, int skipsupercontentsmask, int skipmaterialflagsmask)
7531 float segmentmins[3], segmentmaxs[3];
7533 msurface_t *surface;
7536 if (mod_q3bsp_optimizedtraceline.integer && VectorCompare(start->mins, start->maxs) && VectorCompare(end->mins, end->maxs))
7538 if (VectorCompare(start->mins, end->mins))
7539 Mod_Q3BSP_TracePoint(model, frameblend, skeleton, trace, start->mins, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7541 Mod_Q3BSP_TraceLine(model, frameblend, skeleton, trace, start->mins, end->mins, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7545 // box trace, performed as brush trace
7546 memset(trace, 0, sizeof(*trace));
7547 trace->fraction = 1;
7548 trace->hitsupercontentsmask = hitsupercontentsmask;
7549 trace->skipsupercontentsmask = skipsupercontentsmask;
7550 trace->skipmaterialflagsmask = skipmaterialflagsmask;
7551 segmentmins[0] = min(start->mins[0], end->mins[0]) - 1;
7552 segmentmins[1] = min(start->mins[1], end->mins[1]) - 1;
7553 segmentmins[2] = min(start->mins[2], end->mins[2]) - 1;
7554 segmentmaxs[0] = max(start->maxs[0], end->maxs[0]) + 1;
7555 segmentmaxs[1] = max(start->maxs[1], end->maxs[1]) + 1;
7556 segmentmaxs[2] = max(start->maxs[2], end->maxs[2]) + 1;
7557 if (mod_collision_bih.integer)
7558 Mod_CollisionBIH_TraceBrush(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7559 else if (model->brush.submodel)
7561 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
7562 if (brush->colbrushf && BoxesOverlap(segmentmins, segmentmaxs, brush->colbrushf->mins, brush->colbrushf->maxs))
7563 Collision_TraceBrushBrushFloat(trace, start, end, brush->colbrushf, brush->colbrushf);
7564 if (mod_q3bsp_curves_collisions.integer)
7565 for (i = 0, surface = model->data_surfaces + model->firstmodelsurface;i < model->nummodelsurfaces;i++, surface++)
7566 if (surface->num_collisiontriangles && BoxesOverlap(segmentmins, segmentmaxs, surface->mins, surface->maxs))
7567 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);
7570 Mod_Q3BSP_TraceBrush_RecursiveBSPNode(trace, model, model->brush.data_nodes, start, end, ++markframe, segmentmins, segmentmaxs);
7573 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, int skipsupercontentsmask, int skipmaterialflagsmask)
7575 colboxbrushf_t thisbrush_start, thisbrush_end;
7576 vec3_t boxstartmins, boxstartmaxs, boxendmins, boxendmaxs;
7578 // box trace, performed as brush trace
7579 VectorAdd(start, boxmins, boxstartmins);
7580 VectorAdd(start, boxmaxs, boxstartmaxs);
7581 VectorAdd(end, boxmins, boxendmins);
7582 VectorAdd(end, boxmaxs, boxendmaxs);
7583 Collision_BrushForBox(&thisbrush_start, boxstartmins, boxstartmaxs, 0, 0, NULL);
7584 Collision_BrushForBox(&thisbrush_end, boxendmins, boxendmaxs, 0, 0, NULL);
7585 Mod_Q3BSP_TraceBrush(model, frameblend, skeleton, trace, &thisbrush_start.brush, &thisbrush_end.brush, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask);
7588 static int Mod_Q3BSP_PointSuperContents(struct model_s *model, int frame, const vec3_t point)
7591 int supercontents = 0;
7593 if (mod_collision_bih.integer)
7595 supercontents = Mod_CollisionBIH_PointSuperContents(model, frame, point);
7597 // test if the point is inside each brush
7598 else if (model->brush.submodel)
7600 // submodels are effectively one leaf
7601 for (i = 0, brush = model->brush.data_brushes + model->firstmodelbrush;i < model->nummodelbrushes;i++, brush++)
7602 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
7603 supercontents |= brush->colbrushf->supercontents;
7607 mnode_t *node = model->brush.data_nodes;
7609 // find which leaf the point is in
7611 node = node->children[(node->plane->type < 3 ? point[node->plane->type] : DotProduct(point, node->plane->normal)) < node->plane->dist];
7612 leaf = (mleaf_t *)node;
7613 // now check the brushes in the leaf
7614 for (i = 0;i < leaf->numleafbrushes;i++)
7616 brush = model->brush.data_brushes + leaf->firstleafbrush[i];
7617 if (brush->colbrushf && Collision_PointInsideBrushFloat(point, brush->colbrushf))
7618 supercontents |= brush->colbrushf->supercontents;
7621 return supercontents;
7624 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, int skipsupercontentsmask, int skipmaterialflagsmask)
7626 Mod_CollisionBIH_TraceLineShared(model, frameblend, skeleton, trace, start, end, hitsupercontentsmask, skipsupercontentsmask, skipmaterialflagsmask, &model->render_bih);
7630 bih_t *Mod_MakeCollisionBIH(dp_model_t *model, qboolean userendersurfaces, bih_t *out)
7638 int nummodelbrushes = model->nummodelbrushes;
7639 int nummodelsurfaces = model->nummodelsurfaces;
7641 const int *collisionelement3i;
7642 const float *collisionvertex3f;
7643 const int *renderelement3i;
7644 const float *rendervertex3f;
7645 bih_leaf_t *bihleafs;
7646 bih_node_t *bihnodes;
7648 int *temp_leafsortscratch;
7649 const msurface_t *surface;
7650 const q3mbrush_t *brush;
7652 // find out how many BIH leaf nodes we need
7654 if (userendersurfaces)
7656 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7657 bihnumleafs += surface->num_triangles;
7661 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
7662 if (brush->colbrushf)
7664 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7666 if (surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS)
7667 bihnumleafs += surface->num_triangles + surface->num_collisiontriangles;
7669 bihnumleafs += surface->num_collisiontriangles;
7676 // allocate the memory for the BIH leaf nodes
7677 bihleafs = (bih_leaf_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_leaf_t) * bihnumleafs);
7679 // now populate the BIH leaf nodes
7682 // add render surfaces
7683 renderelement3i = model->surfmesh.data_element3i;
7684 rendervertex3f = model->surfmesh.data_vertex3f;
7685 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7687 for (triangleindex = 0, e = renderelement3i + 3*surface->num_firsttriangle;triangleindex < surface->num_triangles;triangleindex++, e += 3)
7689 if (!userendersurfaces && !(surface->texture->basematerialflags & MATERIALFLAG_MESHCOLLISIONS))
7691 bihleafs[bihleafindex].type = BIH_RENDERTRIANGLE;
7692 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
7693 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
7694 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firsttriangle;
7695 bihleafs[bihleafindex].mins[0] = min(rendervertex3f[3*e[0]+0], min(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) - 1;
7696 bihleafs[bihleafindex].mins[1] = min(rendervertex3f[3*e[0]+1], min(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) - 1;
7697 bihleafs[bihleafindex].mins[2] = min(rendervertex3f[3*e[0]+2], min(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) - 1;
7698 bihleafs[bihleafindex].maxs[0] = max(rendervertex3f[3*e[0]+0], max(rendervertex3f[3*e[1]+0], rendervertex3f[3*e[2]+0])) + 1;
7699 bihleafs[bihleafindex].maxs[1] = max(rendervertex3f[3*e[0]+1], max(rendervertex3f[3*e[1]+1], rendervertex3f[3*e[2]+1])) + 1;
7700 bihleafs[bihleafindex].maxs[2] = max(rendervertex3f[3*e[0]+2], max(rendervertex3f[3*e[1]+2], rendervertex3f[3*e[2]+2])) + 1;
7705 if (!userendersurfaces)
7707 // add collision brushes
7708 for (brushindex = 0, brush = model->brush.data_brushes + brushindex+model->firstmodelbrush;brushindex < nummodelbrushes;brushindex++, brush++)
7710 if (!brush->colbrushf)
7712 bihleafs[bihleafindex].type = BIH_BRUSH;
7713 bihleafs[bihleafindex].textureindex = brush->texture - model->data_textures;
7714 bihleafs[bihleafindex].surfaceindex = -1;
7715 bihleafs[bihleafindex].itemindex = brushindex+model->firstmodelbrush;
7716 VectorCopy(brush->colbrushf->mins, bihleafs[bihleafindex].mins);
7717 VectorCopy(brush->colbrushf->maxs, bihleafs[bihleafindex].maxs);
7721 // add collision surfaces
7722 collisionelement3i = model->brush.data_collisionelement3i;
7723 collisionvertex3f = model->brush.data_collisionvertex3f;
7724 for (j = 0, surface = model->data_surfaces + model->firstmodelsurface;j < nummodelsurfaces;j++, surface++)
7726 for (triangleindex = 0, e = collisionelement3i + 3*surface->num_firstcollisiontriangle;triangleindex < surface->num_collisiontriangles;triangleindex++, e += 3)
7728 bihleafs[bihleafindex].type = BIH_COLLISIONTRIANGLE;
7729 bihleafs[bihleafindex].textureindex = surface->texture - model->data_textures;
7730 bihleafs[bihleafindex].surfaceindex = surface - model->data_surfaces;
7731 bihleafs[bihleafindex].itemindex = triangleindex+surface->num_firstcollisiontriangle;
7732 bihleafs[bihleafindex].mins[0] = min(collisionvertex3f[3*e[0]+0], min(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) - 1;
7733 bihleafs[bihleafindex].mins[1] = min(collisionvertex3f[3*e[0]+1], min(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) - 1;
7734 bihleafs[bihleafindex].mins[2] = min(collisionvertex3f[3*e[0]+2], min(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) - 1;
7735 bihleafs[bihleafindex].maxs[0] = max(collisionvertex3f[3*e[0]+0], max(collisionvertex3f[3*e[1]+0], collisionvertex3f[3*e[2]+0])) + 1;
7736 bihleafs[bihleafindex].maxs[1] = max(collisionvertex3f[3*e[0]+1], max(collisionvertex3f[3*e[1]+1], collisionvertex3f[3*e[2]+1])) + 1;
7737 bihleafs[bihleafindex].maxs[2] = max(collisionvertex3f[3*e[0]+2], max(collisionvertex3f[3*e[1]+2], collisionvertex3f[3*e[2]+2])) + 1;
7743 // allocate buffers for the produced and temporary data
7744 bihmaxnodes = bihnumleafs + 1;
7745 bihnodes = (bih_node_t *)Mem_Alloc(loadmodel->mempool, sizeof(bih_node_t) * bihmaxnodes);
7746 temp_leafsort = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * bihnumleafs * 2);
7747 temp_leafsortscratch = temp_leafsort + bihnumleafs;
7750 BIH_Build(out, bihnumleafs, bihleafs, bihmaxnodes, bihnodes, temp_leafsort, temp_leafsortscratch);
7752 // we're done with the temporary data
7753 Mem_Free(temp_leafsort);
7755 // resize the BIH nodes array if it over-allocated
7756 if (out->maxnodes > out->numnodes)
7758 out->maxnodes = out->numnodes;
7759 out->nodes = (bih_node_t *)Mem_Realloc(loadmodel->mempool, out->nodes, out->numnodes * sizeof(bih_node_t));
7765 static int Mod_Q3BSP_SuperContentsFromNativeContents(int nativecontents)
7767 int supercontents = 0;
7768 if (nativecontents & CONTENTSQ3_SOLID)
7769 supercontents |= SUPERCONTENTS_SOLID;
7770 if (nativecontents & CONTENTSQ3_WATER)
7771 supercontents |= SUPERCONTENTS_WATER;
7772 if (nativecontents & CONTENTSQ3_SLIME)
7773 supercontents |= SUPERCONTENTS_SLIME;
7774 if (nativecontents & CONTENTSQ3_LAVA)
7775 supercontents |= SUPERCONTENTS_LAVA;
7776 if (nativecontents & CONTENTSQ3_BODY)
7777 supercontents |= SUPERCONTENTS_BODY;
7778 if (nativecontents & CONTENTSQ3_CORPSE)
7779 supercontents |= SUPERCONTENTS_CORPSE;
7780 if (nativecontents & CONTENTSQ3_NODROP)
7781 supercontents |= SUPERCONTENTS_NODROP;
7782 if (nativecontents & CONTENTSQ3_PLAYERCLIP)
7783 supercontents |= SUPERCONTENTS_PLAYERCLIP;
7784 if (nativecontents & CONTENTSQ3_MONSTERCLIP)
7785 supercontents |= SUPERCONTENTS_MONSTERCLIP;
7786 if (nativecontents & CONTENTSQ3_DONOTENTER)
7787 supercontents |= SUPERCONTENTS_DONOTENTER;
7788 if (nativecontents & CONTENTSQ3_BOTCLIP)
7789 supercontents |= SUPERCONTENTS_BOTCLIP;
7790 if (!(nativecontents & CONTENTSQ3_TRANSLUCENT))
7791 supercontents |= SUPERCONTENTS_OPAQUE;
7792 return supercontents;
7795 static int Mod_Q3BSP_NativeContentsFromSuperContents(int supercontents)
7797 int nativecontents = 0;
7798 if (supercontents & SUPERCONTENTS_SOLID)
7799 nativecontents |= CONTENTSQ3_SOLID;
7800 if (supercontents & SUPERCONTENTS_WATER)
7801 nativecontents |= CONTENTSQ3_WATER;
7802 if (supercontents & SUPERCONTENTS_SLIME)
7803 nativecontents |= CONTENTSQ3_SLIME;
7804 if (supercontents & SUPERCONTENTS_LAVA)
7805 nativecontents |= CONTENTSQ3_LAVA;
7806 if (supercontents & SUPERCONTENTS_BODY)
7807 nativecontents |= CONTENTSQ3_BODY;
7808 if (supercontents & SUPERCONTENTS_CORPSE)
7809 nativecontents |= CONTENTSQ3_CORPSE;
7810 if (supercontents & SUPERCONTENTS_NODROP)
7811 nativecontents |= CONTENTSQ3_NODROP;
7812 if (supercontents & SUPERCONTENTS_PLAYERCLIP)
7813 nativecontents |= CONTENTSQ3_PLAYERCLIP;
7814 if (supercontents & SUPERCONTENTS_MONSTERCLIP)
7815 nativecontents |= CONTENTSQ3_MONSTERCLIP;
7816 if (supercontents & SUPERCONTENTS_DONOTENTER)
7817 nativecontents |= CONTENTSQ3_DONOTENTER;
7818 if (supercontents & SUPERCONTENTS_BOTCLIP)
7819 nativecontents |= CONTENTSQ3_BOTCLIP;
7820 if (!(supercontents & SUPERCONTENTS_OPAQUE))
7821 nativecontents |= CONTENTSQ3_TRANSLUCENT;
7822 return nativecontents;
7825 static void Mod_Q3BSP_RecursiveFindNumLeafs(mnode_t *node)
7830 Mod_Q3BSP_RecursiveFindNumLeafs(node->children[0]);
7831 node = node->children[1];
7833 numleafs = ((mleaf_t *)node - loadmodel->brush.data_leafs) + 1;
7834 if (loadmodel->brush.num_leafs < numleafs)
7835 loadmodel->brush.num_leafs = numleafs;
7838 static void Mod_Q3BSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
7841 q3dheader_t *header;
7842 float corner[3], yawradius, modelradius;
7844 mod->modeldatatypestring = "Q3BSP";
7846 mod->type = mod_brushq3;
7847 mod->brush.ishlbsp = false;
7848 mod->brush.isbsp2rmqe = false;
7849 mod->brush.isbsp2 = false;
7850 mod->brush.isq2bsp = false;
7851 mod->brush.isq3bsp = true;
7852 mod->brush.skymasking = true;
7853 mod->numframes = 2; // although alternate textures are not supported it is annoying to complain about no such frame 1
7856 header = (q3dheader_t *)buffer;
7857 if((char *) bufferend < (char *) buffer + sizeof(q3dheader_t))
7858 Host_Error("Mod_Q3BSP_Load: %s is smaller than its header", mod->name);
7860 i = LittleLong(header->version);
7861 if (i != Q3BSPVERSION && i != Q3BSPVERSION_IG && i != Q3BSPVERSION_LIVE)
7862 Host_Error("Mod_Q3BSP_Load: %s has wrong version number (%i, should be %i)", mod->name, i, Q3BSPVERSION);
7864 mod->soundfromcenter = true;
7865 mod->TraceBox = Mod_Q3BSP_TraceBox;
7866 mod->TraceBrush = Mod_Q3BSP_TraceBrush;
7867 mod->TraceLine = Mod_Q3BSP_TraceLine;
7868 mod->TracePoint = Mod_Q3BSP_TracePoint;
7869 mod->PointSuperContents = Mod_Q3BSP_PointSuperContents;
7870 mod->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
7871 mod->brush.TraceLineOfSight = Mod_Q3BSP_TraceLineOfSight;
7872 mod->brush.SuperContentsFromNativeContents = Mod_Q3BSP_SuperContentsFromNativeContents;
7873 mod->brush.NativeContentsFromSuperContents = Mod_Q3BSP_NativeContentsFromSuperContents;
7874 mod->brush.GetPVS = Mod_Q1BSP_GetPVS;
7875 mod->brush.FatPVS = Mod_Q1BSP_FatPVS;
7876 mod->brush.BoxTouchingPVS = Mod_Q1BSP_BoxTouchingPVS;
7877 mod->brush.BoxTouchingLeafPVS = Mod_Q1BSP_BoxTouchingLeafPVS;
7878 mod->brush.BoxTouchingVisibleLeafs = Mod_Q1BSP_BoxTouchingVisibleLeafs;
7879 mod->brush.FindBoxClusters = Mod_Q1BSP_FindBoxClusters;
7880 mod->brush.LightPoint = Mod_Q3BSP_LightPoint;
7881 mod->brush.FindNonSolidLocation = Mod_Q1BSP_FindNonSolidLocation;
7882 mod->brush.AmbientSoundLevelsForPoint = NULL;
7883 mod->brush.RoundUpToHullSize = NULL;
7884 mod->brush.PointInLeaf = Mod_Q1BSP_PointInLeaf;
7885 mod->Draw = R_Q1BSP_Draw;
7886 mod->DrawDepth = R_Q1BSP_DrawDepth;
7887 mod->DrawDebug = R_Q1BSP_DrawDebug;
7888 mod->DrawPrepass = R_Q1BSP_DrawPrepass;
7889 mod->GetLightInfo = R_Q1BSP_GetLightInfo;
7890 mod->CompileShadowMap = R_Q1BSP_CompileShadowMap;
7891 mod->DrawShadowMap = R_Q1BSP_DrawShadowMap;
7892 mod->DrawLight = R_Q1BSP_DrawLight;
7894 mod_base = (unsigned char *)header;
7896 // swap all the lumps
7897 header->ident = LittleLong(header->ident);
7898 header->version = LittleLong(header->version);
7899 lumps = (header->version == Q3BSPVERSION_LIVE) ? Q3HEADER_LUMPS_LIVE : Q3HEADER_LUMPS;
7900 for (i = 0;i < lumps;i++)
7902 j = (header->lumps[i].fileofs = LittleLong(header->lumps[i].fileofs));
7903 if((char *) bufferend < (char *) buffer + j)
7904 Host_Error("Mod_Q3BSP_Load: %s has a lump that starts outside the file!", mod->name);
7905 j += (header->lumps[i].filelen = LittleLong(header->lumps[i].filelen));
7906 if((char *) bufferend < (char *) buffer + j)
7907 Host_Error("Mod_Q3BSP_Load: %s has a lump that ends outside the file!", mod->name);
7910 * NO, do NOT clear them!
7911 * they contain actual data referenced by other stuff.
7912 * Instead, before using the advertisements lump, check header->versio
7914 * Sorry, but otherwise it breaks memory of the first lump.
7915 for (i = lumps;i < Q3HEADER_LUMPS_MAX;i++)
7917 header->lumps[i].fileofs = 0;
7918 header->lumps[i].filelen = 0;
7922 mod->brush.qw_md4sum = 0;
7923 mod->brush.qw_md4sum2 = 0;
7924 for (i = 0;i < lumps;i++)
7926 if (i == Q3LUMP_ENTITIES)
7928 mod->brush.qw_md4sum ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7929 if (i == Q3LUMP_PVS || i == Q3LUMP_LEAFS || i == Q3LUMP_NODES)
7931 mod->brush.qw_md4sum2 ^= Com_BlockChecksum(mod_base + header->lumps[i].fileofs, header->lumps[i].filelen);
7933 // all this checksumming can take a while, so let's send keepalives here too
7934 CL_KeepaliveMessage(false);
7937 Mod_Q3BSP_LoadEntities(&header->lumps[Q3LUMP_ENTITIES]);
7938 Mod_Q3BSP_LoadTextures(&header->lumps[Q3LUMP_TEXTURES]);
7939 Mod_Q3BSP_LoadPlanes(&header->lumps[Q3LUMP_PLANES]);
7940 if (header->version == Q3BSPVERSION_IG)
7941 Mod_Q3BSP_LoadBrushSides_IG(&header->lumps[Q3LUMP_BRUSHSIDES]);
7943 Mod_Q3BSP_LoadBrushSides(&header->lumps[Q3LUMP_BRUSHSIDES]);
7944 Mod_Q3BSP_LoadBrushes(&header->lumps[Q3LUMP_BRUSHES]);
7945 Mod_Q3BSP_LoadEffects(&header->lumps[Q3LUMP_EFFECTS]);
7946 Mod_Q3BSP_LoadVertices(&header->lumps[Q3LUMP_VERTICES]);
7947 Mod_Q3BSP_LoadTriangles(&header->lumps[Q3LUMP_TRIANGLES]);
7948 Mod_Q3BSP_LoadLightmaps(&header->lumps[Q3LUMP_LIGHTMAPS], &header->lumps[Q3LUMP_FACES]);
7949 Mod_Q3BSP_LoadFaces(&header->lumps[Q3LUMP_FACES]);
7950 Mod_Q3BSP_LoadModels(&header->lumps[Q3LUMP_MODELS]);
7951 Mod_Q3BSP_LoadLeafBrushes(&header->lumps[Q3LUMP_LEAFBRUSHES]);
7952 Mod_Q3BSP_LoadLeafFaces(&header->lumps[Q3LUMP_LEAFFACES]);
7953 Mod_Q3BSP_LoadLeafs(&header->lumps[Q3LUMP_LEAFS]);
7954 Mod_Q3BSP_LoadNodes(&header->lumps[Q3LUMP_NODES]);
7955 Mod_Q3BSP_LoadLightGrid(&header->lumps[Q3LUMP_LIGHTGRID]);
7956 Mod_Q3BSP_LoadPVS(&header->lumps[Q3LUMP_PVS]);
7957 loadmodel->brush.numsubmodels = loadmodel->brushq3.num_models;
7959 // the MakePortals code works fine on the q3bsp data as well
7960 if (mod_bsp_portalize.integer)
7961 Mod_Q1BSP_MakePortals();
7963 // FIXME: shader alpha should replace r_wateralpha support in q3bsp
7964 loadmodel->brush.supportwateralpha = true;
7966 loadmodel->brush.num_leafs = 0;
7967 Mod_Q3BSP_RecursiveFindNumLeafs(loadmodel->brush.data_nodes);
7969 if (loadmodel->brush.numsubmodels)
7970 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
7973 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
7978 // duplicate the basic information
7979 dpsnprintf(name, sizeof(name), "*%i", i);
7980 mod = Mod_FindName(name, loadmodel->name);
7981 // copy the base model to this one
7983 // rename the clone back to its proper name
7984 strlcpy(mod->name, name, sizeof(mod->name));
7985 mod->brush.parentmodel = loadmodel;
7986 // textures and memory belong to the main model
7987 mod->texturepool = NULL;
7988 mod->mempool = NULL;
7989 mod->brush.GetPVS = NULL;
7990 mod->brush.FatPVS = NULL;
7991 mod->brush.BoxTouchingPVS = NULL;
7992 mod->brush.BoxTouchingLeafPVS = NULL;
7993 mod->brush.BoxTouchingVisibleLeafs = NULL;
7994 mod->brush.FindBoxClusters = NULL;
7995 mod->brush.LightPoint = NULL;
7996 mod->brush.AmbientSoundLevelsForPoint = NULL;
7998 mod->brush.submodel = i;
7999 if (loadmodel->brush.submodels)
8000 loadmodel->brush.submodels[i] = mod;
8002 // make the model surface list (used by shadowing/lighting)
8003 mod->firstmodelsurface = mod->brushq3.data_models[i].firstface;
8004 mod->nummodelsurfaces = mod->brushq3.data_models[i].numfaces;
8005 mod->firstmodelbrush = mod->brushq3.data_models[i].firstbrush;
8006 mod->nummodelbrushes = mod->brushq3.data_models[i].numbrushes;
8007 mod->sortedmodelsurfaces = (int *)Mem_Alloc(loadmodel->mempool, mod->nummodelsurfaces * sizeof(*mod->sortedmodelsurfaces));
8008 Mod_MakeSortedSurfaces(mod);
8010 VectorCopy(mod->brushq3.data_models[i].mins, mod->normalmins);
8011 VectorCopy(mod->brushq3.data_models[i].maxs, mod->normalmaxs);
8012 // enlarge the bounding box to enclose all geometry of this model,
8013 // because q3map2 sometimes lies (mostly to affect the lightgrid),
8014 // which can in turn mess up the farclip (as well as culling when
8015 // outside the level - an unimportant concern)
8017 //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]);
8018 for (j = 0;j < mod->nummodelsurfaces;j++)
8020 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
8021 const float *v = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
8023 if (!surface->num_vertices)
8025 for (k = 0;k < surface->num_vertices;k++, v += 3)
8027 mod->normalmins[0] = min(mod->normalmins[0], v[0]);
8028 mod->normalmins[1] = min(mod->normalmins[1], v[1]);
8029 mod->normalmins[2] = min(mod->normalmins[2], v[2]);
8030 mod->normalmaxs[0] = max(mod->normalmaxs[0], v[0]);
8031 mod->normalmaxs[1] = max(mod->normalmaxs[1], v[1]);
8032 mod->normalmaxs[2] = max(mod->normalmaxs[2], v[2]);
8035 //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]);
8036 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
8037 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
8038 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
8039 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
8040 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
8041 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
8042 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
8043 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
8044 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
8045 mod->yawmins[2] = mod->normalmins[2];
8046 mod->yawmaxs[2] = mod->normalmaxs[2];
8047 mod->radius = modelradius;
8048 mod->radius2 = modelradius * modelradius;
8050 // this gets altered below if sky or water is used
8051 mod->DrawSky = NULL;
8052 mod->DrawAddWaterPlanes = NULL;
8054 for (j = 0;j < mod->nummodelsurfaces;j++)
8055 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
8057 if (j < mod->nummodelsurfaces)
8058 mod->DrawSky = R_Q1BSP_DrawSky;
8060 for (j = 0;j < mod->nummodelsurfaces;j++)
8061 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
8063 if (j < mod->nummodelsurfaces)
8064 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
8066 Mod_MakeCollisionBIH(mod, false, &mod->collision_bih);
8067 Mod_MakeCollisionBIH(mod, true, &mod->render_bih);
8069 // generate VBOs and other shared data before cloning submodels
8074 if (mod_q3bsp_sRGBlightmaps.integer)
8076 if (vid_sRGB.integer && vid_sRGB_fallback.integer && !vid.sRGB3D)
8078 // actually we do in sRGB fallback with sRGB lightmaps: Image_sRGBFloatFromLinear_Lightmap(Image_LinearFloatFromsRGBFloat(x))
8079 // neutral point is at Image_sRGBFloatFromLinearFloat(0.5)
8080 // so we need to map Image_sRGBFloatFromLinearFloat(0.5) to 0.5
8081 // factor is 0.5 / Image_sRGBFloatFromLinearFloat(0.5)
8082 //loadmodel->lightmapscale *= 0.679942f; // fixes neutral level
8084 else // if this is NOT set, regular rendering looks right by this requirement anyway
8087 // we want color 1 to do the same as without sRGB
8088 // so, we want to map 1 to Image_LinearFloatFromsRGBFloat(2) instead of to 2
8089 loadmodel->lightmapscale *= 2.476923f; // fixes max level
8092 // neutral level 0.5 gets uploaded as sRGB and becomes Image_LinearFloatFromsRGBFloat(0.5)
8093 // we need to undo that
8094 loadmodel->lightmapscale *= 2.336f; // fixes neutral level
8098 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);
8101 void Mod_IBSP_Load(dp_model_t *mod, void *buffer, void *bufferend)
8103 int i = LittleLong(((int *)buffer)[1]);
8104 if (i == Q3BSPVERSION || i == Q3BSPVERSION_IG || i == Q3BSPVERSION_LIVE)
8105 Mod_Q3BSP_Load(mod,buffer, bufferend);
8106 else if (i == Q2BSPVERSION)
8107 Mod_Q2BSP_Load(mod,buffer, bufferend);
8109 Host_Error("Mod_IBSP_Load: unknown/unsupported version %i", i);
8112 void Mod_MAP_Load(dp_model_t *mod, void *buffer, void *bufferend)
8114 Host_Error("Mod_MAP_Load: not yet implemented");
8117 typedef struct objvertex_s
8128 static unsigned char nobsp_pvs[1] = {1};
8130 void Mod_OBJ_Load(dp_model_t *mod, void *buffer, void *bufferend)
8132 const char *textbase = (char *)buffer, *text = textbase;
8136 char materialname[MAX_QPATH];
8137 int i, j, l, numvertices, firstvertex, firsttriangle, elementindex, vertexindex, surfacevertices, surfacetriangles, surfaceelements, submodelindex = 0;
8138 int index1, index2, index3;
8139 objvertex_t vfirst, vprev, vcurrent;
8142 int numtriangles = 0;
8143 int maxtriangles = 0;
8144 objvertex_t *vertices = NULL;
8146 int maxtextures = 0, numtextures = 0, textureindex = 0;
8147 int maxv = 0, numv = 1;
8148 int maxvt = 0, numvt = 1;
8149 int maxvn = 0, numvn = 1;
8150 char *texturenames = NULL;
8151 float dist, modelradius, modelyawradius, yawradius;
8152 float *obj_v = NULL;
8153 float *obj_vt = NULL;
8154 float *obj_vn = NULL;
8158 objvertex_t *thisvertex = NULL;
8159 int vertexhashindex;
8160 int *vertexhashtable = NULL;
8161 objvertex_t *vertexhashdata = NULL;
8162 objvertex_t *vdata = NULL;
8163 int vertexhashsize = 0;
8164 int vertexhashcount = 0;
8165 skinfile_t *skinfiles = NULL;
8166 unsigned char *data = NULL;
8167 int *submodelfirstsurface;
8168 msurface_t *tempsurface;
8169 msurface_t *tempsurfaces;
8171 memset(&vfirst, 0, sizeof(vfirst));
8172 memset(&vprev, 0, sizeof(vprev));
8173 memset(&vcurrent, 0, sizeof(vcurrent));
8175 dpsnprintf(materialname, sizeof(materialname), "%s", loadmodel->name);
8177 loadmodel->modeldatatypestring = "OBJ";
8179 loadmodel->type = mod_obj;
8180 loadmodel->soundfromcenter = true;
8181 loadmodel->TraceBox = Mod_CollisionBIH_TraceBox;
8182 loadmodel->TraceBrush = Mod_CollisionBIH_TraceBrush;
8183 loadmodel->TraceLine = Mod_CollisionBIH_TraceLine;
8184 loadmodel->TracePoint = Mod_CollisionBIH_TracePoint_Mesh;
8185 loadmodel->TraceLineAgainstSurfaces = Mod_CollisionBIH_TraceLine;
8186 loadmodel->PointSuperContents = Mod_CollisionBIH_PointSuperContents_Mesh;
8187 loadmodel->brush.TraceLineOfSight = NULL;
8188 loadmodel->brush.SuperContentsFromNativeContents = NULL;
8189 loadmodel->brush.NativeContentsFromSuperContents = NULL;
8190 loadmodel->brush.GetPVS = NULL;
8191 loadmodel->brush.FatPVS = NULL;
8192 loadmodel->brush.BoxTouchingPVS = NULL;
8193 loadmodel->brush.BoxTouchingLeafPVS = NULL;
8194 loadmodel->brush.BoxTouchingVisibleLeafs = NULL;
8195 loadmodel->brush.FindBoxClusters = NULL;
8196 loadmodel->brush.LightPoint = NULL;
8197 loadmodel->brush.FindNonSolidLocation = NULL;
8198 loadmodel->brush.AmbientSoundLevelsForPoint = NULL;
8199 loadmodel->brush.RoundUpToHullSize = NULL;
8200 loadmodel->brush.PointInLeaf = NULL;
8201 loadmodel->Draw = R_Q1BSP_Draw;
8202 loadmodel->DrawDepth = R_Q1BSP_DrawDepth;
8203 loadmodel->DrawDebug = R_Q1BSP_DrawDebug;
8204 loadmodel->DrawPrepass = R_Q1BSP_DrawPrepass;
8205 loadmodel->GetLightInfo = R_Q1BSP_GetLightInfo;
8206 loadmodel->CompileShadowMap = R_Q1BSP_CompileShadowMap;
8207 loadmodel->DrawShadowMap = R_Q1BSP_DrawShadowMap;
8208 loadmodel->DrawLight = R_Q1BSP_DrawLight;
8210 skinfiles = Mod_LoadSkinFiles();
8211 if (loadmodel->numskins < 1)
8212 loadmodel->numskins = 1;
8214 // make skinscenes for the skins (no groups)
8215 loadmodel->skinscenes = (animscene_t *)Mem_Alloc(loadmodel->mempool, sizeof(animscene_t) * loadmodel->numskins);
8216 for (i = 0;i < loadmodel->numskins;i++)
8218 loadmodel->skinscenes[i].firstframe = i;
8219 loadmodel->skinscenes[i].framecount = 1;
8220 loadmodel->skinscenes[i].loop = true;
8221 loadmodel->skinscenes[i].framerate = 10;
8227 // we always have model 0, i.e. the first "submodel"
8228 loadmodel->brush.numsubmodels = 1;
8230 // parse the OBJ text now
8233 static char emptyarg[1] = "";
8238 for (linelen = 0;text[linelen] && text[linelen] != '\r' && text[linelen] != '\n';linelen++)
8239 line[linelen] = text[linelen];
8241 for (argc = 0;argc < 4;argc++)
8242 argv[argc] = emptyarg;
8245 while (*s == ' ' || *s == '\t')
8255 while (*s == ' ' || *s == '\t')
8265 if (argv[0][0] == '#')
8267 if (!strcmp(argv[0], "v"))
8271 maxv = max(maxv * 2, 1024);
8272 obj_v = (float *)Mem_Realloc(tempmempool, obj_v, maxv * sizeof(float[3]));
8274 if(mod_obj_orientation.integer)
8276 obj_v[numv*3+0] = atof(argv[1]);
8277 obj_v[numv*3+2] = atof(argv[2]);
8278 obj_v[numv*3+1] = atof(argv[3]);
8282 obj_v[numv*3+0] = atof(argv[1]);
8283 obj_v[numv*3+1] = atof(argv[2]);
8284 obj_v[numv*3+2] = atof(argv[3]);
8288 else if (!strcmp(argv[0], "vt"))
8292 maxvt = max(maxvt * 2, 1024);
8293 obj_vt = (float *)Mem_Realloc(tempmempool, obj_vt, maxvt * sizeof(float[2]));
8295 obj_vt[numvt*2+0] = atof(argv[1]);
8296 obj_vt[numvt*2+1] = 1-atof(argv[2]);
8299 else if (!strcmp(argv[0], "vn"))
8303 maxvn = max(maxvn * 2, 1024);
8304 obj_vn = (float *)Mem_Realloc(tempmempool, obj_vn, maxvn * sizeof(float[3]));
8306 if(mod_obj_orientation.integer)
8308 obj_vn[numvn*3+0] = atof(argv[1]);
8309 obj_vn[numvn*3+2] = atof(argv[2]);
8310 obj_vn[numvn*3+1] = atof(argv[3]);
8314 obj_vn[numvn*3+0] = atof(argv[1]);
8315 obj_vn[numvn*3+1] = atof(argv[2]);
8316 obj_vn[numvn*3+2] = atof(argv[3]);
8320 else if (!strcmp(argv[0], "f"))
8324 if (maxtextures <= numtextures)
8326 maxtextures = max(maxtextures * 2, 256);
8327 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
8329 textureindex = numtextures++;
8330 strlcpy(texturenames + textureindex*MAX_QPATH, loadmodel->name, MAX_QPATH);
8332 for (j = 1;j < argc;j++)
8334 index1 = atoi(argv[j]);
8335 while(argv[j][0] && argv[j][0] != '/')
8339 index2 = atoi(argv[j]);
8340 while(argv[j][0] && argv[j][0] != '/')
8344 index3 = atoi(argv[j]);
8345 // negative refers to a recent vertex
8346 // zero means not specified
8347 // positive means an absolute vertex index
8349 index1 = numv - index1;
8351 index2 = numvt - index2;
8353 index3 = numvn - index3;
8354 vcurrent.nextindex = -1;
8355 vcurrent.textureindex = textureindex;
8356 vcurrent.submodelindex = submodelindex;
8357 if (obj_v && index1 >= 0 && index1 < numv)
8358 VectorCopy(obj_v + 3*index1, vcurrent.v);
8359 if (obj_vt && index2 >= 0 && index2 < numvt)
8360 Vector2Copy(obj_vt + 2*index2, vcurrent.vt);
8361 if (obj_vn && index3 >= 0 && index3 < numvn)
8362 VectorCopy(obj_vn + 3*index3, vcurrent.vn);
8363 if (numtriangles == 0)
8365 VectorCopy(vcurrent.v, mins);
8366 VectorCopy(vcurrent.v, maxs);
8370 mins[0] = min(mins[0], vcurrent.v[0]);
8371 mins[1] = min(mins[1], vcurrent.v[1]);
8372 mins[2] = min(mins[2], vcurrent.v[2]);
8373 maxs[0] = max(maxs[0], vcurrent.v[0]);
8374 maxs[1] = max(maxs[1], vcurrent.v[1]);
8375 maxs[2] = max(maxs[2], vcurrent.v[2]);
8381 if (maxtriangles <= numtriangles)
8383 maxtriangles = max(maxtriangles * 2, 32768);
8384 vertices = (objvertex_t*)Mem_Realloc(loadmodel->mempool, vertices, maxtriangles * sizeof(objvertex_t[3]));
8386 if(mod_obj_orientation.integer)
8388 vertices[numtriangles*3+0] = vfirst;
8389 vertices[numtriangles*3+1] = vprev;
8390 vertices[numtriangles*3+2] = vcurrent;
8394 vertices[numtriangles*3+0] = vfirst;
8395 vertices[numtriangles*3+2] = vprev;
8396 vertices[numtriangles*3+1] = vcurrent;
8403 else if (!strcmp(argv[0], "o") || !strcmp(argv[0], "g"))
8405 submodelindex = atof(argv[1]);
8406 loadmodel->brush.numsubmodels = max(submodelindex + 1, loadmodel->brush.numsubmodels);
8408 else if (!strcmp(argv[0], "usemtl"))
8410 for (i = 0;i < numtextures;i++)
8411 if (!strcmp(texturenames+i*MAX_QPATH, argv[1]))
8413 if (i < numtextures)
8417 if (maxtextures <= numtextures)
8419 maxtextures = max(maxtextures * 2, 256);
8420 texturenames = (char *)Mem_Realloc(loadmodel->mempool, texturenames, maxtextures * MAX_QPATH);
8422 textureindex = numtextures++;
8423 strlcpy(texturenames + textureindex*MAX_QPATH, argv[1], MAX_QPATH);
8428 // now that we have the OBJ data loaded as-is, we can convert it
8430 // copy the model bounds, then enlarge the yaw and rotated bounds according to radius
8431 VectorCopy(mins, loadmodel->normalmins);
8432 VectorCopy(maxs, loadmodel->normalmaxs);
8433 dist = max(fabs(loadmodel->normalmins[0]), fabs(loadmodel->normalmaxs[0]));
8434 modelyawradius = max(fabs(loadmodel->normalmins[1]), fabs(loadmodel->normalmaxs[1]));
8435 modelyawradius = dist*dist+modelyawradius*modelyawradius;
8436 modelradius = max(fabs(loadmodel->normalmins[2]), fabs(loadmodel->normalmaxs[2]));
8437 modelradius = modelyawradius + modelradius * modelradius;
8438 modelyawradius = sqrt(modelyawradius);
8439 modelradius = sqrt(modelradius);
8440 loadmodel->yawmins[0] = loadmodel->yawmins[1] = -modelyawradius;
8441 loadmodel->yawmins[2] = loadmodel->normalmins[2];
8442 loadmodel->yawmaxs[0] = loadmodel->yawmaxs[1] = modelyawradius;
8443 loadmodel->yawmaxs[2] = loadmodel->normalmaxs[2];
8444 loadmodel->rotatedmins[0] = loadmodel->rotatedmins[1] = loadmodel->rotatedmins[2] = -modelradius;
8445 loadmodel->rotatedmaxs[0] = loadmodel->rotatedmaxs[1] = loadmodel->rotatedmaxs[2] = modelradius;
8446 loadmodel->radius = modelradius;
8447 loadmodel->radius2 = modelradius * modelradius;
8449 // allocate storage for triangles
8450 loadmodel->surfmesh.data_element3i = (int *)Mem_Alloc(loadmodel->mempool, numtriangles * sizeof(int[3]));
8451 // allocate vertex hash structures to build an optimal vertex subset
8452 vertexhashsize = numtriangles*2;
8453 vertexhashtable = (int *)Mem_Alloc(loadmodel->mempool, sizeof(int) * vertexhashsize);
8454 memset(vertexhashtable, 0xFF, sizeof(int) * vertexhashsize);
8455 vertexhashdata = (objvertex_t *)Mem_Alloc(loadmodel->mempool, sizeof(*vertexhashdata) * numtriangles*3);
8456 vertexhashcount = 0;
8458 // gather surface stats for assigning vertex/triangle ranges
8462 loadmodel->num_surfaces = 0;
8463 // allocate storage for the worst case number of surfaces, later we resize
8464 tempsurfaces = (msurface_t *)Mem_Alloc(loadmodel->mempool, numtextures * loadmodel->brush.numsubmodels * sizeof(msurface_t));
8465 submodelfirstsurface = (int *)Mem_Alloc(loadmodel->mempool, (loadmodel->brush.numsubmodels+1) * sizeof(int));
8466 tempsurface = tempsurfaces;
8467 for (submodelindex = 0;submodelindex < loadmodel->brush.numsubmodels;submodelindex++)
8469 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
8470 for (textureindex = 0;textureindex < numtextures;textureindex++)
8472 for (vertexindex = 0;vertexindex < numtriangles*3;vertexindex++)
8474 thisvertex = vertices + vertexindex;
8475 if (thisvertex->submodelindex == submodelindex && thisvertex->textureindex == textureindex)
8478 // skip the surface creation if there are no triangles for it
8479 if (vertexindex == numtriangles*3)
8481 // create a surface for these vertices
8482 surfacevertices = 0;
8483 surfaceelements = 0;
8484 // we hack in a texture index in the surface to be fixed up later...
8485 tempsurface->texture = (texture_t *)((size_t)textureindex);
8486 // calculate bounds as we go
8487 VectorCopy(thisvertex->v, tempsurface->mins);
8488 VectorCopy(thisvertex->v, tempsurface->maxs);
8489 for (;vertexindex < numtriangles*3;vertexindex++)
8491 thisvertex = vertices + vertexindex;
8492 if (thisvertex->submodelindex != submodelindex)
8494 if (thisvertex->textureindex != textureindex)
8496 // add vertex to surface bounds
8497 tempsurface->mins[0] = min(tempsurface->mins[0], thisvertex->v[0]);
8498 tempsurface->mins[1] = min(tempsurface->mins[1], thisvertex->v[1]);
8499 tempsurface->mins[2] = min(tempsurface->mins[2], thisvertex->v[2]);
8500 tempsurface->maxs[0] = max(tempsurface->maxs[0], thisvertex->v[0]);
8501 tempsurface->maxs[1] = max(tempsurface->maxs[1], thisvertex->v[1]);
8502 tempsurface->maxs[2] = max(tempsurface->maxs[2], thisvertex->v[2]);
8503 // add the vertex if it is not found in the merged set, and
8504 // get its index (triangle element) for the surface
8505 vertexhashindex = (unsigned int)(thisvertex->v[0] * 3571 + thisvertex->v[0] * 1777 + thisvertex->v[0] * 457) % (unsigned int)vertexhashsize;
8506 for (i = vertexhashtable[vertexhashindex];i >= 0;i = vertexhashdata[i].nextindex)
8508 vdata = vertexhashdata + i;
8509 if (vdata->submodelindex == thisvertex->submodelindex && vdata->textureindex == thisvertex->textureindex && VectorCompare(thisvertex->v, vdata->v) && VectorCompare(thisvertex->vn, vdata->vn) && Vector2Compare(thisvertex->vt, vdata->vt))
8514 i = vertexhashcount++;
8515 vdata = vertexhashdata + i;
8516 *vdata = *thisvertex;
8517 vdata->nextindex = vertexhashtable[vertexhashindex];
8518 vertexhashtable[vertexhashindex] = i;
8521 loadmodel->surfmesh.data_element3i[elementindex++] = i;
8524 surfacetriangles = surfaceelements / 3;
8525 tempsurface->num_vertices = surfacevertices;
8526 tempsurface->num_triangles = surfacetriangles;
8527 tempsurface->num_firstvertex = firstvertex;
8528 tempsurface->num_firsttriangle = firsttriangle;
8529 firstvertex += tempsurface->num_vertices;
8530 firsttriangle += tempsurface->num_triangles;
8532 loadmodel->num_surfaces++;
8535 submodelfirstsurface[submodelindex] = loadmodel->num_surfaces;
8536 numvertices = firstvertex;
8537 loadmodel->data_surfaces = (msurface_t *)Mem_Realloc(loadmodel->mempool, tempsurfaces, loadmodel->num_surfaces * sizeof(msurface_t));
8538 tempsurfaces = NULL;
8540 // allocate storage for final mesh data
8541 loadmodel->num_textures = numtextures * loadmodel->numskins;
8542 loadmodel->num_texturesperskin = numtextures;
8543 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) + numvertices * sizeof(float[14]) + loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
8544 loadmodel->brush.submodels = (dp_model_t **)data;data += loadmodel->brush.numsubmodels * sizeof(dp_model_t *);
8545 loadmodel->sortedmodelsurfaces = (int *)data;data += loadmodel->num_surfaces * sizeof(int);
8546 loadmodel->data_textures = (texture_t *)data;data += loadmodel->num_surfaces * loadmodel->numskins * sizeof(texture_t);
8547 loadmodel->surfmesh.num_vertices = numvertices;
8548 loadmodel->surfmesh.num_triangles = numtriangles;
8549 loadmodel->surfmesh.data_vertex3f = (float *)data;data += numvertices * sizeof(float[3]);
8550 loadmodel->surfmesh.data_svector3f = (float *)data;data += numvertices * sizeof(float[3]);
8551 loadmodel->surfmesh.data_tvector3f = (float *)data;data += numvertices * sizeof(float[3]);
8552 loadmodel->surfmesh.data_normal3f = (float *)data;data += numvertices * sizeof(float[3]);
8553 loadmodel->surfmesh.data_texcoordtexture2f = (float *)data;data += numvertices * sizeof(float[2]);
8554 if (loadmodel->surfmesh.num_vertices <= 65536)
8555 loadmodel->surfmesh.data_element3s = (unsigned short *)data;data += loadmodel->surfmesh.num_triangles * sizeof(unsigned short[3]);
8557 for (j = 0;j < loadmodel->surfmesh.num_vertices;j++)
8559 VectorCopy(vertexhashdata[j].v, loadmodel->surfmesh.data_vertex3f + 3*j);
8560 VectorCopy(vertexhashdata[j].vn, loadmodel->surfmesh.data_normal3f + 3*j);
8561 Vector2Copy(vertexhashdata[j].vt, loadmodel->surfmesh.data_texcoordtexture2f + 2*j);
8564 // load the textures
8565 for (textureindex = 0;textureindex < numtextures;textureindex++)
8566 Mod_BuildAliasSkinsFromSkinFiles(loadmodel->data_textures + textureindex, skinfiles, texturenames + textureindex*MAX_QPATH, texturenames + textureindex*MAX_QPATH);
8567 Mod_FreeSkinFiles(skinfiles);
8569 // set the surface textures to their real values now that we loaded them...
8570 for (i = 0;i < loadmodel->num_surfaces;i++)
8571 loadmodel->data_surfaces[i].texture = loadmodel->data_textures + (size_t)loadmodel->data_surfaces[i].texture;
8575 Mem_Free(texturenames);
8579 Mem_Free(vertexhashtable);
8580 Mem_Free(vertexhashdata);
8582 // compute all the mesh information that was not loaded from the file
8583 if (loadmodel->surfmesh.data_element3s)
8584 for (i = 0;i < loadmodel->surfmesh.num_triangles*3;i++)
8585 loadmodel->surfmesh.data_element3s[i] = loadmodel->surfmesh.data_element3i[i];
8586 Mod_ValidateElements(loadmodel->surfmesh.data_element3i, loadmodel->surfmesh.data_element3s, loadmodel->surfmesh.num_triangles, 0, loadmodel->surfmesh.num_vertices, __FILE__, __LINE__);
8587 // generate normals if the file did not have them
8588 if (!VectorLength2(loadmodel->surfmesh.data_normal3f))
8589 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);
8590 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);
8592 // if this is a worldmodel and has no BSP tree, create a fake one for the purpose
8593 loadmodel->brush.num_visleafs = 1;
8594 loadmodel->brush.num_leafs = 1;
8595 loadmodel->brush.num_nodes = 0;
8596 loadmodel->brush.num_leafsurfaces = loadmodel->num_surfaces;
8597 loadmodel->brush.data_leafs = (mleaf_t *)Mem_Alloc(loadmodel->mempool, loadmodel->brush.num_leafs * sizeof(mleaf_t));
8598 loadmodel->brush.data_nodes = (mnode_t *)loadmodel->brush.data_leafs;
8599 loadmodel->brush.num_pvsclusters = 1;
8600 loadmodel->brush.num_pvsclusterbytes = 1;
8601 loadmodel->brush.data_pvsclusters = nobsp_pvs;
8602 //if (loadmodel->num_nodes) loadmodel->data_nodes = (mnode_t *)Mem_Alloc(loadmodel->mempool, loadmodel->num_nodes * sizeof(mnode_t));
8603 //loadmodel->data_leafsurfaces = (int *)Mem_Alloc(loadmodel->mempool, loadmodel->num_leafsurfaces * sizeof(int));
8604 loadmodel->brush.data_leafsurfaces = loadmodel->sortedmodelsurfaces;
8605 VectorCopy(loadmodel->normalmins, loadmodel->brush.data_leafs->mins);
8606 VectorCopy(loadmodel->normalmaxs, loadmodel->brush.data_leafs->maxs);
8607 loadmodel->brush.data_leafs->combinedsupercontents = 0; // FIXME?
8608 loadmodel->brush.data_leafs->clusterindex = 0;
8609 loadmodel->brush.data_leafs->areaindex = 0;
8610 loadmodel->brush.data_leafs->numleafsurfaces = loadmodel->brush.num_leafsurfaces;
8611 loadmodel->brush.data_leafs->firstleafsurface = loadmodel->brush.data_leafsurfaces;
8612 loadmodel->brush.data_leafs->numleafbrushes = 0;
8613 loadmodel->brush.data_leafs->firstleafbrush = NULL;
8614 loadmodel->brush.supportwateralpha = true;
8616 if (loadmodel->brush.numsubmodels)
8617 loadmodel->brush.submodels = (dp_model_t **)Mem_Alloc(loadmodel->mempool, loadmodel->brush.numsubmodels * sizeof(dp_model_t *));
8620 for (i = 0;i < loadmodel->brush.numsubmodels;i++)
8625 // duplicate the basic information
8626 dpsnprintf(name, sizeof(name), "*%i", i);
8627 mod = Mod_FindName(name, loadmodel->name);
8628 // copy the base model to this one
8630 // rename the clone back to its proper name
8631 strlcpy(mod->name, name, sizeof(mod->name));
8632 mod->brush.parentmodel = loadmodel;
8633 // textures and memory belong to the main model
8634 mod->texturepool = NULL;
8635 mod->mempool = NULL;
8636 mod->brush.GetPVS = NULL;
8637 mod->brush.FatPVS = NULL;
8638 mod->brush.BoxTouchingPVS = NULL;
8639 mod->brush.BoxTouchingLeafPVS = NULL;
8640 mod->brush.BoxTouchingVisibleLeafs = NULL;
8641 mod->brush.FindBoxClusters = NULL;
8642 mod->brush.LightPoint = NULL;
8643 mod->brush.AmbientSoundLevelsForPoint = NULL;
8645 mod->brush.submodel = i;
8646 if (loadmodel->brush.submodels)
8647 loadmodel->brush.submodels[i] = mod;
8649 // make the model surface list (used by shadowing/lighting)
8650 mod->firstmodelsurface = submodelfirstsurface[i];
8651 mod->nummodelsurfaces = submodelfirstsurface[i+1] - submodelfirstsurface[i];
8652 mod->firstmodelbrush = 0;
8653 mod->nummodelbrushes = 0;
8654 mod->sortedmodelsurfaces = loadmodel->sortedmodelsurfaces + mod->firstmodelsurface;
8655 Mod_MakeSortedSurfaces(mod);
8657 VectorClear(mod->normalmins);
8658 VectorClear(mod->normalmaxs);
8660 for (j = 0;j < mod->nummodelsurfaces;j++)
8662 const msurface_t *surface = mod->data_surfaces + j + mod->firstmodelsurface;
8663 const float *v3f = mod->surfmesh.data_vertex3f + 3 * surface->num_firstvertex;
8665 if (!surface->num_vertices)
8670 VectorCopy(v3f, mod->normalmins);
8671 VectorCopy(v3f, mod->normalmaxs);
8673 for (k = 0;k < surface->num_vertices;k++, v3f += 3)
8675 mod->normalmins[0] = min(mod->normalmins[0], v3f[0]);
8676 mod->normalmins[1] = min(mod->normalmins[1], v3f[1]);
8677 mod->normalmins[2] = min(mod->normalmins[2], v3f[2]);
8678 mod->normalmaxs[0] = max(mod->normalmaxs[0], v3f[0]);
8679 mod->normalmaxs[1] = max(mod->normalmaxs[1], v3f[1]);
8680 mod->normalmaxs[2] = max(mod->normalmaxs[2], v3f[2]);
8683 corner[0] = max(fabs(mod->normalmins[0]), fabs(mod->normalmaxs[0]));
8684 corner[1] = max(fabs(mod->normalmins[1]), fabs(mod->normalmaxs[1]));
8685 corner[2] = max(fabs(mod->normalmins[2]), fabs(mod->normalmaxs[2]));
8686 modelradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]+corner[2]*corner[2]);
8687 yawradius = sqrt(corner[0]*corner[0]+corner[1]*corner[1]);
8688 mod->rotatedmins[0] = mod->rotatedmins[1] = mod->rotatedmins[2] = -modelradius;
8689 mod->rotatedmaxs[0] = mod->rotatedmaxs[1] = mod->rotatedmaxs[2] = modelradius;
8690 mod->yawmaxs[0] = mod->yawmaxs[1] = yawradius;
8691 mod->yawmins[0] = mod->yawmins[1] = -yawradius;
8692 mod->yawmins[2] = mod->normalmins[2];
8693 mod->yawmaxs[2] = mod->normalmaxs[2];
8694 mod->radius = modelradius;
8695 mod->radius2 = modelradius * modelradius;
8697 // this gets altered below if sky or water is used
8698 mod->DrawSky = NULL;
8699 mod->DrawAddWaterPlanes = NULL;
8701 for (j = 0;j < mod->nummodelsurfaces;j++)
8702 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & MATERIALFLAG_SKY)
8704 if (j < mod->nummodelsurfaces)
8705 mod->DrawSky = R_Q1BSP_DrawSky;
8707 for (j = 0;j < mod->nummodelsurfaces;j++)
8708 if (mod->data_surfaces[j + mod->firstmodelsurface].texture->basematerialflags & (MATERIALFLAG_WATERSHADER | MATERIALFLAG_REFRACTION | MATERIALFLAG_REFLECTION | MATERIALFLAG_CAMERA))
8710 if (j < mod->nummodelsurfaces)
8711 mod->DrawAddWaterPlanes = R_Q1BSP_DrawAddWaterPlanes;
8713 Mod_MakeCollisionBIH(mod, true, &mod->collision_bih);
8714 mod->render_bih = mod->collision_bih;
8716 // generate VBOs and other shared data before cloning submodels
8721 Mem_Free(submodelfirstsurface);
8723 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);